Search results for "Markov"

showing 10 items of 628 documents

Hierarchical log Gaussian Cox process for regeneration in uneven-aged forests

2021

We propose a hierarchical log Gaussian Cox process (LGCP) for point patterns, where a set of points x affects another set of points y but not vice versa. We use the model to investigate the effect of large trees to the locations of seedlings. In the model, every point in x has a parametric influence kernel or signal, which together form an influence field. Conditionally on the parameters, the influence field acts as a spatial covariate in the intensity of the model, and the intensity itself is a non-linear function of the parameters. Points outside the observation window may affect the influence field inside the window. We propose an edge correction to account for this missing data. The par…

0106 biological sciencesStatistics and ProbabilityFOS: Computer and information sciences62F15 (Primary) 62M30 60G55 (Secondary)MCMCGaussianBayesian inferenceMarkovin ketjutStatistics - Applications010603 evolutionary biology01 natural sciencesCox processMethodology (stat.ME)010104 statistics & probabilitysymbols.namesakeregeneraatio (biologia)Applied mathematicsApplications (stat.AP)0101 mathematicsLaplace approximationStatistics - MethodologyGeneral Environmental ScienceParametric statisticsMathematicsspatial random effectsbayesilainen menetelmäMarkov chain Monte CarloFunction (mathematics)15. Life on landMissing dataMonte Carlo -menetelmätcompetition kernelLaplace's methodKernel (statistics)symbolstree regenerationpuustometsänhoitomatemaattiset mallitStatistics Probability and Uncertainty
researchProduct

GenExP, un logiciel simulateur de paysages agricoles pour l'étude de la diffusion de transgènes

2007

 ; The software GENEXP allows to simulate 2-dimensional agricultural landscapes by using a traditional algorithmic geometry. Based on real or realistic field-patterns, GENEXP provides multiannual maps of agricultural landscapes, which are used by softwares simulating the dispersal of GM pollen grains and seeds at various scales.; GENEXP est un simulateur de paysages agricoles qui engendre des découpages parcellaires en utilisant une géométrie algorithmique classique. GENEXP fournit, sur la base de parcellaires réels ou réalistes, des cartes pluriannuelles de paysages agricoles utilisables par des logiciels qui simulent la dispersion des pollens et des graines d'OGM à différentes échelles.

0106 biological sciences[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]010603 evolutionary biology01 natural sciencesVORONOÏ TESSELATION[ SDV.EE ] Life Sciences [q-bio]/Ecology environmentAGRICULTURAL LANDSCAPE[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]diagrammes de Voronoi[ INFO.INFO-AI ] Computer Science [cs]/Artificial Intelligence [cs.AI]DIAGRAMMES DE VORONOÏpaysage agricole[SDV.EE]Life Sciences [q-bio]/Ecology environmentFIELD PATTERN[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]voronoi tesselationPROCESSUS PONCTUEL MARKOVIEN04 agricultural and veterinary sciencesGeneral Medicineflux de genes15. Life on landsimulationPARCELLAIRE[SDV.EE] Life Sciences [q-bio]/Ecology environmentagricultural landscape field-pattern germs distribution markov point process gene flowpaysage agricole parcellaire simulation diagrammes de Voronoi distribution de germes processus ponctuel markovien flux de genes voronoi tesselation INFORMATIQUEGERMS DISTRIBUTIONINFORMATIQUE040103 agronomy & agricultureMARKOV POINT PROCESS0401 agriculture forestry and fisheriesfield-patterngene flowDISTRIBUTION DE GERMES
researchProduct

A Stochastic Routing Algorithm for Distributed IoT with Unreliable Wireless Links

2016

Punctual and reliable transmission of collected information is indispensable for many Internet of Things (IoT) applications. Such applications rely on IoT devices operating over wireless communication links which are intrinsically unreliable. Consequently to improve packet delivery success while reducing delivery delay is a challenging task for data transmission in the IoT. In this paper, we propose an improved distributed stochastic routing algorithm to increase packet delivery ratio and decrease delivery delay in IoT with unreliable communication links. We adopt the concept of absorbing Markov chain to model the network and evaluate the expected delivery ratio and expected delivery delay …

