AsyncSocket is a python module used for asynchronous socket connections that supports connection and read/write timeouts.
Ben(Zai)Ten is a graphical modeling environment for computational and systems biology. It supports the community exchange standards: SBML, SBRML, SED-ML as well as ontologies: MIRIAM, SBO, ChEBI, KEGG, GO
My personal computing suite provides some programs I developed as a hobbyist and currently include a lambda calculus interpreter and a calculator which solves arithmetic expressions; both are written in C++.
This is a Python script for Blender which uses short (quaternion-based, floretion-based) algorithms to draw curves in space. The user can create new shapes and curves by setting a variety of parameters.
Broccoli contains: -real and complex numbers,vectors,matrices,functions,polynomials -function minimizers,evolutionary algorithms,neural networks -pdfs,cdfs,max-likelihood,regression,DGPs,PRNGs,armax,garch,statistical estimation etc. -friendly JavaSwingGUI
C Data Structures Collection is a c library that provides interfaces and implementation of serveral data structures in an object oriented manner. For now we have interfaces for map, ordered map, queue, stack and dijoint sets.
Find case inconsistencies in the source tree. May be useful for porting applications in any programming language from case-insensitive (like Windows) to case-sensitive (like Linux) runtime environment.
DMTL (Data Mining Template Library) - A generic C++ based library for mining structured patterns such as sets, sequences, trees and graphs. The library provides implementation of popular frequent pattern mining algorithms.
Data Structure Tester is an OCaml application for multiple testing of various data structures (also written in other lanages, like C or C++).It proviedes many examples to test, easily configurable tester and signatures for all data structers to be tested.
A novel and effictive GA algorithm to solve optimization problem
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy.
XSWAG (Extended SourceWare Archive Group) is a revival project for the famous SWAG code archives for the Pascal programming language. This project is open to every Pascal/Delphi programmer who wishes to contribute to the global Pascal knowledge base. Current version (testing 0.9) features : - a reader program : allows users to browse through the code archives, organizes them by type and operating system and updates the archives from multiple XSWAG servers. - a server daemon : maintains a list of archives and provides updates to clients. - a creator program : to quickly make or modify an XSWAG archive file, add/remove sources and update sources info (os, compiler, architecture, contact info, author name, subject).
Provide geneology information, contact information, personal descriptions and webpages, calendars, etc in a web interface. This system will use php and any database system and will provide various level of public and private access.
FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.
GFP use Genetic Programming and LISP-like language for growing program.
This package enables mRNA scan number array V3 CEL file(s) genetic data (sub) band (s) determining and band group (s) (combination (s) )browsing (http://www.jasenko.com.mk)
Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.
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.
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)
An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..
Moving target detection in 2D using Kalman Filter
Moving target detection in 2D using Kalman Filter written in JS for demo purposes.
This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.
Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.
PHPXref is a developers tool, written in Perl, that will cross reference and extract inline documentation from a collection of PHP scripts. It generates simple HTML output suitable for browsing offline.
This is a collection od different small Java applications or allgorithms