Open Source Linux Algorithms - Page 41

Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters.

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml

SweenJet helps developers to create Java applications. It provides constrained models, useful Swing components (e.g. splash screen, input fields), actions, look-and-feel enhancements (e.g. themes, multi-line tooltip), and a complete preferences system. This project is no longer actively developed.

Swiss Army Knife C++ Toolkit is a set of versatile tools for C++ development. It offers to a developer variety of everyday needed tools for programming. Among these tools are configuration files reader, Tokeniser, Singleton template and many more.

Syntactic is a simple C++ library for constructing general Neural networks. For now the library supports creation of multi layered networks for the Feedforward Backpropagation algorithm as well as Time Series Networks. More will be implemented soon.

Stochastic discrete event system analysis and verification are essential in order to ensure reliability in such systems. However, models that cannot be constructed with an hand-made process need to be learned. Thus, the SDES toolbox proposes an automated solution that is embedded in Matlab to learning and analisis generalized semi-Markov processes.

This project is intended to provide Git access to the code of the original project, TA-Lib, which uses Subversion. It is intended for system integrators wishing to use TA-Lib in their Git-managed project through Git submodules or subtrees. No actual development is being done here; all development happens in the original project.

Teeser is a java-based integration framework for engineering emergent self-organizing behavior in distributed systems. It contains tools for analysis, tuning, macroscopic probing and simulations of distributed systems. Library of tools can be extended and everybody is encouraged to provide and share its tools with the community. The main idea is to provide application designers ability to seamlessly use tools which are helpful to design self-organizing behavior. Designers can continue to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information.

TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.

Serve timeouts by calling a service-function periodically and an independent time-source (toticker). If you need a timer and like to try this one, please write your experiences to me in brief! And may be suggestions, of course. 10ms tick time should be possible. May be less. DO NOT USE Version less 0.1.1 - it is definatly buggy! Easy to control timers via Handle, eg auto create&start a timer via totimer_setTimeout function. Optionally use Callback-Functions if timeout expires. See uws-readme.txt for further info.

It is the source code for a tree mining algorithm called TRIPS. It can mine frequent subtrees from a forest of tree structures.

Tina's Random Number Generator Library (TRNG) is a state of the art C++ pseudo-random number generator library for sequential and parallel Monte Carlo simulations.

An open-source implementation of our network-based target deconvolution approach, named target addiction score (TAS). License: The TAS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to the publications below. Citation: Yadav B, Peddinti G, Pemovska T, Khan SA, Szwajda A, Tang J, Wennerberg K and Aittokallio T. From drug response profiling to target addiction scoring in cancer cell models. (Submitted)

Taseree has been renamed to Drools Planner and moved to JBoss.org, see http://www.jboss.org/drools/drools-planner

DOCUMENTACIÓN A PRESENTAR. 1. Memoria preliminar describiendo la tecnología a utilizar y su justificación, planificación de las tareas a realizar y distribución de dichas tareas entre los miembros del grupo. 2. Ejecutable que cumpla los requisitos establecidos en la memoria. 3. Memoria final del proyecto, en el que se incluirá: a. Descripción de la tecnología utilizada y, en el caso de que no coincida con la establecida en la memoria preliminar, justificar el cambio. b. Descripción de los costes computacionales y requisitos tecnológicos. c. Manual de usuario del programa desarrollado. FASES 1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto). 2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos) (límite: 23 de mayo). 3. Presentación del trabajo (2 puntos) (28 de mayo).

A Tcl extension for genetic/evolutionary algorithm processing. It is using the GAUL library for the core functionality.

A test suite and benchmark for exact Euclidean distance transform algorithms used in Image Processing and computational geometry. It evaluates the exactness and speed of algorithms for a large number of test cases. Results can be visualized in Scilab.

TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).

A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks results table for your system and saves libraries priorities into the libraries.json file in TextDistance's folder. This file will be used by text distance for calling the fastest algorithm implementation. Default libraries.json is already included in the package.

Three software packages to work with RFC2617 digests: libdigest (C library to compute digests), libcppdigest (C++ library to manage /etc/passwd-like files) and libpam-digestfile (PAM module allowing authentication via an /etc/passwd-like file)