October 11, 2015 by Chris on Web Bookmarks

Bookmarks for October 11th

Urbit preview ~2015.9.25 – – an we re-decentralize the Internet? A lot of great hackers have tried. Maybe we can't? Maybe it's just impossible?
ampproject/amphtml –
Q. Why do waveforms sometimes look lop-sided ? –
Alejandro Gervasio, Author at SitePoint –
google chrome – Javascript console: click links with certain title/text – Stack Overflow –

October 5, 2015 by Chris on Web Bookmarks

Bookmarks for October 5th

Why Intel added cache partitioning and it can increase performance by 1.3x to 3x –
TurboBytes Pulse: global DNS, HTTP and Traceroute testing – <blockquote>Instantly run DNS, HTTP and Traceroute tests across the globe from consumer network connected devices. Pulse is free and open-source.</blockquote>
Immutable Data Structures and JavaScript –

August 15, 2015 by Chris on Web Bookmarks

Bookmarks for August 15th

May 31, 2015 by Chris on Web Bookmarks

Bookmarks for May 31st

Why It Pays to Be a Jerk – The Atlantic –
Accounting for Developers 101 – Google Docs –
Pixar’s 22 Rules of Storytelling | Aerogramme Writers’ StudioPixar’s 22 Rules of Storytelling – Aerogramme Writers’ Studio –
I-Would-Like-A-Raise-Email-Template –
www.gironsec.com/WebHacking101.pdf –
ØMQ – The Guide – ØMQ – The Guide –
ignore the code: Web App Speed –
Tim Hentenaar’s Blog –
Asimov – The Relativity of Wrong –
Karplus-Strong String Synthesis – With this post I hope to share some of that satisfaction by exploring visually how the Karplus-Strong algorithm works. We're going to start off looking at simple vibrations, then introduce the Fourier transform as a means of looking at vibrations from a di
JavaScript Karplus-Strong –
xoxos.net vst rev.2015 –
The real story of how the Internet became so vulnerable | The Washington Post –

May 18, 2015 by Chris on Web Bookmarks

Bookmarks for May 18th

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