lmadl automates the downloading of shows and the subsequent processing of the audio files from the live music archive at www.archive.org/audio. lmadl takes as its argument the URL of the Live Music Archive index page for a show, finds the available files, and asks the user which format to download or to quit. When lossless formats (shn or FLAC) are downloaded, it will run shn2make on the resulting files to facilitate creation of audio CDs, archive CDRs, or encoding to lossy formats. It supports interruption and restarting of downloads.
BDDs [bry86] (or more precisely ROBDDs) are efficient data structures for representing a boolean formula. They are widely used in formal verification, in particular symbolic model-checking. Ruby- BDD, based on Buddy, provides access to BDDs from Ruby, a powerful and very easy to use object-oriented language. The purposes are quick prototyping and education.
The d command runs a command in the background and redirects its output to a file. The output file is annotated with start and end time, the actual command used, cwd, host, etc. You can ask the d command to extract the last command from the output file and run it again, you can ask it to append to the file or not, and other goodies. It comes with handy little programs to look at the output, tail it, etc. It is sort of trivial, but has been streamlined over many years.
htrosbif is a tool that actively probes an HTTP server. It prods the Web server in all sorts of old, new, basic, fancy, spec-compliant, and spec-breaking ways. It tries to characterize both the well-spoken educated responses and the seriously deviant babble it receives in return. Signatures contain no user data, only header names and HTTP-level quirks. As a useful side effect, this might detect reverse proxies, HTTP load balancers, intrusion prevention systems, and Web application firewalls.
Ruby-UDBM is a Ruby binding for the UPPAAL DBM library. It offers access to the federation type (set of DBMs) and most of its operations. In addition, a graphical viewer is provided to allow users to visualize updates on the fly. The library gives access to systems of constraints where clock constraints can be declared and used as intuitive formulas. This binding is intended to be a research prototyping tool as well as a teaching tool for students learning timed automata.
Template Manager, also known as "Tm", is a preprocessor that takes a code template and some data structure definitions, and generates source code for an arbitrary programming language. Thus, Tm lets you have templates in any programming language. The kernel distribution package of Tm contains extensive C templates and a support library that have been tested and used extensively over the past decade. There are also Pascal and Miranda templates.