Search results for "Algorithm"
showing 10 items of 4887 documents
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
2022
We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that are faster than classical (randomized or deterministic) counterparts for each of these problems. The quantum algorithms are based on the quantum procedure for comparing two strings of length k in O(k) queries. The first problem is sorting n strings of length k. We show that classical complexity of the problem is Θ(nk) for constant size alphabet, but our quantum algorithm has O˜(nk) complexity. The second one is searching the most frequent string among n …
Improving High Frequency Transformers behavior for DC-DC Converter Used in Electric Vehicles
2018
The paper presents a design procedure for high frequency transformer windings adopted in the DC-DC converter used in electric vehicles. The output of the design procedure is the integration of a 3D printed plastic case in the transformer windings, with the aim to maximize the output power. The proposal design procedure is entirely based on a finite element analysis approach and on a differential evolution algorithm used for the solution of the optimization problem.
Estimating the Number of Changepoints in Segmented Regression Models: Comparative Study and Application
2020
This paper deals with the problem of selecting the number of changepoints in segmented regression models. The aim is to review selection criteria, namely information criteria and hypothesis testing, and to propose a novel application in the context of students' careers in higher education. The performance of the selection criteria is assessed through simulation studies. Furthermore, we investigate the relationship between University students' performance and one of its main determinants, finding out that this relationship is actually broken-line.
Beyond the functional matrix hypothesis: a network null model of human skull growth for the formation of bone articulations.
2014
Craniofacial sutures and synchondroses form the boundaries among bones in the human skull, providing functional, developmental and evolutionary information. Bone articulations in the skull arise due to interactions between genetic regulatory mechanisms and epigenetic factors such as functional matrices (soft tissues and cranial cavities), which mediate bone growth. These matrices are largely acknowledged for their influence on shaping the bones of the skull; however, it is not fully understood to what extent functional matrices mediate the formation of bone articulations. Aiming to identify whether or not functional matrices are key developmental factors guiding the formation of bone articu…
Atypical Phacomatosis Pigmentokeratotica as the Expression of a Mosaic RASopathy With the BRAF-Glu586Lys Mutation
2016
Euclid’s Proof of the Infinitude of Primes: Distorted, Clarified, Made Obsolete, and Confirmed in Modern Mathematics
2014
Published version of an article in the journal: Mathematical Intelligencer. Also available from the publisher at: http://dx.doi.org/10.1007/s00283-014-9506-9
Event reconstruction algorithms for the ATLAS trigger
2007
The ATLAS experiment under construction at CERN is due to begin operation at the end of 2007. The detector will record the results of proton-proton collisions at a centerof- mass energy of 14 TeV. The trigger is a three-tier system designed to identify in real-time potentially interesting events that are then saved for detailed offline analysis. The trigger system will select approximately 200 Hz of potentially interesting events out of the 40 MHz bunch-crossing rate (with 109 interactions per second at the nominal luminosity). Algorithms used in the trigger system to identify different event features of interest will be described, as well as their expected performance in terms of selection…
First hitting time for a diffusion
2021
In this thesis, we focus our attention on the generation of the first exit time or the first passage time for diffusions in a one-dimensional context.In the first chapter, we present already well-known methods in order to generate such random variables. We particularly introduce the WOMS algorithm. This algorithm permits the generation of an approximation of the time needed by the Brownian motion in order to exit from a given interval.In the second and third chapters, we explain how to extend the previous algorithm in order to deal with diffusions strongly linked to the one-dimensional Brownian motion. We first consider the Ornstein-Uhlenbeck process, and then we consider a wide class of di…
Roadmap on digital holography [Invited]
2021
This Roadmap article on digital holography provides an overview of a vast array of research activities in the field of digital holography. The paper consists of a series of 25 sections from the prominent experts in digital holography presenting various aspects of the field on sensing, 3D imaging and displays, virtual and augmented reality, microscopy, cell identification, tomography, label-free live cell imaging, and other applications. Each section represents the vision of its author to describe the significant progress, potential impact, important developments, and challenging issues in the field of digital holography.
On Extremal Cases of the Hopcroft's Algorithm
2010
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different executions that can lead to different sequences of refinements of the set of the states up to the final partition. We find an infinite family of binary automata for which such a process is unique, whatever strategy is chosen. Some recent papers (cf. Berstel and Carton (2004) [3], Castiglione et al. (2008) [6] and Berstel et al. (2009) [1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata associated…