Project aims to be a repository of oft needed CS assignments (university grade). The focus will NOT be on feeding readily available code but on detailed explanation of algorithms, tips focusing on networking related projects.
A concise example of the classical genetic algorithm, with a fancy windows terminal display. Features DNA editing, save/load, customizable constraints and statistics logging.
Lock-free, threadsafe, open-source, cross-platform data structures, logical predicates and sorting algorithms for parallel, concurrent and multithreaded programming on single and multi-core processors
A program that can learn from midi examples, and create new music from that.
phonet4j is the port of a extensible, rule based algortihm for phonetic conversions written by Joerg Michael to java. His code was first published in the computer magazine c't (issue 25/1999, pp. 252). Includes two rulesets for the german language.
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.
Wiki.Lite is a lightweight and easy-to-use Wiki engine. Recommended for school and personal homepages.
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.
An IEEE 802.11e EDCA and CFB Simulation Model for ns-2
JXmlSql is a Java database API ( MySql, Oracle, Access )that eliminates JDBC code. JXmlSql allows developers to define application and prepopulation SQL statements inside xml files. Options for query, insert, update, delete, report and prepopulation SQL.
The education porpurse project. A simulator that for batch process scheduling on linux systems.
Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.
Demonstration of client-server architecture with UNIX Socket API using.
jYaSS: (java) Yet another Sorting Simulator. You enter an array of numbers and it sorts it for you, what is cool is that the application paints the changes and lets you save the output to html.You can test different algorithms, and compare with stadistic
A basic implementation of an AVL Tree in PHP 5.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).
To work on a dhcpd.conf that everyone can use for multiple different dhcp servers on one system and for different reasons.
Cachelet - the simplest java framework for general purpose caching
Cachelet is a java framework for general purpose caching very simple and easy to use. And it has everything you need for caching without complications.
Utility to validate, extract, show and create digital documents included in files with "pk7" and "fp7" extensions such as electronic bills provided by some phone companies in Spain like Movistar and Telefonica.
C++ BigInt class enables to work with arbitrary precision integers
C++ BigInt class that enables the user to work with arbitrary precision integers. Latest Version: 10.2
Fuzzy services deliver APIs for representing and processing fuzzy information.
Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).
This software is to help the those connected with Biology,Biotechnology,Bio Informatics.The user can select from the choices of proteins, nucleotides,etc(All those found on NCBI's website)and search for the specific results
Connecting Overlapped Pair-End Reads
COPE (Connecting Overlapped Pair-End reads) is a method to align and connect the illumina sequenced Pair-End reads of which the insert size is smaller than the sum of the two read length.The connected reads can be used in genome assembly, resequencing and transcriptome research. The full citation: COPE: An accurate k-mer based pair-end reads connection tool to facilitate genome assembly Binghang Liu; Jianying Yuan; Siu-Ming Yiu; Zhenyu Li; Yinlong Xie; Yanxiang Chen; Yujian Shi; Hao Zhang; Yingrui Li; Tak-Wah Lam; Ruibang Luo Bioinformatics (2012) 28(22): 2870-2874; doi: 10.1093/bioinformatics/bts563