Open Source Algorithms - Page 15

PHASH is a self-contained, dependency-free, post-quantum XOF hashing algorithm implemented in modern C++20. This release delivers the first fully stable production implementation of the PetoronHash-System — a 1600-bit sponge-based hash function with domain separation, extendable output, and deterministic behavior. Key Features No external dependencies — pure C++20 implementation. Extendable Output (XOF) — supports arbitrary output length (256–8192+ bits). Post-quantum oriented design — ARX-based sponge resistant to Grover-type attacks. Context and salt separation — unique hashing domains for each use-case. Optimized performance — ~120–130 MB/s Comprehensive verification — verify_all.sh performs KAT tests, determinism checks, and performance validation. Verification Script: chmod +x verify_all.sh ./verify_all.sh https://github.com/01alekseev/PetoronHash-System Ivan Alekseev | petoron.org

A collection of phonetic algorithms such as metaphone or soundex for use in Python.

Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.

PopED (Population Experimental Design) is a software tool for computing optimal experimental designs. The software has been developed with an emphasis on drug trials based on population models (non-linear mixed effects models).

Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e estudo dos mesmos.

PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below...

A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. More commercially-friendly licenses may be available. Please contact Stephen O'Hara for license options. Please view the wiki on this site for installation instructions and examples on reproducing the results of the papers.

PyPlayground is an environment for developing algorithms involving movement in a space of up to three dimensions using Python.

A Python library for easy creation and manipulation of Google Earth KML and KMZ placemark files. Please get your copy from http://pykml.cvs.sourceforge.net/viewvc/pykml/pykml/?view=tar

A neural net module written in python. The aim of the project is to provide a large set of neural network types accessed by an API that is easy to use and powerful.

This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.

A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.

This library is meant to offer an array of general purpose data structures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.

QuickMP (Quick Multi-Processing) is a simple cross-platform C++ API for generating parallel for loops in shared-memory programs, similar to OpenMP. It provides automatic scalable performance based on the number of available processors.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

Framework for building event-driven applications based on the reactor pattern.

Multi-platform regular expression (regex) creation. Highlights regex matches, and regex groups for quick regular expression creation. Save/load regular expression sessions. Create robust regex patterns on any major platform. Supports PCRE and wxRegEx.

Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

A fast way to rate the reading challenging level of book or text. Unlike well known reading metrics such as Fog, Kincaid, SMOG, ARI, Flesch, and Coleman-Liau readability this metric takes into account far more factors and is standarized against a corpus

RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.

Rupantor- Bijoy to Unicode converter. It converts Bengali texts written in Bijoy fonts to UNICODE. রূপান্তর- বিজয় থেকে ইউনিকোড এ পরিবর্তন করার সফটওয়ার। এটি à

The Simple, Scalable, Script-based Science Processor for Measurements (S4PM) is a system for highly automated processing of science data, scalable up to large processing systems and scalable down to small, special-purpose processing strings.

Search Agents - a framework for collaboration of meta-heuristic agents

Open Source Tool for Search Engine Optimization (SEO & SEM) used for automatic content processing. These SEO Content Genrators and Article Writers based on Text Writer: https://www.artikelschreiber.com/en/ https://www.unaique.net/en/ https://www.unaique.com/ https://www.artikelschreiben.com/ https://www.buzzerstar.com/ https://googleduplicatecontentsolver.sourceforge.io/ https://inkassos.github.io/inkasso/ https://www.artikelschreiber.com/opensource/ https://www.sebastianenger.com/ https://www.artikelschreiber.com/marketing/review/ https://muckrack.com/markus-muller https://linktr.ee/textgenerator Code Contains: - Perl Source code, language databases and more