Article 6
A Monte-Carlo simulation is a way of numerically solving problems that involve randomness. This tutorial explains how they can be used in the context of financial valuation, with examples in Ruby.I’m...
View ArticleArticle 5
Qt Jambi Event TutorialThis tutorial / example will show you how to use QT Events (not slots-and-signals). We'll start with the following "hello world" (remember to use command line arguments -d32...
View ArticleArticle 4
Triple Buffering as a Concurrency MechanismRevised (less buggy) implementation in part II!Triple Buffering is a way of passing data between a producer and a consumer running at different rates. It...
View ArticleArticle 3
Triple Buffering as a Concurrency Mechanism (II)As a commentor on Reddit has pointed out, this implementation is flawed. The following steps illustrate how one of the buffers change be orphaned (0, 1...
View ArticleArticle 2
A Literate Programming ToolThis is the last blog post I'll be hand-writing html for. I'd like a tool that can take a markdown document (as they're easy to write) and either "weave" it into a legible...
View ArticleArticle 1
Perfect Hashes in JavaGiven a set of m keys, a minimal perfect hash function maps each key to an integer 0 to m-1, and (most importantly) each key maps to a different integer. This means you can use...
View ArticleArticle 0
Dynamic Optimisation: the Next Logical Step?Dynamic Optimisation covers a set of techniques used to optimise a piece of code at runtime based on the dynamic state and path through the code so far. The...
View Article