Search results for "A* algorithm"
showing 10 items of 2538 documents
Mapping of BLASTP Algorithm onto GPU Clusters
2011
Searching protein sequence database is a fundamental and often repeated task in computational biology and bioinformatics. However, the high computational cost and long runtime of many database scanning algorithms on sequential architectures heavily restrict their applications for large-scale protein databases, such as GenBank. The continuing exponential growth of sequence databases and the high rate of newly generated queries further deteriorate the situation and establish a strong requirement for time-efficient scalable database searching algorithms. In this paper, we demonstrate how GPU clusters, powered by the Compute Unified Device Architecture (CUDA), OpenMP, and MPI parallel programmi…
Increasing GP Computing Power for Free via Desktop GRID Computing and Virtualization
2009
This paper presents how it is possible to increase the Genetic Programming (GP) Computing Power (CP) for free, via Volunteer Computing (VC), using the well known framework BOINC plus a new ``virtualization'' layer which adds all the benefits from the virtualization paradigm. Two different experiments, employing a standard GP tool and a complex GP system, are performed --with distributed PCs over several cities-- to show the free achieved CP by means of VC, without the necessity of modifying or adapting the original GP source code. The methodology can be easily extended to Evolutionary Algorithms (EAs).
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
Delineation of Malignant Skin Tumors by Hyperspectral Imaging
2018
This chapter outlines a new non-invasive method for delineation of skin lesions such as lentigo maligna and lentigo maligna melanoma. The method is based on the analysis of hyperspectral (HS) images taken in vivo before surgical excision of the lesions. For this, characteristic features of the spectral signatures of diseased pixels and healthy pixels are extracted, which combine the intensities in a few selected wavebands with the coefficients of the wavelet frame transforms of the spectral curves. To reduce dimensionality and to reveal the internal structure of the datasets, the diffusion maps (DM) technique is applied. The averaged Nearest Neighbor and the Classification and Regression Tr…
Improved SOM Learning using Simulated Annealing
2007
Self-Organizing Map (SOM) algorithm has been extensively used for analysis and classification problems. For this kind of problems, datasets become more and more large and it is necessary to speed up the SOM learning. In this paper we present an application of the Simulated Annealing (SA) procedure to the SOM learning algorithm. The goal of the algorithm is to obtain fast learning and better performance in terms of matching of input data and regularity of the obtained map. An advantage of the proposed technique is that it preserves the simplicity of the basic algorithm. Several tests, carried out on different large datasets, demonstrate the effectiveness of the proposed algorithm in comparis…
Quantum Machine Learning: A tutorial
2021
This tutorial provides an overview of Quantum Machine Learning (QML), a relatively novel discipline that brings together concepts from Machine Learning (ML), Quantum Computing (QC) and Quantum Information (QI). The great development experienced by QC, partly due to the involvement of giant technological companies as well as the popularity and success of ML have been responsible of making QML one of the main streams for researchers working on fuzzy borders between Physics, Mathematics and Computer Science. A possible, although arguably coarse, classification of QML methods may be based on those approaches that make use of ML in a quantum experimentation environment and those others that take…
Combining split-and-merge and multi-seed region growing algorithms for uterine fibroid segmentation in MRgFUS treatments
2016
Uterine fibroids are benign tumors that can affect female patients during reproductive years. Magnetic resonance-guided focused ultrasound (MRgFUS) represents a noninvasive approach that uses thermal ablation principles to treat symptomatic fibroids. During traditional treatment planning, uterus, fibroids, and surrounding organs at risk must be manually marked on MR images by an operator. After treatment, an operator must segment, again manually, treated areas to evaluate the non-perfused volume (NPV) inside the fibroids. Both pre- and post-treatment procedures are time-consuming and operator-dependent. This paper presents a novel method, based on an advanced direct region detection model, …
Grover’s Search with Faults on Some Marked Elements
2016
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size N using $$O\sqrt{N}$$ queries. It provides a significant speed-up over any classical algorithm [2]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [1, 4]. We study the behavior of Grover's algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in $$O\sqrt{N}$$ queries.
Some efficient algorithms for the solution of a single nonlinear equation
1981
High order methods for the numerical solution of nonlinear scalar equations are proposed which are more efficient than known procedures, and a unified approach to various methods suggested in literature is given.
Strengthened splitting methods for computing resolvents
2021
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually. The key tool in the development of this framework is the notion of the “strengthening” of a set-valued operator, which can be viewed as a type of regularisation that preserves computational tractability. After deriving a number of iterative schemes through this framework, we demonstrate their application to best approximation problems, image denoising and elliptic PDEs. FJAA and RC were partially supported by the Ministry of Science, Innovation and Universities of Spain and the European Regional Development Fund …