Open Source Algorithms - Page 2

threadpool is a cross-platform C++ thread pool library. It provides a convenient way for dispatching asynchronous tasks and can be easily customized. threadpool is based on the high-quality Boost source libraries.

Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. The source code can be run with one click, helping readers improve their programming skills during exercises and understand the working principles of algorithms and the underlying implementation of data structures. Readers are encouraged to help each other learn, and questions and comments can usually be answered within two days.

Automated accounting for splits, dividends, and corporate events like delistings and mergers. Avoid selection bias with dynamically generated assets. Create and select asset universes on proprietary data and indicators. Automatically track portfolio performance, profit and loss, and holdings across multiple asset classes and margin models in the same strategy. Trigger regular functions to occur at desired times, during market hours, on certain days of the week, or at specific times of day. Backtest on almost any time series and import your proprietary signal data into your strategy. Everything is configurable and pluggable. LEAN's highly modular foundation can easily be extended for your fund focus. Use combinations of margin, fill, and slippage models to simulate a liquidity endpoint. 100+ popular technical indicators built, tested, and ready for use. Applicable to any data source.

xxHash is an extremely fast non-cryptographic hash algorithm, working at RAM speed limit. It is proposed in four flavors (XXH32, XXH64, XXH3_64bits and XXH3_128bits). The latest variant, XXH3, offers improved performance across the board, especially on small data. It successfully completes the SMHasher test suite which evaluates collision, dispersion and randomness qualities of hash functions. Code is highly portable, and hashes are identical across all platforms (little / big endian). Performance on large data is only one part of the picture. Hashing is also very useful in constructions like hash tables and bloom filters. In these use cases, it's frequent to hash a lot of small data (starting at a few bytes). Algorithm's performance can be very different for such scenarios, since parts of the algorithm, such as initialization or finalization, become fixed cost. The impact of branch misprediction also becomes much more present.

Fsum Frontend is a files integrity checker. It can calculate 96 hash and checksum algorithms(CRC32, MD5, SHA1, SHA2, ADLER, DHA256, FORK256, ...). You can verify your files using a .sfv/.md5/.sha1/.sha2 file or create your own checksum file.

A framework for learning from a continuous supply of examples, a data stream. Includes classification, regression, clustering, outlier detection and recommender systems. Related to the WEKA project, also written in Java, while scaling to adaptive large scale machine learning.

CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 112 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams' Rocksoft(tm) model of parametrised CRC algorithms.

This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following software pre-installed, TeXLive, The book is built with XeLaTeX, a Unicode friendly version of TeX. You need the GNU make tool, in Debian/Ubuntu like Linux, it can be installed through the apt-get command.

Programming Navigation is not just a website, but a complete ecology with the goal of "helping everyone discover high-quality programming resources and improve learning efficiency". It contains multiple sub-projects, and the technology stack includes React, Java SpringBoot, Tencent Cloud Development, etc., all of which are open source for everyone to learn, so that you can easily develop beautiful information navigation websites! Most of the programming navigation websites are in disrepair and have good navigation, but they are limited in search and classification, and they do not have functions such as self-recommendation and liking, so they are not sustainable.

This is a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any structure having a unique, arbitrarily-typed key member can be hashed by adding a UT_hash_handle member to the structure and calling these macros.

jFuzzyLogic is a java implementation of a Fuzzy Logic software package. It implements a complete Fuzzy inference system (FIS) as well as Fuzzy Control Logic compliance (FCL) according to IEC 61131-7 (formerly 1131-7).

EN: Code created to show how is done the calculation of a CRC. It includes many different CRCs to choose from. This software was created to help people understand how is the CRC calculated and be able to see it in a practical way, it is also available to copy and use it for your own project. I hope it helps you. ES: Código creado para mostrar como se realiza el cálculo de un CRC. Con el mismo se incluyen varios CRCs que pueden ser escogidos. Este software se creó con el propósito de ayudar a la gente a entender como se hace el cálculo de un CRC de una manera más práctica y sencilla, también se puede copiar y aprovecharlo para otras aplicaciones. Espero que te sea util.

PLEASE NOTE that we are in the process of moving to GitHub: https://github.com/jasypt/jasypt Jasypt (Java Simplified Encryption) is a java library which allows the developer to add basic encryption capabilities to his/her projects with minimum effort, and without the need of having deep knowledge on how cryptography works. PLEASE NOTE that we are in the process of moving to GitHub: https://github.com/jasypt/jasypt

JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de

Portable library of solvers for work in Science, Engineering & Education. Library Contents: High Precision Computation, Numerical Calculus, Complex Analysis, Geometry, Linear Algebra, Special Functions, Differential Equations, Transformations, Optimization & Interpolation, Statistics, Physics ... (12,538 functions in v23.06 package) Knowledge of any programming language is not required. Only Windows port is available.

The JTS Topology Suite is an API for modelling and manipulating 2-dimensional linear geometry. It provides numerous geometric predicates and functions. JTS conforms to the Simple Features Specification for SQL published by the Open GIS Consortium.

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.

JDIFF is a program that outputs the differences between two binary files, either in binary format or in human readable format (detailed or summarized) and then allows to reconstruct the second file from the first one and the diff-file.

Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms.

Inspired by Grokking Algorithms and python-execution-trace, this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution. Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works. The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. Literally the same source file. Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. So is pausing and resuming. This project uses styled-jsx, but takes the idea of CSS-in-JS even further. Sizing, positioning and transition offsets are computed by JS, all before elements hit the DOM.

Kalman Filter book using Jupyter Notebook. Focuses on building intuition and experience, not formal proofs. Includes Kalman filters,extended Kalman filters, unscented Kalman filters, particle filters, and more. All exercises include solutions. Introductory text for Kalman and Bayesian filters. All code is written in Python, and the book itself is written using Juptyer Notebook so that you can run and modify the code in your browser. What better way to learn? This book teaches you how to solve all sorts of filtering problems. Use many different algorithms, all based on Bayesian probability. In simple terms Bayesian probability determines what is likely to be true based on past information. This book is interactive. While you can read it online as static content, it's better to use it as intended. It is written using Jupyter Notebook, which allows you to combine text, math, Python, and Python output in one place.

OpenSpiel is a collection of environments and algorithms for research in general reinforcement learning and search/planning in games. OpenSpiel supports n-player (single- and multi- agent) zero-sum, cooperative and general-sum, one-shot and sequential, strictly turn-taking and simultaneous-move, perfect and imperfect information games, as well as traditional multiagent environments such as (partially- and fully- observable) grid worlds and social dilemmas. OpenSpiel also includes tools to analyze learning dynamics and other common evaluation metrics. Games are represented as procedural extensive-form games, with some natural extensions. The core API and games are implemented in C++ and exposed to Python. Algorithms and tools are written both in C++ and Python. To try OpenSpiel in Google Colaboratory, please refer to open_spiel/colabs subdirectory.

A specific software-based key for a computer program. It certifies that the copy of the program is original. It is also called a license key, product key, product activation, software key and even a serial number. The key can be stored as a human readable text for easy transfering to the end user. Contains methods for generating the cryptography key based on the specified hardware and software binding. An additional feature is the ability to embed any information directly into the key. This information can be recovered as a byte array during key verifying.

minidjvu is a DjVu encoder for black-and-white images.

STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.