Open Source Mac Algorithms - Page 33

eBarter froms trades from commitments. It measures economic values without the need of a common value standard; distributes fairly the gain produced between participants and gives the preference to trades where participants have the weakest requirements.

A LGPL library to handle xml documents in a DOM-like style. It's designed for LOW-performance systems (like embedded ones) and for lightly handle very large documents, automatically speeding up memory management in a user tunable style.

The Flexible Registration and Evaluation Engine (f.r.e.e.) allows the composition, evaluation and optimization of image processing/registration algorithms. It also aims to boost the exchangeability and comparability of data and algorithms in research.

Flash/PHP adaptation of the XTEA encryption algorithm. Allows encryption/decryption of sensitive data using 128-bit key. May be used for network data (HTTP) or offline for implementations like secure CD-ROM projects.

a tokenizer that is general purpose, and multilanguage. it will provide consistent usage across the languages, and be tied into that language's unique common usage types.

This is a review summary project about preparing for front-end interviews that I have summarized, and the project is updated from time to time. This is not only a strategy for job interviews, but also a collection of front-end ers to examine themselves and achieve breakthroughs. I hope that through this guide, everyone can open up their own lines of Ren and Du, and go further on the road to the front. This warehouse uses a large number of diagrams to convey knowledge. The so-called picture is worth a thousand words. I hope that this kind of graphic expression will make it easier for you to remember some abstract and incomprehensible concepts. "Graphic Front End" is my subtitle to it. Interviewing is a very subjective and difficult thing. Just because you don't pass the interview doesn't mean you're unqualified, just like passing the interview doesn't mean you're qualified. As a candidate, you are usually given 45 minutes to demonstrate your skills.

Fugu is a small C++ library of generic components for computer graphics applications. It's written on top of boost.

fxSTL is a C++ container library. fxSTL stands for the Fixed Standard Template Library. fxSTL is not a replacement for the STL, but is rather an extension of the STL that provides implementations of fixed size containers.

gacap is a C++ template library about `Generating All Combinations and Permutations'. It refers to std::next_permutation().

Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.

A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.

Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

Attempt to create a PHP-framework: component-oriented; with global DI-container; for micro-services and also for big module-builded projects; with its own ORM. Little demo: http://complex.php.gi.igor-gilman.de.

Programmer's library for random numbers. Also random number generator testing code. Intended for simulation, games and "Monte-Carlo" algorithms.

go-algorithms is an open-source educational repository that provides implementations of common algorithms and data structures written in the Go programming language. The project is designed primarily as a learning resource to help developers understand how fundamental computer science concepts can be implemented idiomatically in Go. It includes a wide range of classic sorting, searching, and numerical algorithms alongside basic collection structures such as stacks, queues, linked lists, and binary trees. The repository is organized into clear directories by topic, making it easy for learners to explore specific categories of algorithms. Because the code focuses on clarity over heavy abstraction, it is especially useful for students and developers studying algorithmic fundamentals. Overall, go-algorithms serves as a practical reference and study companion for Go programmers building a strong foundation in data structures and algorithm design.

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.

Porting of the core simulation portions of smoldyn to the GPU, using CUDA

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

The gruft library is a fast implementation of several cryptographic functions in JavaScript: MD5, SHA-1, SHA-256, Tiger/192, AES-Rijndael.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

** MOVED: to github.com/gundermanc/gundercrypt A CLI text ciphering program and library written in java that makes use of pseudo random numbers and a password (provided by the user) to generate encrypted text by selectively shifting each subsequent letter by a pseudo-random index, encoding it as a letter stored in a hidden position within the String, and then re shifting the encrypted String again by numeric values deduced from a password to provide a dual layer of security. Easily can be imported into any java project or run via shell commands.

Headrand is a static library wrote in c that contains functions to simulate complex systems or make statistical analysis with a new approach called "random function computing"

iMet-Q (intelligent Metabolomic Quantitation) is an automated tool with friendly user interfaces for quantifying metabolites in full-scan liquid chromatography-mass spectrometry (LC-MS) data. It has a complete quantitation procedure for noise removal, peak detection and peak alignment. In addition to accurate quantitation, iMet-Q provides the charge states and isotope ratios of detected compounds. It accepts input data in netCDF, mzXML, and mzML format and exports quantitation results in csv and txt format. The software source code is freely available under the license of GPL2.