Search Results for "data collection algorithm" - Page 39
Sort By:
Showing 1337 open source projects for "data collection algorithm"
View related business solutions-
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.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
SeaPerch ROV Data Collection
A set of programs for PC and Arduino to collect data from sensors
A set of programs for PC and Arduino to collect data from a Vernier Dissolved Oxygen Sensor (DO-BTA) and temperature sensing with a 10k Thermistor. -
2
Example code for fat16, iso9660 and ext2, its characteristic is simple, we only focus on how the file system data is maintained on hard drive.
-
3
DNAcompact
Genome compression algorithm with/without reference (Linux/Windows)
As the technique of acquiring genome sequences advances, the storage and data transferring of large genome data are becoming important concerns for biomedical researchers. We propose a two pass genome compression algorithm, which highlights the synthesis of complementary contextual models and the introduction of logistic regression mixture method, to improve the compression performance. The proposed framework handles genome compression with and without reference seque- nces, and demonstrated performance advantage over the best existing algorithms. ... -
4
HTML transforms
Collection of HTML-transforming filters
The HTML transforms project is a library of streaming filters that transform HTML, and can be combined into a pipeline. -
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
5
GestureDetect
Gesture detection with Kinect+OpenNI+Unity3D
...The usage and algorithm introduction are also provided. Try it and have fun! -
6
-
7
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.
-
8
rmisockfactory
Collection of RMI Socket Factories
This project contains a collection of RMI socket factories -- for instance gzip-encoded data sent over the wire, NIO-based communication etc. -
9
LAVA for AFM
Lloyd's Algorithm-based Volumetric Analysis for AFM Images
This MATLAB-based program enables analysis of AFM images. In particular, it allows the user to measure the volume of all distinguishable features in an image and to isolate and sort those particles. As the name implies, LAVA uses Lloyd's Algorithm, also known as k-means sorting, to identify a small set of volumes representative of the actual distribution of particle in the image. Although developed for determining feature volume, LAVA is also completely compatible with other types of... -
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.
-
10
CogPy
Cognitive Python
...A few of its main features are: - A full-featured 2D display library for rapid development - Full control of computer I/O (display, mouse, keyboard, gamepad, joystick, audio) - Advanced library of data collection techniques - Data export to NumPy/SciPy, R, MATLAB, and Microsoft Excel - Compatibility with PyACT-R for cognitive modeling If you are interested in contributing to the CogPy project, contact the lead developer, Jasper Danielson, at jrd4@rice.edu. -
11
Java/C Comparative Benchmarks
Java and C Comparative Performance Benchmarks
A collection of software benchmarks developed to compare the performance of Java with C on identical code. No language libraries were used to avoid implementation differences. Some of the benchmarks are also implemented in Python and Scala. There are benchmarks for bit twiddling, numerical computing, data structure manipulation, concurrent computing, callouts to native libraries, and, graphics processing units (GPU) utilization. -
12
-
13
ReDBox is a metadata registry application for describing research data. The open source solution is developed and supported by the Queensland Cyber Infrastructure Foundation (QCIF). As part of the ANDS-funded Metadata Stores Project, the University of South Australia has developed a number of customisations to enhance this system.
-
14
qlsdup
GUI based lightweight duplicate file finder / remover.
Simple GUI based lightweight duplicate file finder and remover. Configurable file search and preview (via external tools) option for file data. No command-line interface available! This is basically a reimplementation of dupfinder as: it doesn't compile on my computer, the executable won't work either, the projects seems dead and I didn't wanna work through the original code. So Look'n'Feel should be somewhat the same, though some changes have been made. Algorithm is simple and suitable for large file sets with few differences: basic set of duplicate candidates is determined by file size, then candidates are compared byte-wise. ... -
15
VOC-DPM
Object detection system using deformable part models (DPMs)
...It implements both latent SVM training (where part assignments are treated as latent variables) and weak-label structural SVM (WL-SSVM) for learning from partially labeled data. The code integrates several enhancements: a star-cascade detection algorithm to speed up screening, context rescoring (re-ranking detections using contextual information), and various optimizations like in-memory training (rather than large on-disk data files). -
16
Simple CGI script which allows you to transfer sensitive ascii data (passwords, hashes, pem keys) via HTTPS. SSL MUST BE implemented by webserver. Algorithm: - Paste new data into textarea, submit. You get link Link consists of three md5 hashes from salt. File, containing your data, named that way. So, it is hard to bruteforce links/files. - Whenever link being opened, script reads file and prints its content into brower in text/plain content-type. ...
-
17
RCFPD
Random Collection of Functions for Proteomics Data Analysis
An R package for distribution of data analysis functionality used by the Proteomics Core at Weill Cornell Medical College in Qatar. -
18
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. -
19
MDSTk is a collection of 2D/3D image processing tools aimed at medical images. It contains routines for volume data processing (3D filtering, segmentation, etc.) as well as fast low-level vector graphics library for surface and tetrahedral meshing. MDSTk has been forked by 3Dim Laboratory s.r.o. to provide better support and further push its development forward.
-
20
OpenERP Java Report Helper
A Java library to facilitate writing OpenERP reports using Java tools
This library hopes to provide a helper class to be used by any Java based reporting tool like Jasper/Pentaho. The library provides a Java Swing user interface for data source configuration and a data interface for data collection. A Java report client needs to control the workflow and persistence of the configuration information while the library will handle data source configuration and data collection. -
21
QuasiRecomb
Probabilistic inference of viral Quasispecies
...We present a jumping hidden Markov model that describes the generation of the viral quasispecies and a method to infer its parameters by analysing next generation sequencing data. We offer an implementation of the EM algorithm to find maximum a posteriori estimates of the model parameters and a method to estimate the distribution of viral strains in the quasispecies. The model is validated on simulated data, showing the advantage of explicitly taking the recombination process into account, and tested by applying to reads obtained from experimental HIV samples. -
22
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. ... -
23
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. -
24
-
25
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. ...