Open Source Windows Algorithms - Page 6

An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).

Simple and Fast Exception Handling for C.

Create and use your own personalized, yet very secure, encoding script!

Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.

PHPXref is a developers tool, written in Perl, that will cross reference and extract inline documentation from a collection of PHP scripts. It generates simple HTML output suitable for browsing offline.

Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm

Software for calculating geometric properties of cross sections and polygons. Calculates: area, moments of inertia, product of inertia, radius of gyration, section modulus, among others. It also supports import and export of CSV, JSON and DXF files. Able to do geometric transformations and 2D and 3D visualization of the cross sections.

A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.

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

devFlowCharter is a complete environment for creating program flowchart, source code generation, and compilation. Its main goal is to be straightforward, educational tool for use during procedural programming classes.

Crc32 is a Visual Basic 6 project using the crc32 algorithm. It consists of: * a console user interface (a native console application) * a graphical user interface (a html-xml-javascript generated interface using the webbrowser control)

LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.

A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more.

OCaml-Reins is a data structure library for O'Caml that includes cursor based iterators, a collection of functors to minimize client-side boilerplate, a powerful on-line benchmarking system and Quickcheck style testing infrastructure.

Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. For this purpose, Opt4J relies on a module-based implementation and offers a graphical user interface for the configuration as well as a visualization of the optimization process.

SDL_Collide is a simple 2D collision detection library for SDL supporting pixel perfect collision tests between surfaces, bounding box collision checks and circle intersection routines.

A slightly reduced strength bulk encryption. In exchange for the reduced strength, you get the ability to rsync the encrypted files, so that local changes in the plaintext file will result in (relatively) local changes to the cyphertext file.

uCOS-III porting for STM32F2xx (STM322xG-EVAL)

The C Algorithms library has moved to GitHub. Please go to the new project page: https://github.com/fragglet/c-algorithms

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.

(New version 1.04 is released) Dynamic Arrays is a set of useful very fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how it works.

Libraries providing optimized alternative implementations for Delphi VCL/RTL functions, methods and classes.

A set of software tools useful for building, testing, and exercising web services (and other interfaces) for the travel industry which comply with the specifications of the Open Travel Alliance (OTA). This project is initiated by members of the OTA.

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms.

USPS One Code - Intelligent Mail Barcode (4-State Customer Barcode) - encoder implementation with VS 2008. Source code in C# and VB.NET and binaries for .NET (1.1, 2.0 and 3.5), .NET CF (2.0 and 3.5) and Mono (1.* and 2.0).