Open Source Windows Algorithms - Page 15

This library exposes security functionality to the programmer, such as random number generation, hashing, salted hashing, message authentication code, symmetric encryption, asymmetric encryption, hybrid encryption, digital signature and in-memory protection. The library is accompanied by a sophisticated reference implementation, that demonstrates how to make use of the CryptoLibrary.

Cryptography Tools is a project to develop demonstration tools on classic (currently Caesar and Playfair) & modern crypto-systems, including private & public key encryptions, digital signatures, cryptographic hashes and authenticated encryption.

CuberGA project is the flexible Genetic Algorithms framework. Realize your ideas easy with deliveries of this project. Keywords: genetic algorithms, framework, permutation, mutation, crossover, genotype, selection, survival, Левченко Илья.

With this application you can know all, about current time! Day, month, year, Week day, clock (hours, minutes and seconds), time of execution of application (years, months, weeks, days, hours, minutes and seconds). -> This application has a miniscule consumption of resources. -> This application doesn't need any configuration just need to be executed.

A C++ library implementing an efficient trie data structure called Double-Array.

C++ implementation of the DAWG and trimmed DAWG data structures. Supports basic string searching.

DBI++ is a C++ port of the famous Perl DBI module. Currently it just supports MySQL, but the goal is, to extend it to a driver-independent interface. License is LGPL, so it can be used in closed-source-software, too.

DEBay: Deconvolution of Ensemble through Bayes-approach DEBay estimates cell type-specific gene expression by deconvolution of quantitative PCR data of a mixed population. It will be useful in experiments where the segregation of different cell types in a sample is arduous, but the proportion of different cell types in the sample can be measured. DEBay uses the population distribution data and the qPCR data to calculate the relative expression of the target gene in different cell types in the sample. The user manual of DEBay: https://sourceforge.net/projects/debay/files/UserManual.pdf Sample data: https://sourceforge.net/projects/debay/files/Test_data/ Citation Information: Vimalathithan Devaraj, Biplab Bose. DEBay: A computational tool for deconvolution of quantitative PCR data for estimation of cell type-specific gene expression in a mixed population. Heliyon, 2020, 6(7), e04489. https://doi.org/10.1016/j.heliyon.2020.e04489

DIProxy is integrated some DIContainer. And DIProxy reject relation between WebFramework and DIContainer. added DIProxy is implemented Dynamic injection. see at http://diproxy.wiki.sourceforge.net/

Implementation of Damerau-Levenshtein fuzzy string matching in Java. Returns the distance adding one point per character insert, deletion, mismatche and swap.. This is an extension of apache/commons/lang/StringUtils.getLevenshteinDistance()

DXE (Darkgust's Xor Encoder) is an encryption algorithm made in Visual Basic .NET .

A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).

This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.

Very fast and easy to use Java tool for solving and generating Sudoku puzzles. By using Donald Knuths exact cover algorithmus it can not only solve or create the usual 9x9 but also 4x4, 16x16 or even bigger Sudokus in a very efficient way.

danielmirrai@gmail.com Framework complete for developer quick and easy using the programming model by layers Model view presenter (MVP) having superclasses already being ready all actions database, persistence, validations, instance classes and layouts.

This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress.

The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.

A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#.

Software to build database of all best solution of all configurations of Cube21/Square1 Silver edition puzzle cube. Also 3D UI is provided.

For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value

A generic Deduplication engine to find duplicates in a dataset.

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

Julia implementation of Decision Tree (CART) and Random Forest algorithms.

Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each edge A↔︎B, we will use two half-edges A→B and B→A. Having two half-edges is the key to everything this library provides. It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle. We can draw all the triangle edges without constructing the triangles themselves.