lazar (Lazy-Structure-Activity Relationships) is a tool for the prediction of toxic activities of chemical structures. lazar derives predictions from databases with experimental toxicity data. It searches in these databases for compounds with similar structures and calculates the prediction from their measured activities.
ASpiReNN is a little C library (with Python bindings) which provides support for simple (leaky integrate-and-fire) spiking neural networks. It is primarily designed for highly recurrent networks, but it can also be used with multi-layer nets, though performance won't be the same. Though only Leaky integrate-and-fire (for the neurons) and Spike-Timing Dependent Plasticity (for learning rules) are currently implemented, adding new models shouldn't be too difficult.
Program D is a widely used AIML bot platform. It is feature-complete and well-tested. It supports unlimited multiple bots in a single server instance, and has an open-ended architecture for interacting via any interface imaginable. The standard release provides a J2EE Web application implementation. Drop-in listeners are available for IRC, AIM, and Yahoo!. It includes an automated testing framework for testing knowledge bases, and is packaged with an AIML Test Suite that verifies that the program itself complies to the AIML specification.
SCIP (Solving Constraint Integer Programs) is a framework for constraint integer programming oriented towards the needs of mathematical programming experts who want to have total control of the solution process and access detailed information down to the guts of the solver. It integrates techniques from mixed integer programming, constraint programming, and SAT solving. It can also be used as a pure MIP solver or as a framework for branch-cut-and-price. In order to use it, you have to link to an LP solver. It currently supports CLP, CPLEX, Mosek, Soplex, and XPress-MP.
The Discrete Event Calculus Reasoner allows a programmer to add common-sense reasoning capabilities to programs. It supports deduction/temporal projection, abduction/planning, postdiction, and model finding. It allows default reasoning about action, change, space, and mental states. It is based on the event calculus, a comprehensive and highly usable logic-based formalism. It helps applications understand the world, make inferences, adapt to unexpected situations, and be more flexible.
Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items into as few as possible volumes of a specific size. For example, the items might be files/directories and the volumes might be CDs or DVDs. The task of arranging items in such manner that the number of required bins is minimized is called Bin Packing, a NP-hard combinatorial problem for which no deterministic polynomial-time algorithm is known. Using heuristics, such as GAs, it is usually possible to approximate -- and often reach -- the best solution for the problem within a reasonable time.
IkeWiki is a new kind of Wiki (a so-called "Semantic Wiki") developed by Salzburg Research that allows users to collaboratively annotate pages and links between pages with semantic annotations. Such annotations are useful because they give machines a certain amount of "understanding" of the content that goes beyond merely displaying the page. This information can then, for example, be used for context-specific presentation of pages, advanced querying, consistency verification, or drawing conclusions.
N-genes is a Java framework and application for both genetic programming and genetic algorithms. The goal of this software is to offer a flexible system able to speed-up the implementation of research ideas. Complex behaviors like variable size populations or self-adaptive genetic operators can be implemented easily and quickly.