Open Source Windows Algorithms - Page 32

pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.

Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.

PHP Business Rules is an open source application layer for PHP. The logic is defined in rules and facts. Like most Business Rule Engines (BRE) it uses the Rete algorithm.

Contest system, written on PHP (some executables - on C++) for Programming contests creation. Runs only on Windows. Can use C++, Pascal or Java codes.

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

PHP class for the DES/Lanman hash used in earlier windows systems.

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.

PHPersistencia is a database persistence layer for PHP, offering Object Oriented interface to access the data, generating sql queries transparently for insert/update, selecting data as object collection and verifing data types without database access

Membrane Computing is a new research area (within Natural Computing) that aims to provide computing devices abstracted from the functioning and structure of living cells. These devices are called P systems. The objective of this project (PMCGPU) is to bring together all the researchers working on the development of parallel simulators for P systems, specially those using the GPU (e.g. CUDA, OpenCL, etc). Other parallel platforms are also welcome (multicore and manycore, FPGAs, etc). This project has been initiated by the Research Group on Natural Computing (Department of Computer Science and Artificial Intelligence, University of Seville). PMCGPU was born inside the P-Lingua project, of the same research group. PMCGPU is a GNU project, so all the applications developed within it are released under the GPLv3 license. Just contact us if you want to participate. Please, visit the Wiki of the project for further information.

This is a collection od different small Java applications or allgorithms

This Matlab package implements machine learning algorithms described in the great textbook: Pattern Recognition and Machine Learning by C. Bishop (PRML). It is written purely in Matlab language. It is self-contained. There is no external dependency. This package requires Matlab R2016b or latter, since it utilizes a new Matlab syntax called Implicit expansion (a.k.a. broadcasting). It also requires Statistics Toolbox (for some simple random number generator) and Image Processing Toolbox (for reading image data). The code is extremely compact. Minimizing code length is a major goal. As a result, the core of the algorithms can be easily spotted. Many tricks for speeding up Matlab code are applied (e.g. vectorization, matrix factorization, etc.). Usually, functions in this package are orders faster than Matlab builtin ones (e.g. kmeans). Many tricks for numerical stability are applied, such as computing probability in logrithm domain, square root matrix update to enforce matrix symmetry.

Coupling the notion that during the search for the minimum of a function we must pass through its solution with a PSO solution generator engine, is the approach for solving, in time domain, a non-linear algebric-differential system of equations.

Generic toolbox of Particle Swarm Optimization developed in Scilab (PSOTS). It is developed for a variety of complex problems, including single and multi-objective optimization problems, continuous and discrete problems, and mixed integer problems.

This library allows you to generate a random number in the specified range from 0 to n, without using the built-in function Math.random (), and gets a random number from the processing time of polymorphic mathematical calculations, which depends on the current physical parameters of the CPU, RAM, and t .P. The resulting sequence corresponds to a discrete uniform distribution and is close to natural random sequences in terms of statistical randomness tests (LFSR, Approximate Entropy, DIEHARD Test).

Pambaf is a new encryption algorithm for users or developers with extremely high demands for security.

Generic engine to filter information. We wish to show that the power of expression of a filter makes it possible to appreciably reduce the size of the code necessary to extract information and that it is possible in Python.

Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.

The Parameter Tuning Unity (PTU) aims to adapt the parameters of ever connected multi-agents system, or expert system with a plugged optimization heuristic likes the descent of gradient for instance.

The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics related to A* algorithm are presented as well. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/a-star/ https://sourceforge.net/projects/shortest-path-graph-a-star/

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G

This C++ library contains the 'PdfPageCount' class that performs the single task of finding the number of pages in a given PDF document. While the PdfPageCount class is very simple to use, the contained code is complex because the page count can be hidden in any number of places, quite often within compressed data.

A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks.

An experimental language API and interpreter which combine ideas from functional programming and graph theory.

In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/