Open Source Windows Algorithms - Page 38

The Spiffy framework is a collection of often used helper methods and utility classes used in industry. Such methods and classes solves existing and re-ocuring practical problems and remedies annoying features of the Java language.

Command line encryption tool for one time, daemon, or stream data processing. Data stats, check sums, conversion to/from text. Data/keys from files, pipes, standard input. In-place/diverted processing or data-analysis-only. Random, file, password keys.

Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys

Implements a stepped state machine, i.e. a state machine which executes a single state transition at a time. Because of this, no data, e.g. state data, can be stored between executions. Instead, any such data must be stored in persistent storage between executions. This permits operation of the state machine as a CGI program in a web server. A WSGI or fastCGI or other such web server is not required. Received symbols may be received from sources outside the state machine, or may be generated internally by the state functions.

Developing Lisp programs for the LEGO EV3 brick. I have developed in the Java programming language a Lisp interpreter named StormLisp. It can be started on the PC either to process general Lisp programs or to experiment with Lisp. In addition, its main domain is the LEGO EV3 brick that can be controlled by using a StormLisp program. For this I use the leJOS EV3 system which enables the LEGO EV3 brick to process Java programs. This system must first be installed on the LEGO EV3 brick. Then StormLisp is transmitted to the LEGO EV3 brick to process Lisp programs.

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

Project that will provide implementations in Java's Micro Edition (J2ME) platform of algorithms on strings, for exact/inexact matching, similarity distances, among others.

A "programming language" that can generate random strings. Useful for creating password, but has many other uses (it can generate IP addresses, fully random but pronounceable words, ..., anything that a string can represent). Written in C#

Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. The stack, the tree and the hash table accept int, float and char* data type To look at the python library : https://github.com/mnoorfawi/struct-pie

Sub::Contract offers a pragmatic way to implement parts of the programming by contract paradigm in Perl.

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

Небольшая и быстрая библиотека написанная на javascript, которая генерирует псевдослучайные числа с практически непредсказуемым разбросом вероятности выпадения для каждого генерируемого числа, а также случайно динамическими границами диапазона псевдослучайной последовательности (для каждого генерируемого числа). Другими словами: эта библиотека ведет себя настолько не предсказуемо, что иногда выдает неопределенное значение (NaN) или бесконечность (Infinity), и почему это происходит не знает даже сам разработчик!

* Requires : .net framework 4.5 or later Sudoku , This application developed using C# and requires .net framework 4.5 or later. GUI supports better good feedback for each and every action. To easy to handle. Save and reuse the Sudoku file , all files are stored as .sdku files ( sudoku files ) and this files are opened only through this application. Use it and rate it !

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

A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.

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.

Centre is a synthetic trajectory generator environment that aim to generate semantic-based trajectory datasets usable for spatio-temporal data-mining algorithms in testing and validation process.

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.

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.