Search Results for "algorithm" - Page 60
Sort By:
Showing 2943 open source projects for "algorithm"
View related business solutions-
Veeam Data Platform v13.1Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
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
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
-
2
Sudoku Solver
Sudoku solving library using bruce-force search algorithm
The SudokuSolver class inside this library is simple and easy-to-use. It uses the bruce-force search algorithm to solve the Sudoku appeared on daily newspapers, books, etc. Continual updates to this library give you easier experiences with Sudoku solving, and can solve other sorts of Sudokus. -
3
Simcas is a simple and very flexible analog simulator. SimCAS uses symbolic equations to define components and solves the net system by using a "Computer Algebra System" algorithm.
-
4
Open Uniper
Open Uniper is the XTRAP's reversed encryption algorithm.
Open Uniper is a project created by d3v1l401 (http://d3vsite.org) and targets to make the encryption algorithm of XTRAP open source. Currently NOT Optimized view of code,NOT Optimized code. -
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
The parallelized FDTD Schrodinger Solver implements a parallel algorithm for solving the time-independent 3d Schrodinger equation using the finite difference time domain (FDTD) method. See the Hosted Apps > MediaWiki menu item for more information.
-
6
CramerAlgorithm
Dense linear solver based on Cramer's Rule and Chio condensation
...The program is structured to take input in the same manner as the DGESV routine from LAPACK. It computes A * x = B, where A is an NxN matrix, B is a solution vector and x is the solution vector provided by the program. The algorithm is parallel in nature and this version utilizes threads for a minimal level of parallelism. It also utilizes SIMD (Single instruction, multiple data – SSE2) instructions to provide parallelism in the core calculations. -
7
SpikeAnalyzer
SpikeAnalyzer is a program for calcium spikes analysis
...The data approximation uses an automatic fitting procedure with visual control over the process and the quality of the fit, including statistical measures. SpikeAnalyzer is equipped with an original pixel time correction algorithm, introduced to account for the exact time of acquisition of individual pixels of the object in the image. SpikeAnalyzer was tested to analyze both synthetic and raw confocal data. -
8
Prime-Number-Finder
Prime Number Finder usign Sieve of Eratosthenes
Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. At first you will be prompted with an input, after that you can call it using function prime_finder(n) example call: >>>prime_finder(10) #output [2,3,5,7] (Int) -> (list) -
9
Java application for training and deploying text processing applications such as part-of-speech taggers, based on a re-implementation of Brill's algorithm in Java.
-
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
Cake
A bioinformatic tools for somatic mutation discovery
Cake, a bioinformatics software pipeline that integrates four publicly available somatic variant-calling algorithms to identify single nucleotide variants with higher sensitivity and accuracy than any one algorithm alone. Cake can be run on a high-performance computer cluster or used as a stand-alone application For additional information on how to obtain and run Cake, updates and known issues please visit the wiki page https://sourceforge.net/p/cakesomatic/wiki/Cake%20Somatic/ -
11
QSAR Kennard Stone
Kennard Stone algorithm based division
The purpose of this program is to perform rational selection of training and test set based on Kennard Stone algorithm: -
12
sqlite3fish
Another encryption solution (with Blowfish algorithm) for SQLite3
The sqlite3fish is another encryption solution for sqlite3. It is based on some source code of botansqlite3(https://github.com/OlivierJG/botansqlite3) . But it does not need Botan library, it uses Blowfish algorithm to encrypt/decrypt the database file. This library only depends on the source code(no-modify) of SQLite3, it is clean and easy to compile. But currently it only supports the version 3.7.0 of SQLite3 (http://www.sqlite.org/sqlite-amalgamation-3_7_0.zip) . -
13
Tetris AI
A try to demonstrate an AI module based on doubled genetic algorithm.
-
14
mrCaNaVaR is a more user friendly and faster re-implementation of our previously published algorithm together with the mrFAST/mrsFAST/drFAST read mapping programs to discover large segmental duplications and deletions and predicts absolute copy numbers.
-
15
DNAcompact
Genome compression algorithm with/without reference (Linux/Windows)
...The proposed method without a reference led to bit rates of 1.720 and 1.838 bits per base for bacteria and yeast, which are approximately 3.7% and 2.6% better than the state-of-the-art algorithm. Regarding performance with reference, we tested on the first Korean personal genome sequence data set, and the proposed method demonstrated a 189-fold compression rate, reducing the raw file size from 2986.8 MB to 15.8 MB. -
16
Molecular Measurer
Parallel, Stochastic Measurement of Molecular Surface Area
A program to measure molecular surface area. The algorithm is GPU-accelerated using CUDA and is described in the research paper linked from the project home page. The input to the program is xyzr files, which can be generated from pdb files. -
17
cCNN
A fast implementation of LeCun's convolutional neural network
Code of this library is partialy based on myCNN MATLAB class written by Nikolay Chemurin. -
18
Crap Killer
Automatically Detect and Remove Crapware
This is a script which uses my super-cool Heuristic Detection Algorithm to find and automatically uninstall "crapware" (toolbars and 'coupon printers' for example) from all current versions of windows. It's also possibility the most advanced batch file in the world... -
19
GestureDetect
Gesture detection with Kinect+OpenNI+Unity3D
...It reads skeleton data from MS Kinect or similar motion capture devices. To acquire skeleton data, we uses OpenNI 1.5.4 because it is an open source library. The scripts in the project are written in c#. The algorithm we use is template matching. The structure of the code is clear and not very complicated. If you want to use it on other platforms, you may pick part of the scripts in the "GestureScripts" folder and try to edit them to fit other SDKs or platforms. The usage and algorithm introduction are also provided. Try it and have fun! -
20
The utility sfxcompress is a bash script used to pack and encrypt the current directory on a self-extracting file. It also includes the calculation of the MD5 function to check if the compressed file is correct.
-
21
J! Secure Password Hashes provided an easy access to all Joomla! password hash algorithms and the Drupal 7 SHA-512 hashing algorithm. Compatible: Joomla! 2.5.
-
22
Hash Me
Create different hash results to take an unique file identification.
...This one creates the chance for the receiver confirm that the original file didn't take any modification along the way. ============= HOW IT WORKS ============= * For full help description, type "hashme.exe -help" at command line. => hashme.exe <filename> <hash algorithm> Output the hash result from specified file. => hashme.exe <filename> -c Create a .hashme file with hash information about the specified file. Send the .hashme file with the original file and then, at the destination, run the command "hashme.exe <filename> -c" again. It will check if the file was modified from its original state. -
23
...I am not able to maintain and update the software due to change in research funding. However I will be happy to answer any queries or provide support and comments if you are interested in extending this algorithm. The method is fully described in Deshpande, V., Fung, E. D., Pham, S., & Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933. http://arxiv.org/abs/1307.7933
-
24
SeleSup is a simple and fast algorithm (O(n^2)) for reducing the training cardinality of data sets through the elimination of irrelevant instances by mimicking the self-regulatory and suppression mechanism found in the immune system.
-
25
This is the former home of pyecm, which has now been moved to github: https://github.com/martingkelly/pyecm Pyecm factors large integers (up to 50 digits) using the Elliptic Curve Method (ECM), a fast factoring algorithm.
