The Graphical Models Toolkit (GMTK) is a toolkit for rapidly prototyping statistical models using dynamic graphical models (DGMs) and dynamic Bayesian networks (DBNs). It can be used for speech and language processing, bioinformatics, activity recognition, and any time series application. It features exact and approximate inference, many built-in factors including dense, sparse, and deterministic conditional probability tables, native support for ARPA backoff-based factors and factored language models, parameter sharing, gamma and beta distributions, dense and sparse Gaussian factors, heterogeneous mixtures, deep neural network factors, and time-inhomogeneous trellis factors, arbitrary order embedded Markov chains, a GUI graph viewer, and much more.
libefgy is a set of C++ headers containing lots of templates loosely related to maths. The headers include templates for fractional arithmetic, big integers (and thus "big fractions"), calculating π, e, and some calculations with those (for trigonometrics), matrix manipulations, tuples, polar and Euclidian spaces in arbitrary dimensions, (perspective) projections, colour space manipulations in RGB and HSL, and assorted other things.
MLPACK is a C++ machine learning library with an emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and maximum flexibility for expert users. It contains algorithms such as k-means, Gaussian mixture models, hidden Markov models, density estimation trees, kernel PCA, locality-sensitive hashing, sparse coding, linear regression and least-angle regression.
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.
GTKMathplot is an interactive plotting program based on GTK+ and the Cairo graphics library. It can display bidimensional curves, tridimensional curves, and surfaces from Cartesian or parametric equations describing the mathematical objects you would like to visualize. It is designed to be intuitive for high school students with good mathematical knowledge. University students of engineering, physics, mathematics, or natural sciences should need no explanation at all to start using it proficiently.
QMentat helps you practice mental arithmetic. It uses arbitrary-length fixed point arithmetic, and can handle any size numbers, only limited by the size of your screen (and in the case of division with an integer result, the speed at which the number can be factored). It is also quite configurable, allowing you to tailor the questions to your needs.
SCaVis is an environment for scientific computation, data analysis, and data visualization designed for scientists, engineers, and students. The program can be used for function and data plotting in 2D and 3D, histograms, statistical analysis, and symbolic calculations using the Matlab/Octave high-level interpreted language.
librsb is a library for sparse matrix computations featuring the Recursive Sparse Blocks (RSB) matrix format. This format allows cache-efficient and multithreaded (that is, shared memory parallel) operations on large sparse matrices. The most common operations necessary to iterative solvers are available (matrix-vector multiplication, triangular solution, rows/columns scaling, diagonal extraction/setting, blocks extraction, norm computation, formats conversion). The RSB format is especially well-suited for symmetric and transposed multiplication variants. On these variants, librsb has been found to be faster than Intel MKL's implementation for CSR. Most numerical kernels code is auto-generated, and the supported numerical types can be chosen by the user at buildtime. librsb implements the Sparse BLAS standard, as specified in the BLAS Forum documents.