Results 11 to 20 of about 152,408 (254)
Fading Channel Modeling via Variable-Length Markov Chain Technique [PDF]
IEEE Transactions on Vehicular Technology, 2008 Channel characterization and modeling are essential to the wireless communication system design. A model that optimally represents a fading channel with a variable-length Markov chain (VLMC) is proposed in this paper. A VLMC offers a general class of Markov chains whose structure has a variable order and a parsimonious number of transition ...
W. Kumwilaisak +2 more
openaire +3 more sources
Model for Detection of Masquerade Attacks Based on Variable-Length Sequences
IEEE Access, 2020 A masquerader is an attacker who gains illegitimate access to a user's account. Masquerade detection is one of the key problems of intrusion detection systems.
Ghazaros Barseghyan +2 more
doaj +1 more source
Entropy, 2023 The increasing demand for end-to-end low-latency and high-reliability transmissions between edge computing nodes and user elements in 5G Advance edge networks has brought new challenges to the transmission of data. In response, this paper proposes LERMS,
Zhongfu Guo +7 more
doaj +1 more source
Variable Length Markov Chains: Methodology, Computing, and Software [PDF]
Journal of Computational and Graphical Statistics, 2004 This article presents a tutorial and new, publicly available computational tools for variable length Markov chains (VLMC). VLMCs are Markov chains with the additional attractive structure that their memories depend on a variable number of lagged values, depending on what the actual past (the lagged values) looks like.
Martin Mächler, Peter Bühlmann
openaire +1 more source
PLoS ONE, 2023 Interventional endeavours in medicine include prediction of a score that parametrises a new subject's susceptibility to a given disease, at the pre-onset stage.
Dalia Chakrabarty +6 more
doaj +1 more source
The Annals of Statistics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bühlmann, Peter, Wyner, Abraham J.
openaire +2 more sources
Algorithms for variable length Markov chain modeling [PDF]
Bioinformatics, 2004 Abstract Summary: We present a general purpose implementation of variable length Markov models. Contrary to fixed order Markov models, these models are not restricted to a predefined uniform depth. Rather, by examining the training data, a model is constructed that fits higher order Markov dependencies where such contexts exist, while ...
openaire +2 more sources
Estimation of General Stationary Processes by Variable Length Markov Chains [PDF]
Scandinavian Journal of Statistics, 2003 Abstract.We develop new results about a sieve methodology for the estimation of minimal state spaces and probability laws in the class of stationary processes defined on finite categorical spaces. Using a sieve approximation with variable length Markov chains of increasing order, we show that an adapted version of the Context algorithm yields ...
Ferrari, Fiorenzo, Wyner, Abraham J
openaire +3 more sources
A Probabilistic Approach to Generalized Zeckendorf Decompositions [PDF]
, 2016 Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.
Iddo Ben-ari, J. Miller, Steven
core +1 more source
Analysis of a Retrial Queue With Two-Type Breakdowns and Delayed Repairs
IEEE Access, 2020 This article studies an M/G/1 retrial queue with two types of breakdowns. When the server is idle, it is subject to breakdowns according to a Poisson process with rate δ and it cannot be repaired immediately.
Shan Gao, Jie Zhang, Xianchao Wang
doaj +1 more source