s*********x
发帖数: 1923 | 1 I came across this question the other day and have no clue... Anyone has
suggestions? Thanks!!!
Suppose we have a array of 9000 integers. Each time we read a frame that is
consisted of a 300 integer
windows from the array.
How many reads do we need so that we are sure that the reads we did can
cover a continuous 90% of the
array. |
s*********x
发帖数: 1923 | 2 NO. Each read is random, which means there might be a large portion of the
reads are overlapped. In this
case, n should be way much larger than 27. |
b*******n
发帖数: 61 | 3 1-(29/30)**n=0.9 => n=68 |
s*********x
发帖数: 1923 | 4 hmm.. I am not sure about 68 either. Could you explain a little bit further? |
b*******n
发帖数: 61 | 5 Just consider any one number in the array. The probability that this number
will be chosen at least one time in n times is 1-(29/30)**n.
further?
【在 s*********x 的大作中提到】
: hmm.. I am not sure about 68 either. Could you explain a little bit further?
|
S*3
发帖数: 162 | 6 不能保证是cover a continuous 90% of the array吧？
~~~~~~~~~~
number
【在 b*******n 的大作中提到】
: Just consider any one number in the array. The probability that this number
: will be chosen at least one time in n times is 1-(29/30)**n.
:
: further?
|
B****n
发帖数: 11290 | 7 If you have bad luck, you may always read the same frame.
is
【在 s*********x 的大作中提到】
: I came across this question the other day and have no clue... Anyone has
: suggestions? Thanks!!!
: Suppose we have a array of 9000 integers. Each time we read a frame that is
: consisted of a 300 integer
: windows from the array.
: How many reads do we need so that we are sure that the reads we did can
: cover a continuous 90% of the
: array.
|
X*********e
发帖数: 253 | 8 so it should be 0, you can never be sure of something, is it??
hehe
【在 B****n 的大作中提到】
: If you have bad luck, you may always read the same frame.
:
: is
|
s*********x
发帖数: 1923 | 9 anything more constructive :)
【在 X*********e 的大作中提到】
: so it should be 0, you can never be sure of something, is it??
: hehe
|
b******y
发帖数: 266 | 10 confidence intervel??
is
【在 s*********x 的大作中提到】
: I came across this question the other day and have no clue... Anyone has
: suggestions? Thanks!!!
: Suppose we have a array of 9000 integers. Each time we read a frame that is
: consisted of a 300 integer
: windows from the array.
: How many reads do we need so that we are sure that the reads we did can
: cover a continuous 90% of the
: array.
|
e****l
发帖数: 204 | 11 Can you use computer simulatin to solve the problem? You would likely need
160 reads with stdev of around 40.
But not know how to use math to figure out.
is
【在 s*********x 的大作中提到】
: I came across this question the other day and have no clue... Anyone has
: suggestions? Thanks!!!
: Suppose we have a array of 9000 integers. Each time we read a frame that is
: consisted of a 300 integer
: windows from the array.
: How many reads do we need so that we are sure that the reads we did can
: cover a continuous 90% of the
: array.
|
s*********x
发帖数: 1923 | 12 But it is a math problem after all. I really couldn't figure out the
solution...
【在 e****l 的大作中提到】
: Can you use computer simulatin to solve the problem? You would likely need
: 160 reads with stdev of around 40.
: But not know how to use math to figure out.
:
: is
|
