Open Source Algorithms - Page 3

GuidLib is a library with functions for GUIDs (also known as UUIDs, as defined by RFC 4122).

This project aims to develop a colour-based vision processing system for use in RoboCup. We are using a CCD camera for input to an FPGA. The system locates coloured objects and outputs detected corners.

Library provides a function of 'human-like mouse movements', ie mouse movements as human. The library will be useful for those who are developing all kinds of bots for games or online casino \ poker. Written in C + +, has a small size of 13 kilobytes.

‘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.

Isolate Project is a straightforward data retrieval software that connects to popular relational database management systems and performs search operations based on the criteria specified. This project aims to speedup data retrieval operations.

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

A java framework for developing meta-heuristics that supports the use of grids environments. The meta-heuristics planned to be realeased are GAs, VNS and NNs. The grid middleware that will be firstly explored is the OurGrid solution.

JPortForwarder Project JPortForwarder is a multithreaded TCP Port Forwarder application. The following feature have been developed: - Generic TCP Port Forwarging. Listen for a port and forward to an ip:port. - Multihoming TCP Port Forwarding.

Sorting algorithm performance testing using a generic test interface

Applications involving data acquisition from sensors need samples at a preset frequency rate, the filtering out of noise and/or analysis of certain frequency components. We propose a novel software architecture based on open-software hardware platforms which allows programmers to create data streams from input channels and easily implement filters and frequency analysis objects. The performances of the different classes given in the size of memory allocated and execution time (number of clock cycles) were analyzed in the low-cost platform Arduino-Genuino. This library is free to use for research. Please cite above publication.

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.

Multicast Inter-Domain Routing for MANETs (or MIDRM) is a multicast support system for IDRM, a novel networking framework, which enables inter-domain routing between Mobile Ad Hoc Networks (MANETs) and between MANETs and the Internet.

This Project implements the mergesort algorithm in a MPICH2 (parallel programming -) environment.

Klib is a small fast lightweighted library that provides a generic hash table, a generic B-tree and generic sorting algorithms for C programmers.

Video and files download for Visual trading idea to C++ or FPGA HFT Meetup File download sample: test model (Matlab 2014b with Visual Studio 2013 C++ project generated) Powerpoint MATLAB SIMULINK http://quantlabs.net/blog/2015/04/video-and-files-download-for-visual-trading-idea-to-c-or-fpga-hft-meetup/

NOD-MP stands for not another data-mining project. It is educational and scientific software to utilize data mining clustering algorithms through a user-friendly interface.

The OS561 operating system based around FORTH/Java. The OS is to run on a VHDL chip OpenHardware design called the Minon, but could become available for other platforms. The unique point of the design is a revolutionary data compression technology.

Open Linux TSPL is a multiplatform (cross-platform) free software suite for software and web development. Open Linux TSPL helps developers create applications for Win32, Linux, Unix and Mac using one codebase. [Will be released: September, 2008]

Open Macro Library is a library of highly reusable C macros providing a set of well-designed commonly needed functionality to C developers, like logging and debugging helpers, containers, sorting and other algorithms.

OpenDiscreteDynamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network)

An Open source Java library that implements the Extractor(Turner) Algorithm for keyphrases retrieval. This is an utility for summarizing.

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?

A portable C++ library of multi-threaded STL algorithms (transform, accumulate...) using standard containers and iostreams. Thread, mutex, spinlock are templatized. Close to Intel Threading Building Blocks, HPC++ or PSTL. Idea of A.Stepanov and M.Austen.

Robot Warfare is a real-time strategy game that gives the user an opportunity to manage and program a team of battling robots that autonomously face opposing teams in a network-enabled environment.