Browse
Submit Data
Databases
API
Help

Dataset Information

52 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Non-fragile mixed H∞ and passive synchronization of Markov jump neural networks with mixed time-varying delays and randomly occurring controller gain fluctuation.

ABSTRACT: This paper studies the non-fragile mixed H∞ and passive synchronization problem for Markov jump neural networks. The randomly occurring controller gain fluctuation phenomenon is investigated for non-fragile strategy. Moreover, the mixed time-varying delays composed of discrete and distributed delays are considered. By employing stochastic stability theory, synchronization criteria are developed for the Markov jump neural networks. On the basis of the derived criteria, the non-fragile synchronization controller is designed. Finally, an illustrative example is presented to demonstrate the validity of the control approach.

SUBMITTER: Ma C

PROVIDER: S-EPMC5391947 | biostudies-literature | 2017

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Non-fragile mixed H∞ and passive synchronization of Markov jump neural networks with mixed time-varying delays and randomly occurring controller gain fluctuation.

Ma Chao C

PloS one 20170414 4

This paper studies the non-fragile mixed H∞ and passive synchronization problem for Markov jump neural networks. The randomly occurring controller gain fluctuation phenomenon is investigated for non-fragile strategy. Moreover, the mixed time-varying delays composed of discrete and distributed delays are considered. By employing stochastic stability theory, synchronization criteria are developed for the Markov jump neural networks. On the basis of the derived criteria, the non-fragile synchroniza ...[more]

PMID: 28410394

Similar Datasets

Synchronization control for stochastic neural networks with mixed time-varying delays.

Project description:Synchronization control of stochastic neural networks with time-varying discrete and continuous delays has been investigated. A novel control scheme is proposed using the Lyapunov functional method and linear matrix inequality (LMI) approach. Sufficient conditions have been derived to ensure the global asymptotical mean-square stability for the error system, and thus the drive system synchronizes with the response system. Also, the control gain matrix can be obtained. With these effective methods, synchronization can be achieved. Simulation results are presented to show the effectiveness of the theoretical results.

| S-EPMC4106077 | biostudies-other

Jump-Chain Simulation of Markov Substitution Processes Over Phylogenies.

Project description:We draw attention to an under-appreciated simulation method for generating artificial data in a phylogenetic context. The approach, which we refer to as jump-chain simulation, can invoke rich models of molecular evolution having intractable likelihood functions. As an example, we simulate data under a context-dependent model allowing for CpG hypermutability and show how such a feature can mislead common codon models used for detecting positive selection. We discuss more generally how this method can serve to elucidate the ways by which currently used models for inference are susceptible to violations of their underlying assumptions. Finally, we show how the method could serve as an inference engine in the Approximate Bayesian Computation framework.

| S-EPMC9233627 | biostudies-literature

Learning to predict synchronization of coupled oscillators on randomly generated graphs.

Project description:Suppose we are given a system of coupled oscillators on an unknown graph along with the trajectory of the system during some period. Can we predict whether the system will eventually synchronize? Even with a known underlying graph structure, this is an important yet analytically intractable question in general. In this work, we take an alternative approach to the synchronization prediction problem by viewing it as a classification problem based on the fact that any given system will eventually synchronize or converge to a non-synchronizing limit cycle. By only using some basic statistics of the underlying graphs such as edge density and diameter, our method can achieve perfect accuracy when there is a significant difference in the topology of the underlying graphs between the synchronizing and the non-synchronizing examples. However, in the problem setting where these graph statistics cannot distinguish the two classes very well (e.g., when the graphs are generated from the same random graph model), we find that pairing a few iterations of the initial dynamics along with the graph statistics as the input to our classification algorithms can lead to significant improvement in accuracy; far exceeding what is known by the classical oscillator theory. More surprisingly, we find that in almost all such settings, dropping out the basic graph statistics and training our algorithms with only initial dynamics achieves nearly the same accuracy. We demonstrate our method on three models of continuous and discrete coupled oscillators-the Kuramoto model, Firefly Cellular Automata, and Greenberg-Hastings model. Finally, we also propose an "ensemble prediction" algorithm that successfully scales our method to large graphs by training on dynamics observed from multiple random subgraphs.

