Search Results for "algorithm" - Page 41
Sort By:
Showing 2943 open source projects for "algorithm"
View related business solutions-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
MongoDB Atlas runs apps anywhereMongoDB 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.
-
1
swe2d
Matlab 2D Shallow Water Solver
This is a set of matlab codes to solve the depth-averaged shallow water equations following the method of Casulli (1990) in which the free-surface is solved with the theta method and momentum advection is computed with the Eulerian-Lagrangian method (ELM). The free-surface equation is computed with the conjugate-gradient algorithm. Casulli, V. (1990) Semi-implicit finite difference methods for the two-dimensional shallow water equations, J. Comp. Phys., 86 (1), 56-74. -
2
Jafaran
Fast and more random implementations of java.util.Random.
...The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm. -
3
treelet_webdemo
treelet webdemo for RNA data
Application to showcase RNA analysis tools using multidimensional processing via tree-wavelet. It encompasses the tree-generation, classification with a wrapper algorithm , and with an ensemble algorithm. Both specifically built for RNA data processing. -
4
Parallel Quicksort with MPI
Parallel Quicksort with MPI
...The main aim of this study is to implement the QuickSort algorithm using the Open MPI library and therefore compare the sequential with the parallel execution. -
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
5
Animal-AV
Animal Algorithm Animation System
Animal is a Java-based system for visualizing and animating algorithms and data structures. Available since 1999, it is one of the established AV systems, and provides one of the largest collections of supported algorithms. Animations can be generated on the fly based on user input - for a large selection of algorithms and topic areas, including, but not limited to, the topic areas of backtracking algorithms, compression, cryptography, basing, searching and sorting. -
6
Java DSA extensions
Java datastructures and algorithms extensions
DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. -
7
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
...To enhance classification performances, we propose an ensemble of classifiers that combine the classification outputs of base classifiers using the simplest and largely used majority voting approach. Instead of creating the ensemble using all base classifiers, we have implemented a genetic algorithm (GA) to search for the best combination from heterogeneous base classifiers. The classification performances achieved by the proposed method method on the chosen datasets are promising. -
8
Steepest-descent-like search algorithm
Heuristic search to find 21-variable PW type functions with NL>1047552
...Maitra) 1) The file "pw21_nlac.zip" contains the source code which computes the nonlinearity and absolute indicator of 21-variable PW type functions obtained from the 4 solutions in Table 1 of our paper (available at http://eprint.iacr.org/2015/1036). See comments in "pw21_nlac.cpp" in the zipped file for details. 2) Steepest-descent-like iterative search algorithm used in the same paper is implemented using the files in "sdl_algo.zip" which are briefly described as follows: "stp_ineq_pw21.cpp": Main file containing the source code (see comments therein for details). "ADK.txt": Contains the integer values corresp. to the vector space representations of nonzero elements in GF(2^{21}). ... -
9
Round Robin Scheduling Simulation
A Scheduling Algorithm
It is programmed using Queue on JAVA You can change CPU Burst, CPU Speed, Add Process manually, ON/OFF -
Build Securely on AWS with Proven FrameworksMoving 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.
-
10
AES256 Password manager Russian version
Simple password manager in Russian
...AES256 Password Manager (originally Encrypter) decoder is a text file that stores the passwords or other sensitive data is completely secure manner using encryption algorithm AES 256-bit. Official page http://xn--90abhbolvbbfgb9aje4m.xn--p1ai/%D0%B1%D0%B5%D0%B7%D0%BE%D0%BF%D0%B0%D1%81%D0%BD%D0%BE%D1%81%D1%82%D1%8C/%D0%BF%D0%B0%D1%80%D0%BE%D0%BB%D0%B8/aes256-password-manager-%D0%BF%D1%80%D0%BE%D1%81%D1%82%D0%BE%D0%B9-%D0%BC%D0%B5%D0%BD%D0%B5%D0%B4%D0%B6%D0%B5%D1%80-%D0%BF%D0%B0%D1%80%D0%BE%D0%BB%D0%B5%D0%B9.html Autor twitter: https://twitter.com/mrkaban546 -
11
ChEnMTD
Calculate the number of theoretical trays with McCabe-Thiele method
Use the McCabe-Thiele method to calculate the number of theoretical trays in a distillation column operated under the conditions specified. It has tools for data analysis to obtain empirical or semi-empirical equilibrium models. You can even use cubic splines. This project uses icons of "Open Icon Library" https://sourceforge.net/projects/openiconlibrary/ -
12
Graph isomorphism algorithm
Graph isomorphism algorithm in polynomial complexity
Graph isomorphism algorithm in polynomial complexity(O(n*n*n). it consume less than 1 second to judge Graph of 800 vertice in general. -
13
iCAS - An Illumina Clone Assembly System
An Illumina clone assembly system using SOAPdenovo and ABySS
...However, assemblies obtained using current whole genome assemblers are often fragmented and sometimes have issues of genome completeness owing to different data characteristics introduced by multiplexed sequencing. With iCAS the data filtering process is based on a novel kmer frequency algorithm, resulting in near perfect pre-assembly reads. Contigs are generated using different assembly algorithms and then merged together to achieve longer continuity. Re-aligning all the reads back to the draft contigs and recalibrating each sequence base achieves a final consensus. Using finished clones for QC, the pipeline is able to obtain assemblies with clone coverage of 99.7% and consensus base quality of Q39. ... -
14
Caesar Cipher v1
Encrypt your messages with Caesar Cipher algorithm.
Encrypt your messages with Caesar Cipher algorithm. -
15
OPTPDT
OPTPDT is a family-based multi-SNP association test
OPTPDT is a family-based multi-SNP association test. A variable p-value threshold algorithm is used in the test to select an optimal subset of SNPs that has the strongest association signals. -
16
Morpheus search algorithm
a mass spectrometry–based proteomics database search algorithm
Morpheus is a mass spectrometry–based proteomics database search algorithm designed from the ground up for high-resolution tandem mass spectra. We have discovered that for high-resolution MS/MS, simple spectrum preprocessing and scoring performs superior to more complex algorithms originally developed for low-resolution MS/MS, such as Sequest, Mascot, and OMSSA. Morpheus is also very fast—up to nearly 5 times faster than OMSSA for large human datasets. -
17
TAG
A tool for metatranscriptome assembly using metagenome graph
TAG is a tool for metatranscriptome assembly using de Bruijn graph of matched metagenome as the reference. TAG is an application of a reads mapping algorithm that we developed for mapping of short reads onto a de Bruijn graph of assemblies. A hash table of junction k-mers (k-mers spanning branching structures in the de Bruijn graph) is used to facilitate fast mapping of reads to the graph. We have shown that TAG helps to assemble substantially more transcripts from metatranscriptomic datasets that otherwise would have been missed or truncated because of the fragmented nature of the reference metagenome. ... -
18
Java implementation of John Platt's Sequential Minimal optimization algorithm. This is an efficent Support Vector Machine solution.
-
19
Real's Ark SE Level Cap Modifier
Creates a Game.INI for increased level cap on ARK: Survival Evolved.
UPDATED: This program automates the process of increasing the your level cap in Ark: Survival Evolved. Just follow the instructions in the program and readme to create a new Game.ini. Unfortunately, you can not make more than 20,723 levels without changing the formula. (You can if you go in the source and change the "5i * i..." part to whatever formula you want. Steam Guide: http://steamcommunity.com/sharedfiles/filedetails/?id=533887324 EDIT: The Lower XP Dinos version makes less XP... -
20
Novi Search Master
The world...on your desktop.
Novi Search is an internet search app that allows you to Google from your desktop. Search works with your default browser set on your computer opening information very quickly. This is much quicker then directly opening up the internet and searching through Google. With Novi Search you can also search YouTube in the same small amount of time. Download Novi Search to save time for the important stuff! -
21
PortOpt
A portfolio-optimizer using Markowitz(1952) mean-variance model
...It returns the vector of assets' shares that composes the optimal portfolio. In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. This solution is very efficient as it allows to solve hundred of thousand of portfolio problems in seconds. PortOpt runs as a text/console tool so it can be easily used in your own scripts. -
22
WiPer
Identification of hubs in weighted networks
-
23
vtrunkd
Network link bonding/trunking/aggregation and multichannel VPN daemon
vtrunkd - network link bonding and multichannel VPN. Vtrunkd is a Linux VPN daemon used to combine several connection paths into one aggregated channel. Features latency, reordering and jitter management, behaviour analysis optimizations for encapsulated protocols, bufferbloat control, packet redundancy, and multiple cpu cores utilization. Up to 30 heterogenous links bonding supported. Used for live streaming, LTE/3G/Wi-Fi link bonding. 32/64-bit, x86, MIPS and ARM supported. Supports python... -
24
PopED lite
Simple, Fast, Intuitive optimal design software for preclin PKPD study
...PopED lite can help you improve your experimental design by algorithmically searching through possible experimental designs and suggesting the optimal experimental design. The algorithm is based on mathematically sound optimal design theory; however, PopED lite is made for users without any background in optimal design or mathematics. Many of the most common models used for preclinical PKPD experiments are precoded and all you need to do is to choose the model and give some specification of the experiment you are running. ... -
25
GGNFS is an open source implementation of General Number Field Sieve algorithm for factoring integers.
