August 31, 2016 by Chris on Web Bookmarks

Bookmarks for August 31st

March 3, 2015 by Chris on Web Bookmarks

Bookmarks for March 3rd

Christmas 2011: Death’s Dominion: How fast does the Grim Reaper walk? Receiver operating characteristics curve analysis in healthy men aged 70 and over – Conclusion The Grim Reaper’s preferred walking speed is 0.82 m/s (2 miles (about 3 km) per hour) under working conditions. As none of the men in the study with walking speeds of 1.36 m/s (3 miles (about 5 km) per hour) or greater had contact with Death, th
Performance Tuning Linux Instances on EC2 –
Understanding Variance, Co-Variance, and Correlation — Count Bayesie –

January 18, 2015 by Chris on Web Bookmarks

Bookmarks for January 17th through January 18th

These are my links for January 17th through January 18th:

Falsehoods programmers believe about addresses –
zakjan/cert-chain-resolver –
Is the World Making You Sick? – Issue 15: Turbulence – Nautilus –
Working with DataFrames –
Why Perl Didn’t Win | Outspeaking – od_perl could potentially access the memory space of every other program attached to mod_perl, even if both programs belonged to different users.
mod_php solved this problem. PHP was a terrible language back then, good mostly for making very simple templa

January 1, 2015 by Chris on Web Bookmarks

Bookmarks for December 31st through January 1st

These are my links for December 31st through January 1st:

October 1, 2014 by Chris on Web Bookmarks

Bookmarks for September 30th through October 1st

These are my links for September 30th through October 1st:

These are my links for July 20th through July 24th:

Ask HN: Best-architected open-source business applications worth studying? | Hacker News -
Monospaced Programming Fonts with Ligatures | Hacker News -
The language of choice - Propositional logic was discovered by Stoics around 300 B.C., only to be abandoned in later antiquity and rebuilt in the 19th century by George Boole’s successors. One of them, Charles Peirce, saw its significance for what we now call logic circuits, yet that discovery too was forgotten until the 1930s. In the ’50s John McCarthy invented conditional expressions, casting the logic into the form we’ll study here; then in 1986 Randal Bryant repeated one of McCarthy’s constructions with a crucial tweak that made his report “for many years the most cited paper in all of computer science, because it revolutionized the data structures used to represent Boolean functions” (Knuth).1 Let’s explore and code up some of this heritage of millennia, and bring it to bear on a suitable challenge: playing tic-tac-toe.
Then we’ll tackle a task that’s a little more practical: verifying a carry-lookahead adder circuit. Supposedly logic gets used all the time for all kinds of serious work, but for such you’ll have to consult the serious authors; what I can say myself, from working out the code to follow, is that the subject offers a fun playground plus the most primitive form of the pun between meaning and mechanism.

You’re encouraged to read with this article’s code cloned and ready