Search results for "Markov"
showing 10 items of 628 documents
Experimental studies on continuous speech recognition using neural architectures with “adaptive” hidden activation functions
2010
The choice of hidden non-linearity in a feed-forward multi-layer perceptron (MLP) architecture is crucial to obtain good generalization capability and better performance. Nonetheless, little attention has been paid to this aspect in the ASR field. In this work, we present some initial, yet promising, studies toward improving ASR performance by adopting hidden activation functions that can be automatically learned from the data and change shape during training. This adaptive capability is achieved through the use of orthonormal Hermite polynomials. The “adaptive” MLP is used in two neural architectures that generate phone posterior estimates, namely, a standalone configuration and a hierarch…
Analysis and modeling of wind directions time series
2013
This work aims at studying some aspects of wind directions in Italy and supplying appropriate models. A comparison is presented between independent mixture and Hidden Markov models, which seem to be appropriate as far as the series we studied.
An analytical study of mixed backoff schemes for QoS differentiation in wireless LAN
2009
In this paper, we propose an analytical model to evaluate performances of a wireless network composed by two groups of nodes using two different backoff schemes for channel access. The two different backoff schemes are used for QoS differentiation in term of priority. Our analysis results show that the priority group can have its performances enhanced, in term of saturation throughput and delay, without significant degradation of normal group nodes performances. This enhancement is also noticed for throughput efficiency at system level.
Analysis of Low-Altitude Aerial Sequences for Road Traffic Diagnosis using Graph Partitioning and Markov Hierarchical Models
2016
International audience; This article focuses on an original approach aiming the processing of low-altitude aerial sequences taken from an helicopter (or drone) and presenting a road traffic. Proposed system attempts to extract vehicles from acquired sequences. Our approach begins with detecting the primitives of sequence images. At the time of this step of segmentation, the system computes dominant motion for each pair of images. This motion is computed using wavelets analysis on optical flow equation and robust techniques. Interesting areas (areas not affected by the dominant motion) are detected thanks to a Markov hierarchical model. Primitives stemming from segmentation and interesting a…
Annealed Invariance Principle for Random Walks on Random Graphs Generated by Point Processes in R-d
2016
International audience; We consider simple random walks on random graphs embedded in R-d and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we show an annealed invariance principle for these random walks. These results hold for a large variety of point processes including Poisson point processes, Matern cluster and Matern hardcore processes which have respectively clustering and repulsiveness properties. The proof relies on the use the process of the environment seen from the particle. It allows to reconstruct the original process as an additive functional of a Markovian process und…
A cubic defining algebra for the Links-Gould polynomial
2012
We define a finite-dimensional cubic quotient of the group algebra of the braid group, endowed with a (essentially unique) Markov trace which affords the Links-Grould invariant of knots and links. We investigate several of its properties, and state several conjectures about its structure.
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 …
Probability and algorithmics: a focus on some recent developments
2017
Jean-François Coeurjolly, Adeline Leclercq-Samson Eds.; International audience; This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.; Cet article présente différents résultats récents de nature théorique illustrant les interactions entre probabilités et algorithmique. Ces contributions traitent de sujets variés : automates cellulaires et calculabilité, chaînes de Mark…
Statistics of transitions for Markov chains with periodic forcing
2013
The influence of a time-periodic forcing on stochastic processes can essentially be emphasized in the large time behaviour of their paths. The statistics of transition in a simple Markov chain model permits to quantify this influence. In particular the first Floquet multiplier of the associated generating function can be explicitly computed and related to the equilibrium probability measure of an associated process in higher dimension. An application to the stochastic resonance is presented.
Variable Length Markov Chains, Persistent Random Walks: a close encounter
2020
This is the story of the encounter between two worlds: the world of random walks and the world of Variable Length Markov Chains (VLMC). The meeting point turns around the semi-Markov property of underlying processes.