Open Source Algorithms - Page 17

The Spiffy framework is a collection of often used helper methods and utility classes used in industry. Such methods and classes solves existing and re-ocuring practical problems and remedies annoying features of the Java language.

Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

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

Sub::Contract offers a pragmatic way to implement parts of the programming by contract paradigm in Perl.

Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters.

SweenJet helps developers to create Java applications. It provides constrained models, useful Swing components (e.g. splash screen, input fields), actions, look-and-feel enhancements (e.g. themes, multi-line tooltip), and a complete preferences system. This project is no longer actively developed.

Teeser is a java-based integration framework for engineering emergent self-organizing behavior in distributed systems. It contains tools for analysis, tuning, macroscopic probing and simulations of distributed systems. Library of tools can be extended and everybody is encouraged to provide and share its tools with the community. The main idea is to provide application designers ability to seamlessly use tools which are helpful to design self-organizing behavior. Designers can continue to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information.

The Tomographic Image Reconstruction Interface of the Universite de Sherbrooke (TIRIUS) is a Qt-based user-interface software for reconstructing 3D images from data generated by real apparatus or generated by the GATE Monte Carlo simulator.

Tina's Random Number Generator Library (TRNG) is a state of the art C++ pseudo-random number generator library for sequential and parallel Monte Carlo simulations.

Taseree has been renamed to Drools Planner and moved to JBoss.org, see http://www.jboss.org/drools/drools-planner

TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

A framework for utilising the Genetic Algorithm in the domain of Game Theory

The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.

LibPPQ is a small C++ library with templates that aims to be a "persistent" drop in replacement for the std::priority_queue template. Other than std::priority_queue however libppq limits its priorities to be unsigned integers.

The SFTL (Simple Functional Template Library) is a C++ library that attempts to leverage the use of the C++ STL through functional programming concepts.

The Watermarks is a java library for images and text watermarking fingerprinting and tamper-proofing. The supported carrier formats for a watermark are JPEG and PDF. The project also aim to build a test environment to evaluate robustness of implemented a

The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.

Theba is a plugin-based image analysis framework for segmentation of and measurements on 3D and 2D images. Theba has a nice GUI that allows inspection and manipulation of the image and a wide range of plugins including segmentation.

Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI

TommyDS is a C library of hashtables and tries designed for high performance.