Open Source Java Algorithms

It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.

This is meant to be a powerful, but easy to use math software. It's by the user and for the users.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

GraphScript project is a network theory simulator based purely on Java and Java scripting engines. It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.

A graph library, developed in Java.

An enhanced Simulator based on Agent Grid Repast.It has some bugs cleared from Agent Grid Repast and has enhanced features on Group Selection Policy.

Magic Fixed Point, it's an library that abstracts the use of fixed point math for environments that doesn't have floating point operations or in places that you don't want to use the traditional floating point operations.

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.

The OS561 operating system based around FORTH/Java. The OS is to run on a VHDL chip OpenHardware design called the Minon, but could become available for other platforms. The unique point of the design is a revolutionary data compression technology.

Depending on a SICK lasescan and a created environment landscape a routing function will be implemented to give a robot a few waypoint to drive from a start point to a choosen destination.

RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. NO tool is providing a global framework to develop algorithms. Silicis is a new formal framework for designing [verification] algorithms.

Centre is a synthetic trajectory generator environment that aim to generate semantic-based trajectory datasets usable for spatio-temporal data-mining algorithms in testing and validation process.

This project has moved. Please follow the WWW link below.

This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups.

jMathematics is a Java based mathematics framework and library. It solves numerical and symbolic calculations. It is designed to be integrated in a wide range of other applications.

neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).

analysis of a web based social network (initiated by study project)

oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation; particularly (but certainly not exclusively) suitable for the financial domain.

A general OWL reasoning framework for the analysis of big biomedical data and implement a MapReduce-based property chain reasoning prototype system. OWL reasoning method is ideally suitable for problems involved complex semantic associations because it is able to infer logical consequences based on a set of asserted rules or axioms. MapReduce framework isused to solve the problem of scalability. In our experiment, we focus on the discovery of associations between Traditional Chinese Medicine (TCM) and Western Medicine (WM).