Open Source Algorithms - Page 10

JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.

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.

JaQLib is a compact Java library that supports programmers in querying all sorts of collections, DBs and XML files in a compact and intuitive manner. Example: List<MyItem> result = Jaqlib.List.selectFrom(myCollection) .where(myCondition).asList()

A markup language for expressing knitting patterns which can serve as a software interchange format

L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/

The below is a list of all files released for the Crossbow's MNAV100CA with SPB400. This framework may provide a complete solution for AHRS, Navigation, WiFi Comm, and Data Logging, for various robotic applications.

The Mars Rover Simulator project is based on the evolutionary robotics paradigm where an artificial agent acquires its skills through the process of artificial evolution. This simulator can be useful to evolve neural network controllers for the rover

The NUMIPAD library implements several methods/algorithms to solve inverse problems and adaptive decomposition (i.e. Tikhonov regularization, Total Variation, Basis Pursuit, etc.)

A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more.

OCIPlus is a C++ library that can be used to access oracle database. It is similar to JDBC (has similar classes & methods) and can run stored procedures too.

OpenANN is a basic artificial neural network toolset. It is not being actively maintained. For performance neural networking, consider an alternative (such as https://sourceforge.net/projects/openann-project or https://www.tensorflow.org)

pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.

Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.8. There is an API document available.

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

RAS is the acronym for Result Assessment System. The primary purpose of RAS is helping users manage, visualize, assess and report results obtained from experimental search algorithms.

SDD: Duplicated code detection tool

The SiGeR library allows developers to quickly code powerful custom gesture recognizers for Tablet PC development.

in here will be all codes of my games made in simple j and you can use it freely just put my name on the credits

SolTrack is a simple, free, fast and accurate C/C++ routine to compute the position of the Sun. The code can be used to track the Sun on low-specs machine, such as a PLC or a microcontroller, and can be used for e.g. (highly) concentrated (photovoltaic) solar power. SolTrack has been developed by Marc van der Sluys, Paul van Kan and Jurgen Reintjes, of the Lectorate of Sustainable Energy at the HAN University of Applied Sciences in Arnhem, The Netherlands. The code is based on the astronomical Fortran library libTheSky and can be used, modified and distributed under the conditions of version 3 of the GNU Public Licence.

This is a small Java swing application that shows different sorting algorithms working on the same set of data. The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work.

TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.

Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!

Parser Delphi class. Extendable parser that processes numbers (int/hex/float), text constants in quotation marks (with '' \' \n, \t, \u0000, etc), brackets, lists (comma separated elements), skips whitespaces and comments like //, /* */

An online edition of the book "The Practice of Parallel Programming" and examples from it. The examples include a parallel programming framework of production quality, that has been used in another project, Triceps.

This is a tool that uses a combination between a brute force and dictionary attack on a Vigenere cipher. At present, keys are generated using brute force (will soon try passwords generated from a dictionary first). Each key is then used to decode the encoded message input. The output is analysed and then put into a ranking table. Outputs will be ranked on a variety of factors (at present, only number of dictionary words in output are counted). For the future: Better key generation, trying combinations of dictionary words with numbers. If that fails, brute force will be used. For all attempts of the dictionary attack, only keys within the known key length range will be generated. Better ranking system and analysis of possible decoded messages. Note: The version currently released, I made in an evening! It is nowhere near ready for release but is a fun project to think about and I need more ideas for improvements mentioned above. Discuss possible solutions and ideas!