Search results for "Algorithm"
showing 10 items of 4887 documents
Active lighting applied to three-dimensional reconstruction of specular metallic surfaces by polarization imaging
2006
International audience; In the field of industrial vision, the three-dimensional inspection of highly reflective metallic objects is still a delicate task. We deal with a new automated three-dimensional inspection system based on polarization analysis. We first present an extension of the shape-from-polarization method for dielectric surfaces to metallic surfaces. Then, we describe what we believe to be a new way of solving the ambiguity concerning the normal orientation with an active lighting system. Finally, applications to shape-defect detection are discussed, and the efficiency of the system to discriminate defects on specular metallic objects made by stamping and polishing is presente…
Enhanced chain dynamics in loop-sorting-systems by means of layout optimization and a kinematic model of the polygon action
2012
Published version of an article in the journal: Structural and Multidisciplinary Optimization. Also available from the publisher at: http://dx.doi.org/10.1007/s00158-011-0743-7 Poor dynamics owing to polygon action is a known concern in mechanical applications of closed articulated chains. In this paper a kinematic model of the polygon action in large chains of loop-sorting-systems is proposed. Through optimization techniques the chain dynamics is improved by minimizing the polygon action using a parametric model of the track layout as design variables. Three formulations of the kinematic polygon action are tested on an average sized planer tracks layout to find a superior model. Verificati…
Probabilistic Evaluation of the Adaptation Time for Structures under Seismic Loads
2016
Abstract In this paper, a probabilistic approach for the evaluation of the adaptation time for elastic perfectly plastic frames is proposed. The considered load history acting on the structure is defined as a suitable combination of quasi-statical loads and seismic actions. The proposed approach utilizes the Monte Carlo method in order to generate a suitable large number of seismic acceleration histories and for each one the related load combination is defined. Furthermore, for each load combination the related adaptation time is determined, if any, as the optimal one for which the structure is able to shakedown under the unamplified applied actions. A known generalized Ceradini's theorem i…
Scheduling under the network of temporo-spatial proximity relationships
2017
We discuss and introduce to the schedulingeld a novel, qualitative optimization model - scheduling under the network of temporo-spatial proximity relationships.We introduce a half perimeter proximity measure as an objective of scheduling.We present and evaluate an incremental Sequence Pair neighborhood evaluation algorithm, applicable to both scheduling and rectangle packing problems in VLSI industry. In this paper, we discuss and introduce to the scheduling field a novel optimization objective - half perimeter proximity measure in scheduling under the network of temporo-spatial proximity relationships. The presented approach enables to qualitatively express various reasons of scheduling ce…
Computing Subdivision Surface Intersection
2003
Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.
A control strategy based on intelligent algorithm (PSO) to perform electrical stimulation systems
2017
International audience; Adjusting stimulation parameters using control strategy based on reliable mathematical model that can predict perfectly the muscle response, may improve the efficiency of Functional Electrical Stimulation (FES) systems. In the present project, we investigate the PID control tuning based on the Particle Swarm Optimization (PSO) algorithm at the first time in neuro-muscular systems for updating automatically the stimulation pulse amplitude to track a desired force profiles. In the beginning, The PSO algorithm is used to identify unknown force model parameters. Next, optimal PID gains are found by the same intelligent algorithm to improve the control system. The obtaine…
Enhancing identification of causal effects by pruning
2018
Causal models communicate our assumptions about causes and effects in real-world phe- nomena. Often the interest lies in the identification of the effect of an action which means deriving an expression from the observed probability distribution for the interventional distribution resulting from the action. In many cases an identifiability algorithm may return a complicated expression that contains variables that are in fact unnecessary. In practice this can lead to additional computational burden and increased bias or inefficiency of estimates when dealing with measurement error or missing data. We present graphical criteria to detect variables which are redundant in identifying causal effe…
Computational aspects in checking of coherence and propagation of conditional probability bounds
2000
In this paper we consider the problem of reducing the computational difficulties in g-coherence checking and propagation of imprecise conditional probability assessments. We review some theoretical results related with the linear structure of the random gain in the betting criterion. Then, we propose a modi ed version of two existing algorithms, used for g-coherence checking and propagation, which are based on linear systems with a reduced number of unknowns. The reduction in the number of unknowns is obtained by an iterative algorithm. Finally, to illustrate our procedure we give some applications.
Algorithms for coherence checking and propagation of conditional probability bounds
2001
In this paper, we propose some algorithms for the checking of generalized coherence (g-coherence) and for the extension of imprecise conditional probability assessments. Our concept of g-coherence is a generalization of de Finetti’s coherence principle and is equivalent to the ”avoiding uniform loss” property for lower and upper probabilities (a la Walley). By our algorithms we can check the g-coherence of a given imprecise assessment and we can correct it in order to obtain the associated coherent assessment (in the sense of Walley and Williams). Exploiting some properties of the random gain we show how, in the linear systems involved in our algorithms, we can work with a reduced set of va…
Jet fragmentation transverse momentum distributions in pp and p-Pb collisions at √s, √sNN = 5.02 TeV
2021
Jet fragmentation transverse momentum (jT) distributions are measured in proton-proton (pp) and proton-lead (p-Pb) collisions at √sNN = 5.02 TeV with the ALICE experiment at the LHC. Jets are reconstructed with the ALICE tracking detectors and electromagnetic calorimeter using the anti-kT algorithm with resolution parameter R = 0.4 in the pseudorapidity range |η| < 0.25. The jT values are calculated for charged particles inside a fixed cone with a radius R = 0.4 around the reconstructed jet axis. The measured jT distributions are compared with a variety of parton-shower models. Herwig and Pythia 8 based models describe the data well for the higher jT region, while they underestimate the low…