A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Filters
Simplex Queues for Hot-Data Download
2017
Performance Evaluation Review
Data download from these systems involves multiple fork-join queues operating in-parallel, making the analysis of access time a very challenging problem. ...
Speci cally, using a queueing theoretic approach, we derive bounds and approximations on the average response time for two di erent Poisson request arrival models. ...
EXPECTED HOT-DATA DOWNLOAD TIME We are interested in analyzing how the availability provided by the simplex setup a ects the download time of hot-data. ...
doi:10.1145/3143314.3078553
fatcat:hw4zaolfqnbn3oijperycijhma
Simplex Queues for Hot-Data Download
[article]
2018
arXiv
pre-print
, and the last one employs storage availability only for hot data download without incurring any negative impact on the cold data download. ...
Data download from these systems involves multiple fork-join queues operating in-parallel, making the analysis of access time a very challenging problem. ...
for faster hot data download. ...
arXiv:1804.06489v1
fatcat:ogt7qifwvzanhbypik3hmyotxe
Service Rate Region: A New Aspect of Coded Distributed System Design
[article]
2021
arXiv
pre-print
As contributions along the first thread, we characterize the rate regions of maximum-distance-separable, locally repairable, and Simplex codes. ...
This work shows that erasure coding of data objects can flexibly handle skews in the request rates. ...
In the hot data download context, heterogeneity arises when one of the data objects is highly popular. ...
arXiv:2009.01598v2
fatcat:6kpn43dkmfcpdhmcj2qovkzzf4
Download Time Analysis for Distributed Storage Codes with Locality and Availability
[article]
2021
arXiv
pre-print
These codes provide access to hot data through the systematic server containing the object and multiple recovery groups. ...
Accordingly, we present upper and lower bounds on the download time, and an M/G/1 queue approximation for several cases of interest. ...
First, we are concerned with downloading individual objects, motivated by hot data download. ...
arXiv:1912.09765v4
fatcat:2vukmdio55alvoird5sdfky6ay
This simulation framework will be available in the public domain for free download. ...
On the other hand, with the queue-examination strategy, Triple-A counts the number of stalled requests for each FIMM when the queue has no more room for accepting incoming I/O requests. ...
doi:10.1145/2541940.2541953
dblp:conf/asplos/JungCSK14
fatcat:kzum4vnamfa4nfvck5t2jya7yq
DeepFun: a deep learning sequence-based model to decipher non-coding variant effect in a tissue- and cell type-specific manner
2021
Nucleic Acids Research
The funders had no role in the study design, data collection and analysis, decision to publish or preparation of the manuscript. ...
ACKNOWLEDGEMENTS The authors thank the members of Bioinformatics and Systems Medicine Laboratory (BSML) and Dr David R Kelley at Calico Life Sciences for insightful discussion. ...
PHP was also used as an auxiliary function for data display. ...
doi:10.1093/nar/gkab429
pmid:34048560
fatcat:hbavfmg5sjcxxkvpl3udpdwqwq
Optimum catalyst selection over continuous and discrete process variables with a single droplet microfluidic reaction platform
2018
Reaction Chemistry & Engineering
Acknowledgements We thank the Novartis Center for Continuous Manufacturing for funding this research. ...
We thank Hsiao-Wu Hsieh at Novartis (NIBR) for analytical chemistry support and Yiming Wang at the Buchwald Research Group at MIT for the catalyst synthesis. C. W. ...
Downloaded on 5/3/2019 4:28:37 AM. ...
doi:10.1039/c8re00032h
fatcat:qmcwcub57fddxjucmwpbrtocry
Efficient Globally Optimal Consensus Maximisation with Tree Search
2017
IEEE Transactions on Pattern Analysis and Machine Intelligence
Maximum consensus is one of the most popular criteria for robust estimation in computer vision. ...
Our work identifies a promising solution for globally optimal consensus maximisation 1 . ...
This is defined as the following for the various methods: • RANSAC: Number of trials before termination. • MaxFS: Number of simplex iterations as reported in the Gurobi output. Table 2 . ...
doi:10.1109/tpami.2016.2631531
pmid:27893383
fatcat:duwpvgue4fakpgmwxibtoqdoqy
Efficient globally optimal consensus maximisation with tree search
2015
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Maximum consensus is one of the most popular criteria for robust estimation in computer vision. ...
Our work identifies a promising solution for globally optimal consensus maximisation 1 . ...
This is defined as the following for the various methods: • RANSAC: Number of trials before termination. • MaxFS: Number of simplex iterations as reported in the Gurobi output. Table 2 . ...
doi:10.1109/cvpr.2015.7298855
dblp:conf/cvpr/ChinPES15
fatcat:j45h3h46jbcmpjgbrylh63jhq4
BINSYN: A Publicly Available Program for Simulating Spectra and Light Curves of Binary Systems with or without Accretion Disks
2012
Publications of the Astronomical Society of the Pacific
The BINSYN program suite, a collection of programs for analysis of binary star systems with or without an optically thick accretion disk, is available for download from a wiki. ...
The package generates synthetic light curves and determines an optimized solution for system parameters. ...
Although the simplex method was introduced in two articles ), a preference for differential corrections was explained in Linnell (1989) . ...
doi:10.1086/667217
fatcat:zpuw5je6bvhijlf25b4fqutuna
Backward Chaining
[chapter]
2013
Encyclopedia of Operations Research and Management Science
Applications include the use of data-driven models to measure the operating efficiency of bank branches through data envelopment analysis, the use of image recognition techniques for check processing, ...
At any given point in time, vector (r S 0t ) can be obtained using market data; this is the current term structure scenario. However, the temporal variation of the term structure is stochastic. ...
As shown, the input data come from a variety of systems into the data warehouse. The specific data needed for BI is downloaded to a data mart used by planners and executives. ...
doi:10.1007/978-1-4419-1153-7_200968
fatcat:wsdsqf2wxrckvpoq4yh5f7rsqm
Autonomous hazardous waste drum inspection vehicle
1995
IEEE robotics & automation magazine
This device, based in part on a prototype for a wheeled Mars rover, includes five mission sensing subsystems, a relational site data base, a "partially ordered" scheduler/executive, omnidirectional wheels ...
Federal regulations require that stored drums be inspected periodically for degradation and to verify inventories. Currently, these waste storage facilities are being inspected manually. ...
This library provides standard function calls for establishing a server, opening a connection, reading data, writing data, and testing for the availability of data. ...
doi:10.1109/100.388296
fatcat:3o5lyenxhfcaddchcbj6zdaxxy
Using Topological Data Analysis (TDA) and Persistent Homology to Analyze the Stock Markets in Singapore and Taiwan
2021
Frontiers in Physics
in stock markets, to work with faces (2-simplex) or any k-dim simplex in TDA. ...
We first explain signatures that can be detected using TDA, for three toy models of topological changes. ...
AUTHOR CONTRIBUTIONS SC and PT-WY conceived the study, PT-WY collected the data, SC and PT-WY analyzed the data and interpreted the results, SC and PT-WY wrote and reviewed the manuscript. ...
doi:10.3389/fphy.2021.572216
doaj:c4390a85eadb4d48bfde18073da56be1
fatcat:3unqevdk7jf4xktjh65d6uyaaa
Automated Docking Screens: A Feasibility Study
2009
Journal of Medicinal Chemistry
Molecular docking is the most practical approach to leverage protein structure for ligand discovery, but the technique retains important liabilities that make it challenging to deploy on a large scale. ...
Second, "hot spots" for docking must be identified for a wide range of binding site sizes and shapes. ...
All targets could be handled by the parser and submitted to the DOCK Blaster queue. ...
doi:10.1021/jm9006966
pmid:19719084
pmcid:PMC2745826
fatcat:clnp7u5htbczvnr65u7jq6ur6q
High-performance network and channel-based storage
1992
Proceedings of the IEEE
Our summary, conclusions, and suggestions for future research are found in Section 6. ...
Disk arrays maintain the high capacity of the storage system, while enormously increasing the system's disk actuators and thus the aggregate I/O and data rate. ...
this paper was supported by the Defense Advanced Research Projects Agency and the National Aeronautics and Space Administration under contract NAG2-591, "Diskless Supercomputers: High Performance I/O for ...
doi:10.1109/5.158597
fatcat:jm7thtxk6bfoxiyckb3s3h7cre
« Previous
Showing results 1 — 15 out of 105 results