Search Results for "the linux command line" - Page 4

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the...

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.

SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.

C++ implementation of certain problems

RobGP is a genetic programming system written from the ground up in C++. It's primary goals are efficiency, ease of use, and extensibility. It's distinguishing feature is that it has a modified version of Koza's architecture altering operations.

The Mars Rover Simulator project is based on the evolutionary robotics paradigm where an artificial agent acquires its skills through the process of artificial evolution. This simulator can be useful to evolve neural network controllers for the rover

A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.

An R package implementation of a consensus clustering methodology. This package allows users to perform re-sampling statistics based clustering using multiple clustering algorithms to assess the robustness of both clusters and members of clusters.

LDIFF is an enhanced language-independent line differencing tool built upon the Unix diff and overcomes its limitations in determining whether an artifact line has been changed or is the result of additions and removals

An R package for detailed inspection and analysis of LCMS data. An R package developed by Sukhdeep Singh at Department of Surgery and Cancer, Imperial College London,UK.

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

TypeRecognizer is C++ class which enables the developer to recognize data types in compile-time

Generic System for Data Processing

OnuriS (Open soURce wImax Simulator) is a simulation platform designed for WiMAX in order to analyze network performances and develop particular allocators for better bandwidth allocation strategies that could greatly improve the overall system.

The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.

Python module to track the overall median of a stream of values "on-line" in reasonably efficient fashion.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.

Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.

Contains various algorithms that maps short reads produced from Illumina (Solexa) Genome Analyzer, or Applied Biosystems' SOLiD System, to a reference sequence or a set of reference sequences.