Open Source Research Software

An open source software-defined Global Navigation Satellite Systems (GNSS) receiver written in C++ and based on the GNU Radio 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.

GAVS+ (Game Arena Visualization and Synthesis, Plus!) is an open-source tool which enables to visualize a broad spectrum of algorithmic games used in verification and synthesis, and offers a standard interface with utility functions to establish connection with engineering practice. It is developed by Department of Informatics (Unit 6), TU München. The tool is mainly is served for research and educational purposes. The software is released under the GNU General Public License (v3). A slightly outdated tutorial (in PDF) is included in the zip file.

Simple POSIX multithread Ant Colony Optimizer framework currently for solving Vehicle Routing Problem. Supports UDP, file synchronizatoin between computers.

Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.

Seeds is a project which implements Data structure and Algorithms! We aim for speed, flexible and the easy to use!

This is module for basic computation with floating point numbers. Numbers can have very wide mantissa for good precision, for realize "arbitrary-precision arithmetic". Module was adapt for BCB and MSVC compilers. Russian comments.

The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.

Dopamine is a research framework for fast prototyping of reinforcement learning algorithms. It aims to fill the need for a small, easily grokked codebase in which users can freely experiment with wild ideas (speculative research). This first version focuses on supporting the state-of-the-art, single-GPU Rainbow agent (Hessel et al., 2018) applied to Atari 2600 game-playing (Bellemare et al., 2013). Specifically, our Rainbow agent implements the three components identified as most important by Hessel et al., n-step Bellman updates, prioritized experience replay, and distributional reinforcement learning. For completeness, we also provide an implementation of DQN (Mnih et al., 2015). For additional details, please see our documentation. We provide a set of Colaboratory notebooks which demonstrate how to use Dopamine. We provide a website which displays the learning curves for all the provided agents, on all the games.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib

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

The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G

software educativo de aplicacion de metaheuristicas sobre problemas de grafos, TSP problema del agente viajero, ruta mas corta, arbol de expansion minima, etc.

ivl is a full-header template C++98 math library with convenient yet powerful syntax. It extends classic C++ syntax towards mathematical notation while making use of the language's elements like classes, structs, operators and functions. Expression written using ivl are excessively optimized. In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ivl includes a rich set of functions and operators, including operations for image processing. Seperate modules are also included. The module ivl-lina implements a linear algebra LAPACK wrapper. The module ivl-cv integrates OpenCV into ivl.

JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/