Search Results for "algorithm" - Page 31
Sort By:
Showing 2943 open source projects for "algorithm"
View related business solutions-
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.
-
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
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. -
2
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. -
3
D-Tailor
D-Tailor: automated analysis and design of DNA sequences
...DNA-Tailor (D-Tailor) is a fully extendable software framework for biological sequence analysis and multi-objective sequence design. D-Tailor permits the seamless integration of an arbitrary number of sequence analysis tools into a Monte-Carlo algorithm that evolves synthetic sequences towards user-defined goals. -
4
TextTeaser
TextTeaser is an automatic summarization algorithm
textteaser is an automatic text summarization algorithm implemented in Python. It extracts the most important sentences from an article to generate concise summaries that retain the core meaning of the original text. The algorithm uses features such as sentence length, keyword frequency, and position within the document to determine which sentences are most relevant. By combining these features with a simple scoring mechanism, it produces summaries that are both readable and informative. ... -
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
TEACUP
TCP Experiment Automation Controlled Using Python
...TEACUP utilises a text-based configuration file to define experiments as combinations of parameters specifying desired network path and end host conditions. When multiple values are provided (e.g. for TCP 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. ... -
6
EllipseFitting
Pre-processor for ellipse data to improve ellipse fitting.
...The main contribution of the paper is based on the hypothesis that if the data point set were pre-processed to strategically add additional data points in regions of high eccentricity, then the quality of a fit could be improved. Conditional validity of this hypothesis is demonstrated mathematically using a model scenario. Based on this confirmation we propose an algorithm that pre-processes the data so that data points with high eccentricity are replicated. The improvement of ellipse fitting is then demonstrate -
7
-
8
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 energy (or gradient) on standard output. -
9
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
-
Earn up to 16% annual interest with Nexo.Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
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
-
11
WJN
WJN Crypto Currency | عملة وجن المشفرة
الإصدار الأول لعملة وجن المشفرة مفتوح المصدر First Edition of WJN Crypto Currency Open-Source Windows Wallet | Linux Wallet | Linux Daemon | Sourcode -
12
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. -
13
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
-
14
popt4jlib
Parallel Optimization Library for Java
...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 network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today. -
15
This contains the code used to create the LPP transit metric to evaluate the TCEs found by the Kepler Mission. This code uses the LPP dimensionality reduction algorithm and K-nearest neighbours and a training set of known transits to decide if an unknown TCE looks like a transiting exoplanet.
-
16
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
-
17
Adaptive Search
Adaptive Search is a constraint-based Local Search method.
...For each constraint, an error function needs to be defined: it gives, for each tuple of variable values (i.e., a variable assignment), an indication on how much the constraint is violated. The algorithm also uses a short-term adaptive memory in the spirit of Tabu Search to avoid stagnation in local minima and loops. This archive contains the source code of sequential and parallel versions of the Adaptive Search algorithm and its specialization on several examples. -
18
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. -
19
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 categories in between, then the other points act as a barrier and the prototype will not find its optimum position during training. Since the model complexity is not known in many cases, we avoid this problem by introducing a "Dynamic" version of LVQ. ... -
20
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.
-
21
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/ -
22
Object Oriented Streetmap
C# class library for processing OpenStreetMap data
This is a class library written in C# for processing OpenStreetMap XML file extracts into a SQLite database for routing with different vehicle types and restrictions. Before rating or contributing please see the README file for a more complete summary and a list of todos. -
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
GMcloser
Closing the gaps in scaffolds with preassembled contigs
...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 by successive treatments with different contig sets. An accompanied package, GMvalue, is a tool to determine misassembly sites in contigs and scaffolds. Unlike other related tools, GMvalue can define misassembly categories with several options, and can be applied to assemblies of a large size genome. ... -
25
Cube26
General Purpose A-Z Stream Cipher (C++ implementation)
