June 1, 2016 by Chris on Web Bookmarks

Bookmarks for May 31st through June 1st

These are my links for May 31st through June 1st:

March 28, 2016 by Chris on Web Bookmarks

Bookmarks for March 27th through March 28th

These are my links for March 27th through March 28th:

February 23, 2016 by Chris on Web Bookmarks

The Seven Habits of Highly Depolarizing People – The American Interest – <blockquote>How to make friends and influence people on the other side of the aisle. </blockquote>
Using EMET to Disable EMET « Threat Research | FireEye Inc – <blockquote>Microsoft's Enhanced Mitigation Experience Toolkit, EMET, adds security mitigations beyond what's built into the operating system, but attackers are sometimes able to bypass it.
</blockquote>
Sysdig | 50 Shades of System Calls – <blockquote>The spectrogram is great at showing patterns and outliers in the behavior of a system or application. But until now you are left to your own devices to troubleshoot “what is causing this spot in the chart”?With a little more work, I was able to include it in csysdig, sysdig’s command line ncurses UI, and also enhance it to be more useful.</blockquote>

January 15, 2016 by Chris on Web Bookmarks

December 12, 2015 by Chris on Web Bookmarks

These are my links for December 11th through December 12th:

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