020203 distributed computingbusiness.industryComputer scienceNetwork packetDistributed computingReliability (computer networking)020206 networking & telecommunications02 engineering and technologyAbsorbing Markov chain0202 electrical engineering electronic engineering information engineeringWirelessRouting (electronic design automation)businessAlgorithmWireless sensor networkData transmissionComputer network2016 IEEE 83rd Vehicular Technology Conference (VTC Spring)
researchProduct

Convergence of direct recursive algorithm for identification of Preisach hysteresis model with stochastic input

2015

We consider a recursive iterative algorithm for identification of parameters of the Preisach model, one of the most commonly used models of hysteretic input-output relationships. The classical identification algorithm due to Mayergoyz defines explicitly a series of test inputs that allow one to find parameters of the Preisach model with any desired precision provided that (a) such input time series can be implemented and applied; and, (b) the corresponding output data can be accurately measured and recorded. Recursive iterative identification schemes suitable for a number of engineering applications have been recently proposed as an alternative to the classical algorithm. These recursive sc…

0209 industrial biotechnology93E12 47J40 74N30Markov chainIterative methodApplied MathematicsMarkov processFOS: Physical sciences02 engineering and technologyFunction (mathematics)Nonlinear Sciences - Chaotic Dynamics021001 nanoscience & nanotechnologyParameter identification problemsymbols.namesake020901 industrial engineering & automationRate of convergenceControl theoryPiecewisesymbolsApplied mathematicsOnline algorithmChaotic Dynamics (nlin.CD)0210 nano-technologyMathematics
researchProduct

Density Flow in Dynamical Networks via Mean-Field Games

2016

Current distributed routing control algorithms for dynamic networks model networks using the time evolution of density at network edges, while the routing control algorithm ensures edge density to converge to a Wardrop equilibrium, which was characterized by an equal traffic density on all used paths. We rearrange the density model to recast the problem within the framework of mean-field games. In doing that, we illustrate an extended state-space solution approach and we study the stochastic case where the density evolution is driven by a Brownian motion. Further, we investigate the case where the density evolution is perturbed by a bounded adversarial disturbance. For both the stochastic a…

0209 industrial biotechnologyDensity flowMathematical optimizationMarkov process02 engineering and technology01 natural sciencessymbols.namesake020901 industrial engineering & automationSettore ING-INF/04 - AutomaticaRobustness (computer science)Applied mathematics0101 mathematicsElectrical and Electronic EngineeringBrownian motionMathematics010102 general mathematicsControl engineering decentralized control intelligent transportation systems traffic controlTime evolutionComputer Science ApplicationsMean field theoryControl and Systems EngineeringBounded functionRepeated gamesymbolsSettore MAT/09 - Ricerca OperativaIEEE Transactions on Automatic Control
researchProduct

Prediction-Based Assembly Assistance System

2020

This paper presents the design of a prediction-based assembly assistance system for manual operations and the results obtained on the data collected from experiments of assembling a customizable product. We integrated into the proposed system a Markov predictor improved with a padding mechanism whose role is to recommend the next assembly step and to detect the worker’s errors. The predictor is trained with correct assembly patterns and tested with real assembly/manufacturing data. The proposed predictor improves the coverage and, thus, there is a significantly higher number of assembly steps which are correctly correlated with the real intentions of the workers.

0209 industrial biotechnologyMarkov chainComputer sciencebusiness.industry02 engineering and technologycomputer.software_genreAutomationMechanism (engineering)020901 industrial engineering & automationProduct (mathematics)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingData miningHardware_CONTROLSTRUCTURESANDMICROPROGRAMMINGbusinesscomputer2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)
researchProduct

Adaptation, coordination, and local interactions via distributed approachability

2017

This paper investigates the relation between cooperation, competition, and local interactions in large distributed multi-agent\ud systems. The main contribution is the game-theoretic problem formulation and solution approach based on the new framework\ud of distributed approachability, and the study of the convergence properties of the resulting game model. Approachability\ud theory is the theory of two-player repeated games with vector payoffs, and distributed approachability is here presented for\ud the first time as an extension to the case where we have a team of agents cooperating against a team of adversaries under local\ud information and interaction structure. The game model turns i…

