x*********n
发帖数: 28013 | 1 听到北京的声音好亲切啊。
哈哈哈。
顿时爱心泛滥。
前面2个客服也比较nice，
然后呢，
说到traceroute的时候，客服说这个time是incremental的，但是我说是each hop的，
后来跑来一个女的又说是incremental的，粗鲁了一下。呵呵。
我觉得吧，虽然是个简单问题，但是这个time是怎么算出来的呢？TTL只能算多少跳吧
，每一跳的时间怎么算呢？好奇啊。
C:\Users\>tracert google.com.hk
Tracing route to google.com.hk [74.125.225.176]
over a maximum of 30 hops:
1 2 ms 1 ms 1 ms 208.86.100.33
2 1 ms 1 ms 1 ms 208.86.100.225
3 3 ms 2 ms 2 ms 74.119.154.2
Trace complete. |
|
A*********l
发帖数: 2005 | 2 http://technet.microsoft.com/en-us/library/cc722145(v=ws.10).as
use /capture /verify switch when you want to backup, and use /append /verify
switch when you do incremental backup.
For example, you installed OS and all drivers, use /captuer /verify to do
your first backup, and then you install Office, use /append /verify to do
incremental backup. The 2nd step append to the first backup file you created
. Later you can decide only restore to the first backup, or revert to the
1st+2nd backup.
Use /... 阅读全帖 |
|
x****u
发帖数: 12955 | 3
simplest and cheapest is windows backup.
incremental backup is the most efficient. You only backup the files that
changed since the previous backup. But if anything happens to the base
backup, everything after it become useless.
Best solution: 1 whole disk image for the fresh installed disk. 1 whole
disk image for the last successful major change to your disk and you are
sure you don't need to go back further than that. Incremental/differential
backup for everything since that image. And t... 阅读全帖 |
|
W***o
发帖数: 6519 | 4 【 以下文字转载自 Programming 讨论区 】
发信人: Wardo (Wardo), 信区: Programming
标 题: Java 问题，请教如何找出一个array里的duplicate segments?
发信站: BBS 未名空间站 (Sat Sep 14 00:11:22 2013, 美东)
比如我有一个这样的array {1, 2, 3, 3, 3, 3, 5, 6, 8, 8, 8, 8, 8, 9, 9, 9, 9}
,我希望找出里面的duplicate segment {3, 3, 3, 3} {8, 8, 8, 8, 8} {9, 9, 9, 9}
我的想法是用两个指针i,j。i 初始化在index 0, j 在 N - 1最后一个index. 保持i不
懂，用j从用往左扫描，如果没找到，让j停在i + 1的位置，然后increment i to i+1,
j to N-1. 如此反复，如果j找到了一个duplicate segment的最右端, 此时test[i] =
= test[j] true，这个时候打印出这个segment. 然后increm... 阅读全帖 |
|
W***o
发帖数: 6519 | 5 【 以下文字转载自 Programming 讨论区 】
发信人: Wardo (Wardo), 信区: Programming
标 题: Java 问题，请教如何找出一个array里的duplicate segments?
发信站: BBS 未名空间站 (Sat Sep 14 00:11:22 2013, 美东)
比如我有一个这样的array {1, 2, 3, 3, 3, 3, 5, 6, 8, 8, 8, 8, 8, 9, 9, 9, 9}
,我希望找出里面的duplicate segment {3, 3, 3, 3} {8, 8, 8, 8, 8} {9, 9, 9, 9}
我的想法是用两个指针i,j。i 初始化在index 0, j 在 N - 1最后一个index. 保持i不
懂，用j从用往左扫描，如果没找到，让j停在i + 1的位置，然后increment i to i+1,
j to N-1. 如此反复，如果j找到了一个duplicate segment的最右端, 此时test[i] =
= test[j] true，这个时候打印出这个segment. 然后increm... 阅读全帖 |
|
w*********n
发帖数: 439 | 6 If name is a String instance variable, average is a double instance variable
, and numOfStudents is a static int variable, why won’t the following code
from a class compile?
public Student(String s)
{
name = s;
average = getAverage(name);
numOfStudents++;
}
public double getAverage(String x)
{
numOfStudents++;
double ave = StudentDB.getAverage(x);
return ave;
}
public static void setAverage(double g)
{
average = g;
}
Answer
a.
The setAverage method can’t access the a... 阅读全帖 |
|
h****q
发帖数: 78 | 7 我刚刚按一下的方法作了一边：
1. With acpi-support 0.109 (hardy) or 0.114 (intrepid) installed and laptop-
mode *not* enabled in either /etc/default/laptop-mode or /etc/default/acpi-
support, monitor the load cycle count of your hard drive by running 'sudo
smartctl -a /dev/sda|grep Load_Cycle_Count' over an interval of several
minutes, and observe that it is incrementing. (If it does not increment,
your hard drive's manufacturer defaults are sane and you are not affected by
this problem.)
2. install acpi-suppo |
|
S*A
发帖数: 7142 | 8 No, I did not know makepp before. Thanks for sharing.
But no, makepp is not what I am looking for.
The main goal is very very fast incremental build.
Makepp is written in perl which means it is a non starter.
If makepp could work, scons could work as well.
Make is very serious business. Do you know that the full
linux kernel, with modules. No change incremental build
will take 50s on a 8 way cpu machine with all file cached.
It take make 50 seconds on 8 CPU to check that no file
has been changed... 阅读全帖 |
|
h**o
发帖数: 548 | 9 Question: int (*a) [10];
a++;
What is the value of a after this?
A : a will be incremented by 20, assuming the size of int is 2.
我的疑问:why incremented by 20?
*a[10] 和(*a)[10] 有何区别?
我觉得int (*a) [10] 就是 int a [10] |
|
h**o
发帖数: 548 | 10 所以我觉得他跟int a[10]差不多.
int a[10]里 a 不就是指向一个 长度为10得int数组的指针吗?
当然 int a[10]里a++ is incremented by 2.
int (*a)[10]里a++ is incremented by 20.
挺糊涂的.. |
|
P*****f
发帖数: 2272 | 11 array 不是指针，不能做指针那样的算术运算.
所以我觉得他跟int a[10]差不多.
int a[10]里 a 不就是指向一个 长度为10得int数组的指针吗?
当然 int a[10]里a++ is incremented by 2.
int (*a)[10]里a++ is incremented by 20.
挺糊涂的.. |
|
l**********m
发帖数: 1 | 12 The presence of increment operator changed the execution order. It is
compiler dependent, since standard c++ doesn't define the order explicitly.
Your k++ is evaluated to 0 first, and then it increments k to 1. Then ip[k]
and k are evaluated to ip[1]=1 and 1. |
|
k**********g
发帖数: 989 | 13
Agreed.
If parallelism only occurs at the framework level, then the latency of
processing cannot be reduced, and the CPU will be under-utilized (if there
are not enough requests at the framework level).
Certain image processing operations are non-parallelizable - when considered
alone. Examples are image decoding and encoding. However, that doesn't mean
other image operations had to wait until these operations finish - other
image operations can use partial results, and can do so from a differe... 阅读全帖 |
|
W***o
发帖数: 6519 | 14 比如我有一个这样的array {1, 2, 3, 3, 3, 3, 5, 6, 8, 8, 8, 8, 8, 9, 9, 9, 9}
,我希望找出里面的duplicate segment {3, 3, 3, 3} {8, 8, 8, 8, 8} {9, 9, 9, 9}
我的想法是用两个指针i,j。i 初始化在index 0, j 在 N - 1最后一个index. 保持i不
懂，用j从用往左扫描，如果没找到，让j停在i + 1的位置，然后increment i to i+1,
j to N-1. 如此反复，如果j找到了一个duplicate segment的最右端, 此时test[i] =
= test[j] true，这个时候打印出这个segment. 然后increment i to j + 1, j to N-
1，再反复这个过程直到 i = j然后跳出循环。
最近脑袋比较浆糊，写了下面这个代码，但是不work,请各位来点播一下思路。谢谢了
int[] test = new int[] {1, 2, 3, 3, 3, 3, 5, 6, 8, 8, 8, 8, 8, 9, 9, ... 阅读全帖 |
|
c******o
发帖数: 1277 | 15 我们刚setup了incremental/continues build machine
TDD prod的build 不用太考虑时间。
自己的mac pro上其实很快，没有100秒，sbt只compile需要的，也是incremental的。
10万应该不包括任何library（都是jar），但是包括comment/test（很多） |
|
n**x
发帖数: 606 | 16 本人纯凑绕闹，不倾向任何一方。
系统主要特点：
- 多线程。(老魏没有给出具体多少个线程，假定100个吧。我的12 core intel xeon轻
轻松松100 thread）
- 无锁。
- 单机。
数据结构：
1. 全国1000条线 (X1, X2, X... , X1000)， 每条20个区段 (S1, S2, S3... S20)。
2. 每条线的每个区段的票的总数计为:T[X1,S1], T[X1, S2]....... T[X1000, S20]
抢票程序（注意举得例子是联票）
1. 100个thread处理收到的请求
2. 每个请求包括三个参数（线路， 起始站，结束战). 比如（234次列车, 济南， 上
海）。 （注意， 234次列车是从沈阳出发，到上海的, 济南是第5个区的开始，上海最
后一个区段的结束）
3. 计算过程就是把234次列车从济南到上海的每个区段的票数做interlocked.
decrement, 如下：
- Interlocked.Decrement( T[X234，S5] )
- Interlocked.Decrement( T[X234... 阅读全帖 |
|
g*****g
发帖数: 34805 | 17 跟你说了decrement再increment不是原子操作，你真是连基础知识都没有。
假如现在就剩一张票a->b, 来了两个单子a->b->c 和 a->b.
DB transaction保证了无论以任何顺序执行，a->b得票都能卖出去。
decrement再increment得做法，当单子同时到得时候，就有可能产生这样得执行顺序。
decrementAndGet(a->b) = 0, decrementAndGet(a->b) = -1
decrementAndGet(b->c) = -1.
结果就是票子没卖出去。
卖票得原则大家都很清楚，不许错票重票，不许有票不出。这个case可能最终导致好好
的票子卖不掉，正确性都不能保证，还谈个屁性能。没有正确性的高性能没有意义。
那几个捧臭脚的好好反思吧，到底谁是半瓶醋。
至于魏公公，不能把这个测试用例驳倒，就永远做太监吧。 |
|
w***g
发帖数: 5958 | 18 问题的原因是目前的神经网络是用穷举法在做优化，所以机器再多
也没用。你要是认为近100年人类做不出来，别的不说，你自己肯定
就做不出来。最后做出来的都是相信能做出来的人。
你觉得想想就累，没想对方向而已。现在大家都还没想对方向。
真想对方向了，一切就都显而易见了。我也还没想对方向。
机会在于，大部分人根本没有创造力。他们还会一根筋地往穷举法
的方向做下去，把注意力放在构造更大的神经网络上。或者在神经元
函数上做一些incremental的调整。只要这种incremental的改进还没有
穷尽，他们就会接着往下走。只要他们还在那条路上走，
我就还有优势。
你觉得识别，学习，举一反三啥的不是一回事，那是你想的还不够深入。
至少在我看来，它们只是同一个数据结构上的三种操作而已。不过这个
设计商业机密，暂时我也做不出来，就不详细解释了。
地方 |
|
S*********t
发帖数: 78 | 19 Is Angular 2.0 Worth It
Author: Torgeir Helgevold
Published: Sat Sep 05 2015
I have over the past months spent quite a bit of time working with Angular 2
.0 by writing sample components and going through the Angular 2.0 source
code. At this point I have decided to write down some of my thoughts around
my experiences with Angular 2.0. Keep in mind, these are just my own
personal experiences, so I am very interested in hearing from other
developers who might have totally different views on this.
S... 阅读全帖 |
|
r***s
发帖数: 737 | 20 大牛们相互鄙视完了谁也不解释。
我来冲个大头说一下我知道的一点点
异步log无非就是用户程序写进内存buffer，另外一个异步的线程负责往外写。这个
buffer大部分
时候是多个线程共用的，问题在于如何不用锁来保护这个buffer？
先说用户程序里的多个线程都要写进一个buffer，怎么防止互相覆盖？ buffer维护一
个指针
write_edge，要往里写的线程知道自己要写多少字节size，然后用 atomic increment
把这个指针
往右移动：interlocked_increment(&write_edge, size), 最后在这个指针左边写入。
这样可以保证不互相覆盖。
下一步看往外写的那个线程和其他线程如何同步。 buffer物理上是带状的，有开始和
结束。把它想象成一个逻辑环，有两个指针,read_edge和write_edge，每次有人写入
write_edge 右移，往外写Log的时候read_edge右移，只要保证read_edge一直在write_
edge 后面一定安全距离就可以了。
这个实现有些问题。 很多人认为世上没有真正lock free的东西... 阅读全帖 |
|
c*********t
发帖数: 2921 | 21 http://www.includehelp.com/c/operators-aptitude-questions-and-answers.aspx
3) What will be the output of following program ?
#include
void main()
{
int x=10;
x+=(x++)+(++x)+x;
printf("%d",x);
}
1. 44
2. 45
3. 46
4. 47
Correct Answer - 2
45
1) expand the expression : x=x+(x++)+(++x)+x;
2) due to pre increment ++x , x will be 11 for this expression.
3) after executing expression x will be 44.
4) finally x will be 45 due to post increment (x++).
弄不懂呀，到底这里 ++x, x++哪个先算？觉得x++... 阅读全帖 |
|
l*******G
发帖数: 1191 | 22 If both servers are windows:
Install Acronis Enterprise Server on both systems
Get a new hard disk for each of the two servers.
Have the new disk formatted to NTFS and put on netshare (网络邻居) and
make sure only admin or powerusers can use/access the share.
On computer A, mount the netshare on B, lets say \\computerB\backshare --
> drive Z on computer A.
On Computer B, mount the netshare on A, lets say \\computerA\backshare --
> drive Z on computer B.
Open Acronis Server on Compu... 阅读全帖 |
|
U**l
发帖数: 153 | 23 貌似announce的六个项目中三个都是关于Large Scale Recording and Modulation的。
。。
某项目还写了一行“Incremental improvements to existing technologies will not
be funded under this announcement.” 这个够innovative。。。但觉得现实中就看
写grant的人怎样定义自己的研究了，有很多borderline的东西也说不清是不是
incremental。 |
|
v**********m
发帖数: 5516 | 24 http://m.f1000research.com/articles/3-291/v1
波士顿地区的千老联合会的报告，文章提到的问题非常典型和深刻，该文已经在圈内得
到了包括大佬们的极大肯定(恐惧)。
OPINION ARTICLE
Shaping the Future of Research: a perspective from junior scientists[v1;
ref status: approved 1, approved with reservations 1,http://f1000r.es/4ug]
Gary S. McDowell1*, Kearney T. W. Gunsalus2*, Drew C. MacKellar3, Sarah A.
Mazzilli4, Vaibhav P. Pai1, Patricia R. Goodwin5, Erica M. Walsh6, Avi
Robinson-Mosher7, Thomas A. Bowman8, James Kraemer9, Marcella L. Erb10, Eldi
Schoenfeld1... 阅读全帖 |
|
c******s
发帖数: 58 | 25 Takedown应该是指line of credit的utilization。
Takedowns must be in increments of 50000
就是说要用你的credit line必须是50,000的整数倍，不能只拿出10,000或者30,000，
这类。只能是50K, 100K, 150K, and so on...
Repayments must also occur in 50000 increments on the 15th day of the month
这个也一样，就是还本金也要是50k的整数倍...每月15还... |
|
l******y
发帖数: 204 | 26 Computer Architecture的一个问题
话说有这么一个Scalar MIPS code for DAXPY （aX + Y）:
L.D F0,a ;load scalar a
DADDIU R4,Rx,#392 ;last address to load
Loop: L.D F2,0(Rx) ;load X(i)
MUL.D F2,F2,F0 ;a × X(i)
L.D F4,0(Ry) ;load Y(i)
ADD.D F4,F4,F2 ;a × X(i) + Y(i)
S.D 0(Ry),F4 ;store into Y(i)
DADDIU Rx,Rx,#8 ;increment index to X
DADDIU Ry,Ry,#8 ;increment index to Y
DSUBU R20,R4,Rx ;compute bound
BNEZ R20,Lo... 阅读全帖 |
|
y*********n
发帖数: 22 | 27 按照手册上说的
tincr：Specifies the printing or plotting increment for printer output, and
the suggested computing increment for post-processing.
delmax是hspice计算时的最大步长，timestep再大也不会超过这个值，你把delmax设成
100n试试？ |
|
l******y
发帖数: 204 | 28 Computer Architecture的一个问题
话说有这么一个Scalar MIPS code for DAXPY （aX + Y）:
L.D F0,a ;load scalar a
DADDIU R4,Rx,#392 ;last address to load
Loop: L.D F2,0(Rx) ;load X(i)
MUL.D F2,F2,F0 ;a × X(i)
L.D F4,0(Ry) ;load Y(i)
ADD.D F4,F4,F2 ;a × X(i) + Y(i)
S.D 0(Ry),F4 ;store into Y(i)
DADDIU Rx,Rx,#8 ;increment index to X
DADDIU Ry,Ry,#8 ;increment index to Y
DSUBU R20,R4,Rx ;compute bound
BNEZ R20,Lo... 阅读全帖 |
|
x**u
发帖数: 21 | 29 我尝试了降低minimum increment time to 1e-9, 这样一来STANDARD 倒是给我算了. 可
是需要3 MILLION INCREMENTS 才能算完, 只好做罢.
我不太清楚如何调整mesh. 现在采用了LINEAR PERTURBATION 的FREQUENCY 和DYNAMICS
步骤, 反而能够得到结果了. 搞得我也不清楚这个STRUCTURE 到底是不是NONLINEARITY.
Explicit应该很强, 只可惜我不会用.
谢谢指点. |
|
i*******k
发帖数: 578 | 30 谢谢，正在用xfem解决。我想要的功能都能实现，不过显然遇到了convergence
problem，每次只算了一点就提示time increment needed is smaller than minimum
increment specified. |
|
m****d
发帖数: 331 | 31 Baozi: 10.
a compound Poisson process has iid increments and stationary increment?
Thanks.
compound Poisson process: Xt=sigma(i=1,N(t))Dj, with jump intensity Mu and
jump distribution F.
Dj are random. |
|
k*****y
发帖数: 744 | 32 My naive guess for the second question is:
move right to 1,
move left to -2,
move right to 4,
move left to -8
and so on.
Since to ensure X/N is bounded the new increment should be at least
proportional to the sum of the previous increments. |
|
y***o
发帖数: 416 | 33 统计专业问题请教,谢谢大家
在研究过程中有一个难题,请大家帮忙
有两组人群 <= 18 岁, > 18 岁. 两种药物效果如下：
new medicine traditional medicine incremental
counts % of recovery counts % of recovery
<= 18 10,000 4.20% 5,000 3.10% 1.10%
> 18 30,000 3.5% 15,000 2.10% 1.40%
现在的难题是如何对INCREMENTAL做SIGNIFICANT TEST
证明1.1% 和1.4% 是SIGNIFICANTLY DIFFERENT
也就是证明新药相对于旧药对成人更有效
谢谢大家！ |
|
a****g
发帖数: 8131 | 34 (Reuters) - Some traders are manipulating U.S. stocks that are worth less
than $1 by taking both sides of trades in order to earn big rebates,
according to an official at Knight Capital Group Inc (KCG.N).
Knight, a top U.S. market maker for individual investors, and the other four
largest market makers discussed this problem with federal securities
regulators on Thursday, Jamil Nazarali, Knight's global head of electronic
trading, told reporters on Friday.
"It happens for hundreds of millions of... 阅读全帖 |
|
l****w
发帖数: 66 | 35 关于2010财政年度H-1B申请的问与答
刘宗坤联合律师事务所
Q: What is an H-1B? How to apply for an H-1B?
A: The H-1B is a nonimmigrant classification granted to a foreign worker who
is employed temporarily in a specialty occupation, or a fashion model of
distinguished merit and ability. For a step by step H-1B processing
flowchart, please see http://www.niwus.com/H-1B_procedure.html.
Q: What is a specialty occupation?
A: A specialty occupation requires theoretical and practical application of
a body of specialized knowled... 阅读全帖 |
|
p**********d
发帖数: 7918 | 36 http://www.nytimes.com/2011/01/20/world/asia/20assess.html?hp
January 19, 2011
Subtle Signs of Progress in U.S.-China Relations
By MICHAEL WINES
WASHINGTON — The Chinese have striven to lend this week’s state visit by
President Hu Jintao the aura of a fresh start, from feel-good displays of
friendly Chinese in Times Square to a Washington newspaper insert that
declared on Wednesday that his meeting with President Obama could open a new
chapter in a relationship between the world’s two economic g... 阅读全帖 |
|
h******t
发帖数: 872 | 37 http://globalpublicsquare.blogs.cnn.com/2011/11/04/zakaria-in-d
Zakaria: In defense of German sluggishness
By Fareed Zakaria, CNN
It is ironic that Greece - a tiny economy that is a mere 2.2% of the
Eurozone and not even among the top 25 economies in the world - has produced
so much turmoil. But there has always been a fundamental flaw in the design
of the Eurozone. Europe created a single currency without adequate fiscal
policy coordination. Very competitive economies like Germany, Denmark and
... 阅读全帖 |
|
z**********e
发帖数: 22064 | 38 Advice for U.S. College Students Abroad Be Aware of Foreign Intelligence
Threat
04/14/14
Three years ago, Glenn Duffie Shriver, a Michigan resident and former
college student who had studied
in the People’s Republic of China (PRC), was sentenced to federal prison in
the U.S. for attempting to
provide national defense information to PRC intelligence officers. (See
sidebar for more on the case.)
According to the Institute of International Education, more than 280,000
American students studied
abro... 阅读全帖 |
|
r***r
发帖数: 175 | 39 不知道有没有人贴过了，刚收到西北的电邮：
The earthquake that struck Sichuan, China on May 12 was devastating to
millions of people. NWA’s AirCares® partner The Salvation Army is
actively participating in the disaster relief efforts to help survivors who
are suffering from the loss of their homes, belongings and loved ones.
If you would like to help, here are two ways that you can support this
important relief effort:
Give Miles - Transfer WorldPerks miles to The Salvation Army in any
increment and Northwest Air |
|
c****s
发帖数: 5892 | 40 背景
步入新的一年，坛子上兴起找工热潮，似乎市场回温，形势开始一片大好。在这先恭喜找到新工作的同学们一声啦!在这春光大好，积雪化尽的日子里，我也决定抖抖我RESUME 和西服上的灰尘，去让它们也适当地吸收些维他命D。
先大概说下我想跑路的背景吧。2009年金融危机末，我所在的公司被收购。收购之前，公司已经经过一场大清洗。收购之后又是一场。原来30多人的finance/acc'ting去了一多半。我站对了队，在原公司著名墙头草 - DIRECTOR C 的CONTROLERSHIP组里全权负责，又在transition中非常合作，收购结束后，C 和我算是通过考验，被收编了入新公司的CFO office，成了伪军。我的老领导 C 成了BUSINESS DEVELOPMENT一部，我继续负责原来公司的financial operation和系统。虽说工作不太相交，但经历过de那几场大RE-ORG的同林鸟经历让我们保持的不错的私交。2010年，正所谓朝中有人好说话，C 负责的收购合并项目有意的在我的VP前推荐把两个新的公司的reporting并入我的组里，我一下子多了一倍的人马。写到这，一定你... 阅读全帖 |
|
o***s
发帖数: 42149 | 41 电灯早已经存在，白炽灯也早已经存在，而且都在他“发明”之前就已经诞生。爱迪生靠对电灯的“卓越”的制造品质以及营销大赚了一笔，多么恶心卑鄙。
这些家喻户晓的名字还有故事，你一定不会陌生：爱迪生发明了电灯，贝尔发明了电话，惠特尼发明了轧棉机。
不过你可能不信，事实上这些并不是他们发明的。他们可不是雅典娜下凡，那些创想也非灵光一现，总之肯定不是他们的一人之力。 其实，没有一项发明创造是由某人单独完成——发明家和他们的“发明时刻”的神话。
“任何发明创造，即使是那些改变时代的、不同凡响的发明，都是由瞬间的灵感以及在此基础上不断地改进相结合而完成的。” 马克.A.莱姆利（Mark A. Lemley）在他那篇著名的文章《唯一的发明者之谜》中这样说过。莱姆利的这篇文章中主要讨论了发明专利的历史及存在的问题。 不过，其中他也记述了19世纪和20世纪最著名的发明家的故事——只不过重点很独特，主要阐述了这些发明家的发明并不是一人之力完成，有些发明甚至跟他们没有任何关系，张冠李戴了而已。 莱姆利对过去200年间的“协作创新”做了非常精彩的描写，下面几段故事就是对其描写的提炼。
电灯
正如你所听说的那样，托... 阅读全帖 |
|
G*******m
发帖数: 16326 | 42 And the tax rate could be differentiated as well.
1) Primary resident, lowest tax rate
2) 2nd, higher
3) 3rd and above: 1% incremental
4) Foreign owner: same rate, but have to pay in full every year. |
|
o******d
发帖数: 743 | 43 英国卫报， FYI
http://www.guardian.co.uk/commentisfree/2010/oct/08/liu-xiaobo-china
Liu Xiaobo wins Nobel, reform loses
China has many unsung heroes pushing for democracy. Their task gets harder
when the west rewards high-profile dissidents
* Nick Young
Liu Xiaobo, the jailed Chinese pro-democracy activist who has just been
awarded a Nobel peace prize, is certainly a brave man, and his imprisonment
is deplorable. But it is hard to see what contribution he has made to peace,
in China or beyond, or how... 阅读全帖 |
|
O******n
发帖数: 1505 | 44 人均发文密度比他高的多的也有。比如onur mutlu.
可惜几乎都是proposal，要么是incremental improvment, 要么鼓吹把现有体系推倒如
此重来则如何如何。或者偶尔某个方向被证明有可能带来廉价的突破，大家呼啦啦的瞬
间把那里的各种假想问题统统解决一边，全不管对业界到底有多少可用性。
以ISCA为例，最近5年的idea被intel IBM采用的，几乎没有。学术界滞后工业界已经是
很严重的问题
这位william dally,也去NV当技术官了
从这个角度，龙芯的impact,在全世界也属于第一集团。
世界 |
|
Z**R
发帖数: 1233 | 45 【 以下文字转载自 Aviation 讨论区 】
发信人: ZZGR (闲逛), 信区: Aviation
标 题: SpaceX Dragon capsule set for launch
发信站: BBS 未名空间站 (Wed Dec 8 09:37:45 2010, 美东)
http://www.bbc.co.uk/news/science-environment-11936711
A US capsule that could soon be hauling cargo and even astronauts to the
space station is set to make its first demonstration flight on Wednesday.
The Dragon ship will be launched from Florida on a Falcon 9 rocket, with the
aim of entering a circular orbit some 300km above the planet.
After completing... 阅读全帖 |
|
y***l
发帖数: 6963 | 46 Indian economy will grow faster than Chinese in 2012: World Bank
TNN, Jan 14, 2011, 02.06am IST
Article
Comments (5)
Tags:World Economic Outlook|World Bank|Chinese Economy
NEW DELHI: For years, India has been the second-fastest growing major econom
y in the world. That could soon change, with the Indian economy set to expan
d at a faster pace than the Chinese economy in 2012, according to World Bank
data.
This is expected to result from continued high demand in India even as measu
res to combat ... 阅读全帖 |
|
c**i
发帖数: 6973 | 47 Transcript: Interview with Admiral Gary Roughead, US chief of naval
operations, on January 14 2011 at the Pentagon. Financial Times (FT), Jan 19
, 2010.
http://www.ft.com/cms/s/0/993b0ca4
-234d-11e0-8389-00144feab49a.html
My comment:
(1) Based on the interview, two reports appears in today's newspaper.
(a) Richard McGregor, US fleet chief voices doubts on Chinese navy. FT, Jan
19, 2010.
(b) Jeff Dyer and Richard McGregor, Beijing builds navy to hold US at bay.
FT, Jan 19, 2010.
(2) Notes to the ... 阅读全帖 |
|
