Search results for "algorithm"
showing 10 items of 4887 documents
Remarks on strange-quark simulations with Wilson fermions
2020
Physical review / D 102(7), 074506 (1-10) (2020). doi:10.1103/PhysRevD.102.074506
Two-step cross correlation-based algorithm for motion estimation applied to fertilizer granules' motion during centrifugal spreading
2011
Imaging systems are progressing in both accuracy and ro- bustness, and their use in precision agriculture is increasing accordingly. One application of imaging systems is to understand and control the cen- trifugal fertilizing spreading process. Predicting the spreading pattern on the ground relies on an estimation of the trajectories and velocities of ejected granules. The algorithms proposed to date have shown low ac- curacy, with an error rate of a few pixels. But a more accurate estimation of the motion of the granules can be achieved. Our new two-step cross- correlation-based algorithm is based on the technique used in particle image velocimetry (PIV), which has yielded highly accurate…
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…
Observation of the rare B(s)(0) + decay from the combined analysis of CMS and LHCb data.
2015
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported licence.-- et al.
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…
MATHEMATICS IN THE CONTEXT OF FUZZY SETS: BASIC IDEAS, CONCEPTS, AND SOME REMARKS ON THE HISTORY AND RECENT TRENDS OF DEVELOPMENT
2011
The main aim of this paper is to discuss the basic ideas and concepts of the so called ‘Fuzzy Mathematics’ and to give a brief survey of the history and of some trends in recent development of mathematics and its applications in the context of fuzzy sets. As a potential reader we imagine a mathematician, who is not working in the field of ‘fuzzy mathematics’, but wishes to have some idea about this vast field in modern science.
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 …