Search results for "Speedup"
showing 10 items of 97 documents
Accelerating short read mapping on an FPGA (abstract only)
2012
The explosive growth of short read datasets produced by high throughput DNA sequencing technologies poses a challenge to the mapping of short reads to a reference genome in terms of sensitivity and execution speed. Existing methods often use a restrictive error model for computing the alignments to improve speed, whereas more flexible error models are generally too slow for large-scale applications. Although a number of short read mapping software tools have been proposed, designs based on hardware are relatively rare. In this paper, we present a hybrid system for short read mapping utilizing both software and field programmable gate array (FPGA)-based hardware. The compute intensive semi-g…
A naïve approach to speed up portfolio optimization problem using a multiobjective genetic algorithm
2012
a b s t r a c t Genetic algorithms (GAs) are appropriate when investors have the objective of obtaining mean-variance (VaR) efficient frontier as minimising VaR leads to non-convex and non-differential risk-return optimisation problems. However GAs are a time-consuming optimisation technique. In this paper, we propose to use a naive approach consisting of using samples split by quartile of risk to obtain complete efficient frontiers in a reasonable computation time. Our results show that using reduced problems which only consider a quartile of the assets allow us to explore the efficient frontier for a large range of risk values. In particular, the third quartile allows us to obtain efficie…
Hybrid Procedure for Automated Detection of Cracking with 3D Pavement Data
2016
Pavement cracks are considered a major indicator of pavement performance. Because traditional manual crack surveys are dangerous, time consuming, and expensive, technologies have been developed to collect high-speed pavement images, and numerous algorithms have been proposed to detect cracks on pavement surface. The latest PaveVision3D Ultra system (3D Ultra) has been implemented to achieve 30-kHz three-dimensional (3D) scanning rate for 1-mm resolution pavement surface data at highway speed up to 100 km/h (60 mi/h). This paper presents the application of a hybrid procedure for automated crack detection on 3D pavement data collected using 3D Ultra. The procedure combines three different me…
A Bayesian Network Model for Fire Assessment and Prediction
2015
Smartphones and other wearable computers with modern sensor technologies are becoming more advanced and widespread. This paper proposes exploiting those devices to help the firefighting operation. It introduces a Bayesian network model that infers the state of the fire and predicts its future development based on smartphone sensor data gathered within the fire area. The model provides a prediction accuracy of 84.79i¾?% and an area under the curve of 0.83. This solution had also been tested in the context of a fire drill and proved to help firefighters assess the fire situation and speed up their work.
Modeling the Mechanical Behavior of the Breast Tissues Under Compression in Real Time
2017
This work presents a data-driven model to simulate the mechanical behavior of the breast tissues in real time. The aim of this model is to speed up some multimodal registration algorithms, as well as some image-guided interventions. Ten virtual breast phantoms were used in this work. Their deformation during a mammography was performed off-line using the finite element method. Three machine learning models were trained with the data from those simulations. Then, they were used to predict the deformation of the breast tissues. The models were a decision tree and two ensemble methods (extremely randomized trees and random forest). Four experiments were designed to assess the performance of th…
Real-time computation of parameter fitting and image reconstruction using graphical processing units
2016
Abstract In recent years graphical processing units (GPUs) have become a powerful tool in scientific computing. Their potential to speed up highly parallel applications brings the power of high performance computing to a wider range of users. However, programming these devices and integrating their use in existing applications is still a challenging task. In this paper we examined the potential of GPUs for two different applications. The first application, created at Paul Scherrer Institut (PSI), is used for parameter fitting during data analysis of μ SR (muon spin rotation, relaxation and resonance) experiments. The second application, developed at ETH, is used for PET (Positron Emission T…
Quadratic speedup for finding marked vertices by quantum walks
2020
A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004). However, quantum algorithms that actually find a marked element quadratically faster than a classical random walk were only known for the special case when the marked set consists of just a single vertex, or in the case of some specific graphs. We present a new quantum algorithm for finding a marked vertex in any graph, with any set of marked vertices, that is (up to a log factor) quadratically faster than the corresponding classical random walk.
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
2017
We study quantum algorithms on search trees of unknown structure, in a model where the tree can be discovered by local exploration. That is, we are given the root of the tree and access to a black box which, given a vertex $v$, outputs the children of $v$. We construct a quantum algorithm which, given such access to a search tree of depth at most $n$, estimates the size of the tree $T$ within a factor of $1\pm \delta$ in $\tilde{O}(\sqrt{nT})$ steps. More generally, the same algorithm can be used to estimate size of directed acyclic graphs (DAGs) in a similar model. We then show two applications of this result: a) We show how to transform a classical backtracking search algorithm which exam…
Parallel macro pipelining on the intel SCC many-core computer
2013
In this paper we present how Intel's Single-Chip-Cloud processor behaves for parallel macro pipeline applications. Subsets of the SCC's available cores can be arranged as a pipeline where each core processes one stage of the overall workload. Each of the independent cores processes a small part of a larger task and feeds the following core with new data after it finishes its work. Our case-study is a parallel rendering system which renders successive images and applies different filters on them. On normal graphics adapters this is usually done in multiple cycles, we do this in a single pipeline pass. We show that we can achieve a significant speedup by using multiple parallel pipelines on t…
Numerical Multi-Loop Calculations via Finite Integrals and One-Mass EW-QCD Drell-Yan Master Integrals
2017
We study a recently-proposed approach to the numerical evaluation of multi-loop Feynman integrals using available sector decomposition programs. As our main example, we consider the two-loop integrals for the $\alpha \alpha_s$ corrections to Drell-Yan lepton production with up to one massive vector boson in physical kinematics. As a reference, we evaluate these planar and non-planar integrals by the method of differential equations through to weight five. Choosing a basis of finite integrals for the numerical evaluation with SecDec3 leads to tremendous performance improvements and renders the otherwise problematic seven-line topologies numerically accessible. As another example, basis integ…