Open Source Java Algorithms - Page 4

Beagle is Java open source framework for running and managing nondeterministic algorithms such as genetic algorithms for solving complex problems. Beagle is fully modular and maintains whole history of algorithm progress for further analysis.

Bebops ("Belief Base Operations") provides semi-revision, contraction and kernel operators for an OWL-backed Belief Base.

This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.

BinBase is a software for the automatic analysis of Massspec data from LECO GC-Tofs. All code and documentation has been moved to the google code site of this project: https://code.google.com/p/binbase/ And support is provided by the company coding and more, which can be reached under: contact@codingandmore.org

This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. In Proceedings of the BioNLP 2011 Workshop Companion Volume for Shared Task, Portland, Oregon, June. Association for Computational Linguistic

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.

Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.

Bricks4J is a set of common tools, utils and classes for Java, aiming to ease development for a widespread kind of tasks.

The mathematical morphology have different applications on Image processing, it represent one processing non lineal sample. We show the CIDEFORM software as result of all mathematical morphology techniques.

A Color Management System library implement by Java language.

CSGraph is a simple graph library. It provides the most popular algorithms to create and manipulate graphs.

Continuous wavelet transform library

Calamari is a collection of Java APIs for implementing genetic algorithms, neural networks, and vehicle simulation. It is still being designed and developed.

The Catalsyt Framework is a refinement on the MVC framework. It provides greater focus on user business workflow rather than application workflow. It's goal is to enable business analysis and developers to work closer.

Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.

It consists of a library of Java classes that gives us support the programming of applications. Boring, repetitive tasks will be included in CommunityUtil. So this is the aim: to provide fast that encapsulates all classes complicated tasks.

CILib is a framework for developing Computational Intelligence software in swarm intelligence, evolutionary computing, neural networks, artificial immune systems, fuzzy logic and robotics.

Automatic Solver for Railway-related conflicts

Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.

Creating an automated 3D enviroment for the transport of containers. This will be done by using a server-client method. The project goal is to create a fast algorithm.

The Customizable Caching Framework provides a basic but robust implementation of a cache with expiry and memory management features. It also provides entry points to populate the cache, making it reusable in several applications.

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.

DIProxy is integrated some DIContainer. And DIProxy reject relation between WebFramework and DIContainer. added DIProxy is implemented Dynamic injection. see at http://diproxy.wiki.sourceforge.net/

A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).