| S-EPMC9445105 | biostudies-literature

Bayesian Multiple Emitter Fitting using Reversible Jump Markov Chain Monte Carlo.

Project description:In single molecule localization-based super-resolution imaging, high labeling density or the desire for greater data collection speed can lead to clusters of overlapping emitter images in the raw super-resolution image data. We describe a Bayesian inference approach to multiple-emitter fitting that uses Reversible Jump Markov Chain Monte Carlo to identify and localize the emitters in dense regions of data. This formalism can take advantage of any prior information, such as emitter intensity and density. The output is both a posterior probability distribution of emitter locations that includes uncertainty in the number of emitters and the background structure, and a set of coordinates and uncertainties from the most probable model.

| S-EPMC6760159 | biostudies-literature

Unbiased Bayesian inference for population Markov jump processes via random truncations.

Project description:We consider continuous time Markovian processes where populations of individual agents interact stochastically according to kinetic rules. Despite the increasing prominence of such models in fields ranging from biology to smart cities, Bayesian inference for such systems remains challenging, as these are continuous time, discrete state systems with potentially infinite state-space. Here we propose a novel efficient algorithm for joint state/parameter posterior sampling in population Markov Jump processes. We introduce a class of pseudo-marginal sampling algorithms based on a random truncation method which enables a principled treatment of infinite state spaces. Extensive evaluation on a number of benchmark models shows that this approach achieves considerable savings compared to state of the art methods, retaining accuracy and fast convergence. We also present results on a synthetic biology data set showing the potential for practical usefulness of our work.

| S-EPMC5477715 | biostudies-other

Modelling heterotachy in phylogenetic inference by reversible-jump Markov chain Monte Carlo.

Project description:The rate at which a given site in a gene sequence alignment evolves over time may vary. This phenomenon--known as heterotachy--can bias or distort phylogenetic trees inferred from models of sequence evolution that assume rates of evolution are constant. Here, we describe a phylogenetic mixture model designed to accommodate heterotachy. The method sums the likelihood of the data at each site over more than one set of branch lengths on the same tree topology. A branch-length set that is best for one site may differ from the branch-length set that is best for some other site, thereby allowing different sites to have different rates of change throughout the tree. Because rate variation may not be present in all branches, we use a reversible-jump Markov chain Monte Carlo algorithm to identify those branches in which reliable amounts of heterotachy occur. We implement the method in combination with our 'pattern-heterogeneity' mixture model, applying it to simulated data and five published datasets. We find that complex evolutionary signals of heterotachy are routinely present over and above variation in the rate or pattern of evolution across sites, that the reversible-jump method requires far fewer parameters than conventional mixture models to describe it, and serves to identify the regions of the tree in which heterotachy is most pronounced. The reversible-jump procedure also removes the need for a posteriori tests of 'significance' such as the Akaike or Bayesian information criterion tests, or Bayes factors. Heterotachy has important consequences for the correct reconstruction of phylogenies as well as for tests of hypotheses that rely on accurate branch-length information. These include molecular clocks, analyses of tempo and mode of evolution, comparative studies and ancestral state reconstruction. The model is available from the authors' website, and can be used for the analysis of both nucleotide and morphological data.

| S-EPMC2607421 | biostudies-literature

Generalizing HMMs to Continuous Time for Fast Kinetics: Hidden Markov Jump Processes.

Project description:The hidden Markov model (HMM) is a framework for time series analysis widely applied to single-molecule experiments. Although initially developed for applications outside the natural sciences, the HMM has traditionally been used to interpret signals generated by physical systems, such as single molecules, evolving in a discrete state space observed at discrete time levels dictated by the data acquisition rate. Within the HMM framework, transitions between states are modeled as occurring at the end of each data acquisition period and are described using transition probabilities. Yet, whereas measurements are often performed at discrete time levels in the natural sciences, physical systems evolve in continuous time according to transition rates. It then follows that the modeling assumptions underlying the HMM are justified if the transition rates of a physical process from state to state are small as compared to the data acquisition rate. In other words, HMMs apply to slow kinetics. The problem is, because the transition rates are unknown in principle, it is unclear, a priori, whether the HMM applies to a particular system. For this reason, we must generalize HMMs for physical systems, such as single molecules, because these switch between discrete states in "continuous time". We do so by exploiting recent mathematical tools developed in the context of inferring Markov jump processes and propose the hidden Markov jump process. We explicitly show in what limit the hidden Markov jump process reduces to the HMM. Resolving the discrete time discrepancy of the HMM has clear implications: we no longer need to assume that processes, such as molecular events, must occur on timescales slower than data acquisition and can learn transition rates even if these are on the same timescale or otherwise exceed data acquisition rates.

