Search results for "Markov"

Minimum Description Length Based Hidden Markov Model Clustering for Life Sequence Analysis

2010

In this article, a model-based method for clustering life sequences is suggested. In the social sciences, model-free clustering methods are often used in order to find typical life sequences. The suggested method, which is based on hidden Markov models, provides principled probabilistic ranking of candidate clusterings for choosing the best solution. After presenting the principle of the method and algorithm, the method is tested with real life data, where it finds eight descriptive clusters with clear probabilistic structures. nonPeerReviewed

Precomputed Real-Time Texture Synthesis with Markovian Generative Adversarial Networks

2016

This paper proposes Markovian Generative Adversarial Networks (MGANs), a method for training generative networks for efficient texture synthesis. While deep neural network approaches have recently demonstrated remarkable results in terms of synthesis quality, they still come at considerable computational costs (minutes of run-time for low-res images). Our paper addresses this efficiency issue. Instead of a numerical deconvolution in previous work, we precompute a feed-forward, strided convolutional network that captures the feature statistics of Markovian patches and is able to directly generate outputs of arbitrary dimensions. Such network can directly decode brown noise to realistic textu…

The use of Markovian metapopulation models: a comparison of three methods reducing the dimensionality of transition matrices.

2001

The use of Markovian models is an established way for deriving the complete distribution of the size of a population and the probability of extinction. However, computationally impractical transition matrices frequently result if this mathematical approach is applied to natural populations. Binning, or aggregating population sizes, has been used to permit a reduction in the dimensionality of matrices. Here, we present three deterministic binning methods and study the errors due to binning for a metapopulation model. Our results indicate that estimation errors of the investigated methods are not consistent and one cannot make generalizations about the quality of a method. For some compared o…

A Conclusive Analysis of the Finite-Time Behavior of the Discretized Pursuit Learning Automaton

2019

Author's accepted version (post-print). © 20XX IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Available from 20/03/2021. This paper deals with the finite-time analysis (FTA) of learning automata (LA), which is a topic for which very little work has been reported in the literature. This is as opposed to the asymptotic steady-state analysis for which there are, probabl…

Bioinformatic flowchart and database to investigate the origins and diversity of Clan AA peptidases

2009

Abstract Background Clan AA of aspartic peptidases relates the family of pepsin monomers evolutionarily with all dimeric peptidases encoded by eukaryotic LTR retroelements. Recent findings describing various pools of single-domain nonviral host peptidases, in prokaryotes and eukaryotes, indicate that the diversity of clan AA is larger than previously thought. The ensuing approach to investigate this enzyme group is by studying its phylogeny. However, clan AA is a difficult case to study due to the low similarity and different rates of evolution. This work is an ongoing attempt to investigate the different clan AA families to understand the cause of their diversity. Results In this paper, we…

Performance Analysis of Synchronous Duty-Cycled MAC Protocols

2015

In this letter, we propose an analytical model to evaluate the performance of the S-MAC protocol. The proposed model improves the accuracy of previous models in two aspects. First, it incorporates the dependence among the nodes within a cluster by defining a DTMC that models the number of active nodes, whereas the previous models considered that nodes were mutually independent. Second, it proposes new methods for calculating packet delay and energy consumption. The analytical model is validated through discrete-event based simulations. Numerical results demonstrate that the proposed analytical model and methods yield accurate results under realistic assumptions

[IC‐P‐029]: GAUSSIAN MARKOV RANDOM FIELDS FOR ASSESSING INTERMODAL REGIONAL ASSOCIATIONS IN PRODROMAL ALZHEIMER's DISEASE

2017

Bismut’s Way of the Malliavin Calculus for Non-Markovian Semi-groups: An Introduction

2019

We give a review of our recent works related to the Malliavin calculus of Bismut type for non-Markovian generators. Part IV is new and relates the Malliavin calculus and the general theory of elliptic pseudo-differential operators.

Invariant Markov semigroups on quantum homogeneous spaces

2019

Invariance properties of linear functionals and linear maps on algebras of functions on quantum homogeneous spaces are studied, in particular for the special case of expected coideal *-subalgebras. Several one-to-one correspondences between such invariant functionals are established. Adding a positivity condition, this yields one-to-one correspondences of invariant quantum Markov semigroups acting on expected coideal *-subalgebras and certain convolution semigroups of states on the underlying compact quantum group. This gives an approach to classifying invariant quantum Markov semigroups on these quantum homogeneous spaces. The generators of these semigroups are viewed as Laplace operators …

Virtual and arrow Temperley–Lieb algebras, Markov traces, and virtual link invariants

2021

Let [Formula: see text] be the algebra of Laurent polynomials in the variable [Formula: see text] and let [Formula: see text] be the algebra of Laurent polynomials in the variable [Formula: see text] and standard polynomials in the variables [Formula: see text] For [Formula: see text] we denote by [Formula: see text] the virtual braid group on [Formula: see text] strands. We define two towers of algebras [Formula: see text] and [Formula: see text] in terms of diagrams. For each [Formula: see text] we determine presentations for both, [Formula: see text] and [Formula: see text]. We determine sequences of homomorphisms [Formula: see text] and [Formula: see text], we determine Markov traces […