Open Source Linux Algorithms - Page 37

PHP/MySQL implementation of the Active Record pattern. This project is highly focused on simplicity of usage, high compatibility (from php4/mysql3 up to php5/mysql5.1) and code cleaness.

Physhun is a Java framework for building and executing finite state machines in J2SE and J2EE environments. State models are defined as collections of Spring beans, and do not use proprietary modeling languages. The framework is simple and flexible.

The PowerCiph Data Encryption Algorithm is a versatile, yet simplistic, encryption algorithm/protocol. The ultimate goal of the algorithm is simplicity, compactness, and a lack of prerequisites.

Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e estudo dos mesmos.

A library that does preform precise floating point operations designed for industrial / banking solutions.

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?

PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below...

A whole lot of source code related to programming Linux systems with C

Schedule Tool is a utility for predicting the duration of projects from a series estimated task times. This tool converts the estimates to probabilities of success, and convolves successive tasks to give an estimated date of completion.

Promote is an easy to use, generic data structure and utility library for C,C++, and possibly more.

Model-based AI planner using binary decision diagrams. PropPlan parses PDDL descriptions of the domain and the problem, and outputs a plan.

Academic project aiming to write an alife Avida-like program in java.

Provisio.Collections brings STL like iterator-based containers to the .Net world (especially C#). It offers fundamental sequential (vector/list/deque) and associative (tree/skiplist) containers that can be filled, traversed and modified using iterators.

A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. More commercially-friendly licenses may be available. Please contact Stephen O'Hara for license options. Please view the wiki on this site for installation instructions and examples on reproducing the results of the papers.

pvmfractal is a highly customizable fractal viewing application, that can work interactively as an SDL or Curses app, or in batch mode as a console app. It includes many coloring algorithms, layers, and can use multiple computers for calculation using PV

PyPlayground is an environment for developing algorithms involving movement in a space of up to three dimensions using Python.

A Python module to learn all the major algorithms on the go! Purely for educational purposes. If you are using Python 2.7 use pip instead. Depending on your permissions, you might need to use pip install, user pygorithm to install. To see all the available functions in a module, you can just type help() with the module name as an argument.

A Python library for easy creation and manipulation of Google Earth KML and KMZ placemark files. Please get your copy from http://pykml.cvs.sourceforge.net/viewvc/pykml/pykml/?view=tar

A neural net module written in python. The aim of the project is to provide a large set of neural network types accessed by an API that is easy to use and powerful.

This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.

Bit operations on integers for Python - fast C implementation of bit extraction, counting, reversal etc.

The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on fundamentals, or developers wanting to understand algorithm internals, this repository provides ready-to-run examples, and can serve as a sandbox to experiment, benchmark, or adapt code. Because it’s in pure Python, it’s easy to read and modify, making it accessible even to those with modest programming experience. The repo helps bridge the gap between theoretical algorithm descriptions and real-world code, giving concrete, working implementations that one can study, debug, or extend.

Quantitative Finance C++ Library.

Abandoned version of qbc. DOES NOT WORK properly

A Functor / "Function Object" library, providing classes implementing an operator(). A substantial improvement (IMHO) over what the standard provides, with composition, arithmetic expressions, "transform" operations, the naming convention and more.