February 22, 2016 by Chris on Web Bookmarks

Bookmarks for February 21st through February 22nd

These are my links for February 21st through February 22nd:

The Synthesizer Academy – <blockquote>Learn all about synthesis with our free synthesizer tutorials and lessons.</blockquote>
Compilers – What Every Programmer Should Know About Compiler Optimizations –
ESP8266: A $5 microcontroller with wi-fi that runs Python | Hacker News –
An open source alternative to AnyOrigin –
Pyvot 0.1.2 Documentation — Pyvot 0.1.2 documentation –

February 6, 2016 by Chris on Web Bookmarks

Bookmarks for February 5th through February 6th

These are my links for February 5th through February 6th:

January 26, 2016 by Chris on Web Bookmarks

Bookmarks for January 26th

June 1, 2015 by Chris on Web Bookmarks

Bookmarks for June 1st

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 –

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