Search Results for "algorithm" - Page 19
Sort By:
Showing 1986 open source projects for "algorithm"
View related business solutions-
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.
-
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
JSiteDescriptor
Binding site descriptor generation for SVM based classification.
A set of java programs that extract coordinate and chemical information from PDB files. The binding site regions are extracted using grid based scheme. For binding site, spatio-chemical descriptor is generated based on PocketMatch algorithm of Dr. Kalidas (author of this project too). -
2
D-Tailor
D-Tailor: automated analysis and design of DNA sequences
... of sequence analysis tools into a Monte-Carlo algorithm that evolves synthetic sequences towards user-defined goals. -
3
TimescapeGlobal
a space-time interpolation geostatistical tool
This software is a time-aware geostatistical tool. Including time variability adds further issues to the already complicated field of geostatistical interpolation. On the other hand, most of the distributions of variables used in Earth and environmental sciences show patterns of change over time, not only in space. This tool is a free, open-source software, based on a generalization of the Inverse Distance Weighted algorithm. It outputs three-dimensional, layered discrete models from which... -
4
v1pad
One-time-pad encryption using a virtual pad
v1pad is a command-line tool that encrypts and decrypts files using one-time-pad encryption. v1pad uses a virtual pad, meaning that the one-time pad is generated dynamically based on user input instead of being stored in a file. The name v1pad is an abbreviation for Virtual One-Time Pad. -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
5
Synaptic
Architecture-free neural network library for node.js and the browser
Synaptic is a javascript neural network library for node.js and the browser, its generalized algorithm is architecture-free, so you can build and train basically any type of first order or even second order neural network architectures. This library includes a few built-in architectures like multilayer perceptrons, multilayer long-short term memory networks (LSTM), liquid state machines or Hopfield networks, and a trainer capable of training any given network, which includes built-in training... -
6
AI learning
AiLearning, data analysis plus machine learning practice
We actively respond to the Research Open Source Initiative (DOCX) . Open source today is not just open source, but datasets, models, tutorials, and experimental records. We are also exploring other categories of open source solutions and protocols. I hope you will understand this initiative, combine this initiative with your own interests, and do what you can. Everyone's tiny contributions, together, are the entire open source ecosystem. We are iBooker, a large open-source community,... -
7
ARACNe-AP
Network Reverse Engineering through AP inference of Mutual Information
ARACNe-AP (Algorithm for the Reconstruction of Accurate Cellular Networks with Adaptive Partitioning) is a complete overhaul of the first ARACNe implementation, originally published by Margolin and colleagues in BMC Bioinformatics in 2006. -
8
TEACUP
TCP Experiment Automation Controlled Using Python
... congestion control algorithm), an experiment is made up of multiple tests. For each experiment and test, TEACUP collects a range of data, such as tcpdump files of traffic seen or TCP stack information (e.g. using Web10G). TEACUP also collects a variety of metadata from the end hosts and bottleneck router, such as the actual OS/kernel version(s) used. TEACUP also provides some simple tools for analysing the results of experiments, such as plotting a flow's experienced RTT over time. -
9
-
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights. Click to perfect your product now.
-
10
mdoptcli
Multidimensional Optimizer for Command Line
This program is a command-line interface to several multi-dimensional optimization algorithms coded in the *GNU Scientific Library -- GSL*. Namely the *Simplex* algorithm, which does not need a gradient, and from the gradient-based algorithms the *Conjugate Gradient -- CG* and the *Broyden-Fletcher-Goldfarb-Shanno -- BFGS* methods. The energy (and possibly energy gradient) is evaluated by a given command, which has to accept coordinates on standard input and returns the appropriate... -
11
WJN
WJN Crypto Currency | عملة وجن المشفرة
الإصدار الأول لعملة وجن المشفرة مفتوح المصدر First Edition of WJN Crypto Currency Open-Source Windows Wallet | Linux Wallet | Linux Daemon | Sourcode -
12
ALEPH-w
Data structures and Algorithms library
... that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w. Their performance is better than GNU implementation -
13
An Eclipse based implementation of a modified RC4 algorithm. The code base for the following research papers: https://pdfs.semanticscholar.org/8544/534788eefe3b2169892ede5320bdee8f6a3c.pdf http://ieeexplore.ieee.org/abstract/document/6731957/?reload=true
-
14
The main purpose of CombiTagger is to read files generated by individual PoS taggers and use them to develop and evaluate combined taggers according to a given combination algorithm. http://aaai.org/ocs/index.php/FLAIRS/2009/paper/download/67/296
-
15
Implementation of RC4 Algorithm to be executed in parallel threads using Java's standard libraries for parallel executions. Wanted to check the performance of RC4 in different hardware platforms. This is the code base related to the following research paper: http://www.ijcaonline.org/archives/volume60/number16/9780-4424
-
16
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
17
DGRLVQ
Dynamic Generalized Relevance Learning Vector Quantization
Some of the usual problems for Learning vector quantization (LVQ) based methods are that one cannot optimally guess about the number of prototypes required for initialization for multimodal data structures i.e.these algorithms are very sensitive to initialization of prototypes and one has to pre define the optimal number of prototypes before running the algorithm. If a prototype, for some reasons, is ‘outside’ the cluster which it should represent and if there are points of a different... -
18
GreMod
GreMod: Real-time Incremental Community Detection
This is the source code of the paper: Shang, Jiaxing, Lianchen Liu, Feng Xie, Zhen Chen, Jiajia Miao, Xuelin Fang, and Cheng Wu. "A real-time detecting algorithm for tracking community structure of dynamic networks." In 6th SNA-KDD Workshop, 2012. Anyone using this code please cite this paper. -
19
ParaCrypt
more convenient one-time-pad encryption.
ParaCrypt is software for encrypting and decrypting data with one-time-pads. For convenience the one-time-encryption-pads are created using pre-shared unencrypted files as sources of entropy. -
20
JPIV
Particle Image Velocimetry
JPIV is a platform independent, graphical stand-alone application for Particle Image Velocimetry (PIV) written in Java. PIV is an optical technique for measuring fluid flow velocities. JPIV moved to GitHub. Please visit us at: https://eguvep.github.io/jpiv/ -
21
casync
Content-addressable data synchronization tool
A combination of the rsync algorithm and content-addressable storage. An efficient way to store and retrieve multiple related versions of large file systems or directory trees. An efficient way to deliver and update OS, VM, IoT and container images over the Internet in an HTTP and CDN friendly way. Let's take a large linear data stream, split it into variable-sized chunks (the size of each being a function of the chunk's contents), and store these chunks in individual, compressed files in some... -
22
Graphical representation for the 3D BIN PACKING problem using the algorithm (http://www.diku.dk/~pisinger/codes.html). Optimizes the volume of rectangular cubes inside a rectangular containers Displays the result in 3d graphics. Can be used on this website: http://www.3dbinbox.com
-
23
C API for determining LDrawDir and SearchDirs from settings found in the various combinations of ldraw.ini, LDRAWDIR etc. LDraw programs will then share the same algorithm and thus find parts and primitives consistently.
-
24
PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.
-
25
GMcloser
Closing the gaps in scaffolds with preassembled contigs
GMcloser fills and closes the gaps present in scaffold assemblies, especially those generated by the de novo assembly of whole genomes with next-generation sequencing (NGS) reads. Unlike other gap-closing tools that use only NGS reads, GMcloser uses preassembled contig sets or long read sets as the sequences to close gaps and uses paired-end (PE) reads and a likelihood-based algorithm to improve the accuracy and efficiency of gap closure. The efficiency of gap closure can be increased...
