Open Source C++ Algorithms

Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.

Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming. ● LiPS gives sensitivity analysis procedures, which allow us to study the behaviour of the model when you change its parameters, including: analysis of changes in the right sides of constraints, analysis of changes in the coefficients of the objective function, analysis of changes in the column/row of the technology matrix. Such information may be extremely useful for the practical application of LP Models. ● LiPS provides methods of goal programming, including lexicographic and weighted GP methods, which are oriented on multi-objective optimisation.

The Progressive Graphics File (PGF) is an efficient image file format, that is based on a fast, discrete wavelet transform with progressive coding features. PGF can be used for lossless and lossy compression. It's most suitable for natural images. PGF can be used as a very efficient and fast replacement of JPEG 2000.

CloudI is an open-source private cloud computing framework for efficient, secure, and internal data processing. CloudI provides scaling for previously unscalable source code with efficient fault-tolerant execution of ATS, C/C++, Erlang/Elixir, Go, Haskell, Java, JavaScript/node.js, OCaml, Perl, PHP, Python, Ruby, or Rust services. The bare essentials for efficient fault-tolerant processing on a cloud!

A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.

An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.

A tool that helps develope the course of cognitive thought processes through software. This tool will look at the raw hex code of any input. It establishes pattern recognition over a mesured time incrament that in itself is at a different pace.

The purpose of the project is summarising effort from a number of analytic libraries, adding interactive web-based user interface and making a free open source solution for risk analytics and stress testing. Feb 8, 2012 Paul Glasserman's Importance Sampling and Tail Approximations as well as plain Monte Carlo have been implemented for for the widely used normal copula model of portfolio credit risk. The package includes source code, examples, spreadsheet with results and references to the papers.

The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.

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++.

Project contains engine to construct Fuzzy Reasoning System. Package might be used when Fuzzy Reasoning is appropriate e.g. in trading, control, modelling, human behavior simulation.

A C++ library for clipping polygons.

This application can create any year calendar after the year 1759. Special feature: => Calendar creation in mass.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

The project will be looking at data (the intention is to begin looking at customer name/address data but this may widen over time) and ways to intelligently detect duplicates using fuzzy matching methods and algorithms.

A class/library which uses the graphic card for linear algebra. Warning : you will need a GeForce 8 serie to take profit of this class.

A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more.

Have you ever imagined not having to do math to convert the various number systems and still make arithmetic calculations with different numerical systems in the same expression? That's what makes this application. You can mix decimal, binary, octal and hexadecimal arithmetic operations using the symbols "+, -, *, /,^,". You can put "e" to use Napier's constant, put "pi" to use pi constant and put a "!" in the of numerical system form to factorization. So let's start doing the math in an instant with this application and save the rest of the time for more useful things of interest.

OpenANN is a basic artificial neural network toolset. It is not being actively maintained. For performance neural networking, consider an alternative (such as https://sourceforge.net/projects/openann-project or https://www.tensorflow.org)

PANDA is a comprehensive and flexib tool for quantitative proteomics data analysis, which is developed based on our solid foundations in quantitative proteomics for years. Several novelties have been implemented in it. First, we implement the advantage algorithms of LFQuant (Proteomics 2012, 12, (23-24), 3475-84) and SILVER (Bioinformatics 2014, 30, (4), 586-7) into PANDA. Second, we consider the state-of-art concept of quantification reliability in this quantitative workflow. On the levels of spectra, peptides and proteins, PANDA works out a few quantitative filters and new scores for quantification confidence. Third, PANDA is designed for processing proteomics big data in parallel.

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.

Schedule Tool is a utility for predicting the duration of projects from a series estimated task times. This tool converts the estimates to probabilities of success, and convolves successive tasks to give an estimated date of completion.

SPar is an internal C++ Domain-Specific Language (DSL) suitable to model and implement classical stream parallel patterns. The DSL uses standard C++ attributes to introduce annotations tagging the notable components of stream parallel applications: stream sources and stream processing stages. Latest version can be downloaded from the SVN using the following command: svn checkout svn://svn.code.sf.net/p/spar-dsl-compiler/svn/ spar

SenseRank Sys: - builds the dictionaries (multidim matrices) of words’ values; - for the set utterance in certain language builds a figure in multidimensional space (in the matrix space) of values (visual schema), which is topological view of sense