Search results for "A* algorithm"
showing 10 items of 2538 documents
Overview of ghost correction for HDR video stream generation
2015
International audience; Most digital cameras use low dynamic range image sensors, these LDR sensors can capture only a limited luminance dynamic range of the scene[1], to about two orders of magnitude (about 256 to 1024 levels). However, the dynamic range of real-world scenes varies over several orders of magnitude (10.000 levels). To overcome this limitation, several methods exist for creating high dynamic range (HDR) image (expensive method uses dedicated HDR image sensor and low-cost solutions using a conventional LDR image sensor). Large number of low-cost solutions applies a temporal exposure bracketing. The HDR image may be constructed with a HDR standard method (an additional step ca…
Voltage source inverters: An easy approach for fast fault detection
2013
Fault-tolerant converters have been widely investigated for years and nowadays an extensive technical literature on this field exists. This paper presents a novel fault detection algorithm based on a simple geometrical approach. In the algorithm analysis both the case of faults in single device and the loss of an entire inverter leg have been considered. The proposed methodology is characterized by simplicity, low computational and implementation effort with a consequent fast execution and easy control integration. The suggested algorithm is verified by means of experimental tests and reveals a valid and suitable alternative to the existing state of the art in the field of inverter fault de…
Remarks on strange-quark simulations with Wilson fermions
2020
Physical review / D 102(7), 074506 (1-10) (2020). doi:10.1103/PhysRevD.102.074506
NASH EVOLUTIONARY ALGORITHMS: TESTING PROBLEM SIZE IN RECONSTRUCTION PROBLEMS IN FRAME STRUCTURES
2016
The use of evolutionary algorithms has been enhanced in recent years for solving real engineering problems, where the requirements of intense computational calculations are needed, especially when computational engineering simulations are involved (use of finite element method, boundary element method, etc). The coupling of game-theory concepts in evolutionary algorithms has been a recent line of research which could enhance the efficiency of the optimum design procedure and the quality of the design solutions achieved. They have been applied in several fields of engineering and sciences, mainly, in aeronautical and structural engineering (e.g: in computational fluid dynamics and solid mech…
Characterizing and Quantifying Frustration in Quantum Many-Body Systems
2011
We present a general scheme for the study of frustration in quantum systems. We introduce a universal measure of frustration for arbitrary quantum systems and we relate it to a class of entanglement monotones via an exact inequality. If all the (pure) ground states of a given Hamiltonian saturate the inequality, then the system is said to be inequality saturating. We introduce sufficient conditions for a quantum spin system to be inequality saturating and confirm them with extensive numerical tests. These conditions provide a generalization to the quantum domain of the Toulouse criteria for classical frustration-free systems. The models satisfying these conditions can be reasonably identifi…
Estimating finite mixtures of semi-Markov chains: an application to the segmentation of temporal sensory data
2019
Summary In food science, it is of great interest to obtain information about the temporal perception of aliments to create new products, to modify existing products or more generally to understand the mechanisms of perception. Temporal dominance of sensations is a technique to measure temporal perception which consists in choosing sequentially attributes describing a food product over tasting. This work introduces new statistical models based on finite mixtures of semi-Markov chains to describe data collected with the temporal dominance of sensations protocol, allowing different temporal perceptions for a same product within a population. The identifiability of the parameters of such mixtur…
Algorithme pour la résolution des systèmes flous
1978
Sanchez formulated conditions and theoretical methods to resolve fuzzy relations. The purpose of this study is to give an algorithm which would actual- ly enable us to determine the functions of appartenance of unknown relations.
Distributed n-player approachability via time and space average consensus
2012
Abstract In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the reward vector. The common time-averaged reward vector has to approach a suitable constraint set, called core of the game, that guarantees that no agents benefit from quitting the grand coalition. We propose a doubly (over time and space) averaging distributed algorithm. At every iteration, eac…
Distributed $n$-player approachability and consensus in coalitional games
2015
We study a distributed allocation process where, at each time, every player: i) proposes a new bid based on the average utilities produced up to that time, ii) adjusts such allocations based on the inputs received from its neighbors, and iii) generates and allocates new utilities. The average allocations evolve according to a doubly (over time and space) averaging algorithm. We study conditions under which the average allocations reach consensus to any point within a predefined target set even in the presence of adversarial disturbances. Motivations arise in the context of coalitional games with transferable utilities (TU) where the target set is any set of allocations that makes the grand …
Estimation of sparse generalized linear models: the dglars package
2013
dglars is a public available R package that implements the method proposed in Augugliaro, Mineo and Wit (2013) developed to study the sparse structure of a generalized linear model. This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method (LARS). The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve; specifically a predictor-corrector algorithm and a cyclic coordinate descent algorithm.