| S-EPMC7896036 | biostudies-literature

Randomly incorporated genomic N6-methyldeoxyadenosine delays zygotic transcription initiation in a cnidarian.

Project description:N6-methyldeoxyadenosine (6mA) is a chemical alteration of DNA, observed across all realms of life. Although the functions of 6mA are well understood in bacteria and protists, its roles in animal genomes have been controversial. We show that 6mA randomly accumulates in early embryos of the cnidarian Hydractinia symbiolongicarpus, with a peak at the 16-cell stage followed by clearance to background levels two cell cycles later, at the 64-cell stage-the embryonic stage at which zygotic genome activation occurs in this animal. Knocking down Alkbh1, a putative initiator of animal 6mA clearance, resulted in higher levels of 6mA at the 64-cell stage and a delay in the initiation of zygotic transcription. Our data are consistent with 6mA originating from recycled nucleotides of degraded m6A-marked maternal RNA postfertilization. Therefore, while 6mA does not function as an epigenetic mark in Hydractinia, its random incorporation into the early embryonic genome inhibits transcription. In turn, Alkbh1 functions as a genomic 6mA "cleaner," facilitating timely zygotic genome activation. Given the random nature of genomic 6mA accumulation and its ability to interfere with gene expression, defects in 6mA clearance may represent a hitherto unknown cause of various pathologies.

| S-EPMC10390872 | biostudies-literature

Impaired inhibitory control of cortical synchronization in fragile X syndrome.

Project description:Fragile X syndrome (FXS) is a neurodevelopmental disorder characterized by severe cognitive impairments, sensory hypersensitivity, and comorbidities with autism and epilepsy. Fmr1 knockout (KO) mouse models of FXS exhibit alterations in excitatory and inhibitory neurotransmission, but it is largely unknown how aberrant function of specific neuronal subtypes contributes to these deficits. In this study we show specific inhibitory circuit dysfunction in layer II/III of somatosensory cortex of Fmr1 KO mice. We demonstrate reduced activation of somatostatin-expressing low-threshold-spiking (LTS) interneurons in response to the group I metabotropic glutamate receptor (mGluR) agonist 3,5-dihydroxyphenylglycine (DHPG) in Fmr1 KO mice, resulting in impaired synaptic inhibition. Paired recordings from pyramidal neurons revealed reductions in synchronized synaptic inhibition and coordinated spike synchrony in response to DHPG, indicating a weakened LTS interneuron network in Fmr1 KO mice. Together, these findings reveal a functional defect in a single subtype of cortical interneuron in Fmr1 KO mice. This defect is linked to altered activity of the cortical network in line with the FXS phenotype.

| S-EPMC3214096 | biostudies-literature

Feedback delays can enhance anticipatory synchronization in human-machine interaction.

Project description:Research investigating the dynamics of coupled physical systems has demonstrated that small feedback delays can allow a dynamic response system to anticipate chaotic behavior. This counterintuitive phenomenon, termed anticipatory synchronization, has been observed in coupled electrical circuits, laser semi-conductors, and artificial neurons. Recent research indicates that the same process might also support the ability of humans to anticipate the occurrence of chaotic behavior in other individuals. Motivated by this latter work, the current study examined whether the process of feedback delay induced anticipatory synchronization could be employed to develop an interactive artificial agent capable of anticipating chaotic human movement. Results revealed that incorporating such delays within the movement-control dynamics of an artificial agent not only enhances an artificial agent's ability to anticipate chaotic human behavior, but to synchronize with such behavior in a manner similar to natural human-human anticipatory synchronization. The implication of these findings for the development of human-machine interaction systems is discussed.

| S-EPMC6705796 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data