Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.
"Blue Planet" is a research project simulating the behaviour and darwinian evolution of unicellular lifeforms, each controlled by its own genetic program. Moreover, "Blue Planet Inhabitants" are suited for swarm intelligence and swarm research.
Classic & Modern Cryptography tools
Cryptography Tools is a project to develop demonstration tools on classic (currently Caesar and Playfair) & modern crypto-systems, including private & public key encryptions, digital signatures, cryptographic hashes and authenticated encryption.
The LisBON Framework is an adaptable framework for developing new parallel Memetic Algorithms (hybrid search algorithms for efficiently solving optimisation problems).
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide controllable adjustment range, which thereby makes it possible to provide optional modes of recommendation aiming different kinds of users.
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
Functions for creating random (pronouncable) "names", such as are used in a rogue-like. Some of the better names: Kehizarich, Awzecharz, Vizoueurv, Rieri
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. More commercially-friendly licenses may be available. Please contact Stephen O'Hara for license options. Please view the wiki on this site for installation instructions and examples on reproducing the results of the papers.
PPFN, it is also a tool to be hidden from any server log, these developers know what they have to do. Do you? If you download this ultimate package you will be able to enjoy the web knowing that you would be safe. So be safe, learn to surf right - PPFN
A univariate and multivariate analysis UI. This project is no longer under development. Please use as you wish.
A Python computer vision library
PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries.
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
Bit operations on integers for Python - fast C implementation of bit extraction, counting, reversal etc.
Pure-python binary fixed-point arithmetic library
This Python module provides basic facilities for mathematics on fixed-point numbers. The number of fractional binary digits is tunable, allowing near-arbitrary precision arithmetic. Arithmetic & functions such as sqrt, exp, log, sin & cos are available.
Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.
BA-Arbeit 2010 TU Dortmund
compactpath is a python package to handle compacting of filepaths. compacting of filepaths may be useful in gui programming where filepaths of arbitrary lenght have to be displayed in widgets with limited visual space.
Algorithms that run our universe | Your personal library of every algo
Python functions that Googlers have found useful.
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja.
Store your pieces of code and search it quickly
Python library for a fast and flexible graph data structure.
Poor Yorick's Python Library. Includes: stream (a way to work file-like objects), a parallel regular expression engine, vectorized versions of common functions, pipeline (access shell pipelines of arbitrary length as a file-like object).
IMPORTANT: The project moved over to github! You can find it at: https://github.com/exhuma/python-cluster
ngram is a module to compute the similarity between two strings. It is different to python's "difflib.SequenceMatcher" in that it cares more about the size of both strings. ngram is an port and extension of the perl module called "String::Trigram