0209 industrial biotechnologyMarkov process02 engineering and technologyApproachability01 natural sciencesTerm (time)Repeated gamesApproachabilityDifferential gamesRobust controlNetwork flow010104 statistics & probabilityNonlinear systemsymbols.namesake020901 industrial engineering & automationSettore ING-INF/04 - AutomaticaDifferential inclusionControl and Systems EngineeringConvergence (routing)symbolsRepeated gameTopological graph theorySettore MAT/09 - Ricerca Operativa0101 mathematicsElectrical and Electronic EngineeringMathematical economicsMathematicsAutomatica
researchProduct

New results on stability analysis and stabilization of time-delay continuous Markovian jump systems with partially known rates matrix

2015

Summary In this note, the problems of stability analysis and controller synthesis of Markovian jump systems with time-varying delay and partially known transition rates are investigated via an input–output approach. First, the system under consideration is transformed into an interconnected system, and new results on stochastic scaled small-gain condition for stochastic interconnected systems are established, which are crucial for the problems considered in this paper. Based on the system transformation and the stochastic scaled small-gain theorem, stochastic stability of the original system is examined via the stochastic version of the bounded realness of the transformed forward system. Th…

0209 industrial biotechnologyStochastic stabilityMechanical EngineeringGeneral Chemical EngineeringBiomedical EngineeringRegular polygonStability (learning theory)Aerospace Engineering02 engineering and technologyIndustrial and Manufacturing EngineeringMarkovian jumpMatrix (mathematics)020901 industrial engineering & automationControl and Systems EngineeringSystem transformationControl theoryBounded function0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingElectrical and Electronic EngineeringMathematicsInternational Journal of Robust and Nonlinear Control
researchProduct

New delay-dependent stability of Markovian jump neutral stochastic systems with general unknown transition rates

2015

This paper investigates the delay-dependent stability problem for neutral Markovian jump systems with generally unknown transition rates GUTRs. In this neutral GUTR model, each transition rate is completely unknown or only its estimate value is known. Based on the study of expectations of the stochastic cross-terms containing the integral, a new stability criterion is derived in terms of linear matrix inequalities. In the mathematical derivation process, bounding stochastic cross-terms, model transformation and free-weighting matrix are not employed for less conservatism. Finally, an example is provided to demonstrate the effectiveness of the proposed results.

0209 industrial biotechnologygeneral uncertain transition rateStability criterionModel transformationDelay-dependent stability02 engineering and technologyTransition rate matrixStability (probability)neutral-type stochastic systemTheoretical Computer ScienceDelay dependentMatrix (mathematics)Markovian jump020901 industrial engineering & automationControl theoryBounding overwatch0202 electrical engineering electronic engineering information engineeringApplied mathematicsMathematicscomputer.programming_languageDelay-dependent stability; neutral-type stochastic system;Markovian switching; general uncertain transition rate; mean-square exponentially stable; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern RecognitionMarkovian switchingComputer Science Applications1707 Computer Vision and Pattern RecognitionComputer Science ApplicationsControl and Systems Engineeringmean-square exponentially stable020201 artificial intelligence & image processingcomputerInternational Journal of Systems Science
researchProduct

Two-qubit entanglement dynamics for two different non-Markovian environments

2009

We study the time behavior of entanglement between two noninteracting qubits each immersed in its own environment for two different non-Markovian conditions: a high-$Q$ cavity slightly off-resonant with the qubit transition frequency and a nonperfect photonic band-gap, respectively. We find that revivals and retardation of entanglement loss may occur by adjusting the cavity-qubit detuning, in the first case, while partial entanglement trapping occurs in non-ideal photonic-band gap.

03.67.Mn Entanglement measures witnesses and other characterizationCondensed Matter::Quantum GasesPhysicsQuantum Physicsbusiness.industryDynamics (mechanics)FOS: Physical sciencesMarkov process03.65.Ud Entanglement and quantum nonlocality (e.g. EPR paradox Bell's inequalities GHZ states etc.)Quantum PhysicsTrappingQuantum entanglementCondensed Matter PhysicsAtomic and Molecular Physics and OpticsSettore FIS/03 - Fisica Della Materiasymbols.namesake03.67.Mn Entanglement measures witnesses and other characterizations; 03.65.Ud Entanglement and quantum nonlocality (e.g. EPR paradox Bell's inequalities GHZ states etc.); 03.67.Lx Quantum computation architectures and implementationsQuantum mechanicsQubitsymbolsPhotonicsQuantum Physics (quant-ph)business03.67.Lx Quantum computation architectures and implementationsMathematical Physics
researchProduct