Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Minimal Increase Network Coding for Dynamic Networks.

ABSTRACT: Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery.

SUBMITTER: Zhang G

PROVIDER: S-EPMC4750993 | biostudies-literature | 2016

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Minimal Increase Network Coding for Dynamic Networks.

Zhang Guoyin G Fan Xu X Wu Yanxia Y

PloS one 20160211 2

Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the bl ...[more]

PMID: 26867211

Similar Datasets

Acetylcholine Mediates Dynamic Switching Between Information Coding Schemes in Neuronal Networks.

Project description:Rate coding and phase coding are the two major coding modes seen in the brain. For these two modes, network dynamics must either have a wide distribution of frequencies for rate coding, or a narrow one to achieve stability in phase dynamics for phase coding. Acetylcholine (ACh) is a potent regulator of neural excitability. Acting through the muscarinic receptor, ACh reduces the magnitude of the potassium M-current, a hyperpolarizing current that builds up as neurons fire. The M-current contributes to several excitability features of neurons, becoming a major player in facilitating the transition between Type 1 (integrator) and Type 2 (resonator) excitability. In this paper we argue that this transition enables a dynamic switch between rate coding and phase coding as levels of ACh release change. When a network is in a high ACh state variations in synaptic inputs will lead to a wider distribution of firing rates across the network and this distribution will reflect the network structure or pattern of external input to the network. When ACh is low, network frequencies become narrowly distributed and the structure of a network or pattern of external inputs will be represented through phase relationships between firing neurons. This work provides insights into how modulation of neuronal features influences network dynamics and information processing across brain states.

| S-EPMC6861375 | biostudies-literature

Gender, Friendship Networks, and Delinquency: A Dynamic Network Approach.

Project description:Researchers have examined selection and influence processes in shaping delinquency similarity among friends, but little is known about the role of gender in moderating these relationships. Our objective is to examine differences between adolescent boys and girls regarding delinquency-based selection and influence processes. Using longitudinal network data from adolescents attending two large schools in AddHealth (N = 1,857) and stochastic actor-oriented models, we evaluate whether girls are influenced to a greater degree by friends' violence or delinquency than boys (influence hypothesis) and whether girls are more likely to select friends based on violent or delinquent behavior than boys (selection hypothesis). The results indicate that girls are more likely than boys to be influenced by their friends' involvement in violence. Although a similar pattern emerges for nonviolent delinquency, the gender differences are not significant. Some evidence shows that boys are influenced toward increasing their violence or delinquency when exposed to more delinquent or violent friends but are immune to reducing their violence or delinquency when associating with less violent or delinquent friends. In terms of selection dynamics, although both boys and girls have a tendency to select friends based on friends' behavior, girls have a stronger tendency to do so, suggesting that among girls, friends' involvement in violence or delinquency is an especially decisive factor for determining friendship ties.

| S-EPMC4469075 | biostudies-literature

Dynamic network coding of working-memory domains and working-memory processes.

Project description:The classic mapping of distinct aspects of working memory (WM) to mutually exclusive brain areas is at odds with the distributed processing mechanisms proposed by contemporary network science theory. Here, we use machine-learning to determine how aspects of WM are dynamically coded in the human brain. Using cross-validation across independent fMRI studies, we demonstrate that stimulus domains (spatial, number and fractal) and WM processes (encode, maintain, probe) are classifiable with high accuracy from the patterns of network activity and connectivity that they evoke. This is the case even when focusing on 'multiple demands' brain regions, which are active across all WM conditions. Contrary to early neuropsychological perspectives, these aspects of WM do not map exclusively to brain areas or processing streams; however, the mappings from that literature form salient features within the corresponding multivariate connectivity patterns. Furthermore, connectivity patterns provide the most precise basis for classification and become fine-tuned as maintenance load increases. These results accord with a network-coding mechanism, where the same brain regions support diverse WM demands by adopting different connectivity states.

| S-EPMC6389921 | biostudies-literature

Unraveling neural coding of dynamic natural visual scenes via convolutional recurrent neural networks.

Project description:Traditional models of retinal system identification analyze the neural response to artificial stimuli using models consisting of predefined components. The model design is limited to prior knowledge, and the artificial stimuli are too simple to be compared with stimuli processed by the retina. To fill in this gap with an explainable model that reveals how a population of neurons work together to encode the larger field of natural scenes, here we used a deep-learning model for identifying the computational elements of the retinal circuit that contribute to learning the dynamics of natural scenes. Experimental results verify that the recurrent connection plays a key role in encoding complex dynamic visual scenes while learning biological computational underpinnings of the retinal circuit. In addition, the proposed models reveal both the shapes and the locations of the spatiotemporal receptive fields of ganglion cells.

| S-EPMC8515013 | biostudies-literature

Digital coding of mechanical stress in a dynamic covalent shape memory polymer network.

Project description:Controlling stresses in materials presents many unusual opportunities for their engineering applications. The potential for current approaches is severely limited by the intrinsic tie between the stress and the geometric shape. Here, we report a material concept that allows stress management in a highly efficient digital manner while decoupling the stress and the geometric shape. This is realized in a dynamic covalent shape memory polymer network, for which the elastic shape memory sets the baseline stress level and maintains the geometric shape while the plasticity enabled by the dynamic bond exchange allows stress tuning. With a digital gray scale photothermal mechanism, any arbitrarily defined stress distribution can be created in a free-standing polymer film. The naturally invisible stresses can be further visualized as mechanical colors under polarized light, revealing its potential for encoding hidden information. Our approach expands the technological potential in many areas for which stresses are relevant.

