g***u
发帖数: 5413 | 1 Jailbreaking an iPod or iPhone in the USA is legal "fair use", and does not
violate copyright laws defined by the Digital Millennium Copyright Act. In r
esponse to a request by the Electronic Frontier Foundation, the US Copyright
Office explicitly recognized an exemption to the DMCA to permit jailbreakin
g in order to allow iPhone owners to use their phones with applications that
are not available from Apple's store, and to unlock their iPhones for use w
ith unapproved carriers.[42][43] Apple ha |
|
p********e
发帖数: 91 | 2 If you did some research on this area or read this book, I'd like to discuss w
ith you.
Thanks, |
|
M***7
发帖数: 2420 | 3 Hi guys, I have a question of cluster method in SQL.
A table contain 3 columns: rownumber, name, value.
I want to cluster the rows according to their values.
Step 1: First I create another table (tracking table), randomly put some
rows from the data table into this tracking table as the seeds.
Step 2: Then I want to calculate the (ith_value_from_datatable - jth_value_
from_trackingtable)**2, and assign ith row of data table into the jth group
according the the smallest distance calculated above. |
|
y********o
发帖数: 2565 | 4 I sorta agree. I got the book, but have never read it. Also, the problem w
ith many programming books is that they talk about fundamental OO programmin
g principles instead of about the language itself. |
|
t***x
发帖数: 161 | 5 I simply used the 4G flash drive coming with PBO deal. Flashed three boxes w
ith mega firmware, so far no problem. |
|
s*****a
发帖数: 545 | 6 税后一共780。
给的配置没有说网卡类型，那应该是thinkpad的还是intel的呢？
蓝牙也不知道有没有
Model Highlights
Part number: 2436CTR
Condition
Refurbished
Processor
Intel® Core™ i7-3720QM Processor (6M Cache, 2.60 GHz)( )
Operating system
Window s 7 Professional 64 - English
Graphics
NVIDIA Quadro K1000M
Memory
16GB (4 X 4GB) PC3-12800 DDR3 SDRAM 1600MHz SODIMM
Memory
Display
15.6" HD+ WXGA (1600 X 900) LED Backlight w / 720p HD Camera"
Pointing device
UltraNav (TrackPoint and TouchPad) w ith Fingerprint Reader
Hard Drive
5... 阅读全帖 |
|
d**i
发帖数: 9682 | 7 well, this statement is only true, if all work in universe is code writing w
ith text-based editors...
e |
|
a*******e
发帖数: 14 | 8 An O(n log n) algorithm:
1. Let b = 1+ the max value (the last one in sequence);
2. Add b^i to the ith (zero based indexing) repeated element;
3. Sort the sequence as usual;
4. Recover the original sequence. |
|
P*****f
发帖数: 2272 | 9 good, just a littile bit concern of overflow:)
An O(n log n) algorithm:
1. Let b = 1+ the max value (the last one in sequence);
2. Add b^i to the ith (zero based indexing) repeated element;
3. Sort the sequence as usual;
4. Recover the original sequence. |
|
t***o
发帖数: 4265 | 10 adumbrare 的code group是指数间距, 有OVERFLOW 的可能性。你的间距是线性的，
OVERFLOW的机会大大减小。我再改一下，间距为1，OVERFLOW的机会就更小些。
还是coding的思路,但不再用整数，而是用字符串：
1. add i_ prefix to the ith (zero based indexing) repeated element,
e.g., 1 1 2 3 3->0_1 1_1 0_2 0_3 1_3
2. sort the sequence in ascending order;
3. remove the prefix. |
|
s*******d
发帖数: 59 | 11 Set = { 0(all) stone weight}
for (int i=1; i
{
get the ith smallest(largest) weight of the set;
add(remove) one stone to(from) this weight, there are less than m new
weights;
add these weights to the set;
}
the nth smallest(largest) weigh of all combination is the same as
the nth smallest(largest) weight of the set. |
|
b***y
发帖数: 2799 | 12 , when you need to randomly access the ith object. |
|
d*****9
发帖数: 70 | 13 list is STL's list.
list mylist;
how to get the ith char from this list????
thanks! |
|
I*******e
发帖数: 1879 | 14 ☆─────────────────────────────────────☆
blueivan (bl.ue) 于 (Tue Feb 24 13:29:02 2009) 提到:
I found C++ io is difficult to use especially for binary files. Once I conve
rted some C code to C++, especially char * to string, it is running 10 times
slower than before.Every time I try to read/write a int or float in binary,
I have to use reinterpret_cast..It is such a mess. How do you people deal w
ith it?
☆─────────────────────────────────────☆
FIRE1988 (Fire1988) 于 (Fri Feb 27 16:58:08 2009 |
|
s*******e
发帖数: 664 | 15 ☆─────────────────────────────────────☆
Dan916 (Dan) 于 (Thu Aug 13 12:27:53 2009, 美东) 提到:
(1)Implement 3 Stacks in one array.
怎样能充分利用空间, 即 cannot declare stack overflow unless the array is
completely full.
而且又avoid shifting.
网上查了查好像没什么方法能同时满足两个条件的??
(2)Given a 2-Dimensional(MXN) array if A[i][j]=1 Set all ith row and jth
column elements as '1'. linear running time, and constant space requirement.
这题应该是reuse第一行和第一列来记录哪行要变1了. 但如果是第一行或第一列里的任
何一个是1, last scan will just mess up the 1s recorded i |
|
z****e
发帖数: 2024 | 16 你这点说得非常对，map里边有iterator，是可以按顺序遍历的，hash 无法排序，无法
选择（比如第ith smallest）。
我还加一点，就是dynamic hash table. 因为事先不知道元素多少，无法确定table大
小，只能用table被填满一半，就把table大小翻倍，（linear probing 情况下）。这
个操作比较昂贵。用separate chaining 的话，元素越多，就越来效率越低。说是O(1)
的操作，最后都不知道O几了。
所以，不知道大小，就RB-tree，实现动态调整大小，而且，插，删，找，永远log(N)。
不知道这样说对不对，还有没有其他补充。
多谢大家。 |
|
|
E*******1
发帖数: 3464 | 18 why not use the overload operator to define m(i,j)? Do not think in a way of
C, you are using C++
class matrix{
const size_t _size;
double * _b;
public:
double operator ()(size_i i, size_t j){return _b{j*_size+i};}
//build some constructor thing below
............
};
main()
{matrix m;
//m(i,j) is the matrix element in ith row and jth column
} |
|
r**a
发帖数: 536 | 19 :) maybe it is due to my poor coding style. The original goal of my code is
a little bit complicated. But getxy() should be viewed as a collection of N
points. And the ith point's coordinates depend on the (i-1)th one. And
further I want to store all the x coordinates of those N points into an
array or vector.
Do you have a better suggestion about the structure of the codes? |
|
G**T
发帖数: 388 | 20 not sure ur problem. but ..
what is pHashList[i]?
the ith hash list's point?
what's the definition of object pHashList?
I think the problem maybe here. |
|
u**y
发帖数: 68 | 21 save the attached file as *.uun. Then open ith winzip. |
|
x***x
发帖数: 239 | 22 Yao's a mananer in Beijing advisory dept. on her secondment to PwC NY office
. Her hubbie's also with PwC in the IT dept. Their only kid is now staying w
ith the grandies back in China.
May her peace.
Things can change so much overnight. So good that I am staying with my frien
d.
27 |
|
h***0
发帖数: 312 | 23 It is closely realted to actuarial dept. Their studies support some
important assumptions in actuarial model. IThe health industry background is
useful for you to transit from Pension to Health. I know that these
positions in some companies require actuarial track, some do not. |
|
K**********e
发帖数: 188 | 24 Gene
Volume 427, Issues 1-2, 31 December 2008, Pages 7-18
Evolution of Pacific Ocean and the Sea of Japan populations of the gobiid
species, Pterogobius elapoides and
Pterogobius zonoleucus, based on molecular and morphological analyses
Akihitoa, Akishinonomiya Fumihitob, c, Yuji Ikedad, Masahiro Aizawad,
Takashi Makinoe, 1, Yumi
Umeharae, Yoshiaki Kaif, Yuriko Nishimotob, g, Masami Hasegawab, e, h,
Tetsuji Nakaboi and Takashi
Gojoborib, e,
aThe Imperial Residence, 1-1 Chiyoda, Chiyoda-ku,... 阅读全帖 |
|
O******e
发帖数: 4845 | 25 Autism May Have Had Advantages in Humans' Hunter-Gatherer Past, Research
er Believes
ScienceDaily (June 3, 2011) Though people with autism face many challe
nges because of their condition, they may have been capable hunter-gathe
rers in prehistoric times, according to a paper published in the journal
Evolutionary Psychology in May.
The autism spectrum may represent not disease, but an ancient way of lif
e for a minority of ancestral humans, said Jared Reser, a brain science
researcher and doctor... 阅读全帖 |
|
P******t
发帖数: 1717 | 26 虽然在其他方面我是挺饶的，但国籍这个事儿的确不是什么光彩的一节，尤其变过去又
变回来。你这么一味的逢饶必挺就有失客观了：
1a， 少先队誓词没有为共产主义事业奋斗终身。少先队誓词“我是中国少年先锋队队员
。我在队旗下宣誓：我决心遵照中国共产党的教导，好好学习，好好工作，好好劳动，
准备着：为共产主义事业，贡献出一切力量！”
大家在少先队的时候，的确也是遵照党的教导，好好学习、工作、劳动，的确也是“准
备着”为共产主义贡献一切力量的，但现在问题不在宣誓人，而是共产党自己就已经不
坚持共产主义，而是坚持搜刮人民，还有什么党好遵照，党也没留什么共产主义事业去
让大家为之奋斗了。
1b，少先队员入团后就自动退队（好像年满14也自动退队？），团员28岁自动退团，这
些都是被某组织条款写明届时该身份自动消失的，正常人的逻辑应该不难推导出宣誓时
的承诺当然也随之消失。
2、你回答VO毕业后打算回国工作。这是回答问题，谈打算，而不是宣誓，不是给commi
ttment。说实话，很多人现在都还在回国不回国间摇摆，不知道自己3年之后在哪儿，连
自己都不确定答案的事，VO问了也是白问，好在美国鉴证政策并不需... 阅读全帖 |
|
O******e
发帖数: 4845 | 27 Severe Congenital Disorder Successfully Treated in a Mouse Model for the
First Time
http://www.sciencedaily.com/releases/2011/12/111222103044.htm
ScienceDaily (Dec. 22, 2011) Using a mouse model, Heidelberg University Ho
spital researchers have for the first time successfully treated a severe con
genital disorder in which sugar metabolism is disturbed. The team headed by
Prof. Christian Korner, group leader at the Center for Child and Adolescent
Medicine, demonstrated that if female mice are giv... 阅读全帖 |
|
b****t
发帖数: 114 | 28 A fair sixsided die is rolled 100 times;
Let A[i]={sum of ith and (i+1)th rolls is 2}
(i.e. successive rolled numbers are both 1)...
Find the following probability:
P(sum of I(A[i])=30)=? i=1,2,3...99.
PLease help me out...Thanks a lot
beet |
|
a*****g
发帖数: 19398 | 29 CPS to make computer science a core subject
Touted as a trailblazing move, computer science is to be elevated from elect
ive to core curriculum in all public high schools and be offered at elementa
ries — the latter unprecedented elsewhere — the Chicago Public Schools ann
ounced Monday.
In the next three years, every high school will offer a foundational compute
r science course, and within five years, CPS plans to be the first urban dis
trict offering kindergarten through eighth-grade computer ... 阅读全帖 |
|
H***F
发帖数: 2501 | 30 laser diode operates in forward region, vbias is roughly constant. But
current can change dramatically. Ith is more appropriate.
photodetector operates in reverse region. Current is very small. Use voltage
is more appropriate.
举个例子：激光二极管或者SOA，一般强调说偏置电流是多少，从而能得到多大的功率
或增益。并不说偏置电压是多少？但是光电探测器，就说反向偏置电压应该加多大，并
不说反向偏置电流加多少？
上述的说法有什么原因吗? 谢谢拉 |
|
O********9
发帖数: 59 | 31 One way to get an estimate for a,b,c and d is constrained least squares, i.e
.,
min_{a,b,c,d} \sum_{i=1}^{30} (a_i - a)^2 + (b_i - b)^2 + (c_i - c)^2 + (d_
i - d)^2
subject to a+b+c+d = 1
where i indicates ith measurement.
This can be written more compactly as
min_{x} || Ex - f ||^2
subject to Gx = h
where x is a vector [a,b,c,d]^T, E is a matrix, f is a column vector, G is a
row vector [1, 1, 1, 1] and h is 1.
(I will let you find out the form of E, f)
It has a close form solution (by using La... 阅读全帖 |
|
l***g
发帖数: 1035 | 32 Principal Research Engineer PV Systems
There has never been a better time to join our truly global company. We have
been helping our customer realize significant savings in energy consumption
for over 77 years, and now we offer a position where you will play a key ro
le in meeting our ambitious aspirations for the future. The growing awarenes
s world wide for environment and alternative energy sources are enabling us
to create strong paybacks for our customers and we need you to help us devel
op... 阅读全帖 |
|
l***g
发帖数: 1035 | 33 I'm a recruiter with CareFusion, and we are seeking an Electrical Engineer w
ith TCP/IP testing and/or firmware and real time systems experience. Here is
a brief summary of qualifications:
Bachelors in related field required.
Minimum 4+ years related work experience.
Experience using SW QA methodologies (CSQE cert preferred).
Previous exp in Black Box/White Box testing and writing test scripts.
Client-Server (non-UI) software backend test plan and execution exp required
.
Exp testing relational ... 阅读全帖 |
|
I*****y
发帖数: 6402 | 34 just bumped into a forum talking about patent agent positions that involved
many patent agents discussion. One of the posts quoted:
I approached IP toward ends related to yours. I can say that I've satisfied
most of my goals ... except for any sense of stability or pride.
Despite any comments regarding turning the knife, I am quite satisfied with
the money I make. And I don't work long hours. Hell I have to beg to stay bu
sy. The easiest thing for me to do at my current employment is to fall out... 阅读全帖 |
|
B****n
发帖数: 11290 | 35 你先想想x_1=(1,0,0,0...)(or more generally x_i, where the ith element is 1
and 0 otherwise) 你要怎麼用D裡的元素靠近
然後l^2裡的元素都是x_i的線性組合 然後再用到l^2的尾巴會很小 應該就可以了 |
|
l********y
发帖数: 2295 | 36 NEPH: ESRD pts
- watch lytes closely; careful with things like laxatives (fleets enemas),
etc. Hi phos load, Na load; same with kayexalate
- if hyperkalemic: check EKG and see pt; if no peaked T's, likely can wait
to get HD; but give insulin, Ca gluconate, etc. If worried, give kayexalate
- if septic and oliguric: carefulw ith IVF; small boluses, ~500cc at a time
(like CHF pts); avoid fluid overload and causing pulm edema
- Phos: danger is elevated Ca x Phos product (serum Ca x serum Phos); > 55... 阅读全帖 |
|
l******n
发帖数: 9344 | 37 Let P_i denote the probability that I have no call on the ith day
Then
P(UP_i)=C(7,1)(6/7)^12-C(7,2)(5/7)^12+C(7,3)(4/7)^12-C(7,4)(3/7)^12+C(7,5)(2
/7)^12-C(7,6)(1/7)^12
=.7715
So 1-P(UP_i)=.2285
distributed
each
here |
|
S*********r
发帖数: 42 | 38 Steps of an O(n) search:
1. Find max value (M) among all 2N+1 numbers
2. Use M-bit number and then reset it to zero
3. Mark the ith bit use XOR for any number i
4. Find non-zero bit and the corresponding number |
|
b***e
发帖数: 1419 | 39 Essentially, I am applying the process recursively like psacnik
suggested, for the smaller problem of size n-1 . But it occurs that after
the division by putting x_n to z_i, nothing to the left of z_i could ever
cross the ith position (to z_i's right) anymore. So doing {z_1, ...,
z_{i-1}} is equivalent to doing {z_1, ..., z_{i-1}, z_{i+1}, ..., z_n}. |
|
b***e
发帖数: 1419 | 40 For the first one:
For the ith row, reduce each number by (i-1) * 8. This operation
will decrease the white sum and the black sum by the same amount, since
each row has the same number of blacks and whites.
Now the jth column has all j. Apparently, the two sums are the same,
since each column has the same blacks and whites.
equal, |
|
k*******d
发帖数: 1340 | 41 有点像八皇后问题啊，用递归吧
先假定a做A，调用自身来安排BC 给bc, 如果安排成功的话，就打印a 做A
然后假定c做A,调用自身来安排BC给ab,如果安排成功的话，打印c做A
如果某次调用只剩下一个0，说明安排失败
大致思路：
bool solve(matrix, row_index, col_index)
(let the size of matrix be n-by-n)
if the size of the matrix is 1-by-1 and it is zero
return false; //终止条件
bool flag = false;
for i= 1 to n
{
if matrix[i][1] == 1
Define submatrix to be the (n-1)-by-(n-1) matrix obtained from
removing the ith row and the first colunm of matrix
let new_row_index = row_index \{ |
|
b*****t
发帖数: 10 | 42 E_i=ith member gets his/her own present.
p = P(E_1 U E_2 U...U E_n)at least one get his/her own present.
then P(no one get own present)=1-p
Then solve p by inclusion/exclusion principle.
say P(E_1 U E_2 U E_3)=(n-3)!/n! and there are Choose(n,3) combinations.
so finally,
p=1-1/2!+1/3!+...+...(-1)^(1+n)1/n! |
|
m****s
发帖数: 1481 | 43 看过一本书类似的叫做largest dowry问题。
最佳strategy是选择i当
P(win with ith)>P(win with (i+1)th)
最后算出来100个应该是pass前37个，然后选择之后第一个超过前37个中最好那个。
当n很大的时候，应该pass前n/e个，然后选择之后第一个超过的 |
|
s****i
发帖数: 216 | 44 X_i the length until the ith coupon,
then X_i-X_(i-1) are independent of each other, i guess |
|
R******t
发帖数: 2648 | 45 我以为你问empirical correlation matrix都能怎么得到
empirical correlation就是通过实际的data得到的correlation，与其相对应的是true
correlation matrix
比如说，a portflio of N assets with weight w_i on the ith asset, then the
variance of the portfolio is
\sum w_i\sigma_iC_{ij}\sigma_jw_j，
这里用到的C是true correlation matrix，在实际中是不知道的，但是我们可以用历史
数据得到一个correlation matrix，这个就叫empirical correlation matrix |
|
l*********t
发帖数: 89 | 46 Q:
Given a linked list of N floating point numbers, write an algorithm to
populate an M long array with numbers from the linked list where M < N.
Every number in the linked list must have equal chance of appearing in the
array, but a number may not appear twice (note that there are no repeats in
the linked list).
Write an algorithm where N is known at the start, then an algorithm where N
is not initially known. The list may only be traversed once.
A:
Assuming you have access to a good RNG, and t... 阅读全帖 |
|
x********9
发帖数: 31 | 47 It depends on your risk preference. I did not quite get what you mean...You
get four if you get both the first one and the second one right or just the
second one right?
If you are risk-neutral, and you get 4 when you get the second right, etc...
Then you should use backward induction.
Assume your value function to be V_i(W) at the ith round before choosing how
much to bet for the i+1 th round.
V_7(W) = W
V_6(W)= 4 W
V_5(W) = max_{w} 0.5*V_6(W + 8w ) + 0.5*V_6(W-w) =
You should obtain you will a... 阅读全帖 |
|
r*********n
发帖数: 4553 | 48 （2）
E_i : the ith card is at the same position
P(union_{i} E_i) : probability of at least one card at the same position
P(union_{i} E_i) = \sum{i} P(E_i) - \sum_{i
(E_i & E_j & E_k) - .... - P(E_1 & ... & E_52)
= 1 - 1/2! + 1/3! - 1/4! + .... - 1/52! |
|
k*****n
发帖数: 117 | 49 since each toss is independent
let Xi = 0 if ith toss and (i+1)-th toss is same
Xi = 1 if they are different
then X1, X2, ... XN-1 are mutually indep
total number of groups = sum(X1..XN-1) + 1
E[ ] = E[ ] + ... E[ ] + 1 =
sum(...) is a binomial
Now you can carry out the calculation yourself |
|
