Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion
Sudoku Solver - A generic implementation of Donald Knuth's Dancing Links algorithm and a number of techniques, translated into rules, implemented in JESS.
A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.
Technical Analysis Library
Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... This is not an end-user GUI trading or charting application. It is instead targeted to application developers using either Excel, .NET, Mono, Java, Perl, Python or C/C++.
MRS/NMR analysis software
Analysis software for MRS/NMR data. Allows processing and fitting to be performed in a fully automatic workflow.
Tool for Engineering Emergent Selforganizing bEhavioR
Teeser is a java-based integration framework for engineering emergent self-organizing behavior in distributed systems. It contains tools for analysis, tuning, macroscopic probing and simulations of distributed systems. Library of tools can be extended and everybody is encouraged to provide and share its tools with the community. The main idea is to provide application designers ability to seamlessly use tools which are helpful to design self-organizing behavior. Designers can continue to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information.
The Tomographic Image Reconstruction Interface of the Universite de Sherbrooke (TIRIUS) is a Qt-based user-interface software for reconstructing 3D images from data generated by real apparatus or generated by the GATE Monte Carlo simulator.
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in 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 Branch and Bound method to solve a particular task.
Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!
In the field of technical analyis of stock trends, there are numerous, sometimes contradictory theories regarding buy and sell signals. It is the aim of this project to develop a system that takes historical data and returns the best possible strategy.
TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).
A real time inference engine for temporal logic specifications
A real time inference engine for temporal logic specifications, which is able to process and generate any binary signal through Linux IPC or files. Specifications of signals are represented as special graphs and executed in real time. Accepted language provides timed logic operators, conditional operators, interval operators, bounded quantifiers and parametrization of signals.
Projet C++ de l'IUT Informatique d'Aix-en-Provence 2010 : Réalisation d'une bibliothèque de conteneurs génériques. Par Yassine AZIMANI, Benjamin DADI, Thomas DI'MECO, Guillaume MIKOLAJCZYK et Brice VALENZA.
A framework for utilising the Genetic Algorithm in the domain of Game Theory
The "HoldemHand" project will be able to provide odds for Texas Holdem hands. This project will be able to provide the user with statistical data about the odds and possibilities of Texas Holdem Poker hands.
LibPPQ is a small C++ library with templates that aims to be a "persistent" drop in replacement for the std::priority_queue template. Other than std::priority_queue however libppq limits its priorities to be unsigned integers.
The SFTL (Simple Functional Template Library) is a C++ library that attempts to leverage the use of the C++ STL through functional programming concepts.
The Strinx library is collection of string-algorithms and containers, designed for resource-efficient software development in modern multi-threaded environments.
Waterford procedurally simulates, and visualizes, demographic development.
The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.
TommyDS is a C library of hashtables and tries designed for high performance.
Topologia Digital (Digital Topology) is a project for the development of the practical exercises of the Digital Topology course in the Applied Mathematics Department of the Computer Science Faculty (Polytechnic University of Madrid, Spain).
A standalone, STL interface to the Torch library's Support Vector Machine (SVM). It supports single or multiclass (one vs. all) classification using dot product, polynomial, Gaussian and sigmoid kernels.
The tree control library is a C++ container library which stores generic types in tree structures. Three containers are available in the library: tree, multitree, and unique_tree. The library usage and syntax is much like that of the STL.