Open Source Algorithms - Page 14

My personal computing suite provides some programs I developed as a hobbyist and currently include a lambda calculus interpreter and a calculator which solves arithmetic expressions; both are written in C++.

A heuristic approach to solving the Knight's Tour Puzzle

BinBase is a software for the automatic analysis of Massspec data from LECO GC-Tofs. All code and documentation has been moved to the google code site of this project: https://code.google.com/p/binbase/ And support is provided by the company coding and more, which can be reached under: contact@codingandmore.org

Programm for test BinMatrix, a class for manage binary matrices.

This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.

Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. In Proceedings of the BioNLP 2011 Workshop Companion Volume for Shared Task, Portland, Oregon, June. Association for Computational Linguistic

It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.

A library for iris-detection written in pure C# and .NET 3.5.

This is a Python script for Blender which uses short (quaternion-based, floretion-based) algorithms to draw curves in space. The user can create new shapes and curves by setting a variety of parameters.

Booleans all meshes on the screen. Plus: A fractal generator and attractor generator with a delicious SEARCH function ;) <meta name="google-site-verification" content="cULQewNGfx-aXCQR9fTJZ1Z7DXbLA5GjqjvAfF_oH5I" />

Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.

Portable, optimised implementation of Bruce Schneier's 64-bit symmetric block cipher, Blowfish. Includes support for ECB, CBC, CFB, OFB and CTR block cipher modes, weak key detection and parallelisation using OpenMP.

"Blue Planet" is a research project simulating the behaviour and darwinian evolution of unicellular lifeforms, each controlled by its own genetic program. Moreover, "Blue Planet Inhabitants" are suited for swarm intelligence and swarm research.

BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.

The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc

Bookinex is an application designed to index your collection of books, it supports scanning of Barcodes to recognize ISB Numbers and querying web services to collect data.

A general purpose and measurement conversion library in Pascal.

Bricks4J is a set of common tools, utils and classes for Java, aiming to ease development for a widespread kind of tasks.

We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classification problems with millions of high-dimensional examples within minutes on a regular personal computer. We provide command-line and Matlab interfaces to BudgetedSVM, efficient API for handling large-scale, high-dimensional data sets, as well as detailed documentation to help developers use and further extend the toolbox.

This project provides documentation on two different approaches to permutations. Permutations can be generated by building them or by transposing characters between different character positions. My project addresses the efficiency between CPU speed and memory usage for generating unique permutations from input source texts that have repeated characters. The challenge is to create an efficient algorithm that can have the capacity to permutate sources texts that are hundreds and thousands of characters long without running out of memory. This project has 4 download files (1 pdf that documents the algorithms, and 3 Excel files, each for a different algorithm) The downloadable Excel files are the programming files because I code in VBA. You will need to enable macros to run the algorithms. You can view the VBA code of each algorithm from the developer module house inside Microsoft Excel. The lexigraphical algorithm is faster because it supports multi-threading.

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

Cul is a simple utility library written in c programming language that provides many typical structures (vectors, matrices, lists, trees) and algorithms (automatic structure management, sorting, etc.) for the programmer.

A plug-and-play class-library project of standard Data Structures and Algorithms, written in C#. It contains 75+ Data Structures and Algorithms, designed as Object-Oriented isolated components. Even though this project started for educational purposes, the implemented Data Structures and Algorithms are standard, efficient, stable and tested. This is a C#.NET solution-project, and it contains three subprojects. Algorithms, a class library project which contains the Algorithms implementations. Data Structures, a class library project which contains the Data Structures implementations. Also, UnitTest, a unit-testing project for the Algorithms and Data Structures.