Binary Puzzle Solver in Ruby is an automated solver for Binary Puzzles (a kind of logic game) featured on http://www.binarypuzzle.com/. The solver contains an API and a commandline program and explains why it thinks the player should place a 0 or a 1 in the box. Although it contains only a subset of the moves the authors could think of and does not use backtracking, it was able to solve all the puzzles from binarypuzzle.com which the authors tried.
markov.sql implements third order (and lower) model Markov Chains, including training and generation, in pure SQL(ite). The source code archive also contains a pre-trained SQL dump with models based on the 1990 US Census Bureau data sets for first and last names, and an excerpt of the 2012 US tax office corporation names.
LMDB is an ultra-fast, ultra-compact key-value data store developed by Symas for the OpenLDAP Project. It uses memory-mapped files, so it has the read performance of a pure in-memory database while still offering the persistence of standard disk-based databases, and is only limited to the size of the virtual address space (it is not limited to the size of physical RAM).
Unnamed un-names unwanted DNS entries. It was written to solve the problem of upstream DNS servers inserting bogus records for NXDOMAINs. It can be used to filter unwanted domain names like ads, porn, time wasters, etc. It is modular, so extensions are easy. Extensions can be written in Lua or compiled as shared objects.