Simulation library for SSEP, ASEP or TASEP simulations
ASEP simulation library is specialized for simulations of Asymmetric Simple Exclusion Processes (ASEP) and its mutations like SSEP or TASEP based on a graph. It is consisted of agents, models, timers and graphs that forms united modelling enviroment ready for computer cluster use - all based on Zarja library.
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
A python based Bayesian network implementation. This project aims to provide a single point of entry-solution for searching through available networks matching data and optimizing CPT's.
BigBang/Horizon is a proteomics data analysis pipeline with focus on the shotgun LC/MSMS workflow.
BAYESIAN INFERENCE OF METABOLIC DIVERGENCE AMONG MICROBIAL COMMUNITIES
Metagenomics yields enormous numbers of microbial sequences that can be assigned a metabolic function. Using such data to infer community-level metabolic divergence is hindered by the lack of a suitable statistical framework. Here, we describe a novel hierarchical Bayesian model, called BiomeNet (Bayesian inference of metabolic networks), for inferring differential prevalence of metabolic networks among microbial communities. To infer the structure of community-level metabolic interactions, BiomeNet applies a mixed-membership modelling framework to enzyme abundance information. The basic idea is that the mixture components of the model (metabolic reactions, subnetworks, and networks) are shared across all groups (microbiome samples), but the mixture proportions vary from group to group. Through this framework, the model can capture nested structures within the data. BiomeNet is unique in modeling each metagenome sample as a mixture of complex metabolic systems (metabosystems).
A collection of different methods for implementing in C++ polycrystalline growth for metals during annealing or recrystallization.
That project aims at studying and comparing typical airline IT methods, for instance RM-related algorithms. It works from a Unix/Linux/Mac command-line, and exposes basic APIs. It is being developed in C++, with Python wrappers for some components.
A Multivariate Distributions Package for C++
A library based on Eigen and Boost to handle common multivariate distributions in C++
That project aims at providing a clean API and a simple implementation, as a C++ library, of a Travel-oriented fare engine. It corresponds to the simulated version of the real-world Fare Quote System.
That project aims at providing a clean API and a simple implementation, as a C++ library, of a Travel-oriented Distribution System. It corresponds to the simulated version of the real-world Computerized Reservation Systems (CRS).
The CRISP package here developed utilizes an algorithm that describes a many-body intranuclear cascade (INC) and evaporation/fission/multifragmentation competition process.
Stand-alone software tool for the interactive CE analysis of microarray data. The software is a user-friendly and allows on-the-fly study of CE
Suite of community detection algorithms based on Modularity
- MixtureModel_v1r1: overlapping community algorithm , which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in  are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness  and Spectral Modularity . Collaborator: Theologos Kotsos.  M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004.  M. Newman, Physical Review E, 74(3):036104, 2006.  B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <email@example.com>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <firstname.lastname@example.org>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne
Software to cluster protein sequences into functionally similar groups. Journal reference: http://bioinformatics.oxfordjournals.org/cgi/content/short/24/16/1765
Data Mining Platform is a platform for data mining and analysis. It contains many of the new and sophisticated methods such as kernel-based classification, two-way clustering, bayesian networks, pattern recognition for time series analysis and many other
Facinas: Probabilistic Graphical Models is an extensive set of librairies, algorithms and tools for Probabilistic Inference and Learning and Reasoning under uncertainty. It implements all sort of Probabilistic Graphical Models using discrete and continuous distributions.
Calculate your and your spouse's life expectancy !
Using statistical modelling against raw data obtained from a USA Annuity mortality table, the Fantastic Life Expectancy Calculator allows users to input a number of parameters to determine their life expectancy. This calculator is provided free and for entertainment purposes only. It does not claim to accurately predict life expectancy for a specific individual or a specific couple.
Parallelized FREquency DEComposer algorithm
This is a parallelized algorithm performing a decomposition of the time-series data into a number of sinusoidal components, disentangling them from the white Gaussian noise. The algorithm analyses all suspicious frequencies, including the ones that look like an alias at a glance, but may become preferable later. After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance. In the end, it prints out the set of largest frequency tuples that were still found significant. The GPU computing is implemented through CUDA and brings a significant performance increase. It is still possible to run FreDec solely on CPU, if no suitable GPU device is available in the system. See the details of the underlying theory in Baluev 2013, MNRAS, V. 436, P. 807 The description of the algorithm itself can be found in arXiv:1309.0100. Please go to the project forum to report any bugs.
Gizur High Performance Framework makes it easy to build performance critical applications using C++. Using ghpf it becomes easy to build applications consisting of multiple communicating processes. RESTful services and web applications can be built.
A Hidden Markov Model editor with support to HTK
HMMLab is a Hidden Markov Model editor oriented on HMMs for speach recognition. It can create, edit, train and visualize HMMs. HMMLab supports loading/saving HMMs from/to HTK files.
IterInt is a numerical integration package that implements iterated numerical integration methods. Iterated methods can be used to compute low dimensional (less than ten, for example) integration problems to get very accurate results.
Timeseries databases management system
KeplerDB is a temporal database to store time/value entries where the type of value could be integer, float/double, boolean and string. KeplerDB is dedicated to be scalable and to create clusters of server allowing the user to analyse and store massing amount of data to monitor systems like computers, clusters, building and captors or financial systems like markets and accounts. The user can use KeplerDB to make data analysis on enormous amount of data (statistics and modelling).
The Kyoto FST Decoder is a general decoding engine for Weighted Finite State Transducers. It features flexible XML-based configuration, beam-search decoding, and is able to output separate weights for weight tuning.
Parallel pairwise correlation computation on Intel Xeon Phi clusters
The first parallel and distributed library for pairwise correlation/dependence computation on Intel Xeon Phi clusters. This library is written in C++ template classes and achieves high speed by exploring the SIMD-instruction-level and thread-level parallelism within Xeon Phis as well as accelerator-level parallelism among multiple Xeon Phis. To facilitate balanced workload distribution, we have proposed a general framework for symmetric all-pairs computation by building provable bijective functions between job identifier and coordinate space for the first time.