Open Source Mac Algorithms - Page 15

HL7 to XML Transformation toolkit. Using HL7 v2 XML

This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets.

A Constraint Programming engine with many examples (planning, sudoku solver...)

Use, study and develop advanced digital halftoning algorithms with Halftone Laboratory, a GIMP plug-in backed by a highly modular and extensible library. It uses .NET/Mono and GIMP#.

Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454.

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.

Haskellesque lazy-list and functional tools with a Common Lisp slant.

An heuristic image stitcher made to test Genetic and PSO based algorithms

This project aims to develop a colour-based vision processing system for use in RoboCup. We are using a CCD camera for input to an FPGA. The system locates coloured objects and outputs detected corners.

A collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.

Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.

Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.

This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.

The Hungarian algorithm can be described as optimally solving a workers versus jobs assignment problem that minimizes total cost. This implementation assumes a square cost matrix, i.e. the number of jobs equals the number of workers to do them.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

This project provides some hyperheuristics, implemented as C libraries. A hyperheuristic can be used to handle any optimization problem, as long as you implement some simple specific code to interact with it. Some examples/applications are also provided.

Hêbê (Ήβη) Goddess of youth Project legacy, the rebirth of classic games.

I is a cross-platform programming language designed towards efficiency during development and at runtime.

The IEEE 1619 Committee open-source reference implementations of encryption algorithms, plus testing and certification suites, for each encryption algorithm included in the standard.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

A multi staged approach to the examination timetabling problem as described in the second International timetabling competition (ITC2007-2008)

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.

An applet designed to demonstrate visually the steps taken by two sorting algorithms -- Insertion sort and Selection sort.

Very basic path manipulation library. Aims to be simple, intuitive and predictable (not universal). Works with std::string and std::wstring. Configurable to support both POSIX and Windows paths (drive letters only - no schemas, network paths etc), as well as some custom formats (with limitations for simplicity). All configurations understand ".." (parent directory) and "." (current directory) and handle them during normalization. However, this library never tries to access any real file systems, and thus doesn't know anything about symbolic links. Primarily designed for usage in a secure environment with known simple limitations. For example, for working with internal application resource paths referencing a "sandboxed" virtual filesystem (like with PhysicsFS). Platform-specific path support is mainly intended for tools (e.g. map editor) which need to share a common code base (and perhaps some hard-coded resources) with the main sandboxed application (e.g. game).

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator