leni536

69 ms·

961.
by leni536 9y ago
It has an interesting performance impact on calls to dynamic libraries. One alternative approach would be to avoid the indirect calls through not using '-fPIC --shared' when building shared libraries but '-mcmodel=large --sha
962.
by leni536 9y ago
Work's on Intel® Core™2 Duo Processor T7200. Had to replace __rdtscp(&junk) with __rdtsc(), the Core 2 doesn't have the former.
963.
by leni536 9y ago
I just found the following paper on "random access compression". They do claim constant time lookup. https://pdfs.semanticscholar.org/1511/11c0c6dec6104bbf70d67d... But yeah, I agree, O(log n) access time is
964.
by leni536 9y ago
> boost::math::binomial_coefficient<double> Using double here seems to be unsuitable for this kind of algorithm. The boost algorithm seems to be tuned for floating point arithmetic for large n and k values. An integral binomial_coe
965.
by leni536 9y ago
Damn, I always abused apt-preferences to achieve the same effect as apt-mark hold|unhold. Thanks! Does 'apt-get dist-upgrade' respect held packages?
966.
by leni536 9y ago
I would like to point out two of my favorite high school competitions in Hungary. One is KöMaL [1]. It's a monthly journal, one has to send back solutions to the problems. The competition is during the whole school year. It has problem
967.
by leni536 9y ago
Then I suggest an improved heuristics for mid-game. You can actually calculate the number of global configurations for each border configuration, they are just (n choose k) type calculations. It's somewhat more sophisticated when there
968.
by leni536 9y ago
> Each of these 11 configurations should be equally likely to be the actual position. This is not true. For calculating the odds of a configuration you need to take into account the non-border squares and the number of the remaining mine
969.
by leni536 9y ago
> You've illustrated why I'm against the kind of simplistic programming maxims you'll find in "Effective X" books. Another thing you won't find in this book is the C++ Gospel, the One True Path to perfect C
970.
by leni536 9y ago
But in the case of wifi or bluetooth you don't have to think about if your transfer medium supports the protocol or not (it's just dumb vacuum). In the case of USB the cable can be the weak link. Also in the case of wifi and bluet
971.
by leni536 9y ago
https://wiki.debian.org/ReproducibleBuilds
972.
by leni536 9y ago
> I was surprised that the prints were better without adjusting for gamma. Ha, it was the same for me. I used imageworsener where I had to explicitly specify -nogamma for this effect. An other place where wrong gamma handling accidentall
973.
by leni536 9y ago
https://imgur.com/595mX6m Done with imageworsener[1]. imagew -cc 2 -dither f -grayscale diR72k2.jpg diR72k2_dither.png [1] http://entropymine.com/imageworsener/
974.
by leni536 9y ago
Also a paper about halftoning on laser printers: http://users.eecs.northwestern.edu/~pappas/papers/pappas_ist... I have never used a laser printer that did implement anything like this, the usual halftoning sucks.
975.
by leni536 9y ago
I had good experiences with x2go [1]. I also tried winswitch, as I remember it worked well too [2]. Both support the NX protocol. About NAT/firewall zerotier[3] solves most of my issues. [1] https://wiki.x2go.org/doku.p
976.
by leni536 9y ago
What's in a name? that which we call a rose By any other name would smell as sweet; From "Romeo and Juliet."
977.
by leni536 9y ago
Reminds me of an IOCCC entry. http://www0.us.ioccc.org/years.html#2000_jarijyrki
978.
by leni536 9y ago
grep -r --include='*.[hc]' 'SYSCALL_DEFINE.*read'
979.
by leni536 9y ago
I wonder how it would go in 3D. In 3D the relatively tiny Moon pieces have much smaller rate of hitting each other and fragment into smaller pieces.
980.
by leni536 9y ago
I think the basic idea is that highly composite numbers [1] make good bases. It's a trade off between the number of divisors of the base and the number of digits we want to learn. Note that both 12 and 60 are such numbers. [1] https:&
981.
by leni536 9y ago
Maybe ':' would be a more familiar separator because of hours, minutes and seconds (yeah, hours don't go up to 60, but whatever).
982.
by leni536 9y ago
The alternating updating of x and y is analogous to a leap-frog numerical solution of a harmonic oscillator (with y=dx/dt). If they are updated at the same time then it's explicit Euler.
983.
by leni536 9y ago
Well, the idea is obviously flawed, but I don't think the author meant geostationary orbits.
984.
by leni536 9y ago
An extra set of {} seems to be clutter to me.
985.
by leni536 9y ago
To be fair, that's not really "white hat". Also being resistant to rigging is only one of the threat models of an election. The votes remaining anonymous is another one. I doubt that you can hack that in a "white hat&quo
986.
by leni536 9y ago
> has a multiplication by 320 Huh the original implementation seems to have a lookup table instead of that, interesting. https://github.com/id-Software/wolf3d/blob/05167784ef009d0d0...
987.
by leni536 9y ago
What if I simply want to slow down the signal 2 times (without pitch correction)? Then 44.1 kHz is obviously not enough. Maybe 192 kHz is way overkill though, but I would argue that that's the point. You don't want it to become a
988.
by leni536 9y ago
Fixed, I also added a Wolfram Mathematica module that can be used with LibraryFunctionLoad.
989.
by leni536 9y ago
My approach would be something like this, but with a very "poor" generator with the parameters a=81007, c=0 and m=2^17. This approximates a low discrepancy sequence (additive recurrence with alpha=1/golden ratio). Then I woul
990.
by leni536 9y ago
> Since 320x200=64000, it could have been implemented with a 16 bits Maximum-length register. But then you have to calculate modulus for 200 or 320.

More ›