LibBi is used for state-space modelling and Bayesian inference on high-performance computer hardware, including multi-core CPUs, many-core GPUs (graphics processing units), and distributed-memory clusters. The staple methods of LibBi are based on sequential Monte Carlo (SMC), also known as particle filtering. These methods include particle Markov chain Monte Carlo (PMCMC) and SMC2. Other methods include the extended Kalman filter and some parameter optimization routines. LibBi consists of a C++ template library and a parser and compiler, written in Perl, for its own modelling language.
Verish is a language for reasoning that resembles a natural language. It is equivalent to Lower Predicate Calculus, and has a built-in framework for defining and using abbreviations, and for introducing additional principles of reasoning that can be automatically expanded into a sequence of steps that use only basic principles of reasoning. It has a basic reasoning checking function, and can automatically expand one additional principle of reasoning into a sequence of steps using only the basic principles. It can also add HTML markup to a proof for display as a Web page.
Deep Mandelbrot is a small command line utility to compute pretty pictures (or movies) of any size and depth of the famous Mandelbrot set and its surroundings. The most important features are: multi-threaded computation to support modern multi-core CPUs efficiently; arbitrary precision computations (using libgmp, so only your hardware is the limit); normalized iteration count to achieve continuous coloring (and to avoid color bands); image oversampling to enhance the quality of the resulting PNG image; many selected color tables and the ability to re-color an already computed data frame; an optional histogram as a table for further analysis (e. g. with Octave or Matlab) plus chosen 'color table vs histogram' as another PNG image; and support for easy movie creation.
Hydra Slayer is a Roguelike game focused on one thing: slaying Hydras. It is inspired by mathematical puzzles about brave heroes slaying many-headed beasts. Since each weapon can only cut off a specific number of heads (no more, no less), and then the Hydra regrows some of the lost heads, to defeat each Hydra, you need to find the sequence of attacks which kills it in the least number of wounds. Hydra Slayer also features divisor weapons, blunt weapons to stun heads, missiles, and shields, and a number of other magical items which are unique to this game.
TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using the Branch and Bound method to solve a particular task.