L++ is a multiplayer Lemmings remake which lets you play Lemmings against (or in a team against) others (up to eight players over a network). It has a built-in level editor. Lemmings is a game in which you guide one to ninety-nine lemmings from an entry door to an exit. There are commands for stopper, exploder, digger, builder, parachuter, and much more.
TML turns text into HTML using a wiki-like markup. Unlike txt2tags, TML does not support multiple output formats (although there is some support for word documents through a separate project). HTML tags may be freely mixed into the source where desired. The output is easy to read and supports table-free CSS layouts. .include files can be used to insert blocks of code such as Google ads that appear on multiple pages. The code was written with technology normally used for software compilation for faster, more accurate parsing.
Dr. Geo is an interactive geometry program that is distributed as a universal portable application. It allows one to create a geometric sketch and manipulate it according to its constraints. It is usable at home or at school, in primary or secondary education. It is simple and effective with extended features including scripting and programming.
MetaPath is a tool for the analysis of metabolic pathways and associated visualization of experimental data. Built on the MetaCyc database, it provides an interactive map in which multiple pathways can be simultaneously visualized. Multiple annotations from the MetaCyc database are available, including synonyms, associated reactions and pathways, and database unification links. Metabolomics change data can be imported via simple CSV formats for visualization on targeted pathways. Pathways can be mined and removed algorithmically to identify key regulated pathways within a given dataset, providing a simper route to metabolic functions.
omnisode generates a Ruby program to use long Taylor series to solve systems of ordinary differential equations. It generates code to solve the equations in either Maple or Maxima. Using the Taylor series, estimates are made of the location and order of poles. It has been greatly re-worked the last few years, and tested quite a bit recently. Support may be extended to other languages in the future.
Treba is a commandline tool for training, decoding, and calculating with weighted (probabilistic) finite state automata (WFSA/PFSA). Training algorithms include Baum-Welch (EM), Viterbi training, and Baum-Welch augmented with deterministic annealing. Treba is optimized for speed and numerical stability, and training algorithms can be run multi-threaded on hardware with multiple cores/CPUs. Forward, backward, and Viterbi decoding are supported. Automata for training/decoding are read from a text file, or can be generated randomly or with uniform transition probabilities with different topologies (ergodic or fully connected, Bakis or left-to-right, or deterministic). Observations used for training or decoding are read from text files compatible with AT&T finite state tools and OpenFST.