Search results for "algorithm"
showing 10 items of 4887 documents
Pitch tilt rendering for an 8-DOF driving simulator
2015
International audience; Tilt coordination technique is used for reproducing a sustained linear acceleration in driving simulation by tilting the simulator cabin. Thus a part of gravity is interpreted as a horizontal acceleration. Between the slow rotational motion limited by the rotational perception threshold of semi-circular canals of vestibular system and the fast change of acceleration to render, the design of coupling motions of rotation and translation plays a critical role in the realism of driving simulator. We present here an experiment focusing on longitudinal accelerations rendering with pitch tilt coordination technique. Eight drivers experienced the same accelerations and decel…
A Forensic Diagnostic Algorithm for Drug-Related Deaths: A Case Series
2022
The best evidence provided in the literature worldwide suggests the importance of harmonizing the investigation in drug-related fatalities. In this study, the application of a multidisciplinary approach in eight cases of drug-related deaths is presented. Although death scene findings could be highly suggestive of drug intoxication, external examination and toxicological screening test alone are insufficient. There are several variables, and it is not always easy to give the proper interpretation of the drug detection. A complete autopsy is necessary to correctly complete organ and tissues sampling for further histological and toxicological studies and obtain body fluids. The use of peripher…
Considering safety issues in minimum losses reconfiguration for MV distribution networks
2009
This paper offers a new perspective over the traditional problem of the multiobjective optimal reconfiguration of electrical distribution systems in regular working state. The issue is indeed here formulated including also safety issues. Indeed, dimensioning the earth electrodes of their own secondary substations, distribution companies take into account the probable future configurations of the network due to transformations of overhead lines into cable lines or realization of new lines. On the contrary, they do not consider that, during normal working conditions. the structure of the network can be modified for long periods as a consequence of reconfiguration manoeuvres, with differences …
Regularization Preserving Localization of Close Edges
2007
International audience; In this letter, we address the problem of the influence of neighbor edges and their effect on the edge delocalization while extracting a neighbor contour by a derivative approach. The properties to be fulfilled by the regularization operators to minimize or suppress this side effect are deduced, and the best detectors are pointed out. The study is carried out in 1-D for discrete signal. We show that among the derivative filters, one of them can correctly detect our model edges without being influenced by a neighboring transition, whatever their separation distance is and their respective amplitude is. A model of contour and close transitions is presented and used through…
The seven layers of complexity of recommender systems for children in educational contexts
2019
Recommender systems (RS) in their majority focus on an average target user: adults. We argue that for non-traditional populations in specific contexts, the task is not as straightforward–we must look beyond existing recommendation algorithms, premises for interface design, and standard evaluation metrics and frameworks. We explore the complexity of RS in an educational context for which young children are the target audience. The aim of this position paper is to spell out, label, and organize the specific layers of complexity observed in this context.
DAE-GP
2020
Estimation of distribution genetic programming (EDA-GP) algorithms are metaheuristics where sampling new solutions from a learned probabilistic model replaces the standard mutation and recombination operators of genetic programming (GP). This paper presents DAE-GP, a new EDA-GP which uses denoising autoencoder long short-term memory networks (DAE-LSTMs) as probabilistic model. DAE-LSTMs are artificial neural networks that first learn the properties of a parent population by mapping promising candidate solutions to a latent space and reconstructing the candidate solutions from the latent space. The trained model is then used to sample new offspring solutions. We show on a generalization of t…
Evolution of Complex Acoustic Signals in Drosophila Species
2009
species produce complex acous-tic cues, so-called courtship songs, while pursuing a female.In most of the over 100 species studied so far (see thelist of these species in Hoikkala, 2005), such cues areproduced by wing vibration. Other mechanisms of songproduction include abdomen purring (Hoy, Hoikkala, &Kaneshiro, 1988) and rapid vibrations of the whole body(Ritchie & Gleason, 1995). The carrier frequency of songsproduced through any of these actions ranges from 150 to500Hz. A hitherto unknown mechanism enables males ofsome Hawaiian species to generate songs of up to 15,000Hz(Hoikkala, Hoy, & Kaneshiro, 1989).The structure of the courtship songs of closely relatedspecies often reflects phylo…
Sensitivity analysis of mesh warping and subsampling strategies for generating large scale electrophysiological simulation data
2011
The analysis of large-scale simulation data from virtual populations can be effective to gain computational insight into disease mechanisms and treatment strategies, which can serve for generating hypotheses for and focusing subsequent clinical trials. This can be instrumental in shortening the critical path in medical product development and more cost-effective clinical trials. A previously published pipeline established point correspondence among volumetric meshes to enable meaningful statistics on cardiac electrophysiological simulations on the anatomical distribution of a large-scale virtual population. Thin Plate Splines (TPS), derived from surface deformations, were used to warp a tem…
Scatter Search for the Point-Matching Problem in 3D Image Registration
2008
Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, such as the surrogate constraint method, scatter search uses strategies for combining solution vectors that have proved effective in a variety of problem settings. We present a scatter-search implementation designed to find high-quality solutions for the 3D image-registration problem, which has many practical applications. This problem arises in computer vision applications when finding a correspondence or transformation …
Bayesian Hierarchical Models for Random Routes in Finite Populations
1996
In many practical situations involving sampling from finite populations, it is not possible (or it is prohibitely expensive) to access, or to even produce, a listing of all of the units in the population. In these situations, inferences can not be based on random samples from the population. Random routes are widely used procedures to collect data in absence of well defined sampling frames, and they usually have either been improperly analyzed as random samples, or entirely ignored as useless. We present here a Bayesian analysis of random routes that incorporates the information provided but carefully takes into account the non- randomness in the selection of the units.