Search results for "Algorithm"

showing 10 items of 4887 documents

Sex-specific effects of natural and sexual selection on the evolution of life span and ageing in Drosophila simulans

2014

Summary Variation in the strength of age-dependent natural selection shapes differences in ageing rates across species and populations. Likewise, sexual selection can promote divergent patterns of senescence across the sexes. However, the effects of these processes on the evolution of ageing have largely been considered independently, and interactions between them are poorly understood. We use experimental evolution to investigate how natural and sexual selection affect life span and ageing in Drosophila simulans. Replicate populations were evolved under lifetime monogamy (relaxed sexual selection) or lifetime polyandry (elevated sexual selection) and at one of two temperatures, 25 °C (rela…

melanogastersenescencemedia_common.quotation_subjectBiologyEvolution of ageingSexual conflictfemale fitnessoxidative stressLaboratory of EntomologyEcology Evolution Behavior and SystematicsSelection (genetic algorithm)media_commonExperimental evolutionNatural selectionLongevityPE&RCpopulationsLaboratorium voor Entomologieageseed beetleAgeingEvolutionary biologySexual selectionextrinsic mortalityhistory traitsmale-sterilityFunctional Ecology
researchProduct

Chronic Mesenteric Ischemia: Critical review and guidelines for management

2011

Background CMI is caused by chronic occlusive disease of mesenteric arteries. In such an uncommon disease, clear recommendations are strongly needed. Unfortunately, treatment options for symptomatic CMI are still controversial and no guidelines exist. Methods A systematic literature review of the last 25-years was conducted through MEDLINE, Embase, and Cochrane Review/Trials register to identify studies reporting on CMI treatment with more than 10 patients. Primary outcomes were perioperative mortality and morbidity rates. Secondary outcomes were survival rates, primary and secondary patency rates, vessels treated, CMI recurrence, follow-up (FU), technical success (TS), and in-hospital leng…

mesenteric chronic ischemia vascular surgeryPediatricsmedicine.medical_specialtyTime FactorsMEDLINE610 Medicine & healthDiseaseSettore MED/22 - Chirurgia Vascolare2705 Cardiology and Cardiovascular MedicineIschemiaRecurrenceRisk FactorsMesenteric Vascular OcclusionmedicineHumansVascular PatencyVascular DiseasesSurvival rateVascular PatencyChi-Square Distributionbusiness.industry10042 Clinic for Diagnostic and Interventional RadiologyPatient Selection10031 Clinic for AngiologyEndovascular ProceduresGeneral MedicinePerioperativeLength of Staymedicine.disease10020 Clinic for Cardiac Surgery2746 SurgeryTreatment OutcomeSystematic reviewMesenteric ischemiaMesenteric IschemiaPractice Guidelines as TopicSurgeryCardiology and Cardiovascular MedicinebusinessVascular Surgical ProceduresChi-squared distributionAlgorithms
researchProduct

Analytical model for the long- distance tracer-transport in plants

2011

International audience; Recent investigations of long-distance transport in plants using non-invasive tracer techniques such as C radiolabeling monitored by positron emission tomography (PET) combined with magnetic resonance imaging (MRI) revealed the need of dedicated methods to allow a quantitative data analysis and comparison of such experiments. A mechanistic compartmental tracer transport model is presented, defined by a linear system of partial differential equations (PDEs). This model simplifies the complexity of axial transport and lateral exchanges in the transport pathways of plants (e.g. the phloem) by simulating transport and reversible exchange within three compartments using j…

metabolism [Plant Structures]Transport pathwaysPlant RootsNuclear magnetic resonanceCarbon RadioisotopesPositron emissiontomography(PET)11CPartial differential equationFourier AnalysisApplied MathematicsLinear systemfood and beveragesGeneral MedicinePlantsphysiology [Biological Transport]Magnetic Resonance Imagingmetabolism [Plants]Jddc:580Modeling and SimulationPositron emission tomography (PET)Beta vulgarisGeneral Agricultural and Biological SciencesBiological systemmetabolism [Zea mays]AlgorithmsSimulationStatistics and ProbabilityMaterials scienceC-11metabolism [Phloem]Data analysisPhloemZea maysModels BiologicalGeneral Biochemistry Genetics and Molecular Biologymetabolism [Plant Roots]RaphanusXylemTRACERddc:570metabolism [Carbon Radioisotopes]Computer SimulationSensitivity (control systems)Radioactive TracersGeneral Immunology and Microbiologymetabolism [Xylem]Biological Transportmetabolism [Raphanus]metabolism [Beta vulgaris]Positron-Emission TomographyConstant (mathematics)Plant Structures
researchProduct

Parallel global optimization : structuring populations in differential evolution

2010

metaheuristicsoptimointistagnaatioglobal optimizationalgoritmitdifferentiaali evoluutioevoluutiolaskentaDifferential EvolutionEvolutionary computationevolutionary algorithmsmatemaattinen optimointiglobaali optimointitietojenkäsittely
researchProduct

On automatic algorithm configuration of vehicle routing problem solvers

2019

Many of the algorithms for solving vehicle routing problems expose parameters that strongly influence the quality of obtained solutions and the performance of the algorithm. Finding good values for these parameters is a tedious task that requires experimentation and experience. Therefore, methods that automate the process of algorithm configuration have received growing attention. In this paper, we present a comprehensive study to critically evaluate and compare the capabilities and suitability of seven state-of-the-art methods in configuring vehicle routing metaheuristics. The configuration target is the solution quality of eight metaheuristics solving two vehicle routing problem variants.…

metaheuristicsreititysMeta-optimizationComputer scienceProcess (computing)meta-optimizationComputational intelligenceSolverConfiguratoroptimointiComputer engineeringmetaheuristiikkaalgoritmitautomaatiojärjestelmätVehicle routing problemTheory of computationajoneuvotvehicle routing problemautomatic algorithm configurationautomaattiohjausMetaheuristicJournal on Vehicle Routing Algorithms
researchProduct

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

2012

In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.

minimal automata[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Timed automatondeterministic automataBüchi automaton0102 computer and information sciences02 engineering and technology01 natural sciencesDeterministic automaton0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Two-way deterministic finite automatonNondeterministic finite automatonMathematicsonline construction.Discrete mathematicsSettore INF/01 - InformaticaPowerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010201 computation theory & mathematicsProbabilistic automaton020201 artificial intelligence & image processingFinite set of wordAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

Modélisation de la mobilité : la génération de trafic à l'échelle régionale

2006

Public transport management is currently going through important changes, passing from one scale to another: decentralizing from the national level and extending at the local level. The range of transport management powers of the French administrative regions have widened, thus creating new management problems. Within the context of these new questions, our research proposes management solutions which take into account both the continual evolution of daily mobility and the new scales of transport management. More specifically, we considered a specific stage often neglected in geographical approaches to the suject. This stage called traffic generation consists in modelling the process of cho…

mobilité quotidiennegénération de trafic[SHS.GEO] Humanities and Social Sciences/Geographyrégionalisation ferroviaire[SHS.GEO]Humanities and Social Sciences/Geographyrégionalisationalgorithmes évolutionnairesmodélisation des transports[ SHS.GEO ] Humanities and Social Sciences/Geography
researchProduct

An EEMD Aided Comparison of Time Histories and Its Application in Vehicle Safety

2017

In the context of signal processing, the comparison of time histories is required for different purposes, especially for the model validation of vehicle safety. Most of the existing metrics focus on the mathematical value only. Therefore, they suffer the measuring errors, disturbance, and uncertainties and can hardly achieve a stable result with a clear physical interpretation. This paper proposes a novel scheme of time histories comparison to be used in vehicle safety analysis. More specifically, each signal for comparison is decomposed into a trend signal and several intrinsic mode functions (IMFs) by ensemble empirical mode decomposition. The trend signals reflect the general variation a…

model validationDynamic time warpingGeneral Computer ScienceComputer science02 engineering and technologyHilbert–Huang transformEngineering (all)0203 mechanical engineeringVehicle safety0202 electrical engineering electronic engineering information engineeringIn vehicledynamic time warping (DTW)General Materials Sciencevehicle crashSimulationSignal processingdynamic time warping (DTW); Ensemble Empirical Mode Decomposition (EEMD); model validation; Time-history; vehicle crash; Computer Science (all); Materials Science (all); Engineering (all)Computer Science (all)General Engineering020302 automobile design & engineeringEnsemble Empirical Mode Decomposition (EEMD)Measurement uncertainty020201 artificial intelligence & image processingMaterials Science (all)lcsh:Electrical engineering. Electronics. Nuclear engineeringlcsh:TK1-9971AlgorithmTime-historyShape analysis (digital geometry)Motor vehicle crash
researchProduct

Recursion at the crossroads of sequence modeling, random trees, stochastic algorithms and martingales

2013

This monograph synthesizes several studies spanning from dynamical systems in the statistical analysis of sequences, to analysis of algorithms in random trees and discrete stochastic processes. These works find applications in various fields ranging from biological sequences to linear regression models, branching processes, through functional statistics and estimates of risk indicators for insurances. All the established results use, in one way or another, the recursive property of the structure under study, by highlighting invariants such as martingales, which are at the heart of this monograph, as tools as well as objects of study.

modèles auto-régressifs[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]estimation and prediction errorstochastic gradient algorithmschaîne de Markov à mémoire variable[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Digital search treesvariable length Markov chainstrong laws for discrete martingalessuffix trietemps d'occurrences de motifsoptimisation stochastique.dynamical systemtrie des suffixesstochastic optimization.erreur d'estimation et de prédictionArbres digitaux de rechercheauto-regressive modelssystème dynamiquelois fortes de martingales discrètesalgorithmes de gradient stochastiques[MATH.MATH-ST] Mathematics [math]/Statistics [math.ST]occurrences time
researchProduct

Mise en œuvre d’une architecture de gestion de collision pour le déploiement efficace d’un NoC sur multi-FPGA

2015

International audience; Le déploiement d’un NoC (Network On Chip) sur plusieurs FPGA nécessite que des routeurs partagent un même lien de communication entre FPGAs, créant des goulots d’étranglement [1]. Dans ce papier, nous proposons une structure de gestion de collision intégrée entre le NoC et le point d’accès du protocole FPGA. Cette structure est basée sur les algorithmes utilisés dans les réseaux informatiques et adaptée aux NoC [2].

multi-FPGAHardware_INTEGRATEDCIRCUITS[INFO.INFO-ES]Computer Science [cs]/Embedded Systems[ INFO.INFO-ES ] Computer Science [cs]/Embedded Systemsgestion de collisionsalgorithme de BackoffNoC[INFO.INFO-ES] Computer Science [cs]/Embedded Systems
researchProduct