Search results for "stochastic"

showing 10 items of 1018 documents

Characteristics of the polymer transport in ratchet systems

2010

Molecules with complex internal structure in time-dependent periodic potentials are studied by using short Rubinstein-Duke model polymers as an example. We extend our earlier work on transport in stochastically varying potentials to cover also deterministic potential switching mechanisms, energetic efficiency and non-uniform charge distributions. We also use currents in the non-equilibrium steady state to identify the dominating mechanisms that lead to polymer transportation and analyze the evolution of the macroscopic state (e.g., total and head-to-head lengths) of the polymers. Several numerical methods are used to solve the master equations and nonlinear optimization problems. The domina…

Work (thermodynamics)PolymersRatchetMolecular ConformationFOS: Physical sciencesRatchet effectmolecular motorsNonlinear programmingDiffusionMotionkuljetusilmiötMaster equationmolekyylimoottoritStatistical physicspolymeeritCondensed Matter - Statistical MechanicsPhysicsStochastic ProcessesStatistical Mechanics (cond-mat.stat-mech)Molecular Motor ProteinsNumerical analysisCharge (physics)ratchetsModels Theoreticalnonequilibrium phenomenaKineticsClassical mechanicsräikätepätasapainoilmiöttransport phenomenaAlgorithmsCoherence (physics)Physical Review E
researchProduct

Spatial Bayesian Modeling Applied to the Surveys of Xylella fastidiosa in Alicante (Spain) and Apulia (Italy)

2020

The plant-pathogenic bacterium Xylella fastidiosa was first reported in Europe in 2013, in the province of Lecce, Italy, where extensive areas were affected by the olive quick decline syndrome, caused by the subsp. pauca. In Alicante, Spain, almond leaf scorch, caused by X. fastidiosa subsp. multiplex, was detected in 2017. The effects of climatic and spatial factors on the geographic distribution of X. fastidiosa in these two infested regions in Europe were studied. The presence/absence data of X. fastidiosa in the official surveys were analyzed using Bayesian hierarchical models through the integrated nested Laplace approximation (INLA) methodology. Climatic covariates were obtained from …

Xylella fastidiosa0106 biological scienceshierarchical Bayesian modelsDiurnal rangeLeaf scorchPlant Sciencelcsh:Plant cultureBayesian inference01 natural sciences010104 statistics & probabilityCovariatemedicinelcsh:SB1-11100101 mathematicsspecies distribution modelsXylella fastidiosabiologySpatial structurealmond leaf scorchintegrated nested Laplace approximation15. Life on landbiology.organism_classificationmedicine.diseaseConfounding effectstochastic partial differential equationGeographyolive quick declineSampling distributionXylella fastidiosaCartography010606 plant biology & botanyFrontiers in Plant Science
researchProduct

Modeling the Spatial Distribution of Xylella fastidiosa: A Nonstationary Approach with Dispersal Barriers

2022

Spatial species distribution models often assume isotropy and stationarity, implying that spatial dependence is direction-invariant and uniform throughout the study area. However, these assumptions are violated when dispersal barriers are present. Despite this, the issue of nonstationarity has been little explored in the context of plant health. The objective of this study was to evaluate the influence of barriers in the distribution of Xylella fastidiosa in the demarcated area in Alicante, Spain. Occurrence data from 2018 were analyzed through spatial Bayesian hierarchical models. The stationary model, illustrating a scenario without control interventions or geographical features, was com…

Xylella fastidiosaAlmond leaf scorchNon-stationary modelsIsotropySpecies distributionStochastic partial differential equationPlant ScienceContainmentBiologySpatial distributionbiology.organism_classificationDisease controlINLABiological dispersalU10 Mathematical and statistical methodsStatistical physicsXylella fastidiosaSpatial dependenceInvariant (mathematics)H20 Plant diseasesAgronomy and Crop ScienceBarriersEradication
researchProduct

Théorie de système et séries temporelles

1994

The aim of this paper is to present a different representation of state space models, (innovation state space representation) which is relatively new and apparently unknown in the economics and econometrics literature and to describe some of its properties. state space representation is a very flexible form for time series and the approach taken in this paper therefore allows a broad class of models it does not impose a priori the decomposition of data series into trend and cycle

[ MATH ] Mathematics [math]mathématiques séries temporelles innovation espace état stabilité stochastiqueséries temporellesstability stochasticmathematicsstate space[MATH] Mathematics [math]innovationmathématiquesstabilité stochastiquestatisticsespace étattime serieoperations research
researchProduct

Solving chance constrained optimal control problems in aerospace via Kernel Density Estimation

2017

International audience; The goal of this paper is to show how non-parametric statistics can be used to solve some chance constrained optimization and optimal control problems. We use the Kernel Density Estimation method to approximate the probability density function of a random variable with unknown distribution , from a relatively small sample. We then show how this technique can be applied and implemented for a class of problems including the God-dard problem and the trajectory optimization of an Ariane 5-like launcher.

