On open source MPI implementation of parallel bucket sorting. This implementation is scalable and gives linear speedup on SGI(Altix). The program sorts at using the bits and hence is stronger than other sorters which make assumptions about keys.
Library Of Randomized Algorithms: Randomization is a powerful idea has applications in science and engineering. Difficult optimization problems, protein folding and data mining are only a few of the problems that have been solved using randomization.
Calculate primes by using extremely fast sorting
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
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
Promote is an easy to use, generic data structure and utility library for C,C++, and possibly more.
ProtSAT is a software project for optimal protein design.
Academic project aiming to write an alife Avida-like program in java.
PPFN, it is also a tool to be hidden from any server log, these developers know what they have to do. Do you? If you download this ultimate package you will be able to enjoy the web knowing that you would be safe. So be safe, learn to surf right - PPFN
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
A univariate and multivariate analysis UI. This project is no longer under development. Please use as you wish.
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.
combinational logic functions minimization
QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output variables. - You can also reduce the number of table rows. - It allows you to name the input and output variables. - The table can be exported to HTML file and then you can use it in e.g. MS Word. - This program provides a comfortable interface, you can change fonts and colors. - It works on MS Windows, GNU/Linux, Mac OS.
Qt-based FFT implementation
A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.
simplifies boolean functions with Quine-McCluskey algorithm
Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm
RHash is a console utility for computing and verifying hash sums of files. It supports CRC32, MD4, MD5, SHA1, SHA256, SHA512, SHA3, Tiger, TTH, Torrent BTIH, AICH, ED2K, GOST R 34.11-94, RIPEMD-160, HAS-160, EDON-R 256/512, WHIRLPOOL and SNEFRU hash sums.
RL++ is an easy to use modular open source library for Reinforcement Learning written in C++. It includes learning algorithms (TD, Sarsa, Q) as well as the implementation of value function representations (LookupTable, TileCoding, Neuronal Network).
RPnP C++ implemention
I try to code the RPnP available at http://xuchi.weebly.com/uploads/5/6/7/3/5673896/rpnp1.0.zip in C++ with the help of OpenCV
Raiden block cipher: An extremely lightweight and fast block cipher, developed using genetic programming, with the intention to be an alternative to TEA. This cipher is as fast as TEA, and without many of its known weaknesses.
A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.
Objective of this project is to DEVELOP OPENSOURCE portal written in PHP/MySQL to practise websecurity in real time. Rootcontest portal will help users to understand websecurity in a better way.
The SBMLevolver is an evolutionary algorithm package that creates SBML models with user-specified properties and behaviour from a given set of building blocks. Applications lie in network reconstruction and synthetic biology.
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host.