Open Source Algorithms - Page 27

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.

Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.

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.

Passwords generator for IAD devices, using 3 keys and a index. The result is a fixed lenght of alphabetic characters. The algorithm works with other 3 big fixed prime numbers. These 3 numbers define a family of passwords. Finally, it provides a guaranteed functional string to use in all variety of devices without rejects.

Information Dispersal Algorithym (IDA) is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. this is a Java implementation.

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

An IEEE 802.11e EDCA and CFB Simulation Model for ns-2

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.

VB and JavaScript code which validates 10 and 13 digit ISBN, and converts between ISBN-10 and ISBN-13 (only ISBN-13 beginning with 978 can be converted to ISBN-10). May be useful during the January 2007 world-wide changeover to ISBN-13.

Integer Singular Value Decomposition Genetic Algorithm Function Fitter. This is an optimization algorithm that performs a similar role to a neural network.

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)

IVCon-TL can read and write a variety of 3D graphics file formats, converting from one to the other. Supported formats include 3DS, ASE, BYU, DXF, GMOD, HRC, IV, OBJ, OFF, POV, SMF, STL/STLA/STLB, TEC, TRI/TRIA/TRIB, UCD, VLA, WRL/VRML, XGL and more.

The Idealize Recommendation Framework supports the development of recommender systems. We have devised a set of requirements all recommender systems must address, an architecture for those requirements, a technical vocabulary and a production model.

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.

Image-In is a C++ based image processing and analysis application. It works on images, videos and cameras. Target is to help you to develop and test new algorithms via add-ons. Chains of filters can be arranged to achieve intelligent systems.

Validator e uma API para auxiliar na validação de dados.

Very basic path manipulation library. Aims to be simple, intuitive and predictable (not universal). Works with std::string and std::wstring. Configurable to support both POSIX and Windows paths (drive letters only - no schemas, network paths etc), as well as some custom formats (with limitations for simplicity). All configurations understand ".." (parent directory) and "." (current directory) and handle them during normalization. However, this library never tries to access any real file systems, and thus doesn't know anything about symbolic links. Primarily designed for usage in a secure environment with known simple limitations. For example, for working with internal application resource paths referencing a "sandboxed" virtual filesystem (like with PhysicsFS). Platform-specific path support is mainly intended for tools (e.g. map editor) which need to share a common code base (and perhaps some hard-coded resources) with the main sandboxed application (e.g. game).

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

An encryption library written in C# on .net 2.0, includes SHA1 and MD5 encryption atm. Also includes usercontrols for Visual Studio. Readme can me downloaded separately in the files section.