Open Source Linux Algorithms - Page 11

A markup language for expressing knitting patterns which can serve as a software interchange format

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

LAITOR is a text mining software developed to find co-occurrence of biological entities (gene/protein terms) together with biointeractions and concepts term from customized dictionaries.

This project hosts a library and tools for sharing simulation experiments encoded using SED-ML.

The below is a list of all files released for the Crossbow's MNAV100CA with SPB400. This framework may provide a complete solution for AHRS, Navigation, WiFi Comm, and Data Logging, for various robotic applications.

The project is a collection of object pascal libraries for parsing text strings and markup languages HTML, XHTML, XML, CSS and others. Libraries are written in minimalism concept with striving for wide unification.

NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.

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.

The optex module for Python 2.4 helps user scripts to parse command line arguments found in sys.argv. Options are parsed in a different manner than the Unix getopt() and Python getopt module.

A P2P overlay construction toolkit, which supports routing algorithm researchers in addition to application developers. It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu

The classes in stdfuncs.inc.php provide general functions you can use while developping a PHP Application / Website or whatever. - Debugging - Time measurment - Sorting and Grouping - JSON Encoding - XML-Reading - FileSystem - Date handling

PHPNN Is an open source, GPL licensed, PHP class library for the easy creation and manipulation of Neural Network based artificial intelligence. This library is intended for use in experimentation, games, quality control, or any other purpose.

PopED (Population Experimental Design) is a software tool for computing optimal experimental designs. The software has been developed with an emphasis on drug trials based on population models (non-linear mixed effects models).

ProViz is a program visualization framework for Java. It is built as a plugin to the Eclipse IDE. (We are getting close to publishing resources and making this project distributable. Stay tuned!) A video demo: http://www.youtube.com/watch?v=BsoK1n-OM

PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.

This library is meant to offer an array of general purpose data structures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.

A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

Ropes are a scalable string implementation that are designed for efficient operation by utilizing lazy operations such as concatenation and slicing. This is a python C module which implements ropes for pythons.

The Simple RTF Writer (SRW) is a slim Java library which empower Java programms to create RTF ("Rich Text Format" - an alternative document format from Microsoft) documents and fill bookmarks and fields in existing RTF documents on any platforms.

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.

An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.

The Vodoo/Stream project let users to define transducers dedicated to document analysis. Such transducers describe how fragments are matched and transformed. Finally a document can be an XML fragment, a free text or something else depending on extensions

Track your friends in real time on a map.. and many more features