akrasuski1 | 6 years ago | on: Adventure Games and Eigenvalues (2017)
That is not enough, since you may still get stuck in a loop.
akrasuski1's comments
akrasuski1 | 7 years ago | on: Converting Wi-Fi signals to electricity with new 2-D materials
40 microwatts of power, to be precise. Compared to, say, 5V*1A=5W of typical phone charger, this is impractical by a large margin.
akrasuski1 | 7 years ago | on: The art of creating very tiny programs for the 80x86 family of CPUs
Another nice site aggregating many clever tiny x86 programs: https://www.xorpd.net/pages/xchg_rax/snip_00.html
akrasuski1 | 7 years ago | on: CLI: Improved
This could actually be caused by disk caching effects. Have you tried running cloc second time afterwards?
akrasuski1 | 7 years ago | on: Mod and remainder are not the same
Well, that's why I always define RED(x) (for reduce modulo) as ((((x) % MOD) + MOD) % MOD). Quite useful in algorithmic competitions, which often ask you for answer modulo some prime.
akrasuski1 | 7 years ago | on: GitHub is down
And thus you used a throwaway account...
akrasuski1 | 7 years ago | on: A Linguistic Enclave in Central Europe
From the listed words only two have immediately obvious Polish connotations (dźjada (grandpa), and dziadek is grandpa in Polish; śpjelik (sparrow), where śpiewać is "to sing"). Most words have German-ish sound to them, somewhat similar to Silesian subdialect of Polish (though Silesia was occupied by Germany, which is the reason for its influence). The spelling is mostly Polish-like, perhaps from older centuries though; except for some umlauts which clearly originate in German and similar.
akrasuski1 | 7 years ago | on: The Emerald Programming Language
Looks like jewellery is popular in language namimng: we've got Ruby, Crystal, now Emerald...
akrasuski1 | 7 years ago | on: Signed Integers Are Two’s Complement
It's done so that the bits will compare the same way whether treated as float or int. (modulo NaNs and stuff)
akrasuski1 | 7 years ago | on: Show HN: Write every day, measure your progress, achieve your writing goals
The decreasing health bar looks like a really weird idea. I don't like to be forced into thinking fast, I prefer to make a clear point even if it takes longer.
akrasuski1 | 7 years ago | on: Angr – User-friendly binary analysis platform
Hm, if the example written on README is representative for current usage, then it surely changed a lot recently. I remember checking angr out a few months ago, and simply running a binary required a few dozens of, mostly boilerplate, code. I may try it again now, looks like it improved since then.
akrasuski1 | 7 years ago | on: Using Flywheel Batteries to Charge Electric Vehicles in Ten Minutes
I'm pretty sure it doesn't matter whether the eneergy is stored in rotating body, or one moving in a straight line. Kinetic energy of rotation is 0.5 * I * w^2, or for that extreme case of "concrete ring" - 0.5 * m * r^2 * w^2, which is exactly equal to 0.5 * m * v^2, or kinetic energy as calculated for body moving in straight line.
akrasuski1 | 8 years ago | on: The Kruskal Count Card Trick
It's really unrelated - it's more about the hash domain being rather small, i.e. 52. I would think that if you substitute the counting (go to card N+value) to proper hashing (go to card md5(value)%52) you would get the same, if not stronger, result.
akrasuski1 | 8 years ago | on: The 8000th Busy Beaver number eludes ZF set theory (2016)
It is possible to generate a lower bound, so it can be compared with usual numbers, like g_64 etc.
akrasuski1 | 8 years ago | on: Exploit/bypass PHP escapeshellarg/escapeshellcmd functions
Actually, the mentioned GitList exploit hinges on yet another vulnerability: lack of distinction of command-line flags and arguments. Where user expected to put "normal" name (say a-zA-Z0-9), attacker actually supplied --flag=exploit.
akrasuski1 | 8 years ago | on: Google is testing expiring emails in the new Gmail
Uhmm... screenshot the mail; self-destruction circumvented.
akrasuski1 | 8 years ago | on: The secret life of NaN
I wouldn't be surprised if the future compilers would optimize it away as well, since ffast-math basicly makes NaN's equivalent to undefined behaviour.
akrasuski1 | 8 years ago | on: A meta-analysis of C++ projects
It would be nice to divide the cooccurence count by counts of respective two headers, to get a sort of correlation. Now it's quite hard to see anything beyond "most popular things are paired with most popular things" which is obvious.
akrasuski1 | 8 years ago | on: Beep security update
Also see https://holeybeep.ninja/
akrasuski1 | 8 years ago | on: Discontinue support for weak cryptographic standards
That is honestly a great idea for safe-ish deprecation in uninformed environment!
page 1