Technical Analysis Library
Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... This is not an end-user GUI trading or charting application. It is instead targeted to application developers using either Excel, .NET, Mono, Java, Perl, Python or C/C++.
Jasypt (Java Simplified Encryption) is a java library which allows the developer to add basic encryption capabilities to his/her projects with minimum effort, and without the need of having deep knowledge on how cryptography works.
Big Data Stream Analytics Framework.
A framework for learning from a continuous supply of examples, a data stream. Includes classification, regression, clustering, outlier detection and recommender systems. Related to the WEKA project, also written in Java, while scaling to adaptive large scale machine learning.
The JTS Topology Suite is an API for modelling and manipulating 2-dimensional linear geometry. It provides numerous geometric predicates and functions. JTS conforms to the Simple Features Specification for SQL published by the Open GIS Consortium.
jFuzzyLogic is a java implementation of a Fuzzy Logic software package. It implements a complete Fuzzy inference system (FIS) as well as Fuzzy Control Logic compliance (FCL) according to IEC 61131-7 (formerly 1131-7).
JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
Free Java Flowchart simulator / interpreter
An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).
An OpenSource Least-Squares-Adjustment Tool
JAG3D is a simple tool to estimate geodetic 1d, 2d and 3d-networks by a least-squares-adjustment called Gauß-Markov model. For gross-error detection, the software supports common outliers tests (based on hypothesis testing) and robust L1 norm (BIBER estimator). Moreover, the software supports deformation-analysis on the observation level. This network adjustment application supports classic observations: - Distances 2D/3D, - Directions and/or azimuths, - Zenith angles, - Levelling difference as well as - GNSS-baselines 1D, 2D and 3D. Further feature (add-ons): - Coordinate-transformation (CoordTrans), - Form analyser (FormFittingToolbox), - Datum-transformation (UTM, Gauß-Krüger, Soldner; WGS84, Bessel, Krassowski, Hayford; NTv2 ...)
Structorizer is a little tool which you can use to create Nassi-Schneiderman Diagrams (NSD). Stuctorizer is written in Java and free for any use. The code has been moved to Github: https://github.com/fesch/Structorizer.Desktop
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 collection of plug-in algorithms for the WEKA machine learning workbench including artificial neural network (ANN) algorithms, and artificial immune system (AIS) algorithms.
Common Java data structure library used by multiple projects. See http://verdantium.blogspot.com/
Open-Source Framework for Distributed Constraint Optimization (DCOP)
FRODO is a Java platform to solve Distributed Constraint Satisfaction Problems (DisCSPs) and Optimization Problems (DCOPs). It provides implementations for a variety of algorithms, including DPOP (and its variants), ADOPT, SynchBB, DSA...
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In contrast to other GA implementations, the library uses the concept of an evolution stream (EvolutionStream) for executing the evolution steps. Since the EvolutionStream implements the Java Stream interface, it works smoothly with the rest of the Java Stream API. Other repositories: - https://github.com/jenetics/jenetics Maven: - http://search.maven.org/#search|ga|1|a%3A%22j
basE91 is an advanced method for encoding binary data as ASCII characters. It is similar to UUencode or base64, but is more efficient. The overhead produced by basE91 depends on the input data. It amounts at most to 23% and can range down to 14%.
TimeFinder automatically optimizes schedules (timetables) for universities and high schools. It makes manual timetabling for the timetabler easier via a Java GUI. Export+import is supported via xml and text formats. http://timefinder.sourceforge.net/
Mathematics, linear algebra and optimisation
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 collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).
A Java workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more.
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms.
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja.
Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).