Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
Download Now
MongoDB Atlas runs apps anywhere
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
NullAllEst is the implementation of a maximum likelihood algorithm to estimate the frequency of a null allele in microsatellite genetic data. A Markov Chain Monte Carlo simulation is used to solve the likelihood function.
IntiMap is a convenience tool to run the MS-DOS command-line tool MapPop for selective genotyping. It adds facilities to prepare genotyping data files, manage genotype sets and visualize mapping results (genetic marker maps).
Project Tokaf is an general implementation of top-k algorithm. It provides interfaces for all modules that are needed. It also features user preferences module, for computing new preferences and manipulating existing ones.
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.
Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.
A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.
OAP Lite is Optimized Algorithms Platform Lite, which simplifies the process of solving some optimization problems by Genetic Algorithms. It is a highly configurable, efficient tool for user to get the optimum result without programming.
An implementation of the Compositional Pattern Producing Networks (CPPNs) and Neuro-Evolution of Augmenting Topologies (NEAT) proposed by Kenneth O. Stanley, based on the Genetic Art tool from Mattias Fagerlund.
M+ Compiler/Interpreter is a interpreter library written in Java that delivers the possibility to extend any Java application with simple scripts. Besides the usage of native datatypes and operations you can instantiate and call native Java objects.
Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform.
Geographic restrictions, eligibility, and terms apply.
Galapagos is a GeneticAlgorithm framework written in Java 5 with the intended audience of undergraduates in an Artificial Intelligence class. The goal of Galapagos is usability: a competent student should be able to learn this library in an afternoon.
This project intends to create an indexing search engine, for knowledge management. The primary object is to apply an information retrieval core. And implement a knowledge data discovery theory such as data mining algorithm, text mining.
Java aplication that helps genetic engeneers to simulate the outcome of experiments (electroforesis, DNA cloning and cleavage), search for specific sites in
DNA sequence, draw DNA maps
with features: protein and regulation genes, restriction sites
OGA, Open GeneticAlgorithm implements the evolutionary genetic algorithms with an user interface in GTK+. The main goal of the program is solve complex problems using evolutionary algorithms like genetic algorithms or evolutionary strategies.
musicomp is a program which most important element is an evolutionary algorithm which uses data mining methods as a fitness function to generate monophone melodies.
Private-key, symmetrical (same password to encrypt and decode) file encryption with 8-bit to 2147483647-bit (2^3 to 2^31) encryption using my own algorithm and my own extension of MD5 (http://blog.robtoth.net/2009/06/tencryption-computer-programming.html
NeuroDraughts is a Draughts/Checkers game that teaches itself how to play through self play. It combines an Artificial Neural Network, trained by Temporal Difference Learning using some GeneticAlgorithm style behaviour.
Markov interpreter is an interpreter for "Markov algorithm". It parses a file containing markov production rules, applies it on a string and gives the output.
QMCMinimizer is a java-swing based aplication. It's designed with the purpose to be used as a tool on university degrees such as computer science, for teaching the process of boolean function simplification, through the Quine-McCluskey algorithm.
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...
jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.
The Drools.NET is a .NET port for Drools, which is a java Rules Engine based on Charles Forgy's Rete algorithm. Drools.NET enables .NET developers/Users to exploit the powerful Rule Engine like Drools through a completely managed .NET code base.
This project provides a JAVA library and a graphical user interface which implement the "FastICA" algorithm based on the paper "Fast and Robust Fixed-Point Algorithms for Independent Component Analysis (ICA)" by Aapo Hyvärinen.