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.
Date::Calc::XS is a Perl module that is the C/XS part which Date::Calc used to consist of. Date::Calc has become a (pure-Perl) wrapper which tries to load Date::Calc::XS, and failing that, loads Date::Calc::PP (a pure-Perl implementation which is now part of Date::Calc and used to be Date::Pcalc).
Math::GSL is a Perl API to the GNU Scientific Library, which contains a large set of tools for writing scientific computing applications, like statistical distributions, special functions, random number generators, linear algebra, numeric integration/derivatives, FFTs, wavelets, and much more.
Trad4 is a fully concurrent, thread safe, graph based programming language that scales linearly on multiple cores. It is initially intended for deployment in the financial industry to model real-time risk. Trad4 is proposed as an alternative to the Von Neumann model of computer architecture. It is a new way of arranging programs in memory and a new style of flow-of-control.
FooTex is software for converting LaTeX math markup into MathML, HTML, or PNG. It is basically just a wrapper for texvc and blahtex. It provides some extra functionality, and gives a consistent interface to the functionality of the two underlying packages. The documentation is built into the source code. When you install footex, the documentation will be installed as a man page.
Exhaustive Game Solver is a series of Perl scripts in which the computer plays either Coin Strip, Welter's game, or Mancala against the user. In the case of Sudoku, it solves the puzzle. The scripts use a recursive algorithm in which the game tree is searched for sure winners, positions from which the computer cannot lose. Since the search is CPU intensive, lookup tables have been generated.