Technical Analysis Library
Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... This is not an end-user GUI trading or charting application. It is instead targeted to application developers using either Excel, .NET, Mono, Java, Perl, Python or C/C++.
A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.
Concurrent Data Structure library
CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds
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 extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
quiplib is a c++ library that contains some classes to simplify you network programing and ACE programming. And implement some important and useful patterns in templates
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter being not very precise but extremely fast. A detailed README file describes the usage of the software, including license, requirements, installation, file formats, sample data, tools, and options. With the sample data provided and the default options, it is possible to test the code immediately as a demo. DRVQ has a 2-clause BSD license. Please refer to the DRVQ software home page, the research project, or the original publication for more information. The latest code is available at github.
Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.
Bachelor of Science (Informatik)
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.
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classification problems with millions of high-dimensional examples within minutes on a regular personal computer. We provide command-line and Matlab interfaces to BudgetedSVM, efficient API for handling large-scale, high-dimensional data sets, as well as detailed documentation to help developers use and further extend the toolbox.
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.
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 light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)
A new sight of developing. Thinking in human's concepts and orgnizations. Analysis behaves and effects before the actual building take place. Automatically using the proper algorithms and data model. Based on a large scale descriptive library.
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
AVL Tree implementation in C++ template suited for static memory management.
Algorism is a repository of implementation of all frequently used algorithms in C/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.
The DPIP library provides a collection of image processing algorithms to take advantage of the computing power of recent multi-core architectures and provides an interoperability layer between existing toolkits.
Depends implements a generic dependency tracker written in C++ and comes with extensive documentation on how to implement a dependency tracker (and, thus, how this one is implemented). It is very simple to use and provides the tools to "roll your own"
Fixed point 16/32 integer FFT library for the Raspberry Pi and Android
This library is being created as I have a need to do very fast FFTs on low end devices not supporting the NEON instruction set. The Raspberry Pi is an ideal candidate for developing in gcc before porting to JNI for low spec Android devices, hence it's inclusion. Fixed point 16/32 integer FFT library suitable for the Raspberry Pi and Android devices. Includes test stubs for gcc on the Raspberry Pi and a Basic4Android wrapper from JNI. It includes hand optimised ARMv6 assembler, demonstrating techniques such as pipeline stuffing to achieve maximum performance. It also demonstrates how to include large chunks of assembler inline with C/C++ thus avoiding ABI issues between platforms.
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.
This is a tidy lightweight library implementing a series of C++ Design Patterns, aiming to be simple, clean and portable. This library is made to help C++ programmers to develop projects with clearer and more compact source code.
There are few programs that do not use a tree data structure. The C++ standard library, however, does not provide a low-level tree-container. The goal of our project is to write, document and test a generic tree-library and popular tree algorithms.