dododo

21 ms·

151.
by dododo 16y ago
you only know the mean is good enough if you examine the spread and/or use a robust estimator. spikes happen in performance (for better and for worse) all the time. one spike is enough to totally distort the mean, no matter how often you re
152.
by dododo 16y ago
why are so many benchmarks done so badly statistically? the benchmark was run once: we have no idea if this was a fluke or not. hopefully the author didn't repeat and pick the best. at best the numbers reported can be considered some mean.
153.
by dododo 16y ago
if you just look at age demographics of facebook users: http://www.istrategylabs.com/2009/01/2009-facebook-demograph... 40% of facebook users are 18--24. now compare to people with iphones in 2009 (different to people who queued, admitted
154.
by dododo 16y ago
hardware is currently disposable because this is how manufacturers have decided to make money. not so long ago, it seemed common to upgrade your PC: swap in one component, put in another. you're arguing to just buy a new device completely.
155.
by dododo 16y ago
please don't assume everyone is as imprudent, lavish and wasteful as some stereotype you seem to have. i replace devices when they are no longer of use to me, or if something significantly more useful comes along. actually useful not hype
156.
by dododo 16y ago
this is the source of the article: http://www.mydroidworld.com/forums/droid-x-discussion/3330-h... from the source, the things checked before blowing the fuse are: "the firmware information (what we call ROMS), the kernel information, and
157.
by dododo 16y ago
defining program boundaries is tricky. here's what the FSF say: http://www.gnu.org/licenses/gpl-faq.html#GPLAndPlugins it's not nitpicking: someone has given a license to certain rights, and not to others. it's important to honour what ha
158.
by dododo 16y ago
it seems worth noting that the block size of gzip/deflate ( http://tools.ietf.org/html/rfc1950 ) can be up to 32Kb, so i wonder if browsers are smart to enough to start rendering before a complete block has been received? if not, compressio
159.
by dododo 16y ago
it seems people call these techniques machine learning/AI simply because it sounds cooler: a lot of the techniques have a 30+ year history in statistics. this is the same story as neural networks: neural networks are just nested logistic
160.
by dododo 16y ago
btw, editline is a BSD licensed readline replacement: http://www.thrysoee.dk/editline/
161.
by dododo 16y ago
i read some of this book (analytic combinatorics). it's quite nice in that if you can write down something akin to a grammar that constructs objects you want to count, it provides a set of rewrite rules to actually count them. unfortunately
162.
by dododo 16y ago
they do mean dynamic programming in a more general sense: but dynamic programming was invented originally to solve Bellman's equation. it turns out many other problems have a similar structure which is quite surprising! before bellman's sem
163.
by dododo 16y ago
this is a splendid book that covers the most probabilistic/statistical algorithms: http://www.inference.phy.cam.ac.uk/mackay/itila/
164.
by dododo 16y ago
quite a lot of structure amongst these algorithms that the list misses out: - dynamic programming comes from solving Bellman's equation and Q-learning is an approximate means of doing dynamic programming. - It's possible to do beam a* searc
165.
by dododo 16y ago
You're right in that you need direction. Each subclass of machine learning has some elementary algorithms worth learning: For unsupervised learning or probabilistic latent models, the EM algorithm, Metropolis-Hastings sampling, variational
166.
As many definitions of intelligence as there were experts asked to define it(vetta.org)
1 points by dododo 16y ago|0 comments
167.
by dododo 16y ago
linux + firefox + no silverlight = redirect to: http://ecn.channel9.msdn.com/o9/ch9/4/5/0/2/1/5/C9LecturesDo...
168.
UK computer science graduates least employable of all UK graduates(news.bbc.co.uk)
7 points by dododo 16y ago|4 comments
169.
by dododo 16y ago
in the sample space i was intending, that would not be the case. i was imagining boy as a random variable that counts instances in an order tuple of genders (the underlying sample space). you're right, without this explicit construction, it
170.
by dododo 16y ago
other things not worth filling your mind up with: 1. type promotion rules 2. method resolution order 3. APIs for simple functions, just write your own--much more explicit. 4. order of evaluation in "for (init; cond; inc)" loops and other nu
171.
by dododo 16y ago
isn't this the same kind of "intuitive" reasoning that fails at simpson's paradox? http://en.wikipedia.org/wiki/Simpsons_paradox conditioning upon more events can lead to a higher probability. p(boy = 2 | boy >= 1) < p(boy = 2 | b
172.
by dododo 16y ago
presumably os updates (from google) must have the privileges necessary to do exactly this or maybe this is the interface used for OS updates?
173.
by dododo 16y ago
a Turing machine has an infinite tape. a typical computer has finite memory. therefore, it's tape is upper bounded by a constant function. this is a kind of linear bounded automata: http://en.wikipedia.org/wiki/Linear_bounded_automata l
174.
by dododo 16y ago
sophos anti-virus wasn't able to detect compromised binaries or source until nearly 2 years after compromise, just like the rest of us. sounds like software i don't need. (and that's assuming you get their on-demand scanning working (talpa)
175.
Intrusion detection: doing it wrong(lcamtuf.blogspot.com)
16 points by dododo 16y ago|2 comments
176.
by dododo 16y ago
why hash the output then? this is introducing a dependence in the PRNG that you seem not to need (nor want). if you're going to generate another 80 bits of entropy, then simply use this as the seed for another PRNG. this, sure, i agree, wil
177.
by dododo 16y ago
or programmers in general. i'm baffled why this hasn't happened yet.
178.
by dododo 16y ago
are you sure? the PRNG is a deterministic function of its seed. the hash is a deterministic function of the output. if you do the math and calculate the entropy (this isn't hard) you'll see that the total entropy is still 80 bits because th
179.
by dododo 16y ago
what are these guarantees you refer to? most pass a battery of tests e.g., diehard: http://www.stat.fsu.edu/pub/diehard/ but if you give a PRNG x bits of entropy, then it can produce at most x bits of entropy over its entire output. all
180.
by dododo 16y ago
oops. you're right. i provided a bad reference. sorry!

More ›