d*******m
发帖数: 211 | 1 我不是码工，出于兴趣，最近在学点python。什么 java， C++，还完全不懂。
看了这个帖子，感觉有点思路，但上面几个回帖几乎看不懂。我写了点代码，好像结果
也是对的。想麻烦各位专家给看看我python的代码。
基本思路是先把整数变成字符串列表，再建一个新列表，然后从右往左比较，比较结束
后再把数列变成整数输出。
这样做有没有什么问题？
import copy
def dct(number):
listNumber = list(str(number))
output = copy.copy(listNumber)
for i in range(len(listNumber)-1,-1,-1):
if int(listNumber[i]) == 3 or int(listNumber[i]) == 5:
output[i] = int(listNumber[i])
else:
for l in range(i,len(listNumber)):
... 阅读全帖 |
|
W***n
发帖数: 11530 | 2 OPEC is at war - and it's sending shockwaves around the world
By Matt Egan @mattmegan5
Crude truth behind oil's global boom
OPEC is broken.
Oil prices fell below $40 a barrel on Friday after a 7-hour OPEC meeting in
Vienna highlighted the deep divide within the cartel.
OPEC surprised observers by failing to agree on an official output quota,
leaving production near record highs despite the massive glut keeping prices
low.
"The cartel is basically broken," said Matthew Smith, director of commod... 阅读全帖 |
|
g*******s
发帖数: 59 | 3 friend ostream & operator <<(ostream &output, const Complex &rhs)
{
output<<"("<
return output;
}
can compile and run well;
however if inside class define
friend ostream & operator <<(ostream &output, const Complex &rhs);
outside class
template
ostream & operator <<(ostream &output, const Complex &rhs)
{
output<<"("<
return output;
}
ERROR:
main.obj : error LNK2019: unresolved external symbol |
|
X****r
发帖数: 3557 | 4 右边第一行应该是1->2，不是1->1吧。
我不懂perl，不过这个程序实在简单，用C写一个也就几行：
int expand(int input[], int output[][2], int start) {
int branch, end = start + 1;
for (branch = 0; branch < input[start]; ++branch) {
output[start][branch] = end;
end = expand(input, output, end);
}
return end;
}
验证程序：
#include
#include
#define MAX 100
int main(int argc, char *argv[]) {
int input[MAX], output[MAX][2] = {0};
int i;
for (i = 1; i < argc; ++i) {
input[i] = atoi(argv[i]);
}
printf... 阅读全帖 |
|
|
m*********a
发帖数: 3299 | 6 #include
#include
char * reverseWord(char *string){
static char output[80];
char *tmp,*end=string;
int i=0;
while(*end){
while((*end!=' ')&&(*end!='.')&&(*end)) end++;
tmp=end-1;
while (string<=tmp) output[i++]=*tmp--;
if (*end==' ') {string=++end;output[i++]=' ';}
else if (*end=='.') {output[i++]='.';output[i]='\0';break;}
else {output[i]=*end;break;}
}
return output;
} |
|
k*********u
发帖数: 2897 | 7 美国拿粮食收割世界的时间应该快到了。
布局都布了10多年，差不多该收网了。
就等着天灾加把油了，一切具备了。
China to add to squeeze on world corn supply
http://finance.yahoo.com/news/china-add-squeeze-world-corn-0221
BEIJING/SINGAPORE (Reuters) - Beijing and the influential U.S. agriculture
department may have overstated China's corn crop by as much as 14 percent,
pointing to higher imports from the world's second-largest consumer of the
grain that could squeeze already tightening global supplies.
If China plugs the gap between projected and actua... 阅读全帖 |
|
M*****8
发帖数: 17722 | 8 http://www.sjsu.edu/faculty/watkins/medcartel.htm
The amount now spent on medical care by Americans is about twenty percent
more than they spend on food and about ten percent more than they spend on
housing. Some portion of the increased costs comes from the development of
new and expensive procedures, but that is only part of the story. The rise
in the cost of medical care is said to be out of control and somewhat of a
mystery. However there is really no mystery involved. It is due to the
subsi... 阅读全帖 |
|
d******a
发帖数: 32122 | 9 ☆─────────────────────────────────────☆
grasswalker (饭后百步走) 于 (Sun Apr 1 00:29:47 2012, 美东) 提到:
这个很奇妙啊
一个月几千块钱的多了去了，别人都该抢银行去了？
别跟我说啥多少年教育，妈的街上要饭的还有发过science的呢
国内大学毕业，硕士毕业不如狗的多了去了，怎么医生们不拿高薪就可以昧着良心？
☆─────────────────────────────────────☆
ibmgoog (终极winner米帝万岁) 于 (Sun Apr 1 00:50:03 2012, 美东) 提到:
你也是民运老将了
你不明白么？
这个世界，各个行业都捏着把刀，每个行业的人都试图磨刀霍霍从别人那里砍下一块属
于自己的肉
医生，律师，法院，政府，都是要害
他们往这儿偏一偏，对过路人都是要命的事情
你想想，如果你要被开膛破肚了，你有胆对医生讨价还价么？你还想不想活了？ 你是
想术后1年恢复呢？还是留个终身病根？ 你跟医生打官司？你打得起么？ 人体很复杂
的，有些人就可以1年恢复，有... 阅读全帖 |
|
发帖数: 1 | 10 电路设计题。码工脑子不够，请绕行。
输入: 直流电
输出: 两组直流电，跟输入电压一样。output 1， output 2
两个控制开关switch a， switch b
switch a 开， switch b 关: output 1， output 2都输出12v，极性相同
switch a 关， switch b 开: output 1 输出极性不变，output2 输出极性反转
switch a b 都关闭: output 1 2都没有电
switch a b，不会同时都开
如何用电路实现，越简单越好。比如只用几个继电器 |
|
l*******g
发帖数: 28502 | 11 ☆─────────────────────────────────────☆
anir (炉边人似月) 于 (Tue Dec 29 12:55:27 2009, 美东) 提到:
China's Divisive Development
Growing Urban-Rural Inequality Bodes Trouble by Joshua Levin
Disease, Vol. 23 (3) - Fall 2001 Issue
JOSHUA LEVIN is a Staff Writer at the Harvard International Review.
In an August 1999 incident reminiscent of the Cultural Revolution,
Chinese farmers rampaged through government offices and pillaged the
homes of the rich in Jiangxi province. Two thousand People’s Armed
Polic... 阅读全帖 |
|
h****2
发帖数: 69 | 12 看起来不错啊~~
新的2.0T变成225hp 258lbft..多了个3.0T 272hp 295lbft.
更多图片在此：
http://audiusanews.com/imagegallery/view/list/20/79/Q5
2013 Q5 2.0T跟2013 X3 28i比起来哪个更好啊？
Apr 25, 2012 , INGOLSTADT, Germany
High-performance SUV with many talents – the updated Audi Q5
- Completely updated Q5 model series
- New engine-transmission pairings are up to 15 percent more efficient
- Audi connect services set new benchmark for infotainment
Sporty, spacious, comfortable and multifunctional – the Audi Q5 has a
versatile and ... 阅读全帖 |
|
i****x
发帖数: 17565 | 13 有道理就讲出来，吐一句显得自己的能耐然后又把剩下的咽回去太没意思。
我是不懂电子控制，不过基本原理是错不了的，下面是wiki上的介绍，你可以看看我说
的对不对。
Many high-performance engines are designed to operate with a high maximum
compression, and thus demand fuels of higher octane. A common misconception
is that power output or fuel efficiency can be improved by burning fuel of
higher octane than that specified by the engine manufacturer. The power
output of an engine depends in part on the energy density of the fuel being
burnt. Fuels of different octane ratings may h... 阅读全帖 |
|
l*****l
发帖数: 1525 | 14 折腾了好几天，终于用上新的mixer了，鸡冻。
顺便随手写两句攒卡拉ok系统的感受吧，供版上卡拉ok爱好者参考，尤其是像俺这样滴新手。
有不对的地方欢迎指正，砖家请绕道，俺怕疼。。。
现有karaoke配置如下，
音箱─卡拉ok界口碑相传的Bose 301V，$300+（无源音箱，需接receiver）
缺点：比同等性能的箱子价格要高出一截
优点：经久耐用，皮实耐操，基本不用担心吼的太猛容易烧箱的问题。曾经一次被俺家顽皮的猫咪把音箱从一米高的台子上哐当一下蹭掉到水泥地上，啥事没有。或许也只是个例，家中有猫的请勿模仿。
receiver─普通的2.0的receiver，$100刀左右，唱K的话足够了。
mic─Shure SM58 $100 + Beta 58A $159
原先手头上有一只SM58，插在以前的烂mixer上总觉得马力不足，声音总是很小很闷，还不如山寨的话筒吼的开，都开始怀疑是不是买到假货了。为此还专门发信给Amazon上的卖家，并以死相威胁，客服很快给我回复，表示愿意以死表清白。于是我就不再怀疑了。
后来看版上有人力荐Beta 58A，一咬牙，一狠心，再一跺脚，下了个蛋试... 阅读全帖 |
|
w******i
发帖数: 1476 | 15 SAS Interview Questions from http://www.sconsig.com/
Very Basic
What SAS statements would you code to read an external raw data file to a DATA
step?
How do you read in the variables that you need?
Are you familiar with special input delimiters? How are they used?
If reading a variable length file with fixed input, how would you prevent SAS
from reading the next record if the last variable didn't have a value?
What is the difference between an informat and a format? Name three informats
or format... 阅读全帖 |
|
r****o
发帖数: 1950 | 16 这道题我的想法是
先排序，假定某字符串排序后是str[]=ABBCCCDDEFF
设一个output[]，和一个变量index=0
i=0..len-1
str[0]可以放在output[0]
对于每个字符str[i], i=1..len-1
判断是否与str[i-1]重复，
if 不重复, 则看output[i]是否为空，若空则放str[i], 否则往output[]后找第一个
非空位置放str[i];
if 重复, 则看output[i+N]是否为空，若空则放str[i]，否则往output[]后找第一个
非空的位置放str[i]。
欢迎多多抛砖。 |
|
y*******n
发帖数: 129 | 17 store list of words in hashtable
key: signature
value: list of words with the same signature.
recurse on input to find solution
code:
typedef std::map > Dict;
typedef std::map >::iterator DictIter;
void descramble(const std::string& input, std::string& output, Dict& dict) {
if (input.empty()) {
std::cout << output << std::endl;
} else {
for (size_t i=1; i<=input.size(); i++) {
std::string ... 阅读全帖 |
|
e***n
发帖数: 42 | 18 既然是样题，希望能公开讨论一下：这道题像careercup书上Hanoi Tower的一个变形：
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topmost disc of any o... 阅读全帖 |
|
l*********8
发帖数: 4642 | 19 这个题目很容易出错啊。
我写在纸上的程序好几个bugs。
加上在电脑的调试修改的时间，我总共花了两个小时才让程序基本正确（还不敢保证百分百正确,可能需要更多的测试案例）。这么慢怎么面试啊？
下面是程序（测试程序就不贴了）：
void JustifyOneLine(const vector & words, int L, int lineStart, int
& lineEnd, vector & blankNum)
{
blankNum.clear();
int lengthSum = words[lineStart].size();
for (lineEnd = lineStart+1; lineEnd < words.size() && lengthSum + 1 +
words[lineEnd].size() <= L; lineEnd++) {
lengthSum += 1 + words[lineEnd].size();
blankNum.push_back(1);
}
int ... 阅读全帖 |
|
l*********8
发帖数: 4642 | 20 这个题目很容易出错啊。
我写在纸上的程序好几个bugs。
加上在电脑的调试修改的时间，我总共花了两个小时才让程序基本正确（还不敢保证百分百正确,可能需要更多的测试案例）。这么慢怎么面试啊？
下面是程序（测试程序就不贴了）：
void JustifyOneLine(const vector & words, int L, int lineStart, int
& lineEnd, vector & blankNum)
{
blankNum.clear();
int lengthSum = words[lineStart].size();
for (lineEnd = lineStart+1; lineEnd < words.size() && lengthSum + 1 +
words[lineEnd].size() <= L; lineEnd++) {
lengthSum += 1 + words[lineEnd].size();
blankNum.push_back(1);
}
int ... 阅读全帖 |
|
h****n
发帖数: 1093 | 21 static int[] IncrementByOne(int[] input)
{
//Carry is initialized as 1 to simulate add one
int carry = 1;
int res;
int[] output;
if (input == null) return null;
for (int i = input.Length - 1; i >= 0; i--)
{
res = input[i] + carry;
carry = res > 9 ? 1 : 0;
input[i] = res % 10;
}
if (carry == 1)
{
output = new int[input.Length + 1];
for (int i = input.Length - 1; i >= 0; i--)
{
output[i + 1] = input... 阅读全帖 |
|
j******s
发帖数: 48 | 22 public ArrayList> permuteUnique(int[] num) {
Arrays.sort(num);
ArrayList> output
= new ArrayList>();
ArrayList list = new ArrayList();
boolean col[] = new boolean[num.length];
permute(output,list,col,num,0);
return output;
}
public void permute(ArrayList> output,
ArrayList list,boolean col[]... 阅读全帖 |
|
c******n
发帖数: 710 | 23 This is my solution. I think it is O(n^2)
public int threeSumClosest(int[] num, int target) {
if (num==null || num.length<3)
return 0;
Arrays.sort(num);
int output=num[0]+num[1]+num[2];
for (int i=0; i
int l=i+1;
int r=num.length-1;
while(l
int sum=num[i]+num[l]+num[r];
if (sum==target){
return target;
}else if (sum... 阅读全帖 |
|
p******9
发帖数: 47 | 24 public String findMostBeautifulString(String s){
int M = 256;
int[] count = new int[M];
boolean[] used = new boolean[M];
int num = 0;
for(int i = 0 ; i < s.length() ; i ++){
int index = s.charAt(i);
if(count[index] == 0)
num ++;
count[index] ++;
used[index] = false;
}
char[] output = new char[num];
int k = 0;
for(int i = 0 ; i < s.length(); i ++){
ch... 阅读全帖 |
|
p******9
发帖数: 47 | 25 public String findMostBeautifulString(String s){
int M = 256;
int[] count = new int[M];
boolean[] used = new boolean[M];
int num = 0;
for(int i = 0 ; i < s.length() ; i ++){
int index = s.charAt(i);
if(count[index] == 0)
num ++;
count[index] ++;
used[index] = false;
}
char[] output = new char[num];
int k = 0;
for(int i = 0 ; i < s.length(); i ++){
ch... 阅读全帖 |
|
R**y
发帖数: 72 | 26 题目如下，要求recursive 和 non recursive解法
write a program that given a 7 digit telephone number, could print all
possible combinations of letters that each number could represent.
second part: if the telephone number changes to 12 digits one
recursive 解法很清晰，建立一个字典，然后递归就好了。
iterative 解法，我就卡住了，google了一下，有一个解法如下:
private static ArrayList processOneNumber(ArrayList input, int[] phoneNum,
int currentNum) {
ArrayList output = new ArrayList();
int numberToProcess = phoneNum[currentNum];
char c;
... 阅读全帖 |
|
h********0
发帖数: 74 | 27 how about this, a java version
static int BLOCKSIZE = 4096;
/*
* 内部有个静态文件指针，只能向文件末尾移动,每次只能读取4K的block到buf里，
* 返回读取的字节数（除非到文件尾，否则总是4K）
*/
private int read4096(byte[] buf) {
//this is a fake
return Math.random() > 0.9 ? 1024 : 4096;
}
/**
* read bytes and fill in the contain of 'output'
*
* Testcases:
* 1 just want to read 3k, it < 4k, and the file is enough
* 2 just want to read 5k, 4k < it < 8k, and the file is enough
* 3 want too much, read all rem... 阅读全帖 |
|
m**********g
发帖数: 153 | 28 先dp, 然后dfs, 用dp信息剪枝.
class Solution {
void getSentence(string &s, int start, string sentence, vector &
output, unordered_set &dict, bool *breakable)
{
if(start == s.size()) {
sentence.erase(sentence.end() -1);
output.push_back(sentence);
return;
}
for(int i=start; i
if(breakable[i+1] == false) //prune here
continue;
string tmp=s.substr(start, i-start+1);
... 阅读全帖 |
|
s*****n
发帖数: 994 | 29 dp + backtracking。 之前用了hashtable能过break word I，但是过不了II，可能是
string constructor太耗时了吧
class Solution {
public:
void backTracking (const string& s, vector >&prev, int index
, vector& output){
for (int i=0; i
int prev_index = prev[index][i];
vector prev_output(0);
if (prev_index != 0)
backTracking (s, prev, prev_index, prev_output);
else
prev_output = vector (1, "");
f... 阅读全帖 |
|
t*******7
发帖数: 63 | 30 刚面完，上来给大家SHARE下。
晚打来5分钟， 上来先问RESEARCH PROJECT 暖场。
然后问一题：
给一个SEQUENCE， 给一个 window size, 求 running average.
constructor里给WINDOW SIZE， 实现一个 next(double input) interface 返回
the running average till input:
For example:
window size = 5;
input: {1,2,3,4} output: 2.5
input: {1,2,3} output: 2
input: {1,2,3,4,5} output: 3
input: {1,2,3,4,5,6} output: 4
感觉面得一般，面试官有些口音，有时听不太清。
贴上我的代码：
public class SequencePreprocessor {
private LinkedList newList = null;
// get th... 阅读全帖 |
|
a**i
发帖数: 608 | 31 阿拉伯给大家伙放了个不小的鸽子，哈哈
Doha oil producers meeting ends without an agreement
Javier E. David | @TeflonGeek
2 Hours Ago
CNBC.com
Doha, Qatar.
Justin Solomon | CNBC
Doha, Qatar.
A summit in Doha between the world's largest oil producing countries ended
without an agreement on Sunday, as country leaders failed to strike a deal
to freeze output and boost sagging crude prices.
Initially, the conference's outcome was thrown into doubt after Iran made a
last minute decision not to attend and Saudi Arabia... 阅读全帖 |
|
a*******m
发帖数: 14194 | 32 Trump真是够二的，晃点完中国，晃点沙特。
前面大张旗鼓要制裁伊朗，又声称要维持油价不能暴涨，
让沙特带领OPEC增产，以填补空间；
结果，沙特答应帮忙了，Trump有waive 伊朗的制裁，
油价直接跌了20刀。
这也太坑爹了，把沙特当傻逼了。
这回OPEC要减产了，油价要反弹了。
'Duped,' 'tricked' and 'snookered': Oil analysts say Trump fooled Saudis
into tanking crude prices
https://www.cnbc.com/2018/11/15/trump-duped-saudis-into-tanking-oil-prices-
analysts-say.html?__source=yahoo%7Cfinance%7Cheadline%7Cstory%7C&par=yahoo&
yptr=yahoo
Oil markets analysts say it appears that the Trump administration tricked
Saudi Arabia and oth... 阅读全帖 |
|
z***t
发帖数: 10817 | 33 OIL MARKETS
Fracking’s Secret Problem—Oil Wells Aren’t Producing as Much as Forecast
Data analysis reveals thousands of locations are yielding less than their
owners projected to investors; ‘illusory picture’ of prospects
The wells of some producers in the Permian Basin appear to lag behind
forecasts. ANGUS MORDANT/BLOOMBERG NEWS
85 COMMENTS
By Bradley Olson, Rebecca Elliott and Christopher M. Matthews
January 2, 2019
Link copied…
Thousands of shale wells drilled in the last five years are pumpi... 阅读全帖 |
|
t********s
发帖数: 1534 | 34 It won't burn up. Roughly speaking there is not much difference. It makes
difference only if the RCA output should be connected to a pre-amp (in this
case the volume control on CD player is bypassed). In this case, the RCA
output is stronger than headphone output.
So connecting headphone output to amp is always safe because the output is
even weaker, you can always connect your computer speakers with the audio-
output, which is also a headphone jack. |
|
f*******8
发帖数: 3612 | 35 多谢回答，我天天问，对本版没什么贡献，有点不好意思。
各位老兄多包涵。:)
两个问题。
1. 我刚意识到，其实router/switch 端口都有5分钟collision记录。
然后查了一下，确实！那个端口collision不少。这就是基础补习了，呵呵。
不过按百分比看，也没十分大。
也许我可以制造一些流量，看看collision的情况。
5 minute input rate 1468000 bits/sec, 256 packets/sec
5 minute output rate 34000 bits/sec, 14 packets/sec
3990623275 packets input, 4117882465 bytes, 0 no buffer
Received 1458967 broadcasts (0 multicast)
0 runts, 0 giants, 0 throttles
2 input errors, 1 CRC, 0 frame, 0 overrun, 0 ignored
0 watchdog, ... 阅读全帖 |
|
K*****n
发帖数: 65 | 36 Solution One:
1) Replace
fstream OUTPUT( "RESULT.dat", ios::out | ios::in );
with
fstream OUTPUT( "RESULT.dat", ios::trunc| ios::out | ios::in );
2) Replace
OUTPUT.seekg( 2*sizeof(int), ios::beg );
with
OUTPUT.seekg( 1 + 2*sizeof(int), ios::beg );
Solution Two:
Replace
fstream OUTPUT( "RESULT.dat", ios::out | ios::in );
with
fstream OUTPUT( "RESULT.dat", ios::binary | ios::trunc| ios::out | ios::in ); |
|
c*****u
发帖数: 530 | 37 编译的时候出现一大堆overfull的问题，
Overfull \vbox (174.53998pt too high) has occurred while \output is active
Overfull \vbox (7.46777pt too high) has occurred while \output is active
[1]
Overfull \vbox (185.53998pt too high) has occurred while \output is active
Overfull \vbox (7.46777pt too high) has occurred while \output is active
[2]
Overfull \vbox (186.32474pt too high) has occurred while \output is active
Overfull \vbox (7.46777pt too high) has occurred while \output is active
[3]
Overfull \vbox (186.3 |
|
j*p
发帖数: 411 | 38 攒人品，顺便回答一下 iiiir 的问题。
我们尝试过好几种不同的SNP calling的方法，包括GATK, Samtools, Varscan,
SeqGenes, 等，并且做了SNP array 作为gold standard比较各种方法的prediction
power。
从我们的经验，BWA + GATK 最好，sensitivity 和 specificity 都在95%以上。
以下是GATK 的pipeline
假设你有一个control 样品C 和一个样本样品A的pair-end sequencing，共4个文件，C
_R1.fastq, C_R2.fastq, A_R1.fastq and A_R2.fastq如何通过BWA/GATK去找样品A中
的SNPs (相对于C)
假设assembly 用的是hg19，你的BWA index 在这里：/bwa/indexes/hg19
Check this website if you have any questions:
http://seqanswers.com/wiki/How-to/exome_analysis
#s... 阅读全帖 |
|
j*p
发帖数: 411 | 39 攒人品，顺便回答一下 iiiir 的问题。
我们尝试过好几种不同的SNP calling的方法，包括GATK, Samtools, Varscan,
SeqGenes, 等，并且做了SNP array 作为gold standard比较各种方法的prediction
power。
从我们的经验，BWA + GATK 最好，sensitivity 和 specificity 都在95%以上。
以下是GATK 的pipeline
假设你有一个control 样品C 和一个样本样品A的pair-end sequencing，共4个文件，C
_R1.fastq, C_R2.fastq, A_R1.fastq and A_R2.fastq如何通过BWA/GATK去找样品A中
的SNPs (相对于C)
假设assembly 用的是hg19，你的BWA index 在这里：/bwa/indexes/hg19
Check this website if you have any questions:
http://seqanswers.com/wiki/How-to/exome_analysis
#s... 阅读全帖 |
|
s********k
发帖数: 6180 | 40 首先非常感谢帮助，我可能没有表述清楚，我再写一下吧：
flow1-1,flow2-1 是输入， 为了表示清楚，我用flow1-input,flow2-input表示吧。原
帖figure1
flow1-2,flow2-2 是输出， 为了表示清楚，我用flow1-output,flow2-output表示吧。
原帖figure2
直观来看
simi(flow2-1, flow2-2)>simi(flow1-1, flow1-1)
也就是说
simi(flow2-input, flow2-output)>simi(flow1-input, flow1-output)
.这样也是我希望得到的结果。但是我用correlation算
cor(flow2-input, flow2-output)
因为这个是时间序列，是不是直接用correlation不是很合适，那么有什么更好的度量
方法能达到我希望的结果呢？
非常感谢大家的帮助 |
|
o****o
发帖数: 8077 | 41 ZT from :
http://www.globalstatements.com/sas/jobs/technicalinterview.htm
*****************************************
SAS Technical Interview Questions
You can go into a SAS interview with more confidence if you know that you
are prepared to respond to the kind of technical questions that an
interviewer might ask you. I do not provide the specific answers here, both
because these questions can be asked in a variety of ways and because it is
not my objective to help those who have little actual int... 阅读全帖 |
|
a*i
发帖数: 1652 | 42 http://en.wikipedia.org/wiki/Design_history_file
Design History File is a compilation of documentation that describes the
design history of a finished medical device. The design history file, or DHF
, is part of regulation introduced in 1990 when the U.S. Congress passed the
Safe Medical Devices Act, which established new standards for medical
devices that can cause or contribute to the death, serious illness, or
injury of a patient.[1] Prior to this legislation, U.S. Food and Drug
Administratio... 阅读全帖 |
|
|
w*******y
发帖数: 60932 | 44 Yamaha RX-V667 A/V Receiver - RX-V667BL:
http://www.buy.com/prod/yamaha-rx-v667-a-v-receiver-90-w-rms-63
Features
Tech Features Channels 7.2
Tech Features Sound System Dolby TrueHD
Dolby Pro Logic IIx
DTS HD
DTS-ES Discrete
DTS 96/24
DTS Neo:6
Tech Features RMS Output Power 90 W
Tech Features PMPO Output Power 630 W
Tech Features HDMI Yes
Tech Features Number of Digital Optical Input 4
Tech Features Number of HDMI Input 6
Tech Features ... 阅读全帖 |
|
w*******y
发帖数: 60932 | 45 Newegg has Pioneer VSX-521-K 5.1-Channel 3D Ready A/V Receiver:
http://www.newegg.com/Product/Product.aspx?Item=N82E16882117398
for $139.99 using code EMCJJHH24
Please note, there is no video conversion, your input has to match the
output.
BrandPioneerTypeReceiverModelVSX-521-KColorBlackChannels5.1-
ChannelProcessingPower OutputPower Output Per Channel (20Hz-20kHz,.08%THD@
8ohm): 80W Power Output Per Channel (1kHz@8ohm): 110W Power Output Per
Channel (1kHz@6ohm): 125WDecoderDolby True HD Dolby D... 阅读全帖 |
|
w*******y
发帖数: 60932 | 46 Sale from amazon
As part of amazon's cyber monday sale they are selling this Sony BDP-S580
Blu-ray Disc Player for $108 with free super saver shipping and 2 day
shipping with amazon prime. Reviews seem pretty decent, and this blu-ray
player does ALOT.
Regular price: $199
Sale Price: $108
Here is some information on the Player
This is a 3D capable Blu-Ray player that has full wifi connectivity with
apps.
Product Features
Enjoy 3D Blu-ray Disc movies in Full HD 1080p--also supports standard Blu-
... 阅读全帖 |
|
w*******y
发帖数: 60932 | 47 onkyo has refurb at 20% off club member prices
must be a club member...enroll on site
new members additional discount
other units available
site says good 12/10 to 12/18 appears to be working now
HT-S6300 - 7.1-Channel Home Theater Package with iPodDock
$349 less 20% free shipping may have tax = 279.20
Link:
https://www.shoponkyo.com/index.cfm
Amplifier
# Channels 7.1
Total System Power 1200W
Power (6 ohms, 1kHz, 1%)/Ch 130W/ch x 7ch
Sub Power 290W
THX Certified -
All Discrete ... 阅读全帖 |
|
w*******y
发帖数: 60932 | 48 onkyo has refurb at 20% off club member prices
must be a club member...enroll on site
new members additional discount
other units available
site says good 12/10 to 12/18 appears to be working now
HT-S6300 - 7.1-Channel Home Theater Package with iPodDock
$349 less 20% free shipping may have tax = 279.20
Link:
https://www.shoponkyo.com/index.cfm
Amplifier
# Channels 7.1
Total System Power 1200W
Power (6 ohms, 1kHz, 1%)/Ch 130W/ch x 7ch
Sub Power 290W
THX Certified -
All Discrete Amplifier Circuitr... 阅读全帖 |
|
m**5
发帖数: 729 | 49 ENI leads Libya oil race, rebels warn Russia,China
By Svetlana Kovalyova and Emma Farge
MILAN/LONDON, Aug 22 (Reuters) - Italian oil company Eni led the charge back
into Libya on Monday as rebels swept into capital Tripoli, hailing the end
of Muammar Gaddafi's rule and warning Russian and Chinese firms of contract
revisions.
Gaddafi's fall will reopen the doors to the country with Africa's largest
oil reserves. New players such as Qatar's national oil company and trading
house Vitol are set to c... 阅读全帖 |
|
w*********g
发帖数: 30882 | 50 美国所谓的制造业回流与复苏原来又是吹出来的泡泡
来源: nWAY 于 2012-02-01 23:13:54 [档案] [博客] 旧帖] [转至博客] [给我悄悄话
] 本文已被阅读：433次
字体：调大/调小/重置 | 加入书签 | 打印 | 所有跟帖 | 加跟贴 | 查看当前最热讨
论主题
http://ablog.typepad.com/keytrendsinglobalisation/2012/01/myth.
The myth of US industrial revival
by John Ross, 31 January 2012
Currently a number of attempts are being made to claim a major revival of US
industry is taking place. For example Harold L. Sirkin, of the Boston
Consulting Group, writes: ‘A resurgence of U.S. manufacturing seems to be
in ... 阅读全帖 |
|
