发帖数: 1 | 1 http://www.natureindex.com/news-blog/ten-institutions-that-domi
1. Chinese Academy of Sciences (CAS), China
Weighted fractional count (WFC): 1357.82
Established in 1949 in Beijing, the Chinese Academy of Sciences (CAS) is the
world’s largest scientific organisation, comprising 114 institutes and 48,
500 researchers. In 2015 its scientists made the largest contribution to
high-quality research included in the index, a contribution that’s grown by
a compound annual growth rate of 6.8% since 2012. ... 阅读全帖 |
|
M******a
发帖数: 6723 | 2 【 以下文字转载自 Mod_CHN_Hist 讨论区 】
发信人: Mayingba (吳鐘學), 信区: Mod_CHN_Hist
标 题: 奉天兵工厂
发信站: BBS 未名空间站 (Sun Jan 28 20:29:57 2018, 美东)
https://wwiiafterwwii.wordpress.com/2017/04/03/mukden-arsenal-after-wwii/
Mukden Arsenal after WWII
April 3, 2017 jwh19752 Comments
(Zhang's Gate, the old entrance to Mukden Arsenal)
For people interested in Japanese firearms of WWII, the name Mukden Arsenal
is familiar. The history of the facility after Japan's defeat is less well
known. Under various names, it did surv... 阅读全帖 |
|
B*V
发帖数: 3365 | 3 美国所谓的制造业回流与复苏原来又是吹出来的泡泡
来源: 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 ... 阅读全帖 |
|
|
Z*****o
发帖数: 4090 | 5 http://www.stereophile.com/features/368/index.html
By Robert Harley • Posted: Nov 1, 1993
Not that long ago, digital audio was considered perfect if all the bits
could be stored and retrieved without data errors. If the data coming off
the disc were the same as what went on the disc, how could there be a sound-
quality difference with the same digital/analog converter? This "bits is
bits" mentality scoffs at sonic differences between CD transports, digital
interfaces, and CD tweaks. Becaus... 阅读全帖 |
|
n********y
发帖数: 66 | 6 欢迎拍砖，就用了一个 256 字节的table来检查一个数字是否出现过
#include
#include
#include
#include
char* nextpointer(char* str, int strlen)
{
char *p = str;
char *pend = str + strlen;
char count[256];
memset(count, 0, sizeof(count));
while (p < pend)
{
++count[*p];
if (count[*p] > 1)
{
return p;
}
++p;
}
return p;
}
void longestsingle(char* str, int strlen)
{
char *pstart = str;
char *pend... 阅读全帖 |
|
s*****n
发帖数: 231 | 7 cout is an object of class ostream that represents the standard output
stream.
and ostream is the base class of ofstream, which you use to output to a file.
So in A. void print(std::ostream &os);
if you pass a reference to ostream object in the print function, it's OK for
both type.
But in B.void print(std::ofstream is);
Not only you cannot output to the standard output, but also it's passed by
value, that means you make a copy of the ostream object you passed in, and
do output in that copy, whi... 阅读全帖 |
|
O******n
发帖数: 1505 | 8 size = 10
a = []
for i in range(size):
a.append(i+1)
print a
t1 = [0]*size
t2 = [0]*size
result = 1
for i in range(size):
result = result * a[i]
t[i] = result
result = 1
for i in range(size-1, -1, -1):
result = result * a[i]
t2[i] = result
output = [0]*size
for i in range(1, size-1):
output[i] = t1[i-1]*t2[i+1]
output[0] = t2[1]
output[size-1] = t1[size-2]
print output
product |
|
k*j
发帖数: 153 | 9 那次的讨论结果不知道怎么样，但我写下我当时的做法。
我面试的时候只用讲大概思路。写high level的code。
我当时的大体思路就是先把string转成word和长度。用－个stack记录pair
，碰到连续的space只记录成length=1。用一个variable len记录当前stack里所有word
length之和，
1。 当len>10的时候。check时候栈里是否只有一个word，如果是，即output整个word
到一行里（出题人的意思）。如果栈里多个word，则舍弃当前栈顶元素。然后再output
剩下的元素。还要注意这是的栈里是否有space，有则可以pad空格在中间。（这里我没太
仔细考虑，可能还需要改进）
2。 当len＝10
(a) 先check当前的word是不是空格，如果是，就把栈里的word一个个出栈，从右到左
output是的一行里。但当碰到stack里最后一个空格时，要check是否需要output多个空
格。因为出题人要求每一行的两头都必须是word，非空格。做法是check剩余要填满的
字符数是否是大于word里总和。差... 阅读全帖 |
|
b*******y
发帖数: 232 | 10 是样题，然后还是45分钟倒计时的
可以用各种语言编写
感觉这种题目，用C或者java写是不是编程时间上比不过python？
单单看题目本身也很难啊，像是hannoi，但比它难多了，不知道有什么思路？
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 who 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 ... 阅读全帖 |
|
n*s
发帖数: 752 | 11 4. telephone keyboard problem
import sys
map = {'0':'0','1':'1','2':'abc2','3':'def3','4':'ghi4','5':'jkl5','6':'mno6
','7':'pqrs7','8':'tuv8','9':'wxyz9','*':' ','#':'#'}
def translate():
print 'Please input from telephone keyboard:'
input = sys.stdin.readline().strip()
output = []
count = -1
prev = input[0]
for x in input:
if not (x in map.keys()):
return 'invalid input!'
if x == prev: # repeated input
if x == '*' or x == '0' or ... 阅读全帖 |
|
n*s
发帖数: 752 | 12 4. telephone keyboard problem
import sys
map = {'0':'0','1':'1','2':'abc2','3':'def3','4':'ghi4','5':'jkl5','6':'mno6
','7':'pqrs7','8':'tuv8','9':'wxyz9','*':' ','#':'#'}
def translate():
print 'Please input from telephone keyboard:'
input = sys.stdin.readline().strip()
output = []
count = -1
prev = input[0]
for x in input:
if not (x in map.keys()):
return 'invalid input!'
if x == prev: # repeated input
if x == '*' or x == '0' or ... 阅读全帖 |
|
l**********1
发帖数: 415 | 13 here
output[level] = i;
tryNext(output, level+1);
should be
output[level] = i;
tryNext(output, level+1);
output[level] = -1; //remove the newly placed queen |
|
t******e
发帖数: 98 | 14 来自主题: JobHunting版 - 要去面试了 这是我当年考过的面试题，可以负责的告诉你这题面试中不会再考到了，不过拿来练
coding还是很好的，topcoder上面也考过类似的问题。解法如下：
Let the input matrix be x[n][n]. The idea is to calculate two auxiliary
matrices a[n][n], where a[i][j] records the length of the all 1 horizontal
edge to the right of a[i][j], and b[n][n], where b[i][j] records the length
of the all 1 vertical edge above a[i][j]. Then the size of the largest all 1
boundary sub-square whose left bottom corner is a[i][j] is t = max{0≤t≤
min(a[i][j], b[i][j])|a[i-t+1][j]≥t and b[i][j+t-1]≥t... 阅读全帖 |
|
y******n
发帖数: 67 | 15 Given an file which consists thousands of lines. each line consists of a
string and several integers.
design an algorithm which take input of several integers and print out the
string of the line that have most matches.
input file
----------
aa 3 4 10 2
bb 9 14 15 21 3
cc 12 1024 200 3 9 4
----------
examples:
input: 3 4 10
output: aa
input: 12 3 4
output: cc
input: 3 9
output: bb
input: 3 9
output: cc
input: 3 4 12
output: cc
Thanks! |
|
w***o
发帖数: 109 | 16 来自主题: JobHunting版 - 问几道题目 int N = 100000000;
ArrayList output = new ArrayList();
output.add(1);
int[] prime = {47, 97};
int K = prime.length;
int[] index = new int[K];
int[] num = new int[K];
for (int i = 0; i < K; i++)
num[i] = output.get(0) * prime[i];
while(min < N)
{
int min = num[0];
for(int j = 0; j < K; j++)
{
if (num[j] < min)
min = num[j];
}
if (min > N)
break;
output.add(min);
for(int j = 0; j < K; j+... 阅读全帖 |
|
o******3
发帖数: 91 | 17 决定把题目跟我写的很挫的代码贴上来，有需要的同学可以来看。。。
代码可以过sample test
但是目前还不能过所有的Test
题目：
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 topm... 阅读全帖 |
|
o******3
发帖数: 91 | 18 决定把题目跟我写的很挫的代码贴上来，有需要的同学可以来看。。。
代码可以过sample test
但是目前还不能过所有的Test
题目：
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 topm... 阅读全帖 |
|
o******3
发帖数: 91 | 19 听了二爷的话，开始做hackerrank
今天被lego blocks绊住了
测试数据集可以过 但是提交数据集就超时了 虽然我用的确实是DP
下面是题目和我的代码，还望指点
You have 4 types of lego blocks, of sizes 1 * 1 * 1, 1 * 1 * 2, 1 * 1 * 3
and 1 * 1 * 4. Assume you have infinite number of blocks of each type.
You want to make a wall of height N and width M out of these blocks. The
wall should not have any holes in it. The wall you build should be one solid
structure. A solid structure means that it should not be possible to
separate the wall along any vertical line withou... 阅读全帖 |
|
b*******d
发帖数: 750 | 20 一个公司发的。感觉不容易。
－－－－－－－－－－－－－－－－－－－－－－－－－
Save Humanity(30points)
Oh!! The mankind is in trouble again.This time its a deadly disease
spreading with rate never seen before. Efficient detectors for the virus
responsible is the need of hour. You being the lead at Central Hospital need
to find a fast and reliable way to detect the 'foot-prints' of virus DNA in
that of patient.
The DNA of patient as well as of virus consist of lower case letters. Since
the data collected is raw there might be some err... 阅读全帖 |
|
a**********0
发帖数: 422 | 21 The Unix Commands
其实就是攒了一下网上的资料
# Create a new tar archive.
# the folder dirname/ is compressed into archive_name.tar
tar cvf archive_name.tar dirname/
# Extract from an existing tar archive
tar xvf archive_name.tar
# View an existing tar archive
tar tvf archive_name.tar
# Search for a given string in a file (case in-sensitive search).
grep -i "the" demo_file
# Print the matched line, along with the 3 lines after it.
grep -A 3 -i "example" demo_text
# Search for a given string in all files recur... 阅读全帖 |
|
b***e
发帖数: 1419 | 22 你这个可以, 但是有重复的，会降低算法的效率。可以改进成无重复的方法：
Output 1,
L2 - 2 // collect 2^i*3^j*5^k
L3 - 3 // collect 3^j*5^k only
L5 - 5 // collect 5^k only
Output 2, put 2*2 to L2
L2 - 4
L3 - 3
L5 - 5
Output 3, put 3*2 to L2, put 3*3 to L3
L2 - 4, 6
L3 - 9
L5 - 5
Output 4, put 4*2 to L2
L2 - 6,8
L3 - 9
L5 - 5
Output 5, put 5*2 to L2, put 5*3 to L3, put 5*5 to L5
L2 - 6,8,10
L3 - 9,15
L5 - 25
So on and so forth. This way, there won't be any repetitions and the
algorithm is precisely effective. |
|
c****a
发帖数: 50 | 23 题目有点长，求大牛赐一个漂亮点的解法
面试要求可以在eclipse等工具下完成，可以上网用google等
ProgA
System Dependencies
Components of computer systems often have dependencies--other components
that must be installed before they will function properly. These
dependencies are frequently shared by multiple components. For example, both
the TELNET client program and the FTP client program require that the TCP/
IP networking software be installed before they can operate. If you install
TCP/IP and the TELNET client program, and later decide ... 阅读全帖 |
|
d*******8
发帖数: 23 | 24 版中大多数面经都是针对北美new graduate的, 在此贡献一下本人国内找北美工作的一
些经验吧, 也算是答谢mitbbs上分享面经的朋友对我的帮助. 更希望攒攒人品能够抽到
h1b签证 :)
[背景]
国内4年工作经验. 硕士毕业后一直在某做存储的外企工作.
14年7月份开始有出国打算并开始准备.
[准备]
在工作之余每天坚持至少刷3~4道算法题, 并关注各个公司的blog及github上的开源项
目.
1. 算法
Leetcode自然不必说, 必刷. 先是用了将近两个月的时间把leetcode刷了1.5遍, 然
后每次电面和onsite面之前挑一些觉得做得不好的题再刷.
其次就是看geeksforgeeks上题. 这是个老印host的网站, 但是上面的题目分类明晰
,有很多分类底下的题目非常好, 比如DP (印象最深的就是m个鸡蛋n层楼测在哪层楼鸡
蛋会被摔碎的问题)和graph (印象最深的就是单源/多源最短/最长路径和欧拉环). 每
天看一下还是能学到不少新鲜的知识的.
其他就没有了, career up和glass door也断断续续看了一些, ... 阅读全帖 |
|
d*******8
发帖数: 23 | 25 版中大多数面经都是针对北美new graduate的, 在此贡献一下本人国内找北美工作的一
些经验吧, 也算是答谢mitbbs上分享面经的朋友对我的帮助. 更希望攒攒人品能够抽到
h1b签证 :)
[背景]
国内4年工作经验. 硕士毕业后一直在某做存储的外企工作.
14年7月份开始有出国打算并开始准备.
[准备]
在工作之余每天坚持至少刷3~4道算法题, 并关注各个公司的blog及github上的开源项
目.
1. 算法
Leetcode自然不必说, 必刷. 先是用了将近两个月的时间把leetcode刷了1.5遍, 然
后每次电面和onsite面之前挑一些觉得做得不好的题再刷.
其次就是看geeksforgeeks上题. 这是个老印host的网站, 但是上面的题目分类明晰
,有很多分类底下的题目非常好, 比如DP (印象最深的就是m个鸡蛋n层楼测在哪层楼鸡
蛋会被摔碎的问题)和graph (印象最深的就是单源/多源最短/最长路径和欧拉环). 每
天看一下还是能学到不少新鲜的知识的.
其他就没有了, career up和glass door也断断续续看了一些, ... 阅读全帖 |
|
f**********n
发帖数: 3081 | 26 Aube by Honeywell TI033/U 7-Day Programmable Timer Switch, White
http://www.amazon.com/Aube-Honeywell-TI033-Programmable-Switch/dp/B000F3ZR8C/ref=cm_cr_pr_product_top
I was looking for a timer to control my outdoor lighting. I was first drawn
to this product because of the name Honeywell, which is well known quality
proven name in the PLC (Programmable Logic Controller) business. So if
Honeywell could make such a great PLC, then their timers should be par
excellence. It turned out that some rese... 阅读全帖 |
|
W******e
发帖数: 3319 | 27 1. Introduction
My interest in studying creativity was inspired by the frustrations that I
felt as a student, then as a professor. I wanted to know how I could
encourage creativity in myself, my students, and my colleagues.
Politicians, industrial managers, academic administrators, and other leaders
often say that innovation is critical to the future of civilization, our
country, their company, etc. But in practice, these same people often act as
if innovation is an evil that must be suppressed,... 阅读全帖 |
|
q**j
发帖数: 10612 | 28 这个新闻可信度如何？有没有大侠给评论一下。
Jeff Jacoby
The Boston Globe
Made in the USA
US manufacturing still tops China’s by nearly 46 percent
By Jeff Jacoby
Globe Columnist / February 6, 2011
IN ECONOMICS as in apparel, most fashions come and go. But like the navy
blazer or the little black dress, bewailing the decline of American
manufacturing never seems to go out of style.
“They’re closing down the textile mill across the railroad tracks
Foreman says these jobs are going boys and they ain’t coming back.’’
So s... 阅读全帖 |
|
j*****n
发帖数: 3052 | 29 最近买了一个Mackie的Mixer用来Karaoke.
http://www.mackie.com/products/dfx12/
因为Main output只有XLR和1/4的接口, 我就用Tape output(RCA)线接Receiver. 唯一
的缺点是Tape output不能调音量, 不过可以调Receiver的.
但是手册上从来都没有说可以这末接. 都是建议用Main output接Amp或Receiver.
有没有懂器材的给说一说, 这个接法有没有问题? Main output会音质更好吗? |
|
y*****n
发帖数: 6302 | 30 ☆─────────────────────────────────────☆
dragonben (DaBen) 于 (Fri Jan 7 22:09:53 2011, 美东) 提到:
有个还行的声卡。能不能给推荐的麦克（好一点）。还有你们用什么软件？除了这两样
还有什么是一定必须的？刚开始不想搞得很fancy. 看了精华区那个介绍，有点儿太复
杂。晕。
☆─────────────────────────────────────☆
xumin (闲云野鹤) 于 (Fri Jan 7 22:15:46 2011, 美东) 提到:
samson c01u
☆─────────────────────────────────────☆
dragonben (DaBen) 于 (Fri Jan 7 22:34:48 2011, 美东) 提到:
en,收到。那软件呢？
☆─────────────────────────────────────☆
xumin (闲云野鹤) 于 (Fri Jan 7 22:41:23 2011, 美东) 提到:... 阅读全帖 |
|
a******s
发帖数: 7 | 31 Test Question [1]
Given:
5. class NoGo implements Runnable {
6. private static int i;
7. public synchronized void run() {
8. if (i%10 != 0) { i++; }
9. for(int x=0; x<10; x++, i++)
10. { if (x == 4) Thread.yield(); }
11. }
12. public static void main(String [] args) {
13. NoGo n = new NoGo();
14. for(int x=0; x<101; x++) {
15. new Thread(n).start();
16. System.out.print(i + " ");
17. } } }
Which is true?
A. The output can never contain the value 1... 阅读全帖 |
|
p********b
发帖数: 7 | 32 I think i know what you want this time
First you need to let do-it runnig at back ground and redirect output to
another file. Then trace that file till you find what you are looking for
and kill do-it
the shell script should look like this:
do-it &> output.txt &
while [-e ./output.txt]
do
tail output.txt | grep "PATTERN" | xargs ./check.sh
done
in check.sh :
if [-n $1] ## check whether $1 is empty
then
ps auxww | grep "do-it" | awk {"print $2"} | xargs kill -9 ##kill do-it
mv output.txt |
|
w******g
发帖数: 67 | 33 When I use following code of "popen" to run some shell command in my C++
progarm under Linux, I get the output both on the terminal screen and in the
string variable. How can I ask popen stop putting output on the screen but
only in the string variable. Thanks.
// run the shell command and put the output into string
string FileOperation::runCommand(string command)
{
stringstream msg;
char c;
FILE *output = popen(command.c_str(),"w");
while( (c=fgetc(output))!= EOF )
{ |
|
z****e
发帖数: 2024 | 34 int i, k;
//Create a file
ofstream OUTPUT( "RESULT.dat"); //ios::out | ios::in );
if( !OUTPUT ){
cerr << "File could not be opened." << endl;
exit( 1 );
}
//Input the data
for( i=1; i<=8; i++ ){
k = i*10;
cout << " k = " << k << endl;
OUTPUT.write( reinterpret_cast( &k ), sizeof(int) );
}
OUTPUT.close();
cout << endl << "Start Output" << endl;
ifstream INPUT("RESULT.dat");
INPUT.seekg( 2*sizeo |
|
c**y
发帖数: 172 | 35 Anyone can explain why the second output is 0, rather than 1.
========================================
#include
#include
#include
using namespace std;
int main() {
const int x = 0;
int const *py = &x;
int *px = const_cast(&x);
cout << *px << endl; // output 0
*px = 1;
cout << x << endl; // output 0, I don't understand
cout << *px << endl; // output 1
cout << *py << endl; ... 阅读全帖 |
|
b*******k
发帖数: 21 | 36 Using the recursive approach:
#!/usr/bin/env python
def solve24(numbers, goal):
"""Give a set of non duplicate positive numbers, can we use +, -, *, /
to get the goal?
Return one solution or None."""
if len(numbers) == 0:
return None
if len(numbers) == 1:
if numbers[0] == goal:
return '%d' % numbers[0]
else:
return None
ops = [
('+', lambda a, b: a - b),
('-', lambda a, b: b - a),
('*', lambda a, b: a / b... 阅读全帖 |
|
J*****n
发帖数: 4859 | 37 I am trying to make a class to read and write list, where T is some
struct.
Here r the question:
Read method didn't work out:
An unhandled exception of type 'System.ArgumentException' occurred in
readbin.exe
Additional information: The output char buffer is too small to contain the
decoded characters, encoding 'Unicode (UTF-8)' fallback 'System.Text.
DecoderReplacementFallback'.
What is the solution?
Thank you.
class BinRW where T:struct
{
private static System.Type _Type;
... 阅读全帖 |
|
F****3
发帖数: 1504 | 38 问题很白，真是不好意思。
What I want to do is to read the input.txt file line by line and then put
into a function and write the output line by line to output.txt.
with open('/path/to/directory/input.txt','r') as f:
with open('/path/to/directory/output.txt','w') as g:
for x in f:
x = x.rstrip()
if not x: continue
print >> g, some_lib.some_function(x)
But sometimes the function won't be able to generate the output for x, and
report error. I tried to use except... 阅读全帖 |
|
r*****8
发帖数: 2560 | 39 C语言，结构体转字符串。简单的难题
结构体转字符串怎么做？我有一个野外站点，通过铱星发回来数据，10个字符1分
钱。为了降低费用，要压缩字符数量。结构体的位域（bit fields）很理想，以下例子
3个数据只要2个字符就够了。
结构体做好以后，要用字符传送（short burst message），怎么把结构体变成字
符串？我用的是个笨办法，把结构体写入一个文件。然后把文件的字符串读出来。
各位大侠有更好的方法吗？
如果有时间细看以下是程序。
// #############################################
#include // Standard input output.
#include // Standard library.
#include // String handling
#include /* POSIX terminal co... 阅读全帖 |
|
S********t
发帖数: 3431 | 40 Guice倒是开源的，别的DI方案也有。想请教下，市面上有没有这样的轮子，来解决
processing step之间的dependency，framework去schedule每一个step的异步执行？
举个例子，我要写一个后端rpc service，处理一个rpc request，产生这个rpc的
response，这个过程中我需要执行若干个步骤
1: input request, output A
2: input request, output B
3: input A, B, output C
4: input request, A, C; output D
5: input B, D output final response
每一个步骤内部的logic可能是一个blocking computation，也可能是一个async call
(disk io or network call)。有没有这样一个framework能够理解这样的dependency并
且最优化的schedule这5个step的async execution，比如1和2可以并行run。不知道开
源社区有没... 阅读全帖 |
|
i*******e
发帖数: 349 | 41 我觉得新古典的RBC对新凯恩斯主义的模型也是有不小的贡献，除去模型结构的类似不
谈，RBC中的real interest rate和flexible rice output都是随机的，最近几年很多
新凯恩斯主义模型中的interest rate rule反映了这点，利率的制定要考虑到output偏
离随机的flexible price output的水平。在实证中也有人估计potential output的水
平，而不像二十年前认为real interest rate和去掉趋势后的potential output都是常
数。 |
|
a******e
发帖数: 80 | 42 我想把cadence里plot的data导出来，用其他软件再处理
在CIW windown里输入
ocnPrint(VT("NETZ1")) ?output "./output.txt" ?numberNotation 'none)
可以把VT("NETZ1")这条曲线的x-y data export 到output.txt这个文件里
但如果我有n条曲线要保存呢，难道要做n次？有没有办法可以把多条曲线存到一个file
里，因为所有曲线的横坐标都是公共的。
我试了命令,插入另一条曲线在命令行，用逗号分开
ocnPrint(VT("NETZ1"), VT(NETZ2)) ?output "./output.txt" ?numberNotation '
none)
但不成功，有没有大虾知道，谢谢。 |
|
g*******r
发帖数: 140 | 43 A rough calculate for boost converter output ripple:
During DT when inductor is charging, output is purely discharged by ILoad.
Thus Vo(ripple)=Iload*DT/Co.
Thus the inductor does not affect the output ripple very much in boost.
Of course, if taking ESR into account, output voltage will have jump due to
discontinous capacitor charging current.
If you want to find the proper L&C, you could just do some simple openloop
simulations with ideal component and obeserve output ripple for that.
question |
|
y*****n
发帖数: 367 | 44 我来谈谈我的理解吧。
产生肺水肿的重要原因及其后果：
↓Cardiac output-->↑end-diastolic volume & pressure，↓urinary output -->
pulmonary edema -->↓ ventilation & gas exchange --> hypoxia
针对这个病理，临床上的药物治疗目的主要是促进ventilation & gas exchange，增加
cardiac output。而要达到治疗的目的，除了输氧外，一方面是增加排尿量以减少不正
常地潴留于肺部的液体 — 通过利尿剂 &/or 增加cardiac output；另一方面是增加
cardiac output — 通过降低血压、减少心脏的workload及增加心脏的收缩力 — 如果
这个目的达到了，问题的根源就得到了解决。
从题目来看，在排尿量达到预期值、及pulse & RR偏离不大的情况下，降低血压就大概
成为了选择的关键，而且，C中的血压值也在正常范围内、未达到低血压的程度。另外
，我也在想，如果排尿量过大，也可能会导致hypovolemia --> hyp |
|
b****r
发帖数: 2555 | 45 First, are you sure of your laser output? Is the laser output itself
stable enough? OPA is based on nonlinear effect, so 10% fluctuation in
laser pulse may lead to 100% fluctuation of your OPA output.
Second, what is your output wavelenth? 1550 nm is always more stable
than 1200 nm output, because of the nonlinear crystal used.
Third, what OPA you are using? OPA from Newport is not as good as
a former soviet union company (EKSPLA or something).
Last, alignment and protection. Even air flow has e |
|
y******8
发帖数: 40 | 46 File “abcd” is a space-delimited file, and contains the following columns
of information:
Column 1: Name. Column 2: 1 - took test, 0 - didn’t. Column 3: Score.
Column 4: Date.
Contents of file “abcd”:
TED 1 75.5 01/01/2000
TED 1 80.1 01/02/2000
TED 0 00.0 01/03/2000
TED 1 45.5 01/04/2000
TED 1 94.7 01/05/2000
JON 1 88.1 01/01/2000
JON 1 65.1 01/02/2000
JON 0 00.0 01/03/2000
Contents of file “xyz”:
MOST PASSED TESTS
We want to find out who took the most tests with a grade... 阅读全帖 |
|
z*********o
发帖数: 541 | 47 The following SAS DATA step is submitted:
data sasdata.atlanta
sasdata.boston
work.portland
work.phoenix;
set company.prdsales;
if region = 'NE' then output boston;
if region = 'SE' then output atlanta;
if region = 'SW' then output phoenix;
if region = 'NW' then output portland;
run;
Which one of the following is true regarding the output data sets?
A. No library references are required.
B. The data sets listed on all the IF statements require a library reference.
C. The data sets listed in the |
|
b******e
发帖数: 539 | 48 1. 现在的程序根本不会有结果，'CA'后面必须有‘；’
改好后建议研究一下if statement。有两种情况:
(1) if ... then ...;
(2) if ... then do; ...; end;
2. 建议研究一下output statement。每个output statement都会往output data sets
里面写一遍。前面两个output statement是有条件的，所以只有符合条件的才会往它指
定的output data sets里面写。最后一个是无条件的，也没说明要往哪个data set里写
，所以会往所有的data sets里面写。
3. by default, SAS uses blank as a delimiter. Since there is no special
delimiter specified, and the program does not specify how many characters
should be read in (in the input statement,) it r |
|
j**********3
发帖数: 305 | 49 You need to specify the statistic you wanna output ? Otherwise SAS will just
output the original dataset. If you want to output y hat(predicted prob).
Use output out =aaa p= pred .There are something other statistics available
for proc logistic output. You may check the proc logistic help doc in SAS
online tutorial. |
|
f***a
发帖数: 329 | 50 回来了回来了。
重新想了下，这个其实就是在一堆iid variables之间加了一个constraint。貌似
sample起来不难。
以最简单的n=2,m=1为例：
Without constraint, outputs space is {(0,0),(0,1),(1,0),(1,1)}.
The corresponding probability space is {(1-p1)*(1-p2), ..., p1*p2}.
With constraint, outputs space is O={(0,1),(1,0)}.
The corresponding probability space is P={(1-p1)*(p2), p1*(1-p2)}.
Under the constrain, standardize the probability space into
P.std={P1/(P1+P2),P2/(P1+P2)}.
Then under constrain, output (0,1) has the probability P1/(P1+P2) to be
sam... 阅读全帖 |
|