[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]Mathematical optimizationControl and Optimizationchance constrained optimizationKernel density estimation0211 other engineering and technologiesProbability density function02 engineering and technology01 natural sciencesKernel Density Estimation010104 statistics & probability0101 mathematicsMathematics021103 operations researchApplied MathematicsConstrained optimizationTrajectory optimizationstochastic optimizationOptimal controlOptimal controlDistribution (mathematics)Aerospace engineeringControl and Systems EngineeringStochastic optimization[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Random variableSoftware
researchProduct

Allocation des ressources dans l’informatique en brouillard le calcul du brouillard véhiculaire pour une utilisation optimale des véhicules électriqu…

2019

Abstract: Technological advancements made it possible for Electric vehicles (EVs) to have onboard computation, communication, storage, and sensing capabilities. Nevertheless, most of the time these EVs spend their time in parking lots, which makes onboard devices cruelly underutilized. Thus, a better management and pooling these underutilized resources together would be strongly recommended. The new aggregated resources would be useful for traffic safety applications, comfort related applications or can be used as a distributed data center. Moreover, parked vehicles might also be used as a service delivery platform to serve users. Therefore, the use of aggregated abundant resources for the …

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]Jeu stochastiqueAllocation des ressourcesProcessus de décision MarkovienStochastic GameVéhicule électriqueVehicular Fog ComputingElectric VehiclesMarkov Decision ProcessInformatique en brouillard véhiculaire[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Resource Allocation
researchProduct

Scheduling independent stochastic tasks on heterogeneous cloud platforms

2019

International audience; This work introduces scheduling strategies to maximize the expected number of independent tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The cloud platform is composed of several types of virtual machines (VMs), where each type has a unitexecution cost that depends upon its characteristics. The amount of budget spent during the execution of a task on a given VM is the product of its execution length by the unit execution cost of that VM. The execution lengths of tasks follow a variety of standard probability distributions (exponential, uniform, halfnormal, etc.), which is known beforehand and whose mean and stand…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]020203 distributed computingComputer scienceStochastic processbusiness.industryDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Processor schedulingCloud computing02 engineering and technologycomputer.software_genreScheduling (computing)Virtual machine0202 electrical engineering electronic engineering information engineeringTask analysisProbability distribution020201 artificial intelligence & image processing[INFO]Computer Science [cs][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]InterruptHeuristicsbusinesscomputer
researchProduct

Scheduling independent stochastic tasks under deadline and budget constraints

2018

This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Mathematical optimizationOperations researchComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Cloud computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]02 engineering and technologyExpected valueTheoretical Computer ScienceScheduling (computing)[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]deadline0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]schedulingComputer Science::Operating SystemsComputingMilieux_MISCELLANEOUSBudget constraint020203 distributed computingcloud platformindependent tasksbusiness.industry[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationstochastic costAsymptotically optimal algorithmContinuous distributions[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Hardware and ArchitectureProbability distribution[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]020201 artificial intelligence & image processingInterrupt[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessSoftwarebudget
researchProduct

AN ONTOLOGY-BASED APPROACH TO PROVIDE PERSONNALIZED RECOMMENDATIONS USING A STOCHASTIC ALGORITHM

2011

International audience; The use of personalized recommender systems to assist users in the selection of products is becoming more and more popular and wide-spread. The purpose of a recommender system is to provide the most suitable items from an knowledge base, according the user knowledge, tastes, interests, ... These items are generally proposed as ordered lists. In this article, we propose to combine works from adaptive hypermedia systems, semantic web and combinatory to create a new kind of recommender systems suggesting combinations of items corresponding to the user.

[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]semantic web[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH][ INFO.INFO-OH ] Computer Science [cs]/Other [cs.OH]Recommender systemsstochastic processesuser modellingstochastic processes.adaptive hypermedia systemsinformation filtering
researchProduct

Synchronization and fluctuations for interacting stochastic systems with individual and collective reinforcement

2020

The Pólya urn is the paradigmatic example of a reinforced stochastic process. It leads to a random (non degenerated) time-limit. The Friedman urn is a natural generalization whose a.s. time-limit is not random anymore. In this work, in the stream of previous recent works, we introduce a new family of (finite) systems of reinforced stochastic processes, interacting through an additional collective reinforcement of mean field type. The two reinforcement rules strengths (one componentwise, one collective) are tuned through (possibly) different rates n −γ. In the case the reinforcement rates are like n −1 , these reinforcements are of Pólya or Friedman type as in urn contexts and may thus lead …

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Interacting random systemssynchronisation[MATH] Mathematics [math]Almost sure convergenceReinforced stochastic processes[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]62P35Secondary 62L2060F05Central limit theoremsFluctuationsFluctuations MSC2010 Classification Primary 60K3560F15[MATH]Mathematics [math]stable convergence
researchProduct