Open Source Linux Algorithms - Page 28

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene.

Graphserver provides fast shortest-path computations on very large graphs, for use as a sub-component of a trip-planning service.

Gym by OpenAI is a toolkit for developing and comparing reinforcement learning algorithms. It supports teaching agents, everything from walking to playing games like Pong or Pinball. Open source interface to reinforce learning tasks. The gym library provides an easy-to-use suite of reinforcement learning tasks. Gym provides the environment, you provide the algorithm. You can write your agent using your existing numerical computation library, such as TensorFlow or Theano. It makes no assumptions about the structure of your agent, and is compatible with any numerical computation library, such as TensorFlow or Theano. The gym library is a collection of test problems — environments — that you can use to work out your reinforcement learning algorithms. These environments have a shared interface, allowing you to write general algorithms.

HL7 to XML Transformation toolkit. Using HL7 v2 XML

A Constraint Programming engine with many examples (planning, sudoku solver...)

Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454.

Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.

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.

This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.

The Hungarian algorithm can be described as optimally solving a workers versus jobs assignment problem that minimizes total cost. This implementation assumes a square cost matrix, i.e. the number of jobs equals the number of workers to do them.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

This project provides some hyperheuristics, implemented as C libraries. A hyperheuristic can be used to handle any optimization problem, as long as you implement some simple specific code to interact with it. Some examples/applications are also provided.

Hêbê (Ήβη) Goddess of youth Project legacy, the rebirth of classic games.

I is a cross-platform programming language designed towards efficiency during development and at runtime.

The IEEE 1619 Committee open-source reference implementations of encryption algorithms, plus testing and certification suites, for each encryption algorithm included in the standard.

ISAD is a peak detection software that detects individual (pre-)synaptic activity in microscopy images from neuronal cultures transfected with pHluorin. It computes synaptic signals from automatically segmented regions of interest and detects peaks that represent vesicle fusion events, thus, pre-synaptic activity. ISAD is based on MWA, which is a continuous wavelet transform based algorithm that employs multiple wavelets and is published as: Sokoll, S., Tönnies, K., and Heine, M. Detection of Spontaneous Vesicle Release at Individual Synapses Using Multiple Wavelets in a CWT-Based Algorithm. Med Image Comput Comput Assist Interv (MICCAI). 2012;15(Pt 1):165-72 ISAD is written in MATLAB and comes with a graphical user interface.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

A multi staged approach to the examination timetabling problem as described in the second International timetabling competition (ITC2007-2008)

Inspired by Grokking Algorithms and python-execution-trace, this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution. Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works. The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. Literally the same source file. Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. So is pausing and resuming. This project uses styled-jsx, but takes the idea of CSS-in-JS even further. Sizing, positioning and transition offsets are computed by JS, all before elements hit the DOM.

This repository provides the iHarmony4 dataset, which is a large-scale dataset designed for image harmonization tasks. Image harmonization involves adjusting the appearance of a foreground in a composite image so that it is consistent with the background (in color, tone, illumination, etc.). The iHarmony4 dataset comprises four sub-datasets (HCOCO, HAdobe5k, HFlickr, Hday2night), each making composite images by combining a foreground from one image with a background from another, along with associated ground truth harmonized images and foreground masks. The dataset is intended as a benchmark resource to enable and standardize research in image harmonization. Each composite sample has: composite image, foreground mask, and corresponding real harmonized image.

An applet designed to demonstrate visually the steps taken by two sorting algorithms -- Insertion sort and Selection sort.

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

This is an intelligent Sudoku solver in c++. It is intlligent, because it uses several logical deduction methods, just like a person, before resorting to guessing. I was trying to teach my kids Sudoku, and taught a computer as proof of concept.

‘intelliworm’ is a prototype simulation of a Intelligent Species of a common earth worm,which inherits human like decision making capabilities through Neural Network intelligence representation,all developed by integrating .NET with Lisp and Yacc.