Open Source Algorithms

Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.

CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams' Rocksoft(tm) model of parametrised CRC algorithms.

JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de

MultiBoost is a C++ implementation of the multi-class AdaBoost algorithm. AdaBoost is a powerful meta-learning algorithm commonly used in machine learning. The code is well documented and easy to extend, especially for adding new weak learners.

Continuous wavelet transform library

Progressive Function Point Analysis Book Released: Print Copy: http://www.amazon.com/Progressive-Function-Point-Analysis-Estimation/dp/1502354160 EBook: http://www.amazon.com/dp/B00NH0MMAG Please support this project and its future releases ! Managers provide the architect/teams with project requirements. The architect/team returns detailed task list with estimated man hours per task making life easier for Project Managers with less guesstimates and proper business/technical process flows to justify estimates. Better Accountability: All work is accounted for in greater detail, ensuring payment. Task Bound: Every task identified and defined in a user story with well-planned set of functions Time Bound: Every task and user story has a pre-defined time limit for monitoring. Working Blueprint: Base design for development defined in Process steps. Team Involvement: Teams work together in counting process and thereby gain better insight into the project.

Lascer liefert zu einer Menge binär klassifizierter Attribut-Vektoren eine Menge von Regeln zur Beschreibung der Klassen. Die Regeln können auch mathematische Funktionen enthalten, deren Art vorgegeben werden kann.

[ARCHIVAL] The central forum for the MWE community. Share your open-source data sets and MWE extraction tools, exchange ideas on evaluation strategies and further development of the tools, and discuss theoretical definitions and linguistic properties of MWEs.

IMPORTANT: The project moved over to github! You can find it at: https://github.com/exhuma/python-cluster

The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).

Balie - BAseLine Information Extraction (in Java) This project is not maintained anymore.

CoRoPa stands for Computational Rough Paths. The aim of CoRoPa is to provide a software framework for various ideas related to Rough Path Theory, including rough differential equations and the digital description of serial data streams.

DRAMMS is a software package designed for 2D-to-2D and 3D-to-3D deformable medical image registration tasks. Released by Section of Biomedical Image Analysis (SBIA) at the University of Pennsylvania. Some typical applications of DRAMMS include, -- Cross-subject registration of the same organ (can be brain, breast, cardiac, etc); -- Mono- and Multi-modality registration (MRI, CT, histology); -- Longitudinal registration (pediatric brain growth, cancer development, mouse brain development, etc); -- Registration under missing correspondences (e.g., vascular lesions, tumors, histological cuts). DRAMMS runs in command line in UNIX/Mac OS, It accepts Nifti/ANALYZE/MetaImage image formats. It is fully-automatic --- takes two input images, and generates a registered image and (optionally) the deformation field. More information (installation, tutorial, manual, demonstration, FAQ, etc) can be found at http://www.rad.upenn.edu/sbia/software/dramms/ .

Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.

This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets.

An online judge system to judge the ACM-ICPC programming contests.

K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.

LogiDist offer a solution of "Computer Aided Logistic" with mostly informative purposes on executed pickups/delivery of merchandise. Is able to manage the whole process of purchase, order management, merchandise delivery to reduce distribution costs.

The Modular toolkit for Data Processing (MDP) is a Python data processing framework. From the user's perspective, MDP is a collection of supervised and unsupervised learning algorithms and other data processing units that can be combined into data processing sequences and more complex feed-forward network architectures. From the scientific developer's perspective, MDP is a modular framework, which can easily be expanded. The implementation of new algorithms is easy and intuitive. The new implemented units are then automatically integrated with the rest of the library. The base of available algorithms is steadily increasing and includes signal processing methods (Principal Component Analysis, Independent Component Analysis, Slow Feature Analysis), manifold learning methods ([Hessian] Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods, and many others.

NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.

The NSketch library provides implementations of most common sketch-based algorithms (histograms, quantile, frequent items, bloom filter ...). The library is written in C# for .Net.

This project intends to create an indexing search engine, for knowledge management. The primary object is to apply an information retrieval core. And implement a knowledge data discovery theory such as data mining algorithm, text mining.

NeoBio is a Java class library of Computational Biology Algorithms. The current version consists mainly of pairwise sequence alignment algorithms such as the classical dynamic programming methods of Needleman-Wunsch and Smith-Waterman.

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

PHP Business Rules is an open source application layer for PHP. The logic is defined in rules and facts. Like most Business Rule Engines (BRE) it uses the Rete algorithm.