Search Results for "algorithm" - Page 34
Sort By:
Showing 2780 open source projects for "algorithm"
View related business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
... of the Riemannian Hessian (if a Newton method is used) in Matlab or C++. The package optimizes the function given a set of user-specified parameters, e.g., the domain manifold, algorithm, stopping criterion.
-
2
Rootvole
a text parsing library that matches text with concepts.
For general processing of voice queries we developed a text parsing library named 'Rootvole' that can be used to match text with semantic concepts. The algorithm was implemented in Java and can be described as a form of a parsing expression grammar, where we generate the expressions to be detected beforehand by regular expressions and store them in a vocabulary. The central class is the parser class, which is instantiated as a series of vocabularies, simple text lists that describe tokens... -
3
ShaSeSha
Implementations of Shamir's Secret Sharing algorithm
Javascript, Python, C++ implementations of Shamir's Secret Sharing algorithm. This is very much a work in progress, and while the functionality is there to split and join, it needs work, cleanup, documentation, profiling and testing. It is only provided in the hopes it may be useful. I make absolutely NO guarantees or warranties, not even of merchantability, either expressed or implied, and do not make any claims about the security or reliability of this project. I do not authorize it's... -
4
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting... -
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.
-
5
Continuous time Markov chain (CTMC) can be used to describe describe the number of molecules and the number of reactions at any given time in a chemical reaction system. Gillespie algorithm is an important stochastic simulation algorithm, used to simulate each reaction track events of continuous time Markov chain in the number of collision frequency and collision time, but the computational cost is inevitably. In this project, Gillespie’s algorithm with rejection sampling introduces...
-
6
KeplerCentroidRoboVetter
Automatically provide centroid dispostions for Kepler KOIs
This is the source code for the Kepler Centroid Robovetter, a part of the Kepler Robovetter. The code finds signals otherwise incorrectly identified as planets in the Kepler Planet Candidate Catalogues. This part of the robovetter finds transit like signals on stars near the target, where the light spills into the aperture of the target star causing a false positive. The algorithm is documented in detail in Mullally et al (2015c), submitted to ApJ. The code can **not** be run. It uses... -
7
ZORE is a syntax-based Chinese (Zh) ORE system, which can extract relations and semantic patterns from Chinese text. ZORE identifies relation candidates from auto- matically parsed dependency trees, and then extracts relations with their semantic patterns iteratively through a novel double propagation algorithm. Empirical results on two data sets show the effectiveness of the proposed system. This software source is under GPL (v.3), and a separate commercial license issued by the authors for non...
-
8
This is a refactored C++ version of subroutine dqelg of QUADPACK, an implementation of the epsilon table extrapolation algorithm, originally written in Fortran 77. This version is expected to exactly reproduce the roundoff errors of dqelg. Declarations for standard-conforming Fortran bindings are also provided.
-
9
lxnstack
A program to align and stack astronomical images.
...') * Hot pixels suppression algorithm * CR2 files native support * Can load/save video * Grayscale RAW image support * Editing of result image's levels. * Light curve generation -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
10
Password Keeper
manage your passwords in a secure way
.... Unimaginable. Password Keeper helps you to manage your passwords in a secure way. You can protect all your passwords with Password Keeper . You only have to remember one single master password to unlock the application when it starts only. your login and passwords are encrypted using the best and most secure encryption algorithm currently known (AES). -
11
Face recognition PCA
Face recognition using Principal component Analysis Algorithm
A Face recognition Dynamic Link Library using Principal component Analysis Algorithm -
12
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. -
13
Ritornello
Control free ChIP-seq peak caller
Ritornello is a ChIP-seq peak calling algorithm based on signal processing that can accurately call binding events without the need to do a pair total DNA input or IgG control sample. This project has moved to github as follows: https://github.com/KlugerLab/Ritornello -
14
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. -
15
Jafaran
Fast and more random implementations of java.util.Random.
Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. 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... -
16
jPainter
Java-based paint program using DDA, Bresenham and Circle algorithm
Java-based paint program using DDA, Bresenham and the Circle algorithm. It is meant to show the implementation of algorithms that are used to draw primitives. -
17
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. -
18
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. -
19
AES256 Password manager Russian version
Simple password manager in Russian
Simple password manager that uses encryption AES 256. Translated into 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... -
20
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/ -
21
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 -
22
iCAS - An Illumina Clone Assembly System
An Illumina clone assembly system using SOAPdenovo and ABySS
Clone-by-clone sequencing, as a means of achieving high quality assemblies for large and complex genomes, continues to be of great relevance in the era of high throughput sequencing. 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... -
23
Parallel Quicksort with MPI
Parallel Quicksort with MPI
Sorting is used in human activities and devices like personal computers, smart phones, and it continues to play a crucial role in the development of recent technologies. The QuickSort algorithm has been known as one of the fastest and most efficient sorting algorithm. It was invented by C.A.R Hoare in 1961and is using the divide-and-conquer strategy for solving problems [3]. Its partitioning aspects make QuickSort amenable to parallelization using task parallelism. MPI is a message passing... -
24
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. -
25
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...
