Open Source Algorithms - Page 14

Animal is a Java-based system for visualizing and animating algorithms and data structures. Available since 1999, it is one of the established AV systems, and provides one of the largest collections of supported algorithms. Animations can be generated on the fly based on user input - for a large selection of algorithms and topic areas, including, but not limited to, the topic areas of backtracking algorithms, compression, cryptography, basing, searching and sorting.

Animants are virtual ants. Their name comes from the combination of "ants" and "animats", an animat being "a sofware approximation of a living creature". Animants aim to simulate the behaviour of living animals.

An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes

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

Our aim is to create a collection of useful and free Ansi C libraries of code that are portable around systems.

The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013.

The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).

We live in very exciting times 😃! BLDC motors are entering the hobby community more and more and many great projects have already emerged leveraging their far superior dynamics and power capabilities. BLDC motors have numerous advantages over regular DC motors but they have one big disadvantage, the complexity of control. Even though it has become relatively easy to design and manufacture PCBs and create our own hardware solutions for driving BLDC motors the proper low-cost solutions are yet to come. One of the reasons for this is the apparent complexity of writing the BLDC driving algorithms, Field oriented control (FOC) being an example of one of the most efficient ones. The solutions that can be found online are almost exclusively very specific for certain hardware configurations and the microcontroller architecture used. Additionally, most of the efforts at this moment are still channeled towards the high-power applications of the BLDC motors and proper low-cost FOC.

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

Aim is to develop a library of utility functions to efficiently simulate division, multiplication, mod, finding first 1/0 bit etc. (using shift and add/subtract) for software development on low cost dsp systems lacking these.

High-performance computing code and libraries used in the High Performance Computing subject in Telecommunications Engineering at the University of Granada (http://geneura.ugr.es/~jmerelo/asignaturas/AAP)

Test of Artificial Life

Toolbox for Java developers. Includes right now only a multi-layered extensible cache system but will grow depending on requirements.

Delphi class which implements an associative array. Keys can be strings or integers. Keys are stored in Red-Black tree. Array can contain TObjects or it descendants.

The Asterisk Config PHP-Parser claims to be a simple but effective function writen in PHP non-OOP that is capable to parse any standard .conf Asterisk configuration file an drop the data into a multi-dimensional array.

Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.

AsyncSocket is a python module used for asynchronous socket connections that supports connection and read/write timeouts.

Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.

Very useful framework library, contains many frequent used code snippets, algorithms, data structures, WinForms & APS.NET controls for all-day work.

Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;

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

For arbitrary precision mathematics PHP offers the Binary Calculator which supports numbers of any size and precision, represented as strings. This project replicates this in JavaScript (bcadd, bccomp, bcdiv, bcmul, bcsub, etc)

A C++ library for Bayesian computation, including a collection of more generally-applicable utilities.

Balie - BAseLine Information Extraction (in Java) This project is not maintained anymore.