Open Source Algorithms - Page 20

Data Structure Tester is an OCaml application for multiple testing of various data structures (also written in other lanages, like C or C++).It proviedes many examples to test, easily configurable tester and signatures for all data structers to be tested.

Are you a JavaScript developer looking to improve your craft? Then, this algorithms book is for you. This material contains the fundamental concepts to move your career to the next level. You will be able to solve problems faster in your day-to-day work and ace technical job interviews. Simply put, algorithms are several steps to solve a specific problem (e.g., sort number, search value, transform data, etc.). Algorithms are an essential toolbox for every programmer. Even if you don't realize it, you use them every day. They are built-in in apps, programming languages, and libraries. However, to make use of them properly, you have to know the tradeoffs so you can choose the best tool for the job. Improve your problem-solving skills and become a stronger developer by understanding fundamental computer science concepts.

A verification library accompanied by a simple tool for verification of credit-cards, social security-numbers and other mod(10) and similar checksums in a standard shell-environment from the command-line or as a function. No compilation required.

A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#.

Software to build database of all best solution of all configurations of Cube21/Square1 Silver edition puzzle cube. Also 3D UI is provided.

For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value

Date Class using C++

From the early 1970s up to nowadays the system date routines of computers usually mix up date with time calculations. Not only that they will expire sooner or later due to number overflow. Not only that this will make calendarian calculations extremely complicated. Fact is, that this will combine two things together which don't have anything to do with each other: The rotation of the earth around itself and the rotation of the earth around the sun, which in addition will both vary during the chiliads. So how will you be able to do date calculations if you then even try to consider time gimmicks like summer/winter time changes, leap-seconds and so on? Just forget it! This project gives you very short pure date routines that are the fastest ones that you can get, because they don't need any looping for doing their calculations, and they do their calculations from 1/1/0 up to 12/31/9999. Of course they precisely consider the transition from Julian to Gregorian calendar. ;-)

A generic Deduplication engine to find duplicates in a dataset.

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

Julia implementation of Decision Tree (CART) and Random Forest algorithms.

Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each edge A↔︎B, we will use two half-edges A→B and B→A. Having two half-edges is the key to everything this library provides. It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle. We can draw all the triangle edges without constructing the triangles themselves.

This component is an easing animation value calculator. Easing types: BackEaseIn, backEaseOut, BackEaseInOut, BounceEaseIn, BounceEaseOut, CircEaseIn, CircEaseOut, CircEaseInOut, CubicEaseIn, CubicEaseOut, CubicEaseInOut, ElasticEaseIn, ElasticEaseOu

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"

Detectron2 is Facebook AI Research's next generation software system that implements state-of-the-art object detection algorithms. It is a ground-up rewrite of the previous version, Detectron, and it originates from maskrcnn-benchmark. It is powered by the PyTorch deep learning framework. Includes more features such as panoptic segmentation, Densepose, Cascade R-CNN, rotated bounding boxes, PointRend, DeepLab, etc. Can be used as a library to support different projects on top of it. We'll open source more research projects in this way. It trains much faster. Models can be exported to TorchScript format or Caffe2 format for deployment. With a new, more modular design, Detectron2 is flexible and extensible, and able to provide fast training on single or multiple GPU servers. Detectron2 includes high-quality implementations of state-of-the-art object detection.

This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).

Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file

Is a software for design algorithms by diagrams. Es un software para diseñar algoritmos de diagramas de flujo.

Dictmatch is a high performance multi-mode string match lib which supports full matching and max forward matching. It is used to match substrings which contented in dictionary from string user provides. Its throughout is more than 20w line per sec.

A fast and flexible O(n) difference algorithm framework for Swift collection. The algorithm is optimized based on the Paul Heckel’s algorithm. This is a diffing algorithm developed for Carbon, works stand alone. The algorithm optimized based on the Paul Heckel’s algorithm. See also his paper A technique for isolating differences between files released in 1978. It allows all kind of diffs to be calculated in linear time O(n). RxDataSources and IGListKit are also implemented based on his algorithm. The type of the element that to take diffs must be conform to the Differentiable protocol.

Robust Perl OO Module for Digest based Authentication leveraging DBI as a backend. This Performance oriented Hash Authentication Library is scalable from single pc to multi-database single signon www applications. Optionally uses Javascript and Cookies.

DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net

We introduce our implementation that accelerates the distance matrix computation in the x86 and Cell Broadband Engine (BE) architecture, a homogeneous and heterogeneous multi-core system, respectively.

BTK contains C++ and Python libraries that implement speech processing and microphone array techniques such as speech feature extraction, speech enhancement, speaker tracking, beamforming, dereverberation and echo cancellation algorithms. The Millennium ASR provides C++ and python libraries for automatic speech recognition. The Millennium ASR implements a weighted finite state transducer (WFST) decoder, training and adaptation methods. These toolkits are meant for facilitating research and development of automatic distant speech recognition.

Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/