Open Source Linux Algorithms - Page 49

malkriz is solver for griddlers (japanese puzzle) written as simple portable classes in c++. You'll find here complete programs using it, written for MSVC6, Qt and cgi. Web version (in slovak language): http://frix.fri.utc.sk/~johny/mkfrm.php

Matho is a OS Independant Application and API for mathematical operations, features include curve sketching, calculus, iterative formulae, algebra solver, 2d/3d geometry and mechanical and statistical functionality.

mcs::units is an ISO C++ compliant library for compile-time dimensional analysis with zero runtime overhead. Units, quantities, and unit systems are all supported, with example SI and CGS systems provided.

This is a header-only memory pool library for C++

These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or associative. For successful solutions, CompleteSquareSteps shows the steps of the search. The number exchanges at each step and the intermediate squares are written to files. MagicSquares does not require an input file. MagicSquares (only) also supports concentric and pandiagonal. (Pandiagonal succeeds only for small orders.) See: http://budshaw.ca/Download.html#complete http://budshaw.ca/Download.html#magics http://budshaw.ca/addenda/downloadNotes.html#completenotes

Project moved to GitHub. Check out the description there. https://github.com/adigostin/mstp-lib

neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).

ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. It can be integrated with visualization libraries like VivaGraphJS to animate or highlight computed paths in a rendered graph, enabling interactive routing features. Its data structures and algorithm choices are optimized for performance and memory efficiency, so even large meshes or road networks can be navigated interactively. With its standalone design, ngraph.path can be used in browser apps, server-side Node.js services.

ogx-rete implements the RETE algorithm in c++.

OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has been discovered, and it is added to the ontology. If the user rejects it, the user has to give a counterexample to this question, i.e., an individual that is an instance of C1, C2 and not C3. When all such questions (about some initially given classes) have been answered, the ontology is complete with respect to the application domain.

A library to support spread activation techniques over ontologies.

Blueprint for developing applications based on zend framework.

A library for Lock-Free Data Structures

Openminer, as a data mining engine, is developed on java for analysis of dataset with the methods of data mining. By making use of openminer, we could discovery the knowledge which interests us but hides in the raw data.

Our Project is a little program that implements dijktra- and kruskalalgorithms.

A general OWL reasoning framework for the analysis of big biomedical data and implement a MapReduce-based property chain reasoning prototype system. OWL reasoning method is ideally suitable for problems involved complex semantic associations because it is able to infer logical consequences based on a set of asserted rules or axioms. MapReduce framework isused to solve the problem of scalability. In our experiment, we focus on the discovery of associations between Traditional Chinese Medicine (TCM) and Western Medicine (WM).

>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pack:tag is now available at github: https://github.com/galan/packtag >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.

This library implements PEG (Parsing Expression Grammar) parsers, which can be embedded in a C++ program. The grammars are built and interpreted at run time, without an intermediate code generation stage. It tries to mimic as closely as possible the functionality and style of Ian Piumarta's LEG compiler. LEG grammars can be translated easily and almost mechanically. Actions and semantic predicates can be written directly in the grammar, using lambdas. C++11 or later is required.

Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.

phonet4j is the port of a extensible, rule based algortihm for phonetic conversions written by Joerg Michael to java. His code was first published in the computer magazine c't (issue 25/1999, pp. 252). Includes two rulesets for the german language.

phonet4n is an extensible phonetic string conversion algorithm. It is a .net implementation of a powerful German phonetic library described in "doppelgaenger gesucht", c't 25/99, p. 252.

Phpf2f (php4 to 5) is a shell script written by Mariano Fiorentino, to migrate php4 code into php5 syntax.

plausj a collection of checksum algorithms used to validate business keys like bank account codes or credit card numbers. It's compiled as JVM bytecode files (although it's not necessarily implemented in Java) and can be used on JRE 1.5 and later.

General purpose state observation library for Plan Old Java Objects. It enforces Model-View-Controller paradigm, has well defined API and set of ready made implementation algorithms.