fuzzylite is a fuzzy logic control library. Its goal is to allow you to easily create fuzzy logic controllers in a few steps utilizing object-oriented programming without requiring any third-party libraries. qtfuzzylite is a Qt-based GUI for fuzzylite. Its goal is to allow you to visually design your fuzzylite controllers and interact with them in real time.
Augmented Syntax Diagrams (ASDs) provide a way to represent grammars of natural languages as directed graphs. Nodes represent instances (or usages) of words and phrase types in a language such as English. Edges link nodes together to indicate how instances of words and phrase types can follow one another to make up phrases, clauses, and sentences in the language.
RelEx is an English-language semantic dependency relationship extractor, built on the Carnegie-Mellon Link Grammar parser. It can identify subject, object, indirect object, and many other syntactic dependency relationships between words in a sentence; it generates dependency trees, resembling those of dependency grammars, and specifically, those of Dekang Lin's MiniPar and the Stanford parser. It accomplishes this by applying a sequence of rules, based on the local context, and thus resembles constraint grammar in its implementation. In this sense, it implements some of the ideas of Hudson's Word Grammar. However, unlike other dependency parsers, RelEx attempts a greater degree of semantic normalization.
Python Web Graph Generator is a threaded Web graph (Power law random graph) generator. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It supports both directed and undirected graphs. It implements a threaded variant of the RMAT algorithm. A little tweak can produce graphs representing social networks or community networks. It can also output connected components in a graph.
Amiba is a Gene Expression Programming (GEP) framework for Java. GEP is, like genetic algorithms, a branch of evolutionary computing. The framework separates the process of evolution from the process of interpretation of the chromosome, allowing the use of various schemes. For example, graphs may be used as terminals and graph operations as operators in the chromosome instead of the usual double precision numbers. It implements mutation, transposition, and recombination. Options and rates are easily configured through an XML file. A mechanism to load fitness cases in bulk is also provided.