45 projects tagged "Mathematics"
Updated 15 Mar 2002
BioJava
| Pop | 119.91 |
|---|---|
| Vit | 2.39 |
BioJava aims to provide a comprehensive set of Java components for the rapid development of applications in Bioinformatics. It contains interfaces for representing Sequences, Features, and other important bioinformatics concepts. It can also read and write sequence data in a variety of common formats and communicate with Ensembl databases and with DAS and BioCorba servers.
Updated 07 Jul 2010
GNU CLISP
| Pop | 384.84 |
|---|---|
| Vit | 12.82 |
GNU CLISP is an ANSI Common Lisp implementation with an interpreter, compiler, debugger, object system (CLOS, MOP), sockets, fast bignums, arbitrary precision floats, and a foreign language interface that runs on most Unix variants and Win32.
Updated 28 Dec 2003
gant
| Pop | 42.39 |
|---|---|
| Vit | 2.03 |
This project is a QT implementation of the Generalized Langton Ant, which lives on a torus.
Updated 04 Apr 2003
The Quipu Maximum Entropy Package
| Pop | 42.57 |
|---|---|
| Vit | 2.53 |
Maximum entropy is a powerful method for constructing statistical models of classification tasks, such as part-of-speech tagging in Natural Language Processing. The Quipu Maximum Entropy Package is a Java implementation of the maximum entropy framework. It allows you to train, evaluate, and use maxent models.
Updated 25 Sep 2001
Torch
| Pop | 48.89 |
|---|---|
| Vit | 1.00 |
Torch is a machine learning library written in C++ that works on most Unix/Linux platforms. It can be used to train MLPs, RBFs, HMMs, Gaussian Mixtures, Kmeans, Mixtures of experts, Parzen Windows, KNN, and can be easily extended so that you can add your own machine learning algorithms.
Updated 09 Jun 2012
hmm
| Pop | 51.32 |
|---|---|
| Vit | 7.46 |
hmm is a Python module designed to work with Hidden Markov Models. The usual algorithms (Viterbi, Baum-Welsh) are implemented using Numeric Python.
Updated 04 Jan 2003
SigmaPi Neurosimulator
| Pop | 106.11 |
|---|---|
| Vit | 3.72 |
SigmaPi is a simulator for recurrent neural networks of arbitrary topology. It uses the LSTM neuron model, and implements a training algorithm based on RTRL with some extensions taken from RProp.
Updated 07 May 2002
Freehand Formula Entry System
| Pop | 40.50 |
|---|---|
| Vit | 1.00 |
The Freehand Formula Entry System is a research prototype for recognizing online handwritten mathematical notation, developed jointly by researchers in New Zealand, the United States and Canada. A user draws expressions with a mouse or data tablet, and LaTeX, a bitmap, and an operator tree are produced as output. Symbol recognition and expression interpretation are performed as the user draws.
Updated 14 Dec 2005
Koalog Constraint Solver
| Pop | 102.53 |
|---|---|
| Vit | 4.69 |
Koalog Constraint Solver is a powerful constraint solver written in Java. It provides cutting-edge technology for solving satisfaction and optimization problems, including scheduling, time-tabling, resource-allocation, puzzles (sudoku.koalog.com is powered by Koalog Constraint Solver), and configuration (Koalog Configurator is powered by Koalog Constraint Solver).
Updated 13 Mar 2010
Lindenmayer Systems in Python
| Pop | 24.37 |
|---|---|
| Vit | 1.00 |
Lindenmayer Systems in Python provides a simple implementation of Lindenmayer systems (also called "L-systems" or "substitution systems"). In basic form, a Lindenmayer system consists of a starting string of symbols from an alphabet which has repeated transitions applied to it, specified by a list of transition search-and-replace rules. In addition to the standard formulation, two alternative implementations are included: sequential systems (in which at most one rule is applied) and tag systems (in which the transition only takes place at the beginning and end of the string). Despite being implemented entirely in Python, for reasonable rules on a modern machine, the system is capable of running thousands of generations per second. Lindenmayer systems are found in artificial intelligence and artificial life and can be used to generate fractal patterns (usually via mapping symbols from the alphabet to turtle commands), organic-looking patterns that can simulate plants or other living things, or even music.
