September 30, 2015 by Chris on Web Bookmarks

Bookmarks for September 29th through September 30th

These are my links for September 29th through September 30th:

Spark Framework – A tiny Java web framework – <blockquote>Spark Framework – Create web applications in Java rapidly. Spark is a micro web framework that lets you focus on writing your code, not boilerplate code.</blockquote>
Pitch Shifting Using The Fourier Transform | Stephan Bernsee’s Blog –
A Matter of Perspective | somethingaboutmaps –

December 24, 2014 by Chris on Web Bookmarks

Bookmarks for December 23rd

October 8, 2014 by Chris on Web Bookmarks

Bookmarks for October 8th

hacklang.org –
www.ng-newsletter.com –
tutorialzine.com –
www.svp-team.com –
www.toptal.com –
Useful Color Information, Studies and Files –
The Age of Point-at-Things… | plasticbag.org –
Sikuli Script – Home –
Productivity – Sikuli Script –
An illustrated guide to the atomic bombs – Loading
Tetris in Clojurescript – Favorites
Fullstack.io Education – Expert courses for building web applications –
Origami – Design prototyping with Quartz Composer –
Designing a class: WordPress API client | The Man in the Arena –
Talking To Vula –
Favorites –
Academic urban legends –
Use drush to add a component to a feature like a drupal pro | Mike Stiv –
Building a race simulator | f1metrics –
The intelligentF1 Model | intelligentF1 –

June 22, 2013 by on Web Bookmarks

Bookmarks for June 10th

video conversion – Handbrake settings to convert MKV to MP4 while retaining the original quality – Super User –

February 9, 2012 by chris on Web Bookmarks

Bookmarks for February 9th

Index of / –

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