| S-EPMC6167378 | biostudies-literature

Striatal hub of dynamic and stabilized prediction coding in forebrain networks for olfactory reinforcement learning.

Project description:Identifying the circuits responsible for cognition and understanding their embedded computations is a challenge for neuroscience. We establish here a hierarchical cross-scale approach, from behavioral modeling and fMRI in task-performing mice to cellular recordings, in order to disentangle local network contributions to olfactory reinforcement learning. At mesoscale, fMRI identifies a functional olfactory-striatal network interacting dynamically with higher-order cortices. While primary olfactory cortices respectively contribute only some value components, the downstream olfactory tubercle of the ventral striatum expresses comprehensively reward prediction, its dynamic updating, and prediction error components. In the tubercle, recordings reveal two underlying neuronal populations with non-redundant reward prediction coding schemes. One population collectively produces stabilized predictions as distributed activity across neurons; in the other, neurons encode value individually and dynamically integrate the recent history of uncertain outcomes. These findings validate a cross-scale approach to mechanistic investigations of higher cognitive functions in rodents.

| S-EPMC9177857 | biostudies-literature

Application of dynamic expansion tree for finding large network motifs in biological networks.

Project description:Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks, classification of networks into super-families, and protein function annotation. However, identification of large network motifs is a challenging task as it involves the graph isomorphism problem. Although this problem has been studied extensively in the literature using different computational approaches, still there is a lot of scope for improvement. Motivated by the challenges involved in this field, an efficient and scalable network motif finding algorithm using a dynamic expansion tree is proposed. The novelty of the proposed algorithm is that it avoids computationally expensive graph isomorphism tests and overcomes the space limitation of the static expansion tree (SET) which makes it enable to find large motifs. In this algorithm, the embeddings corresponding to a child node of the expansion tree are obtained from the embeddings of a parent node, either by adding a vertex or by adding an edge. This process does not involve any graph isomorphism check. The time complexity of vertex addition and edge addition are O(n) and O(1), respectively. The growth of a dynamic expansion tree (DET) depends on the availability of patterns in the target network. Pruning of branches in the DET significantly reduces the space requirement of the SET. The proposed algorithm has been tested on a protein-protein interaction network obtained from the MINT database. The proposed algorithm is able to identify large network motifs faster than most of the existing motif finding algorithms.

| S-EPMC6526900 | biostudies-literature

Hidden Markov induced Dynamic Bayesian Network for recovering time evolving gene regulatory networks.

Project description:Dynamic Bayesian Networks (DBN) have been widely used to recover gene regulatory relationships from time-series data in computational systems biology. Its standard assumption is 'stationarity', and therefore, several research efforts have been recently proposed to relax this restriction. However, those methods suffer from three challenges: long running time, low accuracy and reliance on parameter settings. To address these problems, we propose a novel non-stationary DBN model by extending each hidden node of Hidden Markov Model into a DBN (called HMDBN), which properly handles the underlying time-evolving networks. Correspondingly, an improved structural EM algorithm is proposed to learn the HMDBN. It dramatically reduces searching space, thereby substantially improving computational efficiency. Additionally, we derived a novel generalized Bayesian Information Criterion under the non-stationary assumption (called BWBIC), which can help significantly improve the reconstruction accuracy and largely reduce over-fitting. Moreover, the re-estimation formulas for all parameters of our model are derived, enabling us to avoid reliance on parameter settings. Compared to the state-of-the-art methods, the experimental evaluation of our proposed method on both synthetic and real biological data demonstrates more stably high prediction accuracy and significantly improved computation efficiency, even with no prior knowledge and parameter settings.

| S-EPMC4683538 | biostudies-literature

Minimal fatal shocks in multistable complex networks.

Project description:Multistability is a common phenomenon which naturally occurs in complex networks. Often one of the coexisting stable states can be identified as being the desired one for a particular application. We present here a global approach to identify the minimal perturbation which will instantaneously kick the system out of the basin of attraction of its desired state and hence induce a critical or fatal transition we call shock-tipping. The corresponding Minimal Fatal Shock is a vector whose length can be used as a global stability measure and whose direction in state space allows us to draw conclusions on weaknesses of the network corresponding to critical network motifs. We demonstrate this approach in plant-pollinator networks and the power grid of Great Britain. In both system classes, tree-like substructures appear to be the most vulnerable with respect to the minimal shock perturbation.

| S-EPMC7366637 | biostudies-literature

Tau can switch microtubule network organizations: from random networks to dynamic and stable bundles.

Project description:In neurons, microtubule networks alternate between single filaments and bundled arrays under the influence of effectors controlling their dynamics and organization. Tau is a microtubule bundler that stabilizes microtubules by stimulating growth and inhibiting shrinkage. The mechanisms by which tau organizes microtubule networks remain poorly understood. Here, we studied the self-organization of microtubules growing in the presence of tau isoforms and mutants. The results show that tau's ability to induce stable microtubule bundles requires two hexapeptides located in its microtubule-binding domain and is modulated by its projection domain. Site-specific pseudophosphorylation of tau promotes distinct microtubule organizations: stable single microtubules, stable bundles, or dynamic bundles. Disease-related tau mutations increase the formation of highly dynamic bundles. Finally, cryo-electron microscopy experiments indicate that tau and its variants similarly change the microtubule lattice structure by increasing both the protofilament number and lattice defects. Overall, our results uncover novel phosphodependent mechanisms governing tau's ability to trigger microtubule organization and reveal that disease-related modifications of tau promote specific microtubule organizations that may have a deleterious impact during neurodegeneration.

| S-EPMC5909928 | 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