Open Source Linux Algorithms - Page 30

The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.

Util-Classes is a collection of Java classes for programming support in service for building applications. It covers a wide range of topics from simple small routines over Collection classes to larger utilities addressing IO-management, GUI topics and data safety.

JXmlSql is a Java database API ( MySql, Oracle, Access )that eliminates JDBC code. JXmlSql allows developers to define application and prepopulation SQL statements inside xml files. Options for query, insert, update, delete, report and prepopulation SQL.

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.

The JAccumulator package brings the convenient type conversion and ad hoc composition capabilities of Javascript to Java programming structures. JAccumulator is dependent upon the Jupperware (http://jupperware.sf.net) to provide Javascript-like associative list capabilities and the convenience of easy hierarchical construction.

A library to build and manipulate finite state automata, I/O automata, transducers and rational langagues in Java.

The Java Boolean Expression Library (JBEL) enhances the Java Collections API by implementing on-the-fly sorting, filtering and reasoning capabilities including, select(), collect(), reject(), detect(), doForEach() using functional programming techniques.

Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.

A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial]

JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.

JGAL is a Java Genetic Algorithms Library.

Java KellyCriterion Calculator

Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...

A 100% Pure Java(tm) Polygon Triangulation Library

Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all integers are truly random. ******************************************* Current version 1.5 is considered as STABLE version. All methods and whole class are documented via Javadoc. Credit goes to http://www.random.org

This program benchmarks the following sorting algorithms implemented in Java: Quick Sort, Heap Sort, Merge Sort, Selection Sort, and Bubble Sort. A command line GUI was created to facilitate all your benchmark needs.

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.

A Thread and Task Manager. Execute Tasks in a Thread Pool.

Sorting algorithm performance testing using a generic test interface

JavaFrameApplet is a generic base in Java for Applet in JFrame games!

JavaGO is an Open Source Java library for the Game of GO (weiqi, baduk) analysis. Implements: base game classes, montecarlo simulations, SGF reader/writer, game variants, GTP, etc. Elegant interfaces/class design. Speed efficient w/small footprint. TDD.

A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage.

A graph library, developed in Java.