Open Source Python Algorithms - Page 4

Booleans all meshes on the screen. Plus: A fractal generator and attractor generator with a delicious SEARCH function ;) <meta name="google-site-verification" content="cULQewNGfx-aXCQR9fTJZ1Z7DXbLA5GjqjvAfF_oH5I" />

Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.

Cascading and Sharing Survival Trees (CSST) is a tree-based enseble that allows to efficiently analize survival data. It is a strightforward extension of the CS4 method for lifetime collections of data. The CSST software comes along with its companion the CSST Prediction tool, to use the ensemble prediction in everyday life. Please, refer to the user's manual for further information.

An experimental language designed to be very simple, but expressive enough to represent mathematical constructions and have strong introspective capabilities.

Clone Digger is a duplicate code detection tool, which supports Python and Java languages. Discovered clones can differ in small subexpressions; comments and whitespaces are ignored. Clone digger is platform-independent and is written in Python language

LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.

This is a python implementation that handles floating points correctly,there are still some bugs but I'm working on it . The point was to work around some stuff that made no sense for floats,like 0.1+0.2 == 0.3 is false.

Free and easy to implement algorithm that can be used for resource leveling in Gantt projects. Uses resources assignment policies, availibility calendars, tasks\' priorities, dependencies, sizings, complexity due to human communication.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.

The LisBON Framework is an adaptable framework for developing new parallel Memetic Algorithms (hybrid search algorithms for efficiently solving optimisation problems).

MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack

The market assumes an environment in which farmers sell their produce through brokers and traders locate produce to buy through brokers. The major aim of the simulator is to experiment with various reputation mechanisms to manage bottlenecks and to model various adversarial scenarios. The market is aimed to simulate agricultural trade in developing countries. It is written in python and mysql database on Linux.

Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.

The NUMIPAD library implements several methods/algorithms to solve inverse problems and adaptive decomposition (i.e. Tikhonov regularization, Total Variation, Basis Pursuit, etc.)

Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.

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.

Functions for creating random (pronouncable) "names", such as are used in a rogue-like. Some of the better names: Kehizarich, Awzecharz, Vizoueurv, Rieri

A collection of phonetic algorithms such as metaphone or soundex for use in Python.

PixLab is a peculiar raster-based graphic editor giving one more additional drawing aspect to an artist. Not only traditional elements of painting, such as color and shape, but also artist's brush dynamics is fixed and displayed.

Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. At first you will be prompted with an input, after that you can call it using function prime_finder(n) example call: >>>prime_finder(10) #output [2,3,5,7] (Int) -> (list)

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.

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