WorldWideScience

Sample records for randomly rewired networks

  1. Network rewiring dynamics with convergence towards a star network.

    Science.gov (United States)

    Whigham, P A; Dick, G; Parry, M

    2016-10-01

    Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440-442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.

  2. Measuring the evolutionary rewiring of biological networks.

    Directory of Open Access Journals (Sweden)

    Chong Shou

    Full Text Available We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or "rewire", at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of "commonplace" networks such as family trees, co-authorships and linux-kernel function dependencies.

  3. Impact of constrained rewiring on network structure and node dynamics

    Science.gov (United States)

    Rattana, P.; Berthouze, L.; Kiss, I. Z.

    2014-11-01

    In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

  4. Localization of multilayer networks by optimized single-layer rewiring.

    Science.gov (United States)

    Jalan, Sarika; Pradhan, Priodyuti

    2018-04-01

    We study localization properties of principal eigenvectors (PEVs) of multilayer networks (MNs). Starting with a multilayer network corresponding to a delocalized PEV, we rewire the network edges using an optimization technique such that the PEV of the rewired multilayer network becomes more localized. The framework allows us to scrutinize structural and spectral properties of the networks at various localization points during the rewiring process. We show that rewiring only one layer is enough to attain a MN having a highly localized PEV. Our investigation reveals that a single edge rewiring of the optimized MN can lead to the complete delocalization of a highly localized PEV. This sensitivity in the localization behavior of PEVs is accompanied with the second largest eigenvalue lying very close to the largest one. This observation opens an avenue to gain a deeper insight into the origin of PEV localization of networks. Furthermore, analysis of multilayer networks constructed using real-world social and biological data shows that the localization properties of these real-world multilayer networks are in good agreement with the simulation results for the model multilayer network. This paper is relevant to applications that require understanding propagation of perturbation in multilayer networks.

  5. Network evolution by nonlinear preferential rewiring of edges

    Science.gov (United States)

    Xu, Xin-Jian; Hu, Xiao-Ming; Zhang, Li-Jie

    2011-06-01

    The mathematical framework for small-world networks proposed in a seminal paper by Watts and Strogatz sparked a widespread interest in modeling complex networks in the past decade. However, most of research contributing to static models is in contrast to real-world dynamic networks, such as social and biological networks, which are characterized by rearrangements of connections among agents. In this paper, we study dynamic networks evolved by nonlinear preferential rewiring of edges. The total numbers of vertices and edges of the network are conserved, but edges are continuously rewired according to the nonlinear preference. Assuming power-law kernels with exponents α and β, the network structures in stationary states display a distinct behavior, depending only on β. For β>1, the network is highly heterogeneous with the emergence of starlike structures. For β<1, the network is widely homogeneous with a typical connectivity. At β=1, the network is scale free with an exponential cutoff.

  6. Knowledge-fused differential dependency network models for detecting significant rewiring in biological networks.

    Science.gov (United States)

    Tian, Ye; Zhang, Bai; Hoffman, Eric P; Clarke, Robert; Zhang, Zhen; Shih, Ie-Ming; Xuan, Jianhua; Herrington, David M; Wang, Yue

    2014-07-24

    Modeling biological networks serves as both a major goal and an effective tool of systems biology in studying mechanisms that orchestrate the activities of gene products in cells. Biological networks are context-specific and dynamic in nature. To systematically characterize the selectively activated regulatory components and mechanisms, modeling tools must be able to effectively distinguish significant rewiring from random background fluctuations. While differential networks cannot be constructed by existing knowledge alone, novel incorporation of prior knowledge into data-driven approaches can improve the robustness and biological relevance of network inference. However, the major unresolved roadblocks include: big solution space but a small sample size; highly complex networks; imperfect prior knowledge; missing significance assessment; and heuristic structural parameter learning. To address these challenges, we formulated the inference of differential dependency networks that incorporate both conditional data and prior knowledge as a convex optimization problem, and developed an efficient learning algorithm to jointly infer the conserved biological network and the significant rewiring across different conditions. We used a novel sampling scheme to estimate the expected error rate due to "random" knowledge. Based on that scheme, we developed a strategy that fully exploits the benefit of this data-knowledge integrated approach. We demonstrated and validated the principle and performance of our method using synthetic datasets. We then applied our method to yeast cell line and breast cancer microarray data and obtained biologically plausible results. The open-source R software package and the experimental data are freely available at http://www.cbil.ece.vt.edu/software.htm. Experiments on both synthetic and real data demonstrate the effectiveness of the knowledge-fused differential dependency network in revealing the statistically significant rewiring in biological

  7. Recurrent rewiring and emergence of RNA regulatory networks.

    Science.gov (United States)

    Wilinski, Daniel; Buter, Natascha; Klocko, Andrew D; Lapointe, Christopher P; Selker, Eric U; Gasch, Audrey P; Wickens, Marvin

    2017-04-04

    Alterations in regulatory networks contribute to evolutionary change. Transcriptional networks are reconfigured by changes in the binding specificity of transcription factors and their cognate sites. The evolution of RNA-protein regulatory networks is far less understood. The PUF (Pumilio and FBF) family of RNA regulatory proteins controls the translation, stability, and movements of hundreds of mRNAs in a single species. We probe the evolution of PUF-RNA networks by direct identification of the mRNAs bound to PUF proteins in budding and filamentous fungi and by computational analyses of orthologous RNAs from 62 fungal species. Our findings reveal that PUF proteins gain and lose mRNAs with related and emergent biological functions during evolution. We demonstrate at least two independent rewiring events for PUF3 orthologs, independent but convergent evolution of PUF4/5 binding specificity and the rewiring of the PUF4/5 regulons in different fungal lineages. These findings demonstrate plasticity in RNA regulatory networks and suggest ways in which their rewiring occurs.

  8. Network evolution: rewiring and signatures of conservation in signaling.

    Directory of Open Access Journals (Sweden)

    Mark G F Sun

    Full Text Available The analysis of network evolution has been hampered by limited availability of protein interaction data for different organisms. In this study, we investigate evolutionary mechanisms in Src Homology 3 (SH3 domain and kinase interaction networks using high-resolution specificity profiles. We constructed and examined networks for 23 fungal species ranging from Saccharomyces cerevisiae to Schizosaccharomyces pombe. We quantify rates of different rewiring mechanisms and show that interaction change through binding site evolution is faster than through gene gain or loss. We found that SH3 interactions evolve swiftly, at rates similar to those found in phosphoregulation evolution. Importantly, we show that interaction changes are sufficiently rapid to exhibit saturation phenomena at the observed timescales. Finally, focusing on the SH3 interaction network, we observe extensive clustering of binding sites on target proteins by SH3 domains and a strong correlation between the number of domains that bind a target protein (target in-degree and interaction conservation. The relationship between in-degree and interaction conservation is driven by two different effects, namely the number of clusters that correspond to interaction interfaces and the number of domains that bind to each cluster leads to sequence specific conservation, which in turn results in interaction conservation. In summary, we uncover several network evolution mechanisms likely to generalize across peptide recognition modules.

  9. Development of structural correlations and synchronization from adaptive rewiring in networks of Kuramoto oscillators

    Science.gov (United States)

    Papadopoulos, Lia; Kim, Jason Z.; Kurths, Jürgen; Bassett, Danielle S.

    2017-07-01

    Synchronization of non-identical oscillators coupled through complex networks is an important example of collective behavior, and it is interesting to ask how the structural organization of network interactions influences this process. Several studies have explored and uncovered optimal topologies for synchronization by making purposeful alterations to a network. On the other hand, the connectivity patterns of many natural systems are often not static, but are rather modulated over time according to their dynamics. However, this co-evolution and the extent to which the dynamics of the individual units can shape the organization of the network itself are less well understood. Here, we study initially randomly connected but locally adaptive networks of Kuramoto oscillators. In particular, the system employs a co-evolutionary rewiring strategy that depends only on the instantaneous, pairwise phase differences of neighboring oscillators, and that conserves the total number of edges, allowing the effects of local reorganization to be isolated. We find that a simple rule—which preserves connections between more out-of-phase oscillators while rewiring connections between more in-phase oscillators—can cause initially disordered networks to organize into more structured topologies that support enhanced synchronization dynamics. We examine how this process unfolds over time, finding a dependence on the intrinsic frequencies of the oscillators, the global coupling, and the network density, in terms of how the adaptive mechanism reorganizes the network and influences the dynamics. Importantly, for large enough coupling and after sufficient adaptation, the resulting networks exhibit interesting characteristics, including degree-frequency and frequency-neighbor frequency correlations. These properties have previously been associated with optimal synchronization or explosive transitions in which the networks were constructed using global information. On the contrary, by

  10. Resilience and rewiring of the passenger airline networks in the United States

    Science.gov (United States)

    Wuellner, Daniel R.; Roy, Soumen; D'Souza, Raissa M.

    2010-11-01

    The air transportation network, a fundamental component of critical infrastructure, is formed from a collection of individual air carriers, each one with a methodically designed and engineered network structure. We analyze the individual structures of the seven largest passenger carriers in the USA and find that networks with dense interconnectivity, as quantified by large k cores for high values of k , are extremely resilient to both targeted removal of airports (nodes) and random removal of flight paths (edges). Such networks stay connected and incur minimal increase in an heuristic travel time despite removal of a majority of nodes or edges. Similar results are obtained for targeted removal based on either node degree or centrality. We introduce network rewiring schemes that boost resilience to different levels of perturbation while preserving total number of flight and gate requirements. Recent studies have focused on the asymptotic optimality of hub-and-spoke spatial networks under normal operating conditions, yet our results indicate that point-to-point architectures can be much more resilient to perturbations.

  11. Dynamics of the cell-cycle network under genome-rewiring perturbations

    International Nuclear Information System (INIS)

    Katzir, Yair; Elhanati, Yuval; Braun, Erez; Averbukh, Inna

    2013-01-01

    The cell-cycle progression is regulated by a specific network enabling its ordered dynamics. Recent experiments supported by computational models have shown that a core of genes ensures this robust cycle dynamics. However, much less is known about the direct interaction of the cell-cycle regulators with genes outside of the cell-cycle network, in particular those of the metabolic system. Following our recent experimental work, we present here a model focusing on the dynamics of the cell-cycle core network under rewiring perturbations. Rewiring is achieved by placing an essential metabolic gene exclusively under the regulation of a cell-cycle's promoter, forcing the cell-cycle network to function under a multitasking challenging condition; operating in parallel the cell-cycle progression and a metabolic essential gene. Our model relies on simple rate equations that capture the dynamics of the relevant protein–DNA and protein–protein interactions, while making a clear distinction between these two different types of processes. In particular, we treat the cell-cycle transcription factors as limited ‘resources’ and focus on the redistribution of resources in the network during its dynamics. This elucidates the sensitivity of its various nodes to rewiring interactions. The basic model produces the correct cycle dynamics for a wide range of parameters. The simplicity of the model enables us to study the interface between the cell-cycle regulation and other cellular processes. Rewiring a promoter of the network to regulate a foreign gene, forces a multitasking regulatory load. The higher the load on the promoter, the longer is the cell-cycle period. Moreover, in agreement with our experimental results, the model shows that different nodes of the network exhibit variable susceptibilities to the rewiring perturbations. Our model suggests that the topology of the cell-cycle core network ensures its plasticity and flexible interface with other cellular processes

  12. Effects of rewiring strategies on information spreading in complex dynamic networks

    Science.gov (United States)

    Ally, Abdulla F.; Zhang, Ning

    2018-04-01

    Recent advances in networks and communication services have attracted much interest to understand information spreading in social networks. Consequently, numerous studies have been devoted to provide effective and accurate models for mimicking information spreading. However, knowledge on how to spread information faster and more widely remains a contentious issue. Yet, most existing works are based on static networks which limit the reality of dynamism of entities that participate in information spreading. Using the SIR epidemic model, this study explores and compares effects of two rewiring models (Fermi-Dirac and Linear functions) on information spreading in scale free and small world networks. Our results show that for all the rewiring strategies, the spreading influence replenishes with time but stabilizes in a steady state at later time-steps. This means that information spreading takes-off during the initial spreading steps, after which the spreading prevalence settles toward its equilibrium, with majority of the population having recovered and thus, no longer affecting the spreading. Meanwhile, rewiring strategy based on Fermi-Dirac distribution function in one way or another impedes the spreading process, however, the structure of the networks mimic the spreading, even with a low spreading rate. The worst case can be when the spreading rate is extremely small. The results emphasize that despite a big role of such networks in mimicking the spreading, the role of the parameters cannot be simply ignored. Apparently, the probability of giant degree neighbors being informed grows much faster with the rewiring strategy of linear function compared to that of Fermi-Dirac distribution function. Clearly, rewiring model based on linear function generates the fastest spreading across the networks. Therefore, if we are interested in speeding up the spreading process in stochastic modeling, linear function may play a pivotal role.

  13. Rewiring the network. What helps an innovation to diffuse?

    International Nuclear Information System (INIS)

    Sznajd-Weron, Katarzyna; Szwabiński, Janusz; Weron, Rafał; Weron, Tomasz

    2014-01-01

    A fundamental question related to innovation diffusion is how the structure of the social network influences the process. Empirical evidence regarding real-world networks of influence is very limited. On the other hand, agent-based modeling literature reports different, and at times seemingly contradictory, results. In this paper we study innovation diffusion processes for a range of Watts–Strogatz networks in an attempt to shed more light on this problem. Using the so-called Sznajd model as the backbone of opinion dynamics, we find that the published results are in fact consistent and allow us to predict the role of network topology in various situations. In particular, the diffusion of innovation is easier on more regular graphs, i.e. with a higher clustering coefficient. Moreover, in the case of uncertainty—which is particularly high for innovations connected to public health programs or ecological campaigns—a more clustered network will help the diffusion. On the other hand, when social influence is less important (i.e. in the case of perfect information), a shorter path will help the innovation to spread in the society and—as a result—the diffusion will be easiest on a random graph. (paper)

  14. Topological, functional, and dynamic properties of the protein interaction networks rewired by benzo(a)pyrene

    International Nuclear Information System (INIS)

    Ba, Qian; Li, Junyang; Huang, Chao; Li, Jingquan; Chu, Ruiai; Wu, Yongning; Wang, Hui

    2015-01-01

    Benzo(a)pyrene is a common environmental and foodborne pollutant that has been identified as a human carcinogen. Although the carcinogenicity of benzo(a)pyrene has been extensively reported, its precise molecular mechanisms and the influence on system-level protein networks are not well understood. To investigate the system-level influence of benzo(a)pyrene on protein interactions and regulatory networks, a benzo(a)pyrene-rewired protein interaction network was constructed based on 769 key proteins derived from more than 500 literature reports. The protein interaction network rewired by benzo(a)pyrene was a scale-free, highly-connected biological system. Ten modules were identified, and 25 signaling pathways were enriched, most of which belong to the human diseases category, especially cancer and infectious disease. In addition, two lung-specific and two liver-specific pathways were identified. Three pathways were specific in short and medium-term networks (< 48 h), and five pathways were enriched only in the medium-term network (6 h–48 h). Finally, the expression of linker genes in the network was validated by Western blotting. These findings establish the overall, tissue- and time-specific benzo(a)pyrene-rewired protein interaction networks and provide insights into the biological effects and molecular mechanisms of action of benzo(a)pyrene. - Highlights: • Benzo(a)pyrene induced scale-free, highly-connected protein interaction networks. • 25 signaling pathways were enriched through modular analysis. • Tissue- and time-specific pathways were identified

  15. Topological, functional, and dynamic properties of the protein interaction networks rewired by benzo(a)pyrene

    Energy Technology Data Exchange (ETDEWEB)

    Ba, Qian [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); Li, Junyang; Huang, Chao [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Li, Jingquan; Chu, Ruiai [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); Wu, Yongning, E-mail: wuyongning@cfsa.net.cn [Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); Wang, Hui, E-mail: huiwang@sibs.ac.cn [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); School of Life Science and Technology, ShanghaiTech University, Shanghai (China)

    2015-03-01

    Benzo(a)pyrene is a common environmental and foodborne pollutant that has been identified as a human carcinogen. Although the carcinogenicity of benzo(a)pyrene has been extensively reported, its precise molecular mechanisms and the influence on system-level protein networks are not well understood. To investigate the system-level influence of benzo(a)pyrene on protein interactions and regulatory networks, a benzo(a)pyrene-rewired protein interaction network was constructed based on 769 key proteins derived from more than 500 literature reports. The protein interaction network rewired by benzo(a)pyrene was a scale-free, highly-connected biological system. Ten modules were identified, and 25 signaling pathways were enriched, most of which belong to the human diseases category, especially cancer and infectious disease. In addition, two lung-specific and two liver-specific pathways were identified. Three pathways were specific in short and medium-term networks (< 48 h), and five pathways were enriched only in the medium-term network (6 h–48 h). Finally, the expression of linker genes in the network was validated by Western blotting. These findings establish the overall, tissue- and time-specific benzo(a)pyrene-rewired protein interaction networks and provide insights into the biological effects and molecular mechanisms of action of benzo(a)pyrene. - Highlights: • Benzo(a)pyrene induced scale-free, highly-connected protein interaction networks. • 25 signaling pathways were enriched through modular analysis. • Tissue- and time-specific pathways were identified.

  16. Dreams Rewired

    DEFF Research Database (Denmark)

    Thomsen, Bodil Marie Stavning; Luksch, Manu

    2016-01-01

    Bidraget kommenterer filmen Dreams Rewired og skaber refleksive spor i det vidt forgrenede film-arkiviske materiale om mere end et århundredes tele- og real-time kommunikation, hvor kropslig bevægelse bl.a gøres til data.......Bidraget kommenterer filmen Dreams Rewired og skaber refleksive spor i det vidt forgrenede film-arkiviske materiale om mere end et århundredes tele- og real-time kommunikation, hvor kropslig bevægelse bl.a gøres til data....

  17. Can rewiring strategy control the epidemic spreading?

    Science.gov (United States)

    Dong, Chao; Yin, Qiuju; Liu, Wenyang; Yan, Zhijun; Shi, Tianyu

    2015-11-01

    Relation existed in the social contact network can affect individuals' behaviors greatly. Considering the diversity of relation intimacy among network nodes, an epidemic propagation model is proposed by incorporating the link-breaking threshold, which is normally neglected in the rewiring strategy. The impact of rewiring strategy on the epidemic spreading in the weighted adaptive network is explored. The results show that the rewiring strategy cannot always control the epidemic prevalence, especially when the link-breaking threshold is low. Meanwhile, as well as strong links, weak links also play a significant role on epidemic spreading.

  18. A UV-Induced Genetic Network Links the RSC Complex to Nucleotide Excision Repair and Shows Dose-Dependent Rewiring

    Directory of Open Access Journals (Sweden)

    Rohith Srivas

    2013-12-01

    Full Text Available Efficient repair of UV-induced DNA damage requires the precise coordination of nucleotide excision repair (NER with numerous other biological processes. To map this crosstalk, we generated a differential genetic interaction map centered on quantitative growth measurements of >45,000 double mutants before and after different doses of UV radiation. Integration of genetic data with physical interaction networks identified a global map of 89 UV-induced functional interactions among 62 protein complexes, including a number of links between the RSC complex and several NER factors. We show that RSC is recruited to both silenced and transcribed loci following UV damage where it facilitates efficient repair by promoting nucleosome remodeling. Finally, a comparison of the response to high versus low levels of UV shows that the degree of genetic rewiring correlates with dose of UV and reveals a network of dose-specific interactions. This study makes available a large resource of UV-induced interactions, and it illustrates a methodology for identifying dose-dependent interactions based on quantitative shifts in genetic networks.

  19. Impact of Bounded Noise and Rewiring on the Formation and Instability of Spiral Waves in a Small-World Network of Hodgkin-Huxley Neurons.

    Science.gov (United States)

    Yao, Yuangen; Deng, Haiyou; Ma, Chengzhang; Yi, Ming; Ma, Jun

    2017-01-01

    Spiral waves are observed in the chemical, physical and biological systems, and the emergence of spiral waves in cardiac tissue is linked to some diseases such as heart ventricular fibrillation and epilepsy; thus it has importance in theoretical studies and potential medical applications. Noise is inevitable in neuronal systems and can change the electrical activities of neuron in different ways. Many previous theoretical studies about the impacts of noise on spiral waves focus an unbounded Gaussian noise and even colored noise. In this paper, the impacts of bounded noise and rewiring of network on the formation and instability of spiral waves are discussed in small-world (SW) network of Hodgkin-Huxley (HH) neurons through numerical simulations, and possible statistical analysis will be carried out. Firstly, we present SW network of HH neurons subjected to bounded noise. Then, it is numerically demonstrated that bounded noise with proper intensity σ, amplitude A, or frequency f can facilitate the formation of spiral waves when rewiring probability p is below certain thresholds. In other words, bounded noise-induced resonant behavior can occur in the SW network of neurons. In addition, rewiring probability p always impairs spiral waves, while spiral waves are confirmed to be robust for small p, thus shortcut-induced phase transition of spiral wave with the increase of p is induced. Furthermore, statistical factors of synchronization are calculated to discern the phase transition of spatial pattern, and it is confirmed that larger factor of synchronization is approached with increasing of rewiring probability p, and the stability of spiral wave is destroyed.

  20. Robust Regression Analysis of GCMS Data Reveals Differential Rewiring of Metabolic Networks in Hepatitis B and C Patients

    Directory of Open Access Journals (Sweden)

    Cedric Simillion

    2017-10-01

    Full Text Available About one in 15 of the world’s population is chronically infected with either hepatitis virus B (HBV or C (HCV, with enormous public health consequences. The metabolic alterations caused by these infections have never been directly compared and contrasted. We investigated groups of HBV-positive, HCV-positive, and uninfected healthy controls using gas chromatography-mass spectrometry analyses of their plasma and urine. A robust regression analysis of the metabolite data was conducted to reveal correlations between metabolite pairs. Ten metabolite correlations appeared for HBV plasma and urine, with 18 for HCV plasma and urine, none of which were present in the controls. Metabolic perturbation networks were constructed, which permitted a differential view of the HBV- and HCV-infected liver. HBV hepatitis was consistent with enhanced glucose uptake, glycolysis, and pentose phosphate pathway metabolism, the latter using xylitol and producing threonic acid, which may also be imported by glucose transporters. HCV hepatitis was consistent with impaired glucose uptake, glycolysis, and pentose phosphate pathway metabolism, with the tricarboxylic acid pathway fueled by branched-chain amino acids feeding gluconeogenesis and the hepatocellular loss of glucose, which most probably contributed to hyperglycemia. It is concluded that robust regression analyses can uncover metabolic rewiring in disease states.

  1. Cytotoxic Vibrio T3SS1 Rewires Host Gene Expression to Subvert Cell Death Signaling and Activate Cell Survival Networks

    Science.gov (United States)

    De Nisco, Nicole J.; Kanchwala, Mohammed; Li, Peng; Fernandez, Jessie; Xing, Chao; Orth, Kim

    2017-01-01

    Bacterial effectors are potent manipulators of host signaling pathways. The marine bacterium Vibrio parahaemolyticus (V. para), delivers effectors into host cells through two type three secretion systems (T3SS). The ubiquitous T3SS1 is vital for V. para survival in the environment, whereas T3SS2 causes acute gastroenteritis in human hosts. Although the natural host is undefined, T3SS1 effectors attack highly conserved cellular processes and pathways to orchestrate non-apoptotic cell death. Much is known about how T3SS1 effectors function in isolation, but we wanted to understand how their concerted action globally affects host cell signaling. To assess the host response to T3SS1, we compared gene expression changes over time in primary fibroblasts infected with V. para that have a functional T3SS1 (T3SS1+) to those in cells infected with V. para lacking T3SS1 (T3SS1−). Overall, the host transcriptional response to both T3SS1+ and T3SS1− V. para was rapid, robust, and temporally dynamic. T3SS1 re-wired host gene expression by specifically altering the expression of 398 genes. Although T3SS1 effectors target host cells at the posttranslational level to cause cytotoxicity, network analysis indicated that V. para T3SS1 also precipitates a host transcriptional response that initially activates cell survival and represses cell death networks. The increased expression of several key pro-survival transcripts mediated by T3SS1 was dependent on a host signaling pathway that is silenced later in infection by the posttranslational action of T3SS1. Taken together, our analysis reveals a complex interplay between roles of T3SS1 as both a transcriptional and posttranslational manipulator of host cell signaling. PMID:28512145

  2. Kinome-wide Decoding of Network-Attacking Mutations Rewiring Cancer Signaling

    DEFF Research Database (Denmark)

    Creixell, Pau; Schoof, Erwin M; Simpson, Craig D.

    2015-01-01

    Cancer cells acquire pathological phenotypes through accumulation of mutations that perturb signaling networks. However, global analysis of these events is currently limited. Here, we identify six types of network-attacking mutations (NAMs), including changes in kinase and SH2 modulation, network...... and experimentally validated several NAMs, including PKCγ M501I and PKD1 D665N, which encode specificity switches analogous to the appearance of kinases de novo within the kinome. We discover mutant molecular logic gates, a drift toward phospho-threonine signaling, weakening of phosphorylation motifs, and kinase...

  3. Search for the non-canonical Ising spin glass on rewired square lattices

    Science.gov (United States)

    Surungan, Tasrief

    2018-03-01

    A spin glass (SG) of non-canonical type is a purely antiferromagnetic (AF) system, exemplified by the AF Ising model on a scale free network (SFN), studied by Bartolozzi et al. [ Phys. Rev. B73, 224419 (2006)]. Frustration in this new type of SG is rendered by topological factor and its randomness is caused by random connectivity. As an SFN corresponds to a large dimensional lattice, finding non-canonical SG in lattice with physical dimension is desireable. However, a regular lattice can not have random connectivity. In order to obtain lattices with random connection and preserving the notion of finite dimension, we costructed rewired lattices. We added some extra bonds randomly connecting each site of a regular lattice to its next-nearest neighbors. Very recently, Surungan et al., studied AF Heisenberg system on rewired square lattice and found no SG behavior [AIP Conf. Proc. 1719, 030006 (2016)]. Due to the importance of discrete symmetry for phase transition, here we study similar structure for the Ising model (Z 2 symmetry). We used Monte Carlo simulation with Replica Exchange algorithm. Two types of structures were studied, firstly, the rewired square lattices with one extra bonds added to each site, and secondly, two bonds added to each site. We calculated the Edwards-Anderson paremeter, the commonly used parameter in searching for SG phase. The non-canonical SG is clearly observed in the rewired square lattice with two extra bonds added.

  4. Complex networks: Effect of subtle changes in nature of randomness

    Science.gov (United States)

    Goswami, Sanchari; Biswas, Soham; Sen, Parongama

    2011-03-01

    In two different classes of network models, namely, the Watts Strogatz type and the Euclidean type, subtle changes have been introduced in the randomness. In the Watts Strogatz type network, rewiring has been done in different ways and although the qualitative results remain the same, finite differences in the exponents are observed. In the Euclidean type networks, where at least one finite phase transition occurs, two models differing in a similar way have been considered. The results show a possible shift in one of the phase transition points but no change in the values of the exponents. The WS and Euclidean type models are equivalent for extreme values of the parameters; we compare their behaviour for intermediate values.

  5. Gossip in Random Networks

    Science.gov (United States)

    Malarz, K.; Szvetelszky, Z.; Szekf, B.; Kulakowski, K.

    2006-11-01

    We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erd{õ}s and Rényi. In this theory, a network is characterized by two parameters: the size N and the link probability p. Our experimental data suggest three levels of social inclusion of friendship. The critical value pc, for which half of agents are informed, scales with the system size as N-gamma with gamma approx 0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of the correlations between neighbors is also evaluated: with increasing clustering coefficient C, X decreases.

  6. Random catalytic reaction networks

    Science.gov (United States)

    Stadler, Peter F.; Fontana, Walter; Miller, John H.

    1993-03-01

    We study networks that are a generalization of replicator (or Lotka-Volterra) equations. They model the dynamics of a population of object types whose binary interactions determine the specific type of interaction product. Such a system always reduces its dimension to a subset that contains production pathways for all of its members. The network equation can be rewritten at a level of collectives in terms of two basic interaction patterns: replicator sets and cyclic transformation pathways among sets. Although the system contains well-known cases that exhibit very complicated dynamics, the generic behavior of randomly generated systems is found (numerically) to be extremely robust: convergence to a globally stable rest point. It is easy to tailor networks that display replicator interactions where the replicators are entire self-sustaining subsystems, rather than structureless units. A numerical scan of random systems highlights the special properties of elementary replicators: they reduce the effective interconnectedness of the system, resulting in enhanced competition, and strong correlations between the concentrations.

  7. Generating random networks and graphs

    CERN Document Server

    Coolen, Ton; Roberts, Ekaterina

    2017-01-01

    This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

  8. Organization of growing random networks

    International Nuclear Information System (INIS)

    Krapivsky, P. L.; Redner, S.

    2001-01-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A k . When A k grows more slowly than linearly with k, the number of nodes with k links, N k (t), decays faster than a power law in k, while for A k growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A k is asymptotically linear, N k (t)∼tk -ν , with ν dependent on details of the attachment probability, but in the range 2 -2 power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network

  9. Organization of growing random networks

    Energy Technology Data Exchange (ETDEWEB)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.

  10. Hierarchy in directed random networks.

    Science.gov (United States)

    Mones, Enys

    2013-02-01

    In recent years, the theory and application of complex networks have been quickly developing in a markable way due to the increasing amount of data from real systems and the fruitful application of powerful methods used in statistical physics. Many important characteristics of social or biological systems can be described by the study of their underlying structure of interactions. Hierarchy is one of these features that can be formulated in the language of networks. In this paper we present some (qualitative) analytic results on the hierarchical properties of random network models with zero correlations and also investigate, mainly numerically, the effects of different types of correlations. The behavior of the hierarchy is different in the absence and the presence of giant components. We show that the hierarchical structure can be drastically different if there are one-point correlations in the network. We also show numerical results suggesting that the hierarchy does not change monotonically with the correlations and there is an optimal level of nonzero correlations maximizing the level of hierarchy.

  11. Ring correlations in random networks.

    Science.gov (United States)

    Sadjadi, Mahdi; Thorpe, M F

    2016-12-01

    We examine the correlations between rings in random network glasses in two dimensions as a function of their separation. Initially, we use the topological separation (measured by the number of intervening rings), but this leads to pseudo-long-range correlations due to a lack of topological charge neutrality in the shells surrounding a central ring. This effect is associated with the noncircular nature of the shells. It is, therefore, necessary to use the geometrical distance between ring centers. Hence we find a generalization of the Aboav-Weaire law out to larger distances, with the correlations between rings decaying away when two rings are more than about three rings apart.

  12. Cross over of recurrence networks to random graphs and random ...

    Indian Academy of Sciences (India)

    2017-01-27

    Jan 27, 2017 ... that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to .... municative [19] or social [20], deviate from the random ..... He has shown that the spatial effects become.

  13. Percolation and epidemics in random clustered networks

    Science.gov (United States)

    Miller, Joel C.

    2009-08-01

    The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree nodes. We introduce a class of random clustered networks and a class of random unclustered networks with the same preferential mixing. Percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.

  14. Gradient networks on uncorrelated random scale-free networks

    International Nuclear Information System (INIS)

    Pan Guijun; Yan Xiaoqing; Huang Zhongbing; Ma Weichuan

    2011-01-01

    Uncorrelated random scale-free (URSF) networks are useful null models for checking the effects of scale-free topology on network-based dynamical processes. Here, we present a comparative study of the jamming level of gradient networks based on URSF networks and Erdos-Renyi (ER) random networks. We find that the URSF networks are less congested than ER random networks for the average degree (k)>k c (k c ∼ 2 denotes a critical connectivity). In addition, by investigating the topological properties of the two kinds of gradient networks, we discuss the relations between the topological structure and the transport efficiency of the gradient networks. These findings show that the uncorrelated scale-free structure might allow more efficient transport than the random structure.

  15. Entropy Characterization of Random Network Models

    Directory of Open Access Journals (Sweden)

    Pedro J. Zufiria

    2017-06-01

    Full Text Available This paper elaborates on the Random Network Model (RNM as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc. and entropy-based complexity measures, providing new insight on the generation and characterization of random networks. Some theoretical and computational results illustrate the utility of the proposed framework.

  16. Statistical properties of random clique networks

    Science.gov (United States)

    Ding, Yi-Min; Meng, Jun; Fan, Jing-Fang; Ye, Fang-Fu; Chen, Xiao-Song

    2017-10-01

    In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial networks, and protein interaction networks, is introduced by combining the random selection rule of the Erdös and Rényi (ER) model and the concept of cliques. We find that random clique networks having a small average degree differ from the ER network in that they have a large clustering coefficient and a power law clustering spectrum, while networks having a high average degree have similar properties as the ER model. In addition, we find that the relation between the clustering coefficient and the average degree shows a non-monotonic behavior and that the degree distributions can be fit by multiple Poisson curves; we explain the origin of such novel behaviors and degree distributions.

  17. Topological properties of random wireless networks

    Indian Academy of Sciences (India)

    Wireless networks in which the node locations are random are best modelled as random geometric graphs (RGGs). In addition to their extensive application in the modelling of wireless networks, RGGs find many new applications and are being studied in their own right. In this paper we first provide a brief introduction to the ...

  18. RMBNToolbox: random models for biochemical networks

    Directory of Open Access Journals (Sweden)

    Niemi Jari

    2007-05-01

    Full Text Available Abstract Background There is an increasing interest to model biochemical and cell biological networks, as well as to the computational analysis of these models. The development of analysis methodologies and related software is rapid in the field. However, the number of available models is still relatively small and the model sizes remain limited. The lack of kinetic information is usually the limiting factor for the construction of detailed simulation models. Results We present a computational toolbox for generating random biochemical network models which mimic real biochemical networks. The toolbox is called Random Models for Biochemical Networks. The toolbox works in the Matlab environment, and it makes it possible to generate various network structures, stoichiometries, kinetic laws for reactions, and parameters therein. The generation can be based on statistical rules and distributions, and more detailed information of real biochemical networks can be used in situations where it is known. The toolbox can be easily extended. The resulting network models can be exported in the format of Systems Biology Markup Language. Conclusion While more information is accumulating on biochemical networks, random networks can be used as an intermediate step towards their better understanding. Random networks make it possible to study the effects of various network characteristics to the overall behavior of the network. Moreover, the construction of artificial network models provides the ground truth data needed in the validation of various computational methods in the fields of parameter estimation and data analysis.

  19. Thermodynamics of random reaction networks.

    Directory of Open Access Journals (Sweden)

    Jakob Fischer

    Full Text Available Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

  20. Thermodynamics of random reaction networks.

    Science.gov (United States)

    Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

    2015-01-01

    Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

  1. Random walks and diffusion on networks

    Science.gov (United States)

    Masuda, Naoki; Porter, Mason A.; Lambiotte, Renaud

    2017-11-01

    Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including diffusion, interactions, and opinions among humans and animals; and can be used to extract information about important entities or dense groups of entities in a network. Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures. In the present article, we survey the theory and applications of random walks on networks, restricting ourselves to simple cases of single and non-adaptive random walkers. We distinguish three main types of random walks: discrete-time random walks, node-centric continuous-time random walks, and edge-centric continuous-time random walks. We first briefly survey random walks on a line, and then we consider random walks on various types of networks. We extensively discuss applications of random walks, including ranking of nodes (e.g., PageRank), community detection, respondent-driven sampling, and opinion models such as voter models.

  2. Random walk centrality for temporal networks

    International Nuclear Information System (INIS)

    Rocha, Luis E C; Masuda, Naoki

    2014-01-01

    Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included. (paper)

  3. Random walk centrality for temporal networks

    Science.gov (United States)

    Rocha, Luis E. C.; Masuda, Naoki

    2014-06-01

    Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included.

  4. Random networks of Boolean cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche

    1990-01-01

    Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).

  5. Random networks of Boolean cellular automata

    International Nuclear Information System (INIS)

    Miranda, Enrique

    1990-01-01

    Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)

  6. Exploring biological network structure with clustered random networks

    Directory of Open Access Journals (Sweden)

    Bansal Shweta

    2009-12-01

    Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

  7. Routing in Networks with Random Topologies

    Science.gov (United States)

    Bambos, Nicholas

    1997-01-01

    We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

  8. Search for the Heisenberg spin glass on rewired cubic lattices with antiferromagnetic interaction

    International Nuclear Information System (INIS)

    Surungan, Tasrief

    2016-01-01

    Spin glass (SG) is a typical magnetic system which is mainly characterized by a frozen random spin orientation at low temperatures. Frustration and randomness are considered to be the key ingredients for the existence of SGs. Previously, Bartolozzi et al . [Phys. Rev. B73, 224419 (2006)] found that the antiferromagnetic (AF) Ising spins on scale free network (SFN) exhibited SG behavior. This is purely AF system, a new type of SG different from the canonical one which requires the presence of both FM and AF couplings. In this new system, frustration is purely due to a topological factor and its randomness is brought by irregular connectivity. Recently, it was reported that the AF Heisenberg model on SFN exhibited SG behavior [Surungan et al ., JPCS, 640, 012005 (2015)/doi:10.1088/1742-6596/640/1/012005]. In order to accommodate the notion of spatial dimension, we further investigated this type of system by studying an AF Heisenberg model on rewired cubic lattices, constructed by adding one extra bond randomly connecting each spin to one of its next-nearest neighbors. We used Replica Exchange algorithm of Monte Carlo Method and calculated the SG order parameter to search for the existence of SG phase. (paper)

  9. Disordered configurations of the Glauber model in two-dimensional networks

    Science.gov (United States)

    Bačić, Iva; Franović, Igor; Perc, Matjaž

    2017-12-01

    We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics fails to reach the ordered state in the thermodynamic limit. Due to the interplay of the perturbed regular topology and the energy neutral stochastic state transitions, the stationary state consists of two intertwined domains, manifested as multiclustered states on the original lattice. Moreover, for intermediate rewiring probabilities, one finds an additional source of disorder due to the low connectivity degree, which gives rise to small isolated droplets of spins. We also examine the ordering process in paradigmatic two-layer networks with heterogeneous rewiring probabilities. Comparing the cases of a multiplex network and the corresponding network with random inter-layer connectivity, we demonstrate that the character of the final state qualitatively depends on the type of inter-layer connections.

  10. Bipartite quantum states and random complex networks

    International Nuclear Information System (INIS)

    Garnerone, Silvano; Zanardi, Paolo; Giorda, Paolo

    2012-01-01

    We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs, we derive an analytic expression for the averaged entanglement entropy S-bar while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling S-bar ∼c log n +g e where both the prefactor c and the sub-leading O(1) term g e are characteristic of the different classes of complex networks. In particular, g e encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool for the analysis of large complex networks with non-trivial topological properties. (paper)

  11. Random walks on generalized Koch networks

    International Nuclear Information System (INIS)

    Sun, Weigang

    2013-01-01

    For deterministically growing networks, it is a theoretical challenge to determine the topological properties and dynamical processes. In this paper, we study random walks on generalized Koch networks with features that include an initial state that is a globally connected network to r nodes. In each step, every existing node produces m complete graphs. We then obtain the analytical expressions for first passage time (FPT), average return time (ART), i.e. the average of FPTs for random walks from node i to return to the starting point i for the first time, and average sending time (AST), defined as the average of FPTs from a hub node to all other nodes, excluding the hub itself with regard to network parameters m and r. For this family of Koch networks, the ART of the new emerging nodes is identical and increases with the parameters m or r. In addition, the AST of our networks grows with network size N as N ln N and also increases with parameter m. The results obtained in this paper are the generalizations of random walks for the original Koch network. (paper)

  12. A random network based, node attraction facilitated network evolution method

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2016-03-01

    Full Text Available In present study, I present a method of network evolution that based on random network, and facilitated by node attraction. In this method, I assume that the initial network is a random network, or a given initial network. When a node is ready to connect, it tends to link to the node already owning the most connections, which coincides with the general rule (Barabasi and Albert, 1999 of node connecting. In addition, a node may randomly disconnect a connection i.e., the addition of connections in the network is accompanied by the pruning of some connections. The dynamics of network evolution is determined of the attraction factor Lamda of nodes, the probability of node connection, the probability of node disconnection, and the expected initial connectance. The attraction factor of nodes, the probability of node connection, and the probability of node disconnection are time and node varying. Various dynamics can be achieved by adjusting these parameters. Effects of simplified parameters on network evolution are analyzed. The changes of attraction factor Lamda can reflect various effects of the node degree on connection mechanism. Even the changes of Lamda only will generate various networks from the random to the complex. Therefore, the present algorithm can be treated as a general model for network evolution. Modeling results show that to generate a power-law type of network, the likelihood of a node attracting connections is dependent upon the power function of the node's degree with a higher-order power. Matlab codes for simplified version of the method are provided.

  13. Search for the Heisenberg spin glass on rewired square lattices with antiferromagnetic interaction

    Energy Technology Data Exchange (ETDEWEB)

    Surungan, Tasrief, E-mail: tasrief@unhas.ac.id; Bansawang, B.J.; Tahir, Dahlang [Department of Physics, Hasanuddin University, Makassar, South Sulawesi 90245 (Indonesia)

    2016-03-11

    Spin glass (SG) is a typical magnetic system with frozen random spin orientation at low temperatures. The system exhibits rich physical properties, such as infinite number of ground states, memory effect, and aging phenomena. There are two main ingredients considered to be pivotal for the existence of SG behavior, namely, frustration and randomness. For the canonical SG system, frustration is led by the presence of competing interaction between ferromagnetic (FM) and antiferromagnetic (AF) couplings. Previously, Bartolozzi et al. [Phys. Rev. B73, 224419 (2006)], reported the SG properties of the AF Ising spins on scale free network (SFN). It is a new type of SG, different from the canonical one which requires the presence of both FM and AF couplings. In this new system, frustration is purely caused by the topological factor and its randomness is related to the irregular connectvity. Recently, Surungan et. al. [Journal of Physics: Conference Series, 640, 012001 (2015)] reported SG bahavior of AF Heisenberg model on SFN. We further investigate this type of system by studying an AF Heisenberg model on rewired square lattices. We used Replica Exchange algorithm of Monte Carlo Method and calculated the SG order parameter to search for the existence of SG phase.

  14. Search for the Heisenberg spin glass on rewired square lattices with antiferromagnetic interaction

    International Nuclear Information System (INIS)

    Surungan, Tasrief; Bansawang, B.J.; Tahir, Dahlang

    2016-01-01

    Spin glass (SG) is a typical magnetic system with frozen random spin orientation at low temperatures. The system exhibits rich physical properties, such as infinite number of ground states, memory effect, and aging phenomena. There are two main ingredients considered to be pivotal for the existence of SG behavior, namely, frustration and randomness. For the canonical SG system, frustration is led by the presence of competing interaction between ferromagnetic (FM) and antiferromagnetic (AF) couplings. Previously, Bartolozzi et al. [Phys. Rev. B73, 224419 (2006)], reported the SG properties of the AF Ising spins on scale free network (SFN). It is a new type of SG, different from the canonical one which requires the presence of both FM and AF couplings. In this new system, frustration is purely caused by the topological factor and its randomness is related to the irregular connectvity. Recently, Surungan et. al. [Journal of Physics: Conference Series, 640, 012001 (2015)] reported SG bahavior of AF Heisenberg model on SFN. We further investigate this type of system by studying an AF Heisenberg model on rewired square lattices. We used Replica Exchange algorithm of Monte Carlo Method and calculated the SG order parameter to search for the existence of SG phase.

  15. Generic Properties of Random Gene Regulatory Networks.

    Science.gov (United States)

    Li, Zhiyuan; Bianco, Simone; Zhang, Zhaoyang; Tang, Chao

    2013-12-01

    Modeling gene regulatory networks (GRNs) is an important topic in systems biology. Although there has been much work focusing on various specific systems, the generic behavior of GRNs with continuous variables is still elusive. In particular, it is not clear typically how attractors partition among the three types of orbits: steady state, periodic and chaotic, and how the dynamical properties change with network's topological characteristics. In this work, we first investigated these questions in random GRNs with different network sizes, connectivity, fraction of inhibitory links and transcription regulation rules. Then we searched for the core motifs that govern the dynamic behavior of large GRNs. We show that the stability of a random GRN is typically governed by a few embedding motifs of small sizes, and therefore can in general be understood in the context of these short motifs. Our results provide insights for the study and design of genetic networks.

  16. Two statistical mechanics aspects of complex networks

    Science.gov (United States)

    Thurner, Stefan; Biely, Christoly

    2006-12-01

    By adopting an ensemble interpretation of non-growing rewiring networks, network theory can be reduced to a counting problem of possible network states and an identification of their associated probabilities. We present two scenarios of how different rewirement schemes can be used to control the state probabilities of the system. In particular, we review how by generalizing the linking rules of random graphs, in combination with superstatistics and quantum mechanical concepts, one can establish an exact relation between the degree distribution of any given network and the nodes’ linking probability distributions. In a second approach, we control state probabilities by a network Hamiltonian, whose characteristics are motivated by biological and socio-economical statistical systems. We demonstrate that a thermodynamics of networks becomes a fully consistent concept, allowing to study e.g. ‘phase transitions’ and computing entropies through thermodynamic relations.

  17. Spectral dimensionality of random superconducting networks

    International Nuclear Information System (INIS)

    Day, A.R.; Xia, W.; Thorpe, M.F.

    1988-01-01

    We compute the spectral dimensionality d of random superconducting-normal networks by directly examining the low-frequency density of states at the percolation threshold. We find that d = 4.1 +- 0.2 and 5.8 +- 0.3 in two and three dimensions, respectively, which confirms the scaling relation d = 2d/(2-s/ν), where s is the superconducting exponent and ν the correlation-length exponent for percolation. We also consider the one-dimensional problem where scaling arguments predict, and our numerical simulations confirm, that d = 0. A simple argument provides an expression for the density of states of the localized high-frequency modes in this special case. We comment on the connection between our calculations and the ''termite'' problem of a random walker on a random superconducting-normal network and point out difficulties in inferring d from simulations of the termite problem

  18. Unraveling spurious properties of interaction networks with tailored random networks.

    Directory of Open Access Journals (Sweden)

    Stephan Bialonski

    Full Text Available We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

  19. Infection dynamics on spatial small-world network models

    Science.gov (United States)

    Iotti, Bryan; Antonioni, Alberto; Bullock, Seth; Darabos, Christian; Tomassini, Marco; Giacobini, Mario

    2017-11-01

    The study of complex networks, and in particular of social networks, has mostly concentrated on relational networks, abstracting the distance between nodes. Spatial networks are, however, extremely relevant in our daily lives, and a large body of research exists to show that the distances between nodes greatly influence the cost and probability of establishing and maintaining a link. A random geometric graph (RGG) is the main type of synthetic network model used to mimic the statistical properties and behavior of many social networks. We propose a model, called REDS, that extends energy-constrained RGGs to account for the synergic effect of sharing the cost of a link with our neighbors, as is observed in real relational networks. We apply both the standard Watts-Strogatz rewiring procedure and another method that conserves the degree distribution of the network. The second technique was developed to eliminate unwanted forms of spatial correlation between the degree of nodes that are affected by rewiring, limiting the effect on other properties such as clustering and assortativity. We analyze both the statistical properties of these two network types and their epidemiological behavior when used as a substrate for a standard susceptible-infected-susceptible compartmental model. We consider and discuss the differences in properties and behavior between RGGs and REDS as rewiring increases and as infection parameters are changed. We report considerable differences both between the network types and, in the case of REDS, between the two rewiring schemes. We conclude that REDS represent, with the application of these rewiring mechanisms, extremely useful and interesting tools in the study of social and epidemiological phenomena in synthetic complex networks.

  20. Recent results for random networks of automata

    International Nuclear Information System (INIS)

    Flyvbjerg, H.

    1987-05-01

    After a very brief historical and contextual introduction to random networks of automata we review recent numerical and analytical results. Open questions and unsolved problems are pointed out and discussed. One such question is also answered: it is shown that the size of the stable core can be used as order parameter for a transition between phases of frozen and chaotic network behavior. A mean-field-like but exact selfconsistency equation for the size of the stable core is given. A new derivation of critical parameter values follows from it. (orig.)

  1. Quantum games on evolving random networks

    OpenAIRE

    Pawela, Łukasz

    2015-01-01

    We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits of quantum strategies for the prisoner's dilemma game. For the other two games, we obtain regions of parameters where the quantum strategies dominate, as well as regions where the classical strategies coexist.

  2. Effects of local and global network connectivity on synergistic epidemics

    Science.gov (United States)

    Broder-Rodgers, David; Pérez-Reche, Francisco J.; Taraskin, Sergei N.

    2015-12-01

    Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

  3. Anomalous Anticipatory Responses in Networked Random Data

    International Nuclear Information System (INIS)

    Nelson, Roger D.; Bancel, Peter A.

    2006-01-01

    We examine an 8-year archive of synchronized, parallel time series of random data from a world spanning network of physical random event generators (REGs). The archive is a publicly accessible matrix of normally distributed 200-bit sums recorded at 1 Hz which extends from August 1998 to the present. The primary question is whether these data show non-random structure associated with major events such as natural or man-made disasters, terrible accidents, or grand celebrations. Secondarily, we examine the time course of apparently correlated responses. Statistical analyses of the data reveal consistent evidence that events which strongly affect people engender small but significant effects. These include suggestions of anticipatory responses in some cases, leading to a series of specialized analyses to assess possible non-random structure preceding precisely timed events. A focused examination of data collected around the time of earthquakes with Richter magnitude 6 and greater reveals non-random structure with a number of intriguing, potentially important features. Anomalous effects in the REG data are seen only when the corresponding earthquakes occur in populated areas. No structure is found if they occur in the oceans. We infer that an important contributor to the effect is the relevance of the earthquake to humans. Epoch averaging reveals evidence for changes in the data some hours prior to the main temblor, suggestive of reverse causation

  4. Creating, generating and comparing random network models with NetworkRandomizer.

    Science.gov (United States)

    Tosadori, Gabriele; Bestvina, Ivan; Spoto, Fausto; Laudanna, Carlo; Scardoni, Giovanni

    2016-01-01

    Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

  5. Cellular plasticity enables adaptation to unforeseen cell-cycle rewiring challenges.

    Directory of Open Access Journals (Sweden)

    Yair Katzir

    Full Text Available The fundamental dynamics of the cell cycle, underlying cell growth and reproduction, were previously found to be robust under a wide range of environmental and internal perturbations. This property was commonly attributed to its network structure, which enables the coordinated interactions among hundreds of proteins. Despite significant advances in deciphering the components and autonomous interactions of this network, understanding the interfaces of the cell cycle with other major cellular processes is still lacking. To gain insight into these interfaces, we used the process of genome-rewiring in yeast by placing an essential metabolic gene HIS3 from the histidine biosynthesis pathway, under the exclusive regulation of different cell-cycle promoters. In a medium lacking histidine and under partial inhibition of the HIS3p, the rewired cells encountered an unforeseen multitasking challenge; the cell-cycle regulatory genes were required to regulate the essential histidine-pathway gene in concert with the other metabolic demands, while simultaneously driving the cell cycle through its proper temporal phases. We show here that chemostat cell populations with rewired cell-cycle promoters adapted within a short time to accommodate the inhibition of HIS3p and stabilized a new phenotypic state. Furthermore, a significant fraction of the population was able to adapt and grow into mature colonies on plates under such inhibiting conditions. The adapted state was shown to be stably inherited across generations. These adaptation dynamics were accompanied by a non-specific and irreproducible genome-wide transcriptional response. Adaptation of the cell-cycle attests to its multitasking capabilities and flexible interface with cellular metabolic processes and requirements. Similar adaptation features were found in our previous work when rewiring HIS3 to the GAL system and switching cells from galactose to glucose. Thus, at the basis of cellular plasticity is

  6. Cellular plasticity enables adaptation to unforeseen cell-cycle rewiring challenges.

    Science.gov (United States)

    Katzir, Yair; Stolovicki, Elad; Stern, Shay; Braun, Erez

    2012-01-01

    The fundamental dynamics of the cell cycle, underlying cell growth and reproduction, were previously found to be robust under a wide range of environmental and internal perturbations. This property was commonly attributed to its network structure, which enables the coordinated interactions among hundreds of proteins. Despite significant advances in deciphering the components and autonomous interactions of this network, understanding the interfaces of the cell cycle with other major cellular processes is still lacking. To gain insight into these interfaces, we used the process of genome-rewiring in yeast by placing an essential metabolic gene HIS3 from the histidine biosynthesis pathway, under the exclusive regulation of different cell-cycle promoters. In a medium lacking histidine and under partial inhibition of the HIS3p, the rewired cells encountered an unforeseen multitasking challenge; the cell-cycle regulatory genes were required to regulate the essential histidine-pathway gene in concert with the other metabolic demands, while simultaneously driving the cell cycle through its proper temporal phases. We show here that chemostat cell populations with rewired cell-cycle promoters adapted within a short time to accommodate the inhibition of HIS3p and stabilized a new phenotypic state. Furthermore, a significant fraction of the population was able to adapt and grow into mature colonies on plates under such inhibiting conditions. The adapted state was shown to be stably inherited across generations. These adaptation dynamics were accompanied by a non-specific and irreproducible genome-wide transcriptional response. Adaptation of the cell-cycle attests to its multitasking capabilities and flexible interface with cellular metabolic processes and requirements. Similar adaptation features were found in our previous work when rewiring HIS3 to the GAL system and switching cells from galactose to glucose. Thus, at the basis of cellular plasticity is the emergence of a yet

  7. The robustness of pollination networks to the loss of species and interactions: a quantitative approach incorporating pollinator behaviour.

    Science.gov (United States)

    Kaiser-Bunbury, Christopher N; Muff, Stefanie; Memmott, Jane; Müller, Christine B; Caflisch, Amedeo

    2010-04-01

    Species extinctions pose serious threats to the functioning of ecological communities worldwide. We used two qualitative and quantitative pollination networks to simulate extinction patterns following three removal scenarios: random removal and systematic removal of the strongest and weakest interactors. We accounted for pollinator behaviour by including potential links into temporal snapshots (12 consecutive 2-week networks) to reflect mutualists' ability to 'switch' interaction partners (re-wiring). Qualitative data suggested a linear or slower than linear secondary extinction while quantitative data showed sigmoidal decline of plant interaction strength upon removal of the strongest interactor. Temporal snapshots indicated greater stability of re-wired networks over static systems. Tolerance of generalized networks to species extinctions was high in the random removal scenario, with an increase in network stability if species formed new interactions. Anthropogenic disturbance, however, that promote the extinction of the strongest interactors might induce a sudden collapse of pollination networks.

  8. Complex network analysis of state spaces for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)

    2008-01-15

    We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.

  9. Complex network analysis of state spaces for random Boolean networks

    International Nuclear Information System (INIS)

    Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya

    2008-01-01

    We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two

  10. Multi-agent coordination in directed moving neighbourhood random networks

    International Nuclear Information System (INIS)

    Yi-Lun, Shang

    2010-01-01

    This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results. (general)

  11. Modeling of contact tracing in social networks

    Science.gov (United States)

    Tsimring, Lev S.; Huerta, Ramón

    2003-07-01

    Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.

  12. Opinion dynamics on an adaptive random network

    Science.gov (United States)

    Benczik, I. J.; Benczik, S. Z.; Schmittmann, B.; Zia, R. K. P.

    2009-04-01

    We revisit the classical model for voter dynamics in a two-party system with two basic modifications. In contrast to the original voter model studied in regular lattices, we implement the opinion formation process in a random network of agents in which interactions are no longer restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion, or rather with opponents. In this way, the network is built in an adaptive manner, in the sense that its structure is correlated and evolves with the dynamics of the agents. The simplicity of the model allows us to examine several issues analytically. We establish criteria to determine whether consensus or polarization will be the outcome of the dynamics and on what time scales these states will be reached. In finite systems consensus is typical, while in infinite systems a disordered metastable state can emerge and persist for infinitely long time before consensus is reached.

  13. Critical behavior of the contact process on small-world networks

    Science.gov (United States)

    Ferreira, Ronan S.; Ferreira, Silvio C.

    2013-11-01

    We investigate the role of clustering on the critical behavior of the contact process (CP) on small-world networks using the Watts-Strogatz (WS) network model with an edge rewiring probability p. The critical point is well predicted by a homogeneous cluster-approximation for the limit of vanishing clustering ( p → 1). The critical exponents and dimensionless moment ratios of the CP are in agreement with those predicted by the mean-field theory for any p > 0. This independence on the network clustering shows that the small-world property is a sufficient condition for the mean-field theory to correctly predict the universality of the model. Moreover, we compare the CP dynamics on WS networks with rewiring probability p = 1 and random regular networks and show that the weak heterogeneity of the WS network slightly changes the critical point but does not alter other critical quantities of the model.

  14. Small Worlds in the Tree Topologies of Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Qiao, Li; Lingguo, Cui; Baihai, Zhang

    2010-01-01

    In this study, the characteristics of small worlds are investigated in the context of the tree topologies of wireless sensor networks. Tree topologies, which construct spatial graphs with larger characteristic path lengths than random graphs and small clustering coefficients, are ubiquitous...... in wireless sensor networks. Suffering from the link rewiring or the link addition, the characteristic path length of the tree topology reduces rapidly and the clustering coefficient increases greatly. The variety of characteristic path length influences the time synchronization characteristics of wireless...... sensor networks greatly. With the increase of the link rewiring or the link addition probability, the time synchronization error decreases drastically. Two novel protocols named LEACH-SW and TREEPSI-SW are proposed to improve the performances of the sensor networks, in which the small world...

  15. Dynamic defense and network randomization for computer systems

    Science.gov (United States)

    Chavez, Adrian R.; Stout, William M. S.; Hamlet, Jason R.; Lee, Erik James; Martin, Mitchell Tyler

    2018-05-29

    The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissance stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.

  16. Designing neural networks that process mean values of random variables

    International Nuclear Information System (INIS)

    Barber, Michael J.; Clark, John W.

    2014-01-01

    We develop a class of neural networks derived from probabilistic models posed in the form of Bayesian networks. Making biologically and technically plausible assumptions about the nature of the probabilistic models to be represented in the networks, we derive neural networks exhibiting standard dynamics that require no training to determine the synaptic weights, that perform accurate calculation of the mean values of the relevant random variables, that can pool multiple sources of evidence, and that deal appropriately with ambivalent, inconsistent, or contradictory evidence. - Highlights: • High-level neural computations are specified by Bayesian belief networks of random variables. • Probability densities of random variables are encoded in activities of populations of neurons. • Top-down algorithm generates specific neural network implementation of given computation. • Resulting “neural belief networks” process mean values of random variables. • Such networks pool multiple sources of evidence and deal properly with inconsistent evidence

  17. Designing neural networks that process mean values of random variables

    Energy Technology Data Exchange (ETDEWEB)

    Barber, Michael J. [AIT Austrian Institute of Technology, Innovation Systems Department, 1220 Vienna (Austria); Clark, John W. [Department of Physics and McDonnell Center for the Space Sciences, Washington University, St. Louis, MO 63130 (United States); Centro de Ciências Matemáticas, Universidade de Madeira, 9000-390 Funchal (Portugal)

    2014-06-13

    We develop a class of neural networks derived from probabilistic models posed in the form of Bayesian networks. Making biologically and technically plausible assumptions about the nature of the probabilistic models to be represented in the networks, we derive neural networks exhibiting standard dynamics that require no training to determine the synaptic weights, that perform accurate calculation of the mean values of the relevant random variables, that can pool multiple sources of evidence, and that deal appropriately with ambivalent, inconsistent, or contradictory evidence. - Highlights: • High-level neural computations are specified by Bayesian belief networks of random variables. • Probability densities of random variables are encoded in activities of populations of neurons. • Top-down algorithm generates specific neural network implementation of given computation. • Resulting “neural belief networks” process mean values of random variables. • Such networks pool multiple sources of evidence and deal properly with inconsistent evidence.

  18. Search for Directed Networks by Different Random Walk Strategies

    Science.gov (United States)

    Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

    2012-03-01

    A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

  19. Cross over of recurrence networks to random graphs and random ...

    Indian Academy of Sciences (India)

    Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability ...

  20. Domestication rewired gene expression and nucleotide diversity patterns in tomato.

    Science.gov (United States)

    Sauvage, Christopher; Rau, Andrea; Aichholz, Charlotte; Chadoeuf, Joël; Sarah, Gautier; Ruiz, Manuel; Santoni, Sylvain; Causse, Mathilde; David, Jacques; Glémin, Sylvain

    2017-08-01

    Plant domestication has led to considerable phenotypic modifications from wild species to modern varieties. However, although changes in key traits have been well documented, less is known about the underlying molecular mechanisms, such as the reduction of molecular diversity or global gene co-expression patterns. In this study, we used a combination of gene expression and population genetics in wild and crop tomato to decipher the footprints of domestication. We found a set of 1729 differentially expressed genes (DEG) between the two genetic groups, belonging to 17 clusters of co-expressed DEG, suggesting that domestication affected not only individual genes but also regulatory networks. Five co-expression clusters were enriched in functional terms involving carbohydrate metabolism or epigenetic regulation of gene expression. We detected differences in nucleotide diversity between the crop and wild groups specific to DEG. Our study provides an extensive profiling of the rewiring of gene co-expression induced by the domestication syndrome in one of the main crop species. © 2017 The Authors The Plant Journal © 2017 John Wiley & Sons Ltd.

  1. Holographic duality from random tensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Hayden, Patrick; Nezami, Sepehr; Qi, Xiao-Liang; Thomas, Nathaniel; Walter, Michael; Yang, Zhao [Stanford Institute for Theoretical Physics, Department of Physics, Stanford University,382 Via Pueblo, Stanford, CA 94305 (United States)

    2016-11-02

    Tensor networks provide a natural framework for exploring holographic duality because they obey entanglement area laws. They have been used to construct explicit toy models realizing many of the interesting structural features of the AdS/CFT correspondence, including the non-uniqueness of bulk operator reconstruction in the boundary theory. In this article, we explore the holographic properties of networks of random tensors. We find that our models naturally incorporate many features that are analogous to those of the AdS/CFT correspondence. When the bond dimension of the tensors is large, we show that the entanglement entropy of all boundary regions, whether connected or not, obey the Ryu-Takayanagi entropy formula, a fact closely related to known properties of the multipartite entanglement of assistance. We also discuss the behavior of Rényi entropies in our models and contrast it with AdS/CFT. Moreover, we find that each boundary region faithfully encodes the physics of the entire bulk entanglement wedge, i.e., the bulk region enclosed by the boundary region and the minimal surface. Our method is to interpret the average over random tensors as the partition function of a classical ferromagnetic Ising model, so that the minimal surfaces of Ryu-Takayanagi appear as domain walls. Upon including the analog of a bulk field, we find that our model reproduces the expected corrections to the Ryu-Takayanagi formula: the bulk minimal surface is displaced and the entropy is augmented by the entanglement of the bulk field. Increasing the entanglement of the bulk field ultimately changes the minimal surface behavior topologically, in a way similar to the effect of creating a black hole. Extrapolating bulk correlation functions to the boundary permits the calculation of the scaling dimensions of boundary operators, which exhibit a large gap between a small number of low-dimension operators and the rest. While we are primarily motivated by the AdS/CFT duality, the main

  2. A random spatial network model based on elementary postulates

    Science.gov (United States)

    Karlinger, Michael R.; Troutman, Brent M.

    1989-01-01

    A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

  3. Experimental percolation studies of random networks

    Science.gov (United States)

    Feinerman, A.; Weddell, J.

    2017-06-01

    This report establishes an experimental method of studying electrically percolating networks at a higher resolution than previously implemented. This method measures the current across a conductive sheet as a function of time as elliptical pores are cut into the sheet. This is done utilizing a Universal Laser System X2-600 100 W CO2 laser system with a 76 × 46 cm2 field and 394 dpc (dots/cm) resolution. This laser can cut a random system of elliptical pores into a conductive sheet with a potential voltage applied across it and measures the current versus time. This allows for experimental verification of a percolation threshold as a function of the ellipse's aspect ratio (minor/major diameter). We show that as an ellipse's aspect ratio approaches zero, the percolation threshold approaches one. The benefit of this method is that it can experimentally measure the effect of removing small pores, as well as pores with complex geometries, such as an asterisk from a conductive sheet.

  4. Extensive cortical rewiring after brain injury.

    Science.gov (United States)

    Dancause, Numa; Barbay, Scott; Frost, Shawn B; Plautz, Erik J; Chen, Daofen; Zoubina, Elena V; Stowe, Ann M; Nudo, Randolph J

    2005-11-02

    Previously, we showed that the ventral premotor cortex (PMv) underwent neurophysiological remodeling after injury to the primary motor cortex (M1). In the present study, we examined cortical connections of PMv after such lesions. The neuroanatomical tract tracer biotinylated dextran amine was injected into the PMv hand area at least 5 months after ischemic injury to the M1 hand area. Comparison of labeling patterns between experimental and control animals demonstrated extensive proliferation of novel PMv terminal fields and the appearance of retrogradely labeled cell bodies within area 1/2 of the primary somatosensory cortex after M1 injury. Furthermore, evidence was found for alterations in the trajectory of PMv intracortical axons near the site of the lesion. The results suggest that M1 injury results in axonal sprouting near the ischemic injury and the establishment of novel connections within a distant target. These results support the hypothesis that, after a cortical injury, such as occurs after stroke, cortical areas distant from the injury undergo major neuroanatomical reorganization. Our results reveal an extraordinary anatomical rewiring capacity in the adult CNS after injury that may potentially play a role in recovery.

  5. Random matrix approach to plasmon resonances in the random impedance network model of disordered nanocomposites

    Science.gov (United States)

    Olekhno, N. A.; Beltukov, Y. M.

    2018-05-01

    Random impedance networks are widely used as a model to describe plasmon resonances in disordered metal-dielectric and other two-component nanocomposites. In the present work, the spectral properties of resonances in random networks are studied within the framework of the random matrix theory. We have shown that the appropriate ensemble of random matrices for the considered problem is the Jacobi ensemble (the MANOVA ensemble). The obtained analytical expressions for the density of states in such resonant networks show a good agreement with the results of numerical simulations in a wide range of metal filling fractions 0

  6. Application of random matrix theory to biological networks

    Energy Technology Data Exchange (ETDEWEB)

    Luo Feng [Department of Computer Science, Clemson University, 100 McAdams Hall, Clemson, SC 29634 (United States); Department of Pathology, U.T. Southwestern Medical Center, 5323 Harry Hines Blvd. Dallas, TX 75390-9072 (United States); Zhong Jianxin [Department of Physics, Xiangtan University, Hunan 411105 (China) and Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States)]. E-mail: zhongjn@ornl.gov; Yang Yunfeng [Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Scheuermann, Richard H. [Department of Pathology, U.T. Southwestern Medical Center, 5323 Harry Hines Blvd. Dallas, TX 75390-9072 (United States); Zhou Jizhong [Department of Botany and Microbiology, University of Oklahoma, Norman, OK 73019 (United States) and Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States)]. E-mail: zhouj@ornl.gov

    2006-09-25

    We show that spectral fluctuation of interaction matrices of a yeast protein-protein interaction network and a yeast metabolic network follows the description of the Gaussian orthogonal ensemble (GOE) of random matrix theory (RMT). Furthermore, we demonstrate that while the global biological networks evaluated belong to GOE, removal of interactions between constituents transitions the networks to systems of isolated modules described by the Poisson distribution. Our results indicate that although biological networks are very different from other complex systems at the molecular level, they display the same statistical properties at network scale. The transition point provides a new objective approach for the identification of functional modules.

  7. Quantum Random Networks for Type 2 Quantum Computers

    National Research Council Canada - National Science Library

    Allara, David L; Hasslacher, Brosl

    2006-01-01

    Random boolean networks (RBNs) have been studied theoretically and computationally in order to be able to use their remarkable self-healing and large basins of altercation properties as quantum computing architectures, especially...

  8. Softening in Random Networks of Non-Identical Beams.

    Science.gov (United States)

    Ban, Ehsan; Barocas, Victor H; Shephard, Mark S; Picu, Catalin R

    2016-02-01

    Random fiber networks are assemblies of elastic elements connected in random configurations. They are used as models for a broad range of fibrous materials including biopolymer gels and synthetic nonwovens. Although the mechanics of networks made from the same type of fibers has been studied extensively, the behavior of composite systems of fibers with different properties has received less attention. In this work we numerically and theoretically study random networks of beams and springs of different mechanical properties. We observe that the overall network stiffness decreases on average as the variability of fiber stiffness increases, at constant mean fiber stiffness. Numerical results and analytical arguments show that for small variabilities in fiber stiffness the amount of network softening scales linearly with the variance of the fiber stiffness distribution. This result holds for any beam structure and is expected to apply to a broad range of materials including cellular solids.

  9. Random networking : between order and chaos

    NARCIS (Netherlands)

    Hofstad, van der R.W.

    2007-01-01

    With the arrival of the Internet, a good understanding of networks has become important for everyone. Network theory, which originated in the eighteenth century with Euler, and in the nineteenth century withMarkov, has until recently concentrated its attentionmainly on regular types of graphs. In

  10. Quantum transport with long-range steps on Watts-Strogatz networks

    Science.gov (United States)

    Wang, Yan; Xu, Xin-Jian

    2016-07-01

    We study transport dynamics of quantum systems with long-range steps on the Watts-Strogatz network (WSN) which is generated by rewiring links of the regular ring. First, we probe physical systems modeled by the discrete nonlinear schrödinger (DNLS) equation. Using the localized initial condition, we compute the time-averaged occupation probability of the initial site, which is related to the nonlinearity, the long-range steps and rewiring links. Self-trapping transitions occur at large (small) nonlinear parameters for coupling ɛ=-1 (1), as long-range interactions are intensified. The structure disorder induced by random rewiring, however, has dual effects for ɛ=-1 and inhibits the self-trapping behavior for ɛ=1. Second, we investigate continuous-time quantum walks (CTQW) on the regular ring ruled by the discrete linear schrödinger (DLS) equation. It is found that only the presence of the long-range steps does not affect the efficiency of the coherent exciton transport, while only the allowance of random rewiring enhances the partial localization. If both factors are considered simultaneously, localization is greatly strengthened, and the transport becomes worse.

  11. Selectivity and sparseness in randomly connected balanced networks.

    Directory of Open Access Journals (Sweden)

    Cengiz Pehlevan

    Full Text Available Neurons in sensory cortex show stimulus selectivity and sparse population response, even in cases where no strong functionally specific structure in connectivity can be detected. This raises the question whether selectivity and sparseness can be generated and maintained in randomly connected networks. We consider a recurrent network of excitatory and inhibitory spiking neurons with random connectivity, driven by random projections from an input layer of stimulus selective neurons. In this architecture, the stimulus-to-stimulus and neuron-to-neuron modulation of total synaptic input is weak compared to the mean input. Surprisingly, we show that in the balanced state the network can still support high stimulus selectivity and sparse population response. In the balanced state, strong synapses amplify the variation in synaptic input and recurrent inhibition cancels the mean. Functional specificity in connectivity emerges due to the inhomogeneity caused by the generative statistical rule used to build the network. We further elucidate the mechanism behind and evaluate the effects of model parameters on population sparseness and stimulus selectivity. Network response to mixtures of stimuli is investigated. It is shown that a balanced state with unselective inhibition can be achieved with densely connected input to inhibitory population. Balanced networks exhibit the "paradoxical" effect: an increase in excitatory drive to inhibition leads to decreased inhibitory population firing rate. We compare and contrast selectivity and sparseness generated by the balanced network to randomly connected unbalanced networks. Finally, we discuss our results in light of experiments.

  12. Robustness of Dengue Complex Network under Targeted versus Random Attack

    Directory of Open Access Journals (Sweden)

    Hafiz Abid Mahmood Malik

    2017-01-01

    Full Text Available Dengue virus infection is one of those epidemic diseases that require much consideration in order to save the humankind from its unsafe impacts. According to the World Health Organization (WHO, 3.6 billion individuals are at risk because of the dengue virus sickness. Researchers are striving to comprehend the dengue threat. This study is a little commitment to those endeavors. To observe the robustness of the dengue network, we uprooted the links between nodes randomly and targeted by utilizing different centrality measures. The outcomes demonstrated that 5% targeted attack is equivalent to the result of 65% random assault, which showed the topology of this complex network validated a scale-free network instead of random network. Four centrality measures (Degree, Closeness, Betweenness, and Eigenvector have been ascertained to look for focal hubs. It has been observed through the results in this study that robustness of a node and links depends on topology of the network. The dengue epidemic network presented robust behaviour under random attack, and this network turned out to be more vulnerable when the hubs of higher degree have higher probability to fail. Moreover, representation of this network has been projected, and hub removal impact has been shown on the real map of Gombak (Malaysia.

  13. Spectra of random networks in the weak clustering regime

    Science.gov (United States)

    Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen; Rodrigues, Francisco A.

    2018-03-01

    The asymptotic behavior of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of traditional configuration models, networks generated through these models fail to describe many topological features of real-world networks, in particular non-null values of the clustering coefficient. Here we study effects of cycles of order three (triangles) in network spectra. By using recent advances in random matrix theory, we determine the spectral distribution of the network adjacency matrix as a function of the average number of triangles attached to each node for networks without modular structure and degree-degree correlations. Implications to network dynamics are discussed. Our findings can shed light in the study of how particular kinds of subgraphs influence network dynamics.

  14. Epidemic transmission on random mobile network with diverse infection periods

    Science.gov (United States)

    Li, Kezan; Yu, Hong; Zeng, Zhaorong; Ding, Yong; Ma, Zhongjun

    2015-05-01

    The heterogeneity of individual susceptibility and infectivity and time-varying topological structure are two realistic factors when we study epidemics on complex networks. Current research results have shown that the heterogeneity of individual susceptibility and infectivity can increase the epidemic threshold in a random mobile dynamical network with the same infection period. In this paper, we will focus on random mobile dynamical networks with diverse infection periods due to people's different constitutions and external circumstances. Theoretical results indicate that the epidemic threshold of the random mobile network with diverse infection periods is larger than the counterpart with the same infection period. Moreover, the heterogeneity of individual susceptibility and infectivity can play a significant impact on disease transmission. In particular, the homogeneity of individuals will avail to the spreading of epidemics. Numerical examples verify further our theoretical results very well.

  15. A scaling law for random walks on networks

    Science.gov (United States)

    Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

    2014-10-01

    The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

  16. Efficient sampling of complex network with modified random walk strategies

    Science.gov (United States)

    Xie, Yunya; Chang, Shuhua; Zhang, Zhipeng; Zhang, Mi; Yang, Lei

    2018-02-01

    We present two novel random walk strategies, choosing seed node (CSN) random walk and no-retracing (NR) random walk. Different from the classical random walk sampling, the CSN and NR strategies focus on the influences of the seed node choice and path overlap, respectively. Three random walk samplings are applied in the Erdös-Rényi (ER), Barabási-Albert (BA), Watts-Strogatz (WS), and the weighted USAir networks, respectively. Then, the major properties of sampled subnets, such as sampling efficiency, degree distributions, average degree and average clustering coefficient, are studied. The similar conclusions can be reached with these three random walk strategies. Firstly, the networks with small scales and simple structures are conducive to the sampling. Secondly, the average degree and the average clustering coefficient of the sampled subnet tend to the corresponding values of original networks with limited steps. And thirdly, all the degree distributions of the subnets are slightly biased to the high degree side. However, the NR strategy performs better for the average clustering coefficient of the subnet. In the real weighted USAir networks, some obvious characters like the larger clustering coefficient and the fluctuation of degree distribution are reproduced well by these random walk strategies.

  17. Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding

    OpenAIRE

    Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2014-01-01

    This work proposes a new protocol applying on–the–fly random linear network coding in wireless mesh net-works. The protocol provides increased reliability, low delay,and high throughput to the upper layers, while being obliviousto their specific requirements. This seemingly conflicting goalsare achieved by design, using an on–the–fly network codingstrategy. Our protocol also exploits relay nodes to increasethe overall performance of individual links. Since our protocolnaturally masks random p...

  18. Decoding Algorithms for Random Linear Network Codes

    DEFF Research Database (Denmark)

    Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially...... achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...

  19. Dynamic Output Feedback Control for Nonlinear Networked Control Systems with Random Packet Dropout and Random Delay

    Directory of Open Access Journals (Sweden)

    Shuiqing Yu

    2013-01-01

    Full Text Available This paper investigates the dynamic output feedback control for nonlinear networked control systems with both random packet dropout and random delay. Random packet dropout and random delay are modeled as two independent random variables. An observer-based dynamic output feedback controller is designed based upon the Lyapunov theory. The quantitative relationship of the dropout rate, transition probability matrix, and nonlinear level is derived by solving a set of linear matrix inequalities. Finally, an example is presented to illustrate the effectiveness of the proposed method.

  20. Optimal Quantum Spatial Search on Random Temporal Networks.

    Science.gov (United States)

    Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

    2017-12-01

    To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

  1. Optimal Quantum Spatial Search on Random Temporal Networks

    Science.gov (United States)

    Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

    2017-12-01

    To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

  2. Complex networks: when random walk dynamics equals synchronization

    International Nuclear Information System (INIS)

    Kriener, Birgit; Anand, Lishma; Timme, Marc

    2012-01-01

    Synchrony prevalently emerges from the interactions of coupled dynamical units. For simple systems such as networks of phase oscillators, the asymptotic synchronization process is assumed to be equivalent to a Markov process that models standard diffusion or random walks on the same network topology. In this paper, we analytically derive the conditions for such equivalence for networks of pulse-coupled oscillators, which serve as models for neurons and pacemaker cells interacting by exchanging electric pulses or fireflies interacting via light flashes. We find that the pulse synchronization process is less simple, but there are classes of, e.g., network topologies that ensure equivalence. In particular, local dynamical operators are required to be doubly stochastic. These results provide a natural link between stochastic processes and deterministic synchronization on networks. Tools for analyzing diffusion (or, more generally, Markov processes) may now be transferred to pin down features of synchronization in networks of pulse-coupled units such as neural circuits. (paper)

  3. Competing contact processes in the Watts-Strogatz network

    Science.gov (United States)

    Rybak, Marcin; Malarz, Krzysztof; Kułakowski, Krzysztof

    2016-06-01

    We investigate two competing contact processes on a set of Watts-Strogatz networks with the clustering coefficient tuned by rewiring. The base for network construction is one-dimensional chain of N sites, where each site i is directly linked to nodes labelled as i ± 1 and i ± 2. So initially, each node has the same degree k i = 4. The periodic boundary conditions are assumed as well. For each node i the links to sites i + 1 and i + 2 are rewired to two randomly selected nodes so far not-connected to node i. An increase of the rewiring probability q influences the nodes degree distribution and the network clusterization coefficient 𝓒. For given values of rewiring probability q the set 𝓝(q)={𝓝1,𝓝2,...,𝓝 M } of M networks is generated. The network's nodes are decorated with spin-like variables s i ∈ { S,D }. During simulation each S node having a D-site in its neighbourhood converts this neighbour from D to S state. Conversely, a node in D state having at least one neighbour also in state D-state converts all nearest-neighbours of this pair into D-state. The latter is realized with probability p. We plot the dependence of the nodes S final density n S T on initial nodes S fraction n S 0. Then, we construct the surface of the unstable fixed points in (𝓒, p, n S 0) space. The system evolves more often toward n S T for (𝓒, p, n S 0) points situated above this surface while starting simulation with (𝓒, p, n S 0) parameters situated below this surface leads system to n S T =0. The points on this surface correspond to such value of initial fraction n S * of S nodes (for fixed values 𝓒 and p) for which their final density is n S T=1/2.

  4. Structure of a randomly grown 2-d network

    DEFF Research Database (Denmark)

    Ajazi, Fioralba; Napolitano, George M.; Turova, Tatyana

    2015-01-01

    We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in...... in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons.......We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes...

  5. Statistical mechanics of the fashion game on random networks

    International Nuclear Information System (INIS)

    Sun, YiFan

    2016-01-01

    A model of fashion on networks is studied. This model consists of two groups of agents that are located on a network and have opposite viewpoints towards being fashionable: behaving consistently with either the majority or the minority of adjacent agents. Checking whether the fashion game has a pure Nash equilibrium (pure NE) is a non-deterministic polynomial complete problem. Using replica-symmetric mean field theory, the largest proportion of satisfied agents and the region where at least one pure NE should exist are determined for several types of random networks. Furthermore, a quantitive analysis of the asynchronous best response dynamics yields the phase diagram of existence and detectability of pure NE in the fashion game on some random networks. (paper: classical statistical mechanics, equilibrium and non-equilibrium).

  6. Simulation of nonlinear random vibrations using artificial neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Paez, T.L.; Tucker, S.; O`Gorman, C.

    1997-02-01

    The simulation of mechanical system random vibrations is important in structural dynamics, but it is particularly difficult when the system under consideration is nonlinear. Artificial neural networks provide a useful tool for the modeling of nonlinear systems, however, such modeling may be inefficient or insufficiently accurate when the system under consideration is complex. This paper shows that there are several transformations that can be used to uncouple and simplify the components of motion of a complex nonlinear system, thereby making its modeling and random vibration simulation, via component modeling with artificial neural networks, a much simpler problem. A numerical example is presented.

  7. Network formation determined by the diffusion process of random walkers

    International Nuclear Information System (INIS)

    Ikeda, Nobutoshi

    2008-01-01

    We studied the diffusion process of random walkers in networks formed by their traces. This model considers the rise and fall of links determined by the frequency of transports of random walkers. In order to examine the relation between the formed network and the diffusion process, a situation in which multiple random walkers start from the same vertex is investigated. The difference in diffusion rate of random walkers according to the difference in dimension of the initial lattice is very important for determining the time evolution of the networks. For example, complete subgraphs can be formed on a one-dimensional lattice while a graph with a power-law vertex degree distribution is formed on a two-dimensional lattice. We derived some formulae for predicting network changes for the 1D case, such as the time evolution of the size of nearly complete subgraphs and conditions for their collapse. The networks formed on the 2D lattice are characterized by the existence of clusters of highly connected vertices and their life time. As the life time of such clusters tends to be small, the exponent of the power-law distribution changes from γ ≅ 1-2 to γ ≅ 3

  8. Random resistor network model of minimal conductivity in graphene.

    Science.gov (United States)

    Cheianov, Vadim V; Fal'ko, Vladimir I; Altshuler, Boris L; Aleiner, Igor L

    2007-10-26

    Transport in undoped graphene is related to percolating current patterns in the networks of n- and p-type regions reflecting the strong bipolar charge density fluctuations. Finite transparency of the p-n junctions is vital in establishing the macroscopic conductivity. We propose a random resistor network model to analyze scaling dependencies of the conductance on the doping and disorder, the quantum magnetoresistance and the corresponding dephasing rate.

  9. Reliability of Broadcast Communications Under Sparse Random Linear Network Coding

    OpenAIRE

    Brown, Suzie; Johnson, Oliver; Tassi, Andrea

    2018-01-01

    Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kin...

  10. Randomizing growing networks with a time-respecting null model

    Science.gov (United States)

    Ren, Zhuo-Ming; Mariani, Manuel Sebastian; Zhang, Yi-Cheng; Medo, Matúš

    2018-05-01

    Complex networks are often used to represent systems that are not static but grow with time: People make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology—a time-respecting null model—that preserves both the network's degree sequence and the time evolution of individual nodes' degree values. By preserving the temporal linking patterns of the analyzed system, the proposed model is able to factor out the effect of the system's temporal patterns on its structure. We apply the model to the citation network of Physical Review scholarly papers and the citation network of US movies. The model reveals that the two data sets are strikingly different with respect to their degree-degree correlations, and we discuss the important implications of this finding on the information provided by paradigmatic node centrality metrics such as indegree and Google's PageRank. The randomization methodology proposed here can be used to assess the significance of any structural property in growing networks, which could bring new insights into the problems where null models play a critical role, such as the detection of communities and network motifs.

  11. Exponential random graph models for networks with community structure.

    Science.gov (United States)

    Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

    2013-09-01

    Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop an exponential random graph approach to networks with community structure. To this end we mainly built upon the idea of blockmodels. We consider both the classical blockmodel and its degree-corrected counterpart and study many of their properties analytically. We show that in the degree-corrected blockmodel, node degrees display an interesting scaling property, which is reminiscent of what is observed in real-world fractal networks. A short description of Monte Carlo simulations of the models is also given in the hope of being useful to others working in the field.

  12. Computer simulation of randomly cross-linked polymer networks

    International Nuclear Information System (INIS)

    Williams, Timothy Philip

    2002-01-01

    In this work, Monte Carlo and Stochastic Dynamics computer simulations of mesoscale model randomly cross-linked networks were undertaken. Task parallel implementations of the lattice Monte Carlo Bond Fluctuation model and Kremer-Grest Stochastic Dynamics bead-spring continuum model were designed and used for this purpose. Lattice and continuum precursor melt systems were prepared and then cross-linked to varying degrees. The resultant networks were used to study structural changes during deformation and relaxation dynamics. The effects of a random network topology featuring a polydisperse distribution of strand lengths and an abundance of pendant chain ends, were qualitatively compared to recent published work. A preliminary investigation into the effects of temperature on the structural and dynamical properties was also undertaken. Structural changes during isotropic swelling and uniaxial deformation, revealed a pronounced non-affine deformation dependant on the degree of cross-linking. Fractal heterogeneities were observed in the swollen model networks and were analysed by considering constituent substructures of varying size. The network connectivity determined the length scales at which the majority of the substructure unfolding process occurred. Simulated stress-strain curves and diffraction patterns for uniaxially deformed swollen networks, were found to be consistent with experimental findings. Analysis of the relaxation dynamics of various network components revealed a dramatic slowdown due to the network connectivity. The cross-link junction spatial fluctuations for networks close to the sol-gel threshold, were observed to be at least comparable with the phantom network prediction. The dangling chain ends were found to display the largest characteristic relaxation time. (author)

  13. Gossips and prejudices: ergodic randomized dynamics in social networks

    NARCIS (Netherlands)

    Frasca, Paolo; Ravazzi, Chiara; Tempo, Roberto; Ishii, Hideaki

    In this paper we study a new model of opinion dynamics in social networks, which has two main features. First, agents asynchronously interact in pairs, and these pairs are chosen according to a random process: following recent literature, we refer to this communication model as “gossiping‿. Second,

  14. Random linear network coding for streams with unequally sized packets

    DEFF Research Database (Denmark)

    Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2016-01-01

    State of the art Random Linear Network Coding (RLNC) schemes assume that data streams generate packets with equal sizes. This is an assumption that results in the highest efficiency gains for RLNC. A typical solution for managing unequal packet sizes is to zero-pad the smallest packets. However, ...

  15. Navigation by anomalous random walks on complex networks.

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan

    2016-11-23

    Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.

  16. Navigation by anomalous random walks on complex networks

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan

    2016-11-01

    Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.

  17. Listening to the Noise: Random Fluctuations Reveal Gene Network Parameters

    Science.gov (United States)

    Munsky, Brian; Trinh, Brooke; Khammash, Mustafa

    2010-03-01

    The cellular environment is abuzz with noise originating from the inherent random motion of reacting molecules in the living cell. In this noisy environment, clonal cell populations exhibit cell-to-cell variability that can manifest significant prototypical differences. Noise induced stochastic fluctuations in cellular constituents can be measured and their statistics quantified using flow cytometry, single molecule fluorescence in situ hybridization, time lapse fluorescence microscopy and other single cell and single molecule measurement techniques. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich source of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. We use theoretical investigations to establish experimental guidelines for the identification of gene regulatory networks, and we apply these guideline to experimentally identify predictive models for different regulatory mechanisms in bacteria and yeast.

  18. Coevolutionary network approach to cultural dynamics controlled by intolerance

    Science.gov (United States)

    Gracia-Lázaro, Carlos; Quijandría, Fernando; Hernández, Laura; Floría, Luis Mario; Moreno, Yamir

    2011-12-01

    Starting from Axelrod's model of cultural dissemination, we introduce a rewiring probability, enabling agents to cut the links with their unfriendly neighbors if their cultural similarity is below a tolerance parameter. For low values of tolerance, rewiring promotes the convergence to a frozen monocultural state. However, intermediate tolerance values prevent rewiring once the network is fragmented, resulting in a multicultural society even for values of initial cultural diversity in which the original Axelrod model reaches globalization.

  19. Random Deep Belief Networks for Recognizing Emotions from Speech Signals.

    Science.gov (United States)

    Wen, Guihua; Li, Huihui; Huang, Jubing; Li, Danyang; Xun, Eryang

    2017-01-01

    Now the human emotions can be recognized from speech signals using machine learning methods; however, they are challenged by the lower recognition accuracies in real applications due to lack of the rich representation ability. Deep belief networks (DBN) can automatically discover the multiple levels of representations in speech signals. To make full of its advantages, this paper presents an ensemble of random deep belief networks (RDBN) method for speech emotion recognition. It firstly extracts the low level features of the input speech signal and then applies them to construct lots of random subspaces. Each random subspace is then provided for DBN to yield the higher level features as the input of the classifier to output an emotion label. All outputted emotion labels are then fused through the majority voting to decide the final emotion label for the input speech signal. The conducted experimental results on benchmark speech emotion databases show that RDBN has better accuracy than the compared methods for speech emotion recognition.

  20. Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks

    Science.gov (United States)

    Li, Qiang; Chen, Minyou; Perc, Matjaž; Iqbal, Azhar; Abbott, Derek

    2013-10-01

    We study the impact of adaptive degrees of trust on the evolution of cooperation in the quantum prisoner's dilemma game. In addition to the strategies, links between players are also subject to evolution. Starting with a scale-free interaction network, players adjust trust towards their neighbors based on received payoffs. The latter governs the strategy adoption process, while trust governs the rewiring of links. As soon as the degree of trust towards a neighbor drops to zero, the link is rewired to another randomly chosen player within the network. We find that for small temptations to defect cooperators always dominate, while for intermediate and strong temptations a single quantum strategy is able to outperform all other strategies. In general, reciprocal trust remains within close relationships and favors the dominance of a single strategy. Due to coevolution, the power-law degree distributions transform to Poisson distributions.

  1. Weighted Scaling in Non-growth Random Networks

    International Nuclear Information System (INIS)

    Chen Guang; Yang Xuhua; Xu Xinli

    2012-01-01

    We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.

  2. Rewiring monocyte glucose metabolism via C-type lectin signaling protects against disseminated candidiasis.

    Science.gov (United States)

    Domínguez-Andrés, Jorge; Arts, Rob J W; Ter Horst, Rob; Gresnigt, Mark S; Smeekens, Sanne P; Ratter, Jacqueline M; Lachmandas, Ekta; Boutens, Lily; van de Veerdonk, Frank L; Joosten, Leo A B; Notebaart, Richard A; Ardavín, Carlos; Netea, Mihai G

    2017-09-01

    Monocytes are innate immune cells that play a pivotal role in antifungal immunity, but little is known regarding the cellular metabolic events that regulate their function during infection. Using complementary transcriptomic and immunological studies in human primary monocytes, we show that activation of monocytes by Candida albicans yeast and hyphae was accompanied by metabolic rewiring induced through C-type lectin-signaling pathways. We describe that the innate immune responses against Candida yeast are energy-demanding processes that lead to the mobilization of intracellular metabolite pools and require induction of glucose metabolism, oxidative phosphorylation and glutaminolysis, while responses to hyphae primarily rely on glycolysis. Experimental models of systemic candidiasis models validated a central role for glucose metabolism in anti-Candida immunity, as the impairment of glycolysis led to increased susceptibility in mice. Collectively, these data highlight the importance of understanding the complex network of metabolic responses triggered during infections, and unveil new potential targets for therapeutic approaches against fungal diseases.

  3. Wave speed in excitable random networks with spatially constrained connections.

    Directory of Open Access Journals (Sweden)

    Nikita Vladimirov

    Full Text Available Very fast oscillations (VFO in neocortex are widely observed before epileptic seizures, and there is growing evidence that they are caused by networks of pyramidal neurons connected by gap junctions between their axons. We are motivated by the spatio-temporal waves of activity recorded using electrocorticography (ECoG, and study the speed of activity propagation through a network of neurons axonally coupled by gap junctions. We simulate wave propagation by excitable cellular automata (CA on random (Erdös-Rényi networks of special type, with spatially constrained connections. From the cellular automaton model, we derive a mean field theory to predict wave propagation. The governing equation resolved by the Fisher-Kolmogorov PDE fails to describe wave speed. A new (hyperbolic PDE is suggested, which provides adequate wave speed v( that saturates with network degree , in agreement with intuitive expectations and CA simulations. We further show that the maximum length of connection is a much better predictor of the wave speed than the mean length. When tested in networks with various degree distributions, wave speeds are found to strongly depend on the ratio of network moments / rather than on mean degree , which is explained by general network theory. The wave speeds are strikingly similar in a diverse set of networks, including regular, Poisson, exponential and power law distributions, supporting our theory for various network topologies. Our results suggest practical predictions for networks of electrically coupled neurons, and our mean field method can be readily applied for a wide class of similar problems, such as spread of epidemics through spatial networks.

  4. Self-organized critical neural networks

    International Nuclear Information System (INIS)

    Bornholdt, Stefan; Roehl, Torsten

    2003-01-01

    A mechanism for self-organization of the degree of connectivity in model neural networks is studied. Network connectivity is regulated locally on the basis of an order parameter of the global dynamics, which is estimated from an observable at the single synapse level. This principle is studied in a two-dimensional neural network with randomly wired asymmetric weights. In this class of networks, network connectivity is closely related to a phase transition between ordered and disordered dynamics. A slow topology change is imposed on the network through a local rewiring rule motivated by activity-dependent synaptic development: Neighbor neurons whose activity is correlated, on average develop a new connection while uncorrelated neighbors tend to disconnect. As a result, robust self-organization of the network towards the order disorder transition occurs. Convergence is independent of initial conditions, robust against thermal noise, and does not require fine tuning of parameters

  5. Ryu-Takayanagi formula for symmetric random tensor networks

    Science.gov (United States)

    Chirco, Goffredo; Oriti, Daniele; Zhang, Mingyi

    2018-06-01

    We consider the special case of random tensor networks (RTNs) endowed with gauge symmetry constraints on each tensor. We compute the Rényi entropy for such states and recover the Ryu-Takayanagi (RT) formula in the large-bond regime. The result provides first of all an interesting new extension of the existing derivations of the RT formula for RTNs. Moreover, this extension of the RTN formalism brings it in direct relation with (tensorial) group field theories (and spin networks), and thus provides new tools for realizing the tensor network/geometry duality in the context of background-independent quantum gravity, and for importing quantum gravity tools into tensor network research.

  6. Delineating social network data anonymization via random edge perturbation

    KAUST Repository

    Xue, Mingqiang

    2012-01-01

    Social network data analysis raises concerns about the privacy of related entities or individuals. To address this issue, organizations can publish data after simply replacing the identities of individuals with pseudonyms, leaving the overall structure of the social network unchanged. However, it has been shown that attacks based on structural identification (e.g., a walk-based attack) enable an adversary to re-identify selected individuals in an anonymized network. In this paper we explore the capacity of techniques based on random edge perturbation to thwart such attacks. We theoretically establish that any kind of structural identification attack can effectively be prevented using random edge perturbation and show that, surprisingly, important properties of the whole network, as well as of subgraphs thereof, can be accurately calculated and hence data analysis tasks performed on the perturbed data, given that the legitimate data recipient knows the perturbation probability as well. Yet we also examine ways to enhance the walk-based attack, proposing a variant we call probabilistic attack. Nevertheless, we demonstrate that such probabilistic attacks can also be prevented under sufficient perturbation. Eventually, we conduct a thorough theoretical study of the probability of success of any}structural attack as a function of the perturbation probability. Our analysis provides a powerful tool for delineating the identification risk of perturbed social network data; our extensive experiments with synthetic and real datasets confirm our expectations. © 2012 ACM.

  7. Epidemic spreading on random surfer networks with infected avoidance strategy

    International Nuclear Information System (INIS)

    Feng Yun; Ding Li; Huang Yun-Han; Guan Zhi-Hong

    2016-01-01

    In this paper, we study epidemic spreading on random surfer networks with infected avoidance (IA) strategy. In particular, we consider that susceptible individuals’ moving direction angles are affected by the current location information received from infected individuals through a directed information network. The model is mainly analyzed by discrete-time numerical simulations. The results indicate that the IA strategy can restrain epidemic spreading effectively. However, when long-distance jumps of individuals exist, the IA strategy’s effectiveness on restraining epidemic spreading is heavily reduced. Finally, it is found that the influence of the noises from information transferring process on epidemic spreading is indistinctive. (paper)

  8. Is sternal rewiring mandatory in surgical treatment of deep sternal wound infections?

    Science.gov (United States)

    Rashed, Aref; Gombocz, Karoly; Alotti, Nasri; Verzar, Zsofia

    2018-04-01

    Deep sternal wound infections (DSWIs) are a rare but serious complication after median sternotomy, and treatment success depends mainly on surgical experience. We compared treatment outcomes after conventional sternal rewiring and reconstruction with no sternal rewiring in patients with a sternal wound infection. We retrospectively enrolled patients who developed a DSWI after an open-heart procedure with median sternotomy at the Department of Cardiac Surgery, at the St. Rafael Hospital, Zalaegerszeg, Hungary, between 2012 and 2016. All patients received negative pressure wound and antibiotic therapy before surgical reconstruction. Patients were divided into groups determined by the reconstruction technique and compared. Subjects were followed up for 12 months, and the primary end-points were readmission and 90-day mortality. Among 3,177 median sternotomy cases, 60 patients developed a DSWI, 4 of whom died of sepsis before surgical treatment. Fifty-six patients underwent surgical reconstruction with conventional sternal rewiring (23 cases, 41%) or another interventions with no sternal refixation (33 cases, 59%). Eighty-one percent of sternal wound infections followed coronary bypass surgery (alone or combinated with another procedures), and 60% were diagnosed after hospital discharge. Staphylococcus aureus was cultured in 30% of all wounds and, 56.5% of cases reconstructed by sternal rewiring vs. 26.5% with no sternal rewiring, (P=0.022). Hospital readmission occurred in 63.6% of the sternal rewiring group vs. 14.7% of the no sternal rewiring group. The rate of death before wound healing or the 90 th postoperative day was 21.7% in the sternal rewiring group vs. 0% in the no sternal rewiring group. The median hospital stay was longer in the sternal rewiring group than in the other group (51 vs. 30 days, P=0.006). Sternal rewiring may be associated with a higher rate of treatment failure than other forms of treatment for sternal wound infections.

  9. Network meta-analysis of disconnected networks: How dangerous are random baseline treatment effects?

    Science.gov (United States)

    Béliveau, Audrey; Goring, Sarah; Platt, Robert W; Gustafson, Paul

    2017-12-01

    In network meta-analysis, the use of fixed baseline treatment effects (a priori independent) in a contrast-based approach is regularly preferred to the use of random baseline treatment effects (a priori dependent). That is because, often, there is not a need to model baseline treatment effects, which carry the risk of model misspecification. However, in disconnected networks, fixed baseline treatment effects do not work (unless extra assumptions are made), as there is not enough information in the data to update the prior distribution on the contrasts between disconnected treatments. In this paper, we investigate to what extent the use of random baseline treatment effects is dangerous in disconnected networks. We take 2 publicly available datasets of connected networks and disconnect them in multiple ways. We then compare the results of treatment comparisons obtained from a Bayesian contrast-based analysis of each disconnected network using random normally distributed and exchangeable baseline treatment effects to those obtained from a Bayesian contrast-based analysis of their initial connected network using fixed baseline treatment effects. For the 2 datasets considered, we found that the use of random baseline treatment effects in disconnected networks was appropriate. Because those datasets were not cherry-picked, there should be other disconnected networks that would benefit from being analyzed using random baseline treatment effects. However, there is also a risk for the normality and exchangeability assumption to be inappropriate in other datasets even though we have not observed this situation in our case study. We provide code, so other datasets can be investigated. Copyright © 2017 John Wiley & Sons, Ltd.

  10. Epidemics in interconnected small-world networks.

    Science.gov (United States)

    Liu, Meng; Li, Daqing; Qin, Pengju; Liu, Chaoran; Wang, Huijuan; Wang, Feilong

    2015-01-01

    Networks can be used to describe the interconnections among individuals, which play an important role in the spread of disease. Although the small-world effect has been found to have a significant impact on epidemics in single networks, the small-world effect on epidemics in interconnected networks has rarely been considered. Here, we study the susceptible-infected-susceptible (SIS) model of epidemic spreading in a system comprising two interconnected small-world networks. We find that the epidemic threshold in such networks decreases when the rewiring probability of the component small-world networks increases. When the infection rate is low, the rewiring probability affects the global steady-state infection density, whereas when the infection rate is high, the infection density is insensitive to the rewiring probability. Moreover, epidemics in interconnected small-world networks are found to spread at different velocities that depend on the rewiring probability.

  11. Epidemics in interconnected small-world networks.

    Directory of Open Access Journals (Sweden)

    Meng Liu

    Full Text Available Networks can be used to describe the interconnections among individuals, which play an important role in the spread of disease. Although the small-world effect has been found to have a significant impact on epidemics in single networks, the small-world effect on epidemics in interconnected networks has rarely been considered. Here, we study the susceptible-infected-susceptible (SIS model of epidemic spreading in a system comprising two interconnected small-world networks. We find that the epidemic threshold in such networks decreases when the rewiring probability of the component small-world networks increases. When the infection rate is low, the rewiring probability affects the global steady-state infection density, whereas when the infection rate is high, the infection density is insensitive to the rewiring probability. Moreover, epidemics in interconnected small-world networks are found to spread at different velocities that depend on the rewiring probability.

  12. A simple model of global cascades on random networks

    Science.gov (United States)

    Watts, Duncan J.

    2002-04-01

    The origin of large but rare cascades that are triggered by small initial shocks is a phenomenon that manifests itself as diversely as cultural fads, collective action, the diffusion of norms and innovations, and cascading failures in infrastructure and organizational networks. This paper presents a possible explanation of this phenomenon in terms of a sparse, random network of interacting agents whose decisions are determined by the actions of their neighbors according to a simple threshold rule. Two regimes are identified in which the network is susceptible to very large cascadesherein called global cascadesthat occur very rarely. When cascade propagation is limited by the connectivity of the network, a power law distribution of cascade sizes is observed, analogous to the cluster size distribution in standard percolation theory and avalanches in self-organized criticality. But when the network is highly connected, cascade propagation is limited instead by the local stability of the nodes themselves, and the size distribution of cascades is bimodal, implying a more extreme kind of instability that is correspondingly harder to anticipate. In the first regime, where the distribution of network neighbors is highly skewed, it is found that the most connected nodes are far more likely than average nodes to trigger cascades, but not in the second regime. Finally, it is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but an increasingly heterogeneous degree distribution makes it less vulnerable.

  13. Robust emergence of small-world structure in networks of spiking neurons.

    Science.gov (United States)

    Kwok, Hoi Fei; Jurica, Peter; Raffone, Antonino; van Leeuwen, Cees

    2007-03-01

    Spontaneous activity in biological neural networks shows patterns of dynamic synchronization. We propose that these patterns support the formation of a small-world structure-network connectivity optimal for distributed information processing. We present numerical simulations with connected Hindmarsh-Rose neurons in which, starting from random connection distributions, small-world networks evolve as a result of applying an adaptive rewiring rule. The rule connects pairs of neurons that tend fire in synchrony, and disconnects ones that fail to synchronize. Repeated application of the rule leads to small-world structures. This mechanism is robustly observed for bursting and irregular firing regimes.

  14. Order-based representation in random networks of cortical neurons.

    Directory of Open Access Journals (Sweden)

    Goded Shahaf

    2008-11-01

    Full Text Available The wide range of time scales involved in neural excitability and synaptic transmission might lead to ongoing change in the temporal structure of responses to recurring stimulus presentations on a trial-to-trial basis. This is probably the most severe biophysical constraint on putative time-based primitives of stimulus representation in neuronal networks. Here we show that in spontaneously developing large-scale random networks of cortical neurons in vitro the order in which neurons are recruited following each stimulus is a naturally emerging representation primitive that is invariant to significant temporal changes in spike times. With a relatively small number of randomly sampled neurons, the information about stimulus position is fully retrievable from the recruitment order. The effective connectivity that makes order-based representation invariant to time warping is characterized by the existence of stations through which activity is required to pass in order to propagate further into the network. This study uncovers a simple invariant in a noisy biological network in vitro; its applicability under in vivo constraints remains to be seen.

  15. Adaptive random walks on the class of Web graphs

    Science.gov (United States)

    Tadić, B.

    2001-09-01

    We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦βc≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.

  16. Random Deep Belief Networks for Recognizing Emotions from Speech Signals

    Directory of Open Access Journals (Sweden)

    Guihua Wen

    2017-01-01

    Full Text Available Now the human emotions can be recognized from speech signals using machine learning methods; however, they are challenged by the lower recognition accuracies in real applications due to lack of the rich representation ability. Deep belief networks (DBN can automatically discover the multiple levels of representations in speech signals. To make full of its advantages, this paper presents an ensemble of random deep belief networks (RDBN method for speech emotion recognition. It firstly extracts the low level features of the input speech signal and then applies them to construct lots of random subspaces. Each random subspace is then provided for DBN to yield the higher level features as the input of the classifier to output an emotion label. All outputted emotion labels are then fused through the majority voting to decide the final emotion label for the input speech signal. The conducted experimental results on benchmark speech emotion databases show that RDBN has better accuracy than the compared methods for speech emotion recognition.

  17. Rewiring protein synthesis: From natural to synthetic amino acids.

    Science.gov (United States)

    Fan, Yongqiang; Evans, Christopher R; Ling, Jiqiang

    2017-11-01

    The protein synthesis machinery uses 22 natural amino acids as building blocks that faithfully decode the genetic information. Such fidelity is controlled at multiple steps and can be compromised in nature and in the laboratory to rewire protein synthesis with natural and synthetic amino acids. This review summarizes the major quality control mechanisms during protein synthesis, including aminoacyl-tRNA synthetases, elongation factors, and the ribosome. We will discuss evolution and engineering of such components that allow incorporation of natural and synthetic amino acids at positions that deviate from the standard genetic code. The protein synthesis machinery is highly selective, yet not fixed, for the correct amino acids that match the mRNA codons. Ambiguous translation of a codon with multiple amino acids or complete reassignment of a codon with a synthetic amino acid diversifies the proteome. Expanding the genetic code with synthetic amino acids through rewiring protein synthesis has broad applications in synthetic biology and chemical biology. Biochemical, structural, and genetic studies of the translational quality control mechanisms are not only crucial to understand the physiological role of translational fidelity and evolution of the genetic code, but also enable us to better design biological parts to expand the proteomes of synthetic organisms. This article is part of a Special Issue entitled "Biochemistry of Synthetic Biology - Recent Developments" Guest Editor: Dr. Ilka Heinemann and Dr. Patrick O'Donoghue. Copyright © 2017 Elsevier B.V. All rights reserved.

  18. Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work proposes a new protocol applying on– the–fly random linear network coding in wireless mesh net- works. The protocol provides increased reliability, low delay, and high throughput to the upper layers, while being oblivious to their specific requirements. This seemingly conflicting goals ...

  19. Stochastic resonance in small-world neuronal networks with hybrid electrical–chemical synapses

    International Nuclear Information System (INIS)

    Wang, Jiang; Guo, Xinmeng; Yu, Haitao; Liu, Chen; Deng, Bin; Wei, Xile; Chen, Yingyuan

    2014-01-01

    Highlights: •We study stochastic resonance in small-world neural networks with hybrid synapses. •The resonance effect depends largely on the probability of chemical synapse. •An optimal chemical synapse probability exists to evoke network resonance. •Network topology affects the stochastic resonance in hybrid neuronal networks. - Abstract: The dependence of stochastic resonance in small-world neuronal networks with hybrid electrical–chemical synapses on the probability of chemical synapse and the rewiring probability is investigated. A subthreshold periodic signal is imposed on one single neuron within the neuronal network as a pacemaker. It is shown that, irrespective of the probability of chemical synapse, there exists a moderate intensity of external noise optimizing the response of neuronal networks to the pacemaker. Moreover, the effect of pacemaker driven stochastic resonance of the system depends largely on the probability of chemical synapse. A high probability of chemical synapse will need lower noise intensity to evoke the phenomenon of stochastic resonance in the networked neuronal systems. In addition, for fixed noise intensity, there is an optimal chemical synapse probability, which can promote the propagation of the localized subthreshold pacemaker across neural networks. And the optimal chemical synapses probability turns even larger as the coupling strength decreases. Furthermore, the small-world topology has a significant impact on the stochastic resonance in hybrid neuronal networks. It is found that increasing the rewiring probability can always enhance the stochastic resonance until it approaches the random network limit

  20. Distributed clone detection in static wireless sensor networks: random walk with network division.

    Science.gov (United States)

    Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M

    2015-01-01

    Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

  1. Distributed clone detection in static wireless sensor networks: random walk with network division.

    Directory of Open Access Journals (Sweden)

    Wazir Zada Khan

    Full Text Available Wireless Sensor Networks (WSNs are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

  2. Epidemic spreading on random surfer networks with infected avoidance strategy

    Science.gov (United States)

    Feng, Yun; Ding, Li; Huang, Yun-Han; Guan, Zhi-Hong

    2016-12-01

    In this paper, we study epidemic spreading on random surfer networks with infected avoidance (IA) strategy. In particular, we consider that susceptible individuals’ moving direction angles are affected by the current location information received from infected individuals through a directed information network. The model is mainly analyzed by discrete-time numerical simulations. The results indicate that the IA strategy can restrain epidemic spreading effectively. However, when long-distance jumps of individuals exist, the IA strategy’s effectiveness on restraining epidemic spreading is heavily reduced. Finally, it is found that the influence of the noises from information transferring process on epidemic spreading is indistinctive. Project supported in part by the National Natural Science Foundation of China (Grant Nos. 61403284, 61272114, 61673303, and 61672112) and the Marine Renewable Energy Special Fund Project of the State Oceanic Administration of China (Grant No. GHME2013JS01).

  3. Random Linear Network Coding for 5G Mobile Video Delivery

    Directory of Open Access Journals (Sweden)

    Dejan Vukobratovic

    2018-03-01

    Full Text Available An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G 3GPP New Radio (NR standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access networks. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC. In this review paper, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.

  4. Network Randomization and Dynamic Defense for Critical Infrastructure Systems

    Energy Technology Data Exchange (ETDEWEB)

    Chavez, Adrian R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Martin, Mitchell Tyler [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Hamlet, Jason [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Stout, William M.S. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lee, Erik [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-04-01

    Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and development to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.

  5. Scaling law of resistance fluctuations in stationary random resistor networks

    Science.gov (United States)

    Pennetta; Trefan; Reggiani

    2000-12-11

    In a random resistor network we consider the simultaneous evolution of two competing random processes consisting in breaking and recovering the elementary resistors with probabilities W(D) and W(R). The condition W(R)>W(D)/(1+W(D)) leads to a stationary state, while in the opposite case, the broken resistor fraction reaches the percolation threshold p(c). We study the resistance noise of this system under stationary conditions by Monte Carlo simulations. The variance of resistance fluctuations is found to follow a scaling law |p-p(c)|(-kappa(0)) with kappa(0) = 5.5. The proposed model relates quantitatively the defectiveness of a disordered media with its electrical and excess-noise characteristics.

  6. Random field Ising chain and neutral networks with synchronous dynamics

    International Nuclear Information System (INIS)

    Skantzos, N.S.; Coolen, A.C.C.

    2001-01-01

    We first present an exact solution of the one-dimensional random-field Ising model in which spin-updates are made fully synchronously, i.e. in parallel (in contrast to the more conventional Glauber-type sequential rules). We find transitions where the support of local observables turns from a continuous interval into a Cantor set and we show that synchronous and sequential random-field models lead asymptotically to the same physical states. We then proceed to an application of these techniques to recurrent neural networks where 1D short-range interactions are combined with infinite-range ones. Due to the competing interactions these models exhibit phase diagrams with first-order transitions and regions with multiple locally stable solutions for the macroscopic order parameters

  7. Deep recurrent conditional random field network for protein secondary prediction

    DEFF Research Database (Denmark)

    Johansen, Alexander Rosenberg; Sønderby, Søren Kaae; Sønderby, Casper Kaae

    2017-01-01

    Deep learning has become the state-of-the-art method for predicting protein secondary structure from only its amino acid residues and sequence profile. Building upon these results, we propose to combine a bi-directional recurrent neural network (biRNN) with a conditional random field (CRF), which...... of the labels for all time-steps. We condition the CRF on the output of biRNN, which learns a distributed representation based on the entire sequence. The biRNN-CRF is therefore close to ideally suited for the secondary structure task because a high degree of cross-talk between neighboring elements can...

  8. Measuring symmetry, asymmetry and randomness in neural network connectivity.

    Directory of Open Access Journals (Sweden)

    Umberto Esposito

    Full Text Available Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

  9. Measuring symmetry, asymmetry and randomness in neural network connectivity.

    Science.gov (United States)

    Esposito, Umberto; Giugliano, Michele; van Rossum, Mark; Vasilaki, Eleni

    2014-01-01

    Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

  10. Epidemics on adaptive networks with geometric constraints

    Science.gov (United States)

    Shaw, Leah; Schwartz, Ira

    2008-03-01

    When a population is faced with an epidemic outbreak, individuals may modify their social behavior to avoid exposure to the disease. Recent work has considered models in which the contact network is rewired dynamically so that susceptibles avoid contact with infectives. We consider extensions in which the rewiring is subject to constraints that preserve key properties of the social network structure. Constraining to a fixed degree distribution destroys previously observed bistable behavior. The most effective rewiring strategy is found to depend on the spreading rate.

  11. The Random Walk Model Based on Bipartite Network

    Directory of Open Access Journals (Sweden)

    Zhang Man-Dun

    2016-01-01

    Full Text Available With the continuing development of the electronic commerce and growth of network information, there is a growing possibility for citizens to be confused by the information. Though the traditional technology of information retrieval have the ability to relieve the overload of information in some extent, it can not offer a targeted personality service based on user’s interests and activities. In this context, the recommendation algorithm arose. In this paper, on the basis of conventional recommendation, we studied the scheme of random walk based on bipartite network and the application of it. We put forward a similarity measurement based on implicit feedback. In this method, a uneven character vector is imported(the weight of item in the system. We put forward a improved random walk pattern which make use of partial or incomplete neighbor information to create recommendation information. In the end, there is an experiment in the real data set, the recommendation accuracy and practicality are improved. We promise the reality of the result of the experiment

  12. Framework for cascade size calculations on random networks

    Science.gov (United States)

    Burkholz, Rebekka; Schweitzer, Frank

    2018-04-01

    We present a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size. Our method is exact and applies to network ensembles with almost arbitrary degree distribution, degree-degree correlations, and, in case of threshold models, for arbitrary threshold distribution. With our approach, we shift the perspective from the known branching process approximations to the iterative update of suitable probability distributions. Such distributions are key to capture cascade dynamics that involve possibly continuous quantities and that depend on the cascade history, e.g., if load is accumulated over time. As a proof of concept, we provide two examples: (a) Constant load models that cover many of the analytically tractable casacade models, and, as a highlight, (b) a fiber bundle model that was not tractable by branching process approximations before. Our derivations cover the whole cascade dynamics, not only their steady state. This allows us to include interventions in time or further model complexity in the analysis.

  13. On the effect of memory in one-dimensional K=4 automata on networks

    Science.gov (United States)

    Alonso-Sanz, Ramón; Cárdenas, Juan Pablo

    2008-12-01

    The effect of implementing memory in cells of one-dimensional CA, and on nodes of various types of automata on networks with increasing degrees of random rewiring is studied in this article, paying particular attention to the case of four inputs. As a rule, memory induces a moderation in the rate of changing nodes and in the damage spreading, albeit in the latter case memory turns out to be ineffective in the control of the damage as the wiring network moves away from the ordered structure that features proper one-dimensional CA. This article complements the previous work done in the two-dimensional context.

  14. Rewiring food systems to enhance human health and biosphere stewardship

    Science.gov (United States)

    Gordon, Line J.; Bignet, Victoria; Crona, Beatrice; Henriksson, Patrik J. G.; Van Holt, Tracy; Jonell, Malin; Lindahl, Therese; Troell, Max; Barthel, Stephan; Deutsch, Lisa; Folke, Carl; Jamila Haider, L.; Rockström, Johan; Queiroz, Cibele

    2017-10-01

    Food lies at the heart of both health and sustainability challenges. We use a social-ecological framework to illustrate how major changes to the volume, nutrition and safety of food systems between 1961 and today impact health and sustainability. These changes have almost halved undernutrition while doubling the proportion who are overweight. They have also resulted in reduced resilience of the biosphere, pushing four out of six analysed planetary boundaries across the safe operating space of the biosphere. Our analysis further illustrates that consumers and producers have become more distant from one another, with substantial power consolidated within a small group of key actors. Solutions include a shift from a volume-focused production system to focus on quality, nutrition, resource use efficiency, and reduced antimicrobial use. To achieve this, we need to rewire food systems in ways that enhance transparency between producers and consumers, mobilize key actors to become biosphere stewards, and re-connect people to the biosphere.

  15. Neural circuit rewiring: insights from DD synapse remodeling.

    Science.gov (United States)

    Kurup, Naina; Jin, Yishi

    2016-01-01

    Nervous systems exhibit many forms of neuronal plasticity during growth, learning and memory consolidation, as well as in response to injury. Such plasticity can occur across entire nervous systems as with the case of insect metamorphosis, in individual classes of neurons, or even at the level of a single neuron. A striking example of neuronal plasticity in C. elegans is the synaptic rewiring of the GABAergic Dorsal D-type motor neurons during larval development, termed DD remodeling. DD remodeling entails multi-step coordination to concurrently eliminate pre-existing synapses and form new synapses on different neurites, without changing the overall morphology of the neuron. This mini-review focuses on recent advances in understanding the cellular and molecular mechanisms driving DD remodeling.

  16. Dynamic and interacting complex networks

    Science.gov (United States)

    Dickison, Mark E.

    individuals protect themselves by disconnecting their links to infected neighbors with probability w and reconnecting them to other susceptible individuals chosen at random. Starting from a single infected individual, we show by an analytical approach and simulations that there is a phase transition at a critical rewiring (quarantine) threshold wc separating a phase (w wc) where the disease does not spread out. We find that in our model the topology of the network strongly affects the size of the propagation and that wc increases with the mean degree and heterogeneity of the network. We also find that wc is reduced if we perform a preferential rewiring, in which the rewiring probability is proportional to the degree of infected nodes. In the fourth chapter, we study epidemic processes on interconnected network systems, and find two distinct regimes. In strongly-coupled network systems, epidemics occur simultaneously across the entire system at a critical value betac. In contrast, in weakly-coupled network systems, a mixed phase exists below betac where an epidemic occurs in one network but does not spread to the coupled network. We derive an expression for the network and disease parameters that allow this mixed phase and verify it numerically. Public health implications of communities comprising these two classes of network systems are also mentioned.

  17. Analysis of social network - An approach towards evaluation of spreading of epidemics in randomized social Network.

    OpenAIRE

    Rasmita Panigrahi; Trilochan Rout

    2012-01-01

    Classifying nodes in a network is a task with wide range of applications .it can be particularly useful in epidemics detection .Many resources are invested in the task of epidemics and precisely allow human investigators to work more efficiently. This work creates random and scale- free graphs the simulations with varying relative infectiousness and graph size performed. By using computer simulations it should be possible to model such epidemic Phenomena and to better understand the role play...

  18. Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Heide, J; Zhang, Qi; Fitzek, F H P

    2013-01-01

    This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...... reduction in the number of transmitted packets can be achieved. However, NC introduces additional computations and potentially a non-negligible transmission overhead, both of which depend on the chosen coding parameters. Therefore it is necessary to consider the trade-off that these coding parameters...... present in order to obtain the lowest energy consumption per transmitted bit. This problem is analyzed and suitable coding parameters are determined for the popular Tmote Sky platform. Compared to the use of traditional RLNC, these parameters enable a reduction in the energy spent per bit which grows...

  19. Information filtering via biased random walk on coupled social network.

    Science.gov (United States)

    Nie, Da-Cheng; Zhang, Zi-Ke; Dong, Qiang; Sun, Chongjing; Fu, Yan

    2014-01-01

    The recommender systems have advanced a great deal in the past two decades. However, most researchers focus their attentions on mining the similarities among users or objects in recommender systems and overlook the social influence which plays an important role in users' purchase process. In this paper, we design a biased random walk algorithm on coupled social networks which gives recommendation results based on both social interests and users' preference. Numerical analyses on two real data sets, Epinions and Friendfeed, demonstrate the improvement of recommendation performance by taking social interests into account, and experimental results show that our algorithm can alleviate the user cold-start problem more effectively compared with the mass diffusion and user-based collaborative filtering methods.

  20. Minimum spanning trees and random resistor networks in d dimensions.

    Science.gov (United States)

    Read, N

    2005-09-01

    We consider minimum-cost spanning trees, both in lattice and Euclidean models, in d dimensions. For the cost of the optimum tree in a box of size L , we show that there is a correction of order L(theta) , where theta or =1 . The arguments all rely on the close relation of Kruskal's greedy algorithm for the minimum spanning tree, percolation, and (for some arguments) random resistor networks. The scaling of the entropy and free energy at small nonzero T , and hence of the number of near-optimal solutions, is also discussed. We suggest that the Steiner tree problem is in the same universality class as the minimum spanning tree in all dimensions, as is the traveling salesman problem in two dimensions. Hence all will have the same value of theta=-3/4 in two dimensions.

  1. Anomalous diffusion on 2d randomly oriented diode networks

    International Nuclear Information System (INIS)

    Aydiner, E.; Kiymach, K.

    2002-01-01

    In this work, we have studied the diffusion properties of a randomly oriented two- dimensional diode network, using Monte Carlo Simulation method. The characteristic exponent α of the diffusion is obtained against the reverse transition probability W γ . We have found two critical values of W γ ; 0.003 and 0.4. α has been found to be 0.376 for W γ ≤ 0.003, and ≅ 1 for W γ ≥ 0.4 . For W γ >0.4 normal diffusion, and for 0.003≤W γ ≤0.4 anomalous sub-diffusion are observed. But for W γ ≤0.003 there seems to be no diffusion at all

  2. Features of Random Metal Nanowire Networks with Application in Transparent Conducting Electrodes

    KAUST Repository

    Maloth, Thirupathi

    2017-01-01

    in terms of sheet resistance and optical transmittance. However, as the electrical properties of such random networks are achieved thanks to a percolation network, a minimum size of the electrodes is needed so it actually exceeds the representative volume

  3. The effect of zealots on the rate of consensus achievement in complex networks

    Science.gov (United States)

    Kashisaz, Hadi; Hosseini, S. Samira; Darooneh, Amir H.

    2014-05-01

    In this study, we investigate the role of zealots on the result of voting process on both scale-free and Watts-Strogatz networks. We observe that inflexible individuals are very effective in consensus achievement and also in the rate of ordering process in complex networks. Zealots make the magnetization of the system to vary exponentially with time. We obtain that on SF networks, increasing the zealots' population, Z, exponentially increases the rate of consensus achievement. The time needed for the system to reach a desired magnetization, shows a power-law dependence on Z. As well, we obtain that the decay time of the order parameter shows a power-law dependence on Z. We also investigate the role of zealots' degree on the rate of ordering process and finally, we analyze the effect of network's randomness on the efficiency of zealots. Moving from a regular to a random network, the re-wiring probability P increases. We show that with increasing P, the efficiency of zealots for reducing the consensus achievement time increases. The rate of consensus is compared with the rate of ordering for different re-wiring probabilities of WS networks.

  4. Hodge Decomposition of Information Flow on Small-World Networks.

    Science.gov (United States)

    Haruna, Taichi; Fujiki, Yuuya

    2016-01-01

    We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

  5. Hodge decomposition of information flow on small-world networks

    Directory of Open Access Journals (Sweden)

    Taichi Haruna

    2016-09-01

    Full Text Available We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

  6. Damage Spreading in Spatial and Small-world Random Boolean Networks

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.

    2014-02-18

    The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

  7. Evolution of regulatory networks towards adaptability and stability in a changing environment

    Science.gov (United States)

    Lee, Deok-Sun

    2014-11-01

    Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

  8. Complementary feeding: a Global Network cluster randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Pasha Omrana

    2011-01-01

    Full Text Available Abstract Background Inadequate and inappropriate complementary feeding are major factors contributing to excess morbidity and mortality in young children in low resource settings. Animal source foods in particular are cited as essential to achieve micronutrient requirements. The efficacy of the recommendation for regular meat consumption, however, has not been systematically evaluated. Methods/Design A cluster randomized efficacy trial was designed to test the hypothesis that 12 months of daily intake of beef added as a complementary food would result in greater linear growth velocity than a micronutrient fortified equi-caloric rice-soy cereal supplement. The study is being conducted in 4 sites of the Global Network for Women's and Children's Health Research located in Guatemala, Pakistan, Democratic Republic of the Congo (DRC and Zambia in communities with toddler stunting rates of at least 20%. Five clusters per country were randomized to each of the food arms, with 30 infants in each cluster. The daily meat or cereal supplement was delivered to the home by community coordinators, starting when the infants were 6 months of age and continuing through 18 months. All participating mothers received nutrition education messages to enhance complementary feeding practices delivered by study coordinators and through posters at the local health center. Outcome measures, obtained at 6, 9, 12, and 18 months by a separate assessment team, included anthropometry; dietary variety and diversity scores; biomarkers of iron, zinc and Vitamin B12 status (18 months; neurocognitive development (12 and 18 months; and incidence of infectious morbidity throughout the trial. The trial was supervised by a trial steering committee, and an independent data monitoring committee provided oversight for the safety and conduct of the trial. Discussion Findings from this trial will test the efficacy of daily intake of meat commencing at age 6 months and, if beneficial, will

  9. The investigation of social networks based on multi-component random graphs

    Science.gov (United States)

    Zadorozhnyi, V. N.; Yudin, E. B.

    2018-01-01

    The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdôs-Rényi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network projects.

  10. Small-world effect induced by weight randomization on regular networks

    International Nuclear Information System (INIS)

    Li, Menghui; Fan, Ying; Wang, Dahui; Li, Daqing; Wu, Jinshan; Di, Zengru

    2007-01-01

    The concept of edge weight provides additional depth for describing and adjusting the properties of networks. Redistribution of edge weight can effectively change the properties of networks even though the corresponding binary topology remains unchanged. Based on regular networks with initially homogeneous dissimilarity weights, random redistribution of edge weight can be enough to induce small world phenomena. The effects of random weight redistribution on both static properties and dynamical models of networks are investigated. The results reveal that randomization of weight can enhance the ability of synchronization of chaotic systems dramatically

  11. Distributed Detection with Collisions in a Random, Single-Hop Wireless Sensor Network

    Science.gov (United States)

    2013-05-26

    public release; distribution is unlimited. Distributed detection with collisions in a random, single-hop wireless sensor network The views, opinions...1274 2 ABSTRACT Distributed detection with collisions in a random, single-hop wireless sensor network Report Title We consider the problem of... WIRELESS SENSOR NETWORK Gene T. Whipps?† Emre Ertin† Randolph L. Moses† ?U.S. Army Research Laboratory, Adelphi, MD 20783 †The Ohio State University

  12. The data-driven null models for information dissemination tree in social networks

    Science.gov (United States)

    Zhang, Zhiwei; Wang, Zhenyu

    2017-10-01

    For the purpose of detecting relatedness and co-occurrence between users, as well as the distribution features of nodes in spreading path of a social network, this paper explores topological characteristics of information dissemination trees (IDT) that can be employed indirectly to probe the information dissemination laws within social networks. Hence, three different null models of IDT are presented in this article, including the statistical-constrained 0-order IDT null model, the random-rewire-broken-edge 0-order IDT null model and the random-rewire-broken-edge 2-order IDT null model. These null models firstly generate the corresponding randomized copy of an actual IDT; then the extended significance profile, which is developed by adding the cascade ratio of information dissemination path, is exploited not only to evaluate degree correlation of two nodes associated with an edge, but also to assess the cascade ratio of different length of information dissemination paths. The experimental correspondences of the empirical analysis for several SinaWeibo IDTs and Twitter IDTs indicate that the IDT null models presented in this paper perform well in terms of degree correlation of nodes and dissemination path cascade ratio, which can be better to reveal the features of information dissemination and to fit the situation of real social networks.

  13. The generation of random directed networks with prescribed 1-node and 2-node degree correlations

    Energy Technology Data Exchange (ETDEWEB)

    Zamora-Lopez, Gorka; Kurths, Juergen [Institute of Physics, University of Potsdam, PO Box 601553, 14415 Potsdam (Germany); Zhou Changsong [Department of Physics, Hong Kong Baptist University, Kowloon Tong, Hong Kong (China); Zlatic, Vinko [Rudjer Boskovic Institute, PO Box 180, HR-10002 Zagreb (Croatia)

    2008-06-06

    The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.

  14. The generation of random directed networks with prescribed 1-node and 2-node degree correlations

    International Nuclear Information System (INIS)

    Zamora-Lopez, Gorka; Kurths, Juergen; Zhou Changsong; Zlatic, Vinko

    2008-01-01

    The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations

  15. Parameters affecting the resilience of scale-free networks to random failures.

    Energy Technology Data Exchange (ETDEWEB)

    Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran (University of New Mexico, Albuquerque, NM); Saia, Jared (University of New Mexico, Albuquerque, NM)

    2005-09-01

    It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

  16. An effective method to improve the robustness of small-world networks under attack

    International Nuclear Information System (INIS)

    Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

    2014-01-01

    In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network. Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario. (interdisciplinary physics and related areas of science and technology)

  17. Generating clustered scale-free networks using Poisson based localization of edges

    Science.gov (United States)

    Türker, İlker

    2018-05-01

    We introduce a variety of network models using a Poisson-based edge localization strategy, which result in clustered scale-free topologies. We first verify the success of our localization strategy by realizing a variant of the well-known Watts-Strogatz model with an inverse approach, implying a small-world regime of rewiring from a random network through a regular one. We then apply the rewiring strategy to a pure Barabasi-Albert model and successfully achieve a small-world regime, with a limited capacity of scale-free property. To imitate the high clustering property of scale-free networks with higher accuracy, we adapted the Poisson-based wiring strategy to a growing network with the ingredients of both preferential attachment and local connectivity. To achieve the collocation of these properties, we used a routine of flattening the edges array, sorting it, and applying a mixing procedure to assemble both global connections with preferential attachment and local clusters. As a result, we achieved clustered scale-free networks with a computational fashion, diverging from the recent studies by following a simple but efficient approach.

  18. Electrospun dye-doped fiber networks: lasing emission from randomly distributed cavities

    DEFF Research Database (Denmark)

    Krammer, Sarah; Vannahme, Christoph; Smith, Cameron

    2015-01-01

    Dye-doped polymer fiber networks fabricated with electrospinning exhibit comb-like laser emission. We identify randomly distributed ring resonators being responsible for lasing emission by making use of spatially resolved spectroscopy. Numerical simulations confirm this result quantitatively....

  19. Completely random measures for modelling block-structured sparse networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Schmidt, Mikkel Nørgaard; Mørup, Morten

    2016-01-01

    Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... have a power-law distribution of the vertices which in turn implies the number of edges scale slower than quadratically in the number of vertices. These assumptions are fundamentally irreconcilable as the Aldous-Hoover theorem implies quadratic scaling of the number of edges. Recently Caron and Fox...

  20. On the hop count statistics for randomly deployed wireless sensor networks

    NARCIS (Netherlands)

    Dulman, S.O.; Rossi, M.; Havinga, Paul J.M.; Zorzi, M.

    2006-01-01

    In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless sensor network) to design improved networking protocols. Specifically, we derive the relationship between the number of

  1. The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.

    Science.gov (United States)

    Gu, Weiwei; Gong, Li; Lou, Xiaodan; Zhang, Jiang

    2017-10-13

    Network embedding which encodes all vertices in a network as a set of numerical vectors in accordance with it's local and global structures, has drawn widespread attention. Network embedding not only learns significant features of a network, such as the clustering and linking prediction but also learns the latent vector representation of the nodes which provides theoretical support for a variety of applications, such as visualization, link prediction, node classification, and recommendation. As the latest progress of the research, several algorithms based on random walks have been devised. Although those algorithms have drawn much attention for their high scores in learning efficiency and accuracy, there is still a lack of theoretical explanation, and the transparency of those algorithms has been doubted. Here, we propose an approach based on the open-flow network model to reveal the underlying flow structure and its hidden metric space of different random walk strategies on networks. We show that the essence of embedding based on random walks is the latent metric structure defined on the open-flow network. This not only deepens our understanding of random- walk-based embedding algorithms but also helps in finding new potential applications in network embedding.

  2. Critical node lifetimes in random networks via the Chen-Stein method

    NARCIS (Netherlands)

    Franceschetti, M.; Meester, R.W.J.

    2006-01-01

    This correspondence considers networks where nodes are connected randomly and can fail at random times. It provides scaling laws that allow to find the critical time at which isolated nodes begin to appear in the system as its size tends to infinity. Applications are in the areas of sensor and

  3. Delineating social network data anonymization via random edge perturbation

    KAUST Repository

    Xue, Mingqiang; Karras, Panagiotis; Raï ssi, Chedy; Kalnis, Panos; Pung, Hungkeng

    2012-01-01

    study of the probability of success of any}structural attack as a function of the perturbation probability. Our analysis provides a powerful tool for delineating the identification risk of perturbed social network data; our extensive experiments

  4. Will electrical cyber-physical interdependent networks undergo first-order transition under random attacks?

    Science.gov (United States)

    Ji, Xingpei; Wang, Bo; Liu, Dichen; Dong, Zhaoyang; Chen, Guo; Zhu, Zhenshan; Zhu, Xuedong; Wang, Xunting

    2016-10-01

    Whether the realistic electrical cyber-physical interdependent networks will undergo first-order transition under random failures still remains a question. To reflect the reality of Chinese electrical cyber-physical system, the "partial one-to-one correspondence" interdependent networks model is proposed and the connectivity vulnerabilities of three realistic electrical cyber-physical interdependent networks are analyzed. The simulation results show that due to the service demands of power system the topologies of power grid and its cyber network are highly inter-similar which can effectively avoid the first-order transition. By comparing the vulnerability curves between electrical cyber-physical interdependent networks and its single-layer network, we find that complex network theory is still useful in the vulnerability analysis of electrical cyber-physical interdependent networks.

  5. Modular pathway rewiring of Saccharomyces cerevisiae enables high-level production of L-ornithine

    DEFF Research Database (Denmark)

    Qin, Jiufu; Zhou, Yongjin J.; Krivoruchko, Anastasia

    2015-01-01

    intermediates can serve as platform cell factories for production of such products. Here we implement a modular pathway rewiring (MPR) strategy and demonstrate its use for pathway optimization resulting in high-level production of L-ornithine, an intermediate of L-arginine biosynthesis and a precursor...

  6. Explicit instructions and consolidation promote rewiring of automatic behaviors in the human mind.

    Science.gov (United States)

    Szegedi-Hallgató, Emese; Janacsek, Karolina; Vékony, Teodóra; Tasi, Lia Andrea; Kerepes, Leila; Hompoth, Emőke Adrienn; Bálint, Anna; Németh, Dezső

    2017-06-29

    One major challenge in human behavior and brain sciences is to understand how we can rewire already existing perceptual, motor, cognitive, and social skills or habits. Here we aimed to characterize one aspect of rewiring, namely, how we can update our knowledge of sequential/statistical regularities when they change. The dynamics of rewiring was explored from learning to consolidation using a unique experimental design which is suitable to capture the effect of implicit and explicit processing and the proactive and retroactive interference. Our results indicate that humans can rewire their knowledge of such regularities incidentally, and consolidation has a critical role in this process. Moreover, old and new knowledge can coexist, leading to effective adaptivity of the human mind in the changing environment, although the execution of the recently acquired knowledge may be more fluent than the execution of the previously learned one. These findings can contribute to a better understanding of the cognitive processes underlying behavior change, and can provide insights into how we can boost behavior change in various contexts, such as sports, educational settings or psychotherapy.

  7. TCA cycle rewiring fosters metabolic adaptation to oxygen restriction in skeletal muscle from rodents and humans.

    Science.gov (United States)

    Capitanio, Daniele; Fania, Chiara; Torretta, Enrica; Viganò, Agnese; Moriggi, Manuela; Bravatà, Valentina; Caretti, Anna; Levett, Denny Z H; Grocott, Michael P W; Samaja, Michele; Cerretelli, Paolo; Gelfi, Cecilia

    2017-08-29

    In mammals, hypoxic stress management is under the control of the Hypoxia Inducible Factors, whose activity depends on the stabilization of their labile α subunit. In particular, the skeletal muscle appears to be able to react to changes in substrates and O 2 delivery by tuning its metabolism. The present study provides a comprehensive overview of skeletal muscle metabolic adaptation to hypoxia in mice and in human subjects exposed for 7/9 and 19 days to high altitude levels. The investigation was carried out combining proteomics, qRT-PCR mRNA transcripts analysis, and enzyme activities assessment in rodents, and protein detection by antigen antibody reactions in humans and rodents. Results indicate that the skeletal muscle react to a decreased O 2 delivery by rewiring the TCA cycle. The first TCA rewiring occurs in mice in 2-day hypoxia and is mediated by cytosolic malate whereas in 10-day hypoxia the rewiring is mediated by Idh1 and Fasn, supported by glutamine and HIF-2α increments. The combination of these specific anaplerotic steps can support energy demand despite HIFs degradation. These results were confirmed in human subjects, demonstrating that the TCA double rewiring represents an essential factor for the maintenance of muscle homeostasis during adaptation to hypoxia.

  8. Financial Time Series Prediction Using Elman Recurrent Random Neural Networks

    Directory of Open Access Journals (Sweden)

    Jie Wang

    2016-01-01

    (ERNN, the empirical results show that the proposed neural network displays the best performance among these neural networks in financial time series forecasting. Further, the empirical research is performed in testing the predictive effects of SSE, TWSE, KOSPI, and Nikkei225 with the established model, and the corresponding statistical comparisons of the above market indices are also exhibited. The experimental results show that this approach gives good performance in predicting the values from the stock market indices.

  9. Randomization and resilience of brain functional networks as systems-level endophenotypes of schizophrenia.

    Science.gov (United States)

    Lo, Chun-Yi Zac; Su, Tsung-Wei; Huang, Chu-Chung; Hung, Chia-Chun; Chen, Wei-Ling; Lan, Tsuo-Hung; Lin, Ching-Po; Bullmore, Edward T

    2015-07-21

    Schizophrenia is increasingly conceived as a disorder of brain network organization or dysconnectivity syndrome. Functional MRI (fMRI) networks in schizophrenia have been characterized by abnormally random topology. We tested the hypothesis that network randomization is an endophenotype of schizophrenia and therefore evident also in nonpsychotic relatives of patients. Head movement-corrected, resting-state fMRI data were acquired from 25 patients with schizophrenia, 25 first-degree relatives of patients, and 29 healthy volunteers. Graphs were used to model functional connectivity as a set of edges between regional nodes. We estimated the topological efficiency, clustering, degree distribution, resilience, and connection distance (in millimeters) of each functional network. The schizophrenic group demonstrated significant randomization of global network metrics (reduced clustering, greater efficiency), a shift in the degree distribution to a more homogeneous form (fewer hubs), a shift in the distance distribution (proportionally more long-distance edges), and greater resilience to targeted attack on network hubs. The networks of the relatives also demonstrated abnormal randomization and resilience compared with healthy volunteers, but they were typically less topologically abnormal than the patients' networks and did not have abnormal connection distances. We conclude that schizophrenia is associated with replicable and convergent evidence for functional network randomization, and a similar topological profile was evident also in nonpsychotic relatives, suggesting that this is a systems-level endophenotype or marker of familial risk. We speculate that the greater resilience of brain networks may confer some fitness advantages on nonpsychotic relatives that could explain persistence of this endophenotype in the population.

  10. A new neural network model for solving random interval linear programming problems.

    Science.gov (United States)

    Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

    2017-05-01

    This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

  11. Corrections to scaling in random resistor networks and diluted continuous spin models near the percolation threshold.

    Science.gov (United States)

    Janssen, Hans-Karl; Stenull, Olaf

    2004-02-01

    We investigate corrections to scaling induced by irrelevant operators in randomly diluted systems near the percolation threshold. The specific systems that we consider are the random resistor network and a class of continuous spin systems, such as the x-y model. We focus on a family of least irrelevant operators and determine the corrections to scaling that originate from this family. Our field theoretic analysis carefully takes into account that irrelevant operators mix under renormalization. It turns out that long standing results on corrections to scaling are respectively incorrect (random resistor networks) or incomplete (continuous spin systems).

  12. Morphology and linear-elastic moduli of random network solids.

    Science.gov (United States)

    Nachtrab, Susan; Kapfer, Sebastian C; Arns, Christoph H; Madadi, Mahyar; Mecke, Klaus; Schröder-Turk, Gerd E

    2011-06-17

    The effective linear-elastic moduli of disordered network solids are analyzed by voxel-based finite element calculations. We analyze network solids given by Poisson-Voronoi processes and by the structure of collagen fiber networks imaged by confocal microscopy. The solid volume fraction ϕ is varied by adjusting the fiber radius, while keeping the structural mesh or pore size of the underlying network fixed. For intermediate ϕ, the bulk and shear modulus are approximated by empirical power-laws K(phi)proptophin and G(phi)proptophim with n≈1.4 and m≈1.7. The exponents for the collagen and the Poisson-Voronoi network solids are similar, and are close to the values n=1.22 and m=2.11 found in a previous voxel-based finite element study of Poisson-Voronoi systems with different boundary conditions. However, the exponents of these empirical power-laws are at odds with the analytic values of n=1 and m=2, valid for low-density cellular structures in the limit of thin beams. We propose a functional form for K(ϕ) that models the cross-over from a power-law at low densities to a porous solid at high densities; a fit of the data to this functional form yields the asymptotic exponent n≈1.00, as expected. Further, both the intensity of the Poisson-Voronoi process and the collagen concentration in the samples, both of which alter the typical pore or mesh size, affect the effective moduli only by the resulting change of the solid volume fraction. These findings suggest that a network solid with the structure of the collagen networks can be modeled in quantitative agreement by a Poisson-Voronoi process. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  13. A novel Random Walk algorithm with Compulsive Evolution for heat exchanger network synthesis

    International Nuclear Information System (INIS)

    Xiao, Yuan; Cui, Guomin

    2017-01-01

    Highlights: • A novel Random Walk Algorithm with Compulsive Evolution is proposed for HENS. • A simple and feasible evolution strategy is presented in RWCE algorithm. • The integer and continuous variables of HEN are optimized simultaneously in RWCE. • RWCE is demonstrated a relatively strong global search ability in HEN optimization. - Abstract: The heat exchanger network (HEN) synthesis can be characterized as highly combinatorial, nonlinear and nonconvex, contributing to unmanageable computational time and a challenge in identifying the global optimal network design. Stochastic methods are robust and show a powerful global optimizing ability. Based on the common characteristic of different stochastic methods, namely randomness, a novel Random Walk algorithm with Compulsive Evolution (RWCE) is proposed to achieve the best possible total annual cost of heat exchanger network with the relatively simple and feasible evolution strategy. A population of heat exchanger networks is first randomly initialized. Next, the heat load of heat exchanger for each individual is randomly expanded or contracted in order to optimize both the integer and continuous variables simultaneously and to obtain the lowest total annual cost. Besides, when individuals approach to local optima, there is a certain probability for them to compulsively accept the imperfect networks in order to keep the population diversity and ability of global optimization. The presented method is then applied to heat exchanger network synthesis cases from the literature to compare the best results published. RWCE consistently has a lower computed total annual cost compared to previously published results.

  14. Analytical connection between thresholds and immunization strategies of SIS model in random networks

    Science.gov (United States)

    Zhou, Ming-Yang; Xiong, Wen-Man; Liao, Hao; Wang, Tong; Wei, Zong-Wen; Fu, Zhong-Qian

    2018-05-01

    Devising effective strategies for hindering the propagation of viruses and protecting the population against epidemics is critical for public security and health. Despite a number of studies based on the susceptible-infected-susceptible (SIS) model devoted to this topic, we still lack a general framework to compare different immunization strategies in completely random networks. Here, we address this problem by suggesting a novel method based on heterogeneous mean-field theory for the SIS model. Our method builds the relationship between the thresholds and different immunization strategies in completely random networks. Besides, we provide an analytical argument that the targeted large-degree strategy achieves the best performance in random networks with arbitrary degree distribution. Moreover, the experimental results demonstrate the effectiveness of the proposed method in both artificial and real-world networks.

  15. CUFID-query: accurate network querying through random walk based network flow estimation.

    Science.gov (United States)

    Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

    2017-12-28

    Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive

  16. Convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks

    Science.gov (United States)

    Long, Yin; Zhang, Xiao-Jun; Wang, Kui

    2018-05-01

    In this paper, convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks (RBDNs) are studied. First, we find and demonstrate that the average degree is convergent in the form of power law. Meanwhile, we discover that the ratios of the back items to front items of convergent reminder are independent of network link number for large network size, and we theoretically prove that the limit of the ratio is a constant. Moreover, since it is difficult to calculate the analytical solution of the average degree for large network sizes, we adopt numerical method to obtain approximate expression of the average degree to approximate its analytical solution. Finally, simulations are presented to verify our theoretical results.

  17. Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

    Directory of Open Access Journals (Sweden)

    Amber Israr

    2016-04-01

    Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

  18. A random walk evolution model of wireless sensor networks and virus spreading

    International Nuclear Information System (INIS)

    Wang Ya-Qi; Yang Xiao-Yuan

    2013-01-01

    In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks (WSNs) due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations. (general)

  19. Resilience of networks to environmental stress: From regular to random networks

    Science.gov (United States)

    Eom, Young-Ho

    2018-04-01

    Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collapse at critical stress with hysteresis and vulnerability to perturbations. We demonstrate that this difference results from a trade-off between node resilience and network resilience to environmental stress. The nodes in the disordered networks can suppress their collapses due to the small-world topology of the networks but eventually collapse all together in return. Our findings indicate that some real networks can be highly resilient against environmental stress to a threshold yet extremely vulnerable to the stress above the threshold because of their small-world topology.

  20. Peer-Assisted Content Distribution with Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Ledet-Pedersen, Jeppe; Sluyterman, Georg

    2014-01-01

    Peer-to-peer networks constitute a widely used, cost-effective and scalable technology to distribute bandwidth-intensive content. The technology forms a great platform to build distributed cloud storage without the need of a central provider. However, the majority of todays peer-to-peer systems...

  1. Evaluation of geocast routing trees on random and actual networks

    NARCIS (Netherlands)

    Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

    2017-01-01

    Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

  2. Application of Poisson random effect models for highway network screening.

    Science.gov (United States)

    Jiang, Ximiao; Abdel-Aty, Mohamed; Alamili, Samer

    2014-02-01

    In recent years, Bayesian random effect models that account for the temporal and spatial correlations of crash data became popular in traffic safety research. This study employs random effect Poisson Log-Normal models for crash risk hotspot identification. Both the temporal and spatial correlations of crash data were considered. Potential for Safety Improvement (PSI) were adopted as a measure of the crash risk. Using the fatal and injury crashes that occurred on urban 4-lane divided arterials from 2006 to 2009 in the Central Florida area, the random effect approaches were compared to the traditional Empirical Bayesian (EB) method and the conventional Bayesian Poisson Log-Normal model. A series of method examination tests were conducted to evaluate the performance of different approaches. These tests include the previously developed site consistence test, method consistence test, total rank difference test, and the modified total score test, as well as the newly proposed total safety performance measure difference test. Results show that the Bayesian Poisson model accounting for both temporal and spatial random effects (PTSRE) outperforms the model that with only temporal random effect, and both are superior to the conventional Poisson Log-Normal model (PLN) and the EB model in the fitting of crash data. Additionally, the method evaluation tests indicate that the PTSRE model is significantly superior to the PLN model and the EB model in consistently identifying hotspots during successive time periods. The results suggest that the PTSRE model is a superior alternative for road site crash risk hotspot identification. Copyright © 2013 Elsevier Ltd. All rights reserved.

  3. Randomizing world trade. II. A weighted network analysis

    Science.gov (United States)

    Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

    2011-10-01

    Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects.

  4. Random access to mobile networks with advanced error correction

    Science.gov (United States)

    Dippold, Michael

    1990-01-01

    A random access scheme for unreliable data channels is investigated in conjunction with an adaptive Hybrid-II Automatic Repeat Request (ARQ) scheme using Rate Compatible Punctured Codes (RCPC) Forward Error Correction (FEC). A simple scheme with fixed frame length and equal slot sizes is chosen and reservation is implicit by the first packet transmitted randomly in a free slot, similar to Reservation Aloha. This allows the further transmission of redundancy if the last decoding attempt failed. Results show that a high channel utilization and superior throughput can be achieved with this scheme that shows a quite low implementation complexity. For the example of an interleaved Rayleigh channel and soft decision utilization and mean delay are calculated. A utilization of 40 percent may be achieved for a frame with the number of slots being equal to half the station number under high traffic load. The effects of feedback channel errors and some countermeasures are discussed.

  5. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems.

    Directory of Open Access Journals (Sweden)

    Martin Rosvall

    Full Text Available To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network--the optimal number of levels and modular partition at each level--with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines: life sciences, physical sciences, ecology and earth sciences, and social sciences. In general, we find shallow hierarchical structures in globally interconnected systems, such as neural networks, and rich multilevel organizations in systems with highly separated regions, such as road networks.

  6. Fully-distributed randomized cooperation in wireless sensor networks

    KAUST Repository

    Bader, Ahmed

    2015-01-07

    When marrying randomized distributed space-time coding (RDSTC) to geographical routing, new performance horizons can be created. In order to reach those horizons however, routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geographical routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes.

  7. Fully-distributed randomized cooperation in wireless sensor networks

    KAUST Repository

    Bader, Ahmed; Abed-Meraim, Karim; Alouini, Mohamed-Slim

    2015-01-01

    When marrying randomized distributed space-time coding (RDSTC) to geographical routing, new performance horizons can be created. In order to reach those horizons however, routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geographical routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes.

  8. Network meta-analysis incorporating randomized controlled trials and non-randomized comparative cohort studies for assessing the safety and effectiveness of medical treatments: challenges and opportunities

    OpenAIRE

    Cameron, Chris; Fireman, Bruce; Hutton, Brian; Clifford, Tammy; Coyle, Doug; Wells, George; Dormuth, Colin R.; Platt, Robert; Toh, Sengwee

    2015-01-01

    Network meta-analysis is increasingly used to allow comparison of multiple treatment alternatives simultaneously, some of which may not have been compared directly in primary research studies. The majority of network meta-analyses published to date have incorporated data from randomized controlled trials (RCTs) only; however, inclusion of non-randomized studies may sometimes be considered. Non-randomized studies can complement RCTs or address some of their limitations, such as short follow-up...

  9. Application of the load flow and random flow models for the analysis of power transmission networks

    International Nuclear Information System (INIS)

    Zio, Enrico; Piccinelli, Roberta; Delfanti, Maurizio; Olivieri, Valeria; Pozzi, Mauro

    2012-01-01

    In this paper, the classical load flow model and the random flow model are considered for analyzing the performance of power transmission networks. The analysis concerns both the system performance and the importance of the different system elements; this latter is computed by power flow and random walk betweenness centrality measures. A network system from the literature is analyzed, representing a simple electrical power transmission network. The results obtained highlight the differences between the LF “global approach” to flow dispatch and the RF local approach of randomized node-to-node load transfer. Furthermore, computationally the LF model is less consuming than the RF model but problems of convergence may arise in the LF calculation.

  10. The 'emergent scaling' phenomenon and the dielectric properties of random resistor-capacitor networks

    CERN Document Server

    Bouamrane, R

    2003-01-01

    An efficient algorithm, based on the Frank-Lobb reduction scheme, for calculating the equivalent dielectric properties of very large random resistor-capacitor (R-C) networks has been developed. It has been used to investigate the network size and composition dependence of dielectric properties and their statistical variability. The dielectric properties of 256 samples of random networks containing: 512, 2048, 8192 and 32 768 components distributed randomly in the ratios 60% R-40% C, 50% R-50% C and 40% R-60% C have been computed. It has been found that these properties exhibit the anomalous power law dependences on frequency known as the 'universal dielectric response' (UDR). Attention is drawn to the contrast between frequency ranges across which percolation determines dielectric response, where considerable variability is found amongst the samples, and those across which power laws define response where very little variability is found between samples. It is concluded that the power law UDRs are emergent pr...

  11. Emergence of multilevel selection in the prisoner's dilemma game on coevolving random networks

    International Nuclear Information System (INIS)

    Szolnoki, Attila; Perc, Matjaz

    2009-01-01

    We study the evolution of cooperation in the prisoner's dilemma game, whereby a coevolutionary rule is introduced that molds the random topology of the interaction network in two ways. First, existing links are deleted whenever a player adopts a new strategy or its degree exceeds a threshold value; second, new links are added randomly after a given number of game iterations. These coevolutionary processes correspond to the generic formation of new links and deletion of existing links that, especially in human societies, appear frequently as a consequence of ongoing socialization, change of lifestyle or death. Due to the counteraction of deletions and additions of links the initial heterogeneity of the interaction network is qualitatively preserved, and thus cannot be held responsible for the observed promotion of cooperation. Indeed, the coevolutionary rule evokes the spontaneous emergence of a powerful multilevel selection mechanism, which despite the sustained random topology of the evolving network, maintains cooperation across the whole span of defection temptation values.

  12. Shortest loops are pacemakers in random networks of electrically coupled axons

    Directory of Open Access Journals (Sweden)

    Nikita eVladimirov

    2012-04-01

    Full Text Available High-frequency oscillations (HFOs are an important part of brain activity in health and disease. However, their origins remain obscure and controversial. One possible mechanism depends on the presence of sparsely distributed gap junctions that electrically couple the axons of principal cells. A plexus of electrically coupled axons is modeled as a random network with bidirectional connections between its nodes. Under certain conditions the network can demonstrate one of two types of oscillatory activity. Type I oscillations (100-200 Hz are predicted to be caused by spontaneously spiking axons in a network with strong (high-conductance gap junctions. Type II oscillations (200-300 Hz require no spontaneous spiking and relatively weak (low-conductance gap junctions, across which spike propagation failures occur. The type II oscillations are reentrant and self-sustained. Here we examine what determines the frequency of type II oscillations. Using simulations we show that the distribution of loop lengths is the key factor for determining frequency in type II network oscillations. We first analyze spike failure between two electrically coupled cells using a model of anatomically reconstructed CA1 pyramidal neuron. Then network oscillations are studied by a cellular automaton model with random network connectivity, in which we control loop statistics. We show that oscillation periods can be predicted from the network's loop statistics. The shortest loop, around which a spike can travel, is the most likely pacemaker candidate.The principle of one loop as a pacemaker is remarkable, because random networks contain a large number of loops juxtaposed and superimposed, and their number rapidly grows with network size. This principle allows us to predict the frequency of oscillations from network connectivity and visa versa. We finally propose that type I oscillations may correspond to ripples, while type II oscillations correspond to so-called fast ripples.

  13. Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

    KAUST Repository

    Yasin Yazicioǧlu, A.; Egerstedt, Magnus; Shamma, Jeff S.

    2015-01-01

    Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

  14. Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

    KAUST Repository

    Yasin Yazicioǧlu, A.

    2015-11-25

    Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

  15. Decentralized formation of random regular graphs for robust multi-agent networks

    KAUST Repository

    Yazicioglu, A. Yasin

    2014-12-15

    Multi-agent networks are often modeled via interaction graphs, where the nodes represent the agents and the edges denote direct interactions between the corresponding agents. Interaction graphs have significant impact on the robustness of networked systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme maintains connectivity and the average degree while minimizing the degree differences and randomizing the links. As such, if the average degree of the initial graph is an integer, then connected regular graphs are realized uniformly at random as time goes to infinity.

  16. On the estimation variance for the specific Euler-Poincaré characteristic of random networks.

    Science.gov (United States)

    Tscheschel, A; Stoyan, D

    2003-07-01

    The specific Euler number is an important topological characteristic in many applications. It is considered here for the case of random networks, which may appear in microscopy either as primary objects of investigation or as secondary objects describing in an approximate way other structures such as, for example, porous media. For random networks there is a simple and natural estimator of the specific Euler number. For its estimation variance, a simple Poisson approximation is given. It is based on the general exact formula for the estimation variance. In two examples of quite different nature and topology application of the formulas is demonstrated.

  17. Probabilistic generation of random networks taking into account information on motifs occurrence.

    Science.gov (United States)

    Bois, Frederic Y; Gayraud, Ghislaine

    2015-01-01

    Because of the huge number of graphs possible even with a small number of nodes, inference on network structure is known to be a challenging problem. Generating large random directed graphs with prescribed probabilities of occurrences of some meaningful patterns (motifs) is also difficult. We show how to generate such random graphs according to a formal probabilistic representation, using fast Markov chain Monte Carlo methods to sample them. As an illustration, we generate realistic graphs with several hundred nodes mimicking a gene transcription interaction network in Escherichia coli.

  18. Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications

    Directory of Open Access Journals (Sweden)

    Zhongtuan Zheng

    2017-01-01

    Full Text Available This paper investigates, both theoretically and numerically, preferential random walks (PRW on weighted complex networks. By using two different analytical methods, two exact expressions are derived for the mean first passage time (MFPT between two nodes. On one hand, the MFPT is got explicitly in terms of the eigenvalues and eigenvectors of a matrix associated with the transition matrix of PRW. On the other hand, the center-product-degree (CPD is introduced as one measure of node strength and it plays a main role in determining the scaling of the MFPT for the PRW. Comparative studies are also performed on PRW and simple random walks (SRW. Numerical simulations of random walks on paradigmatic network models confirm analytical predictions and deepen discussions in different aspects. The work may provide a comprehensive approach for exploring random walks on complex networks, especially biased random walks, which may also help to better understand and tackle some practical problems such as search and routing on networks.

  19. Random matrix theory for analyzing the brain functional network in attention deficit hyperactivity disorder

    Science.gov (United States)

    Wang, Rong; Wang, Li; Yang, Yong; Li, Jiajia; Wu, Ying; Lin, Pan

    2016-11-01

    Attention deficit hyperactivity disorder (ADHD) is the most common childhood neuropsychiatric disorder and affects approximately 6 -7 % of children worldwide. Here, we investigate the statistical properties of undirected and directed brain functional networks in ADHD patients based on random matrix theory (RMT), in which the undirected functional connectivity is constructed based on correlation coefficient and the directed functional connectivity is measured based on cross-correlation coefficient and mutual information. We first analyze the functional connectivity and the eigenvalues of the brain functional network. We find that ADHD patients have increased undirected functional connectivity, reflecting a higher degree of linear dependence between regions, and increased directed functional connectivity, indicating stronger causality and more transmission of information among brain regions. More importantly, we explore the randomness of the undirected and directed functional networks using RMT. We find that for ADHD patients, the undirected functional network is more orderly than that for normal subjects, which indicates an abnormal increase in undirected functional connectivity. In addition, we find that the directed functional networks are more random, which reveals greater disorder in causality and more chaotic information flow among brain regions in ADHD patients. Our results not only further confirm the efficacy of RMT in characterizing the intrinsic properties of brain functional networks but also provide insights into the possibilities RMT offers for improving clinical diagnoses and treatment evaluations for ADHD patients.

  20. Structural constraints in complex networks

    International Nuclear Information System (INIS)

    Zhou, S; Mondragon, R J

    2007-01-01

    We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich-club connectivity are preserved. We consider three real networks, the autonomous system (AS)-Internet, protein interaction and scientific collaboration. We show that for a given degree distribution, the rich-club connectivity is sensitive to the degree-degree correlation, and on the other hand the degree-degree correlation is constrained by the rich-club connectivity. In particular, in the case of the Internet, the assortative coefficient is always negative and a minor change in its value can reverse the network's rich-club structure completely; while fixing the degree distribution and the rich-club connectivity restricts the assortative coefficient to such a narrow range, that a reasonable model of the Internet can be produced by considering mainly the degree distribution and the rich-club connectivity. We also comment on the suitability of using the maximal random network as a null model to assess the rich-club connectivity in real networks

  1. A Markov model for the temporal dynamics of balanced random networks of finite size

    Science.gov (United States)

    Lagzi, Fereshteh; Rotter, Stefan

    2014-01-01

    The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between

  2. Supporting Dynamic Adaptive Streaming over HTTP in Wireless Meshed Networks using Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work studies the potential and impact of the FRANC network coding protocol for delivering high quality Dynamic Adaptive Streaming over HTTP (DASH) in wireless networks. Although DASH aims to tailor the video quality rate based on the available throughput to the destination, it relies...

  3. Relay-aided multi-cell broadcasting with random network coding

    DEFF Research Database (Denmark)

    Lu, Lu; Sun, Fan; Xiao, Ming

    2010-01-01

    We investigate a relay-aided multi-cell broadcasting system using random network codes, where the focus is on devising efficient scheduling algorithms between relay and base stations. Two scheduling algorithms are proposed based on different feedback strategies; namely, a one-step scheduling...

  4. Scaling laws for file dissemination in P2P networks with random contacts

    NARCIS (Netherlands)

    Nunez-Queija, R.; Prabhu, B.

    2008-01-01

    In this paper we obtain the scaling law for the mean broadcast time of a file in a P2P network with an initial population of N nodes. In the model, at Poisson rate λ a node initiates a contact with another node chosen uniformly at random. This contact is said to be successful if the contacted node

  5. Scaling laws for file dissemination in P2P networks with random contacts

    NARCIS (Netherlands)

    Núñez-Queija, R.; Prabhu, B.

    2008-01-01

    In this paper we obtain the scaling law for the mean broadcast time of a file in a P2P network with an initial population of N nodes. In the model, at Poisson rate lambda a node initiates a contact with another node chosen uniformly at random. This contact is said to be successful if the contacted

  6. On the use of spin glass concepts in random automata networks

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, E N; Parga, N

    1988-06-01

    We apply concepts and techniques developed in the context of the mean-field theory of spin glasses to networks of random automata. This approach, proposed recently by Derrida and Flyvbjerg, may be useful in understanding the multivalley structure of the Kauffman model.

  7. Sequentially switching cell assemblies in random inhibitory networks of spiking neurons in the striatum.

    Science.gov (United States)

    Ponzi, Adam; Wickens, Jeff

    2010-04-28

    The striatum is composed of GABAergic medium spiny neurons with inhibitory collaterals forming a sparse random asymmetric network and receiving an excitatory glutamatergic cortical projection. Because the inhibitory collaterals are sparse and weak, their role in striatal network dynamics is puzzling. However, here we show by simulation of a striatal inhibitory network model composed of spiking neurons that cells form assemblies that fire in sequential coherent episodes and display complex identity-temporal spiking patterns even when cortical excitation is simply constant or fluctuating noisily. Strongly correlated large-scale firing rate fluctuations on slow behaviorally relevant timescales of hundreds of milliseconds are shown by members of the same assembly whereas members of different assemblies show strong negative correlation, and we show how randomly connected spiking networks can generate this activity. Cells display highly irregular spiking with high coefficients of variation, broadly distributed low firing rates, and interspike interval distributions that are consistent with exponentially tailed power laws. Although firing rates vary coherently on slow timescales, precise spiking synchronization is absent in general. Our model only requires the minimal but striatally realistic assumptions of sparse to intermediate random connectivity, weak inhibitory synapses, and sufficient cortical excitation so that some cells are depolarized above the firing threshold during up states. Our results are in good qualitative agreement with experimental studies, consistent with recently determined striatal anatomy and physiology, and support a new view of endogenously generated metastable state switching dynamics of the striatal network underlying its information processing operations.

  8. Development of Novel Random Network Theory-Based Approaches to Identify Network Interactions among Nitrifying Bacteria

    Energy Technology Data Exchange (ETDEWEB)

    Shi, Cindy

    2015-07-17

    The interactions among different microbial populations in a community could play more important roles in determining ecosystem functioning than species numbers and their abundances, but very little is known about such network interactions at a community level. The goal of this project is to develop novel framework approaches and associated software tools to characterize the network interactions in microbial communities based on high throughput, large scale high-throughput metagenomics data and apply these approaches to understand the impacts of environmental changes (e.g., climate change, contamination) on network interactions among different nitrifying populations and associated microbial communities.

  9. Finite-time stability of neutral-type neural networks with random time-varying delays

    Science.gov (United States)

    Ali, M. Syed; Saravanan, S.; Zhu, Quanxin

    2017-11-01

    This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.

  10. Cascading failures with local load redistribution in interdependent Watts-Strogatz networks

    Science.gov (United States)

    Hong, Chen; Zhang, Jun; Du, Wen-Bo; Sallan, Jose Maria; Lordan, Oriol

    2016-05-01

    Cascading failures of loads in isolated networks have been studied extensively over the last decade. Since 2010, such research has extended to interdependent networks. In this paper, we study cascading failures with local load redistribution in interdependent Watts-Strogatz (WS) networks. The effects of rewiring probability and coupling strength on the resilience of interdependent WS networks have been extensively investigated. It has been found that, for small values of the tolerance parameter, interdependent networks are more vulnerable as rewiring probability increases. For larger values of the tolerance parameter, the robustness of interdependent networks firstly decreases and then increases as rewiring probability increases. Coupling strength has a different impact on robustness. For low values of coupling strength, the resilience of interdependent networks decreases with the increment of the coupling strength until it reaches a certain threshold value. For values of coupling strength above this threshold, the opposite effect is observed. Our results are helpful to understand and design resilient interdependent networks.

  11. Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

    Science.gov (United States)

    Kuhn, D. Richard; Kacker, Raghu; Lei, Yu

    2010-01-01

    This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

  12. Research on Some Bus Transport Networks with Random Overlapping Clique Structure

    International Nuclear Information System (INIS)

    Yang Xuhua; Sun Youxian; Wang Bo; Wang Wanliang

    2008-01-01

    On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs

  13. Mean-field Theory for Some Bus Transport Networks with Random Overlapping Clique Structure

    International Nuclear Information System (INIS)

    Yang Xuhua; Sun Bao; Wang Bo; Sun Youxian

    2010-01-01

    Transport networks, such as railway networks and airport networks, are a kind of random network with complex topology. Recently, more and more scholars paid attention to various kinds of transport networks and try to explore their inherent characteristics. Here we study the exponential properties of a recently introduced Bus Transport Networks (BTNs) evolution model with random overlapping clique structure, which gives a possible explanation for the observed exponential distribution of the connectivities of some BTNs of three major cities in China. Applying mean-field theory, we analyze the BTNs model and prove that this model has the character of exponential distribution of the connectivities, and develop a method to predict the growth dynamics of the individual vertices, and use this to calculate analytically the connectivity distribution and the exponents. By comparing mean-field based theoretic results with the statistical data of real BTNs, we observe that, as a whole, both of their data show similar character of exponential distribution of the connectivities, and their exponents have same order of magnitude, which show the availability of the analytical result of this paper. (general)

  14. Engineering Online and In-person Social Networks for Physical Activity: A Randomized Trial

    Science.gov (United States)

    Rovniak, Liza S.; Kong, Lan; Hovell, Melbourne F.; Ding, Ding; Sallis, James F.; Ray, Chester A.; Kraschnewski, Jennifer L.; Matthews, Stephen A.; Kiser, Elizabeth; Chinchilli, Vernon M.; George, Daniel R.; Sciamanna, Christopher N.

    2016-01-01

    Background Social networks can influence physical activity, but little is known about how best to engineer online and in-person social networks to increase activity. Purpose To conduct a randomized trial based on the Social Networks for Activity Promotion model to assess the incremental contributions of different procedures for building social networks on objectively-measured outcomes. Methods Physically inactive adults (n = 308, age, 50.3 (SD = 8.3) years, 38.3% male, 83.4% overweight/obese) were randomized to 1 of 3 groups. The Promotion group evaluated the effects of weekly emailed tips emphasizing social network interactions for walking (e.g., encouragement, informational support); the Activity group evaluated the incremental effect of adding an evidence-based online fitness walking intervention to the weekly tips; and the Social Networks group evaluated the additional incremental effect of providing access to an online networking site for walking, and prompting walking/activity across diverse settings. The primary outcome was mean change in accelerometer-measured moderate-to-vigorous physical activity (MVPA), assessed at 3 and 9 months from baseline. Results Participants increased their MVPA by 21.0 mins/week, 95% CI [5.9, 36.1], p = .005, at 3 months, and this change was sustained at 9 months, with no between-group differences. Conclusions Although the structure of procedures for targeting social networks varied across intervention groups, the functional effect of these procedures on physical activity was similar. Future research should evaluate if more powerful reinforcers improve the effects of social network interventions. Trial Registration Number NCT01142804 PMID:27405724

  15. Engineering Online and In-Person Social Networks for Physical Activity: A Randomized Trial.

    Science.gov (United States)

    Rovniak, Liza S; Kong, Lan; Hovell, Melbourne F; Ding, Ding; Sallis, James F; Ray, Chester A; Kraschnewski, Jennifer L; Matthews, Stephen A; Kiser, Elizabeth; Chinchilli, Vernon M; George, Daniel R; Sciamanna, Christopher N

    2016-12-01

    Social networks can influence physical activity, but little is known about how best to engineer online and in-person social networks to increase activity. The purpose of this study was to conduct a randomized trial based on the Social Networks for Activity Promotion model to assess the incremental contributions of different procedures for building social networks on objectively measured outcomes. Physically inactive adults (n = 308, age, 50.3 (SD = 8.3) years, 38.3 % male, 83.4 % overweight/obese) were randomized to one of three groups. The Promotion group evaluated the effects of weekly emailed tips emphasizing social network interactions for walking (e.g., encouragement, informational support); the Activity group evaluated the incremental effect of adding an evidence-based online fitness walking intervention to the weekly tips; and the Social Networks group evaluated the additional incremental effect of providing access to an online networking site for walking as well as prompting walking/activity across diverse settings. The primary outcome was mean change in accelerometer-measured moderate-to-vigorous physical activity (MVPA), assessed at 3 and 9 months from baseline. Participants increased their MVPA by 21.0 min/week, 95 % CI [5.9, 36.1], p = .005, at 3 months, and this change was sustained at 9 months, with no between-group differences. Although the structure of procedures for targeting social networks varied across intervention groups, the functional effect of these procedures on physical activity was similar. Future research should evaluate if more powerful reinforcers improve the effects of social network interventions. The trial was registered with the ClinicalTrials.gov (NCT01142804).

  16. Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks

    Science.gov (United States)

    St-Onge, Guillaume; Young, Jean-Gabriel; Laurence, Edward; Murphy, Charles; Dubé, Louis J.

    2018-02-01

    We present a degree-based theoretical framework to study the susceptible-infected-susceptible (SIS) dynamics on time-varying (rewired) configuration model networks. Using this framework on a given degree distribution, we provide a detailed analysis of the stationary state using the rewiring rate to explore the whole range of the time variation of the structure relative to that of the SIS process. This analysis is suitable for the characterization of the phase transition and leads to three main contributions: (1) We obtain a self-consistent expression for the absorbing-state threshold, able to capture both collective and hub activation. (2) We recover the predictions of a number of existing approaches as limiting cases of our analysis, providing thereby a unifying point of view for the SIS dynamics on random networks. (3) We obtain bounds for the critical exponents of a number of quantities in the stationary state. This allows us to reinterpret the concept of hub-dominated phase transition. Within our framework, it appears as a heterogeneous critical phenomenon: observables for different degree classes have a different scaling with the infection rate. This phenomenon is followed by the successive activation of the degree classes beyond the epidemic threshold.

  17. Implementation and Performance Evaluation of Distributed Cloud Storage Solutions using Random Linear Network Coding

    DEFF Research Database (Denmark)

    Fitzek, Frank; Toth, Tamas; Szabados, Áron

    2014-01-01

    This paper advocates the use of random linear network coding for storage in distributed clouds in order to reduce storage and traffic costs in dynamic settings, i.e. when adding and removing numerous storage devices/clouds on-the-fly and when the number of reachable clouds is limited. We introduce...... various network coding approaches that trade-off reliability, storage and traffic costs, and system complexity relying on probabilistic recoding for cloud regeneration. We compare these approaches with other approaches based on data replication and Reed-Solomon codes. A simulator has been developed...... to carry out a thorough performance evaluation of the various approaches when relying on different system settings, e.g., finite fields, and network/storage conditions, e.g., storage space used per cloud, limited network use, and limited recoding capabilities. In contrast to standard coding approaches, our...

  18. Representing Degree Distributions, Clustering, and Homophily in Social Networks With Latent Cluster Random Effects Models.

    Science.gov (United States)

    Krivitsky, Pavel N; Handcock, Mark S; Raftery, Adrian E; Hoff, Peter D

    2009-07-01

    Social network data often involve transitivity, homophily on observed attributes, clustering, and heterogeneity of actor degrees. We propose a latent cluster random effects model to represent all of these features, and we describe a Bayesian estimation method for it. The model is applicable to both binary and non-binary network data. We illustrate the model using two real datasets. We also apply it to two simulated network datasets with the same, highly skewed, degree distribution, but very different network behavior: one unstructured and the other with transitivity and clustering. Models based on degree distributions, such as scale-free, preferential attachment and power-law models, cannot distinguish between these very different situations, but our model does.

  19. Dynamic Load Balanced Clustering using Elitism based Random Immigrant Genetic Approach for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    K. Mohaideen Pitchai

    2017-07-01

    Full Text Available Wireless Sensor Network (WSN consists of a large number of small sensors with restricted energy. Prolonged network lifespan, scalability, node mobility and load balancing are important needs for several WSN applications. Clustering the sensor nodes is an efficient technique to reach these goals. WSN have the characteristics of topology dynamics because of factors like energy conservation and node movement that leads to Dynamic Load Balanced Clustering Problem (DLBCP. In this paper, Elitism based Random Immigrant Genetic Approach (ERIGA is proposed to solve DLBCP which adapts to topology dynamics. ERIGA uses the dynamic Genetic Algorithm (GA components for solving the DLBCP. The performance of load balanced clustering process is enhanced with the help of this dynamic GA. As a result, the ERIGA achieves to elect suitable cluster heads which balances the network load and increases the lifespan of the network.

  20. Diffusion in random networks: Asymptotic properties, and numerical and engineering approximations

    Science.gov (United States)

    Padrino, Juan C.; Zhang, Duan Z.

    2016-11-01

    The ensemble phase averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of a set of pockets connected by tortuous channels. Inside a channel, we assume that fluid transport is governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pores mass density. The so-called dual porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem, we consider the one-dimensional mass diffusion in a semi-infinite domain, whose solution is sought numerically. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt- 1 / 4 rather than xt- 1 / 2 as in the traditional theory. This early time sub-diffusive similarity can be explained by random walk theory through the network. In addition, by applying concepts of fractional calculus, we show that, for small time, the governing equation reduces to a fractional diffusion equation with known solution. We recast this solution in terms of special functions easier to compute. Comparison of the numerical and exact solutions shows excellent agreement.

  1. Random sampling of elementary flux modes in large-scale metabolic networks.

    Science.gov (United States)

    Machado, Daniel; Soons, Zita; Patil, Kiran Raosaheb; Ferreira, Eugénio C; Rocha, Isabel

    2012-09-15

    The description of a metabolic network in terms of elementary (flux) modes (EMs) provides an important framework for metabolic pathway analysis. However, their application to large networks has been hampered by the combinatorial explosion in the number of modes. In this work, we develop a method for generating random samples of EMs without computing the whole set. Our algorithm is an adaptation of the canonical basis approach, where we add an additional filtering step which, at each iteration, selects a random subset of the new combinations of modes. In order to obtain an unbiased sample, all candidates are assigned the same probability of getting selected. This approach avoids the exponential growth of the number of modes during computation, thus generating a random sample of the complete set of EMs within reasonable time. We generated samples of different sizes for a metabolic network of Escherichia coli, and observed that they preserve several properties of the full EM set. It is also shown that EM sampling can be used for rational strain design. A well distributed sample, that is representative of the complete set of EMs, should be suitable to most EM-based methods for analysis and optimization of metabolic networks. Source code for a cross-platform implementation in Python is freely available at http://code.google.com/p/emsampler. dmachado@deb.uminho.pt Supplementary data are available at Bioinformatics online.

  2. A Markov random walk under constraint for discovering overlapping communities in complex networks

    International Nuclear Information System (INIS)

    Jin, Di; Yang, Bo; Liu, Dayou; He, Dongxiao; Liu, Jie; Baquero, Carlos

    2011-01-01

    The detection of overlapping communities in complex networks has motivated recent research in relevant fields. Aiming to address this problem, we propose a Markov-dynamics-based algorithm, called UEOC, which means 'unfold and extract overlapping communities'. In UEOC, when identifying each natural community that overlaps, a Markov random walk method combined with a constraint strategy, which is based on the corresponding annealed network (degree conserving random network), is performed to unfold the community. Then, a cutoff criterion with the aid of a local community function, called conductance, which can be thought of as the ratio between the number of edges inside the community and those leaving it, is presented to extract this emerged community from the entire network. The UEOC algorithm depends on only one parameter whose value can be easily set, and it requires no prior knowledge of the hidden community structures. The proposed UEOC has been evaluated both on synthetic benchmarks and on some real-world networks, and has been compared with a set of competing algorithms. The experimental result has shown that UEOC is highly effective and efficient for discovering overlapping communities

  3. Stimulus number, duration and intensity encoding in randomly connected attractor networks with synaptic depression

    Directory of Open Access Journals (Sweden)

    Paul eMiller

    2013-05-01

    Full Text Available Randomly connected recurrent networks of excitatory groups of neurons can possess a multitude of attractor states. When the internal excitatory synapses of these networks are depressing, the attractor states can be destabilized with increasing input. This leads to an itinerancy, where with either repeated transient stimuli, or increasing duration of a single stimulus, the network activity advances through sequences of attractor states. We find that the resulting network state, which persists beyond stimulus offset, can encode the number of stimuli presented via a distributed representation of neural activity with non-monotonic tuning curves for most neurons. Increased duration of a single stimulus is encoded via different distributed representations, so unlike an integrator, the network distinguishes separate successive presentations of a short stimulus from a single presentation of a longer stimulus with equal total duration. Moreover, different amplitudes of stimulus cause new, distinct activity patterns, such that changes in stimulus number, duration and amplitude can be distinguished from each other. These properties of the network depend on dynamic depressing synapses, as they disappear if synapses are static. Thus short-term synaptic depression allows a network to store separately the different dynamic properties of a spatially constant stimulus.

  4. An adaptive random search for short term generation scheduling with network constraints.

    Directory of Open Access Journals (Sweden)

    J A Marmolejo

    Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

  5. HIGH QUALITY FACADE SEGMENTATION BASED ON STRUCTURED RANDOM FOREST, REGION PROPOSAL NETWORK AND RECTANGULAR FITTING

    Directory of Open Access Journals (Sweden)

    K. Rahmani

    2018-05-01

    Full Text Available In this paper we present a pipeline for high quality semantic segmentation of building facades using Structured Random Forest (SRF, Region Proposal Network (RPN based on a Convolutional Neural Network (CNN as well as rectangular fitting optimization. Our main contribution is that we employ features created by the RPN as channels in the SRF.We empirically show that this is very effective especially for doors and windows. Our pipeline is evaluated on two datasets where we outperform current state-of-the-art methods. Additionally, we quantify the contribution of the RPN and the rectangular fitting optimization on the accuracy of the result.

  6. Time scales in evolutionary game on adaptive networks

    Energy Technology Data Exchange (ETDEWEB)

    Cong, Rui, E-mail: congrui0000@126.com [School of Mechano-Electronic Engineering, Xidian University, Xi' an (China); Wu, Te; Qiu, Yuan-Ying [School of Mechano-Electronic Engineering, Xidian University, Xi' an (China); Wang, Long [School of Mechano-Electronic Engineering, Xidian University, Xi' an (China); Center for Systems and Control, State Key Laboratory for Turbulence and Complex Systems, College of Engineering, Peking University, Beijing (China)

    2014-02-01

    Most previous studies concerning spatial games have assumed strategy updating occurs with a fixed ratio relative to interactions. We here set up a coevolutionary model to investigate how different ratio affects the evolution of cooperation on adaptive networks. Simulation results demonstrate that cooperation can be significantly enhanced under our rewiring mechanism, especially with slower natural selection. Meanwhile, slower selection induces larger network heterogeneity. Strong selection contracts the parameter area where cooperation thrives. Therefore, cooperation prevails whenever individuals are offered enough chances to adapt to the environment. Robustness of the results has been checked under rewiring cost or varied networks.

  7. Social network intervention in patients with schizophrenia and marked social withdrawal: a randomized controlled study.

    Science.gov (United States)

    Terzian, Emanuela; Tognoni, Gianni; Bracco, Renata; De Ruggieri, Edoardo; Ficociello, Rita Angela; Mezzina, Roberto; Pillo, Giuseppe

    2013-11-01

    To evaluate the efficacy and feasibility of actions intended to implement or improve patients' social network within the Italian National Health Service community mental health services. We conducted a randomized clinical trial through a network of 47 community mental health services on patients with a diagnosis in the schizophrenia spectrum (F20 in the International Classification of Diseases, 10th Revision), who were young (aged younger than 45 years), and with a poor social network (less than 5 relationships). In addition to routine treatments, for the experimental group, the staff identified possible areas of interest for individual patients and proposed social activities taking place outside the services' resources and with members of the community. The main outcome was an improvement in the patients' social network; secondary end points were clinical outcome, abilities of daily living, and work. One- and 2-year outcomes of 345 and 327, respectively, of the 357 patients randomized were analyzed by intention-to-treat. A social network improvement was observed at year 1 in 25% of the patients allocated to routine treatment and in 39.9% of those allocated to the experimental arm (OR 2.0, 95% CI 1.3 to 3.1; adjusted OR 2.4, 95% CI 1.4 to 3.9). The difference remained statistically significant at year 2. No significant differences emerged for any of the other end points. However, patients with 1 or more other areas of improvement at year 1 and 2 showed a statistically significant social network improvement. The activation of social networks as an activity integrated with standard psychiatric care is practicable, without added economic and organizational costs, and appears to produce an effect persisting well beyond its implementation.

  8. Analysis in nuclear power accident emergency based on random network and particle swarm optimization

    International Nuclear Information System (INIS)

    Gong Dichen; Fang Fang; Ding Weicheng; Chen Zhi

    2014-01-01

    The GERT random network model of nuclear power accident emergency was built in this paper, and the intelligent computation was combined with the random network based on the analysis of Fukushima nuclear accident in Japan. The emergency process was divided into the series link and parallel link, and the parallel link was the part of series link. The overall allocation of resources was firstly optimized, and then the parallel link was analyzed. The effect of the resources for emergency used in different links was analyzed, and it was put forward that the corresponding particle velocity vector was limited under the condition of limited emergency resources. The resource-constrained particle swarm optimization was obtained by using velocity projection matrix to correct the motion of particles. The optimized allocation of resources in emergency process was obtained and the time consumption of nuclear power accident emergency was reduced. (authors)

  9. Dynamics of random Boolean networks under fully asynchronous stochastic update based on linear representation.

    Directory of Open Access Journals (Sweden)

    Chao Luo

    Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.

  10. Vibrational spectra of four-coordinated random networks with periodic boundary conditions

    International Nuclear Information System (INIS)

    Guttman, L.

    1976-01-01

    Examples of perfectly four-coordinated networks satisfying periodic boundary conditions are constructed by a pseudo-random process, starting from a crystalline region. The unphysical features (high density, large deviations from the tetrahedral bond-angle) are removed by systematic modification of the bonding scheme. The vibrational spectra are calculated, using a valence-force potential, and the neutron scattering is computed by a phonon-expansion approximation

  11. Fault-tolerant topology in the wireless sensor networks for energy depletion and random failure

    International Nuclear Information System (INIS)

    Liu Bin; Dong Ming-Ru; Yin Rong-Rong; Yin Wen-Xiao

    2014-01-01

    Nodes in the wireless sensor networks (WSNs) are prone to failure due to energy depletion and poor environment, which could have a negative impact on the normal operation of the network. In order to solve this problem, in this paper, we build a fault-tolerant topology which can effectively tolerate energy depletion and random failure. Firstly, a comprehensive failure model about energy depletion and random failure is established. Then an improved evolution model is presented to generate a fault-tolerant topology, and the degree distribution of the topology can be adjusted. Finally, the relation between the degree distribution and the topological fault tolerance is analyzed, and the optimal value of evolution model parameter is obtained. Then the target fault-tolerant topology which can effectively tolerate energy depletion and random failure is obtained. The performances of the new fault tolerant topology are verified by simulation experiments. The results show that the new fault tolerant topology effectively prolongs the network lifetime and has strong fault tolerance. (general)

  12. Mutual trust method for forwarding information in wireless sensor networks using random secret pre-distribution

    Directory of Open Access Journals (Sweden)

    Chih-Hsueh Lin

    2016-04-01

    Full Text Available In wireless sensor networks, sensing information must be transmitted from sensor nodes to the base station by multiple hopping. Every sensor node is a sender and a relay node that forwards the sensing information that is sent by other nodes. Under an attack, the sensing information may be intercepted, modified, interrupted, or fabricated during transmission. Accordingly, the development of mutual trust to enable a secure path to be established for forwarding information is an important issue. Random key pre-distribution has been proposed to establish mutual trust among sensor nodes. This article modifies the random key pre-distribution to a random secret pre-distribution and incorporates identity-based cryptography to establish an effective method of establishing mutual trust for a wireless sensor network. In the proposed method, base station assigns an identity and embeds n secrets into the private secret keys for every sensor node. Based on the identity and private secret keys, the mutual trust method is utilized to explore the types of trust among neighboring sensor nodes. The novel method can resist malicious attacks and satisfy the requirements of wireless sensor network, which are resistance to compromising attacks, masquerading attacks, forger attacks, replying attacks, authentication of forwarding messages, and security of sensing information.

  13. Distributed Synchronization in Networks of Agent Systems With Nonlinearities and Random Switchings.

    Science.gov (United States)

    Tang, Yang; Gao, Huijun; Zou, Wei; Kurths, Jürgen

    2013-02-01

    In this paper, the distributed synchronization problem of networks of agent systems with controllers and nonlinearities subject to Bernoulli switchings is investigated. Controllers and adaptive updating laws injected in each vertex of networks depend on the state information of its neighborhood. Three sets of Bernoulli stochastic variables are introduced to describe the occurrence probabilities of distributed adaptive controllers, updating laws and nonlinearities, respectively. By the Lyapunov functions method, we show that the distributed synchronization of networks composed of agent systems with multiple randomly occurring nonlinearities, multiple randomly occurring controllers, and multiple randomly occurring updating laws can be achieved in mean square under certain criteria. The conditions derived in this paper can be solved by semi-definite programming. Moreover, by mathematical analysis, we find that the coupling strength, the probabilities of the Bernoulli stochastic variables, and the form of nonlinearities have great impacts on the convergence speed and the terminal control strength. The synchronization criteria and the observed phenomena are demonstrated by several numerical simulation examples. In addition, the advantage of distributed adaptive controllers over conventional adaptive controllers is illustrated.

  14. Endogenous fields enhanced stochastic resonance in a randomly coupled neuronal network

    International Nuclear Information System (INIS)

    Deng, Bin; Wang, Lin; Wang, Jiang; Wei, Xi-le; Yu, Hai-tao

    2014-01-01

    Highlights: • We study effects of endogenous fields on stochastic resonance in a neural network. • Stochastic resonance can be notably enhanced by endogenous field feedback. • Endogenous field feedback delay plays a vital role in stochastic resonance. • The parameters of low-passed filter play a subtle role in SR. - Abstract: Endogenous field, evoked by structured neuronal network activity in vivo, is correlated with many vital neuronal processes. In this paper, the effects of endogenous fields on stochastic resonance (SR) in a randomly connected neuronal network are investigated. The network consists of excitatory and inhibitory neurons and the axonal conduction delays between neurons are also considered. Numerical results elucidate that endogenous field feedback results in more rhythmic macroscope activation of the network for proper time delay and feedback coefficient. The response of the network to the weak periodic stimulation can be notably enhanced by endogenous field feedback. Moreover, the endogenous field feedback delay plays a vital role in SR. We reveal that appropriately tuned delays of the feedback can either induce the enhancement of SR, appearing at every integer multiple of the weak input signal’s oscillation period, or the depression of SR, appearing at every integer multiple of half the weak input signal’s oscillation period for the same feedback coefficient. Interestingly, the parameters of low-passed filter which is used in obtaining the endogenous field feedback signal play a subtle role in SR

  15. Topology determines force distributions in one-dimensional random spring networks

    Science.gov (United States)

    Heidemann, Knut M.; Sageman-Furnas, Andrew O.; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F.; Wardetzky, Max

    2018-02-01

    Networks of elastic fibers are ubiquitous in biological systems and often provide mechanical stability to cells and tissues. Fiber-reinforced materials are also common in technology. An important characteristic of such materials is their resistance to failure under load. Rupture occurs when fibers break under excessive force and when that failure propagates. Therefore, it is crucial to understand force distributions. Force distributions within such networks are typically highly inhomogeneous and are not well understood. Here we construct a simple one-dimensional model system with periodic boundary conditions by randomly placing linear springs on a circle. We consider ensembles of such networks that consist of N nodes and have an average degree of connectivity z but vary in topology. Using a graph-theoretical approach that accounts for the full topology of each network in the ensemble, we show that, surprisingly, the force distributions can be fully characterized in terms of the parameters (N ,z ) . Despite the universal properties of such (N ,z ) ensembles, our analysis further reveals that a classical mean-field approach fails to capture force distributions correctly. We demonstrate that network topology is a crucial determinant of force distributions in elastic spring networks.

  16. Depth Reconstruction from Single Images Using a Convolutional Neural Network and a Condition Random Field Model.

    Science.gov (United States)

    Liu, Dan; Liu, Xuejun; Wu, Yiguang

    2018-04-24

    This paper presents an effective approach for depth reconstruction from a single image through the incorporation of semantic information and local details from the image. A unified framework for depth acquisition is constructed by joining a deep Convolutional Neural Network (CNN) and a continuous pairwise Conditional Random Field (CRF) model. Semantic information and relative depth trends of local regions inside the image are integrated into the framework. A deep CNN network is firstly used to automatically learn a hierarchical feature representation of the image. To get more local details in the image, the relative depth trends of local regions are incorporated into the network. Combined with semantic information of the image, a continuous pairwise CRF is then established and is used as the loss function of the unified model. Experiments on real scenes demonstrate that the proposed approach is effective and that the approach obtains satisfactory results.

  17. Theoretical characterization of the topology of connected carbon nanotubes in random networks

    International Nuclear Information System (INIS)

    Heitz, Jerome; Leroy, Yann; Hebrard, Luc; Lallement, Christophe

    2011-01-01

    In recent years, a lot of attention has been paid to carbon nanotube (CNT) networks and their applications to electronic devices. Many studies concentrate on the percolation threshold and the characterization of the conduction in such materials. Nevertheless, no theoretical study has yet attempted to characterize the CNT features inside finite size CNT networks. We present a theoretical approach based on geometrical and statistical considerations. We demonstrate the possibility of explicitly determining some relations existing between two neighbor CNTs and their contact efficiency in random networks of identical CNTs. We calculate the contact probability of rigid identical CNTs and we obtain a probability of 0.2027, which turns out to be independent of the CNT density. Based on this probability, we establish also the dependence of the number of contacts per CNT as a function of the CNT density. All the theoretical results are validated by very good agreement with Monte Carlo simulations.

  18. Depth Reconstruction from Single Images Using a Convolutional Neural Network and a Condition Random Field Model

    Directory of Open Access Journals (Sweden)

    Dan Liu

    2018-04-01

    Full Text Available This paper presents an effective approach for depth reconstruction from a single image through the incorporation of semantic information and local details from the image. A unified framework for depth acquisition is constructed by joining a deep Convolutional Neural Network (CNN and a continuous pairwise Conditional Random Field (CRF model. Semantic information and relative depth trends of local regions inside the image are integrated into the framework. A deep CNN network is firstly used to automatically learn a hierarchical feature representation of the image. To get more local details in the image, the relative depth trends of local regions are incorporated into the network. Combined with semantic information of the image, a continuous pairwise CRF is then established and is used as the loss function of the unified model. Experiments on real scenes demonstrate that the proposed approach is effective and that the approach obtains satisfactory results.

  19. Optimal system size for complex dynamics in random neural networks near criticality

    Energy Technology Data Exchange (ETDEWEB)

    Wainrib, Gilles, E-mail: wainrib@math.univ-paris13.fr [Laboratoire Analyse Géométrie et Applications, Université Paris XIII, Villetaneuse (France); García del Molino, Luis Carlos, E-mail: garciadelmolino@ijm.univ-paris-diderot.fr [Institute Jacques Monod, Université Paris VII, Paris (France)

    2013-12-15

    In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices.

  20. Optimal system size for complex dynamics in random neural networks near criticality

    International Nuclear Information System (INIS)

    Wainrib, Gilles; García del Molino, Luis Carlos

    2013-01-01

    In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices

  1. Continuous-time random walks on networks with vertex- and time-dependent forcing.

    Science.gov (United States)

    Angstmann, C N; Donnelly, I C; Henry, B I; Langlands, T A M

    2013-08-01

    We have investigated the transport of particles moving as random walks on the vertices of a network, subject to vertex- and time-dependent forcing. We have derived the generalized master equations for this transport using continuous time random walks, characterized by jump and waiting time densities, as the underlying stochastic process. The forcing is incorporated through a vertex- and time-dependent bias in the jump densities governing the random walking particles. As a particular case, we consider particle forcing proportional to the concentration of particles on adjacent vertices, analogous to self-chemotactic attraction in a spatial continuum. Our algebraic and numerical studies of this system reveal an interesting pair-aggregation pattern formation in which the steady state is composed of a high concentration of particles on a small number of isolated pairs of adjacent vertices. The steady states do not exhibit this pair aggregation if the transport is random on the vertices, i.e., without forcing. The manifestation of pair aggregation on a transport network may thus be a signature of self-chemotactic-like forcing.

  2. Revisiting random walk based sampling in networks: evasion of burn-in period and frequent regenerations.

    Science.gov (United States)

    Avrachenkov, Konstantin; Borkar, Vivek S; Kadavankandy, Arun; Sreedharan, Jithin K

    2018-01-01

    In the framework of network sampling, random walk (RW) based estimation techniques provide many pragmatic solutions while uncovering the unknown network as little as possible. Despite several theoretical advances in this area, RW based sampling techniques usually make a strong assumption that the samples are in stationary regime, and hence are impelled to leave out the samples collected during the burn-in period. This work proposes two sampling schemes without burn-in time constraint to estimate the average of an arbitrary function defined on the network nodes, for example, the average age of users in a social network. The central idea of the algorithms lies in exploiting regeneration of RWs at revisits to an aggregated super-node or to a set of nodes, and in strategies to enhance the frequency of such regenerations either by contracting the graph or by making the hitting set larger. Our first algorithm, which is based on reinforcement learning (RL), uses stochastic approximation to derive an estimator. This method can be seen as intermediate between purely stochastic Markov chain Monte Carlo iterations and deterministic relative value iterations. The second algorithm, which we call the Ratio with Tours (RT)-estimator, is a modified form of respondent-driven sampling (RDS) that accommodates the idea of regeneration. We study the methods via simulations on real networks. We observe that the trajectories of RL-estimator are much more stable than those of standard random walk based estimation procedures, and its error performance is comparable to that of respondent-driven sampling (RDS) which has a smaller asymptotic variance than many other estimators. Simulation studies also show that the mean squared error of RT-estimator decays much faster than that of RDS with time. The newly developed RW based estimators (RL- and RT-estimators) allow to avoid burn-in period, provide better control of stability along the sample path, and overall reduce the estimation time. Our

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

    Science.gov (United States)

    Prezel, Elea; Elie, Auréliane; Delaroche, Julie; Stoppin-Mellet, Virginie; Bosc, Christophe; Serre, Laurence; Fourest-Lieuvin, Anne; Andrieux, Annie; Vantard, Marylin; Arnal, Isabelle

    2018-01-15

    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. © 2018 Prezel, Elie, et al. This article is distributed by The American Society for Cell Biology under license from the author(s). Two months after publication it is available to the public under an Attribution–Noncommercial–Share Alike 3.0 Unported Creative Commons License (http://creativecommons.org/licenses/by-nc-sa/3.0).

  4. Coevolution of game and network structure with adjustable linking

    Science.gov (United States)

    Qin, Shao-Meng; Zhang, Guo-Yong; Chen, Yong

    2009-12-01

    Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.

  5. Predicting language diversity with complex networks

    Science.gov (United States)

    Gubiec, Tomasz

    2018-01-01

    We analyze the model of social interactions with coevolution of the topology and states of the nodes. This model can be interpreted as a model of language change. We propose different rewiring mechanisms and perform numerical simulations for each. Obtained results are compared with the empirical data gathered from two online databases and anthropological study of Solomon Islands. We study the behavior of the number of languages for different system sizes and we find that only local rewiring, i.e. triadic closure, is capable of reproducing results for the empirical data in a qualitative manner. Furthermore, we cancel the contradiction between previous models and the Solomon Islands case. Our results demonstrate the importance of the topology of the network, and the rewiring mechanism in the process of language change. PMID:29702699

  6. Capturing the Flatness of a peer-to-peer lending network through random and selected perturbations

    Science.gov (United States)

    Karampourniotis, Panagiotis D.; Singh, Pramesh; Uparna, Jayaram; Horvat, Emoke-Agnes; Szymanski, Boleslaw K.; Korniss, Gyorgy; Bakdash, Jonathan Z.; Uzzi, Brian

    Null models are established tools that have been used in network analysis to uncover various structural patterns. They quantify the deviance of an observed network measure to that given by the null model. We construct a null model for weighted, directed networks to identify biased links (carrying significantly different weights than expected according to the null model) and thus quantify the flatness of the system. Using this model, we study the flatness of Kiva, a large international crownfinancing network of borrowers and lenders, aggregated to the country level. The dataset spans the years from 2006 to 2013. Our longitudinal analysis shows that flatness of the system is reducing over time, meaning the proportion of biased inter-country links is growing. We extend our analysis by testing the robustness of the flatness of the network in perturbations on the links' weights or the nodes themselves. Examples of such perturbations are event shocks (e.g. erecting walls) or regulatory shocks (e.g. Brexit). We find that flatness is unaffected by random shocks, but changes after shocks target links with a large weight or bias. The methods we use to capture the flatness are based on analytics, simulations, and numerical computations using Shannon's maximum entropy. Supported by ARL NS-CTA.

  7. Distribution of orientation selectivity in recurrent networks of spiking neurons with different random topologies.

    Science.gov (United States)

    Sadeh, Sadra; Rotter, Stefan

    2014-01-01

    Neurons in the primary visual cortex are more or less selective for the orientation of a light bar used for stimulation. A broad distribution of individual grades of orientation selectivity has in fact been reported in all species. A possible reason for emergence of broad distributions is the recurrent network within which the stimulus is being processed. Here we compute the distribution of orientation selectivity in randomly connected model networks that are equipped with different spatial patterns of connectivity. We show that, for a wide variety of connectivity patterns, a linear theory based on firing rates accurately approximates the outcome of direct numerical simulations of networks of spiking neurons. Distance dependent connectivity in networks with a more biologically realistic structure does not compromise our linear analysis, as long as the linearized dynamics, and hence the uniform asynchronous irregular activity state, remain stable. We conclude that linear mechanisms of stimulus processing are indeed responsible for the emergence of orientation selectivity and its distribution in recurrent networks with functionally heterogeneous synaptic connectivity.

  8. The brain matures with stronger functional connectivity and decreased randomness of its network.

    Directory of Open Access Journals (Sweden)

    Dirk J A Smit

    Full Text Available We investigated the development of the brain's functional connectivity throughout the life span (ages 5 through 71 years by measuring EEG activity in a large population-based sample. Connectivity was established with Synchronization Likelihood. Relative randomness of the connectivity patterns was established with Watts and Strogatz' (1998 graph parameters C (local clustering and L (global path length for alpha (~10 Hz, beta (~20 Hz, and theta (~4 Hz oscillation networks. From childhood to adolescence large increases in connectivity in alpha, theta and beta frequency bands were found that continued at a slower pace into adulthood (peaking at ~50 yrs. Connectivity changes were accompanied by increases in L and C reflecting decreases in network randomness or increased order (peak levels reached at ~18 yrs. Older age (55+ was associated with weakened connectivity. Semi-automatically segmented T1 weighted MRI images of 104 young adults revealed that connectivity was significantly correlated to cerebral white matter volume (alpha oscillations: r = 33, p<01; theta: r = 22, p<05, while path length was related to both white matter (alpha: max. r = 38, p<001 and gray matter (alpha: max. r = 36, p<001; theta: max. r = 36, p<001 volumes. In conclusion, EEG connectivity and graph theoretical network analysis may be used to trace structural and functional development of the brain.

  9. Features of Random Metal Nanowire Networks with Application in Transparent Conducting Electrodes

    KAUST Repository

    Maloth, Thirupathi

    2017-05-01

    Among the alternatives to conventional Indium Tin Oxide (ITO) used in making transparent conducting electrodes, the random metal nanowire (NW) networks are considered to be superior offering performance at par with ITO. The performance is measured in terms of sheet resistance and optical transmittance. However, as the electrical properties of such random networks are achieved thanks to a percolation network, a minimum size of the electrodes is needed so it actually exceeds the representative volume element (RVE) of the material and the macroscopic electrical properties are achieved. There is not much information about the compatibility of this minimum RVE size with the resolution actually needed in electronic devices. Furthermore, the efficiency of NWs in terms of electrical conduction is overlooked. In this work, we address the above industrially relevant questions - 1) The minimum size of electrodes that can be made based on the dimensions of NWs and the material coverage. For this, we propose a morphology based classification in defining the RVE size and we also compare the same with that is based on macroscopic electrical properties stabilization. 2) The amount of NWs that do not participate in electrical conduction, hence of no practical use. The results presented in this thesis are a design guide to experimentalists to design transparent electrodes with more optimal usage of the material.

  10. Unanticipated Effect of a Randomized Peer Network Intervention on Depressive Symptoms among Young Methamphetamine Users in Thailand

    Science.gov (United States)

    German, D.; Sutcliffe, C. G.; Sirirojn, B.; Sherman, S. G.; Latkin, C. A.; Aramrattana, A.; Celentano, D. D.

    2012-01-01

    We examined the effect on depressive symptoms of a peer network-oriented intervention effective in reducing sexual risk behavior and methamphetamine (MA) use. Current Thai MA users aged 18-25 years and their drug and/or sex network members enrolled in a randomized controlled trial with 4 follow-ups over 12 months. A total of 415 index participants…

  11. Distributed Constrained Stochastic Subgradient Algorithms Based on Random Projection and Asynchronous Broadcast over Networks

    Directory of Open Access Journals (Sweden)

    Junlong Zhu

    2017-01-01

    Full Text Available We consider a distributed constrained optimization problem over a time-varying network, where each agent only knows its own cost functions and its constraint set. However, the local constraint set may not be known in advance or consists of huge number of components in some applications. To deal with such cases, we propose a distributed stochastic subgradient algorithm over time-varying networks, where the estimate of each agent projects onto its constraint set by using random projection technique and the implement of information exchange between agents by employing asynchronous broadcast communication protocol. We show that our proposed algorithm is convergent with probability 1 by choosing suitable learning rate. For constant learning rate, we obtain an error bound, which is defined as the expected distance between the estimates of agent and the optimal solution. We also establish an asymptotic upper bound between the global objective function value at the average of the estimates and the optimal value.

  12. Fisher information at the edge of chaos in random Boolean networks.

    Science.gov (United States)

    Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail

    2011-01-01

    We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.

  13. Multiple Time Series Forecasting Using Quasi-Randomized Functional Link Neural Networks

    Directory of Open Access Journals (Sweden)

    Thierry Moudiki

    2018-03-01

    Full Text Available We are interested in obtaining forecasts for multiple time series, by taking into account the potential nonlinear relationships between their observations. For this purpose, we use a specific type of regression model on an augmented dataset of lagged time series. Our model is inspired by dynamic regression models (Pankratz 2012, with the response variable’s lags included as predictors, and is known as Random Vector Functional Link (RVFL neural networks. The RVFL neural networks have been successfully applied in the past, to solving regression and classification problems. The novelty of our approach is to apply an RVFL model to multivariate time series, under two separate regularization constraints on the regression parameters.

  14. Random Linear Network Coding is Key to Data Survival in Highly Dynamic Distributed Storage

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2015-01-01

    Distributed storage solutions have become widespread due to their ability to store large amounts of data reliably across a network of unreliable nodes, by employing repair mechanisms to prevent data loss. Conventional systems rely on static designs with a central control entity to oversee...... and control the repair process. Given the large costs for maintaining and cooling large data centers, our work proposes and studies the feasibility of a fully decentralized systems that can store data even on unreliable and, sometimes, unavailable mobile devices. This imposes new challenges on the design...... as the number of available nodes varies greatly over time and keeping track of the system's state becomes unfeasible. As a consequence, conventional erasure correction approaches are ill-suited for maintaining data integrity. In this highly dynamic context, random linear network coding (RLNC) provides...

  15. Event-triggered synchronization for reaction-diffusion complex networks via random sampling

    Science.gov (United States)

    Dong, Tao; Wang, Aijuan; Zhu, Huiyun; Liao, Xiaofeng

    2018-04-01

    In this paper, the synchronization problem of the reaction-diffusion complex networks (RDCNs) with Dirichlet boundary conditions is considered, where the data is sampled randomly. An event-triggered controller based on the sampled data is proposed, which can reduce the number of controller and the communication load. Under this strategy, the synchronization problem of the diffusion complex network is equivalently converted to the stability of a of reaction-diffusion complex dynamical systems with time delay. By using the matrix inequality technique and Lyapunov method, the synchronization conditions of the RDCNs are derived, which are dependent on the diffusion term. Moreover, it is found the proposed control strategy can get rid of the Zeno behavior naturally. Finally, a numerical example is given to verify the obtained results.

  16. Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

    DEFF Research Database (Denmark)

    Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani

    2016-01-01

    Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC......) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC...... techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet...

  17. Equilibrium Model of Discrete Dynamic Supply Chain Network with Random Demand and Advertisement Strategy

    Directory of Open Access Journals (Sweden)

    Guitao Zhang

    2014-01-01

    Full Text Available The advertisement can increase the consumers demand; therefore it is one of the most important marketing strategies in the operations management of enterprises. This paper aims to analyze the impact of advertising investment on a discrete dynamic supply chain network which consists of suppliers, manufactures, retailers, and demand markets associated at different tiers under random demand. The impact of advertising investment will last several planning periods besides the current period due to delay effect. Based on noncooperative game theory, variational inequality, and Lagrange dual theory, the optimal economic behaviors of the suppliers, the manufactures, the retailers, and the consumers in the demand markets are modeled. In turn, the supply chain network equilibrium model is proposed and computed by modified project contraction algorithm with fixed step. The effectiveness of the model is illustrated by numerical examples, and managerial insights are obtained through the analysis of advertising investment in multiple periods and advertising delay effect among different periods.

  18. A novel root-index based prioritized random access scheme for 5G cellular networks

    Directory of Open Access Journals (Sweden)

    Taehoon Kim

    2015-12-01

    Full Text Available Cellular networks will play an important role in realizing the newly emerging Internet-of-Everything (IoE. One of the challenging issues is to support the quality of service (QoS during the access phase, while accommodating a massive number of machine nodes. In this paper, we show a new paradigm of multiple access priorities in random access (RA procedure and propose a novel root-index based prioritized random access (RIPRA scheme that implicitly embeds the access priority in the root index of the RA preambles. The performance evaluation shows that the proposed RIPRA scheme can successfully support differentiated performance for different access priority levels, even though there exist a massive number of machine nodes.

  19. Current flow in random resistor networks: the role of percolation in weak and strong disorder.

    Science.gov (United States)

    Wu, Zhenhua; López, Eduardo; Buldyrev, Sergey V; Braunstein, Lidia A; Havlin, Shlomo; Stanley, H Eugene

    2005-04-01

    We study the current flow paths between two edges in a random resistor network on a L X L square lattice. Each resistor has resistance e(ax) , where x is a uniformly distributed random variable and a controls the broadness of the distribution. We find that: (a) The scaled variable u identical with u congruent to L/a(nu) , where nu is the percolation connectedness exponent, fully determines the distribution of the current path length l for all values of u . For u > 1, the behavior corresponds to the weak disorder limit and l scales as l approximately L, while for u < 1 , the behavior corresponds to the strong disorder limit with l approximately L(d(opt) ), where d(opt) =1.22+/-0.01 is the optimal path exponent. (b) In the weak disorder regime, there is a length scale xi approximately a(nu), below which strong disorder and critical percolation characterize the current path.

  20. Non-fragile observer design for discrete-time genetic regulatory networks with randomly occurring uncertainties

    International Nuclear Information System (INIS)

    Banu, L Jarina; Balasubramaniam, P

    2015-01-01

    This paper investigates the problem of non-fragile observer design for a class of discrete-time genetic regulatory networks (DGRNs) with time-varying delays and randomly occurring uncertainties. A non-fragile observer is designed, for estimating the true concentration of mRNAs and proteins from available measurement outputs. One important feature of the results obtained that are reported here is that the parameter uncertainties are assumed to be random and their probabilities of occurrence are known a priori. On the basis of the Lyapunov–Krasovskii functional approach and using a convex combination technique, a delay-dependent estimation criterion is established for DGRNs in terms of linear matrix inequalities (LMIs) that can be efficiently solved using any available LMI solver. Finally numerical examples are provided to substantiate the theoretical results. (paper)

  1. Universal principles governing multiple random searchers on complex networks: The logarithmic growth pattern and the harmonic law

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Small, Michael; Harandizadeh, Bahareh; Hui, Pan

    2018-03-01

    We propose a unified framework to evaluate and quantify the search time of multiple random searchers traversing independently and concurrently on complex networks. We find that the intriguing behaviors of multiple random searchers are governed by two basic principles—the logarithmic growth pattern and the harmonic law. Specifically, the logarithmic growth pattern characterizes how the search time increases with the number of targets, while the harmonic law explores how the search time of multiple random searchers varies relative to that needed by individual searchers. Numerical and theoretical results demonstrate these two universal principles established across a broad range of random search processes, including generic random walks, maximal entropy random walks, intermittent strategies, and persistent random walks. Our results reveal two fundamental principles governing the search time of multiple random searchers, which are expected to facilitate investigation of diverse dynamical processes like synchronization and spreading.

  2. RRW: repeated random walks on genome-scale protein networks for local cluster discovery

    Directory of Open Access Journals (Sweden)

    Can Tolga

    2009-09-01

    Full Text Available Abstract Background We propose an efficient and biologically sensitive algorithm based on repeated random walks (RRW for discovering functional modules, e.g., complexes and pathways, within large-scale protein networks. Compared to existing cluster identification techniques, RRW implicitly makes use of network topology, edge weights, and long range interactions between proteins. Results We apply the proposed technique on a functional network of yeast genes and accurately identify statistically significant clusters of proteins. We validate the biological significance of the results using known complexes in the MIPS complex catalogue database and well-characterized biological processes. We find that 90% of the created clusters have the majority of their catalogued proteins belonging to the same MIPS complex, and about 80% have the majority of their proteins involved in the same biological process. We compare our method to various other clustering techniques, such as the Markov Clustering Algorithm (MCL, and find a significant improvement in the RRW clusters' precision and accuracy values. Conclusion RRW, which is a technique that exploits the topology of the network, is more precise and robust in finding local clusters. In addition, it has the added flexibility of being able to find multi-functional proteins by allowing overlapping clusters.

  3. Size-dependent mechanical properties of 2D random nanofibre networks

    International Nuclear Information System (INIS)

    Lu, Zixing; Zhu, Man; Liu, Qiang

    2014-01-01

    The mechanical properties of nanofibre networks (NFNs) are size dependent with respect to different fibre diameters. In this paper, a continuum model is developed to reveal the size-dependent mechanical properties of 2D random NFNs. Since such size-dependent behaviours are attributed to different micromechanical mechanisms, the surface effects and the strain gradient (SG) effects are, respectively, introduced into the mechanical analysis of NFNs. Meanwhile, a modified fibre network model is proposed, in which the axial, bending and shearing deformations are incorporated. The closed-form expressions of effective modulus and Poisson's ratio are obtained for NFNs. Different from the results predicted by conventional fibre network model, the present model predicts the size-dependent mechanical properties of NFNs. It is found that both surface effects and SG effects have significant influences on the effective mechanical properties. Moreover, the present results show that the shearing deformation of fibre segment is also crucial to precisely evaluate the effective mechanical properties of NFNs. This work mainly aims to provide an insight into the micromechanical mechanisms of NFNs. Besides, this work is also expected to provide a more accurate theoretical model for 2D fibre networks. (paper)

  4. Topology-selective jamming of fully-connected, code-division random-access networks

    Science.gov (United States)

    Polydoros, Andreas; Cheng, Unjeng

    1990-01-01

    The purpose is to introduce certain models of topology selective stochastic jamming and examine its impact on a class of fully-connected, spread-spectrum, slotted ALOHA-type random access networks. The theory covers dedicated as well as half-duplex units. The dominant role of the spatial duty factor is established, and connections with the dual concept of time selective jamming are discussed. The optimal choices of coding rate and link access parameters (from the users' side) and the jamming spatial fraction are numerically established for DS and FH spreading.

  5. Variances as order parameter and complexity measure for random Boolean networks

    International Nuclear Information System (INIS)

    Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel

    2005-01-01

    Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems

  6. Variances as order parameter and complexity measure for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)

    2005-02-04

    Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.

  7. Anisotropic generalization of Stinchcombe's solution for the conductivity of random resistor networks on a Bethe lattice

    Science.gov (United States)

    Semeriyanov, F.; Saphiannikova, M.; Heinrich, G.

    2009-11-01

    Our study is based on the work of Stinchcombe (1974 J. Phys. C: Solid State Phys. 7 179) and is devoted to the calculations of average conductivity of random resistor networks placed on an anisotropic Bethe lattice. The structure of the Bethe lattice is assumed to represent the normal directions of the regular lattice. We calculate the anisotropic conductivity as an expansion in powers of the inverse coordination number of the Bethe lattice. The expansion terms retained deliver an accurate approximation of the conductivity at resistor concentrations above the percolation threshold. We make a comparison of our analytical results with those of Bernasconi (1974 Phys. Rev. B 9 4575) for the regular lattice.

  8. Anisotropic generalization of Stinchcombe's solution for the conductivity of random resistor networks on a Bethe lattice

    International Nuclear Information System (INIS)

    Semeriyanov, F; Saphiannikova, M; Heinrich, G

    2009-01-01

    Our study is based on the work of Stinchcombe (1974 J. Phys. C: Solid State Phys. 7 179) and is devoted to the calculations of average conductivity of random resistor networks placed on an anisotropic Bethe lattice. The structure of the Bethe lattice is assumed to represent the normal directions of the regular lattice. We calculate the anisotropic conductivity as an expansion in powers of the inverse coordination number of the Bethe lattice. The expansion terms retained deliver an accurate approximation of the conductivity at resistor concentrations above the percolation threshold. We make a comparison of our analytical results with those of Bernasconi (1974 Phys. Rev. B 9 4575) for the regular lattice.

  9. Enhancement of large fluctuations to extinction in adaptive networks

    Science.gov (United States)

    Hindes, Jason; Schwartz, Ira B.; Shaw, Leah B.

    2018-01-01

    During an epidemic, individual nodes in a network may adapt their connections to reduce the chance of infection. A common form of adaption is avoidance rewiring, where a noninfected node breaks a connection to an infected neighbor and forms a new connection to another noninfected node. Here we explore the effects of such adaptivity on stochastic fluctuations in the susceptible-infected-susceptible model, focusing on the largest fluctuations that result in extinction of infection. Using techniques from large-deviation theory, combined with a measurement of heterogeneity in the susceptible degree distribution at the endemic state, we are able to predict and analyze large fluctuations and extinction in adaptive networks. We find that in the limit of small rewiring there is a sharp exponential reduction in mean extinction times compared to the case of zero adaption. Furthermore, we find an exponential enhancement in the probability of large fluctuations with increased rewiring rate, even when holding the average number of infected nodes constant.

  10. A randomized controlled trial testing a social network intervention to promote physical activity among adolescents.

    Science.gov (United States)

    van Woudenberg, Thabo J; Bevelander, Kirsten E; Burk, William J; Smit, Crystal R; Buijs, Laura; Buijzen, Moniek

    2018-04-23

    The current study examined the effectiveness of a social network intervention to promote physical activity among adolescents. Social network interventions utilize peer influence to change behavior by identifying the most influential individuals within social networks (i.e., influence agents), and training them to promote the target behavior. A total of 190 adolescents (46.32% boys; M age = 12.17, age range: 11-14 years) were randomly allocated to either the intervention or control condition. In the intervention condition, the most influential adolescents (based on peer nominations of classmates) in each classroom were trained to promote physical activity among their classmates. Participants received a research smartphone to complete questionnaires and an accelerometer to measure physical activity (steps per day) at baseline, and during the intervention one month later. A multilevel model tested the effectiveness of the intervention, controlling for clustering of data within participants and days. No intervention effect was observed, b = .04, SE = .10, p = .66. This was one of the first studies to test whether physical activity in adolescents could be promoted via influence agents, and the first social network intervention to use smartphones to do so. Important lessons and implications are discussed concerning the selection criterion of the influence agents, the use of smartphones in social network intervention, and the rigorous analyses used to control for confounding factors. Dutch Trial Registry (NTR): NTR6173 . Registered 5 October 2016 Study procedures were approved by the Ethics Committee of the Radboud University (ECSW2014-100614-222).

  11. Multiple ECG Fiducial Points-Based Random Binary Sequence Generation for Securing Wireless Body Area Networks.

    Science.gov (United States)

    Zheng, Guanglou; Fang, Gengfa; Shankaran, Rajan; Orgun, Mehmet A; Zhou, Jie; Qiao, Li; Saleem, Kashif

    2017-05-01

    Generating random binary sequences (BSes) is a fundamental requirement in cryptography. A BS is a sequence of N bits, and each bit has a value of 0 or 1. For securing sensors within wireless body area networks (WBANs), electrocardiogram (ECG)-based BS generation methods have been widely investigated in which interpulse intervals (IPIs) from each heartbeat cycle are processed to produce BSes. Using these IPI-based methods to generate a 128-bit BS in real time normally takes around half a minute. In order to improve the time efficiency of such methods, this paper presents an ECG multiple fiducial-points based binary sequence generation (MFBSG) algorithm. The technique of discrete wavelet transforms is employed to detect arrival time of these fiducial points, such as P, Q, R, S, and T peaks. Time intervals between them, including RR, RQ, RS, RP, and RT intervals, are then calculated based on this arrival time, and are used as ECG features to generate random BSes with low latency. According to our analysis on real ECG data, these ECG feature values exhibit the property of randomness and, thus, can be utilized to generate random BSes. Compared with the schemes that solely rely on IPIs to generate BSes, this MFBSG algorithm uses five feature values from one heart beat cycle, and can be up to five times faster than the solely IPI-based methods. So, it achieves a design goal of low latency. According to our analysis, the complexity of the algorithm is comparable to that of fast Fourier transforms. These randomly generated ECG BSes can be used as security keys for encryption or authentication in a WBAN system.

  12. A special purpose computer for the calculation of the electric conductivity of a random resistor network

    International Nuclear Information System (INIS)

    Hajjar, Mansour

    1987-01-01

    The special purpose computer PERCOLA is designed for long numerical simulations on a percolation problem in Statistical Mechanics of disordered media. Our aim is to improve the actual values of the critical exponents characterizing the behaviour of random resistance networks at percolation threshold. The architecture of PERCOLA is based on an efficient iterative algorithm used to compute the electric conductivity of such networks. The calculator has the characteristics of a general purpose 64 bits floating point micro-programmable computer that can run programs for various types of problems with a peak performance of 25 Mflops. This high computing speed is a result of the pipeline architecture based on internal parallelism and separately micro-code controlled units such as: data memories, a micro-code memory, ALUs and multipliers (both WEITEK components), various data paths, a sequencer (ANALOG DEVICES component), address generators and a random number generator. Thus, the special purpose computer runs percolation problem program 10 percent faster than the supercomputer CRAY XMP. (author) [fr

  13. Physical states in the canonical tensor model from the perspective of random tensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Narain, Gaurav [The Institute for Fundamental Study “The Tah Poe Academia Institute”,Naresuan University, Phitsanulok 65000 (Thailand); Sasakura, Naoki [Yukawa Institute for Theoretical Physics,Kyoto University, Kyoto 606-8502 (Japan); Sato, Yuki [National Institute for Theoretical Physics,School of Physics and Centre for Theoretical Physics,University of the Witwartersrand, WITS 2050 (South Africa)

    2015-01-07

    Tensor models, generalization of matrix models, are studied aiming for quantum gravity in dimensions larger than two. Among them, the canonical tensor model is formulated as a totally constrained system with first-class constraints, the algebra of which resembles the Dirac algebra of general relativity. When quantized, the physical states are defined to be vanished by the quantized constraints. In explicit representations, the constraint equations are a set of partial differential equations for the physical wave-functions, which do not seem straightforward to be solved due to their non-linear character. In this paper, after providing some explicit solutions for N=2,3, we show that certain scale-free integration of partition functions of statistical systems on random networks (or random tensor networks more generally) provides a series of solutions for general N. Then, by generalizing this form, we also obtain various solutions for general N. Moreover, we show that the solutions for the cases with a cosmological constant can be obtained from those with no cosmological constant for increased N. This would imply the interesting possibility that a cosmological constant can always be absorbed into the dynamics and is not an input parameter in the canonical tensor model. We also observe the possibility of symmetry enhancement in N=3, and comment on an extension of Airy function related to the solutions.

  14. PUFKEY: a high-security and high-throughput hardware true random number generator for sensor networks.

    Science.gov (United States)

    Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

    2015-10-16

    Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.

  15. PUFKEY: A High-Security and High-Throughput Hardware True Random Number Generator for Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dongfang Li

    2015-10-01

    Full Text Available Random number generators (RNG play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST randomness tests and is resilient to a wide range of security attacks.

  16. Resistance and resistance fluctuations in random resistor networks under biased percolation.

    Science.gov (United States)

    Pennetta, Cecilia; Reggiani, L; Trefán, Gy; Alfinito, E

    2002-06-01

    We consider a two-dimensional random resistor network (RRN) in the presence of two competing biased processes consisting of the breaking and recovering of elementary resistors. These two processes are driven by the joint effects of an electrical bias and of the heat exchange with a thermal bath. The electrical bias is set up by applying a constant voltage or, alternatively, a constant current. Monte Carlo simulations are performed to analyze the network evolution in the full range of bias values. Depending on the bias strength, electrical failure or steady state are achieved. Here we investigate the steady state of the RRN focusing on the properties of the non-Ohmic regime. In constant-voltage conditions, a scaling relation is found between /(0) and V/V(0), where is the average network resistance, (0) the linear regime resistance, and V0 the threshold value for the onset of nonlinearity. A similar relation is found in constant-current conditions. The relative variance of resistance fluctuations also exhibits a strong nonlinearity whose properties are investigated. The power spectral density of resistance fluctuations presents a Lorentzian spectrum and the amplitude of fluctuations shows a significant non-Gaussian behavior in the prebreakdown region. These results compare well with electrical breakdown measurements in thin films of composites and of other conducting materials.

  17. Asymptotic Analysis of Large Cooperative Relay Networks Using Random Matrix Theory

    Directory of Open Access Journals (Sweden)

    H. Poor

    2008-04-01

    Full Text Available Cooperative transmission is an emerging communication technology that takes advantage of the broadcast nature of wireless channels. In cooperative transmission, the use of relays can create a virtual antenna array so that multiple-input/multiple-output (MIMO techniques can be employed. Most existing work in this area has focused on the situation in which there are a small number of sources and relays and a destination. In this paper, cooperative relay networks with large numbers of nodes are analyzed, and in particular the asymptotic performance improvement of cooperative transmission over direction transmission and relay transmission is analyzed using random matrix theory. The key idea is to investigate the eigenvalue distributions related to channel capacity and to analyze the moments of this distribution in large wireless networks. A performance upper bound is derived, the performance in the low signal-to-noise-ratio regime is analyzed, and two approximations are obtained for high and low relay-to-destination link qualities, respectively. Finally, simulations are provided to validate the accuracy of the analytical results. The analysis in this paper provides important tools for the understanding and the design of large cooperative wireless networks.

  18. More randomized and resilient in the topological properties of functional brain networks in patients with major depressive disorder.

    Science.gov (United States)

    Li, Huaizhou; Zhou, Haiyan; Yang, Yang; Wang, Haiyuan; Zhong, Ning

    2017-10-01

    Previous studies have reported the enhanced randomization of functional brain networks in patients with major depressive disorder (MDD). However, little is known about the changes of key nodal attributes for randomization, the resilience of network, and the clinical significance of the alterations. In this study, we collected the resting-state functional MRI data from 19 MDD patients and 19 healthy control (HC) individuals. Graph theory analysis showed that decreases were found in the small-worldness, clustering coefficient, local efficiency, and characteristic path length (i.e., increase of global efficiency) in the network of MDD group compared with HC group, which was consistent with previous findings and suggested the development toward randomization in the brain network in MDD. In addition, the greater resilience under the targeted attacks was also found in the network of patients with MDD. Furthermore, the abnormal nodal properties were found, including clustering coefficients and nodal efficiencies in the left orbital superior frontal gyrus, bilateral insula, left amygdala, right supramarginal gyrus, left putamen, left posterior cingulate cortex, left angular gyrus. Meanwhile, the correlation analysis showed that most of these abnormal areas were associated with the clinical status. The observed increased randomization and resilience in MDD might be related to the abnormal hub nodes in the brain networks, which were attacked by the disease pathology. Our findings provide new evidence to indicate that the weakening of specialized regions and the enhancement of whole brain integrity could be the potential endophenotype of the depressive pathology. Copyright © 2017 Elsevier Ltd. All rights reserved.

  19. Mindfulness Meditation Training and Executive Control Network Resting State Functional Connectivity: A Randomized Controlled Trial.

    Science.gov (United States)

    Taren, Adrienne A; Gianaros, Peter J; Greco, Carol M; Lindsay, Emily K; Fairgrieve, April; Brown, Kirk Warren; Rosen, Rhonda K; Ferris, Jennifer L; Julson, Erica; Marsland, Anna L; Creswell, J David

    Mindfulness meditation training has been previously shown to enhance behavioral measures of executive control (e.g., attention, working memory, cognitive control), but the neural mechanisms underlying these improvements are largely unknown. Here, we test whether mindfulness training interventions foster executive control by strengthening functional connections between dorsolateral prefrontal cortex (dlPFC)-a hub of the executive control network-and frontoparietal regions that coordinate executive function. Thirty-five adults with elevated levels of psychological distress participated in a 3-day randomized controlled trial of intensive mindfulness meditation or relaxation training. Participants completed a resting state functional magnetic resonance imaging scan before and after the intervention. We tested whether mindfulness meditation training increased resting state functional connectivity (rsFC) between dlPFC and frontoparietal control network regions. Left dlPFC showed increased connectivity to the right inferior frontal gyrus (T = 3.74), right middle frontal gyrus (MFG) (T = 3.98), right supplementary eye field (T = 4.29), right parietal cortex (T = 4.44), and left middle temporal gyrus (T = 3.97, all p < .05) after mindfulness training relative to the relaxation control. Right dlPFC showed increased connectivity to right MFG (T = 4.97, p < .05). We report that mindfulness training increases rsFC between dlPFC and dorsal network (superior parietal lobule, supplementary eye field, MFG) and ventral network (right IFG, middle temporal/angular gyrus) regions. These findings extend previous work showing increased functional connectivity among brain regions associated with executive function during active meditation by identifying specific neural circuits in which rsFC is enhanced by a mindfulness intervention in individuals with high levels of psychological distress. Clinicaltrials.gov,NCT01628809.

  20. Randomized Trial of a Social Networking Intervention for Cancer-Related Distress.

    Science.gov (United States)

    Owen, Jason E; O'Carroll Bantum, Erin; Pagano, Ian S; Stanton, Annette

    2017-10-01

    Web and mobile technologies appear to hold promise for delivering evidence-informed and evidence-based intervention to cancer survivors and others living with trauma and other psychological concerns. Health-space.net was developed as a comprehensive online social networking and coping skills training program for cancer survivors living with distress. The purpose of this study was to evaluate the effects of a 12-week social networking intervention on distress, depression, anxiety, vigor, and fatigue in cancer survivors reporting high levels of cancer-related distress. We recruited 347 participants from a local cancer registry and internet, and all were randomized to either a 12-week waiting list control group or to immediate access to the intervention. Intervention participants received secure access to the study website, which provided extensive social networking capabilities and coping skills training exercises facilitated by a professional facilitator. Across time, the prevalence of clinically significant depression symptoms declined from 67 to 34 % in both conditions. The health-space.net intervention had greater declines in fatigue than the waitlist control group, but the intervention did not improve outcomes for depression, trauma-related anxiety symptoms, or overall mood disturbance. For those with more severe levels of anxiety at baseline, greater engagement with the intervention was associated with higher levels of symptom reduction over time. The intervention resulted in small but significant effects on fatigue but not other primary or secondary outcomes. Results suggest that this social networking intervention may be most effective for those who have distress that is not associated with high levels of anxiety symptoms or very poor overall psychological functioning. The trial was registered with the ClinicalTrials.gov database ( ClinicalTrials.gov #NCT01976949).

  1. Dynamic fair node spectrum allocation for ad hoc networks using random matrices

    Science.gov (United States)

    Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

    2015-05-01

    Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

  2. Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks

    Directory of Open Access Journals (Sweden)

    Sylwia Romaszko

    2013-12-01

    Full Text Available This paper proposes a rendezvous protocol for cognitive radio ad hoc networks, RAC2E-gQS, which utilizes (1 the asynchronous and randomness properties of the RAC2E protocol, and (2 channel mapping protocol, based on a grid Quorum System (gQS, and taking into account channel heterogeneity and asymmetric channel views. We show that the combination of the RAC2E protocol with the grid-quorum based channel mapping can yield a powerful RAC2E-gQS rendezvous protocol for asynchronous operation in a distributed environment assuring a rapid rendezvous between the cognitive radio nodes having available both symmetric and asymmetric channel views. We also propose an enhancement of the protocol, which uses a torus QS for a slot allocation, dealing with the worst case scenario, a large number of channels with opposite ranking lists.

  3. Online Distributed Learning Over Networks in RKH Spaces Using Random Fourier Features

    Science.gov (United States)

    Bouboulis, Pantelis; Chouvardas, Symeon; Theodoridis, Sergios

    2018-04-01

    We present a novel diffusion scheme for online kernel-based learning over networks. So far, a major drawback of any online learning algorithm, operating in a reproducing kernel Hilbert space (RKHS), is the need for updating a growing number of parameters as time iterations evolve. Besides complexity, this leads to an increased need of communication resources, in a distributed setting. In contrast, the proposed method approximates the solution as a fixed-size vector (of larger dimension than the input space) using Random Fourier Features. This paves the way to use standard linear combine-then-adapt techniques. To the best of our knowledge, this is the first time that a complete protocol for distributed online learning in RKHS is presented. Conditions for asymptotic convergence and boundness of the networkwise regret are also provided. The simulated tests illustrate the performance of the proposed scheme.

  4. Nonlinear random resistor diode networks and fractal dimensions of directed percolation clusters.

    Science.gov (United States)

    Stenull, O; Janssen, H K

    2001-07-01

    We study nonlinear random resistor diode networks at the transition from the nonpercolating to the directed percolating phase. The resistor-like bonds and the diode-like bonds under forward bias voltage obey a generalized Ohm's law V approximately I(r). Based on general grounds such as symmetries and relevance we develop a field theoretic model. We focus on the average two-port resistance, which is governed at the transition by the resistance exponent straight phi(r). By employing renormalization group methods we calculate straight phi(r) for arbitrary r to one-loop order. Then we address the fractal dimensions characterizing directed percolation clusters. Via considering distinct values of the nonlinearity r, we determine the dimension of the red bonds, the chemical path, and the backbone to two-loop order.

  5. Logarithmic corrections to scaling in critical percolation and random resistor networks.

    Science.gov (United States)

    Stenull, Olaf; Janssen, Hans-Karl

    2003-09-01

    We study the critical behavior of various geometrical and transport properties of percolation in six dimensions. By employing field theory and renormalization group methods we analyze fluctuation induced logarithmic corrections to scaling up to and including the next-to-leading order correction. Our study comprehends the percolation correlation function, i.e., the probability that two given points are connected, and some of the fractal masses describing percolation clusters. To be specific, we calculate the mass of the backbone, the red bonds, and the shortest path. Moreover, we study key transport properties of percolation as represented by the random resistor network. We investigate the average two-point resistance as well as the entire family of multifractal moments of the current distribution.

  6. Engineering applications of fpgas chaotic systems, artificial neural networks, random number generators, and secure communication systems

    CERN Document Server

    Tlelo-Cuautle, Esteban; de la Fraga, Luis Gerardo

    2016-01-01

    This book offers readers a clear guide to implementing engineering applications with FPGAs, from the mathematical description to the hardware synthesis, including discussion of VHDL programming and co-simulation issues. Coverage includes FPGA realizations such as: chaos generators that are described from their mathematical models; artificial neural networks (ANNs) to predict chaotic time series, for which a discussion of different ANN topologies is included, with different learning techniques and activation functions; random number generators (RNGs) that are realized using different chaos generators, and discussions of their maximum Lyapunov exponent values and entropies. Finally, optimized chaotic oscillators are synchronized and realized to implement a secure communication system that processes black and white and grey-scale images. In each application, readers will find VHDL programming guidelines and computer arithmetic issues, along with co-simulation examples with Active-HDL and Simulink. Readers will b...

  7. Surgical interventions to treat humerus shaft fractures: A network meta-analysis of randomized controlled trials.

    Directory of Open Access Journals (Sweden)

    Jia-Guo Zhao

    Full Text Available There are three main surgical techniques to treat humeral shaft fractures: open reduction and plate fixation (ORPF, intramedullary nail (IMN fixation, and minimally invasive percutaneous osteosynthesis (MIPO. We performed a network meta-analysis to compare three surgical procedures, including ORPF, IMN fixation, and MIPO, to provide the optimum treatment for humerus shaft fractures.MEDLINE, EMBASE, Cochrane Bone, Joint and Muscle Trauma Group Specialised Register, and Cochrane library were researched for reports published up to May 2016. We only included randomized controlled trials (RCTs comparing two or more of the three surgical procedures, including the ORPF, IMN, and MIPO techniques, for humeral shaft fractures in adults. The methodological quality was evaluated based on the Cochrane risk of bias tool. We used WinBUGS1.4 to conduct this Bayesian network meta-analysis. We used the odd ratios (ORs with 95% confidence intervals (CIs to calculate the dichotomous outcomes and analyzed the percentages of the surface under the cumulative ranking curve.Seventeen eligible publications reporting 16 RCTs were included in this study. Eight hundred and thirty-two participants were randomized to receive one of three surgical procedures. The results showed that shoulder impingement occurred more commonly in the IMN group than with either ORPF (OR, 0.13; 95% CI, 0.03-0.37 or MIPO fixation (OR, 0.08; 95% CI, 0.00-0.69. Iatrogenic radial nerve injury occurred more commonly in the ORPF group than in the MIPO group (OR, 11.09; 95% CI, 1.80-124.20. There were no significant differences among the three procedures in nonunion, delayed union, and infection.Compared with IMN and ORPF, MIPO technique is the preferred treatment method for humeral shaft fractures.

  8. Ensemble of Neural Network Conditional Random Fields for Self-Paced Brain Computer Interfaces

    Directory of Open Access Journals (Sweden)

    Hossein Bashashati

    2017-07-01

    Full Text Available Classification of EEG signals in self-paced Brain Computer Interfaces (BCI is an extremely challenging task. The main difficulty stems from the fact that start time of a control task is not defined. Therefore it is imperative to exploit the characteristics of the EEG data to the extent possible. In sensory motor self-paced BCIs, while performing the mental task, the user’s brain goes through several well-defined internal state changes. Applying appropriate classifiers that can capture these state changes and exploit the temporal correlation in EEG data can enhance the performance of the BCI. In this paper, we propose an ensemble learning approach for self-paced BCIs. We use Bayesian optimization to train several different classifiers on different parts of the BCI hyper- parameter space. We call each of these classifiers Neural Network Conditional Random Field (NNCRF. NNCRF is a combination of a neural network and conditional random field (CRF. As in the standard CRF, NNCRF is able to model the correlation between adjacent EEG samples. However, NNCRF can also model the nonlinear dependencies between the input and the output, which makes it more powerful than the standard CRF. We compare the performance of our algorithm to those of three popular sequence labeling algorithms (Hidden Markov Models, Hidden Markov Support Vector Machines and CRF, and to two classical classifiers (Logistic Regression and Support Vector Machines. The classifiers are compared for the two cases: when the ensemble learning approach is not used and when it is. The data used in our studies are those from the BCI competition IV and the SM2 dataset. We show that our algorithm is considerably superior to the other approaches in terms of the Area Under the Curve (AUC of the BCI system.

  9. Support or competition? How online social networks increase physical activity: A randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Jingwen Zhang, PhD

    2016-12-01

    Full Text Available To identify what features of online social networks can increase physical activity, we conducted a 4-arm randomized controlled trial in 2014 in Philadelphia, PA. Students (n = 790, mean age = 25.2 at an university were randomly assigned to one of four conditions composed of either supportive or competitive relationships and either with individual or team incentives for attending exercise classes. The social comparison condition placed participants into 6-person competitive networks with individual incentives. The social support condition placed participants into 6-person teams with team incentives. The combined condition with both supportive and competitive relationships placed participants into 6-person teams, where participants could compare their team's performance to 5 other teams' performances. The control condition only allowed participants to attend classes with individual incentives. Rewards were based on the total number of classes attended by an individual, or the average number of classes attended by the members of a team. The outcome was the number of classes that participants attended. Data were analyzed using multilevel models in 2014. The mean attendance numbers per week were 35.7, 38.5, 20.3, and 16.8 in the social comparison, the combined, the control, and the social support conditions. Attendance numbers were 90% higher in the social comparison and the combined conditions (mean = 1.9, SE = 0.2 in contrast to the two conditions without comparison (mean = 1.0, SE = 0.2 (p = 0.003. Social comparison was more effective for increasing physical activity than social support and its effects did not depend on individual or team incentives.

  10. Impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach.

    Science.gov (United States)

    Chandrasekar, A; Rakkiyappan, R; Cao, Jinde

    2015-10-01

    This paper studies the impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach. The array of neural networks are coupled in a random fashion which is governed by Bernoulli random variable. The aim of this paper is to obtain the synchronization criteria, which is suitable for both exactly known and partly unknown transition probabilities such that the coupled neural network is synchronized with mixed time-delay. The considered impulsive effects can be synchronized at partly unknown transition probabilities. Besides, a multiple integral approach is also proposed to strengthen the Markovian jumping randomly coupled neural networks with partly unknown transition probabilities. By making use of Kronecker product and some useful integral inequalities, a novel Lyapunov-Krasovskii functional was designed for handling the coupled neural network with mixed delay and then impulsive synchronization criteria are solvable in a set of linear matrix inequalities. Finally, numerical examples are presented to illustrate the effectiveness and advantages of the theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

  11. Random access procedures and radio access network (RAN) overload control in standard and advanced long-term evolution (LTE and LTE-A) networks

    DEFF Research Database (Denmark)

    Kiilerich Pratas, Nuno; Thomsen, Henning; Popovski, Petar

    2015-01-01

    In this chapter, we describe and discuss the current LTE random access procedure and the Radio Access Network Load Control solution within LTE/LTE-A. We provide an overview of the several considered load control solutions and give a detailed description of the standardized Extended Access Class B...

  12. Scaling of peak flows with constant flow velocity in random self-similar networks

    Directory of Open Access Journals (Sweden)

    R. Mantilla

    2011-07-01

    Full Text Available A methodology is presented to understand the role of the statistical self-similar topology of real river networks on scaling, or power law, in peak flows for rainfall-runoff events. We created Monte Carlo generated sets of ensembles of 1000 random self-similar networks (RSNs with geometrically distributed interior and exterior generators having parameters pi and pe, respectively. The parameter values were chosen to replicate the observed topology of real river networks. We calculated flow hydrographs in each of these networks by numerically solving the link-based mass and momentum conservation equation under the assumption of constant flow velocity. From these simulated RSNs and hydrographs, the scaling exponents β and φ characterizing power laws with respect to drainage area, and corresponding to the width functions and flow hydrographs respectively, were estimated. We found that, in general, φ > β, which supports a similar finding first reported for simulations in the river network of the Walnut Gulch basin, Arizona. Theoretical estimation of β and φ in RSNs is a complex open problem. Therefore, using results for a simpler problem associated with the expected width function and expected hydrograph for an ensemble of RSNs, we give heuristic arguments for theoretical derivations of the scaling exponents β(E and φ(E that depend on the Horton ratios for stream lengths and areas. These ratios in turn have a known dependence on the parameters of the geometric distributions of RSN generators. Good agreement was found between the analytically conjectured values of β(E and φ(E and the values estimated by the simulated ensembles of RSNs and hydrographs. The independence of the scaling exponents φ(E and φ with respect to the value of flow velocity and runoff intensity implies an interesting connection between unit

  13. Scaling of peak flows with constant flow velocity in random self-similar networks

    Science.gov (United States)

    Troutman, Brent M.; Mantilla, Ricardo; Gupta, Vijay K.

    2011-01-01

    A methodology is presented to understand the role of the statistical self-similar topology of real river networks on scaling, or power law, in peak flows for rainfall-runoff events. We created Monte Carlo generated sets of ensembles of 1000 random self-similar networks (RSNs) with geometrically distributed interior and exterior generators having parameters pi and pe, respectively. The parameter values were chosen to replicate the observed topology of real river networks. We calculated flow hydrographs in each of these networks by numerically solving the link-based mass and momentum conservation equation under the assumption of constant flow velocity. From these simulated RSNs and hydrographs, the scaling exponents β and φ characterizing power laws with respect to drainage area, and corresponding to the width functions and flow hydrographs respectively, were estimated. We found that, in general, φ > β, which supports a similar finding first reported for simulations in the river network of the Walnut Gulch basin, Arizona. Theoretical estimation of β and φ in RSNs is a complex open problem. Therefore, using results for a simpler problem associated with the expected width function and expected hydrograph for an ensemble of RSNs, we give heuristic arguments for theoretical derivations of the scaling exponents β(E) and φ(E) that depend on the Horton ratios for stream lengths and areas. These ratios in turn have a known dependence on the parameters of the geometric distributions of RSN generators. Good agreement was found between the analytically conjectured values of β(E) and φ(E) and the values estimated by the simulated ensembles of RSNs and hydrographs. The independence of the scaling exponents φ(E) and φ with respect to the value of flow velocity and runoff intensity implies an interesting connection between unit hydrograph theory and flow dynamics. Our results provide a reference framework to study scaling exponents under more complex scenarios

  14. Frequency decoding of periodically timed action potentials through distinct activity patterns in a random neural network

    International Nuclear Information System (INIS)

    Reichenbach, Tobias; Hudspeth, A J

    2012-01-01

    Frequency discrimination is a fundamental task of the auditory system. The mammalian inner ear, or cochlea, provides a place code in which different frequencies are detected at different spatial locations. However, a temporal code based on spike timing is also available: action potentials evoked in an auditory-nerve fiber by a low-frequency tone occur at a preferred phase of the stimulus—they exhibit phase locking—and thus provide temporal information about the tone's frequency. Humans employ this temporal information for discrimination of low frequencies. How might such temporal information be read out in the brain? Here we employ statistical and numerical methods to demonstrate that recurrent random neural networks in which connections between neurons introduce characteristic time delays, and in which neurons require temporally coinciding inputs for spike initiation, can perform sharp frequency discrimination when stimulated with phase-locked inputs. Although the frequency resolution achieved by such networks is limited by the noise in phase locking, the resolution for realistic values reaches the tiny frequency difference of 0.2% that has been measured in humans. (paper)

  15. Randomly biased investments and the evolution of public goods on interdependent networks

    Science.gov (United States)

    Chen, Wei; Wu, Te; Li, Zhiwu; Wang, Long

    2017-08-01

    Deciding how to allocate resources between interdependent systems is significant to optimize efficiency. We study the effects of heterogeneous contribution, induced by such interdependency, on the evolution of cooperation, through implementing the public goods games on two-layer networks. The corresponding players on different layers try to share a fixed amount of resources as the initial investment properly. The symmetry breaking of investments between players located on different layers is able to either prevent investments from, or extract them out of the deadlock. Results show that a moderate investment heterogeneity is best favorable for the evolution of cooperation, and random allocation of investment bias suppresses the cooperators at a wide range of the investment bias and the enhancement effect. Further studies on time evolution with different initial strategy configurations show that the non-interdependent cooperators along the interface of interdependent cooperators also are an indispensable factor in facilitating cooperative behavior. Our main results are qualitatively unchanged even diversifying investment bias that is subject to uniform distribution. Our study may shed light on the understanding of the origin of cooperative behavior on interdependent networks.

  16. Heave motion prediction of a large barge in random seas by using artificial neural network

    Science.gov (United States)

    Lee, Hsiu Eik; Liew, Mohd Shahir; Zawawi, Noor Amila Wan Abdullah; Toloue, Iraj

    2017-11-01

    This paper describes the development of a multi-layer feed forward artificial neural network (ANN) to predict rigid heave body motions of a large catenary moored barge subjected to multi-directional irregular waves. The barge is idealized as a rigid plate of finite draft with planar dimensions 160m (length) and 100m (width) which is held on station using a six point chain catenary mooring in 50m water depth. Hydroelastic effects are neglected from the physical model as the chief intent of this study is focused on large plate rigid body hydrodynamics modelling using ANN. Even with this assumption, the computational requirements for time domain coupled hydrodynamic simulations of a moored floating body is considerably costly, particularly if a large number of simulations are required such as in the case of response based design (RBD) methods. As an alternative to time consuming numerical hydrodynamics, a regression-type ANN model has been developed for efficient prediction of the barge's heave responses to random waves from various directions. It was determined that a network comprising of 3 input features, 2 hidden layers with 5 neurons each and 1 output was sufficient to produce acceptable predictions within 0.02 mean squared error. By benchmarking results from the ANN with those generated by a fully coupled dynamic model in OrcaFlex, it is demonstrated that the ANN is capable of predicting the barge's heave responses with acceptable accuracy.

  17. Social dilemmas in an online social network: The structure and evolution of cooperation

    International Nuclear Information System (INIS)

    Fu Feng; Chen Xiaojie; Liu Lianghuan; Wang Long

    2007-01-01

    We investigate two paradigms for studying the evolution of cooperation-Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society

  18. Social dilemmas in an online social network: The structure and evolution of cooperation

    Energy Technology Data Exchange (ETDEWEB)

    Fu Feng [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: fufeng@pku.edu.cn; Chen Xiaojie; Liu Lianghuan [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China); Wang Long [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: longwang@pku.edu.cn

    2007-11-05

    We investigate two paradigms for studying the evolution of cooperation-Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

  19. Esophagus segmentation in CT via 3D fully convolutional neural network and random walk.

    Science.gov (United States)

    Fechter, Tobias; Adebahr, Sonja; Baltas, Dimos; Ben Ayed, Ismail; Desrosiers, Christian; Dolz, Jose

    2017-12-01

    Precise delineation of organs at risk is a crucial task in radiotherapy treatment planning for delivering high doses to the tumor while sparing healthy tissues. In recent years, automated segmentation methods have shown an increasingly high performance for the delineation of various anatomical structures. However, this task remains challenging for organs like the esophagus, which have a versatile shape and poor contrast to neighboring tissues. For human experts, segmenting the esophagus from CT images is a time-consuming and error-prone process. To tackle these issues, we propose a random walker approach driven by a 3D fully convolutional neural network (CNN) to automatically segment the esophagus from CT images. First, a soft probability map is generated by the CNN. Then, an active contour model (ACM) is fitted to the CNN soft probability map to get a first estimation of the esophagus location. The outputs of the CNN and ACM are then used in conjunction with a probability model based on CT Hounsfield (HU) values to drive the random walker. Training and evaluation were done on 50 CTs from two different datasets, with clinically used peer-reviewed esophagus contours. Results were assessed regarding spatial overlap and shape similarity. The esophagus contours generated by the proposed algorithm showed a mean Dice coefficient of 0.76 ± 0.11, an average symmetric square distance of 1.36 ± 0.90 mm, and an average Hausdorff distance of 11.68 ± 6.80, compared to the reference contours. These results translate to a very good agreement with reference contours and an increase in accuracy compared to existing methods. Furthermore, when considering the results reported in the literature for the publicly available Synapse dataset, our method outperformed all existing approaches, which suggests that the proposed method represents the current state-of-the-art for automatic esophagus segmentation. We show that a CNN can yield accurate estimations of esophagus location, and that

  20. Combinatorial control of adhesion of Brucella abortus 2308 to host cells by transcriptional rewiring of the trimeric autotransporter btaE gene.

    Science.gov (United States)

    Sieira, Rodrigo; Bialer, Magalí G; Roset, Mara S; Ruiz-Ranwez, Verónica; Langer, Tomás; Arocena, Gastón M; Mancini, Estefanía; Zorreguieta, Angeles

    2017-02-01

    Regulatory network plasticity is a key attribute underlying changes in bacterial gene expression and a source of phenotypic diversity to interact with the surrounding environment. Here, we sought to study the transcriptional circuit of HutC, a regulator of both metabolic and virulence genes of the facultative intracellular pathogen Brucella. Using in silico and biochemical approaches, we identified a novel functional HutC-binding site upstream of btaE, a trimeric-autotransporter adhesin involved in the attachment of Brucella to host extracellular matrix components. Moreover, we identified two additional regulators, one of which, MdrA, acts in concert with HutC to exert a combinatorial control of both btaE promoter activity and attachment of Brucella to HeLa cells. Analysis of btaE promoter sequences of different species indicated that this HutC-binding site was generated de novo by a single point mutation in a virulent Brucella strain, indicative of a transcriptional rewiring event. In addition to major domain organization differences existing between BtaE proteins within the genus Brucella, our analyses revealed that sequences upstream of btaE display high variability probably associated to intrinsic promoter structural features, which may serve as a substrate for reciprocal selection during co-evolution between this pathogen and its mammalian host. © 2016 John Wiley & Sons Ltd.

  1. Two-terminal reliability of a mobile ad hoc network under the asymptotic spatial distribution of the random waypoint model

    International Nuclear Information System (INIS)

    Chen, Binchao; Phillips, Aaron; Matis, Timothy I.

    2012-01-01

    The random waypoint (RWP) mobility model is frequently used in describing the movement pattern of mobile users in a mobile ad hoc network (MANET). As the asymptotic spatial distribution of nodes under a RWP model exhibits central tendency, the two-terminal reliability of the MANET is investigated as a function of the source node location. In particular, analytical expressions for one and two hop connectivities are developed as well as an efficient simulation methodology for two-terminal reliability. A study is then performed to assess the effect of nodal density and network topology on network reliability.

  2. Wealth distribution on complex networks

    Science.gov (United States)

    Ichinomiya, Takashi

    2012-12-01

    We study the wealth distribution of the Bouchaud-Mézard model on complex networks. It is known from numerical simulations that this distribution depends on the topology of the network; however, no one has succeeded in explaining it. Using “adiabatic” and “independent” assumptions along with the central-limit theorem, we derive equations that determine the probability distribution function. The results are compared to those of simulations for various networks. We find good agreement between our theory and the simulations, except for the case of Watts-Strogatz networks with a low rewiring rate due to the breakdown of independent assumption.

  3. Large-size, high-uniformity, random silver nanowire networks as transparent electrodes for crystalline silicon wafer solar cells.

    Science.gov (United States)

    Xie, Shouyi; Ouyang, Zi; Jia, Baohua; Gu, Min

    2013-05-06

    Metal nanowire networks are emerging as next generation transparent electrodes for photovoltaic devices. We demonstrate the application of random silver nanowire networks as the top electrode on crystalline silicon wafer solar cells. The dependence of transmittance and sheet resistance on the surface coverage is measured. Superior optical and electrical properties are observed due to the large-size, highly-uniform nature of these networks. When applying the nanowire networks on the solar cells with an optimized two-step annealing process, we achieved as large as 19% enhancement on the energy conversion efficiency. The detailed analysis reveals that the enhancement is mainly caused by the improved electrical properties of the solar cells due to the silver nanowire networks. Our result reveals that this technology is a promising alternative transparent electrode technology for crystalline silicon wafer solar cells.

  4. Network clustering analysis using mixture exponential-family random graph models and its application in genetic interaction data.

    Science.gov (United States)

    Wang, Yishu; Zhao, Hongyu; Deng, Minghua; Fang, Huaying; Yang, Dejie

    2017-08-24

    Epistatic miniarrary profile (EMAP) studies have enabled the mapping of large-scale genetic interaction networks and generated large amounts of data in model organisms. It provides an incredible set of molecular tools and advanced technologies that should be efficiently understanding the relationship between the genotypes and phenotypes of individuals. However, the network information gained from EMAP cannot be fully exploited using the traditional statistical network models. Because the genetic network is always heterogeneous, for example, the network structure features for one subset of nodes are different from those of the left nodes. Exponentialfamily random graph models (ERGMs) are a family of statistical models, which provide a principled and flexible way to describe the structural features (e.g. the density, centrality and assortativity) of an observed network. However, the single ERGM is not enough to capture this heterogeneity of networks. In this paper, we consider a mixture ERGM (MixtureEGRM) networks, which model a network with several communities, where each community is described by a single EGRM.

  5. A Mixed-Methods Randomized Controlled Trial of Financial Incentives and Peer Networks to Promote Walking among Older Adults

    Science.gov (United States)

    Kullgren, Jeffrey T.; Harkins, Kristin A.; Bellamy, Scarlett L.; Gonzales, Amy; Tao, Yuanyuan; Zhu, Jingsan; Volpp, Kevin G.; Asch, David A.; Heisler, Michele; Karlawish, Jason

    2014-01-01

    Background: Financial incentives and peer networks could be delivered through eHealth technologies to encourage older adults to walk more. Methods: We conducted a 24-week randomized trial in which 92 older adults with a computer and Internet access received a pedometer, daily walking goals, and weekly feedback on goal achievement. Participants…

  6. A Fast Reactive Power Optimization in Distribution Network Based on Large Random Matrix Theory and Data Analysis

    Directory of Open Access Journals (Sweden)

    Wanxing Sheng

    2016-05-01

    Full Text Available In this paper, a reactive power optimization method based on historical data is investigated to solve the dynamic reactive power optimization problem in distribution network. In order to reflect the variation of loads, network loads are represented in a form of random matrix. Load similarity (LS is defined to measure the degree of similarity between the loads in different days and the calculation method of the load similarity of load random matrix (LRM is presented. By calculating the load similarity between the forecasting random matrix and the random matrix of historical load, the historical reactive power optimization dispatching scheme that most matches the forecasting load can be found for reactive power control usage. The differences of daily load curves between working days and weekends in different seasons are considered in the proposed method. The proposed method is tested on a standard 14 nodes distribution network with three different types of load. The computational result demonstrates that the proposed method for reactive power optimization is fast, feasible and effective in distribution network.

  7. Analyzing phase diagrams and phase transitions in networked competing populations

    Science.gov (United States)

    Ni, Y.-C.; Yin, H. P.; Xu, C.; Hui, P. M.

    2011-03-01

    Phase diagrams exhibiting the extent of cooperation in an evolutionary snowdrift game implemented in different networks are studied in detail. We invoke two independent payoff parameters, unlike a single payoff often used in most previous works that restricts the two payoffs to vary in a correlated way. In addition to the phase transition points when a single payoff parameter is used, phase boundaries separating homogeneous phases consisting of agents using the same strategy and a mixed phase consisting of agents using different strategies are found. Analytic expressions of the phase boundaries are obtained by invoking the ideas of the last surviving patterns and the relative alignments of the spectra of payoff values to agents using different strategies. In a Watts-Strogatz regular network, there exists a re-entrant phenomenon in which the system goes from a homogeneous phase into a mixed phase and re-enters the homogeneous phase as one of the two payoff parameters is varied. The non-trivial phase diagram accompanying this re-entrant phenomenon is quantitatively analyzed. The effects of noise and cooperation in randomly rewired Watts-Strogatz networks are also studied. The transition between a mixed phase and a homogeneous phase is identify to belong to the directed percolation universality class. The methods used in the present work are applicable to a wide range of problems in competing populations of networked agents.

  8. Rewiring carbohydrate catabolism differentially affects survival of pancreatic cancer cell lines with diverse metabolic profiles

    Science.gov (United States)

    Tataranni, Tiziana; Agriesti, Francesca; Ruggieri, Vitalba; Mazzoccoli, Carmela; Simeon, Vittorio; Laurenzana, Ilaria; Scrima, Rosella; Pazienza, Valerio; Capitanio, Nazzareno; Piccoli, Claudia

    2017-01-01

    An increasing body of evidence suggests that targeting cellular metabolism represents a promising effective approach to treat pancreatic cancer, overcome chemoresistance and ameliorate patient's prognosis and survival. In this study, following whole-genome expression analysis, we selected two pancreatic cancer cell lines, PANC-1 and BXPC-3, hallmarked by distinct metabolic profiles with specific concern to carbohydrate metabolism. Functional comparative analysis showed that BXPC-3 displayed a marked deficit of the mitochondrial respiratory and oxidative phosphorylation activity and a higher production of reactive oxygen species and a reduced NAD+/NADH ratio, indicating their bioenergetic reliance on glycolysis and a different redox homeostasis as compared to PANC-1. Both cell lines were challenged to rewire their metabolism by substituting glucose with galactose as carbon source, a condition inhibiting the glycolytic flux and fostering full oxidation of the sugar carbons. The obtained data strikingly show that the mitochondrial respiration-impaired-BXPC-3 cell line was unable to sustain the metabolic adaptation required by glucose deprivation/substitution, thereby resulting in a G2\\M cell cycle shift, unbalance of the redox homeostasis, apoptosis induction. Conversely, the mitochondrial respiration-competent-PANC-1 cell line did not show clear evidence of cell sufferance. Our findings provide a strong rationale to candidate metabolism as a promising target for cancer therapy. Defining the metabolic features at time of pancreatic cancer diagnosis and likely of other tumors, appears to be crucial to predict the responsiveness to therapeutic approaches or coadjuvant interventions affecting metabolism. PMID:28476035

  9. RANK rewires energy homeostasis in lung cancer cells and drives primary lung cancer.

    Science.gov (United States)

    Rao, Shuan; Sigl, Verena; Wimmer, Reiner Alois; Novatchkova, Maria; Jais, Alexander; Wagner, Gabriel; Handschuh, Stephan; Uribesalgo, Iris; Hagelkruys, Astrid; Kozieradzki, Ivona; Tortola, Luigi; Nitsch, Roberto; Cronin, Shane J; Orthofer, Michael; Branstetter, Daniel; Canon, Jude; Rossi, John; D'Arcangelo, Manolo; Botling, Johan; Micke, Patrick; Fleur, Linnea La; Edlund, Karolina; Bergqvist, Michael; Ekman, Simon; Lendl, Thomas; Popper, Helmut; Takayanagi, Hiroshi; Kenner, Lukas; Hirsch, Fred R; Dougall, William; Penninger, Josef M

    2017-10-15

    Lung cancer is the leading cause of cancer deaths. Besides smoking, epidemiological studies have linked female sex hormones to lung cancer in women; however, the underlying mechanisms remain unclear. Here we report that the receptor activator of nuclear factor-kB (RANK), the key regulator of osteoclastogenesis, is frequently expressed in primary lung tumors, an active RANK pathway correlates with decreased survival, and pharmacologic RANK inhibition reduces tumor growth in patient-derived lung cancer xenografts. Clonal genetic inactivation of KRas G12D in mouse lung epithelial cells markedly impairs the progression of KRas G12D -driven lung cancer, resulting in a significant survival advantage. Mechanistically, RANK rewires energy homeostasis in human and murine lung cancer cells and promotes expansion of lung cancer stem-like cells, which is blocked by inhibiting mitochondrial respiration. Our data also indicate survival differences in KRas G12D -driven lung cancer between male and female mice, and we show that female sex hormones can promote lung cancer progression via the RANK pathway. These data uncover a direct role for RANK in lung cancer and may explain why female sex hormones accelerate lung cancer development. Inhibition of RANK using the approved drug denosumab may be a therapeutic drug candidate for primary lung cancer. © 2017 Rao et al.; Published by Cold Spring Harbor Laboratory Press.

  10. Extensive and systematic rewiring of histone post-translational modifications in cancer model systems.

    Science.gov (United States)

    Noberini, Roberta; Osti, Daniela; Miccolo, Claudia; Richichi, Cristina; Lupia, Michela; Corleone, Giacomo; Hong, Sung-Pil; Colombo, Piergiuseppe; Pollo, Bianca; Fornasari, Lorenzo; Pruneri, Giancarlo; Magnani, Luca; Cavallaro, Ugo; Chiocca, Susanna; Minucci, Saverio; Pelicci, Giuliana; Bonaldi, Tiziana

    2018-05-04

    Histone post-translational modifications (PTMs) generate a complex combinatorial code that regulates gene expression and nuclear functions, and whose deregulation has been documented in different types of cancers. Therefore, the availability of relevant culture models that can be manipulated and that retain the epigenetic features of the tissue of origin is absolutely crucial for studying the epigenetic mechanisms underlying cancer and testing epigenetic drugs. In this study, we took advantage of quantitative mass spectrometry to comprehensively profile histone PTMs in patient tumor tissues, primary cultures and cell lines from three representative tumor models, breast cancer, glioblastoma and ovarian cancer, revealing an extensive and systematic rewiring of histone marks in cell culture conditions, which includes a decrease of H3K27me2/me3, H3K79me1/me2 and H3K9ac/K14ac, and an increase of H3K36me1/me2. While some changes occur in short-term primary cultures, most of them are instead time-dependent and appear only in long-term cultures. Remarkably, such changes mostly revert in cell line- and primary cell-derived in vivo xenograft models. Taken together, these results support the use of xenografts as the most representative models of in vivo epigenetic processes, suggesting caution when using cultured cells, in particular cell lines and long-term primary cultures, for epigenetic investigations.

  11. Pathogenic adaptation of intracellular bacteria by rewiring a cis-regulatory input function.

    Science.gov (United States)

    Osborne, Suzanne E; Walthers, Don; Tomljenovic, Ana M; Mulder, David T; Silphaduang, Uma; Duong, Nancy; Lowden, Michael J; Wickham, Mark E; Waller, Ross F; Kenney, Linda J; Coombes, Brian K

    2009-03-10

    The acquisition of DNA by horizontal gene transfer enables bacteria to adapt to previously unexploited ecological niches. Although horizontal gene transfer and mutation of protein-coding sequences are well-recognized forms of pathogen evolution, the evolutionary significance of cis-regulatory mutations in creating phenotypic diversity through altered transcriptional outputs is not known. We show the significance of regulatory mutation for pathogen evolution by mapping and then rewiring a cis-regulatory module controlling a gene required for murine typhoid. Acquisition of a binding site for the Salmonella pathogenicity island-2 regulator, SsrB, enabled the srfN gene, ancestral to the Salmonella genus, to play a role in pathoadaptation of S. typhimurium to a host animal. We identified the evolved cis-regulatory module and quantified the fitness gain that this regulatory output accrues for the bacterium using competitive infections of host animals. Our findings highlight a mechanism of pathogen evolution involving regulatory mutation that is selected because of the fitness advantage the new regulatory output provides the incipient clones.

  12. Breast Cancer Chemoprevention: A Network Meta-Analysis of Randomized Controlled Trials.

    Science.gov (United States)

    Mocellin, Simone; Pilati, Pierluigi; Briarava, Marta; Nitti, Donato

    2016-02-01

    Several agents have been advocated for breast cancer primary prevention. However, few of them appear effective, the associated severe adverse effects limiting their uptake. We performed a comprehensive search for randomized controlled trials (RCTs) reporting on the ability of chemoprevention agents (CPAs) to reduce the incidence of primary breast carcinoma. Using network meta-analysis, we ranked CPAs based simultaneously on efficacy and acceptability (an inverse measure of toxicity). All statistical tests were two-sided. We found 48 eligible RCTs, enrolling 271 161 women randomly assigned to receive either placebo or one of 21 CPAs. Aromatase inhibitors (anastrozole and exemestane, considered a single CPA class because of the lack of between-study heterogeneity; relative risk [RR] = 0.468, 95% confidence interval [CI] = 0.346 to 0.634), arzoxifene (RR = 0.415, 95% CI = 0.253 to 0.682), lasofoxifene (RR = 0.208, 95% CI = 0.079 to 0.544), raloxifene (RR = 0.572, 95% CI = 0.372 to 0.881), tamoxifen (RR = 0.708, 95% CI = 0.595 to 0.842), and tibolone (RR = 0.317, 95% CI = 0.127 to 0.792) were statistically significantly associated with a therapeutic effect, which was restricted to estrogen receptor-positive tumors of postmenopausal women (except for tamoxifen, which is active also during premenopause). Network meta-analysis ranking showed that the new selective estrogen receptor modulators (SERMs) arzoxifene, lasofoxifene, and raloxifene have the best benefit-risk ratio. Aromatase inhibitors and tamoxifen ranked second and third, respectively. These results provide physicians and health care regulatory agencies with RCT-based evidence on efficacy and acceptability of currently available breast cancer CPAs; at the same time, we pinpoint how much work still remains to be done before pharmacological primary prevention becomes a routine option to reduce the burden of this disease. © The Author 2015. Published by Oxford University Press. All rights reserved. For

  13. Structure-Function Network Mapping and Its Assessment via Persistent Homology

    Science.gov (United States)

    2017-01-01

    Understanding the relationship between brain structure and function is a fundamental problem in network neuroscience. This work deals with the general method of structure-function mapping at the whole-brain level. We formulate the problem as a topological mapping of structure-function connectivity via matrix function, and find a stable solution by exploiting a regularization procedure to cope with large matrices. We introduce a novel measure of network similarity based on persistent homology for assessing the quality of the network mapping, which enables a detailed comparison of network topological changes across all possible thresholds, rather than just at a single, arbitrary threshold that may not be optimal. We demonstrate that our approach can uncover the direct and indirect structural paths for predicting functional connectivity, and our network similarity measure outperforms other currently available methods. We systematically validate our approach with (1) a comparison of regularized vs. non-regularized procedures, (2) a null model of the degree-preserving random rewired structural matrix, (3) different network types (binary vs. weighted matrices), and (4) different brain parcellation schemes (low vs. high resolutions). Finally, we evaluate the scalability of our method with relatively large matrices (2514x2514) of structural and functional connectivity obtained from 12 healthy human subjects measured non-invasively while at rest. Our results reveal a nonlinear structure-function relationship, suggesting that the resting-state functional connectivity depends on direct structural connections, as well as relatively parsimonious indirect connections via polysynaptic pathways. PMID:28046127

  14. Randomness in the network inhibits cooperation based on the bounded rational collective altruistic decision

    International Nuclear Information System (INIS)

    Ohdaira, Tetsushi

    2014-01-01

    Previous studies discussing cooperation employ the best decision that every player knows all information regarding the payoff matrix and selects the strategy of the highest payoff. Therefore, they do not discuss cooperation based on the altruistic decision with limited information (bounded rational altruistic decision). In addition, they do not cover the case where every player can submit his/her strategy several times in a match of the game. This paper is based on Ohdaira's reconsideration of the bounded rational altruistic decision, and also employs the framework of the prisoner's dilemma game (PDG) with sequential strategy. The distinction between this study and the Ohdaira's reconsideration is that the former covers the model of multiple groups, but the latter deals with the model of only two groups. Ohdaira's reconsideration shows that the bounded rational altruistic decision facilitates much more cooperation in the PDG with sequential strategy than Ohdaira and Terano's bounded rational second-best decision does. However, the detail of cooperation of multiple groups based on the bounded rational altruistic decision has not been resolved yet. This study, therefore, shows how randomness in the network composed of multiple groups affects the increase of the average frequency of mutual cooperation (cooperation between groups) based on the bounded rational altruistic decision of multiple groups. We also discuss the results of the model in comparison with related studies which employ the best decision. (paper)

  15. Randomness in the network inhibits cooperation based on the bounded rational collective altruistic decision

    Science.gov (United States)

    Ohdaira, Tetsushi

    2014-07-01

    Previous studies discussing cooperation employ the best decision that every player knows all information regarding the payoff matrix and selects the strategy of the highest payoff. Therefore, they do not discuss cooperation based on the altruistic decision with limited information (bounded rational altruistic decision). In addition, they do not cover the case where every player can submit his/her strategy several times in a match of the game. This paper is based on Ohdaira's reconsideration of the bounded rational altruistic decision, and also employs the framework of the prisoner's dilemma game (PDG) with sequential strategy. The distinction between this study and the Ohdaira's reconsideration is that the former covers the model of multiple groups, but the latter deals with the model of only two groups. Ohdaira's reconsideration shows that the bounded rational altruistic decision facilitates much more cooperation in the PDG with sequential strategy than Ohdaira and Terano's bounded rational second-best decision does. However, the detail of cooperation of multiple groups based on the bounded rational altruistic decision has not been resolved yet. This study, therefore, shows how randomness in the network composed of multiple groups affects the increase of the average frequency of mutual cooperation (cooperation between groups) based on the bounded rational altruistic decision of multiple groups. We also discuss the results of the model in comparison with related studies which employ the best decision.

  16. Defining Higher-Order Turbulent Moment Closures with an Artificial Neural Network and Random Forest

    Science.gov (United States)

    McGibbon, J.; Bretherton, C. S.

    2017-12-01

    Unresolved turbulent advection and clouds must be parameterized in atmospheric models. Modern higher-order closure schemes depend on analytic moment closure assumptions that diagnose higher-order moments in terms of lower-order ones. These are then tested against Large-Eddy Simulation (LES) higher-order moment relations. However, these relations may not be neatly analytic in nature. Rather than rely on an analytic higher-order moment closure, can we use machine learning on LES data itself to define a higher-order moment closure?We assess the ability of a deep artificial neural network (NN) and random forest (RF) to perform this task using a set of observationally-based LES runs from the MAGIC field campaign. By training on a subset of 12 simulations and testing on remaining simulations, we avoid over-fitting the training data.Performance of the NN and RF will be assessed and compared to the Analytic Double Gaussian 1 (ADG1) closure assumed by Cloudy Layers Unified By Binormals (CLUBB), a higher-order turbulence closure currently used in the Community Atmosphere Model (CAM). We will show that the RF outperforms the NN and the ADG1 closure for the MAGIC cases within this diagnostic framework. Progress and challenges in using a diagnostic machine learning closure within a prognostic cloud and turbulence parameterization will also be discussed.

  17. A model of gene expression based on random dynamical systems reveals modularity properties of gene regulatory networks.

    Science.gov (United States)

    Antoneli, Fernando; Ferreira, Renata C; Briones, Marcelo R S

    2016-06-01

    Here we propose a new approach to modeling gene expression based on the theory of random dynamical systems (RDS) that provides a general coupling prescription between the nodes of any given regulatory network given the dynamics of each node is modeled by a RDS. The main virtues of this approach are the following: (i) it provides a natural way to obtain arbitrarily large networks by coupling together simple basic pieces, thus revealing the modularity of regulatory networks; (ii) the assumptions about the stochastic processes used in the modeling are fairly general, in the sense that the only requirement is stationarity; (iii) there is a well developed mathematical theory, which is a blend of smooth dynamical systems theory, ergodic theory and stochastic analysis that allows one to extract relevant dynamical and statistical information without solving the system; (iv) one may obtain the classical rate equations form the corresponding stochastic version by averaging the dynamic random variables (small noise limit). It is important to emphasize that unlike the deterministic case, where coupling two equations is a trivial matter, coupling two RDS is non-trivial, specially in our case, where the coupling is performed between a state variable of one gene and the switching stochastic process of another gene and, hence, it is not a priori true that the resulting coupled system will satisfy the definition of a random dynamical system. We shall provide the necessary arguments that ensure that our coupling prescription does indeed furnish a coupled regulatory network of random dynamical systems. Finally, the fact that classical rate equations are the small noise limit of our stochastic model ensures that any validation or prediction made on the basis of the classical theory is also a validation or prediction of our model. We illustrate our framework with some simple examples of single-gene system and network motifs. Copyright © 2016 Elsevier Inc. All rights reserved.

  18. Tuning of an optimal fuzzy PID controller with stochastic algorithms for networked control systems with random time delay.

    Science.gov (United States)

    Pan, Indranil; Das, Saptarshi; Gupta, Amitava

    2011-01-01

    An optimal PID and an optimal fuzzy PID have been tuned by minimizing the Integral of Time multiplied Absolute Error (ITAE) and squared controller output for a networked control system (NCS). The tuning is attempted for a higher order and a time delay system using two stochastic algorithms viz. the Genetic Algorithm (GA) and two variants of Particle Swarm Optimization (PSO) and the closed loop performances are compared. The paper shows that random variation in network delay can be handled efficiently with fuzzy logic based PID controllers over conventional PID controllers. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

  19. Transport properties of field effect transistors with randomly networked single walled carbon nanotubes grown by plasma enhanced chemical vapour deposition

    International Nuclear Information System (INIS)

    Kim, Un Jeong; Park, Wanjun

    2009-01-01

    The transport properties of randomly networked single walled carbon nanotube (SWNT) transistors with different channel lengths of L c = 2-10 μm were investigated. Randomly networked SWNTs were directly grown for the two different densities of ρ ∼ 25 μm -2 and ρ ∼ 50 μm -2 by water plasma enhanced chemical vapour deposition. The field effect transport is governed mainly by formation of the current paths that is related to the nanotube density. On the other hand, the off-state conductivity deviates from linear dependence for both nanotube density and channel length. The field effect mobility of holes is estimated as 4-13 cm 2 V -1 s -1 for the nanotube transistors based on the simple MOS theory. The mobility is increased for the higher density without meaningful dependence on the channel lengths.

  20. Analyzing self-similar and fractal properties of the C. elegans neural network.

    Directory of Open Access Journals (Sweden)

    Tyler M Reese

    Full Text Available The brain is one of the most studied and highly complex systems in the biological world. While much research has concentrated on studying the brain directly, our focus is the structure of the brain itself: at its core an interconnected network of nodes (neurons. A better understanding of the structural connectivity of the brain should elucidate some of its functional properties. In this paper we analyze the connectome of the nematode Caenorhabditis elegans. Consisting of only 302 neurons, it is one of the better-understood neural networks. Using a Laplacian Matrix of the 279-neuron "giant component" of the network, we use an eigenvalue counting function to look for fractal-like self similarity. This matrix representation is also used to plot visualizations of the neural network in eigenfunction coordinates. Small-world properties of the system are examined, including average path length and clustering coefficient. We test for localization of eigenfunctions, using graph energy and spacial variance on these functions. To better understand results, all calculations are also performed on random networks, branching trees, and known fractals, as well as fractals which have been "rewired" to have small-world properties. We propose algorithms for generating Laplacian matrices of each of these graphs.

  1. Decentralized formation of random regular graphs for robust multi-agent networks

    KAUST Repository

    Yazicioglu, A. Yasin; Egerstedt, Magnus; Shamma, Jeff S.

    2014-01-01

    systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme

  2. Bayesian exponential random graph modeling of whole-brain structural networks across lifespan

    OpenAIRE

    Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim

    2016-01-01

    Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as in studies on neurodevelopment or brain diseases. Furthermore, descriptive neural network analyses lack an appropriate generic null model and a unifying framework. These issues may be solved with an...

  3. De-identification of clinical notes via recurrent neural network and conditional random field.

    Science.gov (United States)

    Liu, Zengjian; Tang, Buzhou; Wang, Xiaolong; Chen, Qingcai

    2017-11-01

    De-identification, identifying information from data, such as protected health information (PHI) present in clinical data, is a critical step to enable data to be shared or published. The 2016 Centers of Excellence in Genomic Science (CEGS) Neuropsychiatric Genome-scale and RDOC Individualized Domains (N-GRID) clinical natural language processing (NLP) challenge contains a de-identification track in de-identifying electronic medical records (EMRs) (i.e., track 1). The challenge organizers provide 1000 annotated mental health records for this track, 600 out of which are used as a training set and 400 as a test set. We develop a hybrid system for the de-identification task on the training set. Firstly, four individual subsystems, that is, a subsystem based on bidirectional LSTM (long-short term memory, a variant of recurrent neural network), a subsystem-based on bidirectional LSTM with features, a subsystem based on conditional random field (CRF) and a rule-based subsystem, are used to identify PHI instances. Then, an ensemble learning-based classifiers is deployed to combine all PHI instances predicted by above three machine learning-based subsystems. Finally, the results of the ensemble learning-based classifier and the rule-based subsystem are merged together. Experiments conducted on the official test set show that our system achieves the highest micro F1-scores of 93.07%, 91.43% and 95.23% under the "token", "strict" and "binary token" criteria respectively, ranking first in the 2016 CEGS N-GRID NLP challenge. In addition, on the dataset of 2014 i2b2 NLP challenge, our system achieves the highest micro F1-scores of 96.98%, 95.11% and 98.28% under the "token", "strict" and "binary token" criteria respectively, outperforming other state-of-the-art systems. All these experiments prove the effectiveness of our proposed method. Copyright © 2017. Published by Elsevier Inc.

  4. Bayesian exponential random graph modeling of whole-brain structural networks across lifespan

    NARCIS (Netherlands)

    Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim

    2016-01-01

    Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as

  5. Targeted drugs for pulmonary arterial hypertension: a network meta-analysis of 32 randomized clinical trials

    Directory of Open Access Journals (Sweden)

    Gao XF

    2017-05-01

    Full Text Available Xiao-Fei Gao,1 Jun-Jie Zhang,1,2 Xiao-Min Jiang,1 Zhen Ge,1,2 Zhi-Mei Wang,1 Bing Li,1 Wen-Xing Mao,1 Shao-Liang Chen1,2 1Department of Cardiology, Nanjing First Hospital, Nanjing Medical University, Nanjing, 2Department of Cardiology, Nanjing Heart Center, Nanjing, People’s Republic of China Background: Pulmonary arterial hypertension (PAH is a devastating disease and ultimately leads to right heart failure and premature death. A total of four classical targeted drugs, prostanoids, endothelin receptor antagonists (ERAs, phosphodiesterase 5 inhibitors (PDE-5Is, and soluble guanylate cyclase stimulator (sGCS, have been proved to improve exercise capacity and hemodynamics compared to placebo; however, direct head-to-head comparisons of these drugs are lacking. This network meta-analysis was conducted to comprehensively compare the efficacy of these targeted drugs for PAH.Methods: Medline, the Cochrane Library, and other Internet sources were searched for randomized clinical trials exploring the efficacy of targeted drugs for patients with PAH. The primary effective end point of this network meta-analysis was a 6-minute walk distance (6MWD.Results: Thirty-two eligible trials including 6,758 patients were identified. There was a statistically significant improvement in 6MWD, mean pulmonary arterial pressure, pulmonary vascular resistance, and clinical worsening events associated with each of the four targeted drugs compared with placebo. Combination therapy improved 6MWD by 20.94 m (95% confidence interval [CI]: 6.94, 34.94; P=0.003 vs prostanoids, and 16.94 m (95% CI: 4.41, 29.47; P=0.008 vs ERAs. PDE-5Is improved 6MWD by 17.28 m (95% CI: 1.91, 32.65; P=0.028 vs prostanoids, with a similar result with combination therapy. In addition, combination therapy reduced mean pulmonary artery pressure by 3.97 mmHg (95% CI: -6.06, -1.88; P<0.001 vs prostanoids, 8.24 mmHg (95% CI: -10.71, -5.76; P<0.001 vs ERAs, 3.38 mmHg (95% CI: -6.30, -0.47; P=0.023 vs

  6. Bursting endemic bubbles in an adaptive network

    Science.gov (United States)

    Sherborne, N.; Blyuss, K. B.; Kiss, I. Z.

    2018-04-01

    The spread of an infectious disease is known to change people's behavior, which in turn affects the spread of disease. Adaptive network models that account for both epidemic and behavioral change have found oscillations, but in an extremely narrow region of the parameter space, which contrasts with intuition and available data. In this paper we propose a simple susceptible-infected-susceptible epidemic model on an adaptive network with time-delayed rewiring, and show that oscillatory solutions are now present in a wide region of the parameter space. Altering the transmission or rewiring rates reveals the presence of an endemic bubble—an enclosed region of the parameter space where oscillations are observed.

  7. ADNP-CSMA Random Multiple Access protocol application with the function of monitoring in Ad Hoc network

    Directory of Open Access Journals (Sweden)

    Zhan Gang

    2016-01-01

    Full Text Available In Ad Hoc networks,the net work of mobile nodes exchange information with their wireless transceiver equipment,the network throughput is in increased,compared to other such multiple hops network.Moreover along with the rapid development of modern information,communication business also will be increase.However,the access and adaptive of previous CSMA protocol are insufficient.According to these properties,this paper presents a kind of adaptive dual clock with monitoring function P-CSMA random multiple access protocol(ADNP-CSMA,and discusses two kinds of P-CSMA.ACK with monitoring function is introduced to maintain the stability of the whole system,and the introduction of dual clock mechanism reduces the channel of idle period.It calculate the system throughput expression through the method of average period,and the simulation results show that the system is constant in the case of high load throughput.

  8. The cytotoxic type 3 secretion system 1 of Vibrio rewires host gene expression to subvert cell death and activate cell survival pathways.

    Science.gov (United States)

    De Nisco, Nicole J; Kanchwala, Mohammed; Li, Peng; Fernandez, Jessie; Xing, Chao; Orth, Kim

    2017-05-16

    Bacterial effectors potently manipulate host signaling pathways. The marine bacterium Vibrio parahaemolyticus ( V. para ) delivers effectors into host cells through two type 3 secretion systems (T3SSs). T3SS1 is vital for V. para survival in the environment, whereas T3SS2 causes acute gastroenteritis in human hosts. Although the natural host is undefined, T3SS1 effectors attack highly conserved cellular processes and pathways to orchestrate nonapoptotic cell death. To understand how the concerted action of T3SS1 effectors globally affects host cell signaling, we compared gene expression changes over time in primary fibroblasts infected with V. para that have a functional T3SS1 (T3SS1 + ) to those in cells infected with V. para lacking T3SS1 (T3SS1 - ). Overall, the host transcriptional response to both T3SS1 + and T3SS1 - V. para was rapid, robust, and temporally dynamic. T3SS1 rewired host gene expression by specifically altering the expression of 398 genes. Although T3SS1 effectors targeted host cells at the posttranslational level to cause cytotoxicity, V. para T3SS1 also precipitated a host transcriptional response that initially activated cell survival and repressed cell death networks. The increased expression of several key prosurvival transcripts mediated by T3SS1 depended on a host signaling pathway that is silenced posttranslationally later in infection. Together, our analysis reveals a complex interplay between the roles of T3SS1 as both a transcriptional and posttranslational manipulator of host cell signaling. Copyright © 2017, American Association for the Advancement of Science.

  9. A high throughput amenable Arabidopsis-P. aeruginosa system reveals a rewired regulatory module and the utility to identify potent anti-infectives.

    Directory of Open Access Journals (Sweden)

    Suresh Gopalan

    2011-01-01

    Full Text Available We previously demonstrated that in a metasystem consisting of Arabidopsis seedlings growing in liquid medium (in 96 well plates even microbes considered to be innocuous such as laboratory strains of E. coli and B. subtilis can cause potent damage to the host. We further posited that such environment-induced adaptations are brought about by 'system status changes' (rewiring of pre-existing cellular signaling networks and components of the host and the microbe, and that prolongation of such a situation could lead to the emergence of pathogenic states in real-life. Here, using this infection model, we show that the master regulator GacA of the human opportunistic pathogen P. aeruginosa (strain PA14 is dispensable for pathogenesis, as evidenced by three independent read-outs. The gene expression profile of the host after infection with wild type PA14 or the gacA mutant are also identical. GacA normally acts upstream of the quorum sensing regulatory circuit (that includes the regulator LasR that controls a subset of virulence factors. Double mutants in gacA and lasR behave similar to the lasR mutant, as seen by abrogation of a characteristic cell type specific host cell damage caused by PA14 or the gacA mutant. This indicates that a previously unrecognized regulatory mechanism is operative under these conditions upstream of LasR. In addition, the detrimental effect of PA14 on Arabidopsis seedlings is resistant to high concentrations of the aminoglycoside antibiotic gentamicin. These data suggest that the Arabidopsis seedling infection system could be used to identify anti-infectives with potentially novel modes of action.

  10. A high throughput amenable Arabidopsis-P. aeruginosa system reveals a rewired regulatory module and the utility to identify potent anti-infectives.

    Science.gov (United States)

    Gopalan, Suresh; Ausubel, Frederick M

    2011-01-21

    We previously demonstrated that in a metasystem consisting of Arabidopsis seedlings growing in liquid medium (in 96 well plates) even microbes considered to be innocuous such as laboratory strains of E. coli and B. subtilis can cause potent damage to the host. We further posited that such environment-induced adaptations are brought about by 'system status changes' (rewiring of pre-existing cellular signaling networks and components) of the host and the microbe, and that prolongation of such a situation could lead to the emergence of pathogenic states in real-life. Here, using this infection model, we show that the master regulator GacA of the human opportunistic pathogen P. aeruginosa (strain PA14) is dispensable for pathogenesis, as evidenced by three independent read-outs. The gene expression profile of the host after infection with wild type PA14 or the gacA mutant are also identical. GacA normally acts upstream of the quorum sensing regulatory circuit (that includes the regulator LasR) that controls a subset of virulence factors. Double mutants in gacA and lasR behave similar to the lasR mutant, as seen by abrogation of a characteristic cell type specific host cell damage caused by PA14 or the gacA mutant. This indicates that a previously unrecognized regulatory mechanism is operative under these conditions upstream of LasR. In addition, the detrimental effect of PA14 on Arabidopsis seedlings is resistant to high concentrations of the aminoglycoside antibiotic gentamicin. These data suggest that the Arabidopsis seedling infection system could be used to identify anti-infectives with potentially novel modes of action.

  11. Differential regulation of polarized synaptic vesicle trafficking and synapse stability in neural circuit rewiring in Caenorhabditis elegans.

    Directory of Open Access Journals (Sweden)

    Naina Kurup

    2017-06-01

    Full Text Available Neural circuits are dynamic, with activity-dependent changes in synapse density and connectivity peaking during different phases of animal development. In C. elegans, young larvae form mature motor circuits through a dramatic switch in GABAergic neuron connectivity, by concomitant elimination of existing synapses and formation of new synapses that are maintained throughout adulthood. We have previously shown that an increase in microtubule dynamics during motor circuit rewiring facilitates new synapse formation. Here, we further investigate cellular control of circuit rewiring through the analysis of mutants obtained in a forward genetic screen. Using live imaging, we characterize novel mutations that alter cargo binding in the dynein motor complex and enhance anterograde synaptic vesicle movement during remodeling, providing in vivo evidence for the tug-of-war between kinesin and dynein in fast axonal transport. We also find that a casein kinase homolog, TTBK-3, inhibits stabilization of nascent synapses in their new locations, a previously unexplored facet of structural plasticity of synapses. Our study delineates temporally distinct signaling pathways that are required for effective neural circuit refinement.

  12. The Kernel Mixture Network: A Nonparametric Method for Conditional Density Estimation of Continuous Random Variables

    OpenAIRE

    Ambrogioni, Luca; Güçlü, Umut; van Gerven, Marcel A. J.; Maris, Eric

    2017-01-01

    This paper introduces the kernel mixture network, a new method for nonparametric estimation of conditional probability densities using neural networks. We model arbitrarily complex conditional densities as linear combinations of a family of kernel functions centered at a subset of training points. The weights are determined by the outer layer of a deep neural network, trained by minimizing the negative log likelihood. This generalizes the popular quantized softmax approach, which can be seen ...

  13. Rewiring a secondary metabolite pathway towards itaconic acid production in Aspergillus niger.

    Science.gov (United States)

    Hossain, Abeer H; Li, An; Brickwedde, Anja; Wilms, Lars; Caspers, Martien; Overkamp, Karin; Punt, Peter J

    2016-07-28

    The industrially relevant filamentous fungus Aspergillus niger is widely used in industry for its secretion capabilities of enzymes and organic acids. Biotechnologically produced organic acids promise to be an attractive alternative for the chemical industry to replace petrochemicals. Itaconic acid (IA) has been identified as one of the top twelve building block chemicals which have high potential to be produced by biotechnological means. The IA biosynthesis cluster (cadA, mttA and mfsA) has been elucidated in its natural producer Aspergillus terreus and transferred to A. niger to enable IA production. Here we report the rewiring of a secondary metabolite pathway towards further improved IA production through the overexpression of a putative cytosolic citrate synthase citB in a A. niger strain carrying the IA biosynthesis cluster. We have previously shown that expression of cadA from A. terreus results in itaconic acid production in A. niger AB1.13, albeit at low levels. This low-level production is boosted fivefold by the overexpression of mttA and mfsA in itaconic acid producing AB1.13 CAD background strains. Controlled batch cultivations with AB1.13 CAD + MFS + MTT strains showed increased production of itaconic acid compared with AB1.13 CAD strain. Moreover, preliminary RNA-Seq analysis of an itaconic acid producing AB1.13 CAD strain has led to the identification of the putative cytosolic citrate synthase citB which was induced in an IA producing strain. We have overexpressed citB in a AB1.13 CAD + MFS + MTT strain and by doing so hypothesize to have targeted itaconic acid production to the cytosolic compartment. By overexpressing citB in AB1.13 CAD + MFS + MTT strains in controlled batch cultivations we have achieved highly increased titers of up to 26.2 g/L IA with a productivity of 0.35 g/L/h while no CA was produced. Expression of the IA biosynthesis cluster in Aspergillus niger AB1.13 strain enables IA production. Moreover, in the AB1.13 CAD

  14. MATIN: a random network coding based framework for high quality peer-to-peer live video streaming.

    Science.gov (United States)

    Barekatain, Behrang; Khezrimotlagh, Dariush; Aizaini Maarof, Mohd; Ghaeini, Hamid Reza; Salleh, Shaharuddin; Quintana, Alfonso Ariza; Akbari, Behzad; Cabrera, Alicia Triviño

    2013-01-01

    In recent years, Random Network Coding (RNC) has emerged as a promising solution for efficient Peer-to-Peer (P2P) video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of the network. However, high transmission overhead arising from sending large coefficients vector as header has been the most important challenge of the RNC. Moreover, due to employing the Gauss-Jordan elimination method, considerable computational complexity can be imposed on peers in decoding the encoded blocks and checking linear dependency among the coefficients vectors. In order to address these challenges, this study introduces MATIN which is a random network coding based framework for efficient P2P video streaming. The MATIN includes a novel coefficients matrix generation method so that there is no linear dependency in the generated coefficients matrix. Using the proposed framework, each peer encapsulates one instead of n coefficients entries into the generated encoded packet which results in very low transmission overhead. It is also possible to obtain the inverted coefficients matrix using a bit number of simple arithmetic operations. In this regard, peers sustain very low computational complexities. As a result, the MATIN permits random network coding to be more efficient in P2P video streaming systems. The results obtained from simulation using OMNET++ show that it substantially outperforms the RNC which uses the Gauss-Jordan elimination method by providing better video quality on peers in terms of the four important performance metrics including video distortion, dependency distortion, End-to-End delay and Initial Startup delay.

  15. MATIN: a random network coding based framework for high quality peer-to-peer live video streaming.

    Directory of Open Access Journals (Sweden)

    Behrang Barekatain

    Full Text Available In recent years, Random Network Coding (RNC has emerged as a promising solution for efficient Peer-to-Peer (P2P video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of the network. However, high transmission overhead arising from sending large coefficients vector as header has been the most important challenge of the RNC. Moreover, due to employing the Gauss-Jordan elimination method, considerable computational complexity can be imposed on peers in decoding the encoded blocks and checking linear dependency among the coefficients vectors. In order to address these challenges, this study introduces MATIN which is a random network coding based framework for efficient P2P video streaming. The MATIN includes a novel coefficients matrix generation method so that there is no linear dependency in the generated coefficients matrix. Using the proposed framework, each peer encapsulates one instead of n coefficients entries into the generated encoded packet which results in very low transmission overhead. It is also possible to obtain the inverted coefficients matrix using a bit number of simple arithmetic operations. In this regard, peers sustain very low computational complexities. As a result, the MATIN permits random network coding to be more efficient in P2P video streaming systems. The results obtained from simulation using OMNET++ show that it substantially outperforms the RNC which uses the Gauss-Jordan elimination method by providing better video quality on peers in terms of the four important performance metrics including video distortion, dependency distortion, End-to-End delay and Initial Startup delay.

  16. On first-come first-served versus random service discipline in multiclass closed queueing networks

    NARCIS (Netherlands)

    Buitenhek, R.; van Houtum, Geert-Jan; van Ommeren, Jan C.W.

    1997-01-01

    We consider multiclass closed queueing networks. For these networks, a lot of work has been devoted to characterizing and weakening the conditions under which a product-form solution is obtained for the steady-state distribution. From this work, it is known that, under certain conditions, all

  17. Recent developments in exponential random graph (p*) models for social networks

    NARCIS (Netherlands)

    Robins, Garry; Snijders, Tom; Wang, Peng; Handcock, Mark; Pattison, Philippa

    This article reviews new specifications for exponential random graph models proposed by Snijders et al. [Snijders, T.A.B., Pattison, P., Robins, G.L., Handcock, M., 2006. New specifications for exponential random graph models. Sociological Methodology] and demonstrates their improvement over

  18. Enhanced vaccine control of epidemics in adaptive networks

    Science.gov (United States)

    Shaw, Leah B.; Schwartz, Ira B.

    2010-04-01

    We study vaccine control for disease spread on an adaptive network modeling disease avoidance behavior. Control is implemented by adding Poisson-distributed vaccination of susceptibles. We show that vaccine control is much more effective in adaptive networks than in static networks due to feedback interaction between the adaptive network rewiring and the vaccine application. When compared to extinction rates in static social networks, we find that the amount of vaccine resources required to sustain similar rates of extinction are as much as two orders of magnitude lower in adaptive networks.

  19. Efficient community-based control strategies in adaptive networks

    International Nuclear Information System (INIS)

    Yang Hui; Tang Ming; Zhang Haifeng

    2012-01-01

    Most studies on adaptive networks concentrate on the properties of steady state, but neglect transient dynamics. In this study, we pay attention to the emergence of community structure in the transient process and the effects of community-based control strategies on epidemic spreading. First, by normalizing the modularity, we investigate the evolution of community structure during the transient process, and find that a strong community structure is induced by the rewiring mechanism in the early stage of epidemic dynamics, which, remarkably, delays the outbreak of disease. We then study the effects of control strategies started at different stages on the prevalence. Both immunization and quarantine strategies indicate that it is not ‘the earlier, the better’ for the implementation of control measures. And the optimal control effect is obtained if control measures can be efficiently implemented in the period of a strong community structure. For the immunization strategy, immunizing the susceptible nodes on susceptible–infected links and immunizing susceptible nodes randomly have similar control effects. However, for the quarantine strategy, quarantining the infected nodes on susceptible–infected links can yield a far better result than quarantining infected nodes randomly. More significantly, the community-based quarantine strategy performs better than the community-based immunization strategy. This study may shed new light on the forecast and the prevention of epidemics among humans. (paper)

  20. Identifying a system of predominant negative symptoms: Network analysis of three randomized clinical trials.

    Science.gov (United States)

    Levine, Stephen Z; Leucht, Stefan

    2016-12-01

    Reasons for the recent mixed success of research into negative symptoms may be informed by conceptualizing negative symptoms as a system that is identifiable from network analysis. We aimed to identify: (I) negative symptom systems; (I) central negative symptoms within each system; and (III) differences between the systems, based on network analysis of negative symptoms for baseline, endpoint and change. Patients with chronic schizophrenia and predominant negative symptoms participated in three clinical trials that compared placebo and amisulpride to 60days (n=487). Networks analyses were computed from the Scale for the Assessment of Negative Symptoms (SANS) scores for baseline and endpoint for severity, and estimated change based on mixed models. Central symptoms to each network were identified. The networks were contrasted for connectivity with permutation tests. Network analysis showed that the baseline and endpoint symptom severity systems formed symptom groups of Affect, Poor responsiveness, Lack of interest, and Apathy-inattentiveness. The baseline and endpoint networks did not significantly differ in terms of connectivity, but both significantly (Psymptom group split into three other groups. The most central symptoms were Decreased Spontaneous Movements at baseline and endpoint, and Poverty of Speech for estimated change. Results provide preliminary evidence for: (I) a replicable negative symptom severity system; and (II) symptoms with high centrality (e.g., Decreased Spontaneous Movement), that may be future treatment targets following replication to ensure the curent results generalize to other samples. Copyright © 2016 Elsevier B.V. All rights reserved.

  1. Consensus formation on coevolving networks: groups' formation and structure

    International Nuclear Information System (INIS)

    Kozma, Balazs; Barrat, Alain

    2008-01-01

    We study the effect of adaptivity on a social model of opinion dynamics and consensus formation. We analyse how the adaptivity of the network of contacts between agents to the underlying social dynamics affects the size and topological properties of groups and the convergence time to the stable final state. We find that, while on static networks these properties are determined by percolation phenomena, on adaptive networks the rewiring process leads to different behaviors: adaptive rewiring fosters group formation by enhancing communication between agents of similar opinion, though it also makes possible the division of clusters. We show how the convergence time is determined by the characteristic time of link rearrangement. We finally investigate how the adaptivity yields nontrivial correlations between the internal topology and the size of the groups of agreeing agents

  2. "De-Randomizing" Congestion Losses to Improve TCP Performance over Wired-Wireless Networks

    National Research Council Canada - National Science Library

    Biaz, Saad; Vaidya, Nitin H

    2004-01-01

    .... This paper proposes a simple biased queue management scheme that "de-randomizes" congestion losses and enables a TCP receiver to diagnose accurately the cause of a loss and inform the TCP sender to react appropriately...

  3. Robust Network Architecture Against Random Threats in WMD Environments: Theoretical Limits and Recovery Strategies

    Science.gov (United States)

    2017-08-01

    platform for agent- based electric power and communication simulation built from commercial off-the-shelf components,” Power Systems, IEEE Transactions on... communication recovery. With the increasing attention on the national infrastructure, such as civilian and military telecommunication networks, power...grids, and transportation systems, these large-scale, inter-connected networks are vulnerable to WMD attacks. Under such attacks on communication

  4. Uplink Interference Analysis for Two-tier Cellular Networks with Diverse Users under Random Spatial Patterns

    OpenAIRE

    Bao, Wei; Liang, Ben

    2013-01-01

    Multi-tier architecture improves the spatial reuse of radio spectrum in cellular networks, but it introduces complicated heterogeneity in the spatial distribution of transmitters, which brings new challenges in interference analysis. In this work, we present a stochastic geometric model to evaluate the uplink interference in a two-tier network considering multi-type users and base stations. Each type of tier-1 users and tier-2 base stations are modeled as independent homogeneous Poisson point...

  5. Bidirectional Long Short-Term Memory Network with a Conditional Random Field Layer for Uyghur Part-Of-Speech Tagging

    Directory of Open Access Journals (Sweden)

    Maihemuti Maimaiti

    2017-11-01

    Full Text Available Uyghur is an agglutinative and a morphologically rich language; natural language processing tasks in Uyghur can be a challenge. Word morphology is important in Uyghur part-of-speech (POS tagging. However, POS tagging performance suffers from error propagation of morphological analyzers. To address this problem, we propose a few models for POS tagging: conditional random fields (CRF, long short-term memory (LSTM, bidirectional LSTM networks (BI-LSTM, LSTM networks with a CRF layer, and BI-LSTM networks with a CRF layer. These models do not depend on stemming and word disambiguation for Uyghur and combine hand-crafted features with neural network models. State-of-the-art performance on Uyghur POS tagging is achieved on test data sets using the proposed approach: 98.41% accuracy on 15 labels and 95.74% accuracy on 64 labels, which are 2.71% and 4% improvements, respectively, over the CRF model results. Using engineered features, our model achieves further improvements of 0.2% (15 labels and 0.48% (64 labels. The results indicate that the proposed method could be an effective approach for POS tagging in other morphologically rich languages.

  6. Anisotropic generalization of Stinchcombe's solution for the conductivity of random resistor networks on a Bethe lattice

    Energy Technology Data Exchange (ETDEWEB)

    Semeriyanov, F; Saphiannikova, M; Heinrich, G [Leibniz Institute of Polymer Research Dresden, Hohe str. 6, 01069 Dresden (Germany)], E-mail: fsemeriyanov@yahoo.de

    2009-11-20

    Our study is based on the work of Stinchcombe (1974 J. Phys. C: Solid State Phys. 7 179) and is devoted to the calculations of average conductivity of random resistor networks placed on an anisotropic Bethe lattice. The structure of the Bethe lattice is assumed to represent the normal directions of the regular lattice. We calculate the anisotropic conductivity as an expansion in powers of the inverse coordination number of the Bethe lattice. The expansion terms retained deliver an accurate approximation of the conductivity at resistor concentrations above the percolation threshold. We make a comparison of our analytical results with those of Bernasconi (1974 Phys. Rev. B 9 4575) for the regular lattice.

  7. Graph Theoretical Analysis of Developmental Patterns of the White Matter Network

    Directory of Open Access Journals (Sweden)

    Zhang eChen

    2013-11-01

    Full Text Available Understanding the development of human brain organization is critical for gaining insight into how the enhancement of cognitive processes is related to the fine-tuning of the brain network. However, the developmental trajectory of the large-scale white matter (WM network is not fully understood. Here, using graph theory, we examine developmental changes in the organization of WM networks in 180 typically-developing participants. WM networks were constructed using whole brain tractography and 78 cortical regions of interest were extracted from each participant. The subjects were first divided into 5 equal sample size (n=36 groups (early childhood: 6.0-9.7 years; late childhood: 9.8-12.7 years; adolescence: 12.9-17.5 years; young adult: 17.6-21.8 years; adult: 21.9-29.6 years. Most prominent changes in the topological properties of developing brain networks occur at late childhood and adolescence. During late childhood period, the structural brain network showed significant increase in the global efficiency but decrease in modularity, suggesting a shift of topological organization toward a more randomized configuration. However, while preserving most topological features, there was a significant increase in the local efficiency at adolescence, suggesting the dynamic process of rewiring and rebalancing brain connections at different growth stages. In addition, several pivotal hubs were identified that are vital for the global coordination of information flow over the whole brain network across all age groups. Significant increases of nodal efficiency were present in several regions such as precuneus at late childhood. Finally, a stable and functionally/anatomically related modular organization was identified throughout the development of the WM network. This study used network analysis to elucidate the topological changes in brain maturation, paving the way for developing novel methods for analyzing disrupted brain connectivity in

  8. Random Walks on Directed Networks: Inference and Respondent-Driven Sampling

    Directory of Open Access Journals (Sweden)

    Malmros Jens

    2016-06-01

    Full Text Available Respondent-driven sampling (RDS is often used to estimate population properties (e.g., sexual risk behavior in hard-to-reach populations. In RDS, already sampled individuals recruit population members to the sample from their social contacts in an efficient snowball-like sampling procedure. By assuming a Markov model for the recruitment of individuals, asymptotically unbiased estimates of population characteristics can be obtained. Current RDS estimation methodology assumes that the social network is undirected, that is, all edges are reciprocal. However, empirical social networks in general also include a substantial number of nonreciprocal edges. In this article, we develop an estimation method for RDS in populations connected by social networks that include reciprocal and nonreciprocal edges. We derive estimators of the selection probabilities of individuals as a function of the number of outgoing edges of sampled individuals. The proposed estimators are evaluated on artificial and empirical networks and are shown to generally perform better than existing estimators. This is the case in particular when the fraction of directed edges in the network is large.

  9. DyNet: visualization and analysis of dynamic molecular interaction networks.

    Science.gov (United States)

    Goenawan, Ivan H; Bryan, Kenneth; Lynn, David J

    2016-09-01

    : The ability to experimentally determine molecular interactions on an almost proteome-wide scale under different conditions is enabling researchers to move from static to dynamic network analysis, uncovering new insights into how interaction networks are physically rewired in response to different stimuli and in disease. Dynamic interaction data presents a special challenge in network biology. Here, we present DyNet, a Cytoscape application that provides a range of functionalities for the visualization, real-time synchronization and analysis of large multi-state dynamic molecular interaction networks enabling users to quickly identify and analyze the most 'rewired' nodes across many network states. DyNet is available at the Cytoscape (3.2+) App Store (http://apps.cytoscape.org/apps/dynet). david.lynn@sahmri.com Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

  10. Epidemic spreading on complex networks with overlapping and non-overlapping community structure

    Science.gov (United States)

    Shang, Jiaxing; Liu, Lianchen; Li, Xin; Xie, Feng; Wu, Cheng

    2015-02-01

    Many real-world networks exhibit community structure where vertices belong to one or more communities. Recent studies show that community structure plays an import role in epidemic spreading. In this paper, we investigate how the extent of overlap among communities affects epidemics. In order to experiment on the characteristic of overlapping communities, we propose a rewiring algorithm that can change the community structure from overlapping to non-overlapping while maintaining the degree distribution of the network. We simulate the Susceptible-Infected-Susceptible (SIS) epidemic process on synthetic scale-free networks and real-world networks by applying our rewiring algorithm. Experiments show that epidemics spread faster on networks with higher level of overlapping communities. Furthermore, overlapping communities' effect interacts with the average degree's effect. Our work further illustrates the important role of overlapping communities in the process of epidemic spreading.

  11. Synchronization in a Random Length Ring Network for SDN-Controlled Optical TDM Switching

    DEFF Research Database (Denmark)

    Kamchevska, Valerija; Cristofori, Valentina; Da Ros, Francesco

    2016-01-01

    . In addition, we propose a novel synchronization algorithm that enables automatic synchronization of software defined networking controlled all-optical TDM switching nodes connected in a ring network. Besides providing synchronization, the algorithm also can facilitate dynamic slot size change and failure......In this paper we focus on optical time division multiplexed (TDM) switching and its main distinguishing characteristics compared with other optical subwavelength switching technologies. We review and discuss in detail the synchronization requirements that allow for proper switching operation...... detection. We experimentally validate the algorithm behavior and achieve correct operation for three different ring lengths. Moreover, we experimentally demonstrate data plane connectivity in a ring network composed of three nodes and show successful wavelength division multiplexing space division...

  12. Susceptible-infected-recovered epidemics in random networks with population awareness

    Science.gov (United States)

    Wu, Qingchu; Chen, Shufang

    2017-10-01

    The influence of epidemic information-based awareness on the spread of infectious diseases on networks cannot be ignored. Within the effective degree modeling framework, we discuss the susceptible-infected-recovered model in complex networks with general awareness and general degree distribution. By performing the linear stability analysis, the conditions of epidemic outbreak can be deduced and the results of the previous research can be further expanded. Results show that the local awareness can suppress significantly the epidemic spreading on complex networks via raising the epidemic threshold and such effects are closely related to the formulation of awareness functions. In addition, our results suggest that the recovered information-based awareness has no effect on the critical condition of epidemic outbreak.

  13. Resistor-network anomalies in the heat transport of random harmonic chains.

    Science.gov (United States)

    Weinberg, Isaac; de Leeuw, Yaron; Kottos, Tsampikos; Cohen, Doron

    2016-06-01

    We consider thermal transport in low-dimensional disordered harmonic networks of coupled masses. Utilizing known results regarding Anderson localization, we derive the actual dependence of the thermal conductance G on the length L of the sample. This is required by nanotechnology implementations because for such networks Fourier's law G∝1/L^{α} with α=1 is violated. In particular we consider "glassy" disorder in the coupling constants and find an anomaly which is related by duality to the Lifshitz-tail regime in the standard Anderson model.

  14. Optimal Detection of a Localized Perturbation in Random Networks of Integrate-and-Fire Neurons

    Science.gov (United States)

    Bernardi, Davide; Lindner, Benjamin

    2017-06-01

    Experimental and theoretical studies suggest that cortical networks are chaotic and coding relies on averages over large populations. However, there is evidence that rats can respond to the short stimulation of a single cortical cell, a theoretically unexplained fact. We study effects of single-cell stimulation on a large recurrent network of integrate-and-fire neurons and propose a simple way to detect the perturbation. Detection rates obtained from simulations and analytical estimates are similar to experimental response rates if the readout is slightly biased towards specific neurons. Near-optimal detection is attained for a broad range of intermediate values of the mean coupling between neurons.

  15. Reply to ''Comment on 'Metal-insulator transition in random superconducting networks' ''

    International Nuclear Information System (INIS)

    Soukoulis, C.M.; Li, Q.; Grest, G.S.

    1990-01-01

    We address the remarks of Dominguez, Lopez, and Simonin [Phys. Rev.B 42, 8665 (1990); preceding paper] on the determination of the normal-to-superconducting (N-S) phase boundary in randomsuperconducting networks. We refute their claims that the disappearanceof the fine structure of the N-S boundary and the change of the critical exponent k for the slope of the critical field on(p-p c ) are due to the introduction of very weak links between nodes in the superconducting networks

  16. Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks

    NARCIS (Netherlands)

    Bhamidi, S.; Van der Hofstad, R.; Hooghiemstra, G.

    2010-01-01

    We study first passage percolation (FPP) on the configuration model (CM) having power-law degrees with exponent ? ? [1, 2) and exponential edge weights. We derive the distributional limit of the minimal weight of a path between typical vertices in the network and the number of edges on the

  17. Dynamic Evolution with Limited Learning Information on a Small-World Network

    International Nuclear Information System (INIS)

    Dong Linrong

    2010-01-01

    This paper investigates the dynamic evolution with limited learning information on a small-world network. In the system, the information among the interaction players is not very lucid, and the players are not allowed to inspect the profit collected by its neighbors, thus the focal player cannot choose randomly a neighbor or the wealthiest one and compare its payoff to copy its strategy. It is assumed that the information acquainted by the player declines in the form of the exponential with the geographical distance between the players, and a parameter V is introduced to denote the inspect-ability about the players. It is found that under the hospitable conditions, cooperation increases with the randomness and is inhibited by the large connectivity for the prisoner's dilemma; however, cooperation is maximal at the moderate rewiring probability and is chaos with the connectivity for the snowdrift game. For the two games, the acuminous sight is in favor of the cooperation under the hospitable conditions; whereas, the myopic eyes are advantageous to cooperation and cooperation increases with the randomness under the hostile condition. (interdisciplinary physics and related areas of science and technology)

  18. Experimental Evaluation of Novel Master-Slave Configurations for Position Control under Random Network Delay and Variable Load for Teleoperation

    Directory of Open Access Journals (Sweden)

    Ahmet Kuzu

    2014-01-01

    Full Text Available This paper proposes two novel master-slave configurations that provide improvements in both control and communication aspects of teleoperation systems to achieve an overall improved performance in position control. The proposed novel master-slave configurations integrate modular control and communication approaches, consisting of a delay regulator to address problems related to variable network delay common to such systems, and a model tracking control that runs on the slave side for the compensation of uncertainties and model mismatch on the slave side. One of the configurations uses a sliding mode observer and the other one uses a modified Smith predictor scheme on the master side to ensure position transparency between the master and slave, while reference tracking of the slave is ensured by a proportional-differentiator type controller in both configurations. Experiments conducted for the networked position control of a single-link arm under system uncertainties and randomly varying network delays demonstrate significant performance improvements with both configurations over the past literature.

  19. Video-based peer feedback through social networking for robotic surgery simulation: a multicenter randomized controlled trial.

    Science.gov (United States)

    Carter, Stacey C; Chiang, Alexander; Shah, Galaxy; Kwan, Lorna; Montgomery, Jeffrey S; Karam, Amer; Tarnay, Christopher; Guru, Khurshid A; Hu, Jim C

    2015-05-01

    To examine the feasibility and outcomes of video-based peer feedback through social networking to facilitate robotic surgical skill acquisition. The acquisition of surgical skills may be challenging for novel techniques and/or those with prolonged learning curves. Randomized controlled trial involving 41 resident physicians performing the Tubes (Da Vinci Intuitive Surgical, Sunnyvale, CA) simulator exercise with versus without peer feedback of video-recorded performance through a social networking Web page. Data collected included simulator exercise score, time to completion, and comfort and satisfaction with robotic surgery simulation. There were no baseline differences between the intervention group (n = 20) and controls (n = 21). The intervention group showed improvement in mean scores from session 1 to sessions 2 and 3 (60.7 vs 75.5, P feedback subjects were more comfortable with robotic surgery than controls (90% vs 62%, P = 0.021) and expressed greater satisfaction with the learning experience (100% vs 67%, P = 0.014). Of the intervention subjects, 85% found that peer feedback was useful and 100% found it effective. Video-based peer feedback through social networking appears to be an effective paradigm for surgical education and accelerates the robotic surgery learning curve during simulation.

  20. Conservation laws for voter-like models on random directed networks

    International Nuclear Information System (INIS)

    Ángeles Serrano, M; Klemm, Konstantin; Vazquez, Federico; Eguíluz, Víctor M; San Miguel, Maxi

    2009-01-01

    We study the voter model, under node and link update, and the related invasion process on a single strongly connected component of a directed network. We implement an analytical treatment in the thermodynamic limit using the heterogeneous mean-field assumption. From the dynamical rules at the microscopic level, we find the equations for the evolution of the relative densities of nodes in a given state on heterogeneous networks with arbitrary degree distribution and degree–degree correlations. We prove that conserved quantities as weighted linear superpositions of spin states exist for all three processes and, for uncorrelated directed networks, we derive their specific expressions. We also discuss the time evolution of the relative densities that decay exponentially to a homogeneous stationary value given by the conserved quantity. The conservation laws obtained in the thermodynamic limit for a system that does not order in that limit determine the probabilities of reaching the absorbing state for a finite system. The contribution of each degree class to the conserved quantity is determined by a local property. Depending on the dynamics, the highest contribution is associated with influential nodes reaching a large number of outgoing neighbors, not too influenceable ones with a low number of incoming connections, or both at the same time

  1. Performance Evaluation of User Selection Protocols in Random Networks with Energy Harvesting and Hardware Impairments

    Directory of Open Access Journals (Sweden)

    Tan Nhat Nguyen

    2016-01-01

    Full Text Available In this paper, we evaluate performances of various user selection protocols under impact of hardware impairments. In the considered protocols, a Base Station (BS selects one of available Users (US to serve, while the remaining USs harvest the energy from the Radio Frequency (RF transmitted by the BS. We assume that all of the US randomly appear around the BS. In the Random Selection Protocol (RAN, the BS randomly selects a US to transmit the data. In the second proposed protocol, named Minimum Distance Protocol (MIND, the US that is nearest to the BS will be chosen. In the Optimal Selection Protocol (OPT, the US providing the highest channel gain between itself and the BS will be served. For performance evaluation, we derive exact and asymptotic closed-form expressions of average Outage Probability (OP over Rayleigh fading channels. We also consider average harvested energy per a US. Finally, Monte-Carlo simulations are then performed to verify the theoretical results.

  2. Continuous theta-burst stimulation may improve visuospatial neglect via modulating the attention network: a randomized controlled study.

    Science.gov (United States)

    Fu, Wei; Cao, Lei; Zhang, Yanming; Huo, Su; Du, JuBao; Zhu, Lin; Song, Weiqun

    2017-05-01

    Visuospatial neglect (VSN) is devastating and common after stroke, and is thought to involve functional disturbance of the attention network. Non-invasive theta-burst stimulation (TBS) may help restore the normal function of attention network, therefore facilitating recovery from VSN. This study investigated the effects of continuous TBS on resting-state functional connectivity (RSFC) in the attention network, and behavioral performances of patients with VSN after stroke. Twelve patients were randomly assigned to receive 10-day cTBS of the left posterior parietal cortex delivered at 80% (the cTBS group), or 40% (the active control group) of the resting motor threshold. Both groups received daily visual scanning training and motor function treatment. Resting-state functional MRI (fMRI) and behavioral tests including line bisection test and star cancelation test were conducted at baseline and after the treatment. At baseline, the two groups showed comparable results in the resting-state fMRI experiments and behavioral tests. After treatment, the cTBS group showed lower functional connectivity between right temporoparietal junction (TPJ) and right anterior insula, and between right superior temporal sulcus and right anterior insula, as compared with the active control group; both groups showed improvement in the behavioral tests, with the cTBS group showing larger changes from baseline than the active control group. cTBS of the left posterior parietal cortex in patients with VSN may induce changes in inter-regional RSFC in the right ventral attention network. These changes may be associated with improved recovery of behavioral deficits after behavioral training. The TPJ and superior temporal sulcus may play crucial roles in recovery from VSN.

  3. Unifying Pore Network Modeling, Continuous Time Random Walk Theory and Experiment - Accomplishments and Future Directions

    Science.gov (United States)

    Bijeljic, B.

    2008-05-01

    This talk will describe and highlight the advantages offered by a methodology that unifies pore network modeling, CTRW theory and experiment in description of solute dispersion in porous media. Solute transport in a porous medium is characterized by the interplay of advection and diffusion (described by Peclet number, Pe) that cause spreading of solute particles. This spreading is traditionally described by dispersion coefficients, D, defined by σ 2 = 2Dt, where σ 2 is the variance of the solute position and t is the time. Using a pore-scale network model based on particle tracking, the rich Peclet- number dependence of dispersion coefficient is predicted from first principles and is shown to compare well with experimental data for restricted diffusion, transition, power-law and mechanical dispersion regimes in the asymptotic limit. In the asymptotic limit D is constant and can be used in an averaged advection-dispersion equation. However, it is highly important to recognize that, until the velocity field is fully sampled, the particle transport is non-Gaussian and D possesses temporal or spatial variation. Furthermore, temporal probability density functions (PDF) of tracer particles are studied in pore networks and an excellent agreement for the spectrum of transition times for particles from pore to pore is obtained between network model results and CTRW theory. Based on the truncated power-law interpretation of PDF-s, the physical origin of the power-law scaling of dispersion coefficient vs. Peclet number has been explained for unconsolidated porous media, sands and a number of sandstones, arriving at the same conclusion from numerical network modelling, analytic CTRW theory and experiment. Future directions for further applications of the methodology presented are discussed in relation to the scale- dependent solute dispersion and reactive transport. Significance of pre-asymptotic dispersion in porous media is addressed from pore-scale upwards and the impact

  4. Comparative effectiveness of injection therapies in lateral epicondylitis: a systematic review and network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Krogh, Thøger Persson; Bartels, Else Marie; Ellingsen, Torkell; Stengaard-Pedersen, Kristian; Buchbinder, Rachelle; Fredberg, Ulrich; Bliddal, Henning; Christensen, Robin

    2013-06-01

    Injection therapy with glucocorticoids has been used since the 1950s as a treatment strategy for lateral epicondylitis (tennis elbow). Lately, several novel injection therapies have become available. To assess the comparative effectiveness and safety of injection therapies in patients with lateral epicondylitis. Systematic review and meta-analysis. Randomized controlled trials comparing different injection therapies for lateral epicondylitis were included provided they contained data for change in pain intensity (primary outcome). Trials were assessed using the Cochrane risk of bias tool. Network (random effects) meta-analysis was applied to combine direct and indirect evidence within and across trial data using the final end point reported in the trials, and results for the arm-based network analyses are reported as standardized mean differences (SMDs). Seventeen trials (1381 participants; 3 [18%] at low risk of bias) assessing injection with 8 different treatments-glucocorticoid (10 trials), botulinum toxin (4 trials), autologous blood (3 trials), platelet-rich plasma (2 trials), and polidocanol, glycosaminoglycan, prolotherapy, and hyaluronic acid (1 trial each)-were included. Pooled results (SMD [95% confidence interval]) showed that beyond 8 weeks, glucocorticoid injection was no more effective than placebo (-0.04 [-0.45 to 0.35]), but only 1 trial (which did not include a placebo arm) was at low risk of bias. Although botulinum toxin showed marginal benefit (-0.50 [-0.91 to -0.08]), it caused temporary paresis of finger extension, and all trials were at high risk of bias. Both autologous blood (-1.43 [-2.15 to -0.71]) and platelet-rich plasma (-1.13 [-1.77 to -0.49]) were also statistically superior to placebo, but only 1 trial was at low risk of bias. Prolotherapy (-2.71 [-4.60 to -0.82]) and hyaluronic acid (-5.58 [-6.35 to -4.82]) were both more efficacious than placebo, whereas polidocanol (0.39 [-0.42 to 1.20]) and glycosaminoglycan (-0.32 [-1.02 to 0

  5. Competing of Sznajd and Voter Dynamics in the Watts-Strogatz Network

    Science.gov (United States)

    Rybak, M.; Kułakowski, K.

    We investigate the Watts-Strogatz network with the clustering coefficient C dependent on the rewiring probability. The network is an area of two opposite contact processes, where nodes can be in two states, S or D. One of the processes is governed by the Sznajd dynamics: if there are two connected nodes in D-state, all their neighbors become D with probability p. For the opposite process it is sufficient to have only one neighbor in state S; this transition occurs with probability 1. The concentration of S-nodes changes abruptly at given value of the probability p. The result is that for small p, in clusterized networks the activation of S nodes prevails. This result is explained by a comparison of two limit cases: the Watts-Strogatz network without rewiring, where C=0.5, and the Bethe lattice where C=0.

  6. A Web-Based, Social Networking Physical Activity Intervention for Insufficiently Active Adults Delivered via Facebook App: Randomized Controlled Trial.

    Science.gov (United States)

    Maher, Carol; Ferguson, Monika; Vandelanotte, Corneel; Plotnikoff, Ron; De Bourdeaudhuij, Ilse; Thomas, Samantha; Nelson-Field, Karen; Olds, Tim

    2015-07-13

    Online social networks offer considerable potential for delivery of socially influential health behavior change interventions. To determine the efficacy, engagement, and feasibility of an online social networking physical activity intervention with pedometers delivered via Facebook app. A total of 110 adults with a mean age of 35.6 years (SD 12.4) were recruited online in teams of 3 to 8 friends. Teams were randomly allocated to receive access to a 50-day online social networking physical activity intervention which included self-monitoring, social elements, and pedometers ("Active Team" Facebook app; n=51 individuals, 12 teams) or a wait-listed control condition (n=59 individuals, 13 teams). Assessments were undertaken online at baseline, 8 weeks, and 20 weeks. The primary outcome measure was self-reported weekly moderate-to-vigorous physical activity (MVPA). Secondary outcomes were weekly walking, vigorous physical activity time, moderate physical activity time, overall quality of life, and mental health quality of life. Analyses were undertaken using random-effects mixed modeling, accounting for potential clustering at the team level. Usage statistics were reported descriptively to determine engagement and feasibility. At the 8-week follow-up, the intervention participants had significantly increased their total weekly MVPA by 135 minutes relative to the control group (P=.03), due primarily to increases in walking time (155 min/week increase relative to controls, Plife or mental health quality of life at either time point. High levels of engagement with the intervention, and particularly the self-monitoring features, were observed. An online, social networking physical activity intervention with pedometers can produce sizable short-term physical activity changes. Future work is needed to determine how to maintain behavior change in the longer term, how to reach at-need populations, and how to disseminate such interventions on a mass scale. Australian New Zealand

  7. Rewiring cells: synthetic biology as a tool to interrogate the organizational principles of living systems.

    Science.gov (United States)

    Bashor, Caleb J; Horwitz, Andrew A; Peisajovich, Sergio G; Lim, Wendell A

    2010-01-01

    The living cell is an incredibly complex entity, and the goal of predictively and quantitatively understanding its function is one of the next great challenges in biology. Much of what we know about the cell concerns its constituent parts, but to a great extent we have yet to decode how these parts are organized to yield complex physiological function. Classically, we have learned about the organization of cellular networks by disrupting them through genetic or chemical means. The emerging discipline of synthetic biology offers an additional, powerful approach to study systems. By rearranging the parts that comprise existing networks, we can gain valuable insight into the hierarchical logic of the networks and identify the modular building blocks that evolution uses to generate innovative function. In addition, by building minimal toy networks, one can systematically explore the relationship between network structure and function. Here, we outline recent work that uses synthetic biology approaches to investigate the organization and function of cellular networks, and describe a vision for a synthetic biology toolkit that could be used to interrogate the design principles of diverse systems.

  8. Hebbian Learning in a Random Network Captures Selectivity Properties of the Prefrontal Cortex

    Science.gov (United States)

    Lindsay, Grace W.

    2017-01-01

    Complex cognitive behaviors, such as context-switching and rule-following, are thought to be supported by the prefrontal cortex (PFC). Neural activity in the PFC must thus be specialized to specific tasks while retaining flexibility. Nonlinear “mixed” selectivity is an important neurophysiological trait for enabling complex and context-dependent behaviors. Here we investigate (1) the extent to which the PFC exhibits computationally relevant properties, such as mixed selectivity, and (2) how such properties could arise via circuit mechanisms. We show that PFC cells recorded from male and female rhesus macaques during a complex task show a moderate level of specialization and structure that is not replicated by a model wherein cells receive random feedforward inputs. While random connectivity can be effective at generating mixed selectivity, the data show significantly more mixed selectivity than predicted by a model with otherwise matched parameters. A simple Hebbian learning rule applied to the random connectivity, however, increases mixed selectivity and enables the model to match the data more accurately. To explain how learning achieves this, we provide analysis along with a clear geometric interpretation of the impact of learning on selectivity. After learning, the model also matches the data on measures of noise, response density, clustering, and the distribution of selectivities. Of two styles of Hebbian learning tested, the simpler and more biologically plausible option better matches the data. These modeling results provide clues about how neural properties important for cognition can arise in a circuit and make clear experimental predictions regarding how various measures of selectivity would evolve during animal training. SIGNIFICANCE STATEMENT The prefrontal cortex is a brain region believed to support the ability of animals to engage in complex behavior. How neurons in this area respond to stimuli—and in particular, to combinations of stimuli (

  9. Combination of Deep Recurrent Neural Networks and Conditional Random Fields for Extracting Adverse Drug Reactions from User Reviews.

    Science.gov (United States)

    Tutubalina, Elena; Nikolenko, Sergey

    2017-01-01

    Adverse drug reactions (ADRs) are an essential part of the analysis of drug use, measuring drug use benefits, and making policy decisions. Traditional channels for identifying ADRs are reliable but very slow and only produce a small amount of data. Text reviews, either on specialized web sites or in general-purpose social networks, may lead to a data source of unprecedented size, but identifying ADRs in free-form text is a challenging natural language processing problem. In this work, we propose a novel model for this problem, uniting recurrent neural architectures and conditional random fields. We evaluate our model with a comprehensive experimental study, showing improvements over state-of-the-art methods of ADR extraction.

  10. Combination of Deep Recurrent Neural Networks and Conditional Random Fields for Extracting Adverse Drug Reactions from User Reviews

    Directory of Open Access Journals (Sweden)

    Elena Tutubalina

    2017-01-01

    Full Text Available Adverse drug reactions (ADRs are an essential part of the analysis of drug use, measuring drug use benefits, and making policy decisions. Traditional channels for identifying ADRs are reliable but very slow and only produce a small amount of data. Text reviews, either on specialized web sites or in general-purpose social networks, may lead to a data source of unprecedented size, but identifying ADRs in free-form text is a challenging natural language processing problem. In this work, we propose a novel model for this problem, uniting recurrent neural architectures and conditional random fields. We evaluate our model with a comprehensive experimental study, showing improvements over state-of-the-art methods of ADR extraction.

  11. Random noise effects in pulse-mode digital multilayer neural networks.

    Science.gov (United States)

    Kim, Y C; Shanblatt, M A

    1995-01-01

    A pulse-mode digital multilayer neural network (DMNN) based on stochastic computing techniques is implemented with simple logic gates as basic computing elements. The pulse-mode signal representation and the use of simple logic gates for neural operations lead to a massively parallel yet compact and flexible network architecture, well suited for VLSI implementation. Algebraic neural operations are replaced by stochastic processes using pseudorandom pulse sequences. The distributions of the results from the stochastic processes are approximated using the hypergeometric distribution. Synaptic weights and neuron states are represented as probabilities and estimated as average pulse occurrence rates in corresponding pulse sequences. A statistical model of the noise (error) is developed to estimate the relative accuracy associated with stochastic computing in terms of mean and variance. Computational differences are then explained by comparison to deterministic neural computations. DMNN feedforward architectures are modeled in VHDL using character recognition problems as testbeds. Computational accuracy is analyzed, and the results of the statistical model are compared with the actual simulation results. Experiments show that the calculations performed in the DMNN are more accurate than those anticipated when Bernoulli sequences are assumed, as is common in the literature. Furthermore, the statistical model successfully predicts the accuracy of the operations performed in the DMNN.

  12. Using Exponential Random Graph Models to Analyze the Character of Peer Relationship Networks and Their Effects on the Subjective Well-being of Adolescents.

    Science.gov (United States)

    Jiao, Can; Wang, Ting; Liu, Jianxin; Wu, Huanjie; Cui, Fang; Peng, Xiaozhe

    2017-01-01

    The influences of peer relationships on adolescent subjective well-being were investigated within the framework of social network analysis, using exponential random graph models as a methodological tool. The participants in the study were 1,279 students (678 boys and 601 girls) from nine junior middle schools in Shenzhen, China. The initial stage of the research used a peer nomination questionnaire and a subjective well-being scale (used in previous studies) to collect data on the peer relationship networks and the subjective well-being of the students. Exponential random graph models were then used to explore the relationships between students with the aim of clarifying the character of the peer relationship networks and the influence of peer relationships on subjective well being. The results showed that all the adolescent peer relationship networks in our investigation had positive reciprocal effects, positive transitivity effects and negative expansiveness effects. However, none of the relationship networks had obvious receiver effects or leaders. The adolescents in partial peer relationship networks presented similar levels of subjective well-being on three dimensions (satisfaction with life, positive affects and negative affects) though not all network friends presented these similarities. The study shows that peer networks can affect an individual's subjective well-being. However, whether similarities among adolescents are the result of social influences or social choices needs further exploration, including longitudinal studies that investigate the potential processes of subjective well-being similarities among adolescents.

  13. New distributed fusion filtering algorithm based on covariances over sensor networks with random packet dropouts

    Science.gov (United States)

    Caballero-Águila, R.; Hermoso-Carazo, A.; Linares-Pérez, J.

    2017-07-01

    This paper studies the distributed fusion estimation problem from multisensor measured outputs perturbed by correlated noises and uncertainties modelled by random parameter matrices. Each sensor transmits its outputs to a local processor over a packet-erasure channel and, consequently, random losses may occur during transmission. Different white sequences of Bernoulli variables are introduced to model the transmission losses. For the estimation, each lost output is replaced by its estimator based on the information received previously, and only the covariances of the processes involved are used, without requiring the signal evolution model. First, a recursive algorithm for the local least-squares filters is derived by using an innovation approach. Then, the cross-correlation matrices between any two local filters is obtained. Finally, the distributed fusion filter weighted by matrices is obtained from the local filters by applying the least-squares criterion. The performance of the estimators and the influence of both sensor uncertainties and transmission losses on the estimation accuracy are analysed in a numerical example.

  14. Acupuncture-Related Techniques for Psoriasis: A Systematic Review with Pairwise and Network Meta-Analyses of Randomized Controlled Trials.

    Science.gov (United States)

    Yeh, Mei-Ling; Ko, Shu-Hua; Wang, Mei-Hua; Chi, Ching-Chi; Chung, Yu-Chu

    2017-12-01

    There has be a large body of evidence on the pharmacological treatments for psoriasis, but whether nonpharmacological interventions are effective in managing psoriasis remains largely unclear. This systematic review conducted pairwise and network meta-analyses to determine the effects of acupuncture-related techniques on acupoint stimulation for the treatment of psoriasis and to determine the order of effectiveness of these remedies. This study searched the following databases from inception to March 15, 2016: Medline, PubMed, Cochrane Central Register of Controlled Trials, EBSCO (including Academic Search Premier, American Doctoral Dissertations, and CINAHL), Airiti Library, and China National Knowledge Infrastructure. Randomized controlled trials (RCTs) on the effects of acupuncture-related techniques on acupoint stimulation as intervention for psoriasis were independently reviewed by two researchers. A total of 13 RCTs with 1,060 participants were included. The methodological quality of included studies was not rigorous. Acupoint stimulation, compared with nonacupoint stimulation, had a significant treatment for psoriasis. However, the most common adverse events were thirst and dry mouth. Subgroup analysis was further done to confirm that the short-term treatment effect was superior to that of the long-term effect in treating psoriasis. Network meta-analysis identified acupressure or acupoint catgut embedding, compared with medication, and had a significant effect for improving psoriasis. It was noted that acupressure was the most effective treatment. Acupuncture-related techniques could be considered as an alternative or adjuvant therapy for psoriasis in short term, especially of acupressure and acupoint catgut embedding. This study recommends further well-designed, methodologically rigorous, and more head-to-head randomized trials to explore the effects of acupuncture-related techniques for treating psoriasis.

  15. SNRFCB: sub-network based random forest classifier for predicting chemotherapy benefit on survival for cancer treatment.

    Science.gov (United States)

    Shi, Mingguang; He, Jianmin

    2016-04-01

    Adjuvant chemotherapy (CTX) should be individualized to provide potential survival benefit and avoid potential harm to cancer patients. Our goal was to establish a computational approach for making personalized estimates of the survival benefit from adjuvant CTX. We developed Sub-Network based Random Forest classifier for predicting Chemotherapy Benefit (SNRFCB) based gene expression datasets of lung cancer. The SNRFCB approach was then validated in independent test cohorts for identifying chemotherapy responder cohorts and chemotherapy non-responder cohorts. SNRFCB involved the pre-selection of gene sub-network signatures based on the mutations and on protein-protein interaction data as well as the application of the random forest algorithm to gene expression datasets. Adjuvant CTX was significantly associated with the prolonged overall survival of lung cancer patients in the chemotherapy responder group (P = 0.008), but it was not beneficial to patients in the chemotherapy non-responder group (P = 0.657). Adjuvant CTX was significantly associated with the prolonged overall survival of lung cancer squamous cell carcinoma (SQCC) subtype patients in the chemotherapy responder cohorts (P = 0.024), but it was not beneficial to patients in the chemotherapy non-responder cohorts (P = 0.383). SNRFCB improved prediction performance as compared to the machine learning method, support vector machine (SVM). To test the general applicability of the predictive model, we further applied the SNRFCB approach to human breast cancer datasets and also observed superior performance. SNRFCB could provide recurrent probability for individual patients and identify which patients may benefit from adjuvant CTX in clinical trials.

  16. Cooperation of deterministic dynamics and random noise in production of complex syntactical avian song sequences: a neural network model

    Directory of Open Access Journals (Sweden)

    Yuichi eYamashita

    2011-04-01

    Full Text Available How the brain learns and generates temporal sequences is a fundamental issue in neuroscience. The production of birdsongs, a process which involves complex learned sequences, provides researchers with an excellent biological model for this topic. The Bengalese finch in particular learns a highly complex song with syntactical structure. The nucleus HVC (HVC, a premotor nucleus within the avian song system, plays a key role in generating the temporal structures of their songs. From lesion studies, the nucleus interfacialis (NIf projecting to the HVC is considered one of the essential regions that contribute to the complexity of their songs. However, the types of interaction between the HVC and the NIf that can produce complex syntactical songs remain unclear. In order to investigate the function of interactions between the HVC and NIf, we have proposed a neural network model based on previous biological evidence. The HVC is modeled by a recurrent neural network (RNN that learns to generate temporal patterns of songs. The NIf is modeled as a mechanism that provides auditory feedback to the HVC and generates random noise that feeds into the HVC. The model showed that complex syntactical songs can be replicated by simple interactions between deterministic dynamics of the RNN and random noise. In the current study, the plausibility of the model is tested by the comparison between the changes in the songs of actual birds induced by pharmacological inhibition of the NIf and the changes in the songs produced by the model resulting from modification of parameters representing NIf functions. The efficacy of the model demonstrates that the changes of songs induced by pharmacological inhibition of the NIf can be interpreted as a trade-off between the effects of noise and the effects of feedback on the dynamics of the RNN of the HVC. These facts suggest that the current model provides a convincing hypothesis for the functional role of NIf-HVC interaction.

  17. Extracting functionally feedforward networks from a population of spiking neurons.

    Science.gov (United States)

    Vincent, Kathleen; Tauskela, Joseph S; Thivierge, Jean-Philippe

    2012-01-01

    Neuronal avalanches are a ubiquitous form of activity characterized by spontaneous bursts whose size distribution follows a power-law. Recent theoretical models have replicated power-law avalanches by assuming the presence of functionally feedforward connections (FFCs) in the underlying dynamics of the system. Accordingly, avalanches are generated by a feedforward chain of activation that persists despite being embedded in a larger, massively recurrent circuit. However, it is unclear to what extent networks of living neurons that exhibit power-law avalanches rely on FFCs. Here, we employed a computational approach to reconstruct the functional connectivity of cultured cortical neurons plated on multielectrode arrays (MEAs) and investigated whether pharmacologically induced alterations in avalanche dynamics are accompanied by changes in FFCs. This approach begins by extracting a functional network of directed links between pairs of neurons, and then evaluates the strength of FFCs using Schur decomposition. In a first step, we examined the ability of this approach to extract FFCs from simulated spiking neurons. The strength of FFCs obtained in strictly feedforward networks diminished monotonically as links were gradually rewired at random. Next, we estimated the FFCs of spontaneously active cortical neuron cultures in the presence of either a control medium, a GABA(A) receptor antagonist (PTX), or an AMPA receptor antagonist combined with an NMDA receptor antagonist (APV/DNQX). The distribution of avalanche sizes in these cultures was modulated by this pharmacology, with a shallower power-law under PTX (due to the prominence of larger avalanches) and a steeper power-law under APV/DNQX (due to avalanches recruiting fewer neurons) relative to control cultures. The strength of FFCs increased in networks after application of PTX, consistent with an amplification of feedforward activity during avalanches. Conversely, FFCs decreased after application of APV

  18. Dynamics of Symmetric Conserved Mass Aggregation Model on Complex Networks

    Institute of Scientific and Technical Information of China (English)

    HUA Da-Yin

    2009-01-01

    We investigate the dynamical behaviour of the aggregation process in the symmetric conserved mass aggregation model under three different topological structures. The dispersion σ(t, L) = (∑i(mi - ρ0)2/L)1/2 is defined to describe the dynamical behaviour where ρ0 is the density of particle and mi is the particle number on a site. It is found numerically that for a regular lattice and a scale-free network, σ(t, L) follows a power-law scaling σ(t, L) ~ tδ1 and σ(t, L) ~ tδ4 from a random initial condition to the stationary states, respectively. However, for a small-world network, there are two power-law scaling regimes, σ(t, L) ~ tδ2 when t<T and a(t, L) ~ tδ3 when tT. Moreover, it is found numerically that δ2 is near to δ1 for small rewiring probability q, and δ3 hardly changes with varying q and it is almost the same as δ4. We speculate that the aggregation of the connection degree accelerates the mass aggregation in the initial relaxation stage and the existence of the long-distance interactions in the complex networks results in the acceleration of the mass aggregation when tT for the small-world networks. We also show that the relaxation time T follows a power-law scaling τ Lz and σ(t, L) in the stationary state follows a power-law σs(L) ~ Lσ for three different structures.

  19. Road Segmentation of Remotely-Sensed Images Using Deep Convolutional Neural Networks with Landscape Metrics and Conditional Random Fields

    Directory of Open Access Journals (Sweden)

    Teerapong Panboonyuen

    2017-07-01

    Full Text Available Object segmentation of remotely-sensed aerial (or very-high resolution, VHS images and satellite (or high-resolution, HR images, has been applied to many application domains, especially in road extraction in which the segmented objects are served as a mandatory layer in geospatial databases. Several attempts at applying the deep convolutional neural network (DCNN to extract roads from remote sensing images have been made; however, the accuracy is still limited. In this paper, we present an enhanced DCNN framework specifically tailored for road extraction of remote sensing images by applying landscape metrics (LMs and conditional random fields (CRFs. To improve the DCNN, a modern activation function called the exponential linear unit (ELU, is employed in our network, resulting in a higher number of, and yet more accurate, extracted roads. To further reduce falsely classified road objects, a solution based on an adoption of LMs is proposed. Finally, to sharpen the extracted roads, a CRF method is added to our framework. The experiments were conducted on Massachusetts road aerial imagery as well as the Thailand Earth Observation System (THEOS satellite imagery data sets. The results showed that our proposed framework outperformed Segnet, a state-of-the-art object segmentation technique, on any kinds of remote sensing imagery, in most of the cases in terms of precision, recall, and F 1 .

  20. Conduction in rectangular quasi-one-dimensional and two-dimensional random resistor networks away from the percolation threshold.

    Science.gov (United States)

    Kiefer, Thomas; Villanueva, Guillermo; Brugger, Jürgen

    2009-08-01

    In this study we investigate electrical conduction in finite rectangular random resistor networks in quasione and two dimensions far away from the percolation threshold p(c) by the use of a bond percolation model. Various topologies such as parallel linear chains in one dimension, as well as square and triangular lattices in two dimensions, are compared as a function of the geometrical aspect ratio. In particular we propose a linear approximation for conduction in two-dimensional systems far from p(c), which is useful for engineering purposes. We find that the same scaling function, which can be used for finite-size scaling of percolation thresholds, also applies to describe conduction away from p(c). This is in contrast to the quasi-one-dimensional case, which is highly nonlinear. The qualitative analysis of the range within which the linear approximation is legitimate is given. A brief link to real applications is made by taking into account a statistical distribution of the resistors in the network. Our results are of potential interest in fields such as nanostructured or composite materials and sensing applications.

  1. Analysis of using interpulse intervals to generate 128-bit biometric random binary sequences for securing wireless body sensor networks.

    Science.gov (United States)

    Zhang, Guang-He; Poon, Carmen C Y; Zhang, Yuan-Ting

    2012-01-01

    Wireless body sensor network (WBSN), a key building block for m-Health, demands extremely stringent resource constraints and thus lightweight security methods are preferred. To minimize resource consumption, utilizing information already available to a WBSN, particularly common to different sensor nodes of a WBSN, for security purposes becomes an attractive solution. In this paper, we tested the randomness and distinctiveness of the 128-bit biometric binary sequences (BSs) generated from interpulse intervals (IPIs) of 20 healthy subjects as well as 30 patients suffered from myocardial infarction and 34 subjects with other cardiovascular diseases. The encoding time of a biometric BS on a WBSN node is on average 23 ms and memory occupation is 204 bytes for any given IPI sequence. The results from five U.S. National Institute of Standards and Technology statistical tests suggest that random biometric BSs can be generated from both healthy subjects and cardiovascular patients and can potentially be used as authentication identifiers for securing WBSNs. Ultimately, it is preferred that these biometric BSs can be used as encryption keys such that key distribution over the WBSN can be avoided.

  2. Hyperspectral Image Classification With Markov Random Fields and a Convolutional Neural Network

    Science.gov (United States)

    Cao, Xiangyong; Zhou, Feng; Xu, Lin; Meng, Deyu; Xu, Zongben; Paisley, John

    2018-05-01

    This paper presents a new supervised classification algorithm for remotely sensed hyperspectral image (HSI) which integrates spectral and spatial information in a unified Bayesian framework. First, we formulate the HSI classification problem from a Bayesian perspective. Then, we adopt a convolutional neural network (CNN) to learn the posterior class distributions using a patch-wise training strategy to better use the spatial information. Next, spatial information is further considered by placing a spatial smoothness prior on the labels. Finally, we iteratively update the CNN parameters using stochastic gradient decent (SGD) and update the class labels of all pixel vectors using an alpha-expansion min-cut-based algorithm. Compared with other state-of-the-art methods, the proposed classification method achieves better performance on one synthetic dataset and two benchmark HSI datasets in a number of experimental settings.

  3. Quantum-noise randomized data encryption for wavelength-division-multiplexed fiber-optic networks

    International Nuclear Information System (INIS)

    Corndorf, Eric; Liang Chuang; Kanter, Gregory S.; Kumar, Prem; Yuen, Horace P.

    2005-01-01

    We demonstrate high-rate randomized data-encryption through optical fibers using the inherent quantum-measurement noise of coherent states of light. Specifically, we demonstrate 650 Mbit/s data encryption through a 10 Gbit/s data-bearing, in-line amplified 200-km-long line. In our protocol, legitimate users (who share a short secret key) communicate using an M-ry signal set while an attacker (who does not share the secret key) is forced to contend with the fundamental and irreducible quantum-measurement noise of coherent states. Implementations of our protocol using both polarization-encoded signal sets as well as polarization-insensitive phase-keyed signal sets are experimentally and theoretically evaluated. Different from the performance criteria for the cryptographic objective of key generation (quantum key-generation), one possible set of performance criteria for the cryptographic objective of data encryption is established and carefully considered

  4. Hierarchical random cellular neural networks for system-level brain-like signal processing.

    Science.gov (United States)

    Kozma, Robert; Puljic, Marko

    2013-09-01

    Sensory information processing and cognition in brains are modeled using dynamic systems theory. The brain's dynamic state is described by a trajectory evolving in a high-dimensional state space. We introduce a hierarchy of random cellular automata as the mathematical tools to describe the spatio-temporal dynamics of the cortex. The corresponding brain model is called neuropercolation which has distinct advantages compared to traditional models using differential equations, especially in describing spatio-temporal discontinuities in the form of phase transitions. Phase transitions demarcate singularities in brain operations at critical conditions, which are viewed as hallmarks of higher cognition and awareness experience. The introduced Monte-Carlo simulations obtained by parallel computing point to the importance of computer implementations using very large-scale integration (VLSI) and analog platforms. Copyright © 2013 Elsevier Ltd. All rights reserved.

  5. Network trending; leadership, followership and neutrality among companies: A random matrix approach

    Science.gov (United States)

    Mobarhan, N. S. Safavi; Saeedi, A.; Roodposhti, F. Rahnamay; Jafari, G. R.

    2016-11-01

    In this article, we analyze the cross-correlation between returns of different stocks to answer the following important questions. The first one is: If there exists collective behavior in a financial market, how could we detect it? And the second question is: Is there a particular company among the companies of a market as the leader of the collective behavior? Or is there no specified leadership governing the system similar to some complex systems? We use the method of random matrix theory to answer the mentioned questions. Cross-correlation matrix of index returns of four different markets is analyzed. The participation ratio quantity related to each matrices' eigenvectors and the eigenvalue spectrum is calculated. We introduce shuffled-matrix created of cross correlation matrix in such a way that the elements of the later one are displaced randomly. Comparing the participation ratio quantities obtained from a correlation matrix of a market and its related shuffled-one, on the bulk distribution region of the eigenvalues, we detect a meaningful deviation between the mentioned quantities indicating the collective behavior of the companies forming the market. By calculating the relative deviation of participation ratios, we obtain a measure to compare the markets according to their collective behavior. Answering the second question, we show there are three groups of companies: The first group having higher impact on the market trend called leaders, the second group is followers and the third one is the companies who have not a considerable role in the trend. The results can be utilized in portfolio construction.

  6. Influence network linkages across implementation strategy conditions in a randomized controlled trial of two strategies for scaling up evidence-based practices in public youth-serving systems.

    Science.gov (United States)

    Palinkas, Lawrence A; Holloway, Ian W; Rice, Eric; Brown, C Hendricks; Valente, Thomas W; Chamberlain, Patricia

    2013-11-14

    Given the importance of influence networks in the implementation of evidence-based practices and interventions, it is unclear whether such networks continue to operate as sources of information and advice when they are segmented and disrupted by randomization to different implementation strategy conditions. The present study examines the linkages across implementation strategy conditions of social influence networks of leaders of youth-serving systems in 12 California counties participating in a randomized controlled trial of community development teams (CDTs) to scale up use of an evidence-based practice. Semi-structured interviews were conducted with 38 directors, assistant directors, and program managers of county probation, mental health, and child welfare departments. A web-based survey collected additional quantitative data on information and advice networks of study participants. A mixed-methods approach to data analysis was used to create a sociometric data set (n = 176) to examine linkages between treatment and standard conditions. Of those network members who were affiliated with a county (n = 137), only 6 (4.4%) were directly connected to a member of the opposite implementation strategy condition; 19 (13.9%) were connected by two steps or fewer to a member of the opposite implementation strategy condition; 64 (46.7%) were connected by three or fewer steps to a member of the opposite implementation strategy condition. Most of the indirect steps between individuals who were in different implementation strategy conditions were connections involving a third non-county organizational entity that had an important role in the trial in keeping the implementation strategy conditions separate. When these entities were excluded, the CDT network exhibited fewer components and significantly higher betweenness centralization than did the standard condition network. Although the integrity of the RCT in this instance was not compromised by study participant influence

  7. Effectiveness of multi-drug regimen chemotherapy treatment in osteosarcoma patients: a network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Wang, Xiaojie; Zheng, Hong; Shou, Tao; Tang, Chunming; Miao, Kun; Wang, Ping

    2017-03-29

    Osteosarcoma is the most common malignant bone tumour. Due to the high metastasis rate and drug resistance of this disease, multi-drug regimens are necessary to control tumour cells at various stages of the cell cycle, eliminate local or distant micrometastases, and reduce the emergence of drug-resistant cells. Many adjuvant chemotherapy protocols have shown different efficacies and controversial results. Therefore, we classified the types of drugs used for adjuvant chemotherapy and evaluated the differences between single- and multi-drug chemotherapy regimens using network meta-analysis. We searched electronic databases, including PubMed (MEDLINE), EmBase, and the Cochrane Library, through November 2016 using the keywords "osteosarcoma", "osteogenic sarcoma", "chemotherapy", and "random*" without language restrictions. The major outcome in the present analysis was progression-free survival (PFS), and the secondary outcome was overall survival (OS). We used a random effect network meta-analysis for mixed multiple treatment comparisons. We included 23 articles assessing a total of 5742 patients in the present systematic review. The analysis of PFS indicated that the T12 protocol (including adriamycin, bleomycin, cyclophosphamide, dactinomycin, methotrexate, cisplatin) plays a more critical role in osteosarcoma treatment (surface under the cumulative ranking (SUCRA) probability 76.9%), with a better effect on prolonging the PFS of patients when combined with ifosfamide (94.1%) or vincristine (81.9%). For the analysis of OS, we separated the regimens to two groups, reflecting the disconnection. The T12 protocol plus vincristine (94.7%) or the removal of cisplatinum (89.4%) is most likely the best regimen. We concluded that multi-drug regimens have a better effect on prolonging the PFS and OS of osteosarcoma patients, and the T12 protocol has a better effect on prolonging the PFS of osteosarcoma patients, particularly in combination with ifosfamide or vincristine

  8. Random Network Models to Predict the Long-Term Impact of HPV Vaccination on Genital Warts

    Science.gov (United States)

    Díez-Domingo, Javier; Sánchez-Alonso, Víctor; Acedo, Luis; Villanueva-Oller, Javier

    2017-01-01

    The Human papillomaviruses (HPV) vaccine induces a herd immunity effect in genital warts when a large number of the population is vaccinated. This aspect should be taken into account when devising new vaccine strategies, like vaccination at older ages or male vaccination. Therefore, it is important to develop mathematical models with good predictive capacities. We devised a sexual contact network that was calibrated to simulate the Spanish epidemiology of different HPV genotypes. Through this model, we simulated the scenario that occurred in Australia in 2007, where 12–13 year-old girls were vaccinated with a three-dose schedule of a vaccine containing genotypes 6 and 11, which protect against genital warts, and also a catch-up program in women up to 26 years of age. Vaccine coverage were 73% in girls with three doses and with coverage rates decreasing with age until 52% for 20–26 year-olds. A fast 59% reduction in the genital warts diagnoses occurred in the model in the first years after the start of the program, similar to what was described in the literature. PMID:29035332

  9. Three-dimensional random resistor-network model for solid oxide fuel cell composite electrodes

    International Nuclear Information System (INIS)

    Abbaspour, Ali; Luo Jingli; Nandakumar, K.

    2010-01-01

    A three-dimensional reconstruction of solid oxide fuel cell (SOFC) composite electrodes was developed to evaluate the performance and further investigate the effect of microstructure on the performance of SOFC electrodes. Porosity of the electrode is controlled by adding pore former particles (spheres) to the electrode and ignoring them in analysis step. To enhance connectivity between particles and increase the length of triple-phase boundary (TPB), sintering process is mimicked by enlarging particles to certain degree after settling them inside the packing. Geometrical characteristics such as length of TBP and active contact area as well as porosity can easily be calculated using the current model. Electrochemical process is simulated using resistor-network model and complete Butler-Volmer equation is used to deal with charge transfer process on TBP. The model shows that TPBs are not uniformly distributed across the electrode and location of TPBs as well as amount of electrochemical reaction is not uniform. Effects of electrode thickness, particle size ratio, electron and ion conductor conductivities and rate of electrochemical reaction on overall electrochemical performance of electrode are investigated.

  10. Automated classification of seismic sources in a large database: a comparison of Random Forests and Deep Neural Networks.

    Science.gov (United States)

    Hibert, Clement; Stumpf, André; Provost, Floriane; Malet, Jean-Philippe

    2017-04-01

    In the past decades, the increasing quality of seismic sensors and capability to transfer remotely large quantity of data led to a fast densification of local, regional and global seismic networks for near real-time monitoring of crustal and surface processes. This technological advance permits the use of seismology to document geological and natural/anthropogenic processes (volcanoes, ice-calving, landslides, snow and rock avalanches, geothermal fields), but also led to an ever-growing quantity of seismic data. This wealth of seismic data makes the construction of complete seismicity catalogs, which include earthquakes but also other sources of seismic waves, more challenging and very time-consuming as this critical pre-processing stage is classically done by human operators and because hundreds of thousands of seismic signals have to be processed. To overcome this issue, the development of automatic methods for the processing of continuous seismic data appears to be a necessity. The classification algorithm should satisfy the need of a method that is robust, precise and versatile enough to be deployed to monitor the seismicity in very different contexts. In this study, we evaluate the ability of machine learning algorithms for the analysis of seismic sources at the Piton de la Fournaise volcano being Random Forest and Deep Neural Network classifiers. We gather a catalog of more than 20,000 events, belonging to 8 classes of seismic sources. We define 60 attributes, based on the waveform, the frequency content and the polarization of the seismic waves, to parameterize the seismic signals recorded. We show that both algorithms provide similar positive classification rates, with values exceeding 90% of the events. When trained with a sufficient number of events, the rate of positive identification can reach 99%. These very high rates of positive identification open the perspective of an operational implementation of these algorithms for near-real time monitoring of

  11. A Peer-Educator Network HIV Prevention Intervention Among Injection Drug Users: Results of a Randomized Controlled Trial in St. Petersburg, Russia

    Science.gov (United States)

    Latkin, Carl A.; Kukhareva, Polina V.; Malov, Sergey V.; Batluk, Julia V.; Shaboltas, Alla V.; Skochilov, Roman V.; Sokolov, Nicolay V.; Verevochkin, Sergei V.; Hudgens, Michael G.; Kozlov, Andrei P.

    2014-01-01

    We evaluated the efficacy of a peer-educator network intervention as a strategy to reduce HIV acquisition among injection drug users (IDUs) and their drug and/or sexual networks. A randomized controlled trial was conducted in St. Petersburg, Russia among IDU index participants and their risk network participants. Network units were randomized to the control or experimental intervention. Only the experimental index participants received training sessions to communicate risk reduction techniques to their network members. Analysis includes 76 index and 84 network participants who were HIV uninfected. The main outcome measure was HIV sero-conversion. The incidence rates in the control and experimental groups were 19.57 (95 % CI 10.74–35.65) and 7.76 (95 % CI 3.51–17.19) cases per 100 p/y, respectively. The IRR was 0.41 (95 % CI 0.15–1.08) without a statistically significant difference between the two groups (log rank test statistic X2 = 2.73, permutation p value = 0.16). Retention rate was 67 % with a third of the loss due to incarceration or death. The results show a promising trend that this strategy would be successful in reducing the acquisition of HIV among IDUs. PMID:23881187

  12. Transposable elements re-wire and fine-tune the transcriptome.

    Directory of Open Access Journals (Sweden)

    Michael Cowley

    Full Text Available What good are transposable elements (TEs? Although their activity can be harmful to host genomes and can cause disease, they nevertheless represent an important source of genetic variation that has helped shape genomes. In this review, we examine the impact of TEs, collectively referred to as the mobilome, on the transcriptome. We explore how TEs-particularly retrotransposons-contribute to transcript diversity and consider their potential significance as a source of small RNAs that regulate host gene transcription. We also discuss a critical role for the mobilome in engineering transcriptional networks, permitting coordinated gene expression, and facilitating the evolution of novel physiological processes.

  13. Transposable elements re-wire and fine-tune the transcriptome.

    Science.gov (United States)

    Cowley, Michael; Oakey, Rebecca J

    2013-01-01

    What good are transposable elements (TEs)? Although their activity can be harmful to host genomes and can cause disease, they nevertheless represent an important source of genetic variation that has helped shape genomes. In this review, we examine the impact of TEs, collectively referred to as the mobilome, on the transcriptome. We explore how TEs-particularly retrotransposons-contribute to transcript diversity and consider their potential significance as a source of small RNAs that regulate host gene transcription. We also discuss a critical role for the mobilome in engineering transcriptional networks, permitting coordinated gene expression, and facilitating the evolution of novel physiological processes.

  14. Prediction of Associations between OMIM Diseases and MicroRNAs by Random Walk on OMIM Disease Similarity Network

    Directory of Open Access Journals (Sweden)

    Hailin Chen

    2013-01-01

    Full Text Available Increasing evidence has revealed that microRNAs (miRNAs play important roles in the development and progression of human diseases. However, efforts made to uncover OMIM disease-miRNA associations are lacking and the majority of diseases in the OMIM database are not associated with any miRNA. Therefore, there is a strong incentive to develop computational methods to detect potential OMIM disease-miRNA associations. In this paper, random walk on OMIM disease similarity network is applied to predict potential OMIM disease-miRNA associations under the assumption that functionally related miRNAs are often associated with phenotypically similar diseases. Our method makes full use of global disease similarity values. We tested our method on 1226 known OMIM disease-miRNA associations in the framework of leave-one-out cross-validation and achieved an area under the ROC curve of 71.42%. Excellent performance enables us to predict a number of new potential OMIM disease-miRNA associations and the newly predicted associations are publicly released to facilitate future studies. Some predicted associations with high ranks were manually checked and were confirmed from the publicly available databases, which was a strong evidence for the practical relevance of our method.

  15. Use of Hot Rolling for Generating Low Deviation Twins and a Disconnected Random Boundary Network in Inconel 600 Alloy

    Science.gov (United States)

    Sahu, Sandeep; Yadav, Prabhat Chand; Shekhar, Shashank

    2018-02-01

    In this investigation, Inconel 600 alloy was thermomechanically processed to different strains via hot rolling followed by a short-time annealing treatment to determine an appropriate thermomechanical process to achieve a high fraction of low-Σ CSL boundaries. Experimental results demonstrate that a certain level of deformation is necessary to obtain effective "grain boundary engineering"; i.e., the deformation must be sufficiently high to provide the required driving force for postdeformation static recrystallization, yet it should be low enough to retain a large fraction of original twin boundaries. Samples processed in such a fashion exhibited 77 pct length fraction of low-Σ CSL boundaries, a dominant fraction of which was from Σ3 ( 64 pct), the latter with very low deviation from its theoretical misorientation. The application of hot rolling also resulted in a very low fraction of Σ1 ( 1 pct) boundaries, as desired. The process also leads to so-called "triple junction engineering" with the generation of special triple junctions, which are very effective in disrupting the connectivity of the random grain boundary network.

  16. INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Dynamic Evolution with Limited Learning Information on a Small-World Network

    Science.gov (United States)

    Dong, Lin-Rong

    2010-09-01

    This paper investigates the dynamic evolution with limited learning information on a small-world network. In the system, the information among the interaction players is not very lucid, and the players are not allowed to inspect the profit collected by its neighbors, thus the focal player cannot choose randomly a neighbor or the wealthiest one and compare its payoff to copy its strategy. It is assumed that the information acquainted by the player declines in the form of the exponential with the geographical distance between the players, and a parameter V is introduced to denote the inspect-ability about the players. It is found that under the hospitable conditions, cooperation increases with the randomness and is inhibited by the large connectivity for the prisoner's dilemma; however, cooperation is maximal at the moderate rewiring probability and is chaos with the connectivity for the snowdrift game. For the two games, the acuminous sight is in favor of the cooperation under the hospitable conditions; whereas, the myopic eyes are advantageous to cooperation and cooperation increases with the randomness under the hostile condition.

  17. Nucleolar protein trafficking in response to HIV-1 Tat: rewiring the nucleolus.

    Science.gov (United States)

    Jarboui, Mohamed Ali; Bidoia, Carlo; Woods, Elena; Roe, Barbara; Wynne, Kieran; Elia, Giuliano; Hall, William W; Gautier, Virginie W

    2012-01-01

    The trans-activator Tat protein is a viral regulatory protein essential for HIV-1 replication. Tat trafficks to the nucleoplasm and the nucleolus. The nucleolus, a highly dynamic and structured membrane-less sub-nuclear compartment, is the site of rRNA and ribosome biogenesis and is involved in numerous cellular functions including transcriptional regulation, cell cycle control and viral infection. Importantly, transient nucleolar trafficking of both Tat and HIV-1 viral transcripts are critical in HIV-1 replication, however, the role(s) of the nucleolus in HIV-1 replication remains unclear. To better understand how the interaction of Tat with the nucleolar machinery contributes to HIV-1 pathogenesis, we investigated the quantitative changes in the composition of the nucleolar proteome of Jurkat T-cells stably expressing HIV-1 Tat fused to a TAP tag. Using an organellar proteomic approach based on mass spectrometry, coupled with Stable Isotope Labelling in Cell culture (SILAC), we quantified 520 proteins, including 49 proteins showing significant changes in abundance in Jurkat T-cell nucleolus upon Tat expression. Numerous proteins exhibiting a fold change were well characterised Tat interactors and/or known to be critical for HIV-1 replication. This suggests that the spatial control and subcellular compartimentaliation of these cellular cofactors by Tat provide an additional layer of control for regulating cellular machinery involved in HIV-1 pathogenesis. Pathway analysis and network reconstruction revealed that Tat expression specifically resulted in the nucleolar enrichment of proteins collectively participating in ribosomal biogenesis, protein homeostasis, metabolic pathways including glycolytic, pentose phosphate, nucleotides and amino acids biosynthetic pathways, stress response, T-cell signaling pathways and genome integrity. We present here the first differential profiling of the nucleolar proteome of T-cells expressing HIV-1 Tat. We discuss how these

  18. Effective augmentation of networked systems and enhancing pinning controllability

    Science.gov (United States)

    Jalili, Mahdi

    2018-06-01

    Controlling dynamics of networked systems to a reference state, known as pinning control, has many applications in science and engineering. In this paper, we introduce a method for effective augmentation of networked systems, while also providing high levels of pinning controllability for the final augmented network. The problem is how to connect a sub-network to an already existing network such that the pinning controllability is maximised. We consider the eigenratio of the augmented Laplacian matrix as a pinning controllability metric, and use graph perturbation theory to approximate the influence of edge addition on the eigenratio. The proposed metric can be effectively used to find the inter-network links connecting the disjoint networks. Also, an efficient link rewiring approach is proposed to further optimise the pinning controllability of the augmented network. We provide numerical simulations on synthetic networks and show that the proposed method is more effective than heuristic ones.

  19. Design and methods of a social network isolation study for reducing respiratory infection transmission: The eX-FLU cluster randomized trial.

    Science.gov (United States)

    Aiello, Allison E; Simanek, Amanda M; Eisenberg, Marisa C; Walsh, Alison R; Davis, Brian; Volz, Erik; Cheng, Caroline; Rainey, Jeanette J; Uzicanin, Amra; Gao, Hongjiang; Osgood, Nathaniel; Knowles, Dylan; Stanley, Kevin; Tarter, Kara; Monto, Arnold S

    2016-06-01

    Social networks are increasingly recognized as important points of intervention, yet relatively few intervention studies of respiratory infection transmission have utilized a network design. Here we describe the design, methods, and social network structure of a randomized intervention for isolating respiratory infection cases in a university setting over a 10-week period. 590 students in six residence halls enrolled in the eX-FLU study during a chain-referral recruitment process from September 2012-January 2013. Of these, 262 joined as "seed" participants, who nominated their social contacts to join the study, of which 328 "nominees" enrolled. Participants were cluster-randomized by 117 residence halls. Participants were asked to respond to weekly surveys on health behaviors, social interactions, and influenza-like illness (ILI) symptoms. Participants were randomized to either a 3-Day dorm room isolation intervention or a control group (no isolation) upon illness onset. ILI cases reported on their isolation behavior during illness and provided throat and nasal swab specimens at onset, day-three, and day-six of illness. A subsample of individuals (N=103) participated in a sub-study using a novel smartphone application, iEpi, which collected sensor and contextually-dependent survey data on social interactions. Within the social network, participants were significantly positively assortative by intervention group, enrollment type, residence hall, iEpi participation, age, gender, race, and alcohol use (all Pisolation from social networks in a university setting. These data provide an unparalleled opportunity to address questions about isolation and infection transmission, as well as insights into social networks and behaviors among college-aged students. Several important lessons were learned over the course of this project, including feasible isolation durations, the need for extensive organizational efforts, as well as the need for specialized programmers and server

  20. A more randomly organized grey matter network is associated with deteriorating language and global cognition in individuals with subjective cognitive decline.

    Science.gov (United States)

    Verfaillie, Sander C J; Slot, Rosalinde E R; Dicks, Ellen; Prins, Niels D; Overbeek, Jozefien M; Teunissen, Charlotte E; Scheltens, Philip; Barkhof, Frederik; van der Flier, Wiesje M; Tijms, Betty M

    2018-03-30

    Grey matter network disruptions in Alzheimer's disease (AD) are associated with worse cognitive impairment cross-sectionally. Our aim was to investigate whether indications of a more random network organization are associated with longitudinal decline in specific cognitive functions in individuals with subjective cognitive decline (SCD). We included 231 individuals with SCD who had annually repeated neuropsychological assessment (3 ± 1 years; n = 646 neuropsychological investigations) available from the Amsterdam Dementia Cohort (54% male, age: 63 ± 9, MMSE: 28 ± 2). Single-subject grey matter networks were extracted from baseline 3D-T1 MRI scans and we computed basic network (size, degree, connectivity density) and higher-order (path length, clustering, betweenness centrality, normalized path length [lambda] and normalized clustering [gamma]) parameters at whole brain and/or regional levels. We tested associations of network parameters with baseline and annual cognition (memory, attention, executive functioning, language composite scores, and global cognition [all domains with MMSE]) using linear mixed models, adjusted for age, sex, education, scanner and total gray matter volume. Lower network size was associated with steeper decline in language (β ± SE = 0.12 ± 0.05, p organized grey matter network was associated with a steeper decline of cognitive functioning, possibly indicating the start of cognitive impairment. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

  1. Effects of a Social Network HIV/STD Prevention Intervention for Men Who Have Sex with Men in Russia and Hungary: A Randomized Controlled Trial

    Science.gov (United States)

    Amirkhanian, Yuri A.; Kelly, Jeffrey A.; Takacs, Judit; McAuliffe, Timothy L.; Kuznetsova, Anna V.; Toth, Tamas P.; Mocsonaki, Laszlo; DiFranceisco, Wayne J.; Meylakhs, Anastasia

    2015-01-01

    Objective To test a novel social network HIV risk reduction intervention for MSM in Russia and Hungary, where same-sex behavior is stigmatized and men may best be reached through their social network connections. Design A 2-arm trial with 18 sociocentric networks of MSM randomized to the social network intervention or standard HIV/STD testing/counseling. Setting St. Petersburg, Russia and Budapest, Hungary. Participants 18 “seeds” from community venues invited the participation of their MSM friends who, in turn, invited their own MSM friends into the study, a process that continued outward until eighteen 3-ring sociocentric networks (mean size=35 members, n=626) were recruited. Intervention Empirically-identified network leaders were trained and guided to convey HIV prevention advice to other network members. Main Outcome and Measures Changes in sexual behavior from baseline to 3- and 12-month followup, with composite HIV/STD incidence measured at 12-months to corroborate behavior changes. Results There were significant reductions between baseline, first followup, and second followup in the intervention versus comparison arm for proportion of men engaging in any unprotected anal intercourse (P=.04); UAI with a nonmain partner (P=.04); and UAI with multiple partners (P=.002). The mean percentage of unprotected AI acts significantly declined (P=.001), as well as the mean number of UAI acts among men who initially had multiple partners (P=.05). Biological HIV/STD incidence was 15% in comparison condition networks and 9% in intervention condition networks. Conclusions Even where same-sex behavior is stigmatized, it is possible to reach MSM and deliver HIV prevention through their social networks. PMID:25565495

  2. P-body proteins regulate transcriptional rewiring to promote DNA replication stress resistance.

    Science.gov (United States)

    Loll-Krippleber, Raphael; Brown, Grant W

    2017-09-15

    mRNA-processing (P-) bodies are cytoplasmic granules that form in eukaryotic cells in response to numerous stresses to serve as sites of degradation and storage of mRNAs. Functional P-bodies are critical for the DNA replication stress response in yeast, yet the repertoire of P-body targets and the mechanisms by which P-bodies promote replication stress resistance are unknown. In this study we identify the complete complement of mRNA targets of P-bodies during replication stress induced by hydroxyurea treatment. The key P-body protein Lsm1 controls the abundance of HHT1, ACF4, ARL3, TMA16, RRS1 and YOX1 mRNAs to prevent their toxic accumulation during replication stress. Accumulation of YOX1 mRNA causes aberrant downregulation of a network of genes critical for DNA replication stress resistance and leads to toxic acetaldehyde accumulation. Our data reveal the scope and the targets of regulation by P-body proteins during the DNA replication stress response.P-bodies form in response to stress and act as sites of mRNA storage and degradation. Here the authors identify the mRNA targets of P-bodies during DNA replication stress, and show that P-body proteins act to prevent toxic accumulation of these target transcripts.

  3. A social network-based intervention stimulating peer influence on children's self-reported water consumption: A randomized control trial.

    Science.gov (United States)

    Smit, Crystal R; de Leeuw, Rebecca N H; Bevelander, Kirsten E; Burk, William J; Buijzen, Moniek

    2016-08-01

    The current pilot study examined the effectiveness of a social network-based intervention using peer influence on self-reported water consumption. A total of 210 children (52% girls; M age = 10.75 ± SD = 0.80) were randomly assigned to either the intervention (n = 106; 52% girls) or control condition (n = 104; 52% girls). In the intervention condition, the most influential children in each classroom were trained to promote water consumption among their peers for eight weeks. The schools in the control condition did not receive any intervention. Water consumption, sugar-sweetened beverage (SSB) consumption, and intentions to drink more water in the near future were assessed by self-report measures before and immediately after the intervention. A repeated measure MANCOVA showed a significant multivariate interaction effect between condition and time (V = 0.07, F(3, 204) = 5.18, p = 0.002, pη(2) = 0.07) on the dependent variables. Further examination revealed significant univariate interaction effects between condition and time on water (p = 0.021) and SSB consumption (p = 0.015) as well as water drinking intentions (p = 0.049). Posthoc analyses showed that children in the intervention condition reported a significant increase in their water consumption (p = 0.018) and a decrease in their SSB consumption (p  0.05). The children who were exposed to the intervention did not report a change in their water drinking intentions over time (p = 0.576) whereas the nonexposed children decreased their intentions (p = 0.026). These findings show promise for a social network-based intervention using peer influence to positively alter consumption behaviors. This RCT was registered in the Australian New Zealand Clinical Trials Registry (ACTRN12614001179628). Study procedures were approved by the Ethics Committee of the Faculty of Social Sciences at Radboud University (ECSW2014-1003-203). Copyright © 2016 Elsevier Ltd. All rights reserved.

  4. Comparison of the efficacy and safety of thrombectomy devices in acute stroke : a network meta-analysis of randomized trials.

    Science.gov (United States)

    Saber, Hamidreza; Rajah, Gary B; Kherallah, Riyad Y; Jadhav, Ashutosh P; Narayanan, Sandra

    2017-12-15

    Mechanical thrombectomy (MT) is increasingly used for large-vessel occlusions (LVO), but randomized clinical trial (RCT) level data with regard to differences in clinical outcomes of MT devices are limited. We conducted a network meta-analysis (NMA) that enables comparison of modern MT devices (Trevo, Solitaire, Aspiration) and strategies (stent retriever vs aspiration) across trials. Relevant RCTs were identified by a systematic review. The efficacy outcome was 90-day functional independence (modified Rankin Scale (mRS) score 0-2). Safety outcomes were 90-day catastrophic outcome (mRS 5-6) and symptomatic intracranial hemorrhage (sICH). Fixed-effect Bayesian NMA was performed to calculate risk estimates and the rank probabilities. In a NMA of six relevant RCTs (SWIFT, TREVO2, EXTEND-IA, SWIFT-PRIME, REVASCAT, THERAPY; total of 871 patients, 472 Solitaire vs medical-only, 108 Aspiration vs medical-only, 178 Trevo vs Merci, and 113 Solitaire vs Merci) with medical-only arm as the reference, Trevo had the greatest functional independence (OR 4.14, 95% credible interval (CrI) 1.41-11.80; top rank probability 92%) followed by Solitaire (OR 2.55, 95% CrI 1.75-3.74; top rank probability 72%). Solitaire and Aspiration devices had the greatest top rank probability with respect to low sICH and catastrophic outcomes (76% and 91%, respectively), but without significant differences between each other. In a separate network of seven RCTs (MR-CLEAN, ESCAPE, EXTEND-IA, SWIFT-PRIME, REVASCAT, THERAPY, ASTER; 1737 patients), first-line stent retriever was associated with a higher top rank probability of functional independence than aspiration (95% vs 54%), with comparable safety outcomes. These findings suggest that Trevo and Solitaire devices are associated with a greater likelihood of functional independence whereas Solitaire and Aspiration devices appear to be safer. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2017. All rights

  5. Critical behavior and correlations on scale-free small-world networks: Application to network design

    Science.gov (United States)

    Ostilli, M.; Ferreira, A. L.; Mendes, J. F. F.

    2011-06-01

    We analyze critical phenomena on networks generated as the union of hidden variable models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small worlds similar to those à la Watts and Strogatz, but with a heterogeneous degree distribution. We prove that the critical behavior (thermal or percolative) remains completely unchanged by the presence of finite loops (or finite clustering). Then, we show that, in large but finite networks, correlations of two given spins may be strong, i.e., approximately power-law-like, at any temperature. Quite interestingly, if γ is the exponent for the power-law distribution of the vertex degree, for γ⩽3 and with or without short-range couplings, such strong correlations persist even in the thermodynamic limit, contradicting the common opinion that, in mean-field models, correlations always disappear in this limit. Finally, we provide the optimal choice of rewiring under which percolation phenomena in the rewired network are best performed, a natural criterion to reach best communication features, at least in noncongested regimes.

  6. Network meta-analysis of randomized trials in multiple myeloma: efficacy and safety in relapsed/refractory patients.

    Science.gov (United States)

    Botta, Cirino; Ciliberto, Domenico; Rossi, Marco; Staropoli, Nicoletta; Cucè, Maria; Galeano, Teresa; Tagliaferri, Pierosandro; Tassone, Pierfrancesco

    2017-02-28

    Despite major therapeutic advancements, multiple myeloma (MM) is still incurable and relapsed/refractory multiple myeloma (RRMM) remains a challenge; the rational choice of the most appropriate regimen in this setting is currently undefined. We performed a systematic review and 2 standard pairwise meta-analyses to evaluate the efficacy of regimens that have been directly compared with bortezomib or immunomodulatory imide drugs (IMiDs) in head-to-head clinical trials and a network meta-analysis (NMA) to determine the relevance of each regimen on the basis of all the available direct and indirect evidence. Sixteen trials were included in the pairwise meta-analyses, and 18 trials were included in the NMA. Pairwise meta-analyses showed that a 3-drug regimen (bortezomib- or IMiD-based) was superior to a 2-drug regimen in progression-free-survival (PFS) and overall response rate (ORR). NMA showed that an IMiD backbone associated with anti-MM monoclonal antibodies (mAbs) (preferably) or proteasome inhibitors had the highest probability of being the most effective regimen with the lowest toxicity. The combination of daratumumab, lenalidomide, and dexamethasone ranked as the first regimen in terms of activity, efficacy, and tolerability according to the average value between surface under the cumulative ranking curve of PFS, overall survival, ORR, complete response rate, and safety. This is the first NMA comparing all currently available regimens evaluated in published randomized trials for the treatment of RRMM, but our results need to be interpreted taking into account differences in their patient populations. Our analysis suggests that IMiDs plus new anti-MM mAb-containing regimens are the most active therapeutic option in RRMM.

  7. Assessing sample representativeness in randomized controlled trials: application to the National Institute of Drug Abuse Clinical Trials Network.

    Science.gov (United States)

    Susukida, Ryoko; Crum, Rosa M; Stuart, Elizabeth A; Ebnesajjad, Cyrus; Mojtabai, Ramin

    2016-07-01

    To compare the characteristics of individuals participating in randomized controlled trials (RCTs) of treatments of substance use disorder (SUD) with individuals receiving treatment in usual care settings, and to provide a summary quantitative measure of differences between characteristics of these two groups of individuals using propensity score methods. Design Analyses using data from RCT samples from the National Institute of Drug Abuse Clinical Trials Network (CTN) and target populations of patients drawn from the Treatment Episodes Data Set-Admissions (TEDS-A). Settings Multiple clinical trial sites and nation-wide usual SUD treatment settings in the United States. A total of 3592 individuals from 10 CTN samples and 1 602 226 individuals selected from TEDS-A between 2001 and 2009. Measurements The propensity scores for enrolling in the RCTs were computed based on the following nine observable characteristics: sex, race/ethnicity, age, education, employment status, marital status, admission to treatment through criminal justice, intravenous drug use and the number of prior treatments. Findings The proportion of those with ≥ 12 years of education and the proportion of those who had full-time jobs were significantly higher among RCT samples than among target populations (in seven and nine trials, respectively, at P difference in the mean propensity scores between the RCTs and the target population was 1.54 standard deviations and was statistically significant at P different from individuals receiving treatment in usual care settings. Notably, RCT participants tend to have more years of education and a greater likelihood of full-time work compared with people receiving care in usual care settings. © 2016 Society for the Study of Addiction.

  8. Integrated Application of Random Forest and Artificial Neural Network Algorithms to Predict Viral Contamination in Coastal Waters

    Science.gov (United States)

    Shamkhali Chenar, S.; Deng, Z.

    2017-12-01

    Pathogenic viruses pose a significant public health threat and economic losses to shellfish industry in the coastal environment. Norovirus is a contagious virus and the leading cause of epidemic gastroenteritis following consumption of oysters harvested from sewage-contaminated waters. While it is challenging to detect noroviruses in coastal waters due to the lack of sensitive and routine diagnostic methods, machine learning techniques are allowing us to prevent or at least reduce the risks by developing effective predictive models. This study attempts to develop an algorithm between historical norovirus outbreak reports and environmental parameters including water temperature, solar radiation, water level, salinity, precipitation, and wind. For this purpose, the Random Forests statistical technique was utilized to select relevant environmental parameters and their various combinations with different time lags controlling the virus distribution in oyster harvesting areas along the Louisiana Coast. An Artificial Neural Networks (ANN) approach was then presented to predict the outbreaks using a final set of input variables. Finally, a sensitivity analysis was conducted to evaluate relative importance and contribution of the input variables to the model output. Findings demonstrated that the developed model was capable of reproducing historical oyster norovirus outbreaks along the Louisiana Coast with the overall accuracy of than 99.83%, demonstrating the efficacy of the model. Moreover, the increase in water temperature, solar radiation, water level, and salinity, and the decrease in wind and rainfall are associated with the reduction in the model-predicted risk of norovirus outbreak according to sensitivity analysis results. In conclusion, the presented machine learning approach provided reliable tools for predicting potential norovirus outbreaks and could be used for early detection of possible outbreaks and reduce the risk of norovirus to public health and the

  9. Automatic detection of anatomical regions in frontal x-ray images: comparing convolutional neural networks to random forest

    Science.gov (United States)

    Olory Agomma, R.; Vázquez, C.; Cresson, T.; De Guise, J.

    2018-02-01

    Most algorithms to detect and identify anatomical structures in medical images require either to be initialized close to the target structure, or to know that the structure is present in the image, or to be trained on a homogeneous database (e.g. all full body or all lower limbs). Detecting these structures when there is no guarantee that the structure is present in the image, or when the image database is heterogeneous (mixed configurations), is a challenge for automatic algorithms. In this work we compared two state-of-the-art machine learning techniques in order to determine which one is the most appropriate for predicting targets locations based on image patches. By knowing the position of thirteen landmarks points, labelled by an expert in EOS frontal radiography, we learn the displacement between salient points detected in the image and these thirteen landmarks. The learning step is carried out with a machine learning approach by exploring two methods: Convolutional Neural Network (CNN) and Random Forest (RF). The automatic detection of the thirteen landmarks points in a new image is then obtained by averaging the positions of each one of these thirteen landmarks estimated from all the salient points in the new image. We respectively obtain for CNN and RF, an average prediction error (both mean and standard deviation in mm) of 29 +/-18 and 30 +/- 21 for the thirteen landmarks points, indicating the approximate location of anatomical regions. On the other hand, the learning time is 9 days for CNN versus 80 minutes for RF. We provide a comparison of the results between the two machine learning approaches.

  10. An Improved Ensemble of Random Vector Functional Link Networks Based on Particle Swarm Optimization with Double Optimization Strategy.

    Science.gov (United States)

    Ling, Qing-Hua; Song, Yu-Qing; Han, Fei; Yang, Dan; Huang, De-Shuang

    2016-01-01

    For ensemble learning, how to select and combine the candidate classifiers are two key issues which influence the performance of the ensemble system dramatically. Random vector functional link networks (RVFL) without direct input-to-output links is one of suitable base-classifiers for ensemble systems because of its fast learning speed, simple structure and good generalization performance. In this paper, to obtain a more compact ensemble system with improved convergence performance, an improved ensemble of RVFL based on attractive and repulsive particle swarm optimization (ARPSO) with double optimization strategy is proposed. In the proposed method, ARPSO is applied to select and combine the candidate RVFL. As for using ARPSO to select the optimal base RVFL, ARPSO considers both the convergence accuracy on the validation data and the diversity of the candidate ensemble system to build the RVFL ensembles. In the process of combining RVFL, the ensemble weights corresponding to the base RVFL are initialized by the minimum norm least-square method and then further optimized by ARPSO. Finally, a few redundant RVFL is pruned, and thus the more compact ensemble of RVFL is obtained. Moreover, in this paper, theoretical analysis and justification on how to prune the base classifiers on classification problem is presented, and a simple and practically feasible strategy for pruning redundant base classifiers on both classification and regression problems is proposed. Since the double optimization is performed on the basis of the single optimization, the ensemble of RVFL built by the proposed method outperforms that built by some single optimization methods. Experiment results on function approximation and classification problems verify that the proposed method could improve its convergence accuracy as well as reduce the complexity of the ensemble system.

  11. Comparing energy sources for surgical ablation of atrial fibrillation: a Bayesian network meta-analysis of randomized, controlled trials.

    Science.gov (United States)

    Phan, Kevin; Xie, Ashleigh; Kumar, Narendra; Wong, Sophia; Medi, Caroline; La Meir, Mark; Yan, Tristan D

    2015-08-01

    Simplified maze procedures involving radiofrequency, cryoenergy and microwave energy sources have been increasingly utilized for surgical treatment of atrial fibrillation as an alternative to the traditional cut-and-sew approach. In the absence of direct comparisons, a Bayesian network meta-analysis is another alternative to assess the relative effect of different treatments, using indirect evidence. A Bayesian meta-analysis of indirect evidence was performed using 16 published randomized trials identified from 6 databases. Rank probability analysis was used to rank each intervention in terms of their probability of having the best outcome. Sinus rhythm prevalence beyond the 12-month follow-up was similar between the cut-and-sew, microwave and radiofrequency approaches, which were all ranked better than cryoablation (respectively, 39, 36, and 25 vs 1%). The cut-and-sew maze was ranked worst in terms of mortality outcomes compared with microwave, radiofrequency and cryoenergy (2 vs 19, 34, and 24%, respectively). The cut-and-sew maze procedure was associated with significantly lower stroke rates compared with microwave ablation [odds ratio <0.01; 95% confidence interval 0.00, 0.82], and ranked the best in terms of pacemaker requirements compared with microwave, radiofrequency and cryoenergy (81 vs 14, and 1, <0.01% respectively). Bayesian rank probability analysis shows that the cut-and-sew approach is associated with the best outcomes in terms of sinus rhythm prevalence and stroke outcomes, and remains the gold standard approach for AF treatment. Given the limitations of indirect comparison analysis, these results should be viewed with caution and not over-interpreted. © The Author 2014. Published by Oxford University Press on behalf of the European Association for Cardio-Thoracic Surgery. All rights reserved.

  12. Networking

    OpenAIRE

    Rauno Lindholm, Daniel; Boisen Devantier, Lykke; Nyborg, Karoline Lykke; Høgsbro, Andreas; Fries, de; Skovlund, Louise

    2016-01-01

    The purpose of this project was to examine what influencing factor that has had an impact on the presumed increasement of the use of networking among academics on the labour market and how it is expressed. On the basis of the influence from globalization on the labour market it can be concluded that the globalization has transformed the labour market into a market based on the organization of networks. In this new organization there is a greater emphasis on employees having social qualificati...

  13. GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

    Energy Technology Data Exchange (ETDEWEB)

    Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

    2008-07-01

    Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)

  14. A mathematical analysis of the effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks.

    Science.gov (United States)

    Siri, Benoît; Berry, Hugues; Cessac, Bruno; Delord, Bruno; Quoy, Mathias

    2008-12-01

    We present a mathematical analysis of the effects of Hebbian learning in random recurrent neural networks, with a generic Hebbian learning rule, including passive forgetting and different timescales, for neuronal activity and learning dynamics. Previous numerical work has reported that Hebbian learning drives the system from chaos to a steady state through a sequence of bifurcations. Here, we interpret these results mathematically and show that these effects, involving a complex coupling between neuronal dynamics and synaptic graph structure, can be analyzed using Jacobian matrices, which introduce both a structural and a dynamical point of view on neural network evolution. Furthermore, we show that sensitivity to a learned pattern is maximal when the largest Lyapunov exponent is close to 0. We discuss how neural networks may take advantage of this regime of high functional interest.

  15. Adjustment of issue positions based on network strategies in a nelection campaign: A two-mode network autoregression model with cross-nested random effects

    NARCIS (Netherlands)

    Kleinnijenhuis, J.; de Nooy, W.

    2013-01-01

    During election campaigns, political parties deliver statements on salient issues in the news media, which are called issue positions. This article conceptualizes issue positions as a valued and longitudinal two-mode network of parties by issues. The network is valued because parties pronounce pro

  16. Adjustment of issue positions based on network strategies in an election campaign: a two-mode network autoregression model with cross-nested random effects

    NARCIS (Netherlands)

    Kleinnijenhuis, J.; de Nooy, W.

    2013-01-01

    During election campaigns, political parties deliver statements on salient issues in the news media, which are called issue positions. This article conceptualizes issue positions as a valued and longitudinal two-mode network of parties by issues. The network is valued because parties pronounce pro

  17. Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps

    Science.gov (United States)

    Zhang, Zhongzhi; Dong, Yuze; Sheng, Yibin

    2015-10-01

    Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm; however, related theoretical results are much less for this dynamical process. In this paper, we present a study of mixed random walks in a family of fractal scale-free networks, where both nearest-neighbor and next-nearest-neighbor jumps are included. We focus on trapping problem in the network family, which is a particular case of random walks with a perfect trap fixed at the central high-degree node. We derive analytical expressions for the average trapping time (ATT), a quantitative indicator measuring the efficiency of the trapping process, by using two different methods, the results of which are consistent with each other. Furthermore, we analytically determine all the eigenvalues and their multiplicities for the fundamental matrix characterizing the dynamical process. Our results show that although next-nearest-neighbor jumps have no effect on the leading scaling of the trapping efficiency, they can strongly affect the prefactor of ATT, providing insight into better understanding of random-walk process in complex systems.

  18. Information transmission on hybrid networks

    Science.gov (United States)

    Chen, Rongbin; Cui, Wei; Pu, Cunlai; Li, Jie; Ji, Bo; Gakis, Konstantinos; Pardalos, Panos M.

    2018-01-01

    Many real-world communication networks often have hybrid nature with both fixed nodes and moving modes, such as the mobile phone networks mainly composed of fixed base stations and mobile phones. In this paper, we discuss the information transmission process on the hybrid networks with both fixed and mobile nodes. The fixed nodes (base stations) are connected as a spatial lattice on the plane forming the information-carrying backbone, while the mobile nodes (users), which are the sources and destinations of information packets, connect to their current nearest fixed nodes respectively to deliver and receive information packets. We observe the phase transition of traffic load in the hybrid network when the packet generation rate goes from below and then above a critical value, which measures the network capacity of packets delivery. We obtain the optimal speed of moving nodes leading to the maximum network capacity. We further improve the network capacity by rewiring the fixed nodes and by considering the current load of fixed nodes during packets transmission. Our purpose is to optimize the network capacity of hybrid networks from the perspective of network science, and provide some insights for the construction of future communication infrastructures.

  19. Role of social environment and social clustering in spread of opinions in coevolving networks.

    Science.gov (United States)

    Malik, Nishant; Mucha, Peter J

    2013-12-01

    Taking a pragmatic approach to the processes involved in the phenomena of collective opinion formation, we investigate two specific modifications to the coevolving network voter model of opinion formation studied by Holme and Newman [Phys. Rev. E 74, 056108 (2006)]. First, we replace the rewiring probability parameter by a distribution of probability of accepting or rejecting opinions between individuals, accounting for heterogeneity and asymmetric influences in relationships between individuals. Second, we modify the rewiring step by a path-length-based preference for rewiring that reinforces local clustering. We have investigated the influences of these modifications on the outcomes of simulations of this model. We found that varying the shape of the distribution of probability of accepting or rejecting opinions can lead to the emergence of two qualitatively distinct final states, one having several isolated connected components each in internal consensus, allowing for the existence of diverse opinions, and the other having a single dominant connected component with each node within that dominant component having the same opinion. Furthermore, more importantly, we found that the initial clustering in the network can also induce similar transitions. Our investigation also indicates that these transitions are governed by a weak and complex dependence on system size. We found that the networks in the final states of the model have rich structural properties including the small world property for some parameter regimes.

  20. Acetyl-CoA carboxylase rewires cancer metabolism to allow cancer cells to survive inhibition of the Warburg effect by cetuximab.

    Science.gov (United States)

    Luo, Jingtao; Hong, Yun; Lu, Yang; Qiu, Songbo; Chaganty, Bharat K R; Zhang, Lun; Wang, Xudong; Li, Qiang; Fan, Zhen

    2017-01-01

    Cetuximab inhibits HIF-1-regulated glycolysis in cancer cells, thereby reversing the Warburg effect and leading to inhibition of cancer cell metabolism. AMP-activated protein kinase (AMPK) is activated after cetuximab treatment, and a sustained AMPK activity is a mechanism contributing to cetuximab resistance. Here, we investigated how acetyl-CoA carboxylase (ACC), a downstream target of AMPK, rewires cancer metabolism in response to cetuximab treatment. We found that introduction of experimental ACC mutants lacking the AMPK phosphorylation sites (ACC1_S79A and ACC2_S212A) into head and neck squamous cell carcinoma (HNSCC) cells protected HNSCC cells from cetuximab-induced growth inhibition. HNSCC cells with acquired cetuximab resistance contained not only high levels of T172-phosphorylated AMPK and S79-phosphorylated ACC1 but also an increased level of total ACC. These findings were corroborated in tumor specimens of HNSCC patients treated with cetuximab. Cetuximab plus TOFA (an allosteric inhibitor of ACC) achieved remarkable growth inhibition of cetuximab-resistant HNSCC xenografts. Our data suggest a novel paradigm in which cetuximab-mediated activation of AMPK and subsequent phosphorylation and inhibition of ACC is followed by a compensatory increase in total ACC, which rewires cancer metabolism from glycolysis-dependent to lipogenesis-dependent. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  1. Rewiring the Glucose Transportation and Central Metabolic Pathways for Overproduction of N-Acetylglucosamine in Bacillus subtilis.

    Science.gov (United States)

    Gu, Yang; Deng, Jieying; Liu, Yanfeng; Li, Jianghua; Shin, Hyun-Dong; Du, Guocheng; Chen, Jian; Liu, Long

    2017-10-01

    N-acetylglucosamine (GlcNAc) is an important amino sugar extensively used in the healthcare field. In a previous study, the recombinant Bacillus subtilis strain BSGN6-P xylA -glmS-pP43NMK-GNA1 (BN0-GNA1) had been constructed for microbial production of GlcNAc by pathway design and modular optimization. Here, the production of GlcNAc is further improved by rewiring both the glucose transportation and central metabolic pathways. First, the phosphotransferase system (PTS) is blocked by deletion of three genes, yyzE (encoding the PTS system transporter subunit IIA YyzE), ypqE (encoding the PTS system transporter subunit IIA YpqE), and ptsG (encoding the PTS system glucose-specific EIICBA component), resulting in 47.6% increase in the GlcNAc titer (from 6.5 ± 0.25 to 9.6 ± 0.16 g L -1 ) in shake flasks. Then, reinforcement of the expression of the glcP and glcK genes and optimization of glucose facilitator proteins are performed to promote glucose import and phosphorylation. Next, the competitive pathways for GlcNAc synthesis, namely glycolysis, peptidoglycan synthesis pathway, pentose phosphate pathway, and tricarboxylic acid cycle, are repressed by initiation codon-optimization strategies, and the GlcNAc titer in shake flasks is improved from 10.8 ± 0.25 to 13.2 ± 0.31 g L -1 . Finally, the GlcNAc titer is further increased to 42.1 ± 1.1 g L -1 in a 3-L fed-batch bioreactor, which is 1.72-fold that of the original strain, BN0-GNA1. This study shows considerably enhanced GlcNAc production, and the metabolic engineering strategy described here will be useful for engineering other prokaryotic microorganisms for the production of GlcNAc and related molecules. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  2. Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices

    Science.gov (United States)

    Michelitsch, T. M.; Collet, B. A.; Riascos, A. P.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

    2017-12-01

    We analyze a Markovian random walk strategy on undirected regular networks involving power matrix functions of the type L\\frac{α{2}} where L indicates a ‘simple’ Laplacian matrix. We refer to such walks as ‘fractional random walks’ with admissible interval 0walk. From these analytical results we establish a generalization of Polya’s recurrence theorem for fractional random walks on d-dimensional infinite lattices: The fractional random walk is transient for dimensions d > α (recurrent for d≤slantα ) of the lattice. As a consequence, for 0walk is transient for all lattice dimensions d=1, 2, .. and in the range 1≤slantα walk is transient only for lattice dimensions d≥slant 3 . The generalization of Polya’s recurrence theorem remains valid for the class of random walks with Lévy flight asymptotics for long-range steps. We also analyze the mean first passage probabilities, mean residence times, mean first passage times and global mean first passage times (Kemeny constant) for the fractional random walk. For an infinite 1D lattice (infinite ring) we obtain for the transient regime 0walk is generated by the non-diagonality of the fractional Laplacian matrix with Lévy-type heavy tailed inverse power law decay for the probability of long-range moves. This non-local and asymptotic behavior of the fractional random walk introduces small-world properties with the emergence of Lévy flights on large (infinite) lattices.

  3. Dynamical mean-field approximation to small-world networks of spiking neurons: From local to global and/or from regular to random couplings

    International Nuclear Information System (INIS)

    Hasegawa, Hideo

    2004-01-01

    By extending a dynamical mean-field approximation previously proposed by the author [H. Hasegawa, Phys. Rev. E 67, 041903 (2003)], we have developed a semianalytical theory which takes into account a wide range of couplings in a small-world network. Our network consists of noisy N-unit FitzHugh-Nagumo neurons with couplings whose average coordination number Z may change from local (Z<< N) to global couplings (Z=N-1) and/or whose concentration of random couplings p is allowed to vary from regular (p=0) to completely random (p=1). We have taken into account three kinds of spatial correlations: the on-site correlation, the correlation for a coupled pair, and that for a pair without direct couplings. The original 2N-dimensional stochastic differential equations are transformed to 13-dimensional deterministic differential equations expressed in terms of means, variances, and covariances of state variables. The synchronization ratio and the firing-time precision for an applied single spike have been discussed as functions of Z and p. Our calculations have shown that with increasing p, the synchronization is worse because of increased heterogeneous couplings, although the average network distance becomes shorter. Results calculated by our theory are in good agreement with those by direct simulations

  4. Rewiring the taste system.

    Science.gov (United States)

    Lee, Hojoon; Macpherson, Lindsey J; Parada, Camilo A; Zuker, Charles S; Ryba, Nicholas J P

    2017-08-17

    In mammals, taste buds typically contain 50-100 tightly packed taste-receptor cells (TRCs), representing all five basic qualities: sweet, sour, bitter, salty and umami. Notably, mature taste cells have life spans of only 5-20 days and, consequently, are constantly replenished by differentiation of taste stem cells. Given the importance of establishing and maintaining appropriate connectivity between TRCs and their partner ganglion neurons (that is, ensuring that a labelled line from sweet TRCs connects to sweet neurons, bitter TRCs to bitter neurons, sour to sour, and so on), we examined how new connections are specified to retain fidelity of signal transmission. Here we show that bitter and sweet TRCs provide instructive signals to bitter and sweet target neurons via different guidance molecules (SEMA3A and SEMA7A). We demonstrate that targeted expression of SEMA3A or SEMA7A in different classes of TRCs produces peripheral taste systems with miswired sweet or bitter cells. Indeed, we engineered mice with bitter neurons that now responded to sweet tastants, sweet neurons that responded to bitter or sweet neurons responding to sour stimuli. Together, these results uncover the basic logic of the wiring of the taste system at the periphery, and illustrate how a labelled-line sensory circuit preserves signalling integrity despite rapid and stochastic turnover of receptor cells.

  5. Vulnerability of complex networks

    Science.gov (United States)

    Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

    2011-01-01

    We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.

  6. Comparative Effectiveness of Nonoperative Treatments for Chronic Calcific Tendinitis of the Shoulder: A Systematic Review and Network Meta-Analysis of Randomized Controlled Trials.

    Science.gov (United States)

    Wu, Yi-Cheng; Tsai, Wen-Chung; Tu, Yu-Kung; Yu, Tung-Yang

    2017-08-01

    To investigate the effectiveness of various nonoperative treatments for chronic calcific tendinitis of the shoulder, a systematic review and network meta-analysis of randomized trials was performed to evaluate changes in pain reduction, functional improvements in patients with calcific tendinitis, and the ratio of complete resolution of calcific deposition. Studies were comprehensively searched, without language restrictions, on PubMed, Embase, Cochrane Controlled Trials Register, the Cochrane, and other databases. The reference lists of articles and reviews were cross-checked for possible studies. Randomized controlled trials from before August 2016 were included. Study selection was conducted by 2 reviewers independently. The quality of studies was assessed and data extracted by 2 independent reviewers. Disagreements were settled by consulting a third reviewer to reach a consensus. Fourteen studies with 1105 participants were included in the network meta-analysis that used a random-effect model to investigate the mean difference of pooled effect sizes of the visual analog scale, Constant-Murley score, and the ratio of complete resolution of calcific deposition on native radiographs. The present network meta-analysis demonstrates that ultrasound-guided needling (UGN), radial extracorporeal shockwave therapy (RSW), and high-energy focused extracorporeal shockwave therapy (H-FSW) alleviate pain and achieve complete resolution of calcium deposition. Compared with low-energy focused extracorporeal shockwave therapy, transcutaneous electrical nerve stimulation, and ultrasound therapy, H-FSW is the best therapy for providing functional recovery. Physicians should consider UGN, RSW, and H-FSW as alternative effective therapies for chronic calcific tendinitis of the shoulder when initial conservative treatment fails. Copyright © 2017 American Congress of Rehabilitation Medicine. Published by Elsevier Inc. All rights reserved.

  7. High electron mobility through the edge states in random networks of c-axis oriented wedge-shaped GaN nanowalls grown by molecular beam epitaxy

    International Nuclear Information System (INIS)

    Bhasker, H. P.; Dhar, S.; Sain, A.; Kesaria, Manoj; Shivaprasad, S. M.

    2012-01-01

    Transport and optical properties of random networks of c-axis oriented wedge-shaped GaN nanowalls grown spontaneously on c-plane sapphire substrates through molecular beam epitaxy are investigated. Our study suggests a one dimensional confinement of carriers at the top edges of these connected nanowalls, which results in a blue shift of the band edge luminescence, a reduction of the exciton-phonon coupling, and an enhancement of the exciton binding energy. Not only that, the yellow luminescence in these samples is found to be completely suppressed even at room temperature. All these changes are highly desirable for the enhancement of the luminescence efficiency of the material. More interestingly, the electron mobility through the network is found to be significantly higher than that is typically observed for GaN epitaxial films. This dramatic improvement is attributed to the transport of electrons through the edge states formed at the top edges of the nanowalls.

  8. Synchronization Algorithm for SDN-controlled All-Optical TDM Switching in a Random Length Ring Network

    DEFF Research Database (Denmark)

    Kamchevska, Valerija; Cristofori, Valentina; Da Ros, Francesco

    2016-01-01

    We propose and demonstrate an algorithm that allows for automatic synchronization of SDN-controlled all-optical TDM switching nodes connected in a ring network. We experimentally show successful WDM-SDM transmission of data bursts between all ring nodes.......We propose and demonstrate an algorithm that allows for automatic synchronization of SDN-controlled all-optical TDM switching nodes connected in a ring network. We experimentally show successful WDM-SDM transmission of data bursts between all ring nodes....

  9. Pilot study of a social network intervention for heroin users in opiate substitution treatment: study protocol for a randomized controlled trial.

    Science.gov (United States)

    Day, Edward; Copello, Alex; Seddon, Jennifer L; Christie, Marilyn; Bamber, Deborah; Powell, Charlotte; George, Sanju; Ball, Andrew; Frew, Emma; Freemantle, Nicholas

    2013-08-19

    Research indicates that 3% of people receiving opiate substitution treatment (OST) in the UK manage to achieve abstinence from all prescribed and illicit drugs within 3 years of commencing treatment, and there is concern that treatment services have become skilled at engaging people but not at helping them to enter a stage of recovery and drug abstinence. The National Treatment Agency for Substance Misuse recommends the involvement of families and wider social networks in supporting drug users' psychological treatment, and this pilot randomized controlled trial aims to evaluate the impact of a social network-focused intervention for patients receiving OST. In this two-site, early phase, randomized controlled trial, a total of 120 patients receiving OST will be recruited and randomized to receive one of three treatments: 1) Brief Social Behavior and Network Therapy (B-SBNT), 2) Personal Goal Setting (PGS) or 3) treatment as usual. Randomization will take place following baseline assessment. Participants allocated to receive B-SBNT or PGS will continue to receive the same treatment that is routinely provided by drug treatment services, plus four additional sessions of either intervention. Outcomes will be assessed at baseline, 3 and 12 months. The primary outcome will be assessment of illicit heroin use, measured by both urinary analysis and self-report. Secondary outcomes involve assessment of dependence, psychological symptoms, social satisfaction, motivation to change, quality of life and therapeutic engagement. Family members (n = 120) of patients involved in the trial will also be assessed to measure the level of symptoms, coping and the impact of the addiction problem on the family member at baseline, 3 and 12 months. This study will provide experimental data regarding the feasibility and efficacy of implementing a social network intervention within routine drug treatment services in the UK National Health Service. The study will explore the impact of the

  10. A Simulation Study: The Impact of Random and Realistic Mobility Models on the Performance of Bypass-AODV in Ad Hoc Wireless Networks

    Directory of Open Access Journals (Sweden)

    Baroudi Uthman

    2010-01-01

    Full Text Available To bring VANET into reality, it is crucial to devise routing protocols that can exploit the inherited characteristics of VANET environment to enhance the performance of the running applications. Previous studies have shown that a certain routing protocol behaves differently under different presumed mobility patterns. Bypass-AODV is a new optimization of the AODV routing protocol for mobile ad-hoc networks. It is proposed as a local recovery mechanism to enhance the performance of the AODV routing protocol. It shows outstanding performance under the Random Waypoint mobility model compared with AODV. However, Random Waypoint is a simple model that may be applicable to some scenarios but it is not sufficient to capture some important mobility characteristics of scenarios where VANETs are deployed. In this paper, we will investigate the performance of Bypass-AODV under a wide range of mobility models including other random mobility models, group mobility models, and vehicular mobility models. Simulation results show an interesting feature that is the insensitivity of Bypass-AODV to the selected random mobility model, and it has a clear performance improvement compared to AODV. For group mobility model, both protocols show a comparable performance, but for vehicular mobility models, Bypass-AODV suffers from performance degradation in high-speed conditions.

  11. Optimal topologies for maximizing network transmission capacity

    Science.gov (United States)

    Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

    2018-04-01

    It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

  12. A network meta-analysis on randomized trials focusing on the preventive effect of statins on contrast-induced nephropathy

    DEFF Research Database (Denmark)

    Peruzzi, Mariangela; De Luca, Leonardo; Thomsen, Henrik S

    2014-01-01

    -analysis. Randomized trials focusing on statins were searched and pooled with random-effect odds ratios. A total of 14 trials (6,160 patients) were included, focusing on atorvastatin (high/low dose), rosuvastatin (high dose), simvastatin (high/low dose), and placebo or no statin therapy before contrast administration....... The risk of contrast-induced nephropathy was reduced by atorvastatin high dose and rosuvastatin high dose, with no difference between these two agents. Results for atorvastatin low dose and simvastatin (high/low dose) in comparison to placebo were inconclusive. Atorvastatin and rosuvastatin administered...

  13. Growth and structural discrimination of cortical neurons on randomly oriented and vertically aligned dense carbon nanotube networks

    Directory of Open Access Journals (Sweden)

    Christoph Nick

    2014-09-01

    Full Text Available The growth of cortical neurons on three dimensional structures of spatially defined (structured randomly oriented, as well as on vertically aligned, carbon nanotubes (CNT is studied. Cortical neurons are attracted towards both types of CNT nano-architectures. For both, neurons form clusters in close vicinity to the CNT structures whereupon the randomly oriented CNTs are more closely colonised than the CNT pillars. Neurons develop communication paths via neurites on both nanoarchitectures. These neuron cells attach preferentially on the CNT sidewalls of the vertically aligned CNT architecture instead than onto the tips of the individual CNT pillars.

  14. Very late stent thrombosis with second generation drug eluting stents compared to bare metal stents: Network meta-analysis of randomized primary percutaneous coronary intervention trials.

    Science.gov (United States)

    Philip, Femi; Stewart, Susan; Southard, Jeffrey A

    2016-07-01

    The relative safety of drug-eluting stents (DES) and bare-metal stents (BMS) in primary percutaneous coronary intervention (PPCI) in ST elevation myocardial infarction (STEMI) continues to be debated. The long-term clinical outcomes between second generation DES and BMS for primary percutaneous coronary intervention (PCI) using network meta-analysis were compared. Randomized controlled trials comparing stent types (first generation DES, second generation DES, or BMS) were considered for inclusion. A search strategy used Medline, Embase, Cochrane databases, and proceedings of international meetings. Information about study design, inclusion criteria, and sample characteristics were extracted. Network meta-analysis was used to pool direct (comparison of second generation DES to BMS) and indirect evidence (first generation DES with BMS and second generation DES) from the randomized trials. Twelve trials comparing all stents types including 9,673 patients randomly assigned to treatment groups were analyzed. Second generation DES was associated with significantly lower incidence of definite or probable ST (OR 0.59, 95% CI 0.39-0.89), MI (OR 0.59, 95% CI 0.39-0.89), and TVR at 3 years (OR 0.50: 95% CI 0.31-0.81) compared with BMS. In addition, there was a significantly lower incidence of MACE with second generation DES versus BMS (OR 0.54, 95% CI 0.34-0.74) at 3 years. These were driven by a higher rate of TVR, MI and stent thrombosis in the BMS group at 3 years. There was a non-significant reduction in the overall and cardiac mortality [OR 0.83, 95% CI (0.60-1.14), OR 0.88, 95% CI (0.6-1.28)] with the use of second generation DES versus BMS at 3 years. Network meta-analysis of randomized trials of primary PCI demonstrated lower incidence of MACE, MI, TVR, and stent thrombosis with second generation DES compared with BMS. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

  15. On the Packet Delay Characteristics for Serially-Connected Links using Random Linear Network Coding with and without Recoding

    DEFF Research Database (Denmark)

    Tömösközi, Máté; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2015-01-01

    Low latency and high reliability is a critical characteristics of many wireless use cases, such as real–time video surveillance. In a dense network the best way to resolve such problems is by utilizing the fastest and most reliable connection to the destination. Classical solutions, such as Reed–...

  16. A network meta-analysis of randomized controlled trials for comparing the effectiveness and safety profile of treatments with marketing authorization for relapsing multiple sclerosis.

    Science.gov (United States)

    Hadjigeorgiou, G M; Doxani, C; Miligkos, M; Ziakas, P; Bakalos, G; Papadimitriou, D; Mprotsis, T; Grigoriadis, N; Zintzaras, E

    2013-12-01

    The relative effectiveness and safety profile of the treatments with marketing authorization for relapsing multiple sclerosis (MS) are not well known because randomized controlled trials with head-to-head comparisons between these treatments do not exist. Thus, a network of multiple-treatments meta-analysis was performed using four clinical outcomes: 'patients free of relapse', 'patients without disease progression', 'patients without MRI progression' and 'patients with adverse events'. Randomized controlled trials (RCTs) on MS were systematically searched in PubMed and Cochrane Central Register of Controlled Trial. The network analysis performed pairwise comparisons between the marketed treatments (Betaferon 250mcg, Avonex 30mcg, Rebif 44mcg, Rebif 22mcg, Aubagio 7 mg, Aubagio 14 mg, Copaxone 20 mg, Tysabri 300 mg, Gilenya 0·5 mg and Novantrone 12 mg/m(2)) using direct and indirect analyses. The analysis included 48 articles, involving 20 455 patients with MS. The direct analysis showed better response for more than one outcome for Gilenya compared with Avonex ('patients free of relapse' and 'patients without MRI progression') and for Betaferon compared with Avonex ('patients without disease progression' and 'patients without MRI progression'). The indirect analysis indicated that Tysabri may have better relative effectiveness compared with the other treatments for two outcomes: 'patients free of relapse' and 'patients without MRI progression'. Regarding 'patients with adverse events', no data were available for all comparisons to make fair inferences. This was an attempt, for the first time, to compare the efficacy and safety profile of existing approved treatments for relapsing MS. Although some treatments have shown better response, the results of the network analysis should be interpreted with caution because of the lack of RCTs with head-to-head comparisons between treatments. © 2013 John Wiley & Sons Ltd.

  17. Dynamic Evolution Model Based on Social Network Services

    Science.gov (United States)

    Xiong, Xi; Gou, Zhi-Jian; Zhang, Shi-Bin; Zhao, Wen

    2013-11-01

    Based on the analysis of evolutionary characteristics of public opinion in social networking services (SNS), in the paper we propose a dynamic evolution model, in which opinions are coupled with topology. This model shows the clustering phenomenon of opinions in dynamic network evolution. The simulation results show that the model can fit the data from a social network site. The dynamic evolution of networks accelerates the opinion, separation and aggregation. The scale and the number of clusters are influenced by confidence limit and rewiring probability. Dynamic changes of the topology reduce the number of isolated nodes, while the increased confidence limit allows nodes to communicate more sufficiently. The two effects make the distribution of opinion more neutral. The dynamic evolution of networks generates central clusters with high connectivity and high betweenness, which make it difficult to control public opinions in SNS.

  18. Event-Triggered Fault Estimation for Stochastic Systems over Multi-Hop Relay Networks with Randomly Occurring Sensor Nonlinearities and Packet Dropouts.

    Science.gov (United States)

    Li, Yunji; Peng, Li

    2018-02-28

    Wireless sensors have many new applications where remote estimation is essential. Considering that a remote estimator is located far away from the process and the wireless transmission distance of sensor nodes is limited, sensor nodes always forward data packets to the remote estimator through a series of relays over a multi-hop link. In this paper, we consider a network with sensor nodes and relay nodes where the relay nodes can forward the estimated values to the remote estimator. An event-triggered remote estimator of state and fault with the corresponding data-forwarding scheme is investigated for stochastic systems subject to both randomly occurring nonlinearity and randomly occurring packet dropouts governed by Bernoulli-distributed sequences to achieve a trade-off between estimation accuracy and energy consumption. Recursive Riccati-like matrix equations are established to calculate the estimator gain to minimize an upper bound of the estimator error covariance. Subsequently, a sufficient condition and data-forwarding scheme are presented under which the error covariance is mean-square bounded in the multi-hop links with random packet dropouts. Furthermore, implementation issues of the theoretical results are discussed where a new data-forwarding communication protocol is designed. Finally, the effectiveness of the proposed algorithms and communication protocol are extensively evaluated using an experimental platform that was established for performance evaluation with a sensor and two relay nodes.

  19. Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

    International Nuclear Information System (INIS)

    Yang Hongyong; Lu Lan; Cao Kecai; Zhang Siying

    2010-01-01

    In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration. (interdisciplinary physics and related areas of science and technology)

  20. Systematic network assessment of the carcinogenic activities of cadmium

    International Nuclear Information System (INIS)

    Chen, Peizhan; Duan, Xiaohua; Li, Mian; Huang, Chao; Li, Jingquan; Chu, Ruiai; Ying, Hao; Song, Haiyun; Jia, Xudong; Ba, Qian; Wang, Hui

    2016-01-01

    Cadmium has been defined as type I carcinogen for humans, but the underlying mechanisms of its carcinogenic activity and its influence on protein-protein interactions in cells are not fully elucidated. The aim of the current study was to evaluate, systematically, the carcinogenic activity of cadmium with systems biology approaches. From a literature search of 209 studies that performed with cellular models, 208 proteins influenced by cadmium exposure were identified. All of these were assessed by Western blotting and were recognized as key nodes in network analyses. The protein-protein functional interaction networks were constructed with NetBox software and visualized with Cytoscape software. These cadmium-rewired genes were used to construct a scale-free, highly connected biological protein interaction network with 850 nodes and 8770 edges. Of the network, nine key modules were identified and 60 key signaling pathways, including the estrogen, RAS, PI3K-Akt, NF-κB, HIF-1α, Jak-STAT, and TGF-β signaling pathways, were significantly enriched. With breast cancer, colorectal and prostate cancer cellular models, we validated the key node genes in the network that had been previously reported or inferred form the network by Western blotting methods, including STAT3, JNK, p38, SMAD2/3, P65, AKT1, and HIF-1α. These results suggested the established network was robust and provided a systematic view of the carcinogenic activities of cadmium in human. - Highlights: • A cadmium-influenced network with 850 nodes and 8770 edges was established. • The cadmium-rewired gene network was scale-free and highly connected. • Nine modules were identified, and 60 key signaling pathways related to cadmium-induced carcinogenesis were found. • Key mediators in the network were validated in multiple cellular models.

  1. Systematic network assessment of the carcinogenic activities of cadmium

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Peizhan; Duan, Xiaohua; Li, Mian; Huang, Chao [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Li, Jingquan; Chu, Ruiai; Ying, Hao; Song, Haiyun [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); Jia, Xudong [Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); Ba, Qian, E-mail: qba@sibs.ac.cn [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); Wang, Hui, E-mail: huiwang@sibs.ac.cn [Key Laboratory of Food Safety Research, Institute for Nutritional Sciences, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai (China); Key Laboratory of Food Safety Risk Assessment, Ministry of Health, Beijing (China); School of Life Science and Technology, ShanghaiTech University, Shanghai (China)

    2016-11-01

    Cadmium has been defined as type I carcinogen for humans, but the underlying mechanisms of its carcinogenic activity and its influence on protein-protein interactions in cells are not fully elucidated. The aim of the current study was to evaluate, systematically, the carcinogenic activity of cadmium with systems biology approaches. From a literature search of 209 studies that performed with cellular models, 208 proteins influenced by cadmium exposure were identified. All of these were assessed by Western blotting and were recognized as key nodes in network analyses. The protein-protein functional interaction networks were constructed with NetBox software and visualized with Cytoscape software. These cadmium-rewired genes were used to construct a scale-free, highly connected biological protein interaction network with 850 nodes and 8770 edges. Of the network, nine key modules were identified and 60 key signaling pathways, including the estrogen, RAS, PI3K-Akt, NF-κB, HIF-1α, Jak-STAT, and TGF-β signaling pathways, were significantly enriched. With breast cancer, colorectal and prostate cancer cellular models, we validated the key node genes in the network that had been previously reported or inferred form the network by Western blotting methods, including STAT3, JNK, p38, SMAD2/3, P65, AKT1, and HIF-1α. These results suggested the established network was robust and provided a systematic view of the carcinogenic activities of cadmium in human. - Highlights: • A cadmium-influenced network with 850 nodes and 8770 edges was established. • The cadmium-rewired gene network was scale-free and highly connected. • Nine modules were identified, and 60 key signaling pathways related to cadmium-induced carcinogenesis were found. • Key mediators in the network were validated in multiple cellular models.

  2. Modeling Network Interdiction Tasks

    Science.gov (United States)

    2015-09-17

    118 xiii Table Page 36 Computation times for weighted, 100-node random networks for GAND Approach testing in Python ...in Python . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 38 Accuracy measures for weighted, 100-node random networks for GAND...networks [15:p. 1]. A common approach to modeling network interdiction is to formulate the problem in terms of a two-stage strategic game between two

  3. Randomness-Based Scale-Chromatic Image Analysis for Interactive Mapping on Satellite-Roadway-Vehicle Network

    Directory of Open Access Journals (Sweden)

    Kohji Kamejima

    2007-08-01

    Full Text Available A new framework is presented for integrating satellite/avionics sensors with onboard vision to support information intensive maneuvering. Real time bindings of the bird's eye observation and the driver's view via GPS provides \\textit{as-is} basis for perception and decision. Randomness-based roadway pattern model is implemented by fractal coding scheme associating bird's eye and frontal views. The feasibility of the framework with resquirements for vison system is discussed through concept modeling and experimental studies.

  4. Randomness-Based Scale-Chromatic Image Analysis for Interactive Mapping on Satellite-Roadway-Vehicle Network

    Directory of Open Access Journals (Sweden)

    Kohji Kamejima

    2007-08-01

    Full Text Available A new framework is presented for integrating satellite/avionics sensors with onboard vision to support information intensive maneuvering. Real time bindings of the bird's eye observation and the driver's view via GPS provides extit{as-is} basis for perception and decision. Randomness-based roadway pattern model is implemented by fractal coding scheme associating bird's eye and frontal views. The feasibility of the framework with resquirements for vison system is discussed through concept modeling and experimental studies.

  5. Network maintenance

    CERN Multimedia

    GS Department

    2009-01-01

    A site-wide network maintenance operation has been scheduled for Saturday 28 February. Most of the network devices of the general purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites throughout the day. This upgrade will not affect the Computer Centre itself, Building 613, the Technical Network and the LHC experiments, dedicated networks at the pits. For further details of this intervention, please contact Netops by phone 74927 or e-mail mailto:Netops@cern.ch. IT/CS Group

  6. Network maintenance

    CERN Multimedia

    IT Department

    2009-01-01

    A site wide network maintenance has been scheduled for Saturday 28 February. Most of the network devices of the General Purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites along this day. This upgrade will not affect: the Computer centre itself, building 613, the Technical Network and the LHC experiments dedicated networks at the pits. Should you need more details on this intervention, please contact Netops by phone 74927 or email mailto:Netops@cern.ch. IT/CS Group

  7. Competing of Sznajd and voter dynamics in the Watts-Strogatz network

    OpenAIRE

    Rybak, Marcin; Kulakowski, Krzysztof

    2013-01-01

    We investigate the Watts-Strogatz network with the clustering coefficient C dependent on the rewiring probability. The network is an area of two opposite contact processes, where nodes can be in two states, S or D. One of the processes is governed by the Sznajd dynamics: if there are two connected nodes in D-state, all their neighbors become D with probability p. For the opposite process it is sufficient to have only one neighbor in state S; this transition occurs with probability 1. The conc...

  8. Potts Model in One-Dimension on Directed Small-World Networks

    Science.gov (United States)

    Aquino, Édio O.; Lima, F. W. S.; Araújo, Ascânio D.; Costa Filho, Raimundo N.

    2018-06-01

    The critical properties of the Potts model with q=3 and 8 states in one-dimension on directed small-world networks are investigated. This disordered system is simulated by updating it with the Monte Carlo heat bath algorithm. The Potts model on these directed small-world networks presents in fact a second-order phase transition with a new set of critical exponents for q=3 considering a rewiring probability p=0.1. For q=8 the system exhibits only a first-order phase transition independent of p.

  9. Small-world networks exhibit pronounced intermittent synchronization

    Science.gov (United States)

    Choudhary, Anshul; Mitra, Chiranjit; Kohar, Vivek; Sinha, Sudeshna; Kurths, Jürgen

    2017-11-01

    We report the phenomenon of temporally intermittently synchronized and desynchronized dynamics in Watts-Strogatz networks of chaotic Rössler oscillators. We consider topologies for which the master stability function (MSF) predicts stable synchronized behaviour, as the rewiring probability (p) is tuned from 0 to 1. MSF essentially utilizes the largest non-zero Lyapunov exponent transversal to the synchronization manifold in making stability considerations, thereby ignoring the other Lyapunov exponents. However, for an N-node networked dynamical system, we observe that the difference in its Lyapunov spectra (corresponding to the N - 1 directions transversal to the synchronization manifold) is crucial and serves as an indicator of the presence of intermittently synchronized behaviour. In addition to the linear stability-based (MSF) analysis, we further provide global stability estimate in terms of the fraction of state-space volume shared by the intermittently synchronized state, as p is varied from 0 to 1. This fraction becomes appreciably large in the small-world regime, which is surprising, since this limit has been otherwise considered optimal for synchronized dynamics. Finally, we characterize the nature of the observed intermittency and its dominance in state-space as network rewiring probability (p) is varied.

  10. Stability Analysis of Networked Control Systems with Random Time Delays and Packet Dropouts Modeled by Markov Chains

    Directory of Open Access Journals (Sweden)

    Li Qiu

    2013-01-01

    unified Markov jump model. The random time delays and packet dropouts existed in feedback communication link are modeled by two independent Markov chains; the resulting closed-loop system is described by a new Markovian jump linear system (MJLS with Markov delays. Sufficient conditions of the stochastic stability for NCSs is obtained by constructing a novel Lyapunov functional, and the mode-dependent output feedback controller design method is presented based on linear matrix inequality (LMI technique. A numerical example is given to illustrate the effectiveness of the proposed method.

  11. Observer-Based Controller Design for a Class of Nonlinear Networked Control Systems with Random Time-Delays Modeled by Markov Chains

    Directory of Open Access Journals (Sweden)

    Yanfeng Wang

    2017-01-01

    Full Text Available This paper investigates the observer-based controller design problem for a class of nonlinear networked control systems with random time-delays. The nonlinearity is assumed to satisfy a global Lipschitz condition and two dependent Markov chains are employed to describe the time-delay from sensor to controller (S-C delay and the time-delay from controller to actuator (C-A delay, respectively. The transition probabilities of S-C delay and C-A delay are both assumed to be partly inaccessible. Sufficient conditions on the stochastic stability for the closed-loop systems are obtained by constructing proper Lyapunov functional. The methods of calculating the controller and the observer gain matrix are also given. Two numerical examples are used to illustrate the effectiveness of the proposed method.

  12. Application of a random network with a variable geometry of links to the kinetics of drug elimination in healthy and diseased livers

    Science.gov (United States)

    Chelminiak, P.; Dixon, J. M.; Tuszyński, J. A.; Marsh, R. E.

    2006-05-01

    This paper discusses an application of a random network with a variable number of links and traps to the elimination of drug molecules from the body by the liver. The nodes and links represent the transport vessels, and the traps represent liver cells with metabolic enzymes that eliminate drug molecules. By varying the number and configuration of links and nodes, different disease states of the liver related to vascular damage have been simulated, and the effects on the rate of elimination of a drug have been investigated. Results of numerical simulations show the prevalence of exponential decay curves with rates that depend on the concentration of links. In the case of fractal lattices at the percolation threshold, we find that the decay of the concentration is described by exponential functions for high trap concentrations but transitions to stretched exponential behavior at low trap concentrations.

  13. Efficacy of Supplementation with B Vitamins for Stroke Prevention: A Network Meta-Analysis of Randomized Controlled Trials.

    Science.gov (United States)

    Dong, Hongli; Pi, Fuhua; Ding, Zan; Chen, Wei; Pang, Shaojie; Dong, Wenya; Zhang, Qingying

    2015-01-01

    Supplementation with B vitamins for stroke prevention has been evaluated over the years, but which combination of B vitamins is optimal for stroke prevention is unclear. We performed a network meta-analysis to assess the impact of different combinations of B vitamins on risk of stroke. A total of 17 trials (86 393 patients) comparing 7 treatment strategies and placebo were included. A network meta-analysis combined all available direct and indirect treatment comparisons to evaluate the efficacy of B vitamin supplementation for all interventions. B vitamin supplementation was associated with reduced risk of stroke and cerebral hemorrhage. The risk of stroke was lower with folic acid plus vitamin B6 as compared with folic acid plus vitamin B12 and was lower with folic acid plus vitamin B6 plus vitamin B12 as compared with placebo or folic acid plus vitamin B12. The treatments ranked in order of efficacy for stroke, from higher to lower, were folic acid plus vitamin B6 > folic acid > folic acid plus vitamin B6 plus vitamin B12 > vitamin B6 plus vitamin B12 > niacin > vitamin B6 > placebo > folic acid plus vitamin B12. B vitamin supplementation was associated with reduced risk of stroke; different B vitamins and their combined treatments had different efficacy on stroke prevention. Folic acid plus vitamin B6 might be the optimal therapy for stroke prevention. Folic acid and vitamin B6 were both valuable for stroke prevention. The efficacy of vitamin B12 remains to be studied.

  14. Enabling dynamic network analysis through visualization in TVNViewer

    Directory of Open Access Journals (Sweden)

    Curtis Ross E

    2012-08-01

    Full Text Available Abstract Background Many biological processes are context-dependent or temporally specific. As a result, relationships between molecular constituents evolve across time and environments. While cutting-edge machine learning techniques can recover these networks, exploring and interpreting the rewiring behavior is challenging. Information visualization shines in this type of exploratory analysis, motivating the development ofTVNViewer (http://sailing.cs.cmu.edu/tvnviewer, a visualization tool for dynamic network analysis. Results In this paper, we demonstrate visualization techniques for dynamic network analysis by using TVNViewer to analyze yeast cell cycle and breast cancer progression datasets. Conclusions TVNViewer is a powerful new visualization tool for the analysis of biological networks that change across time or space.

  15. Enabling dynamic network analysis through visualization in TVNViewer

    Science.gov (United States)

    2012-01-01

    Background Many biological processes are context-dependent or temporally specific. As a result, relationships between molecular constituents evolve across time and environments. While cutting-edge machine learning techniques can recover these networks, exploring and interpreting the rewiring behavior is challenging. Information visualization shines in this type of exploratory analysis, motivating the development ofTVNViewer (http://sailing.cs.cmu.edu/tvnviewer), a visualization tool for dynamic network analysis. Results In this paper, we demonstrate visualization techniques for dynamic network analysis by using TVNViewer to analyze yeast cell cycle and breast cancer progression datasets. Conclusions TVNViewer is a powerful new visualization tool for the analysis of biological networks that change across time or space. PMID:22897913

  16. Rewiring the reductive tricarboxylic acid pathway and L-malate transport pathway of Aspergillus oryzae for overproduction of L-malate.

    Science.gov (United States)

    Liu, Jingjing; Xie, Zhipeng; Shin, Hyun-Dong; Li, Jianghua; Du, Guocheng; Chen, Jian; Liu, Long

    2017-07-10

    Aspergillus oryzae finds wide application in the food, feed, and wine industries, and is an excellent cell factory platform for production of organic acids. In this work, we achieved the overproduction of L-malate by rewiring the reductive tricarboxylic acid (rTCA) pathway and L-malate transport pathway of A. oryzae NRRL 3488. First, overexpression of native pyruvate carboxylase and malate dehydrogenase in the rTCA pathway improved the L-malate titer from 26.1gL -1 to 42.3gL -1 in shake flask culture. Then, the oxaloacetate anaplerotic reaction was constructed by heterologous expression of phosphoenolpyruvate carboxykinase and phosphoenolpyruvate carboxylase from Escherichia coli, increasing the L-malate titer to 58.5gL -1 . Next, the export of L-malate from the cytoplasm to the external medium was strengthened by overexpression of a C4-dicarboxylate transporter gene from A. oryzae and an L-malate permease gene from Schizosaccharomyces pombe, improving the L-malate titer from 58.5gL -1 to 89.5gL -1 . Lastly, guided by transcription analysis of the expression profile of key genes related to L-malate synthesis, the 6-phosphofructokinase encoded by the pfk gene was identified as a potential limiting step for L-malate synthesis. Overexpression of pfk with the strong sodM promoter increased the L-malate titer to 93.2gL -1 . The final engineered A. oryzae strain produced 165gL -1 L-malate with a productivity of 1.38gL -1 h -1 in 3-L fed-batch culture. Overall, we constructed an efficient L-malate producer by rewiring the rTCA pathway and L-malate transport pathway of A. oryzae NRRL 3488, and the engineering strategy adopted here may be useful for the construction of A. oryzae cell factories to produce other organic acids. Copyright © 2017 Elsevier B.V. All rights reserved.

  17. Different types of mesh fixation for laparoscopic repair of inguinal hernia: A protocol for systematic review and network meta-analysis with randomized controlled trials.

    Science.gov (United States)

    Wei, Kongyuan; Lu, Cuncun; Ge, Long; Pan, Bei; Yang, Huan; Tian, Jinhui; Cao, Nong

    2018-04-01

    Laparoscopic inguinal hernia repair has become a valid option for repair of an inguinal hernia. Due to there are several types of mesh fixation for laparoscopic repair of inguinal hernia. The study aims to assess and compare the efficacy of different types of mesh fixation for laparoscopic repair of inguinal hernia using network meta-analysis. We will systematically search PubMed, EMBASE the Cochrane library, and Chinese Biomedical Literature Database from their inception to March 2018. Randomized controlled trials (RCTs) that compared the effect of different types of mesh fixation for laparoscopic inguinal hernia repair will be included. The primary outcomes are chronic groin pain, incidence risk of hernia recurrence, and complications. Risk of bias assessment of the included RCTs will be conducted using to Cochrane risk of bias tool. A network meta-analysis will be performed using WinBUGS 1.4.3 software and the result figures will be generated using R x64 3.1.2 software and STATA V.12.0 software. Grading of Recommendations Assessment, Development and Evaluation (GRADE) will be used to assess the quality of evidence. The results of this study will be published in a peer-reviewed journal. Our study will generate evidence of laparoscopic repair of mesh fixation for adult patients with inguinal hernia and provide suggestions for clinical practice or guideline.

  18. Efficacy of Supplementation with B Vitamins for Stroke Prevention: A Network Meta-Analysis of Randomized Controlled Trials.

    Directory of Open Access Journals (Sweden)

    Hongli Dong

    Full Text Available Supplementation with B vitamins for stroke prevention has been evaluated over the years, but which combination of B vitamins is optimal for stroke prevention is unclear. We performed a network meta-analysis to assess the impact of different combinations of B vitamins on risk of stroke.A total of 17 trials (86 393 patients comparing 7 treatment strategies and placebo were included. A network meta-analysis combined all available direct and indirect treatment comparisons to evaluate the efficacy of B vitamin supplementation for all interventions.B vitamin supplementation was associated with reduced risk of stroke and cerebral hemorrhage. The risk of stroke was lower with folic acid plus vitamin B6 as compared with folic acid plus vitamin B12 and was lower with folic acid plus vitamin B6 plus vitamin B12 as compared with placebo or folic acid plus vitamin B12. The treatments ranked in order of efficacy for stroke, from higher to lower, were folic acid plus vitamin B6 > folic acid > folic acid plus vitamin B6 plus vitamin B12 > vitamin B6 plus vitamin B12 > niacin > vitamin B6 > placebo > folic acid plus vitamin B12.B vitamin supplementation was associated with reduced risk of stroke; different B vitamins and their combined treatments had different efficacy on stroke prevention. Folic acid plus vitamin B6 might be the optimal therapy for stroke prevention. Folic acid and vitamin B6 were both valuable for stroke prevention. The efficacy of vitamin B12 remains to be studied.

  19. A distance constrained synaptic plasticity model of C. elegans neuronal network

    Science.gov (United States)

    Badhwar, Rahul; Bagler, Ganesh

    2017-03-01

    Brain research has been driven by enquiry for principles of brain structure organization and its control mechanisms. The neuronal wiring map of C. elegans, the only complete connectome available till date, presents an incredible opportunity to learn basic governing principles that drive structure and function of its neuronal architecture. Despite its apparently simple nervous system, C. elegans is known to possess complex functions. The nervous system forms an important underlying framework which specifies phenotypic features associated to sensation, movement, conditioning and memory. In this study, with the help of graph theoretical models, we investigated the C. elegans neuronal network to identify network features that are critical for its control. The 'driver neurons' are associated with important biological functions such as reproduction, signalling processes and anatomical structural development. We created 1D and 2D network models of C. elegans neuronal system to probe the role of features that confer controllability and small world nature. The simple 1D ring model is critically poised for the number of feed forward motifs, neuronal clustering and characteristic path-length in response to synaptic rewiring, indicating optimal rewiring. Using empirically observed distance constraint in the neuronal network as a guiding principle, we created a distance constrained synaptic plasticity model that simultaneously explains small world nature, saturation of feed forward motifs as well as observed number of driver neurons. The distance constrained model suggests optimum long distance synaptic connections as a key feature specifying control of the network.

  20. Optimal network structure to induce the maximal small-world effect

    International Nuclear Information System (INIS)

    Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

    2014-01-01

    In this paper, the general efficiency, which is the average of the global efficiency and the local efficiency, is defined to measure the communication efficiency of a network. The increasing ratio of the general efficiency of a small-world network relative to that of the corresponding regular network is used to measure the small-world effect quantitatively. The more considerable the small-world effect, the higher the general efficiency of a network with a certain cost is. It is shown that the small-world effect increases monotonically with the increase of the vertex number. The optimal rewiring probability to induce the best small-world effect is approximately 0.02 and the optimal average connection probability decreases monotonically with the increase of the vertex number. Therefore, the optimal network structure to induce the maximal small-world effect is the structure with the large vertex number (> 500), the small rewiring probability (≍ 0.02) and the small average connection probability (< 0.1). Many previous research results support our results. (interdisciplinary physics and related areas of science and technology)

  1. A Multicomponent Exercise Intervention that Reverses Frailty and Improves Cognition, Emotion, and Social Networking in the Community-Dwelling Frail Elderly: A Randomized Clinical Trial.

    Science.gov (United States)

    Tarazona-Santabalbina, Francisco José; Gómez-Cabrera, Mari Carmen; Pérez-Ros, Pilar; Martínez-Arnau, Francisco Miguel; Cabo, Helena; Tsaparas, Konstantina; Salvador-Pascual, Andrea; Rodriguez-Mañas, Leocadio; Viña, José

    2016-05-01

    Frailty can be an important clinical target to reduce rates of disability. To ascertain if a supervised-facility multicomponent exercise program (MEP) when performed by frail older persons can reverse frailty and improve functionality; cognitive, emotional, and social networking; as well as biological biomarkers of frailty, when compared with a controlled population that received no training. This is an interventional, controlled, simple randomized study. Researchers responsible for data gathering were blinded for this study. Participants from 2 primary rural care centers (Sollana and Carcaixent) of the same health department in Spain were enrolled in the study between December 2013 and September 2014. We randomized a volunteer sample of 100 men and women who were sedentary, with a gait speed lower than 0.8 meters per second and frail (met at least 3 of the frailty phenotype criteria). Participants were randomized to a supervised-facility MEP (n = 51, age = 79.5, SD 3.9) that included proprioception, aerobic, strength, and stretching exercises for 65 minutes, 5 days per week, 24 weeks, or to a control group (n = 49, age = 80.3, SD 3.7). The intervention was performed by 8 experienced physiotherapists or nurses. Protein-calorie and vitamin D supplementation were controlled in both groups. Our MEP reverses frailty (number needed to treat to recover robustness in subjects with attendance to ≥50% of the training sessions was 3.2) and improves functional measurements: Barthel (trained group 91.6 SD 8.0 vs 82.0 SD 11.0 control group), Lawton and Brody (trained group 6.9 SD 0.9 vs 5.7 SD 2.0 control group), Tinetti (trained group 24.5 SD 4.4 vs 21.7 SD 4.5 control group), Short Physical Performance Battery (trained group 9.5 SD 1.8 vs 7.1 SD 2.8 control group), and physical performance test (trained group 23.5 SD 5.9 vs 16.5 SD 5.1 control group) as well as cognitive, emotional, and social networking determinations: Mini-Mental State Examination (trained

  2. Establishing HIV treatment as prevention in the HIV Prevention Trials Network 052 randomized trial: an ethical odyssey.

    Science.gov (United States)

    Cohen, Myron S; McCauley, Marybeth; Sugarman, Jeremy

    2012-06-01

    Obtaining the definitive data necessary to determine the safety and efficacy of using antiretroviral treatment (ART) to reduce the sexual transmission of HIV in heterosexual couples encountered an array of ethical challenges that threatened to compromise HIV Prevention Trials Network (HPTN) 052, the multinational clinical trial addressing this issue that has profound public health implications. To describe and analyze the major ethical challenges faced in HPTN 052. The ethical issues and modifications of HPTN 052 in response to these issues were cataloged by the principal investigator, the lead coordinator, and the ethicist working on the trial. The major ethical issues that were unique to the trial were then described and analyzed in light of the published literature as well as guidances and policies. The ethical challenges that must be addressed in many clinical trials, such as those related to obtaining informed consent and making provisions for ancillary care, are not described. When HPTN 052 was being designed, ethical questions emerged related to the relevance of the research question itself given data from observational research and a range of beliefs about the appropriate means of preventing and treating HIV infection and AIDS. Furthermore, ethical challenges were faced regarding site selection since there was a scientific need to conduct the research in settings where HIV incidence was high, but alternatives to study participation should be available. As in most HIV-prevention research, ethical questions surrounded the determination of the appropriate prevention package for all of those enrolled. During the course of the trial, guidance documents and policies emerged that were of direct relevance to the research questions, calling for a balancing of concerns for the research subjects and trial integrity. When the study results were made public, there was a need to ensure access to the treatment shown to be effective that in some cases differed from the

  3. The Building Wealth and Health Network: methods and baseline characteristics from a randomized controlled trial for families with young children participating in temporary assistance for needy families (TANF).

    Science.gov (United States)

    Sun, Jing; Patel, Falguni; Kirzner, Rachel; Newton-Famous, Nijah; Owens, Constance; Welles, Seth L; Chilton, Mariana

    2016-07-16

    Families with children under age six participating in the Temporary Assistance for Needy Families Program (TANF) must participate in work-related activities for 20 h per week. However, due to financial hardship, poor health, and exposure to violence and adversity, families may experience great difficulty in reaching self-sufficiency. The purpose of this report is to describe study design and baseline findings of a trauma-informed financial empowerment and peer support intervention meant to mitigate these hardships. We conducted a randomized controlled trial of a 28-week intervention called Building Wealth and Health Network to improve financial security and maternal and child health among caregivers participating in TANF. Participants, recruited from County Assistance offices in Philadelphia, PA, were randomized into two intervention groups (partial and full) and one control group. Participants completed questionnaires at baseline to assess career readiness, economic hardship, health and wellbeing, exposure to adversity and violence, and interaction with criminal justice systems. Baseline characteristics demonstrate that among 103 participants, there were no significant differences by group. Mean age of participants was 25 years, and youngest child was 30 months. The majority of participants were women (94.2 %), never married (83.5 %), unemployed (94.2 %), and without a bank account (66.0 %). Many reported economic hardship (32.0 % very low household food secure, 65.0 % housing insecure, and 31.1 % severe energy insecure), and depression (57.3 %). Exposure to adversity was prevalent, where 38.8 % reported four or more Adverse Childhood Experiences including abuse, neglect and household dysfunction. In terms of community violence, 64.7 % saw a seriously wounded person after an incident of violence, and 27.2 % had seen someone killed. Finally, 14.6 % spent time in an adult correctional institution, and 48.5 % of the fathers of the youngest child spent

  4. A Web-Based, Social Networking Beginners’ Running Intervention for Adults Aged 18 to 50 Years Delivered via a Facebook Group: Randomized Controlled Trial

    Science.gov (United States)

    Boshoff, Kobie; Maher, Carol

    2018-01-01

    Background Online social networks continue to grow in popularity, with 1.7 billion users worldwide accessing Facebook each month. The use of social networking sites such as Facebook for the delivery of health behavior programs is relatively new. Objective The primary aim of this study was to determine the effectiveness of a Web-based beginners’ running program for adults aged 18 to 50 years, delivered via a Facebook group, in increasing physical activity (PA) and cardiorespiratory fitness. Methods A total of 89 adults with a mean age of 35.2 years (SD 10.9) were recruited online and via print media. Participants were randomly allocated to receive the UniSA Run Free program, an 8-week Web-based beginners’ running intervention, delivered via a closed Facebook group (n=41) that included daily interactive posts (information with links, motivational quotes, opinion polls, or questions) and details of the running sessions; or to the control group who received a hard copy of the running program (n=48). Assessments were completed online at baseline, 2 months, and 5 months. The primary outcome measures were self-reported weekly moderate to vigorous physical activity (MVPA) and objectively measured cardiorespiratory fitness. Secondary outcomes were social support, exercise attitudes, and self-efficacy. Analyses were undertaken using random effects mixed modeling. Compliance with the running program and engagement with the Facebook group were analyzed descriptively. Results Both groups significantly increased MVPA across the study period (P=.004); however, this was significantly higher in the Facebook group (P=.04). The Facebook group increased their MVPA from baseline by 140 min/week versus 91 min for the control at 2 months. MVPA remained elevated for the Facebook group (from baseline) by 129 min/week versus a 50 min/week decrease for the control at 5 months. Both groups had significant increases in social support scores at 2 months (P=.02); however, there were no group

  5. The Building Wealth and Health Network: methods and baseline characteristics from a randomized controlled trial for families with young children participating in temporary assistance for needy families (TANF

    Directory of Open Access Journals (Sweden)

    Jing Sun

    2016-07-01

    Full Text Available Abstract Background Families with children under age six participating in the Temporary Assistance for Needy Families Program (TANF must participate in work-related activities for 20 h per week. However, due to financial hardship, poor health, and exposure to violence and adversity, families may experience great difficulty in reaching self-sufficiency. The purpose of this report is to describe study design and baseline findings of a trauma-informed financial empowerment and peer support intervention meant to mitigate these hardships. Methods We conducted a randomized controlled trial of a 28-week intervention called Building Wealth and Health Network to improve financial security and maternal and child health among caregivers participating in TANF. Participants, recruited from County Assistance offices in Philadelphia, PA, were randomized into two intervention groups (partial and full and one control group. Participants completed questionnaires at baseline to assess career readiness, economic hardship, health and wellbeing, exposure to adversity and violence, and interaction with criminal justice systems. Results Baseline characteristics demonstrate that among 103 participants, there were no significant differences by group. Mean age of participants was 25 years, and youngest child was 30 months. The majority of participants were women (94.2 %, never married (83.5 %, unemployed (94.2 %, and without a bank account (66.0 %. Many reported economic hardship (32.0 % very low household food secure, 65.0 % housing insecure, and 31.1 % severe energy insecure, and depression (57.3 %. Exposure to adversity was prevalent, where 38.8 % reported four or more Adverse Childhood Experiences including abuse, neglect and household dysfunction. In terms of community violence, 64.7 % saw a seriously wounded person after an incident of violence, and 27.2 % had seen someone killed. Finally, 14.6 % spent time in an adult correctional institution, and 48

  6. The Impact of Aerobic Exercise on Fronto-Parietal Network Connectivity and Its Relation to Mobility: An Exploratory Analysis of a 6-Month Randomized Controlled Trial

    Directory of Open Access Journals (Sweden)

    Chun L. Hsu

    2017-06-01

    Full Text Available Impaired mobility is a major concern for older adults and has significant consequences. While the widely accepted belief is that improved physical function underlies the effectiveness of targeted exercise training in improving mobility and reducing falls, recent evidence suggests cognitive and neural benefits gained through exercise may also play an important role in promoting mobility. However, the underlying neural mechanisms of this relationship are currently unclear. Thus, we hypothesize that 6 months of progressive aerobic exercise training would alter frontoparietal network (FPN connectivity during a motor task among older adults with mild subcortical ischemic vascular cognitive impairment (SIVCI—and exercise-induced changes in FPN connectivity would correlate with changes in mobility. We focused on the FPN as it is involved in top-down attentional control as well as motor planning and motor execution. Participants were randomized either to usual-care (CON, which included monthly educational materials about VCI and healthy diet; or thrice-weekly aerobic training (AT, which was walking outdoors with progressive intensity. Functional magnetic resonance imaging was acquired at baseline and trial completion, where the participants were instructed to perform bilateral finger tapping task. At trial completion, compared with AT, CON showed significantly increased FPN connectivity strength during right finger tapping (p < 0.05. Across the participants, reduced FPN connectivity was associated with greater cardiovascular capacity (p = 0.05. In the AT group, reduced FPN connectivity was significantly associated with improved mobility performance, as measured by the Timed-Up-and-Go test (r = 0.67, p = 0.02. These results suggest progressive AT may improve mobility in older adults with SIVCI via maintaining intra-network connectivity of the FPN.

  7. Comparative efficacy and safety of tofacitinib, with or without methotrexate, in patients with active rheumatoid arthritis: a Bayesian network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Lee, Young Ho; Bae, Sang-Cheol; Song, Gwan Gyu

    2015-12-01

    This study aimed to assess the relative efficacy and safety of tofacitinib 5 and 10 mg twice daily, or in combination with methotrexate (MTX), in patients with active RA. Randomized controlled trials (RCTs) examining the efficacy and safety of tofacitinib in patients with active RA were included in this network meta-analysis. We performed a Bayesian network meta-analysis to combine the direct and indirect evidence from the RCTs. Ten RCTs including 4867 patients met the inclusion criteria. There were 21 pairwise comparisons including 11 direct comparisons of seven interventions. The ACR20 response rate was significantly higher in the tofacitinib 10 mg + MTX group than in the placebo and MTX groups (OR 7.56, 95 % credible interval (CrI) 3.07-21.16; OR 3.67, 95 % CrI 2.60-5.71, respectively). Ranking probabilities based on the surface under the cumulative ranking curve (SUCRA) indicated that tofacitinib 10 mg + MTX had the highest probability of being the best treatment for achieving the ACR20 response rate (SUCRA = 0.9254), followed by tofacitinib 5 mg + MTX (SUCRA = 0.7156), adalimumab 40 mg + MTX (SUCRA = 0.6097), tofacitinib 10 mg (SUCRA = 0.5984), tofacitinib 5 mg (SUCRA = 0.4749), MTX (SUCRA = 0.1674), and placebo (SUCRA = 0.0086). In contrast, the safety based on the number of withdrawals due to adverse events did not differ significantly among the seven interventions. Tofacitinib, at dosages 5 and 10 mg twice daily, in combination with MTX, was the most efficacious intervention for active RA and was not associated with a significant risk for withdrawals due to adverse events.

  8. Induction regimens for transplant-eligible patients with newly diagnosed multiple myeloma: a network meta-analysis of randomized controlled trials

    Directory of Open Access Journals (Sweden)

    Zeng ZH

    2017-07-01

    Full Text Available Zi-Hang Zeng,1,2 Jia-Feng Chen,1,2 Yi-Xuan Li,1,2 Ran Zhang,1,2 Ling-Fei Xiao,1,2 Xiang-Yu Meng1,2 1Center for Evidence-Based and Translational Medicine, Zhongnan Hospital of Wuhan University, 2Department of Evidence-Based Medicine and Clinical Epidemiology, Second Clinical College of Wuhan University, Wuhan, People’s Republic of China Objective: The aim of this study was to compare the early efficacy and survivals of induction regimens for transplant-eligible patients with untreated multiple myeloma. Materials and methods: A comprehensive literature search in electronic databases was conducted for relevant randomized controlled trials (RCTs. Eligible studies were selected according to the predefined selection criteria, before they were evaluated for methodological quality. Basic characteristics and data for network meta-analysis (NMA were extracted from included trials and pooled in our meta-analysis. The end points were the overall response rate (ORR, progression-free survival (PFS, and overall survival (OS. Results: A total of 14 RCTs that included 4,763 patients were analyzed. The post-induction ORR was higher with bortezomib plus thalidomide plus dexamethasone (VTD regimens, and VTD was better than the majority of other regimens. For OS, VTD plus cyclophosphamide (VTDC regimens showed potential superiority over other regimens, but the difference was not statistically significant. The PFS was longer with thalidomide plus doxorubicin plus dexamethasone (TAD regimens for transplant-eligible patients with newly diagnosed multiple myeloma (NDMM. Conclusion: The NMA demonstrated that the VTD, VTDC, and TAD regimens are most beneficial in terms of ORR, OS, and PFS for transplant-eligible patients with NDMM, respectively. Keywords: multiple myeloma, newly diagnosed, transplant-eligible, induction therapies, network meta-analysis

  9. Randomized controlled trial of Mindfulness-Based Stress Reduction versus aerobic exercise: effects on the self-referential brain network in social anxiety disorder

    Directory of Open Access Journals (Sweden)

    Philippe eGoldin

    2012-11-01

    Full Text Available Background: Social Anxiety Disorder (SAD is characterized by distorted self-views. The goal of this study was to examine whether Mindfulness-Based Stress Reduction (MBSR alters behavioral and brain measures of negative and positive self-views. Methods: 56 adult patients with generalized SAD were randomly assigned to MBSR or a comparison aerobic exercise (AE program. A self-referential encoding task was administered at baseline and post-intervention to examine changes in behavioral and neural responses in the self-referential brain network during functional magnetic resonance imaging. Patients were cued to decide whether positive and negative social trait adjectives were self-descriptive or in upper case font. Results: Behaviorally, compared to AE, MBSR produced greater decreases in negative self-views, and equivalent increases in positive self-views. Neurally, during negative self vs. case, compared to AE, MBSR led to increased brain responses in the posterior cingulate cortex (PCC. There were no differential changes for positive self vs. case. Secondary analyses showed that changes in endorsement of negative and positive self-views were associated with decreased social anxiety symptom severity for MBSR, but not AE. Additionally, MBSR-related increases in DMPFC activity during negative self-view vs. case were associated with decreased social anxiety-related disability and increased mindfulness. Analysis of neural temporal dynamics revealed MBSR-related changes in the timing of neural responses in the DMPFC and PCC for negative self-view vs. case.Conclusions: These findings suggest that MBSR attenuates maladaptive habitual self-views by facilitating automatic (i.e., uninstructed recruitment of cognitive and attention regulation neural networks. This highlights potentially important links between self-referential and cognitive-attention regulation systems and suggests that MBSR may enhance more adaptive social self-referential processes in

  10. Left atrial appendage occlusion for stroke prevention in patients with atrial fibrillation: a systematic review and network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Hanif, Hasib; Belley-Cote, Emilie P; Alotaibi, Abdullah; Dvirnik, Nazari; Neupane, Binod; Beyene, Joseph; Eikelboom, John W; Holmes, David; Whitlock, Richard P

    2018-02-01

    Atrial fibrillation (AF) is one of the leading causes of stroke. Risks associated with oral anticoagulation (OAC) limit adherence to recommended therapy. Left atrial appendage (LAA) occlusion is a treatment alternative in patients with AF. We performed a network meta-analysis (NMA) of randomized trials evaluating the efficacy of LAA occlusion compared with oral anticoagulant, antiplatelet, and placebo for stroke prevention. We also assessed the impact of LAA occlusion on mortality, major bleeding, and operative time. We searched MEDLINE, EMBASE, PubMed, and Cochrane Library for randomized trials comparing percutaneous or surgical LAA occlusion with standard of care in AF patients. Conventional meta-analysis found no difference between groups for stroke (5 trials, 1285 patients;RR 0.78, 95% CI 0.47-1.29), and a significant reduction in mortality (5 trials, 1285 patients; RR 0.71, 95% CI 0.51-0.99) favouring LAA occlusion. NMA demonstrated a trend towards reduction in stroke (OR 0.84, 95% CrI 0.47-1.55) and mortality (OR 0.69, 95% CrI 0.44-1.10) for LAA occlusion versus warfarin, but no statistically significant effect. Statistical ranking curves placed LAA occlusion as the most efficacious treatment on the outcomes of stroke and mortality when compared to warfarin, aspirin, or placebo. No significant differences between groups were seen in major bleeding or operative time for surgical trials. The overall quality of the evidence was low as assessed by GRADE. LAA occlusion appears to preserve the benefits of OAC therapy for stroke prevention in patients with AF, but the current evidence is of low quality.

  11. Exercise and BMI z-score in Overweight and Obese Children and Adolescents: A Systematic Review and Network Meta-Analysis of Randomized Trials.

    Science.gov (United States)

    Kelley, George A; Kelley, Kristi S; Pate, Russell R

    2017-05-01

    Examine the effects of selected types of exercise (aerobic, strength training, both) on BMI z-score in overweight and obese children and adolescents. Randomized exercise intervention trials ≥ 4 weeks were included. Studies were retrieved by searching six electronic databases, cross-referencing and expert review. Dual selection and abstraction occurred. Risk of bias and confidence in cumulative evidence were assessed. Network meta-analysis was performed using multivariate random-effects meta-regression models while surface under the cumulative ranking curves were used to calculate a hierarchy of exercise treatments. The number needed to treat (NNT) and percentile improvement (U 3 ) were also calculated. Thirty-four studies representing 2,239 participants were included. Median exercise occurred 3 times per week, 50 minutes per session over a 12-week period. Statistically significant reductions in BMI z-score were found for aerobic exercise and combined aerobic and strength exercise, but not strength training alone (M±SD, 95% CI: aerobic, -0.10, -0.15 to -0.05; aerobic and strength, -0.11, -0.19 to -0.03; strength, 0.04, -0.07 to 0.15). Combined aerobic and strength training was ranked best, followed by aerobic exercise and strength training. The NNT was 2 for both aerobic exercise and combined aerobic exercise and strength training. Percentile improvements were 28.8% for aerobic exercise and 31.5% for combined aerobic exercise and strength training. Confidence in effect estimates was ranked as low for aerobic exercise and very low for combined aerobic and strength training as well as strength training. Aerobic exercise and combined aerobic exercise and strength training are associated with reductions in BMI z-score. © 2016 Chinese Cochrane Center, West China Hospital of Sichuan University and John Wiley & Sons Australia, Ltd.

  12. Rewiring the severe acute respiratory syndrome coronavirus (SARS-CoV) transcription circuit: Engineering a recombination-resistant genome

    Science.gov (United States)

    Yount, Boyd; Roberts, Rhonda S.; Lindesmith, Lisa; Baric, Ralph S.

    2006-08-01

    Live virus vaccines provide significant protection against many detrimental human and animal diseases, but reversion to virulence by mutation and recombination has reduced appeal. Using severe acute respiratory syndrome coronavirus as a model, we engineered a different transcription regulatory circuit and isolated recombinant viruses. The transcription network allowed for efficient expression of the viral transcripts and proteins, and the recombinant viruses replicated to WT levels. Recombinant genomes were then constructed that contained mixtures of the WT and mutant regulatory circuits, reflecting recombinant viruses that might occur in nature. Although viable viruses could readily be isolated from WT and recombinant genomes containing homogeneous transcription circuits, chimeras that contained mixed regulatory networks were invariantly lethal, because viable chimeric viruses were not isolated. Mechanistically, mixed regulatory circuits promoted inefficient subgenomic transcription from inappropriate start sites, resulting in truncated ORFs and effectively minimize viral structural protein expression. Engineering regulatory transcription circuits of intercommunicating alleles successfully introduces genetic traps into a viral genome that are lethal in RNA recombinant progeny viruses. regulation | systems biology | vaccine design

  13. Effects of Ganglioside on Working Memory and the Default Mode Network in Individuals with Subjective Cognitive Impairment: A Randomized Controlled Trial.

    Science.gov (United States)

    Jeon, Yujin; Kim, Binna; Kim, Jieun E; Kim, Bori R; Ban, Soonhyun; Jeong, Jee Hyang; Kwon, Oran; Rhie, Sandy Jeong; Ahn, Chang-Won; Kim, Jong-Hoon; Jung, Sung Ug; Park, Soo-Hyun; Lyoo, In Kyoon; Yoon, Sujung

    2016-01-01

    This randomized, double-blind, placebo-controlled trial examined whether the administration of ganglioside, an active ingredient of deer bone extract, can improve working memory performance by increasing gray matter volume and functional connectivity in the default mode network (DMN) in individuals with subjective cognitive impairment. Seventy-five individuals with subjective cognitive impairment were chosen to receive either ganglioside (330[Formula: see text][Formula: see text]g/day or 660[Formula: see text][Formula: see text]g/day) or a placebo for 8 weeks. Changes in working memory performance with treatment of either ganglioside or placebo were assessed as cognitive outcome measures. Using voxel-based morphometry and functional connectivity analyses, changes in gray matter volume and functional connectivity in the DMN were also assessed as brain outcome measures. Improvement in working memory performance was greater in the ganglioside group than in the placebo group. The ganglioside group, relative to the placebo group, showed greater increases in gray matter volume and functional connectivity in the DMN. A significant relationship between increased functional connectivity of the precuneus and improved working memory performance was observed in the ganglioside group. The current findings suggest that ganglioside has cognitive-enhancing effects in individuals with subjective cognitive impairment. Ganglioside-induced increases in gray matter volume and functional connectivity in the DMN may partly be responsible for the potential nootropic effects of ganglioside. The clinical trial was registered with ClinicalTrials.gov (identifier: NCT02379481).

  14. Combination of support vector machine, artificial neural network and random forest for improving the classification of convective and stratiform rain using spectral features of SEVIRI data

    Science.gov (United States)

    Lazri, Mourad; Ameur, Soltane

    2018-05-01

    A model combining three classifiers, namely Support vector machine, Artificial neural network and Random forest (SAR) is designed for improving the classification of convective and stratiform rain. This model (SAR model) has been trained and then tested on a datasets derived from MSG-SEVIRI (Meteosat Second Generation-Spinning Enhanced Visible and Infrared Imager). Well-classified, mid-classified and misclassified pixels are determined from the combination of three classifiers. Mid-classified and misclassified pixels that are considered unreliable pixels are reclassified by using a novel training of the developed scheme. In this novel training, only the input data corresponding to the pixels in question to are used. This whole process is repeated a second time and applied to mid-classified and misclassified pixels separately. Learning and validation of the developed scheme are realized against co-located data observed by ground radar. The developed scheme outperformed different classifiers used separately and reached 97.40% of overall accuracy of classification.

  15. Network science

    CERN Document Server

    Barabasi, Albert-Laszlo

    2016-01-01

    Networks are everywhere, from the Internet, to social networks, and the genetic networks that determine our biological existence. Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of topics from physics to computer science, engineering, economics and the social sciences, introduces network science to an interdisciplinary audience. From the origins of the six degrees of separation to explaining why networks are robust to random failures, the author explores how viruses like Ebola and H1N1 spread, and why it is that our friends have more friends than we do. Using numerous real-world examples, this innovatively designed text includes clear delineation between undergraduate and graduate level material. The mathematical formulas and derivations are included within Advanced Topics sections, enabling use at a range of levels. Extensive online resources, including films and software for network analysis, make this a multifaceted companion for anyone with an interest in network sci...

  16. Effects of chemopreventive agents on the incidence of recurrent colorectal adenomas: a systematic review with network meta-analysis of randomized controlled trials

    Directory of Open Access Journals (Sweden)

    Veettil SK

    2017-05-01

    Full Text Available Sajesh K Veettil,1 Nattawat Teerawattanapong,2 Siew Mooi Ching,3,4 Kean Ghee Lim,5 Surasak Saokaew,6–9 Pochamana Phisalprapa,10 Nathorn Chaiyakunapruk7,8,11,12 1School of Pharmacy/School of Postgraduate Studies, International Medical University, Kuala Lumpur, Malaysia; 2Division of Pharmacy Practice, Faculty of Pharmaceutical Sciences, Ubon Ratchathani University, Ubon Ratchathani, Thailand; 3Department of Family Medicine, Faculty of Medicine and Health Sciences, 4Malaysian Research Institute on Ageing, Universiti Putra Malaysia, Serdang, 5Clinical School, Department of Surgery, International Medical University, Seremban, Negeri Sembilan, 6Center of Health Outcomes Research and Therapeutic Safety (Cohorts, School of Pharmaceutical Sciences, University of Phayao, Phayao, 7School of Pharmacy, Monash University Malaysia, Selangor, Malaysia; 8Centre of Pharmaceutical Outcomes Research, Department of Pharmacy Practice, Faculty of Pharmaceutical Sciences, Naresuan University, Phitsanulok, Thailand; 9Unit of Excellence on Herbal Medicine, School of Pharmaceutical Sciences, University of Phayao, Thailand; 10Division of Ambulatory Medicine, Department of Medicine, Faculty of Medicine Siriraj Hospital, Mahidol University, Bangkok, 11School of Pharmacy, University of Wisconsin, Madison, USA; 12Health and Well-being Cluster, Global Asia Platform in the 21st Century (GA21 Platform, Monash University Malaysia, Selangor, Malaysia Background: Protective effects of several chemopreventive agents (CPAs against colorectal adenomas have been well documented in randomized controlled trials (RCTs; however, there is uncertainty regarding which agents are the most effective.Methods: We searched for RCTs published up until September 2016. Retrieved trials were evaluated using risk of bias. We performed both pairwise analysis and network meta-analysis (NMA of RCTs to compare the effects of CPAs on the recurrence of colorectal adenomas (primary outcome. Using NMA, we

  17. Where value lives in a networked world.

    Science.gov (United States)

    Sawhney, M; Parikh, D

    2001-01-01

    While many management thinkers proclaim an era of radical uncertainty, authors Sawhney and Parikh assert that the seemingly endless upheavals of the digital age are more predictable than that: today's changes have a common root, and that root lies in the nature of intelligence in networks. Understanding the patterns of intelligence migration can help companies decipher and plan for the inevitable disruptions in today's business environment. Two patterns in network intelligence are reshaping industries and organizations. First, intelligence is decoupling--that is, modern high-speed networks are pushing back-end intelligence and front-end intelligence toward opposite ends of the network, making the ends the two major sources of potential profits. Second, intelligence is becoming more fluid and modular. Small units of intelligence now float freely like molecules in the ether, coalescing into temporary bundles whenever and wherever necessary to solve problems. The authors present four strategies that companies can use to profit from these patterns: arbitrage allows companies to move intelligence to new regions or countries where the cost of maintaining intelligence is lower; aggregation combines formerly isolated pieces of infrastructure intelligence into a large pool of shared infrastructure provided over a network; rewiring allows companies to connect islands of intelligence by creating common information backbones; and reassembly allows businesses to reorganize pieces of intelligence into coherent, personalized packages for customers. By being aware of patterns in network intelligence and by acting rather than reacting, companies can turn chaos into opportunity, say the authors.

  18. Random a-adic groups and random net fractals

    Energy Technology Data Exchange (ETDEWEB)

    Li Yin [Department of Mathematics, Nanjing University, Nanjing 210093 (China)], E-mail: Lyjerry7788@hotmail.com; Su Weiyi [Department of Mathematics, Nanjing University, Nanjing 210093 (China)], E-mail: suqiu@nju.edu.cn

    2008-08-15

    Based on random a-adic groups, this paper investigates the relationship between the existence conditions of a positive flow in a random network and the estimation of the Hausdorff dimension of a proper random net fractal. Subsequently we describe some particular random fractals for which our results can be applied. Finally the Mauldin and Williams theorem is shown to be very important example for a random Cantor set with application in physics as shown in E-infinity theory.

  19. Oral cancer cells may rewire alternative metabolic pathways to survive from siRNA silencing of metabolic enzymes

    International Nuclear Information System (INIS)

    Zhang, Min; Chai, Yang D; Brumbaugh, Jeffrey; Liu, Xiaojun; Rabii, Ramin; Feng, Sizhe; Misuno, Kaori; Messadi, Diana; Hu, Shen

    2014-01-01

    Cancer cells may undergo metabolic adaptations that support their growth as well as drug resistance properties. The purpose of this study is to test if oral cancer cells can overcome the metabolic defects introduced by using small interfering RNA (siRNA) to knock down their expression of important metabolic enzymes. UM1 and UM2 oral cancer cells were transfected with siRNA to transketolase (TKT) or siRNA to adenylate kinase (AK2), and Western blotting was used to confirm the knockdown. Cellular uptake of glucose and glutamine and production of lactate were compared between the cancer cells with either TKT or AK2 knockdown and those transfected with control siRNA. Statistical analysis was performed with student T-test. Despite the defect in the pentose phosphate pathway caused by siRNA knockdown of TKT, the survived UM1 or UM2 cells utilized more glucose and glutamine and secreted a significantly higher amount of lactate than the cells transferred with control siRNA. We also demonstrated that siRNA knockdown of AK2 constrained the proliferation of UM1 and UM2 cells but similarly led to an increased uptake of glucose/glutamine and production of lactate by the UM1 or UM2 cells survived from siRNA silencing of AK2. Our results indicate that the metabolic defects introduced by siRNA silencing of metabolic enzymes TKT or AK2 may be compensated by alternative feedback metabolic mechanisms, suggesting that cancer cells may overcome single defective pathways through secondary metabolic network adaptations. The highly robust nature of oral cancer cell metabolism implies that a systematic medical approach targeting multiple metabolic pathways may be needed to accomplish the continued improvement of cancer treatment

  20. The effects of dipeptidyl peptidase-4 inhibitors on bone fracture among patients with type 2 diabetes mellitus: A network meta-analysis of randomized controlled trials.

    Directory of Open Access Journals (Sweden)

    Jun Yang

    Full Text Available The association between dipeptidyl peptidase-4 inhibitors (DPP-4is, a class of anti-diabetes, and bone fracture in patients with type 2 diabetes mellitus (T2DM is unknown. This meta-analysis aimed to systematically evaluate the effects of DPP-4is on bone fracture in T2DM patients.We searched the Cochrane Library, Embase, Medline and ClinicalTrials.gov from inception through April 28th, 2016 to identify randomized controlled trials (RCTs that compared DPP-4is with placebo or other anti-diabetes in T2DM patients. RCTs lasting more than 12 weeks and having data on bone fracture were included. We conducted random-effects meta-analysis to estimate odds ratios (ORs and their 95% confidence intervals (CIs, and network meta-analysis (NMA to supplement direct comparisons. Predictive interval plot and node-splitting method were used to evaluate the heterogeneity and inconsistency for NMA, while the funnel plot was applied to explore publication bias. Besides, study quality was assessed according to Cochrane risk of bias tool.We identified 75 RCTs with a total of 70,207 patients and 11 treatments: interventions included 5 DPP-4is (alogliptin, linagliptin, saxagliptin, sitagliptin, vildagliptin, while controls included placebo and 5 other anti-diabetes (sulfonylureas, glucagon-like peptide-1 receptor agonists, metformin, thiazolidinediones, sodium-glucose co-transporter 2 inhibitors. In the NMA, the risk of fracture for alogliptin tended to decrease when versus placebo (OR, 0.51; 95% CI, 0.29 to 0.88. Besides, aloglitpin had a lower risk compared with linagliptin (OR, 0.45; 95% CI, 0.20 to 0.99 and saxagliption (OR, 0.46; 95%CI, 0.25 to 0.84; the risk was higher with saxagliptin when versus sitagliptin (OR, 1.90; 95% CI, 1.04 to 3.47 and sulfonylureas (OR, 1.98; 95% CI, 1.06 to 3.71. In the direct pairwise meta-analysis, alogliptin was associated with a non-significant tendency to reduction of bone fracture compared with placebo (OR, 0.54; 95% CI, 0.29 to 1