Open Source Mac Algorithms - Page 10

The Catalsyt Framework is a refinement on the MVC framework. It provides greater focus on user business workflow rather than application workflow. It's goal is to enable business analysis and developers to work closer.

ChIPOTle 2.0 is a user friendly tool for performing peak detection in ChIP-chip signal. The tool also has functions for probe sorting, signal normalization, replication merging, and multiple correction testing in a windows interface or *nix command line.

A tool to represent Chapin diagrams

Fast search using a standard SQL on Oracle or PostgreSQL database. The package includes the database creator, loader and web application. It supports SMILES and SMARTS substructure searches, similarity search, stereochemistry.

Hasher is a .NET class library to help programmers implement standard hashing and checksum algorithms into their own software. Written entirely in C#, Hasher providers a uniform interface to easily use any of the algorithms contained within this library

A C++ library for clipping polygons.

CoPP is an object-oriented framework for developing algorithms for robot path planning. One of of the design goals is to make it easy to make comparisons between various path planning algorithms.

Coach is a python framework that models the interaction between an agent and an environment in a modular way. With Coach, it is possible to model an agent by combining various building blocks, and training the agent on multiple environments. The available environments allow testing the agent in different fields such as robotics, autonomous driving, games and more. It exposes a set of easy-to-use APIs for experimenting with new RL algorithms and allows simple integration of new environments to solve. Coach collects statistics from the training process and supports advanced visualization techniques for debugging the agent being trained. Coach supports many state-of-the-art reinforcement learning algorithms, which are separated into three main classes - value optimization, policy optimization, and imitation learning. Coach supports a large number of environments which can be solved using reinforcement learning.

code-catalog-python serves as a grab-bag of small, readable Python examples that illustrate common algorithms, data structures, and utility patterns. Each snippet aims to be self-contained and easy to study, with clear inputs, outputs, and the essential logic on display. The catalog format lets you scan for an example, copy it, and adapt it to your use case without wading through a large framework. It favors clarity over micro-optimizations so learners can grasp the idea before worrying about edge performance. Over time it becomes a personal cookbook of solutions you can remix across projects. This approach is especially helpful when you need a quick refresher on a technique you haven’t used in a while.

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.

Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.

A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.

It consists of a library of Java classes that gives us support the programming of applications. Boring, repetitive tasks will be included in CommunityUtil. So this is the aim: to provide fast that encapsulates all classes complicated tasks.

Comparador de Algoritmos de Ordenação

CoRoPa stands for Computational Rough Paths. The aim of CoRoPa is to provide a software framework for various ideas related to Rough Path Theory, including rough differential equations and the digital description of serial data streams.

Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.

I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) In the meantime I added other Algorithms beside countbisset (hamming weight): ceil(log2()) + floor(log2()), bitreverse, ... I also recommand to try the code with different compilers and / or plattforms. PS: see result.txt in Code, to see various runs with different compilers and compiler switches

A cron expression parser.

This library exposes security functionality to the programmer, such as random number generation, hashing, salted hashing, message authentication code, symmetric encryption, asymmetric encryption, hybrid encryption, digital signature and in-memory protection. The library is accompanied by a sophisticated reference implementation, that demonstrates how to make use of the CryptoLibrary.

Cutting Problem solved by Genetic algorithms. The goal is to cut a rectangular plate of material into more smaller rectangles. The cuts must be rectangular and guillotinable.

D-List is an extensive, production quality, and robust list management subsystem written in C that can be used as a shared library or compiled directly into your project. D-List provides access to 3 classes of lists, and allows extensive manipulation and customization of these lists. D-List lists can also be easily incorporated as primitives into larger treed, or nested data management systems. D-List implements a comprehensive set of linked list primitives that provides multiple forms of both sequential and random element access, bi-directional movement within a list, and an extensive set of list and element manipulation and reordering features. It also provides for an expansive set of user functions that can be added to lists and called automatically, to efficiently implement a broad range of services using the list primitives as underlying technology. It was written primarily for accuracy and speed, and provides extensive debugging support for easy code development.

A C++ library implementing an efficient trie data structure called Double-Array.

C++ implementation of the DAWG and trimmed DAWG data structures. Supports basic string searching.

DBI++ is a C++ port of the famous Perl DBI module. Currently it just supports MySQL, but the goal is, to extend it to a driver-independent interface. License is LGPL, so it can be used in closed-source-software, too.

DIProxy is integrated some DIContainer. And DIProxy reject relation between WebFramework and DIContainer. added DIProxy is implemented Dynamic injection. see at http://diproxy.wiki.sourceforge.net/