BWF (Bad Word Filter) is a PHP class that uses PCRE to find bad words in strings, and returns an array of bad words found (optionally includiung the offset of each match.) The class is language aware, but currently there are only English libraries.
Simple Genetic Algorithm is an API for programming simulations that implement a genetic algorithm. A genetic algorithm is a search technique used in artficial intelligence to find approximate solutions to optimization and search problems.
GFP use Genetic Programming and LISP-like language for growing program.
OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.
Cutting Problem solved by Genetic algorithms. The goal is to cut a rectangular plate of material into more smaller rectangles. The cuts must be rectangular and guillotinable.
Fast 256 bit hash algorithm and simple command line utility. Also does sha-1 and sha-256.
OpenOpt is FREE (GNU GPL v.2) MATLAB/Octave toolbox, powered by user-contributed solvers & ideas. Scaling, updating counters etc is performed by OpenOpt BaseModule. Local & global solvers, easy interface, possibility of graphical output, etc, etc. Enjoy
A 2D rigid physics simulator and set of genetic algorithm tools. Evolve cute little walking creatures.
This project represents a .NET library, written in c# which should help to developers. This library will contain a lot of string algorithms,Ar/Ge Progression algorithms, etc.
Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
Portable, optimised implementation of Bruce Schneier's 64-bit symmetric block cipher, Blowfish. Includes support for ECB, CBC, CFB, OFB and CTR block cipher modes, weak key detection and parallelisation using OpenMP.
AAARF, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in a genome.
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
Vigenere brute force / dictionary cracking tool
This is a tool that uses a combination between a brute force and dictionary attack on a Vigenere cipher. At present, keys are generated using brute force (will soon try passwords generated from a dictionary first). Each key is then used to decode the encoded message input. The output is analysed and then put into a ranking table. Outputs will be ranked on a variety of factors (at present, only number of dictionary words in output are counted). For the future: Better key generation, trying combinations of dictionary words with numbers. If that fails, brute force will be used. For all attempts of the dictionary attack, only keys within the known key length range will be generated. Better ranking system and analysis of possible decoded messages. Note: The version currently released, I made in an evening! It is nowhere near ready for release but is a fun project to think about and I need more ideas for improvements mentioned above. Discuss possible solutions and ideas!
jPasswordWallet strores your passwords in security. Find, modify or create quickly a password in the database. Organize your passwords as you like with creating categories and sub categories.
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
String matching algorithms implementation for Lisp
Common Lisp provides a SEARCH function to lookup given keys in a string, but its implementation can be subotimal: it can be beaten in some cases by even the simpliest brute-force algorithm. This project is aimed at implementing robust string matching algorithms for Common Lisp.
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.
Java implementation of Directed Acyclic Graph
TCache is high performance key/value storage component. It can be easily plugged into any existing high-performance, distributed memory object caching systems such as MemcacheD or Dynamo, speeding up dynamic web applications by reducing database load
This is a validation of Melanie Mitchell, James P. Crutchfield, and Rajarshi Das experiments summarized in a review published in 1996. It is essentially a duplication of the experiments with a supporting database and structure. Original Paper from Mitche
GPU-based Textual kNN (GT-kNN)
The following code is a parallel kNN implementation that uses GPUs for the high dimensional data in text classification. You can use it to classify documents using kNN or to generate meta-features based on the distances between a query document and its k nearest neigbors
TAC-AI is an infantry combat simulator using XML to store unit status, and pluggable AI modules to make strategic and tactical decisions. Replace the default TAC-AI modules with your own and see how your forces perform against an opponents logic.
A framework for domain-specific, hyper-heuristic evolution
HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain.
Ada framework providing work sharing/seeking services for distributing work amongst CPU cores on multi-core machines.