Open Source Algorithms - Page 7

TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.

The ccgsl provides simple C++ wrappers for the GNU Scientific Library. It uses Java-like shared-pointer classes in place of structs to avoid direct memory allocation/freeing and to work better with the STL. It lets you construct functions for optimisation, root-finding and the like from C++ member functions, making it easier to integrate with existing C++ code. It also provides C++ exceptions.

Pascal libraries and components. Library for: Matrix, Matrix Math, Math & statistic, CSV, URL, Counters, dir/file scanning, file/string/… utils, progress bar, … Components: DataList, Line oriented reports, Gauge, Syllable (Italian), …

Python functions that Googlers have found useful.

User AES-128 bit encryption in counter mode of operation. supports interactive mode of operation and command line mode of operation.

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

Delphi library of standard containers for keeping ordinal and structured datatypes.

An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library.

Online Signature Verification technology requires primarily a digitizing tablet and a special pen connected to the USB port of a computer. An individual can sign on the digitizing tablet using the special pen regardless of his signature size and position. The signature is characterized as pen-strokes consisting x-y coordinates and pressure with the data being stored in a signature database. Dynamic time warping (DTW) and quadratic discriminant analysis (QDA) is used to get results where the system accepts 2% of forged signatures and rejects 5% of true signatures

Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm

minidjvu is a DjVu encoder for black-and-white images.

Significant gains in processing times when sorting arrays with structure in the data. Pre-sorted arrays with relatively few modifications may be sorted 20-30 times faster than Delphi's default QuickSort. The project includes a test suite.

Progressive Function Point Analysis Book Released: Print Copy: http://www.amazon.com/Progressive-Function-Point-Analysis-Estimation/dp/1502354160 EBook: http://www.amazon.com/dp/B00NH0MMAG Please support this project and its future releases ! Managers provide the architect/teams with project requirements. The architect/team returns detailed task list with estimated man hours per task making life easier for Project Managers with less guesstimates and proper business/technical process flows to justify estimates. Better Accountability: All work is accounted for in greater detail, ensuring payment. Task Bound: Every task identified and defined in a user story with well-planned set of functions Time Bound: Every task and user story has a pre-defined time limit for monitoring. Working Blueprint: Base design for development defined in Process steps. Team Involvement: Teams work together in counting process and thereby gain better insight into the project.

This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation

Use, study and develop advanced digital halftoning algorithms with Halftone Laboratory, a GIMP plug-in backed by a highly modular and extensible library. It uses .NET/Mono and GIMP#.

The Mars Rover Simulator project is based on the evolutionary robotics paradigm where an artificial agent acquires its skills through the process of artificial evolution. This simulator can be useful to evolve neural network controllers for the rover

Common Java data structure library used by multiple projects. See http://verdantium.blogspot.com/

[ARCHIVAL] The central forum for the MWE community. Share your open-source data sets and MWE extraction tools, exchange ideas on evaluation strategies and further development of the tools, and discuss theoretical definitions and linguistic properties of MWEs.

A program that can learn from midi examples, and create new music from that.

Es un editor de código ligero y fácil de usar, diseñado específicamente para la programación en Python. Su interfaz intuitiva permite a los usuarios, tanto principiantes como experimentados, escribir, editar y ejecutar código de manera eficiente.

Refal.NET - Versatile, Compact yet Powfull Text Transformer and Compiler-Writing System. Based on Refal.NET Virtual Machine (+Refal.NET Compiler), this RAD-tool might be used for rapid prototyping, decreasing up to 10 times development efforts.

* Requires : .net framework 4.5 or later Sudoku , This application developed using C# and requires .net framework 4.5 or later. GUI supports better good feedback for each and every action. To easy to handle. Save and reuse the Sudoku file , all files are stored as .sdku files ( sudoku files ) and this files are opened only through this application. Use it and rate it !

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.