Search Results for "data collection algorithm" - Page 8
Sort By:
Showing 349 open source projects for "data collection algorithm"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
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
Sharp Statistics
A simple program for comparing data sets with simple algorithms.
Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other. -
2
GPU Edge Detector
GPU Interactive Program For Edge detection
This is a standalone, all in one Edge Detector that is mainly running on GPU using the CUDA technology. Each algorithm also has an OpenCV counterpart which is the closest one in terms of speed. This project is partly based on the Sobel Filter sample available as part of the CUDA SDK. This project also partly uses the OpenCV library to load different types of image. This program includes: Prewitt filter, Roberts Cross, Canny edge detector and finally Sobel filter with the ability to modify... -
3
hrefinder
Detection of homologous recombination events from SNP data
This software detects homologous recombination events (HREs) from SNP data. Based on SNP alleles calls and locations, it breaks the genomes into locally colinear blocks, and looks for cases where SNPs do not agree with the vertical pattern of inheritance in a phylogeny. It applies a dynamic programming algorithm to model whether changes within a block are likely a result of mutations, sequencing errors, or HRE. -
4
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
LTS (Learning to Search) is an implementation of an algorithm described in "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown traits. ... -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
dbtesma
efficient data generation for benchmarks and performance analysis
Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies. -
6
-
7
GenNon-h
Simulating non-homogeneous multiple sequence alignments
...On the other hand, methods of simulating the DNA MSA directly from the transition matrices do not exist. Moreover, existing software restricts to the time-reversible models and it is not optimized to generate nonhomogeneous data (i.e. placing distinct substitution rates at different lineages). GenNon-H is the first package designed to generate multiple sequence alignments under the discrete-time Markov processes on phylogenetic trees, which samples directly from the transition matrices. Based on the input model and a phylogenetic tree in the Newick format (with branch lengths measured as the expected number of substitutions per site), the algorithm produces DNA alignments of desired length. ... -
8
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
9
DeNovoCheck
DeNovoCheck: Inheritance analysis for NGS trio data
DeNovoCheck is intended to be used for inheritance analysis in NGS tio data. For rare dominant Mendelian diseases, patient-parent trios are often used to reduce the number of candidate variants. The algorithm bases the inheritance prediction on the data available in the parental BAM files and allows for a fast and reliable selection of potential de novo variants. -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
tool collection for communication with GPS devices via GARMIN protocol. A graphical frontend for visualization of all gps-data and remote control of the GPS receiver is included. GPS-Earth also uses undocumented features that might or might not work wit
-
11
The Prajna project is a collection of tools and utility classes combining visualization, geographic displays, data fusion, and semantic reasoning into a cohesive toolkit for enhancing information discovery and reasoning.
-
12
Mix
Mix is a tool to combine multiple assemblies from NGS data.
Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the... -
13
NaRIBaS
Unix-based preparation and analysis toolbox for molecular simulations
...Task specific input and preparation or analysis function, are easy expandable to meet the scientific characteristic of constant changing properties. Concepts for efficiently storing and analysing large files in conjunction with graphical visualization and numerical data processing are presented in a Manual. A documented script collection that allows reproducing all simulations and analysis results presented in the Doctoral thesis of the author. -
14
segment
Solve the Viterbi algorithm in a data stream
It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data. -
15
Robust Correlation Toolbox
Free Matlab toolbox to compute robust correlations
The Robust Correlation Toolbox is a free collection of Matlab functions allowing to visualize data in univariate and bivariate space, check assumptions of normality and homoscedasticity and compute Pearson's and Spearman's, percentage bend, and skipped correlations with bootstrapped confidence intervals - see http://www.frontiersin.org/Quantitative_Psychology_and_Measurement/10.3389/fpsyg.2012.00606/full -- code moved to https://github.com/CPernet/robustcorrtool -
16
GIIAF Microscopy Library
The GIIAF Microscopy Library, that uses customised OMERO software
This project incorporates a suite of tools that aim to allow researchers within Griffith's Imaging and Image Analysis Facility (GIIAF) to efficiently and effectively provide secure, centralised, web-accessible data storage, management and manipulation. The open-source Java-based OMERO software was customised to provide most of the features of this project. -
17
-
18
smooth
Wavelet smoothing in a data stream
It is often necessary to smooth high frequency fluctuations out of data streams sequenced by time, position, etc. The 'smooth' utility applies such smoothing using the wavelet algorithm. This implementation of wavelet smoothing was optimized for use in a data stream. It was adapted from HMMSeg Wavelet.Java by Thomas E. Wilson, University of Michigan. HMMSeg Wavelet.Java was written by Andrew Hemmaplardh, University of Washington. -
19
MCC-LIDAR
Multiscale Curvature Classification for LIDAR Data
MCC-LIDAR is a C++ application for processing LiDAR data in forested environments. It classifies data points as ground or non-ground using the Multiscale Curvature Classification algorithm. -
20
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
TreeLiker is a collection of fast algorithms for working with complex structured data in relational form. The data can, for example, describe large organic molecules such as proteins or groups of individuals such as social networks or predator-prey networks etc. The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem exists, it will be found. ... -
21
Tcl binding to levmar library implementing Levenberg-Marquardt optimization algorithm often used in data fitting. Levmartcl is a standard Tcl extension providing command interface to levmar functionality. This library is only a wrapper of <levmar> which actually performs the work. See the <levmar> home site for details: http://www.ics.forth.gr/~lourakis/levmar/
-
22
Darwin 2: Java Framework for Evolutionary Computation (genetic algorithm, GA). A true framework with out-of-the-box functionality and extensibility of all classes. Interface-based pattern with dependency-injection to configure components.
-
23
Clusterfit
Show stellar evolution and open clusters in a color-magnitude diagram
...It can show animated evolutionary tracks of stars of different masses, for a single star or a population of stars. In addition, it can show the CMD of a large number of existing open clusters, based on scientific survey data, and overlay isochrones (the curve in a CMD from stars born at the same time) to determine the age, distance and interstellar reddening of the cluster. Determining these parameters can be done automatically with a global search algorithm (more specifically a genetic algorithm). This program requires the installation of the libfgen package, also available on SourceForge. -
24
Woodland Potential Calculator
Woodland potential calculator GIS presentation application
The Forestry Commission and Natural England commissioned a bespoke data collection and presentation tool for calculating the potential for increasing the extent of tree cover across the north west of England. The data was divided into sub-regions by landscape type using Natural England's Character Area classifications. The potential within each of these Character Areas was then estimated by working groups of local experts who were capable of making reasoned assessments of both the opportunities and constraints to woodland creation. ... -
25
SkyTracer is a desktop software intended for data collection in radioastronomical observations, as well as data collection for other uses. It's interface aims to be rich and easy to use. Data collection can be achieved by one of these devices: PICADC (free Microchip PIC solution developed by me [will make publicly available soon]), MC Measurement Computing (MCC) board or any Sound Card with Line In or Mic input (used for spectral analysis).
