WorldWideScience

Sample records for coevolving random networks

  1. 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.

  2. Network Analysis of Earth's Co-Evolving Geosphere and Biosphere

    Science.gov (United States)

    Hazen, R. M.; Eleish, A.; Liu, C.; Morrison, S. M.; Meyer, M.; Consortium, K. D.

    2017-12-01

    A fundamental goal of Earth science is the deep understanding of Earth's dynamic, co-evolving geosphere and biosphere through deep time. Network analysis of geo- and bio- `big data' provides an interactive, quantitative, and predictive visualization framework to explore complex and otherwise hidden high-dimension features of diversity, distribution, and change in the evolution of Earth's geochemistry, mineralogy, paleobiology, and biochemistry [1]. Networks also facilitate quantitative comparison of different geological time periods, tectonic settings, and geographical regions, as well as different planets and moons, through network metrics, including density, centralization, diameter, and transitivity.We render networks by employing data related to geographical, paragenetic, environmental, or structural relationships among minerals, fossils, proteins, and microbial taxa. An important recent finding is that the topography of many networks reflects parameters not explicitly incorporated in constructing the network. For example, networks for minerals, fossils, and protein structures reveal embedded qualitative time axes, with additional network geometries possibly related to extinction and/or other punctuation events (see Figure). Other axes related to chemical activities and volatile fugacities, as well as pressure and/or depth of formation, may also emerge from network analysis. These patterns provide new insights into the way planets evolve, especially Earth's co-evolving geosphere and biosphere. 1. Morrison, S.M. et al. (2017) Network analysis of mineralogical systems. American Mineralogist 102, in press. Figure Caption: A network of Phanerozoic Era fossil animals from the past 540 million years includes blue, red, and black circles (nodes) representing family-level taxa and grey lines (links) between coexisting families. Age information was not used in the construction of this network; nevertheless an intrinsic timeline is embedded in the network topology. In

  3. Directed evolution to re-adapt a co-evolved network within an enzyme.

    Science.gov (United States)

    Strafford, John; Payongsri, Panwajee; Hibbert, Edward G; Morris, Phattaraporn; Batth, Sukhjeet S; Steadman, David; Smith, Mark E B; Ward, John M; Hailes, Helen C; Dalby, Paul A

    2012-01-01

    We have previously used targeted active-site saturation mutagenesis to identify a number of transketolase single mutants that improved activity towards either glycolaldehyde (GA), or the non-natural substrate propionaldehyde (PA). Here, all attempts to recombine the singles into double mutants led to unexpected losses of specific activity towards both substrates. A typical trade-off occurred between soluble expression levels and specific activity for all single mutants, but many double mutants decreased both properties more severely suggesting a critical loss of protein stability or native folding. Statistical coupling analysis (SCA) of a large multiple sequence alignment revealed a network of nine co-evolved residues that affected all but one double mutant. Such networks maintain important functional properties such as activity, specificity, folding, stability, and solubility and may be rapidly disrupted by introducing one or more non-naturally occurring mutations. To identify variants of this network that would accept and improve upon our best D469 mutants for activity towards PA, we created a library of random single, double and triple mutants across seven of the co-evolved residues, combining our D469 variants with only naturally occurring mutations at the remaining sites. A triple mutant cluster at D469, E498 and R520 was found to behave synergistically for the specific activity towards PA. Protein expression was severely reduced by E498D and improved by R520Q, yet variants containing both mutations led to improved specific activity and enzyme expression, but with loss of solubility and the formation of inclusion bodies. D469S and R520Q combined synergistically to improve k(cat) 20-fold for PA, more than for any previous transketolase mutant. R520Q also doubled the specific activity of the previously identified D469T to create our most active transketolase mutant to date. Our results show that recombining active-site mutants obtained by saturation mutagenesis

  4. Social networks and online environments: when science and practice co-evolve

    OpenAIRE

    Rosen, Devan; Barnett, George A.; Kim, Jang Hyun

    2011-01-01

    The science of social network analysis has co-evolved with the development of online environments and computer-mediated communication. Unique and precise data available from computer and information systems have allowed network scientists to explore novel social phenomena and develop new methods. Additionally, advances in the structural analysis and visualization of computer-mediated social networks have informed developers and shaped the design of social media tools. This article reviews som...

  5. 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

  6. A combinatorial approach to detect coevolved amino acid networks in protein families of variable divergence.

    Directory of Open Access Journals (Sweden)

    Julie Baussand

    2009-09-01

    Full Text Available Communication between distant sites often defines the biological role of a protein: amino acid long-range interactions are as important in binding specificity, allosteric regulation and conformational change as residues directly contacting the substrate. The maintaining of functional and structural coupling of long-range interacting residues requires coevolution of these residues. Networks of interaction between coevolved residues can be reconstructed, and from the networks, one can possibly derive insights into functional mechanisms for the protein family. We propose a combinatorial method for mapping conserved networks of amino acid interactions in a protein which is based on the analysis of a set of aligned sequences, the associated distance tree and the combinatorics of its subtrees. The degree of coevolution of all pairs of coevolved residues is identified numerically, and networks are reconstructed with a dedicated clustering algorithm. The method drops the constraints on high sequence divergence limiting the range of applicability of the statistical approaches previously proposed. We apply the method to four protein families where we show an accurate detection of functional networks and the possibility to treat sets of protein sequences of variable divergence.

  7. Adaptive cyclically dominating game on co-evolving networks: numerical and analytic results

    Science.gov (United States)

    Choi, Chi Wun; Xu, Chen; Hui, Pak Ming

    2017-10-01

    A co-evolving and adaptive Rock (R)-Paper (P)-Scissors (S) game (ARPS) in which an agent uses one of three cyclically dominating strategies is proposed and studied numerically and analytically. An agent takes adaptive actions to achieve a neighborhood to his advantage by rewiring a dissatisfying link with a probability p or switching strategy with a probability 1 - p. Numerical results revealed two phases in the steady state. An active phase for p pc has three separate clusters of agents using only R, P, and S, respectively with terminated adaptive actions. A mean-field theory based on the link densities in co-evolving network is formulated and the trinomial closure scheme is applied to obtain analytical solutions. The analytic results agree with simulation results on ARPS well. In addition, the different probabilities of winning, losing, and drawing a game among the agents are identified as the origin of the small discrepancy between analytic and simulation results. As a result of the adaptive actions, agents of higher degrees are often those being taken advantage of. Agents with a smaller (larger) degree than the mean degree have a higher (smaller) probability of winning than losing. The results are informative for future attempts on formulating more accurate theories.

  8. 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.

  9. Autonomous Agent-Based Systems and Their Applications in Fluid Dynamics, Particle Separation, and Co-evolving Networks

    Science.gov (United States)

    Graeser, Oliver

    evolution of the agents is defined by the rules of the dynamic model and depends on the relationship between agents, i.e., the state of the network. In return, the evolution of the network depends on the state of the dynamic model. The concept is introduced through the adaptive SIS model. We show that the previously used criterion determining the critical infected fraction, i.e., the number of infected agents required to sustain the epidemic, is inappropriate for this model. We introduce a different criterion and show that the critical infected fraction so determined is in good agreement with results obtained by numerical simulations. We further discuss the concept of co-evolving dynamics using the Snowdrift Game as a model paradigm. Co-evolution occurs through agents cutting dissatisfied links and rewiring to other agents at random. The effect of co-evolution on the emergence of cooperation is discussed using a mean-field theory and numerical simulations. A transition between a connected and a disconnected, highly cooperative state of the system is observed, and explained using the mean-field model. Quantitative deviations regarding the level of cooperation in the disconnected regime can be fully resolved through an improved mean-field theory that includes the effect of random fluctuations into its model.

  10. Macroscopic description of complex adaptive networks coevolving with dynamic node states

    Science.gov (United States)

    Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

    2015-05-01

    In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

  11. 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.

  12. 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.

  13. Cooperation and Phase Separation Driven by a Coevolving Snowdrift Game

    International Nuclear Information System (INIS)

    Du Peng; Xu Chen; Zhang Wen

    2015-01-01

    We investigate the cooperative behavior and the phase separation in a coevolving system. Agents in the system constructed by a regular random network initially play the snowdrift game with their neighbors. They try to obtain a better competing environment by imitating a neighbor's more successful strategy or cutting the connection to a defective neighbor and randomly rewiring to another agent so as to seek a better neighborhood. The dynamic process of strategy imitation and relationship among agents due to rewiring neighbors may drive the system into different states. The simulation results show that there are three different phases in the q-r plane, where q is the rewiring probability and r is the cost-to-benefit ratio. One is a static phase of a pure cooperative cluster with a few isolated defectors. The other two belong to active phases with one of a main mixed-strategy cluster and the other of a pure defective state. We find that a simple mean field theory can predict correctly the static phase and the active phase of the main mixed-strategy cluster. The theoretical boundary line between the two phases is in good agreement with the simulation result. (paper)

  14. 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...

  15. 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

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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 ...

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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)

  10. 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.

  11. 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).

  12. 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)

  13. 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

  14. 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.

  15. Co-evolving prisoner's dilemma: Performance indicators and analytic approaches

    Science.gov (United States)

    Zhang, W.; Choi, C. W.; Li, Y. S.; Xu, C.; Hui, P. M.

    2017-02-01

    Understanding the intrinsic relation between the dynamical processes in a co-evolving network and the necessary ingredients in formulating a reliable theory is an important question and a challenging task. Using two slightly different definitions of performance indicator in the context of a co-evolving prisoner's dilemma game, it is shown that very different cooperative levels result and theories of different complexity are required to understand the key features. When the payoff per opponent is used as the indicator (Case A), non-cooperative strategy has an edge and dominates in a large part of the parameter space formed by the cutting-and-rewiring probability and the strategy imitation probability. When the payoff from all opponents is used (Case B), cooperative strategy has an edge and dominates the parameter space. Two distinct phases, one homogeneous and dynamical and another inhomogeneous and static, emerge and the phase boundary in the parameter space is studied in detail. A simple theory assuming an average competing environment for cooperative agents and another for non-cooperative agents is shown to perform well in Case A. The same theory, however, fails badly for Case B. It is necessary to include more spatial correlation into a theory for Case B. We show that the local configuration approximation, which takes into account of the different competing environments for agents with different strategies and degrees, is needed to give reliable results for Case B. The results illustrate that formulating a proper theory requires both a conceptual understanding of the effects of the adaptive processes in the problem and a delicate balance between simplicity and accuracy.

  16. 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)

  17. 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)

  18. 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.

  19. Partially satisfied to fully satisfied transitions in co-evolving inverse voter model and possible scaling behavior

    International Nuclear Information System (INIS)

    Choi, C.W.; Xu, C.; Hui, P.M.

    2015-01-01

    Understanding co-evolving networks characterized by the mutual influence of agents' actions and network structure remains a challenge. We study a co-evolving inverse voter model in which agents adapt to achieve a preferred environment with more opposite-opinion neighbors by rewiring their connections and switching opinion. Numerical studies reveal a transition from a dynamic partially satisfied phase to a frozen fully satisfied phase as the rewiring probability is varied. A simple mean field theory is shown to capture the behavior only qualitatively. An improved mean field theory carrying a longer spatial correlation gives better results. Motivated by numerical results in networks of different degrees and mean field results, we propose a scaling variable that combines the rewiring probability and mean degree in a special form. The scaling variable is shown to work well in analyzing data corresponding to different networks and different rewiring probabilities. An application is to predict the results for networks of different degrees based solely on results obtained from networks of one degree. Studying scaling behavior provides an alternative path for understanding co-evolving agent-based dynamical systems, especially in light of the trade-off between complexity of a theory and its accuracy. - Highlights: • Identified key features and phase transitions in coevolving inverse voter model. • Constructed a better theory incorporating longer spatial correlation. • Proposed scaling variable and illustrated possible scaling behavior. • Used scaling behavior to predict results of IVM in a different network.

  20. 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.

  1. Detecting coevolving amino acid sites using Bayesian mutational mapping

    DEFF Research Database (Denmark)

    Dimmic, Matthew W.; Hubisz, Melissa J.; Bustamente, Carlos D.

    2005-01-01

    Motivation: The evolution of protein sequences is constrained by complex interactions between amino acid residues. Because harmful substitutions may be compensated for by other substitutions at neighboring sites, residues can coevolve. We describe a Bayesian phylogenetic approach to the detection...

  2. 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

  3. 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.

  4. 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.)

  5. 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.

  6. 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

  7. 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.

  8. Mammal taxa constituting potential coevolved reservoirs of filoviruses

    DEFF Research Database (Denmark)

    Peterson, A.Townsend; Papes, Monica; Carroll, Darin S.

    2007-01-01

    -term coevolved reservoir of the filoviruses based on a coarse, regional classification of occurrences; here, we greatly refine the geographic data set for the mammalian taxa based on rich occurrence data sets and range interpolations from ecological niche models for each species involved. This improved detail...

  9. 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.

  10. 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

  11. 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)

  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. 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.

  14. 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

  15. 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.

  16. 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.

  17. 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 ...

  18. 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

  19. 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.

  20. 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.

  1. 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

  2. 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.

  3. 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...

  4. 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.

  5. 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

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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...

  13. 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...

  14. 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.

  15. 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.

  16. 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.

  17. 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)

  18. 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...

  19. 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).

  20. 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.

  1. 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

  2. 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.

  3. 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...

  4. 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.

  5. 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.

  6. Coevolving parasites and population size shape the evolution of mating behaviour

    Directory of Open Access Journals (Sweden)

    Kerstes Niels AG

    2013-02-01

    Full Text Available Abstract Background Coevolution with parasites and population size are both expected to influence the evolution of mating rates. To gain insights into the interaction between these dual selective factors, we used populations from a coevolution experiment with the red flour beetle, Tribolium castaneum, and its microsporidian parasite, Nosema whitei. We maintained each experimental population at two different population sizes. We assayed the mating behaviour of both males and females from coevolved and paired non-coevolved control populations after 24 generations of coevolution with parasites. Results Males from large, coevolved populations (i.e. ancestors were exposed to parasites showed a reduced eagerness to mate compared to males from large, non-coevolved populations. But in small populations, coevolution did not lead to decreased male mating rates. Coevolved females from both large and small populations appeared to be more willing to accept mating than non-coevolved females. Conclusions This study provides unique, experimental insights into the combined roles of coevolving parasites and population size on the evolution of mating rate. Furthermore, we find that males and females respond differently to the same environmental conditions. Our results show that parasites can be key determinants of the sexual behaviour of their hosts.

  7. 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)

  8. 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,

  9. 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, ...

  10. How Life and Rocks Have Co-Evolved

    Science.gov (United States)

    Hazen, R.

    2014-04-01

    The near-surface environment of terrestrial planets and moons evolves as a consequence of selective physical, chemical, and biological processes - an evolution that is preserved in the mineralogical record. Mineral evolution begins with approximately 12 different refractory minerals that form in the cooling envelopes of exploding stars. Subsequent aqueous and thermal alteration of planetessimals results in the approximately 250 minerals now found in unweathered lunar and meteorite samples. Following Earth's accretion and differentiation, mineral evolution resulted from a sequence of geochemical and petrologic processes, which led to perhaps 1500 mineral species. According to some origin-of-life scenarios, a planet must progress through at least some of these stages of chemical processing as a prerequisite for life. Once life emerged, mineralogy and biology co-evolved and dramatically increased Earth's mineral diversity to >4000 species. Sequential stages of a planet's near-surface evolution arise from three primary mechanisms: (1) the progressive separation and concentration of the elements from their original relatively uniform distribution in the presolar nebula; (2) the increase in range of intensive variables such as pressure, temperature, and volatile activities; and (3) the generation of far-from-equilibrium conditions by living systems. Remote observations of the mineralogy of other terrestrial bodies may thus provide evidence for biological influences beyond Earth. Recent studies of mineral diversification through time reveal striking correlations with major geochemical, tectonic, and biological events, including large-changes in ocean chemistry, the supercontinent cycle, the increase of atmospheric oxygen, and the rise of the terrestrial biosphere.

  11. Plant-Associated Methylobacteria as Co-Evolved Phytosymbionts

    Science.gov (United States)

    2007-01-01

    Due to their wall-associated pectin metabolism, growing plant cells emit significant amounts of the one-carbon alcohol methanol. Pink-pigmented microbes of the genus Methylobacterium that colonize the surfaces of leaves (epiphytes) are capable of growth on this volatile C1-compound as sole source of carbon and energy. In this article the results of experiments with germ-free (gnotobiotic) sporophytes of angiosperms (sunflower, maize) and gametophytes of bryophytes (a moss and two liverwort species) are summarized. The data show that methylobacteria do not stimulate the growth of these angiosperms, but organ development in moss protonemata and in thalli of liverworts is considerably enhanced. Since methylobacteria produce and secrete cytokinins and auxin, a model of plant-microbe-interaction (symbiosis) is proposed in which the methanol-consuming bacteria are viewed as coevolved partners of the gametophyte that determine its growth, survival and reproduction (fitness). This symbiosis is restricted to the haploid cells of moisture-dependent “living fossil” plants; it does not apply to the diploid sporophytes of higher embryophytes, which are fully adapted to life on land and apparently produce sufficient amounts of endogenous phytohormones. PMID:19516971

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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)

  1. 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.

  2. Coevolving residues of (beta/alpha)(8)-barrel proteins play roles in stabilizing active site architecture and coordinating protein dynamics.

    Science.gov (United States)

    Shen, Hongbo; Xu, Feng; Hu, Hairong; Wang, Feifei; Wu, Qi; Huang, Qiang; Wang, Honghai

    2008-12-01

    Indole-3-glycerol phosphate synthase (IGPS) is a representative of (beta/alpha)(8)-barrel proteins-the most common enzyme fold in nature. To better understand how the constituent amino-acids work together to define the structure and to facilitate the function, we investigated the evolutionary and dynamical coupling of IGPS residues by combining statistical coupling analysis (SCA) and molecular dynamics (MD) simulations. The coevolving residues identified by the SCA were found to form a network which encloses the active site completely. The MD simulations showed that these coevolving residues are involved in the correlated and anti-correlated motions. The correlated residues are within van der Waals contact and appear to maintain the active site architecture; the anti-correlated residues are mainly distributed on opposite sides of the catalytic cavity and coordinate the motions likely required for the substrate entry and product release. Our findings might have broad implications for proteins with the highly conserved (betaalpha)(8)-barrel in assessing the roles of amino-acids that are moderately conserved and not directly involved in the active site of the (beta/alpha)(8)-barrel. The results of this study could also provide useful information for further exploring the specific residue motions for the catalysis and protein design based on the (beta/alpha)(8)-barrel scaffold.

  3. 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.

  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. 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.

  6. 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.

  7. 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 ...

  8. 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.

  9. 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.

  10. 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).

  11. 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.

  12. 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.

  13. 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.

  14. 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

  15. 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...

  16. 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.

  17. 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.

  18. 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

  19. InterMap3D: predicting and visualizing co-evolving protein residues

    DEFF Research Database (Denmark)

    Oliveira, Rodrigo Gouveia; Roque, francisco jose sousa simôes almeida; Wernersson, Rasmus

    2009-01-01

    InterMap3D predicts co-evolving protein residues and plots them on the 3D protein structure. Starting with a single protein sequence, InterMap3D automatically finds a set of homologous sequences, generates an alignment and fetches the most similar 3D structure from the Protein Data Bank (PDB......). It can also accept a user-generated alignment. Based on the alignment, co-evolving residues are then predicted using three different methods: Row and Column Weighing of Mutual Information, Mutual Information/Entropy and Dependency. Finally, InterMap3D generates high-quality images of the protein...

  20. 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.

  1. 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...

  2. Coevolved Mutations Reveal Distinct Architectures for Two Core Proteins in the Bacterial Flagellar Motor.

    Directory of Open Access Journals (Sweden)

    Alessandro Pandini

    Full Text Available Switching of bacterial flagellar rotation is caused by large domain movements of the FliG protein triggered by binding of the signal protein CheY to FliM. FliG and FliM form adjacent multi-subunit arrays within the basal body C-ring. The movements alter the interaction of the FliG C-terminal (FliGC "torque" helix with the stator complexes. Atomic models based on the Salmonella entrovar C-ring electron microscopy reconstruction have implications for switching, but lack consensus on the relative locations of the FliG armadillo (ARM domains (amino-terminal (FliGN, middle (FliGM and FliGC as well as changes during chemotaxis. The generality of the Salmonella model is challenged by the variation in motor morphology and response between species. We studied coevolved residue mutations to determine the unifying elements of switch architecture. Residue interactions, measured by their coevolution, were formalized as a network, guided by structural data. Our measurements reveal a common design with dedicated switch and motor modules. The FliM middle domain (FliMM has extensive connectivity most simply explained by conserved intra and inter-subunit contacts. In contrast, FliG has patchy, complex architecture. Conserved structural motifs form interacting nodes in the coevolution network that wire FliMM to the FliGC C-terminal, four-helix motor module (C3-6. FliG C3-6 coevolution is organized around the torque helix, differently from other ARM domains. The nodes form separated, surface-proximal patches that are targeted by deleterious mutations as in other allosteric systems. The dominant node is formed by the EHPQ motif at the FliMMFliGM contact interface and adjacent helix residues at a central location within FliGM. The node interacts with nodes in the N-terminal FliGc α-helix triad (ARM-C and FliGN. ARM-C, separated from C3-6 by the MFVF motif, has poor intra-network connectivity consistent with its variable orientation revealed by structural data. ARM

  3. 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...

  4. 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.

  5. 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.

  6. 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

  7. 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

  8. Self-organization of complex networks as a dynamical system.

    Science.gov (United States)

    Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

    2015-01-01

    To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

  9. 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.

  10. 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

  11. 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.

  12. 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

  13. 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

  14. The contribution of coevolving residues to the stability of KDO8P synthase.

    Directory of Open Access Journals (Sweden)

    Sharon H Ackerman

    2011-03-01

    Full Text Available The evolutionary tree of 3-deoxy-D-manno-octulosonate 8-phosphate (KDO8P synthase (KDO8PS, a bacterial enzyme that catalyzes a key step in the biosynthesis of bacterial endotoxin, is evenly divided between metal and non-metal forms, both having similar structures, but diverging in various degrees in amino acid sequence. Mutagenesis, crystallographic and computational studies have established that only a few residues determine whether or not KDO8PS requires a metal for function. The remaining divergence in the amino acid sequence of KDO8PSs is apparently unrelated to the underlying catalytic mechanism.The multiple alignment of all known KDO8PS sequences reveals that several residue pairs coevolved, an indication of their possible linkage to a structural constraint. In this study we investigated by computational means the contribution of coevolving residues to the stability of KDO8PS. We found that about 1/4 of all strongly coevolving pairs probably originated from cycles of mutation (decreasing stability and suppression (restoring it, while the remaining pairs are best explained by a succession of neutral or nearly neutral covarions.Both sequence conservation and coevolution are involved in the preservation of the core structure of KDO8PS, but the contribution of coevolving residues is, in proportion, smaller. This is because small stability gains or losses associated with selection of certain residues in some regions of the stability landscape of KDO8PS are easily offset by a large number of possible changes in other regions. While this effect increases the tolerance of KDO8PS to deleterious mutations, it also decreases the probability that specific pairs of residues could have a strong contribution to the thermodynamic stability of the protein.

  15. 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.

  16. 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

  17. The Role of Functional Interdependencies in Global Operations Networks

    DEFF Research Database (Denmark)

    Slepniov, Dmitrij; Wæhrens, Brian Vejrum

    2011-01-01

    The existing studies do not adequately address the complex interplay between co-evolving production, innovation and service networks. The widening geographical and cognitive gap between these networks means that managing their interfaces in global operations context is becoming strategically...

  18. 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.

  19. 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....

  20. 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...

  1. 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

  2. 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.

  3. 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

  4. 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

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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).

  10. 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.

  11. 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.

  12. 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.

  13. Detecting groups of coevolving positions in a molecule: a clustering approach

    Directory of Open Access Journals (Sweden)

    Galtier Nicolas

    2007-11-01

    Full Text Available Abstract Background Although the patterns of co-substitutions in RNA is now well characterized, detection of coevolving positions in proteins remains a difficult task. It has been recognized that the signal is typically weak, due to the fact that (i amino-acid are characterized by various biochemical properties, so that distinct amino acids changes are not functionally equivalent, and (ii a given mutation can be compensated by more than one mutation, at more than one position. Results We present a new method based on phylogenetic substitution mapping. The two above-mentioned problems are addressed by (i the introduction of a weighted mapping, which accounts for the biochemical effects (volume, polarity, charge of amino-acid changes, (ii the use of a clustering approach to detect groups of coevolving sites of virtually any size, and (iii the distinction between biochemical compensation and other coevolutionary mechanisms. We apply this methodology to a previously studied data set of bacterial ribosomal RNA, and to three protein data sets (myoglobin of vertebrates, S-locus Receptor Kinase and Methionine Amino-Peptidase. Conclusion We succeed in detecting groups of sites which significantly depart the null hypothesis of independence. Group sizes range from pairs to groups of size ≃ 10, depending on the substitution weights used. The structural and functional relevance of these groups of sites are assessed, and the various evolutionary processes potentially generating correlated substitution patterns are discussed.

  14. 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

  15. 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.

  16. 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

  17. 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)

  18. 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.

  19. 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...

  20. 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

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. Finding coevolving amino acid residues using row and column weighting of mutual information and multi-dimensional amino acid representation

    DEFF Research Database (Denmark)

    Oliveira, Rodrigo Gouveia; Pedersen, Anders Gorm

    2007-01-01

    ABSTRACT: BACKGROUND: Some amino acid residues functionally interact with each other. This interaction will result in an evolutionary co-variation between these residues - coevolution. Our goal is to find these coevolving residues. RESULTS: We present six new methods for detecting coevolving...... residues. Among other things, we suggest measures that are variants of Mutual Information, and measures that use a multidimensional representation of each residue in order to capture the physico-chemical similarities between amino acids. We created a benchmarking system, in silico, able to evaluate...

  8. Spontaneous formation of dynamical groups in an adaptive networked system

    International Nuclear Information System (INIS)

    Li Menghui; Guan Shuguang; Lai, C-H

    2010-01-01

    In this work, we investigate a model of an adaptive networked dynamical system, where the coupling strengths among phase oscillators coevolve with the phase states. It is shown that in this model the oscillators can spontaneously differentiate into two dynamical groups after a long time evolution. Within each group, the oscillators have similar phases, while oscillators in different groups have approximately opposite phases. The network gradually converts from the initial random structure with a uniform distribution of connection strengths into a modular structure that is characterized by strong intra-connections and weak inter-connections. Furthermore, the connection strengths follow a power-law distribution, which is a natural consequence of the coevolution of the network and the dynamics. Interestingly, it is found that if the inter-connections are weaker than a certain threshold, the two dynamical groups will almost decouple and evolve independently. These results are helpful in further understanding the empirical observations in many social and biological networks.

  9. 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...

  10. 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.

  11. 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...

  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. Eco-evolutionary dynamics in a coevolving host-virus system.

    Science.gov (United States)

    Frickel, Jens; Sieber, Michael; Becks, Lutz

    2016-04-01

    Eco-evolutionary dynamics have been shown to be important for understanding population and community stability and their adaptive potential. However, coevolution in the framework of eco-evolutionary theory has not been addressed directly. Combining experiments with an algal host and its viral parasite, and mathematical model analyses we show eco-evolutionary dynamics in antagonistic coevolving populations. The interaction between antagonists initially resulted in arms race dynamics (ARD) with selective sweeps, causing oscillating host-virus population dynamics. However, ARD ended and populations stabilised after the evolution of a general resistant host, whereas a trade-off between host resistance and growth then maintained host diversity over time (trade-off driven dynamics). Most importantly, our study shows that the interaction between ecology and evolution had important consequences for the predictability of the mode and tempo of adaptive change and for the stability and adaptive potential of populations. © 2016 John Wiley & Sons Ltd/CNRS.

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  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. 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.

  11. 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

  12. 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)

  13. 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

  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-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).

  15. 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...

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. Plant-associated methylobacteria as co-evolved phytosymbionts: a hypothesis.

    Science.gov (United States)

    Kutschera, Ulrich

    2007-03-01

    Due to their wall-associated pectin metabolism, growing plant cells emit significant amounts of the one-carbon alcohol methanol. Pink-pigmented microbes of the genus Methylobacterium that colonize the surfaces of leaves (epiphytes) are capable of growth on this volatile C1-compound as sole source of carbon and energy. In this article the results of experiments with germ-free (gnotobiotic) sporophytes of angiosperms (sunflower, maize) and gametophytes of bryophytes (a moss and two liverwort species) are summarized. The data show that methylobacteria do not stimulate the growth of these angiosperms, but organ development in moss protonemata and in thalli of liverworts is considerably enhanced. Since methylobacteria produce and secrete cytokinins and auxin, a model of plant-microbe-interaction (symbiosis) is proposed in which the methanol-consuming bacteria are viewed as coevolved partners of the gametophyte that determine its growth, survival and reproduction (fitness). This symbiosis is restricted to the haploid cells of moisture-dependent "living fossil" plants; it does not apply to the diploid sporophytes of higher embryophytes, which are fully adapted to life on land and apparently produce sufficient amounts of endogenous phytohormones.

  1. Values in the Smart Grid: The co-evolving political economy of smart distribution

    International Nuclear Information System (INIS)

    Hall, Stephen; Foxon, Timothy J.

    2014-01-01

    Investing in smart grid infrastructure is a key enabler for the transition to low carbon energy systems. Recent work has characterised the costs and benefits of individual “smart” investments. The political economy of the UK electricity system, however, has co-evolved such that there is a mismatch between where benefits accrue and where costs are incurred, leading to a problem of value capture and redeployment. Further, some benefits of smart grids are less easy to price directly and can be classified as public goods, such as energy security and decarbonisation. This paper builds on systemic treatments of energy system transitions to characterise the co-evolution of value capture and structural incentives in the electricity distribution system, drawing on semi-structured interviews and focus groups undertaken with smart grid stakeholders in the UK. This leads to an identification of municipal scale values that may be important for business models for the delivery of smart infrastructure. Municipalities may thus pursue specific economic opportunities through smart grid investment. This supports recent practical interest in an expanded role for municipalities as partners and investors in smart grid infrastructures. - Highlights: • Smart grid investments can benefit municipal economic development. • Drawing on urban political economy we describe these values. • New values alter the smart grid investment problem. • New integration of urban policy and DNOs are proposed by this research. • Socio-technical approaches are enhanced by urban political economy and vice versa

  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. 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.

  7. 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)

  8. 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.

  9. 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

  10. 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)

  11. 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.

  12. 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.

  13. 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

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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

  20. 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.

  1. 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

  2. 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).

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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…

  8. 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.

  9. 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.

  10. 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.

  11. 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...

  12. 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.

  13. 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...

  14. 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.

  15. 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.

  16. 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.

  17. 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)

  18. 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.

  19. 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.

  20. 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)

  1. 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.

  2. 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

  3. 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.

  4. 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.

  5. 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.

  6. 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).

  7. 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.

  8. 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

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. Modeling growth and dissemination of lymphoma in a co-evolving lymph node: a diffuse-domain approach

    Science.gov (United States)

    Chuang, Yao-Li; Cristini, Vittorio; Chen, Ying; Li, Xiangrong; Frieboes, Hermann; Lowengrub, John

    2013-03-01

    While partial differential equation models of tumor growth have successfully described various spatiotemporal phenomena observed for in-vitro tumor spheroid experiments, one challenge towards taking these models to further study in-vivo tumors is that instead of relatively static tissue culture with regular boundary conditions, in-vivo tumors are often confined in organ tissues that co-evolve with the tumor growth. Here we adopt a recently developed diffuse-domain method to account for the co-evolving domain boundaries, adapting our previous in-vitro tumor model for the development of lymphoma encapsulated in a lymph node, which may swell or shrink due to proliferation and dissemination of lymphoma cells and treatment by chemotherapy. We use the model to study the induced spatial heterogeneity, which may arise as an emerging phenomenon in experimental observations and model analysis. Spatial heterogeneity is believed to lead to tumor infiltration patterns and reduce the efficacy of chemotherapy, leaving residuals that cause cancer relapse after the treatment. Understanding the spatiotemporal evolution of in-vivo tumors can be an essential step towards more effective strategies of curing cancer. Supported by NIH-PSOC grant 1U54CA143907-01.

  15. Identification of coevolving residues and coevolution potentials emphasizing structure, bond formation and catalytic coordination in protein evolution.

    Directory of Open Access Journals (Sweden)

    Daniel Y Little

    Full Text Available The structure and function of a protein is dependent on coordinated interactions between its residues. The selective pressures associated with a mutation at one site should therefore depend on the amino acid identity of interacting sites. Mutual information has previously been applied to multiple sequence alignments as a means of detecting coevolutionary interactions. Here, we introduce a refinement of the mutual information method that: 1 removes a significant, non-coevolutionary bias and 2 accounts for heteroscedasticity. Using a large, non-overlapping database of protein alignments, we demonstrate that predicted coevolving residue-pairs tend to lie in close physical proximity. We introduce coevolution potentials as a novel measure of the propensity for the 20 amino acids to pair amongst predicted coevolutionary interactions. Ionic, hydrogen, and disulfide bond-forming pairs exhibited the highest potentials. Finally, we demonstrate that pairs of catalytic residues have a significantly increased likelihood to be identified as coevolving. These correlations to distinct protein features verify the accuracy of our algorithm and are consistent with a model of coevolution in which selective pressures towards preserving residue interactions act to shape the mutational landscape of a protein by restricting the set of admissible neutral mutations.

  16. 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.

  17. 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.

  18. 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).

  19. 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.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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...

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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...

  10. 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

  11. 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

  12. 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)

  13. 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.

  14. 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.

  15. 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

  16. 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.

  17. 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.

  18. 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.

  19. 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…

  20. 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.

  1. 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

  2. Real/binary co-operative and co-evolving swarms based multivariable PID controller design of ball mill pulverizing system

    International Nuclear Information System (INIS)

    Menhas, Muhammad Ilyas; Fei Minrui; Wang Ling; Qian Lin

    2012-01-01

    Highlights: ► We extend the concept of co-operation and co-evolution in some PSO variants. ► We use developed co-operative PSOs in multivariable PID controller design/tuning. ► We find that co-operative PSOs converge faster and give high quality solutions. ► Dividing the search space among swarms improves search efficiency. ► The proposed methods allow the practitioner for heterogeneous problem formulation. - Abstract: In this paper, multivariable PID controller design based on cooperative and coevolving multiple swarms is demonstrated. A simplified multi-variable MIMO process model of a ball mill pulverizing system with steady state decoupler is considered. In order to formulate computational models of cooperative and coevolving multiple swarms three different algorithms like real coded PSO, discrete binary PSO (DBPSO) and probability based discrete binary PSO (PBPSO) are employed. Simulations are carried out on three composite functions simultaneously considering multiple objectives. The cooperative and coevolving multiple swarms based results are compared with the results obtained through single swarm based methods like real coded particle swarm optimization (PSO), discrete binary PSO (DBPSO), and probability based discrete binary PSO (PBPSO) algorithms. The cooperative and coevolving swarms based techniques outperform the real coded PSO, PBPSO, and the standard discrete binary PSO (DBPSO) algorithm in escaping from local optima. Furthermore, statistical analysis of the simulation results is performed to calculate the comparative reliability of various techniques. All of the techniques employed are suitable for controller tuning, however, the multiple cooperative and coevolving swarms based results are considerably better in terms of mean fitness, variance of fitness, and success rate in finding a feasible solution in comparison to those obtained using single swarm based methods.

  3. 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)

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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

  10. 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...

  11. 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.

  12. Goldilocks and the three inorganic equilibria: how Earth's chemistry and life coevolve to be nearly in tune.

    Science.gov (United States)

    Rickaby, R E M

    2015-03-13

    Life and the chemical environment are united in an inescapable feedback cycle. The periodic table of the elements essential for life has transformed over Earth's history, but, as today, evolved in tune with the elements available in abundance in the environment. The most revolutionary time in life's history was the advent and proliferation of oxygenic photosynthesis which forced the environment towards a greater degree of oxidation. Consideration of three inorganic chemical equilibria throughout this gradual oxygenation prescribes a phased release of trace metals to the environment, which appear to have coevolved with employment of these new chemicals by life. Evolution towards complexity was chemically constrained, and changes in availability of notably Fe, Zn and Cu paced the systematic development of complex organisms. Evolving life repeatedly catalysed its own chemical challenges via the unwitting release of new and initially toxic chemicals. Ultimately, the harnessing of these allowed life to advance to greater complexity, though the mechanism responsible for translating novel chemistry to heritable use remains elusive. Whether a chemical acts as a poison or a nutrient lies both in the dose and in its environmental history. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

  13. Host specificity, phenotype matching and the evolution of reproductive isolation in a coevolved plant-pollinator mutualism.

    Science.gov (United States)

    Himler, Anna G; Machado, Carlos A

    2009-12-01

    Coevolutionary interactions between plants and their associated pollinators and seed dispersers are thought to have promoted the diversification of flowering plants (Raven 1977; Regal 1977; Stebbins 1981). The actual mechanisms by which pollinators could drive species diversification in plants are not fully understood. However, it is thought that pollinator host specialization can influence the evolution of reproductive isolation among plant populations because the pollinator's choice of host is what determines patterns of gene flow in its host plant, and host choice may also have important consequences on pollinator and host fitness (Grant 1949; Bawa 1992). In this issue of Molecular Ecology, Smith et al. (2009) present a very interesting study that addresses how host specialization affects pollinator fitness and patterns of gene flow in a plant host. Several aspects of this study match elements of a seminal mathematical model of plant-pollinator codivergence (Kiester et al. 1984) suggesting that reciprocal selection for matched plant and pollinator reproductive traits may lead to speciation in the host and its pollinator when there is strong host specialization and a pattern of geographic subdivision. Smith et al.'s study represents an important step to fill the gap in our understanding of how reciprocal selection may lead to speciation in coevolved plant-pollinator mutualisms.

  14. 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

  15. 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

  16. 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.

  17. 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 ...

  18. 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.

  19. 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.

  20. 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

  1. 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

  2. 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.

  3. "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...

  4. 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

  5. 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...

  6. 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.

  7. 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.

  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. 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...

  10. 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.

  11. 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.

  12. 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.

  13. 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

  14. 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

  15. Correction for phylogeny, small number of observations and data redundancy improves the identification of coevolving amino acid pairs using mutual information

    DEFF Research Database (Denmark)

    Buslje, C.M.; Santos, J.; Delfino, J.M.

    2009-01-01

    Motivation: Mutual information (MI) theory is often applied to predict positional correlations in a multiple sequence alignment (MSA) to make possible the analysis of those positions structurally or functionally important in a given fold or protein family. Accurate identification of coevolving......-weighting techniques to reduce sequence redundancy and low-count corrections to account for small number of observations in limited size sequence families, can significantly improve the predictability of MI. The evaluation is made on large sets of both in silico-generated alignments as well as on biological sequence...

  16. 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.

  17. 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.

  18. 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

  19. 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.

  20. 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.

  1. 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

  2. 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

  3. 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

  4. 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 (

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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 .

  14. 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.

  15. 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.

  16. 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.

  17. 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

  18. 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.

  19. 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.

  20. 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

  1. 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

  2. Social networks, social interactions, and activity-travel behavior: a framework for microsimulation

    NARCIS (Netherlands)

    Arentze, T.A.; Timmermans, H.J.P.

    2007-01-01

    We argue that the social networks and activity-travel patterns of people interact and coevolve over time. Through social interaction, people exchange information about activity-travel choice alternatives and adapt their latent and overt preferences for alternatives to each other. At the same time,

  3. Functional inference of complex anatomical tendinous networks at a macroscopic scale via sparse experimentation.

    Science.gov (United States)

    Saxena, Anupam; Lipson, Hod; Valero-Cuevas, Francisco J

    2012-01-01

    In systems and computational biology, much effort is devoted to functional identification of systems and networks at the molecular-or cellular scale. However, similarly important networks exist at anatomical scales such as the tendon network of human fingers: the complex array of collagen fibers that transmits and distributes muscle forces to finger joints. This network is critical to the versatility of the human hand, and its function has been debated since at least the 16(th) century. Here, we experimentally infer the structure (both topology and parameter values) of this network through sparse interrogation with force inputs. A population of models representing this structure co-evolves in simulation with a population of informative future force inputs via the predator-prey estimation-exploration algorithm. Model fitness depends on their ability to explain experimental data, while the fitness of future force inputs depends on causing maximal functional discrepancy among current models. We validate our approach by inferring two known synthetic Latex networks, and one anatomical tendon network harvested from a cadaver's middle finger. We find that functionally similar but structurally diverse models can exist within a narrow range of the training set and cross-validation errors. For the Latex networks, models with low training set error [functional structure of complex anatomical networks. This work expands current bioinformatics inference approaches by demonstrating that sparse, yet informative interrogation of biological specimens holds significant computational advantages in accurate and efficient inference over random testing, or assuming model topology and only inferring parameters values. These findings also hold clues to both our evolutionary history and the development of versatile machines.

  4. 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

  5. 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.

  6. 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

  7. 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

  8. 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.

  9. 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.

  10. 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

  11. 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.

  12. 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

  13. 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.

  14. 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

  15. 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.

  16. 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.

  17. 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

  18. 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.

  19. 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.

  20. 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.

  1. 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...

  2. 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)

  3. Production, Innovation and Service Networks

    DEFF Research Database (Denmark)

    Slepniov, Dmitrij; Wæhrens, Brian Vejrum; Johansen, John

    2011-01-01

    is becoming strategically important. The purpose of this paper is to address this issue and to develop a number of propositions about how companies can organize these networks and coordinate between them effectively. The propositions are developed by employing the design science approach based on a literature......Production, innovation and service networks of companies all over the world become increasingly decentralized, specialized and interdependent. The three characteristics combined inevitably lead to the formation of complex configurations of assets and capabilities crossing both national...... and organisational borders. The existing studies do not adequately address the complex interplay between co-evolving production, innovation and service networks. The widening geographical and cognitive gap between these networks means that coordinating them and managing their interfaces in global operations context...

  4. Production, Innovation and Service Networks

    DEFF Research Database (Denmark)

    Slepniov, Dmitrij; Wæhrens, Brian Vejrum; Johansen, John

    2012-01-01

    Production, innovation and service networks of companies all over the world become increasingly decentralised, specialised and interdependent. These three characteristics combined inevitably lead to the formation of complex configurations of resources, crossing both national and organisational...... borders. The existing studies do not adequately address the complex interplay between co-evolving production, innovation and service networks. The widening geographical and cognitive gaps between these networks mean that coordinating them and managing their interfaces in a global operations context...... are becoming strategically important. The purpose of this paper is to address this issue and to develop a number of propositions about the development and organisation of these networks. The paper highlights the critical importance of engineering operations in this process. The propositions are developed...

  5. 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.

  6. 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

  7. 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

  8. 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.

  9. Governing Laws of Complex System Predictability under Co-evolving Uncertainty Sources: Theory and Nonlinear Geophysical Applications

    Science.gov (United States)

    Perdigão, R. A. P.

    2017-12-01

    Predictability assessments are traditionally made on a case-by-case basis, often by running the particular model of interest with randomly perturbed initial/boundary conditions and parameters, producing computationally expensive ensembles. These approaches provide a lumped statistical view of uncertainty evolution, without eliciting the fundamental processes and interactions at play in the uncertainty dynamics. In order to address these limitations, we introduce a systematic dynamical framework for predictability assessment and forecast, by analytically deriving governing equations of predictability in terms of the fundamental architecture of dynamical systems, independent of any particular problem under consideration. The framework further relates multiple uncertainty sources along with their coevolutionary interplay, enabling a comprehensive and explicit treatment of uncertainty dynamics along time, without requiring the actual model to be run. In doing so, computational resources are freed and a quick and effective a-priori systematic dynamic evaluation is made of predictability evolution and its challenges, including aspects in the model architecture and intervening variables that may require optimization ahead of initiating any model runs. It further brings out universal dynamic features in the error dynamics elusive to any case specific treatment, ultimately shedding fundamental light on the challenging issue of predictability. The formulated approach, framed with broad mathematical physics generality in mind, is then implemented in dynamic models of nonlinear geophysical systems with various degrees of complexity, in order to evaluate their limitations and provide informed assistance on how to optimize their design and improve their predictability in fundamental dynamical terms.

  10. How the indirect reciprocity with co-evolving norm and strategy for 2 × 2 prisoner's dilemma game works for emerging cooperation

    Science.gov (United States)

    Tanimoto, Jun; Sagara, Hirokji

    2015-11-01

    We built a new indirect reciprocity model based on binary image scores, where an agent's strategy and norm co-evolve. The norm, meaning what behavior is evaluated as "good" or "bad," stipulates how image scores of two agents playing a game is altered, which has been presumed to be a fixed value in most previous studies. Also, unlike former studies, our model allows an agent to play with an agent who has a different norm. This point of relaxing the freedom of the model pulls down cooperation level vis-à-vis the case where an agent always plays with another one having same norm. However, it is observed that a rather larger dilemma shows robust cooperation establishing compared with a smaller dilemma, since a norm that punishes a so-called second-order free-rider is prompted. To encourage the evolution of norms to be able to punish second-order free-riders, a society needs a small number of defectors. This is elucidated by the fact that cases with action error are more cooperative than those without action error.

  11. 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.

  12. 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

  13. 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.

  14. 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.

  15. 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.

  16. 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....

  17. 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

  18. 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.

  19. 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...

  20. 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.

  1. 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.

  2. 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–...

  3. 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.

  4. 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.

  5. 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

  6. 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.

  7. 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.

  8. 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

  9. 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

  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. 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.

  15. 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.

  16. 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

  17. 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

  18. 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

  19. 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

  20. 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

  1. 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.

  2. 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.

  3. 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

  4. 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

  5. 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.

  6. 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.

  7. 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).

  8. 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.

  9. 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...

  10. 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

  11. 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.

  12. 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

  13. 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)

    Looyestyn, Jemma; Kernot, Jocelyn; Boshoff, Kobie; Maher, Carol

    2018-02-26

    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. 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. 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. 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 by time differences (P=.16). There were

  14. Epidemic processes in complex networks

    Science.gov (United States)

    Pastor-Satorras, Romualdo; Castellano, Claudio; Van Mieghem, Piet; Vespignani, Alessandro

    2015-07-01

    In recent years the research community has accumulated overwhelming evidence for the emergence of complex and heterogeneous connectivity patterns in a wide range of biological and sociotechnical systems. The complex properties of real-world networks have a profound impact on the behavior of equilibrium and nonequilibrium phenomena occurring in various systems, and the study of epidemic spreading is central to our understanding of the unfolding of dynamical processes in complex networks. The theoretical analysis of epidemic spreading in heterogeneous networks requires the development of novel analytical frameworks, and it has produced results of conceptual and practical relevance. A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear. Physicists, mathematicians, epidemiologists, computer, and social scientists share a common interest in studying epidemic spreading and rely on similar models for the description of the diffusion of pathogens, knowledge, and innovation. For this reason, while focusing on the main results and the paradigmatic models in infectious disease modeling, the major results concerning generalized social contagion processes are also presented. Finally, the research activity at the forefront in the study of epidemic spreading in coevolving, coupled, and time-varying networks is reported.

  15. Spatial networks

    Science.gov (United States)

    Barthélemy, Marc

    2011-02-01

    Complex systems are very often organized under the form of networks where nodes and edges are embedded in space. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks, and neural networks, are all examples where space is relevant and where topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. An important consequence of space on networks is that there is a cost associated with the length of edges which in turn has dramatic effects on the topological structure of these networks. We will thoroughly explain the current state of our understanding of how the spatial constraints affect the structure and properties of these networks. We will review the most recent empirical observations and the most important models of spatial networks. We will also discuss various processes which take place on these spatial networks, such as phase transitions, random walks, synchronization, navigation, resilience, and disease spread.

  16. Data mining methods in the prediction of Dementia: A real-data comparison of the accuracy, sensitivity and specificity of linear discriminant analysis, logistic regression, neural networks, support vector machines, classification trees and random forests

    Directory of Open Access Journals (Sweden)

    Santana Isabel

    2011-08-01

    Full Text Available Abstract Background Dementia and cognitive impairment associated with aging are a major medical and social concern. Neuropsychological testing is a key element in the diagnostic procedures of Mild Cognitive Impairment (MCI, but has presently a limited value in the prediction of progression to dementia. We advance the hypothesis that newer statistical classification methods derived from data mining and machine learning methods like Neural Networks, Support Vector Machines and Random Forests can improve accuracy, sensitivity and specificity of predictions obtained from neuropsychological testing. Seven non parametric classifiers derived from data mining methods (Multilayer Perceptrons Neural Networks, Radial Basis Function Neural Networks, Support Vector Machines, CART, CHAID and QUEST Classification Trees and Random Forests were compared to three traditional classifiers (Linear Discriminant Analysis, Quadratic Discriminant Analysis and Logistic Regression in terms of overall classification accuracy, specificity, sensitivity, Area under the ROC curve and Press'Q. Model predictors were 10 neuropsychological tests currently used in the diagnosis of dementia. Statistical distributions of classification parameters obtained from a 5-fold cross-validation were compared using the Friedman's nonparametric test. Results Press' Q test showed that all classifiers performed better than chance alone (p Conclusions When taking into account sensitivity, specificity and overall classification accuracy Random Forests and Linear Discriminant analysis rank first among all the classifiers tested in prediction of dementia using several neuropsychological tests. These methods may be used to improve accuracy, sensitivity and specificity of Dementia predictions from neuropsychological testing.

  17. Percolation of interdependent network of networks

    International Nuclear Information System (INIS)

    Havlin, Shlomo; Stanley, H. Eugene; Bashan, Amir; Gao, Jianxi; Kenett, Dror Y.

    2015-01-01

    Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks, despite the fact that many real-world networks interact with and depend on each other. Very recently an analytical framework for studying the percolation properties of interacting networks has been introduced. Here we review the analytical framework and the results for percolation laws for a Network Of Networks (NONs) formed by n interdependent random networks. The percolation properties of a network of networks differ greatly from those of single isolated networks. In particular, because the constituent networks of a NON are connected by node dependencies, a NON is subject to cascading failure. When there is strong interdependent coupling between networks, the percolation transition is discontinuous (first-order) phase transition, unlike the well-known continuous second-order transition in single isolated networks. Moreover, although networks with broader degree distributions, e.g., scale-free networks, are more robust when analyzed as single networks, they become more vulnerable in a NON. We also review the effect of space embedding on network vulnerability. It is shown that for spatially embedded networks any finite fraction of dependency nodes will lead to abrupt transition

  18. Complex Networks

    CERN Document Server

    Evsukoff, Alexandre; González, Marta

    2013-01-01

    In the last decade we have seen the emergence of a new inter-disciplinary field focusing on the understanding of networks which are dynamic, large, open, and have a structure sometimes called random-biased. The field of Complex Networks is helping us better understand many complex phenomena such as the spread of  deseases, protein interactions, social relationships, to name but a few. Studies in Complex Networks are gaining attention due to some major scientific breakthroughs proposed by network scientists helping us understand and model interactions contained in large datasets. In fact, if we could point to one event leading to the widespread use of complex network analysis is the availability of online databases. Theories of Random Graphs from Erdös and Rényi from the late 1950s led us to believe that most networks had random characteristics. The work on large online datasets told us otherwise. Starting with the work of Barabási and Albert as well as Watts and Strogatz in the late 1990s, we now know th...

  19. Conflict and convention in dynamic networks.

    Science.gov (United States)

    Foley, Michael; Forber, Patrick; Smead, Rory; Riedl, Christoph

    2018-03-01

    An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioural strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here, we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models. © 2017 The Author(s).

  20. Atomoxetine Treatment Strengthens an Anti-Correlated Relationship between Functional Brain Networks in Medication-Naïve Adults with Attention-Deficit Hyperactivity Disorder: A Randomized Double-Blind Placebo-Controlled Clinical Trial.

    Science.gov (United States)

    Lin, Hsiang-Yuan; Gau, Susan Shur-Fen

    2015-09-16

    Although atomoxetine demonstrates efficacy in individuals with attention-deficit hyperactivity disorder, its treatment effects on brain resting-state functional connectivity remain unknown. Therefore, we aimed to investigate major brain functional networks in medication-naïve adults with attention-deficit hyperactivity disorder and the efficacy of atomoxetine treatment on resting-state functional connectivity. After collecting baseline resting-state functional MRI scans from 24 adults with attention-deficit hyperactivity disorder (aged 18-52 years) and 24 healthy controls (matched in demographic characteristics), the participants with attention-deficit hyperactivity disorder were randomly assigned to atomoxetine (n=12) and placebo (n=12) arms in an 8-week, double-blind, placebo-controlled trial. The primary outcome was functional connectivity assessed by a resting-state functional MRI. Seed-based functional connectivity was calculated and compared for the affective, attention, default, and cognitive control networks. At baseline, we found atypical cross talk between the default, cognitive control, and dorsal attention networks and hypoconnectivity within the dorsal attention and default networks in adults with attention-deficit hyperactivity disorder. Our first-ever placebo-controlled clinical trial incorporating resting-state functional MRI showed that treatment with atomoxetine strengthened an anticorrelated relationship between the default and task-positive networks and modulated all major brain networks. The strengthened anticorrelations were associated with improving clinical symptoms in the atomoxetine-treated adults. Our results support the idea that atypical default mode network task-positive network interaction plays an important role in the pathophysiology of adult attention-deficit hyperactivity disorder. Strengthening this atypical relationship following atomoxetine treatment suggests an important pathway to treat attention-deficit hyperactivity

  1. Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach

    Directory of Open Access Journals (Sweden)

    Luan Yihui

    2009-09-01

    Full Text Available Abstract Background Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks. Results Recent studies have shown that the degree distribution of the nodes is not an adequate statistic in many molecular networks. We sought to extend this statistic with 2nd and 3rd order degree correlations and developed a pseudo-likelihood approach to estimate the parameters. The approach was used to analyze the MIPS and BIOGRID yeast protein interaction networks, and two yeast coexpression networks. We showed that 2nd order degree correlation information gave better predictions of gene interactions in both protein interaction and gene coexpression networks. However, in the biologically important task of predicting functionally homogeneous modules, degree correlation information performs marginally better in the case of the MIPS and BIOGRID protein interaction networks, but worse in the case of gene coexpression networks. Conclusion Our use of dK models showed that incorporation of degree correlations could increase predictive power in some contexts, albeit sometimes marginally, but, in all contexts, the use of third-order degree correlations decreased accuracy. However, it is possible that other parameter estimation methods, such as maximum likelihood, will show the usefulness of incorporating 2nd and 3rd degree correlations in predicting functionally homogeneous modules.

  2. Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach.

    Science.gov (United States)

    Wang, Wenhui; Nunez-Iglesias, Juan; Luan, Yihui; Sun, Fengzhu

    2009-09-03

    Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks. Recent studies have shown that the degree distribution of the nodes is not an adequate statistic in many molecular networks. We sought to extend this statistic with 2nd and 3rd order degree correlations and developed a pseudo-likelihood approach to estimate the parameters. The approach was used to analyze the MIPS and BIOGRID yeast protein interaction networks, and two yeast coexpression networks. We showed that 2nd order degree correlation information gave better predictions of gene interactions in both protein interaction and gene coexpression networks. However, in the biologically important task of predicting functionally homogeneous modules, degree correlation information performs marginally better in the case of the MIPS and BIOGRID protein interaction networks, but worse in the case of gene coexpression networks. Our use of dK models showed that incorporation of degree correlations could increase predictive power in some contexts, albeit sometimes marginally, but, in all contexts, the use of third-order degree correlations decreased accuracy. However, it is possible that other parameter estimation methods, such as maximum likelihood, will show the usefulness of incorporating 2nd and 3rd degree correlations in predicting functionally homogeneous modules.

  3. Comparison between Random Forests, Artificial Neural Networks and Gradient Boosted Machines Methods of On-Line Vis-NIR Spectroscopy Measurements of Soil Total Nitrogen and Total Carbon

    Directory of Open Access Journals (Sweden)

    Said Nawar

    2017-10-01

    Full Text Available Accurate and detailed spatial soil information about within-field variability is essential for variable-rate applications of farm resources. Soil total nitrogen (TN and total carbon (TC are important fertility parameters that can be measured with on-line (mobile visible and near infrared (vis-NIR spectroscopy. This study compares the performance of local farm scale calibrations with those based on the spiking of selected local samples from both fields into an European dataset for TN and TC estimation using three modelling techniques, namely gradient boosted machines (GBM, artificial neural networks (ANNs and random forests (RF. The on-line measurements were carried out using a mobile, fiber type, vis-NIR spectrophotometer (305–2200 nm (AgroSpec from tec5, Germany, during which soil spectra were recorded in diffuse reflectance mode from two fields in the UK. After spectra pre-processing, the entire datasets were then divided into calibration (75% and prediction (25% sets, and calibration models for TN and TC were developed using GBM, ANN and RF with leave-one-out cross-validation. Results of cross-validation showed that the effect of spiking of local samples collected from a field into an European dataset when combined with RF has resulted in the highest coefficients of determination (R2 values of 0.97 and 0.98, the lowest root mean square error (RMSE of 0.01% and 0.10%, and the highest residual prediction deviations (RPD of 5.58 and 7.54, for TN and TC, respectively. Results for laboratory and on-line predictions generally followed the same trend as for cross-validation in one field, where the spiked European dataset-based RF calibration models outperformed the corresponding GBM and ANN models. In the second field ANN has replaced RF in being the best performing. However, the local field calibrations provided lower R2 and RPD in most cases. Therefore, from a cost-effective point of view, it is recommended to adopt the spiked European dataset

  4. Robustness Envelopes of Networks

    NARCIS (Netherlands)

    Trajanovski, S.; Martín-Hernández, J.; Winterbach, W.; Van Mieghem, P.

    2013-01-01

    We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case

  5. Coevolution analysis of Hepatitis C virus genome to identify the structural and functional dependency network of viral proteins

    Science.gov (United States)

    Champeimont, Raphaël; Laine, Elodie; Hu, Shuang-Wei; Penin, Francois; Carbone, Alessandra

    2016-05-01

    A novel computational approach of coevolution analysis allowed us to reconstruct the protein-protein interaction network of the Hepatitis C Virus (HCV) at the residue resolution. For the first time, coevolution analysis of an entire viral genome was realized, based on a limited set of protein sequences with high sequence identity within genotypes. The identified coevolving residues constitute highly relevant predictions of protein-protein interactions for further experimental identification of HCV protein complexes. The method can be used to analyse other viral genomes and to predict the associated protein interaction networks.

  6. The effects of computer-based mindfulness training on Self-control and Mindfulness within Ambulatorily assessed network Systems across Health-related domains in a healthy student population (SMASH): study protocol for a randomized controlled trial.

    Science.gov (United States)

    Rowland, Zarah; Wenzel, Mario; Kubiak, Thomas

    2016-12-01

    Self-control is an important ability in everyday life, showing associations with health-related outcomes. The aim of the Self-control and Mindfulness within Ambulatorily assessed network Systems across Health-related domains (SMASH) study is twofold: first, the effectiveness of a computer-based mindfulness training will be evaluated in a randomized controlled trial. Second, the SMASH study implements a novel network approach in order to investigate complex temporal interdependencies of self-control networks across several domains. The SMASH study is a two-armed, 6-week, non-blinded randomized controlled trial that combines seven weekly laboratory meetings and 40 days of electronic diary assessments with six prompts per day in a healthy undergraduate student population at the Johannes Gutenberg University Mainz, Germany. Participants will be randomly assigned to (1) receive a computer-based mindfulness intervention or (2) to a wait-list control condition. Primary outcomes are self-reported momentary mindfulness and self-control assessed via electronic diaries. Secondary outcomes are habitual mindfulness and habitual self-control. Further measures include self-reported behaviors in specific self-control domains: emotion regulation, alcohol consumption and eating behaviors. The effects of mindfulness training on primary and secondary outcomes are explored using three-level mixed models. Furthermore, networks will be computed with vector autoregressive mixed models to investigate the dynamics at participant and group level. This study was approved by the local ethics committee (reference code 2015_JGU_psychEK_011) and follows the standards laid down in the Declaration of Helsinki (2013). This randomized controlled trial combines an intensive Ambulatory Assessment of 40 consecutive days and seven laboratory meetings. By implementing a novel network approach, underlying processes of self-control within different health domains will be identified. These results will

  7. Randomization tests

    CERN Document Server

    Edgington, Eugene

    2007-01-01

    Statistical Tests That Do Not Require Random Sampling Randomization Tests Numerical Examples Randomization Tests and Nonrandom Samples The Prevalence of Nonrandom Samples in Experiments The Irrelevance of Random Samples for the Typical Experiment Generalizing from Nonrandom Samples Intelligibility Respect for the Validity of Randomization Tests Versatility Practicality Precursors of Randomization Tests Other Applications of Permutation Tests Questions and Exercises Notes References Randomized Experiments Unique Benefits of Experiments Experimentation without Mani

  8. Assessment of contamination and misclassification biases in a randomized controlled trial of a social network peer education intervention to reduce HIV risk behaviors among drug users and risk partners in Philadelphia, PA and Chiang Mai, Thailand.

    Science.gov (United States)

    Simmons, Nicole; Donnell, Deborah; Ou, San-San; Celentano, David D; Aramrattana, Apinun; Davis-Vogel, Annet; Metzger, David; Latkin, Carl

    2015-10-01

    Controlled trials of HIV prevention and care interventions are susceptible to contamination. In a randomized controlled trial of a social network peer education intervention among people who inject drugs and their risk partners in Philadelphia, PA and Chiang Mai, Thailand, we tested a contamination measure based on recall of intervention terms. We assessed the recall of test, negative and positive control terms among intervention and control arm participants and compared the relative odds of recall of test versus negative control terms between study arms. The contamination measures showed good discriminant ability among participants in Chiang Mai. In Philadelphia there was no evidence of contamination and little evidence of diffusion. In Chiang Mai there was strong evidence of diffusion and contamination. Network structure and peer education in Chiang Mai likely led to contamination. Recall of intervention materials can be a useful method to detect contamination in experimental interventions.

  9. Vijana Vijiweni II: a cluster-randomized trial to evaluate the efficacy of a microfinance and peer health leadership intervention for HIV and intimate partner violence prevention among social networks of young men in Dar es Salaam.

    Science.gov (United States)

    Kajula, Lusajo; Balvanz, Peter; Kilonzo, Mrema Noel; Mwikoko, Gema; Yamanis, Thespina; Mulawa, Marta; Kajuna, Deus; Hill, Lauren; Conserve, Donaldson; Reyes, Heathe Luz McNaughton; Leatherman, Sheila; Singh, Basant; Maman, Suzanne

    2016-02-03

    Intimate partner violence (IPV) and sexually transmitted infections (STIs), including HIV, remain important public health problems with devastating health effects for men and women in sub-Saharan Africa. There have been calls to engage men in prevention efforts, however, we lack effective approaches to reach and engage them. Social network approaches have demonstrated effective and sustained outcomes on changing risk behaviors in the U.S. Our team has identified and engaged naturally occurring social networks comprised mostly of young men in Dar es Salaam in an intervention designed to jointly reduce STI incidence and the perpetration of IPV. These stable networks are locally referred to as "camps." In a pilot study we demonstrated the feasibility and acceptability of a combined microfinance and peer health leadership intervention within these camp-based peer networks. We are implementing a cluster-randomized trial to evaluate the efficacy of an intervention combining microfinance with health leadership training in 60 camps in Dar es Salaam, Tanzania. Half of the camps have been randomized to the intervention arm, and half to a control arm. The camps in the intervention arm will receive a combined microfinance and health leadership intervention for a period of two years. The camps in the control arm will receive a delayed intervention. We have enrolled 1,258 men across the 60 study camps. Behavioral surveys will be conducted at baseline, 12-months post intervention launch and 30-month post intervention launch and biological samples will be drawn to test for Neisseria gonorrhea (NG), Chlamydia trachomatis (CT), and Trichomonas vaginalis (TV) at baseline and 30-months. The primary endpoints for assessing intervention impact are IPV perpetration and STI incidence. This is the first cluster-randomized trial targeting social networks of men in sub-Saharan Africa that jointly addresses HIV and IPV perpetration and has both biological and behavioral endpoints. Effective

  10. Adaptive co-evolution of strategies and network leading to optimal cooperation level in spatial prisoner's dilemma game

    International Nuclear Information System (INIS)

    Han-Shuang, Chen; Zhong-Huai, Hou; Hou-Wen, Xin; Ji-Qian, Zhang

    2010-01-01

    We study evolutionary prisoner's dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategies either rewire the link between them with probability p or update their strategies with probability 1 – p depending on their payoffs. Numerical simulation shows that the final network is either split into some disconnected communities whose players share the same strategy within each community or forms a single connected network in which all nodes are in the same strategy. Interestingly, the density of cooperators in the final state can be maximised in an intermediate range of p via the competition between time scale of the network dynamics and that of the node dynamics. Finally, the mean-field analysis helps to understand the results of numerical simulation. Our results may provide some insight into understanding the emergence of cooperation in the real situation where the individuals' behaviour and their relationship adaptively co-evolve. (general)

  11. Autonomous Byte Stream Randomizer

    Science.gov (United States)

    Paloulian, George K.; Woo, Simon S.; Chow, Edward T.

    2013-01-01

    Net-centric networking environments are often faced with limited resources and must utilize bandwidth as efficiently as possible. In networking environments that span wide areas, the data transmission has to be efficient without any redundant or exuberant metadata. The Autonomous Byte Stream Randomizer software provides an extra level of security on top of existing data encryption methods. Randomizing the data s byte stream adds an extra layer to existing data protection methods, thus making it harder for an attacker to decrypt protected data. Based on a generated crypto-graphically secure random seed, a random sequence of numbers is used to intelligently and efficiently swap the organization of bytes in data using the unbiased and memory-efficient in-place Fisher-Yates shuffle method. Swapping bytes and reorganizing the crucial structure of the byte data renders the data file unreadable and leaves the data in a deconstructed state. This deconstruction adds an extra level of security requiring the byte stream to be reconstructed with the random seed in order to be readable. Once the data byte stream has been randomized, the software enables the data to be distributed to N nodes in an environment. Each piece of the data in randomized and distributed form is a separate entity unreadable on its own right, but when combined with all N pieces, is able to be reconstructed back to one. Reconstruction requires possession of the key used for randomizing the bytes, leading to the generation of the same cryptographically secure random sequence of numbers used to randomize the data. This software is a cornerstone capability possessing the ability to generate the same cryptographically secure sequence on different machines and time intervals, thus allowing this software to be used more heavily in net-centric environments where data transfer bandwidth is limited.

  12. Design and methods of a social network isolation study for reducing respiratory infection transmission: The eX-FLU cluster randomized trial

    Directory of Open Access Journals (Sweden)

    Allison E. Aiello

    2016-06-01

    Conclusions/significance: We identified a feasible study design for testing the impact of isolation 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 space for managing survey and smartphone data.

  13. Selection pressure transforms the nature of social dilemmas in adaptive networks

    Energy Technology Data Exchange (ETDEWEB)

    Van Segbroeck, Sven; Lenaerts, Tom [MLG, Universite Libre de Bruxelles, Boulevard du Triomphe-CP 212, 1050 Brussels (Belgium); Santos, Francisco C [CENTRIA, Departamento de Informatica, Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, 2829-516 Caparica (Portugal); Pacheco, Jorge M, E-mail: svsegbro@ulb.ac.be, E-mail: fcsantos@fct.unl.pt, E-mail: tlenaert@ulb.ac.be, E-mail: jmpacheco@math.uminho.pt [ATP-Group, CMAF, Complexo Interdisciplinar, P-1649-003 Lisboa Codex (Portugal)

    2011-01-15

    We have studied the evolution of cooperation in structured populations whose topology coevolves with the game strategies of the individuals. Strategy evolution proceeds according to an update rule with a free parameter, which measures the selection pressure. We explore how this parameter affects the interplay between network dynamics and strategy dynamics. A dynamical network topology can influence the strategy dynamics in two ways: (i) by modifying the expected payoff associated with each strategy and (ii) by reshaping the imitation network that underlies the evolutionary process. We show here that the selection pressure tunes the relative contribution of each of these two forces to the final outcome of strategy evolution. The dynamics of the imitation network plays only a minor role under strong selection, but becomes the dominant force under weak selection. We demonstrate how these findings constitute a mechanism supporting cooperative behavior.

  14. Selection pressure transforms the nature of social dilemmas in adaptive networks

    International Nuclear Information System (INIS)

    Van Segbroeck, Sven; Lenaerts, Tom; Santos, Francisco C; Pacheco, Jorge M

    2011-01-01

    We have studied the evolution of cooperation in structured populations whose topology coevolves with the game strategies of the individuals. Strategy evolution proceeds according to an update rule with a free parameter, which measures the selection pressure. We explore how this parameter affects the interplay between network dynamics and strategy dynamics. A dynamical network topology can influence the strategy dynamics in two ways: (i) by modifying the expected payoff associated with each strategy and (ii) by reshaping the imitation network that underlies the evolutionary process. We show here that the selection pressure tunes the relative contribution of each of these two forces to the final outcome of strategy evolution. The dynamics of the imitation network plays only a minor role under strong selection, but becomes the dominant force under weak selection. We demonstrate how these findings constitute a mechanism supporting cooperative behavior.

  15. On the Delay Characteristics for Point-to-Point links using Random Linear Network Coding with On-the-fly Coding Capabilities

    DEFF Research Database (Denmark)

    Tömösközi, Máté; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2014-01-01

    Video surveillance and similar real-time applications on wireless networks require increased reliability and high performance of the underlying transmission layer. Classical solutions, such as Reed-Solomon codes, increase the reliability, but typically have the negative side-effect of additional ...

  16. Random walk on random walks

    NARCIS (Netherlands)

    Hilário, M.; Hollander, den W.Th.F.; Sidoravicius, V.; Soares dos Santos, R.; Teixeira, A.

    2014-01-01

    In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ¿¿(0,8). At each step the random walk performs a nearest-neighbour jump, moving to

  17. Effect of random edge failure on the average path length

    Energy Technology Data Exchange (ETDEWEB)

    Guo Dongchao; Liang Mangui; Li Dandan; Jiang Zhongyuan, E-mail: mgliang58@gmail.com, E-mail: 08112070@bjtu.edu.cn [Institute of Information Science, Beijing Jiaotong University, 100044, Beijing (China)

    2011-10-14

    We study the effect of random removal of edges on the average path length (APL) in a large class of uncorrelated random networks in which vertices are characterized by hidden variables controlling the attachment of edges between pairs of vertices. A formula for approximating the APL of networks suffering random edge removal is derived first. Then, the formula is confirmed by simulations for classical ER (Erdoes and Renyi) random graphs, BA (Barabasi and Albert) networks, networks with exponential degree distributions as well as random networks with asymptotic power-law degree distributions with exponent {alpha} > 2. (paper)

  18. Pilot study of a social network intervention for heroin users in opiate substitution treatment: study protocol for a randomized controlled trial

    OpenAIRE

    Day, E.; Copello, A.; Seddon, J. L.; Christie, M.; Bamber, D.; Powell, C.; George, S.; Ball, A.; Frew, E.; Freemantle, N.

    2013-01-01

    Background 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 suppo...

  19. Tailored Random Graph Ensembles

    International Nuclear Information System (INIS)

    Roberts, E S; Annibale, A; Coolen, A C C

    2013-01-01

    Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.

  20. Intraoperative and postoperative feasibility and safety of total tubeless, tubeless, small-bore tube, and standard percutaneous nephrolithotomy: a systematic review and network meta-analysis of 16 randomized controlled trials.

    Science.gov (United States)

    Lee, Joo Yong; Jeh, Seong Uk; Kim, Man Deuk; Kang, Dong Hyuk; Kwon, Jong Kyou; Ham, Won Sik; Choi, Young Deuk; Cho, Kang Su

    2017-06-27

    Percutaneous nephrolithotomy (PCNL) is performed to treat relatively large renal stones. Recent publications indicate that tubeless and total tubeless (stentless) PCNL is safe in selected patients. We performed a systematic review and network meta-analysis to evaluate the feasibility and safety of different PCNL procedures, including total tubeless, tubeless with stent, small-bore tube, and large-bore tube PCNLs. PubMed, Cochrane Central Register of Controlled Trials, and EMBASE™ databases were searched to identify randomized controlled trials published before December 30, 2013. One researcher examined all titles and abstracts found by the searches. Two investigators independently evaluated the full-text articles to determine whether those met the inclusion criteria. Qualities of included studies were rated with Cochrane's risk-of-bias assessment tool. Sixteen studies were included in the final syntheses including pairwise and network meta-analyses. Operation time, pain scores, and transfusion rates were not significantly different between PCNL procedures. Network meta-analyses demonstrated that for hemoglobin changes, total tubeless PCNL may be superior to standard PCNL (mean difference [MD] 0.65, 95% CI 0.14-1.13) and tubeless PCNLs with stent (MD -1.14, 95% CI -1.65--0.62), and small-bore PCNL may be superior to tubeless PCNL with stent (MD 1.30, 95% CI 0.27-2.26). Network meta-analyses also showed that for length of hospital stay, total tubeless (MD 1.33, 95% CI 0.23-2.43) and tubeless PCNLs with stent (MD 0.99, 95% CI 0.19-1.79) may be superior to standard PCNL. In rank probability tests, small-bore tube and total tubeless PCNLs were superior for operation time, pain scores, and hemoglobin changes. For hemoglobin changes, total tubeless and small-bore PCNLs may be superior to other methods. For hospital stay, total tubeless and tubeless PCNLs with stent may be superior to other procedures.

  1. Effects of specific surface area and porosity on cube counting fractal dimension, lacunarity, configurational entropy, and permeability of model porous networks: Random packing simulations and NMR micro-imaging study

    Science.gov (United States)

    Lee, Bum Han; Lee, Sung Keun

    2013-07-01

    Despite the importance of understanding and quantifying the microstructure of porous networks in diverse geologic settings, the effects of the specific surface area and porosity on the key structural parameters of the networks have not been fully understood. We performed cube-counting fractal dimension (Dcc) and lacunarity analyses of 3D porous networks of model sands and configurational entropy analysis of 2D cross sections of model sands using random packing simulations and nuclear magnetic resonance (NMR) micro-imaging. We established relationships among porosity, specific surface area, structural parameters (Dcc and lacunarity), and the corresponding macroscopic properties (configurational entropy and permeability). The Dcc of the 3D porous networks increases with increasing specific surface area at a constant porosity and with increasing porosity at a constant specific surface area. Predictive relationships correlating Dcc, specific surface area, and porosity were also obtained. The lacunarity at the minimum box size decreases with increasing porosity, and that at the intermediate box size (∼0.469 mm in the current model sands) was reproduced well with specific surface area. The maximum configurational entropy increases with increasing porosity, and the entropy length of the pores decreases with increasing specific surface area and was used to calculate the average connectivity among the pores. The correlation among porosity, specific surface area, and permeability is consistent with the prediction from the Kozeny-Carman equation. From the relationship between the permeability and the Dcc of pores, the permeability can be expressed as a function of the Dcc of pores and porosity. The current methods and these newly identified correlations among structural parameters and properties provide improved insights into the nature of porous media and have useful geophysical and hydrological implications for elasticity and shear viscosity of complex composites of rock

  2. Unifying Pore Network Modeling, Continuous Time Random Walk (CTRW) Theory and Experiment to Describe Impact of Spatial Heterogeneities on Solute Dispersion at Multiple Length-scales

    Science.gov (United States)

    Bijeljic, B.; Blunt, M. J.; Rhodes, M. E.

    2009-04-01

    This talk will describe and highlight the advantages offered by a novel 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 dispersion of solute particles. Dispersion is traditionally described by dispersion coefficients, D, that are commonly calculated from the spatial moments of the plume. 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. The length traveled by solute plumes before Gaussian behaviour is reached increases with an increase in heterogeneity and/or Pe. This opens up the question on the nature of dispersion in natural systems where the heterogeneities at the larger scales will significantly increase the range of

  3. Random magnetism

    International Nuclear Information System (INIS)

    Tahir-Kheli, R.A.

    1975-01-01

    A few simple problems relating to random magnetic systems are presented. Translational symmetry, only on the macroscopic scale, is assumed for these systems. A random set of parameters, on the microscopic scale, for the various regions of these systems is also assumed. A probability distribution for randomness is obeyed. Knowledge of the form of these probability distributions, is assumed in all cases [pt

  4. Evidence for the additions of clustered interacting nodes during the evolution of protein interaction networks from network motifs

    Directory of Open Access Journals (Sweden)

    Guo Hao

    2011-05-01

    Full Text Available Abstract Background High-throughput screens have revealed large-scale protein interaction networks defining most cellular functions. How the proteins were added to the protein interaction network during its growth is a basic and important issue. Network motifs represent the simplest building blocks of cellular machines and are of biological significance. Results Here we study the evolution of protein interaction networks from the perspective of network motifs. We find that in current protein interaction networks, proteins of the same age class tend to form motifs and such co-origins of motif constituents are affected by their topologies and biological functions. Further, we find that the proteins within motifs whose constituents are of the same age class tend to be densely interconnected, co-evolve and share the same biological functions, and these motifs tend to be within protein complexes. Conclusions Our findings provide novel evidence for the hypothesis of the additions of clustered interacting nodes and point out network motifs, especially the motifs with the dense topology and specific function may play important roles during this process. Our results suggest functional constraints may be the underlying driving force for such additions of clustered interacting nodes.

  5. Computing preimages of Boolean networks.

    Science.gov (United States)

    Klotz, Johannes; Bossert, Martin; Schober, Steffen

    2013-01-01

    In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.

  6. Randomized random walk on a random walk

    International Nuclear Information System (INIS)

    Lee, P.A.

    1983-06-01

    This paper discusses generalizations of the model introduced by Kehr and Kunter of the random walk of a particle on a one-dimensional chain which in turn has been constructed by a random walk procedure. The superimposed random walk is randomised in time according to the occurrences of a stochastic point process. The probability of finding the particle in a particular position at a certain instant is obtained explicitly in the transform domain. It is found that the asymptotic behaviour for large time of the mean-square displacement of the particle depends critically on the assumed structure of the basic random walk, giving a diffusion-like term for an asymmetric walk or a square root law if the walk is symmetric. Many results are obtained in closed form for the Poisson process case, and these agree with those given previously by Kehr and Kunter. (author)

  7. A combined community- and facility-based approach to improve pregnancy outcomes in low-resource settings: a Global Network cluster randomized trial.

    Science.gov (United States)

    Pasha, Omrana; McClure, Elizabeth M; Wright, Linda L; Saleem, Sarah; Goudar, Shivaprasad S; Chomba, Elwyn; Patel, Archana; Esamai, Fabian; Garces, Ana; Althabe, Fernando; Kodkany, Bhala; Mabeya, Hillary; Manasyan, Albert; Carlo, Waldemar A; Derman, Richard J; Hibberd, Patricia L; Liechty, Edward K; Krebs, Nancy; Hambidge, K Michael; Buekens, Pierre; Moore, Janet; Jobe, Alan H; Koso-Thomas, Marion; Wallace, Dennis D; Stalls, Suzanne; Goldenberg, Robert L

    2013-10-03

    Fetal and neonatal mortality rates in low-income countries are at least 10-fold greater than in high-income countries. These differences have been related to poor access to and poor quality of obstetric and neonatal care. This trial tested the hypothesis that teams of health care providers, administrators and local residents can address the problem of limited access to quality obstetric and neonatal care and lead to a reduction in perinatal mortality in intervention compared to control locations. In seven geographic areas in five low-income and one middle-income country, most with high perinatal mortality rates and substantial numbers of home deliveries, we performed a cluster randomized non-masked trial of a package of interventions that included community mobilization focusing on birth planning and hospital transport, community birth attendant training in problem recognition, and facility staff training in the management of obstetric and neonatal emergencies. The primary outcome was perinatal mortality at ≥28 weeks gestation or birth weight ≥1000 g. Despite extensive effort in all sites in each of the three intervention areas, no differences emerged in the primary or any secondary outcome between the intervention and control clusters. In both groups, the mean perinatal mortality was 40.1/1,000 births (P = 0.9996). Neither were there differences between the two groups in outcomes in the last six months of the project, in the year following intervention cessation, nor in the clusters that best implemented the intervention. This cluster randomized comprehensive, large-scale, multi-sector intervention did not result in detectable impact on the proposed outcomes. While this does not negate the importance of these interventions, we expect that achieving improvement in pregnancy outcomes in these settings will require substantially more obstetric and neonatal care infrastructure than was available at the sites during this trial, and without them provider training

  8. Comparison of Eye Movement Desensitization Reprocessing and Cognitive Behavioral Therapy as Adjunctive Treatments for Recurrent Depression: The European Depression EMDR Network (EDEN Randomized Controlled Trial

    Directory of Open Access Journals (Sweden)

    Luca Ostacoli

    2018-02-01

    Full Text Available Background: Treatment of recurrent depressive disorders is currently only moderately successful. Increasing evidence suggests a significant relationship between adverse childhood experiences and recurrent depressive disorders, suggesting that trauma-based interventions could be useful for these patients.Objectives: To investigate the efficacy of Eye Movement Desensitization and Reprocessing therapy (EMDR in addition to antidepressant medication (ADM in treating recurrent depression.Design: A non-inferiority, single-blind, randomized clinical controlled trial comparing EMDR or CBT as adjunctive treatments to ADM. Randomization was carried out by a central computer system. Allocation was carried out by a study coordinator in each center.Setting: Two psychiatric services, one in Italy and one in Spain.Participants: Eighty-two patients were randomized with a 1:1 ratio to the EMDR group (n = 40 or CBT group (n = 42. Sixty-six patients, 31 in the EMDR group and 35 in the CBT group, were included in the completers analysis. Intervention: 15 ± 3 individual sessions of EMDR or CBT, both in addition to ADM. Participants were followed up at 6-months.Main outcome measure: Rate of depressive symptoms remission in both groups, as measured by a BDI-II score <13.Results: Sixty-six patients were analyzed as completers (31 EMDR vs. 35 CBT. No significant difference between the two groups was found either at the end of the interventions (71% EMDR vs. 48.7% CBT or at the 6-month follow-up (54.8% EMDR vs. 42.9% CBT. A RM-ANOVA on BDI-II scores showed similar reductions over time in both groups [F(6,59 = 22.501, p < 0.001] and a significant interaction effect between time and group [F(6,59 = 3.357, p = 0.006], with lower BDI-II scores in the EMDR group at T1 [mean difference = –7.309 (95% CI [–12.811, –1.806], p = 0.010]. The RM-ANOVA on secondary outcome measures showed similar improvement over time in both groups [F(14,51 = 8.202, p < 0.001], with no

  9. Comparison of Eye Movement Desensitization Reprocessing and Cognitive Behavioral Therapy as Adjunctive Treatments for Recurrent Depression: The European Depression EMDR Network (EDEN) Randomized Controlled Trial.

    Science.gov (United States)

    Ostacoli, Luca; Carletto, Sara; Cavallo, Marco; Baldomir-Gago, Paula; Di Lorenzo, Giorgio; Fernandez, Isabel; Hase, Michael; Justo-Alonso, Ania; Lehnung, Maria; Migliaretti, Giuseppe; Oliva, Francesco; Pagani, Marco; Recarey-Eiris, Susana; Torta, Riccardo; Tumani, Visal; Gonzalez-Vazquez, Ana I; Hofmann, Arne

    2018-01-01

    Background: Treatment of recurrent depressive disorders is currently only moderately successful. Increasing evidence suggests a significant relationship between adverse childhood experiences and recurrent depressive disorders, suggesting that trauma-based interventions could be useful for these patients. Objectives: To investigate the efficacy of Eye Movement Desensitization and Reprocessing therapy (EMDR) in addition to antidepressant medication (ADM) in treating recurrent depression. Design: A non-inferiority, single-blind, randomized clinical controlled trial comparing EMDR or CBT as adjunctive treatments to ADM. Randomization was carried out by a central computer system. Allocation was carried out by a study coordinator in each center. Setting: Two psychiatric services, one in Italy and one in Spain. Participants: Eighty-two patients were randomized with a 1:1 ratio to the EMDR group ( n = 40) or CBT group ( n = 42). Sixty-six patients, 31 in the EMDR group and 35 in the CBT group, were included in the completers analysis. Intervention: 15 ± 3 individual sessions of EMDR or CBT, both in addition to ADM. Participants were followed up at 6-months. Main outcome measure : Rate of depressive symptoms remission in both groups, as measured by a BDI-II score <13. Results: Sixty-six patients were analyzed as completers (31 EMDR vs. 35 CBT). No significant difference between the two groups was found either at the end of the interventions (71% EMDR vs. 48.7% CBT) or at the 6-month follow-up (54.8% EMDR vs. 42.9% CBT). A RM-ANOVA on BDI-II scores showed similar reductions over time in both groups [ F (6,59) = 22.501, p < 0.001] and a significant interaction effect between time and group [ F (6,59) = 3.357, p = 0.006], with lower BDI-II scores in the EMDR group at T1 [mean difference = -7.309 (95% CI [-12.811, -1.806]), p = 0.010]. The RM-ANOVA on secondary outcome measures showed similar improvement over time in both groups [ F (14,51) = 8.202, p < 0.001], with no

  10. Network Performance Improvement under Epidemic Failures in Optical Transport Networks

    DEFF Research Database (Denmark)

    Fagertun, Anna Manolova; Ruepp, Sarah Renée

    2013-01-01

    In this paper we investigate epidemic failure spreading in large- scale GMPLS-controlled transport networks. By evaluating the effect of the epidemic failure spreading on the network, we design several strategies for cost-effective network performance improvement via differentiated repair times....... First we identify the most vulnerable and the most strategic nodes in the network. Then, via extensive simulations we show that strategic placement of resources for improved failure recovery has better performance than randomly assigning lower repair times among the network nodes. Our OPNET simulation...... model can be used during the network planning process for facilitating cost- effective network survivability design....

  11. Persistent homology of complex networks

    International Nuclear Information System (INIS)

    Horak, Danijela; Maletić, Slobodan; Rajković, Milan

    2009-01-01

    Long-lived topological features are distinguished from short-lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and presented as a parameterized version of a Betti number. Complex networks with distinct degree distributions exhibit distinct persistent topological features. Persistent topological attributes, shown to be related to the robust quality of networks, also reflect the deficiency in certain connectivity properties of networks. Random networks, networks with exponential connectivity distribution and scale-free networks were considered for homological persistency analysis

  12. Random Fields

    Science.gov (United States)

    Vanmarcke, Erik

    1983-03-01

    Random variation over space and time is one of the few attributes that might safely be predicted as characterizing almost any given complex system. Random fields or "distributed disorder systems" confront astronomers, physicists, geologists, meteorologists, biologists, and other natural scientists. They appear in the artifacts developed by electrical, mechanical, civil, and other engineers. They even underlie the processes of social and economic change. The purpose of this book is to bring together existing and new methodologies of random field theory and indicate how they can be applied to these diverse areas where a "deterministic treatment is inefficient and conventional statistics insufficient." Many new results and methods are included. After outlining the extent and characteristics of the random field approach, the book reviews the classical theory of multidimensional random processes and introduces basic probability concepts and methods in the random field context. It next gives a concise amount of the second-order analysis of homogeneous random fields, in both the space-time domain and the wave number-frequency domain. This is followed by a chapter on spectral moments and related measures of disorder and on level excursions and extremes of Gaussian and related random fields. After developing a new framework of analysis based on local averages of one-, two-, and n-dimensional processes, the book concludes with a chapter discussing ramifications in the important areas of estimation, prediction, and control. The mathematical prerequisite has been held to basic college-level calculus.

  13. Automatic diagnosis of abnormal macula in retinal optical coherence tomography images using wavelet-based convolutional neural network features and random forests classifier

    Science.gov (United States)

    Rasti, Reza; Mehridehnavi, Alireza; Rabbani, Hossein; Hajizadeh, Fedra

    2018-03-01

    The present research intends to propose a fully automatic algorithm for the classification of three-dimensional (3-D) optical coherence tomography (OCT) scans of patients suffering from abnormal macula from normal candidates. The method proposed does not require any denoising, segmentation, retinal alignment processes to assess the intraretinal layers, as well as abnormalities or lesion structures. To classify abnormal cases from the control group, a two-stage scheme was utilized, which consists of automatic subsystems for adaptive feature learning and diagnostic scoring. In the first stage, a wavelet-based convolutional neural network (CNN) model was introduced and exploited to generate B-scan representative CNN codes in the spatial-frequency domain, and the cumulative features of 3-D volumes were extracted. In the second stage, the presence of abnormalities in 3-D OCTs was scored over the extracted features. Two different retinal SD-OCT datasets are used for evaluation of the algorithm based on the unbiased fivefold cross-validation (CV) approach. The first set constitutes 3-D OCT images of 30 normal subjects and 30 diabetic macular edema (DME) patients captured from the Topcon device. The second publicly available set consists of 45 subjects with a distribution of 15 patients in age-related macular degeneration, DME, and normal classes from the Heidelberg device. With the application of the algorithm on overall OCT volumes and 10 repetitions of the fivefold CV, the proposed scheme obtained an average precision of 99.33% on dataset1 as a two-class classification problem and 98.67% on dataset2 as a three-class classification task.

  14. Automatic diagnosis of abnormal macula in retinal optical coherence tomography images using wavelet-based convolutional neural network features and random forests classifier.

    Science.gov (United States)

    Rasti, Reza; Mehridehnavi, Alireza; Rabbani, Hossein; Hajizadeh, Fedra

    2018-03-01

    The present research intends to propose a fully automatic algorithm for the classification of three-dimensional (3-D) optical coherence tomography (OCT) scans of patients suffering from abnormal macula from normal candidates. The method proposed does not require any denoising, segmentation, retinal alignment processes to assess the intraretinal layers, as well as abnormalities or lesion structures. To classify abnormal cases from the control group, a two-stage scheme was utilized, which consists of automatic subsystems for adaptive feature learning and diagnostic scoring. In the first stage, a wavelet-based convolutional neural network (CNN) model was introduced and exploited to generate B-scan representative CNN codes in the spatial-frequency domain, and the cumulative features of 3-D volumes were extracted. In the second stage, the presence of abnormalities in 3-D OCTs was scored over the extracted features. Two different retinal SD-OCT datasets are used for evaluation of the algorithm based on the unbiased fivefold cross-validation (CV) approach. The first set constitutes 3-D OCT images of 30 normal subjects and 30 diabetic macular edema (DME) patients captured from the Topcon device. The second publicly available set consists of 45 subjects with a distribution of 15 patients in age-related macular degeneration, DME, and normal classes from the Heidelberg device. With the application of the algorithm on overall OCT volumes and 10 repetitions of the fivefold CV, the proposed scheme obtained an average precision of 99.33% on dataset1 as a two-class classification problem and 98.67% on dataset2 as a three-class classification task. (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE).

  15. Social networks for improving healthy weight loss behaviors for overweight and obese adults: A randomized clinical trial of the social pounds off digitally (Social POD) mobile app.

    Science.gov (United States)

    Hales, Sarah; Turner-McGrievy, Gabrielle M; Wilcox, Sara; Fahim, Arjang; Davis, Rachel E; Huhns, Michael; Valafar, Homayoun

    2016-10-01

    To test the efficacy of a weight loss mobile app based on recommender systems and developed by experts in health promotion and computer science to target social support and self-monitoring of diet, physical activity (PA), and weight (Social POD app), compared to a commercially available diet and PA tracking app (standard). Overweight adults [N=51] were recruited and randomly assigned to either the experimental group [n=26; theory-based podcasts (TBP)+Social POD app] or the comparison group (n=25; TBP+standard app). The Social POD app issued notifications to encourage users to self-monitor and send theory-based messages to support users who had not self-monitored in the previous 48h. Independent samples t-test were used to examine group differences in kilograms lost and change in BMI. Analysis of covariance was used to analyze secondary outcomes while controlling for baseline values. Participant attrition was 12% (n=3 experimental and n=3 comparison). Experimental group participants lost significantly more weight (-5.3kg, CI: -7.5, -3.0) than comparison group (-2.23kg, CI: -3.6, -1.0; d=0.8, r=0.4, p=0.02) and had a greater reduction in BMI (p=0.02). While there were significant differences in positive outcome expectations between groups (p=0.04) other secondary outcomes (e.g., caloric intake and social support) were not significant. Use of the Social POD app resulted in significantly greater weight loss than use of a commercially available tracking app. This mobile health intervention has the potential to be widely disseminated to reduce the risk of chronic disease associated with overweight and obesity. Published by Elsevier Ireland Ltd.

  16. PREFACE: Complex Networks: from Biology to Information Technology

    Science.gov (United States)

    Barrat, A.; Boccaletti, S.; Caldarelli, G.; Chessa, A.; Latora, V.; Motter, A. E.

    2008-06-01

    for counting large directed loops. This work proposes a belief-propagation algorithm for counting long loops in directed networks, which is then applied to networks of different sizes and loop structure. In The anatomy of a large query graph, Baeza-Yates and Tiberi show that scale invariance is present also in the structure of a graph derived from query logs. This graph is determined not only by the queries but also by the subsequent actions of the users. The graph analysed in this study is generated by more than twenty million queries and is less sparse than suggested by previous studies. A different class of networks is considered by Travençolo and da F Costa in Hierarchical spatial organisation of geographical networks. This work proposes a hierarchical extension of the polygonality index as a means to characterise geographical planar networks and, in particular, to obtain more complete information about the spatial order of the network at progressive spatial scales. The paper Border trees of complex networks by Villas Boas et al focuses instead on the statistical properties of the boundary of graphs, constituted by the vertices of degree one (the leaves of border trees). The authors study the local properties, the depth, and the number of leaves of these border trees, finding that in some real networks more than half of the nodes belong to the border trees. The last contribution to the first section is The generation of random directed networks with prescribed 1-node and 2-node degree correlations by Zamora-López et al. This study deals with the generation of random directed networks and shows that often a large number of links cannot be 'randomised' without altering the degree correlations. This permits fast generation of ensembles of maximally random networks. In the section Methods: The Dynamics, significant attention is given to the study of synchronisation processes on networks: Díaz-Guilera's contribution Dynamics towards synchronisation in hierarchical

  17. Cyber Security Research Frameworks For Coevolutionary Network Defense

    Energy Technology Data Exchange (ETDEWEB)

    Rush, George D. [Missouri Univ. of Science and Technology, Rolla, MO (United States); Tauritz, Daniel Remy [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-12-03

    Several architectures have been created for developing and testing systems used in network security, but most are meant to provide a platform for running cyber security experiments as opposed to automating experiment processes. In the first paper, we propose a framework termed Distributed Cyber Security Automation Framework for Experiments (DCAFE) that enables experiment automation and control in a distributed environment. Predictive analysis of adversaries is another thorny issue in cyber security. Game theory can be used to mathematically analyze adversary models, but its scalability limitations restrict its use. Computational game theory allows us to scale classical game theory to larger, more complex systems. In the second paper, we propose a framework termed Coevolutionary Agent-based Network Defense Lightweight Event System (CANDLES) that can coevolve attacker and defender agent strategies and capabilities and evaluate potential solutions with a custom network defense simulation. The third paper is a continuation of the CANDLES project in which we rewrote key parts of the framework. Attackers and defenders have been redesigned to evolve pure strategy, and a new network security simulation is devised which specifies network architecture and adds a temporal aspect. We also add a hill climber algorithm to evaluate the search space and justify the use of a coevolutionary algorithm.

  18. Efficacy and safety of therapies for acute ischemic stroke in China: a network meta-analysis of 13289 patients from 145 randomized controlled trials.

    Directory of Open Access Journals (Sweden)

    Bowen Yang

    Full Text Available BACKGROUND: Many of these therapies have been compared against placebos, but have not been directly compared against each other. To evaluate the efficacy and safety of several commonly used drugs for AIS directly or indirectly. METHODS: A systematic literature review was performed to identify randomized controlled trials (RCTs published prior to April 2013 for AIS therapies. The primary outcome measures were the National Institutes of Health Stroke Scale (NIHSS scores and the clinical effective rate. A fixed-effects meta-analysis and meta-regression are performed; lastly, performed a mixed treatment comparison was performed through the Bayesian methods. RESULTS: Outcome of efficacy of therapies for acute ischemic stroke are as followed: All of the therapies mentioned above yielded results a more effective result than placebo, Sodium ozagrel (RR 3.86, 95%CI 3.18-4.61; Sodium ozagrel + edaravone (RR 9.60, 95%CI 7.04-13.06; Edaravone (RR 4.07, 95%CI 3.30-5.01; Edaravone + Kininogenase (RR 15.33, 95%CI 10.03-23.05. The significant difference in efficacy between edaravone monotherapy and Sodium ozagrel + edaravone was evident (RR 0.43, 95%CI 0.08-0.61 and was also significant between efficacy of edaravone + Kininogenase and Sodium ozagrel (RR 4.00, 95%CI 2.47-6.24. The differences between the risk and benefit were not significant when comparing Sodium ozagrel and edaravone or edaravone + Kininogenase and Sodium ozagrel + Edaravone for AIS. Outcome of the defect of neurological function: Placebo served a significant difference in treating the defects of neurological function compared with Sodium ozagrel (WMD = -3.11, 95%CI -4.43 to -1.79, Sodium ozagrel + edaravone (WMD = -6.25, 95%CI -7.96 to -4.54 and Edaravone + Kininogenase (WMD =  -3.47, 95%CI -5.73 to -1.21. CONCLUSIONS: It provides that the efficacy of edaravone monotherapy in treatment was not more effective than Sodium ozagrel + edaravone.The efficacy of edaravone + Kininogenase

  19. Sustainable wireless networks

    CERN Document Server

    Zheng, Zhongming; Xuemin

    2013-01-01

    This brief focuses on network planning and resource allocation by jointly considering cost and energy sustainability in wireless networks with sustainable energy. The characteristics of green energy and investigating existing energy-efficient green approaches for wireless networks with sustainable energy is covered in the first part of this brief. The book then addresses the random availability and capacity of the energy supply. The authors explore how to maximize the energy sustainability of the network and minimize the failure probability that the mesh access points (APs) could deplete their

  20. Multifractal analysis of complex networks

    International Nuclear Information System (INIS)

    Wang Dan-Ling; Yu Zu-Guo; Anh V

    2012-01-01

    Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions. Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we introduce a new box-covering algorithm for multifractal analysis of complex networks. This algorithm is used to calculate the generalized fractal dimensions D q of some theoretical networks, namely scale-free networks, small world networks, and random networks, and one kind of real network, namely protein—protein interaction networks of different species. Our numerical results indicate the existence of multifractality in scale-free networks and protein—protein interaction networks, while the multifractal behavior is not clear-cut for small world networks and random networks. The possible variation of D q due to changes in the parameters of the theoretical network models is also discussed. (general)

  1. Emergence of structural patterns out of synchronization in networks with competitive interactions

    Science.gov (United States)

    Assenza, Salvatore; Gutiérrez, Ricardo; Gómez-Gardeñes, Jesús; Latora, Vito; Boccaletti, Stefano

    2011-09-01

    Synchronization is a collective phenomenon occurring in systems of interacting units, and is ubiquitous in nature, society and technology. Recent studies have enlightened the important role played by the interaction topology on the emergence of synchronized states. However, most of these studies neglect that real world systems change their interaction patterns in time. Here, we analyze synchronization features in networks in which structural and dynamical features co-evolve. The feedback of the node dynamics on the interaction pattern is ruled by the competition of two mechanisms: homophily (reinforcing those interactions with other correlated units in the graph) and homeostasis (preserving the value of the input strength received by each unit). The competition between these two adaptive principles leads to the emergence of key structural properties observed in real world networks, such as modular and scale-free structures, together with a striking enhancement of local synchronization in systems with no global order.

  2. Specialization in plant-hummingbird networks is associated with species richness, contemporary precipitation and quaternary climate-change velocity

    DEFF Research Database (Denmark)

    Dalsgaard, Bo; Magård, Else; Fjeldså, Jon

    2011-01-01

    patterns of contemporary biotic specialization and its drivers, we use network analysis to determine the degree of specialization in plant-hummingbird mutualistic networks sampled at 31 localities, spanning a wide range of climate regimes across the Americas. We found greater biotic specialization at lower...... latitudes, with latitude explaining 20-22% of the spatial variation in plant-hummingbird specialization. Potential drivers of specialization--contemporary climate, Quaternary climate-change velocity, and species richness--had superior explanatory power, together explaining 53-64% of the variation...... specialization. These results suggest that both ecological and evolutionary processes at Quaternary time scales can be important in driving large-scale geographical patterns of contemporary biotic specialization, at least for co-evolved systems such as plant-hummingbird networks....

  3. Information theoretic description of networks

    Science.gov (United States)

    Wilhelm, Thomas; Hollunder, Jens

    2007-11-01

    We present a new information theoretic approach for network characterizations. It is developed to describe the general type of networks with n nodes and L directed and weighted links, i.e., it also works for the simpler undirected and unweighted networks. The new information theoretic measures for network characterizations are based on a transmitter-receiver analogy of effluxes and influxes. Based on these measures, we classify networks as either complex or non-complex and as either democracy or dictatorship networks. Directed networks, in particular, are furthermore classified as either information spreading and information collecting networks. The complexity classification is based on the information theoretic network complexity measure medium articulation (MA). It is proven that special networks with a medium number of links ( L∼n1.5) show the theoretical maximum complexity MA=(log n)2/2. A network is complex if its MA is larger than the average MA of appropriately randomized networks: MA>MAr. A network is of the democracy type if its redundancy Rdictatorship network. In democracy networks all nodes are, on average, of similar importance, whereas in dictatorship networks some nodes play distinguished roles in network functioning. In other words, democracy networks are characterized by cycling of information (or mass, or energy), while in dictatorship networks there is a straight through-flow from sources to sinks. The classification of directed networks into information spreading and information collecting networks is based on the conditional entropies of the considered networks ( H(A/B)=uncertainty of sender node if receiver node is known, H(B/A)=uncertainty of receiver node if sender node is known): if H(A/B)>H(B/A), it is an information collecting network, otherwise an information spreading network. Finally, different real networks (directed and undirected, weighted and unweighted) are classified according to our general scheme.

  4. Statistical network analysis for analyzing policy networks

    DEFF Research Database (Denmark)

    Robins, Garry; Lewis, Jenny; Wang, Peng

    2012-01-01

    and policy network methodology is the development of statistical modeling approaches that can accommodate such dependent data. In this article, we review three network statistical methods commonly used in the current literature: quadratic assignment procedures, exponential random graph models (ERGMs......To analyze social network data using standard statistical approaches is to risk incorrect inference. The dependencies among observations implied in a network conceptualization undermine standard assumptions of the usual general linear models. One of the most quickly expanding areas of social......), and stochastic actor-oriented models. We focus most attention on ERGMs by providing an illustrative example of a model for a strategic information network within a local government. We draw inferences about the structural role played by individuals recognized as key innovators and conclude that such an approach...

  5. Learning Networks, Networked Learning

    NARCIS (Netherlands)

    Sloep, Peter; Berlanga, Adriana

    2010-01-01

    Sloep, P. B., & Berlanga, A. J. (2011). Learning Networks, Networked Learning [Redes de Aprendizaje, Aprendizaje en Red]. Comunicar, XIX(37), 55-63. Retrieved from http://dx.doi.org/10.3916/C37-2011-02-05

  6. Preserved Network Metrics across Translated Texts

    Science.gov (United States)

    Cabatbat, Josephine Jill T.; Monsanto, Jica P.; Tapang, Giovanni A.

    2014-09-01

    Co-occurrence language networks based on Bible translations and the Universal Declaration of Human Rights (UDHR) translations in different languages were constructed and compared with random text networks. Among the considered network metrics, the network size, N, the normalized betweenness centrality (BC), and the average k-nearest neighbors, knn, were found to be the most preserved across translations. Moreover, similar frequency distributions of co-occurring network motifs were observed for translated texts networks.

  7. Entropy of network ensembles

    Science.gov (United States)

    Bianconi, Ginestra

    2009-03-01

    In this paper we generalize the concept of random networks to describe network ensembles with nontrivial features by a statistical mechanics approach. This framework is able to describe undirected and directed network ensembles as well as weighted network ensembles. These networks might have nontrivial community structure or, in the case of networks embedded in a given space, they might have a link probability with a nontrivial dependence on the distance between the nodes. These ensembles are characterized by their entropy, which evaluates the cardinality of networks in the ensemble. In particular, in this paper we define and evaluate the structural entropy, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We stress the apparent paradox that scale-free degree distributions are characterized by having small structural entropy while they are so widely encountered in natural, social, and technological complex systems. We propose a solution to the paradox by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Finally, the general framework we present in this paper is able to describe microcanonical ensembles of networks as well as canonical or hidden-variable network ensembles with significant implications for the formulation of network-constructing algorithms.

  8. From Networks to Time Series

    Science.gov (United States)

    Shimada, Yutaka; Ikeguchi, Tohru; Shigehara, Takaomi

    2012-10-01

    In this Letter, we propose a framework to transform a complex network to a time series. The transformation from complex networks to time series is realized by the classical multidimensional scaling. Applying the transformation method to a model proposed by Watts and Strogatz [Nature (London) 393, 440 (1998)], we show that ring lattices are transformed to periodic time series, small-world networks to noisy periodic time series, and random networks to random time series. We also show that these relationships are analytically held by using the circulant-matrix theory and the perturbation theory of linear operators. The results are generalized to several high-dimensional lattices.

  9. Random magnetism

    International Nuclear Information System (INIS)

    Tsallis, C.

    1980-03-01

    The 'ingredients' which control a phase transition in well defined system as well as in random ones (e.g. random magnetic systems) are listed and discussed within a somehow unifying perspective. Among these 'ingredients' we find the couplings and elements responsible for the cooperative phenomenon, the topological connectivity as well as possible topological incompatibilities, the influence of new degrees of freedom, the order parameter dimensionality, the ground state degeneracy and finally the 'quanticity' of the system. The general trends, though illustrated in magnetic systems, essentially hold for all phase transitions, and give a basis for connection of this area with Field theory, Theory of dynamical systems, etc. (Author) [pt

  10. Random magnetism

    International Nuclear Information System (INIS)

    Tsallis, C.

    1981-01-01

    The 'ingredients' which control a phase transition in well defined systems as well as in random ones (e.q. random magnetic systems) are listed and discussed within a somehow unifying perspective. Among these 'ingredients' the couplings and elements responsible for the cooperative phenomenon, the topological connectivity as well as possible topological incompatibilities, the influence of new degrees of freedom, the order parameter dimensionality, the ground state degeneracy and finally the 'quanticity' of the system are found. The general trends, though illustrated in magnetic systems, essentially hold for all phase transitions, and give a basis for connection of this area with Field theory, Theory of dynamical systems, etc. (Author) [pt

  11. Neural network design with combined backpropagation and creeping random search learning algorithms applied to the determination of retained austenite in TRIP steels; Diseno de redes neuronales con aprendizaje combinado de retropropagacion y busqueda aleatoria progresiva aplicado a la determinacion de austenita retenida en aceros TRIP

    Energy Technology Data Exchange (ETDEWEB)

    Toda-Caraballo, I.; Garcia-Mateo, C.; Capdevila, C.

    2010-07-01

    At the beginning of the decade of the nineties, the industrial interest for TRIP steels leads to a significant increase of the investigation and application in this field. In this work, the flexibility of neural networks for the modelling of complex properties is used to tackle the problem of determining the retained austenite content in TRIP-steel. Applying a combination of two learning algorithms (backpropagation and creeping-random-search) for the neural network, a model has been created that enables the prediction of retained austenite in low-Si / low-Al multiphase steels as a function of processing parameters. (Author). 34 refs.

  12. Maximal network reliability for a stochastic power transmission network

    International Nuclear Information System (INIS)

    Lin, Yi-Kuei; Yeh, Cheng-Ta

    2011-01-01

    Many studies regarded a power transmission network as a binary-state network and constructed it with several arcs and vertices to evaluate network reliability. In practice, the power transmission network should be stochastic because each arc (transmission line) combined with several physical lines is multistate. Network reliability is the probability that the network can transmit d units of electric power from a power plant (source) to a high voltage substation at a specific area (sink). This study focuses on searching for the optimal transmission line assignment to the power transmission network such that network reliability is maximized. A genetic algorithm based method integrating the minimal paths and the Recursive Sum of Disjoint Products is developed to solve this assignment problem. A real power transmission network is adopted to demonstrate the computational efficiency of the proposed method while comparing with the random solution generation approach.

  13. MINIMAL LOSS RECONFIGURATION CONSIDERING RANDOM LOAD: APPLICATIONS TO REAL NETWORKS RECONFIGURACIÓN A MÍNIMAS PÉRDIDAS, CONSIDERANDO LA ALEATORIEDAD DE LA CARGA: APLICACIÓN A SISTEMAS

    Directory of Open Access Journals (Sweden)

    Hugo Opazo Mora

    2008-06-01

    Full Text Available This paper approaches the minimal loss reconfiguration problem, taking into account the load variations of the systems, through a stochastic reconfiguration process. The Monte Carlo method is used to consider the natural load variation. A normal probability function is used to generate aleatory load levels in the nodes. The results of this work show the existence of a set of branches that are frequently eliminated. This generates a tree branch set that best represents the universal randomness of the load. We call it "Expected Branch Set (EBS". The topology associated to the EBS coincides with that obtained using the average demand values. This makes it unnecessary to generate a considerable number of tests to find that topology that best considers the load variation. The proposed algorithm was applied to two test networks and to a large real network.Este trabajo se plantea la reconfiguración a mínimas pérdidas, tomando en cuenta las variaciones de carga del sistema, a través de un proceso de reconfiguración estocástico. El Método de Monte Carlo es usado para considerar las variaciones naturales de la carga, utilizando una función de probabilidad normal para generar niveles aleatorios de carga en los nudos. Los resultados de este trabajo muestran la existencia de un conjunto de ramas que son frecuentemente eliminadas en el proceso de reconfiguración. Esto genera un conjunto de ramas de un árbol, las que mejor representan aleatoriedad universal de la carga. La topología obtenida la denominamos "Conjunto de Ramas Esperadas" (Expected Branch Set, EBS. La topología asociada al EBS es casi similar a la topología obtenida usando los valores de demanda promedio. Esto hace innecesario el realizar un considerable número de pruebas para encontrar la topología que mejor considera las variaciones de carga. El algoritmo propuesto fue aplicado a dos sistemas de prueba y a un sistema real de gran envergadura.

  14. Effect of oral premedication on the anaesthetic efficacy of inferior alveolar nerve block in patients with irreversible pulpitis - A systematic review and network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Pulikkotil, S J; Nagendrababu, V; Veettil, S K; Jinatongthai, P; Setzer, F C

    2018-02-26

    This systematic review (SR; PROSPERO database: CRD42017075160) and network meta-analysis (NMA) identified the most effective oral premedication for anaesthetic success of inferior alveolar nerve blocks (IANB) in cases of irreversible pulpitis. Medline and Ebscohost databases were searched up until 10/2017. Randomized controlled trials (RCT) studying the effect of oral premedication, alone or in combination, on the success of IANB for cases of irreversible pulpitis, compared to placebo or other oral premedications, were included. Quality of the included studies was appraised by the revised Cochrane risk of bias tool for randomized trials. Pairwise analysis, NMA and quality of evidence assessment using GRADE criteria were performed. Nineteen studies (n = 1654 participants) were included. NMA demonstrated that compared to placebo, dexamethasone was most effective in increasing anaesthetic success (RR, 2.92 [95% CI 1.74,4.91]; SUCRA = 0.96), followed by NSAIDs (RR, 1.92 [95% CI 1.63,2.27], SUCRA = 0.738) and Tramadol (RR, 2.03 [95% CI 1.18,3.49], SUCRA = 0.737). Premedication with acetaminophen added to NSAIDs demonstrated similar efficacy as NSAIDs alone (RR, 1.06 [95% CI 0.79,1.43]). Sensitivity analyses proved the superiority of dexamethasone or NSAIDs over any other premedications. Subgroup analyses of specific dosages in comparison with placebo demonstrated that dexamethasone 0.5 mg was most effective, followed by ketorolac 10 mg, piroxicam 20 mg, ibuprofen 400 mg + acetaminophen 500 mg and Tramadol 50 mg. Ibuprofen 400 mg, 600 mg and 800 mg had a significantly improved IANB success, while Ibuprofen 300 mg had no effect. Oral premedication with dexamethasone, NSAIDs or Tramadol significantly increased anaesthetic success. More trials are needed to evaluate the premedication effects of dexamethasone or Tramadol for improved anaesthetic success of IANB when treating irreversible pulpitis. © 2018 International Endodontic Journal. Published by John

  15. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J.C.; Ibrahim, S.R.; Brincker, Rune

    Abstraet Thispaper demansirates how to use the Random Decrement (RD) technique for identification o flinear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing...

  16. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, S. R.; Brincker, Rune

    This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...

  17. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, R.; Brincker, Rune

    1998-01-01

    This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...

  18. Random dynamics

    International Nuclear Information System (INIS)

    Bennett, D.L.; Brene, N.; Nielsen, H.B.

    1986-06-01

    The goal of random dynamics is the derivation of the laws of Nature as we know them (standard model) from inessential assumptions. The inessential assumptions made here are expressed as sets of general models at extremely high energies: gauge glass and spacetime foam. Both sets of models lead tentatively to the standard model. (orig.)

  19. Random dynamics

    International Nuclear Information System (INIS)

    Bennett, D.L.

    1987-01-01

    The goal of random dynamics is the derivation of the laws of Nature as we know them (standard model) from inessential assumptions. The inessential assumptions made here are expressed as sets of general models at extremely high energies: Gauge glass and spacetime foam. Both sets of models lead tentatively to the standard model. (orig.)

  20. Random Dynamics

    Science.gov (United States)

    Bennett, D. L.; Brene, N.; Nielsen, H. B.

    1987-01-01

    The goal of random dynamics is the derivation of the laws of Nature as we know them (standard model) from inessential assumptions. The inessential assumptions made here are expressed as sets of general models at extremely high energies: gauge glass and spacetime foam. Both sets of models lead tentatively to the standard model.

  1. Random social networks, unemployment and wage inequality

    NARCIS (Netherlands)

    Ioannides, Y.M.; Soetevent, A.R.

    2006-01-01

    Empirical studies of labor markets show that social contacts are an important source of job-related information. At the same time, wage differences among workers may be explained only in part by differences in individual background characteristics. Such findings motivate our model in which

  2. Distributed authentication for randomly compromised networks

    International Nuclear Information System (INIS)

    Beals, Travis R; Hynes, Kevin P; Sanders, Barry C

    2009-01-01

    We introduce a simple, practical approach with probabilistic information-theoretic security to solve one of quantum key distribution's major security weaknesses: the requirement of an authenticated classical channel to prevent man-in-the-middle attacks. Our scheme employs classical secret sharing and partially trusted intermediaries to provide arbitrarily high confidence in the security of the protocol. Although certain failures elude detection, we discuss preemptive strategies to reduce the probability of failure to an arbitrarily small level: the probability of such failures is exponentially suppressed with increases in connectivity (i.e. connections per node).

  3. Symmetry in Complex Networks

    Directory of Open Access Journals (Sweden)

    Angel Garrido

    2011-01-01

    Full Text Available In this paper, we analyze a few interrelated concepts about graphs, such as their degree, entropy, or their symmetry/asymmetry levels. These concepts prove useful in the study of different types of Systems, and particularly, in the analysis of Complex Networks. A System can be defined as any set of components functioning together as a whole. A systemic point of view allows us to isolate a part of the world, and so, we can focus on those aspects that interact more closely than others. Network Science analyzes the interconnections among diverse networks from different domains: physics, engineering, biology, semantics, and so on. Current developments in the quantitative analysis of Complex Networks, based on graph theory, have been rapidly translated to studies of brain network organization. The brain's systems have complex network features—such as the small-world topology, highly connected hubs and modularity. These networks are not random. The topology of many different networks shows striking similarities, such as the scale-free structure, with the degree distribution following a Power Law. How can very different systems have the same underlying topological features? Modeling and characterizing these networks, looking for their governing laws, are the current lines of research. So, we will dedicate this Special Issue paper to show measures of symmetry in Complex Networks, and highlight their close relation with measures of information and entropy.

  4. Lack of evidence for a harmful effect of sodium-glucose co-transporter 2 (SGLT2) inhibitors on fracture risk among type 2 diabetes patients: a network and cumulative meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Tang, H L; Li, D D; Zhang, J J; Hsu, Y H; Wang, T S; Zhai, S D; Song, Y Q

    2016-12-01

    To evaluate the comparative effects of sodium-glucose co-transporter 2 (SGLT2) inhibitors on risk of bone fracture in patients with type 2 diabetes mellitus (T2DM). PubMed, EMBASE, CENTRAL and ClinicalTrials.gov were systematically searched from inception to 27 January 2016 to identify randomized controlled trials (RCTs) reporting the outcome of fracture in patients with T2DM treated with SGLT2 inhibitors. Pairwise and network meta-analyses, as well as a cumulative meta-analysis, were performed to calculate odds ratios (ORs) and 95% confidence intervals (CIs). A total of 38 eligible RCTs (10 canagliflozin, 15 dapagliflozin and 13 empagliflozin) involving 30 384 patients, with follow-ups ranging from 24 to 160 weeks, were included. The fracture event rates were 1.59% in the SGLT2 inhibitor groups and 1.56% in the control groups. The incidence of fracture events was similar among these three SGLT2 inhibitor groups. Compared with placebo, canagliflozin (OR 1.15; 95% CI 0.71-1.88), dapagliflozin (OR 0.68; 95% CI 0.37-1.25) and empagliflozin (OR 0.93; 95% CI 0.74-1.18) were not significantly associated with an increased risk of fracture. Our cumulative meta-analysis indicated the robustness of the null findings with regard to SGLT2 inhibitors. Our meta-analysis based on available RCT data does not support the harmful effect of SGLT2 inhibitors on fractures, although future safety monitoring from RCTs and real-world data with detailed information on bone health is warranted. © 2016 John Wiley & Sons Ltd.

  5. Comparative efficacy and safety of tocilizumab, rituximab, abatacept and tofacitinib in patients with active rheumatoid arthritis that inadequately responds to tumor necrosis factor inhibitors: a Bayesian network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Lee, Young Ho; Bae, Sang-Cheol

    2016-11-01

    This study aimed to assess the relative efficacy and safety of biologics and tofacitinib in patients with rheumatoid arthritis (RA) showing an inadequate response to tumor necrosis factor (TNF) inhibitors. We performed a Bayesian network meta-analysis to combine the direct and indirect evidence from randomized controlled trials (RCTs) examining the efficacy and safety of tocilizumab, rituximab, abatacept and tofacitinib in patients with RA that inadequately responds to TNF inhibitors. Four RCTs including 1796 patients met the inclusion criteria. The tocilizumab 8 mg group showed a significantly higher American College of Rheumatology 20% (ACR20) response rate than the abatacept and tofacitinib groups. Ranking probability based on surface under the cumulative ranking curve (SUCRA) indicated that tocilizumab 8 mg had the highest probability of being the best treatment for achieving the ACR20 response rate (SUCRA = 0.9863), followed by rituximab (SUCRA = 0.6623), abatacept (SUCRA = 0.5428), tocilizumab 4 mg (SUCRA = 0.4956), tofacitinib 10 mg (SUCRA = 0.4715), tofacitinib 5 mg (SUCRA = 0.3415) and placebo (SUCRA = 0). In contrast, the safety based on the number of withdrawals due to adverse events did not differ significantly among the treatment options. Tocilizumab 8 mg was the second-line non-TNF biologic with the highest performance regarding an early good response based on ACR20 response rate and acceptable safety profile, followed by rituximab, abatacept and tofacitinib in patients with RA and an inadequate response to anti-TNF therapy, and none of these treatments were associated with a significant risk of withdrawal due to adverse events. © 2015 Asia Pacific League of Associations for Rheumatology and Wiley Publishing Asia Pty Ltd.

  6. Investigation of the network delay on Profibus-DP based network

    OpenAIRE

    Yılmaz, C.; Gürdal, O.; Sayan, H.H.

    2008-01-01

    The mathematical model of the network-induced delay control systems (NDCS) is given. Also the role of the NDCS’s components such as controller, sensor and network environment on the network-induced delay are included in the mathematical model of the system. The network delay is investigated on Profibus-DP based network application and experimental results obtained are presented graphically. The experimental results obtained show that the network induced delay is randomly changed according to ...

  7. Network Dynamics of Innovation Processes

    Science.gov (United States)

    Iacopini, Iacopo; Milojević, Staša; Latora, Vito

    2018-01-01

    We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

  8. Unified Model for Generation Complex Networks with Utility Preferential Attachment

    International Nuclear Information System (INIS)

    Wu Jianjun; Gao Ziyou; Sun Huijun

    2006-01-01

    In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics of this new network are given.

  9. Opinion formation on multiplex scale-free networks

    Science.gov (United States)

    Nguyen, Vu Xuan; Xiao, Gaoxi; Xu, Xin-Jian; Li, Guoqi; Wang, Zhen

    2018-01-01

    Most individuals, if not all, live in various social networks. The formation of opinion systems is an outcome of social interactions and information propagation occurring in such networks. We study the opinion formation with a new rule of pairwise interactions in the novel version of the well-known Deffuant model on multiplex networks composed of two layers, each of which is a scale-free network. It is found that in a duplex network composed of two identical layers, the presence of the multiplexity helps either diminish or enhance opinion diversity depending on the relative magnitudes of tolerance ranges characterizing the degree of openness/tolerance on both layers: there is a steady separation between different regions of tolerance range values on two network layers where multiplexity plays two different roles, respectively. Additionally, the two critical tolerance ranges follow a one-sum rule; that is, each of the layers reaches a complete consensus only if the sum of the tolerance ranges on the two layers is greater than a constant approximately equaling 1, the double of the critical bound on a corresponding isolated network. A further investigation of the coupling between constituent layers quantified by a link overlap parameter reveals that as the layers are loosely coupled, the two opinion systems co-evolve independently, but when the inter-layer coupling is sufficiently strong, a monotonic behavior is observed: an increase in the tolerance range of a layer causes a decline in the opinion diversity on the other layer regardless of the magnitudes of tolerance ranges associated with the layers in question.

  10. Network Analysis Tools: from biological networks to clusters and pathways.

    Science.gov (United States)

    Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Vanderstocken, Gilles; van Helden, Jacques

    2008-01-01

    Network Analysis Tools (NeAT) is a suite of computer tools that integrate various algorithms for the analysis of biological networks: comparison between graphs, between clusters, or between graphs and clusters; network randomization; analysis of degree distribution; network-based clustering and path finding. The tools are interconnected to enable a stepwise analysis of the network through a complete analytical workflow. In this protocol, we present a typical case of utilization, where the tasks above are combined to decipher a protein-protein interaction network retrieved from the STRING database. The results returned by NeAT are typically subnetworks, networks enriched with additional information (i.e., clusters or paths) or tables displaying statistics. Typical networks comprising several thousands of nodes and arcs can be analyzed within a few minutes. The complete protocol can be read and executed in approximately 1 h.

  11. Organization of complex networks

    Science.gov (United States)

    Kitsak, Maksim

    Many large complex systems can be successfully analyzed using the language of graphs and networks. Interactions between the objects in a network are treated as links connecting nodes. This approach to understanding the structure of networks is an important step toward understanding the way corresponding complex systems function. Using the tools of statistical physics, we analyze the structure of networks as they are found in complex systems such as the Internet, the World Wide Web, and numerous industrial and social networks. In the first chapter we apply the concept of self-similarity to the study of transport properties in complex networks. Self-similar or fractal networks, unlike non-fractal networks, exhibit similarity on a range of scales. We find that these fractal networks have transport properties that differ from those of non-fractal networks. In non-fractal networks, transport flows primarily through the hubs. In fractal networks, the self-similar structure requires any transport to also flow through nodes that have only a few connections. We also study, in models and in real networks, the crossover from fractal to non-fractal networks that occurs when a small number of random interactions are added by means of scaling techniques. In the second chapter we use k-core techniques to study dynamic processes in networks. The k-core of a network is the network's largest component that, within itself, exhibits all nodes with at least k connections. We use this k-core analysis to estimate the relative leadership positions of firms in the Life Science (LS) and Information and Communication Technology (ICT) sectors of industry. We study the differences in the k-core structure between the LS and the ICT sectors. We find that the lead segment (highest k-core) of the LS sector, unlike that of the ICT sector, is remarkably stable over time: once a particular firm enters the lead segment, it is likely to remain there for many years. In the third chapter we study how

  12. Topology evolution in macromolecular networks

    NARCIS (Netherlands)

    Kryven, I.

    2014-01-01

    Governed by various intermolecular forces, molecular networks tend to evolve from simple to very complex formations that have random structure. This randomness in the connectivity of the basic units can still be captured employing distributional description of the state of the system; the evolution

  13. Modeling complexity in engineered infrastructure system: Water distribution network as an example

    Science.gov (United States)

    Zeng, Fang; Li, Xiang; Li, Ke

    2017-02-01

    The complex topology and adaptive behavior of infrastructure systems are driven by both self-organization of the demand and rigid engineering solutions. Therefore, engineering complex systems requires a method balancing holism and reductionism. To model the growth of water distribution networks, a complex network model was developed following the combination of local optimization rules and engineering considerations. The demand node generation is dynamic and follows the scaling law of urban growth. The proposed model can generate a water distribution network (WDN) similar to reported real-world WDNs on some structural properties. Comparison with different modeling approaches indicates that a realistic demand node distribution and co-evolvement of demand node and network are important for the simulation of real complex networks. The simulation results indicate that the efficiency of water distribution networks is exponentially affected by the urban growth pattern. On the contrary, the improvement of efficiency by engineering optimization is limited and relatively insignificant. The redundancy and robustness, on another aspect, can be significantly improved through engineering methods.

  14. Systemic risk on different interbank network topologies

    Science.gov (United States)

    Lenzu, Simone; Tedeschi, Gabriele

    2012-09-01

    In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents' performance. By changing the agent's trust on its neighbor's performance, interbank linkages self-organize themselves into very different network architectures, ranging from random to scale-free topologies. We study which network architecture can make the financial system more resilient to random attacks and how systemic risk spreads over the network. To perturb the system, we generate a random attack via a liquidity shock. The hit bank is not automatically eliminated, but its failure is endogenously driven by its incapacity to raise liquidity in the interbank network. Our analysis shows that a random financial network can be more resilient than a scale free one in case of agents' heterogeneity.

  15. Random tensors

    CERN Document Server

    Gurau, Razvan

    2017-01-01

    Written by the creator of the modern theory of random tensors, this book is the first self-contained introductory text to this rapidly developing theory. Starting from notions familiar to the average researcher or PhD student in mathematical or theoretical physics, the book presents in detail the theory and its applications to physics. The recent detections of the Higgs boson at the LHC and gravitational waves at LIGO mark new milestones in Physics confirming long standing predictions of Quantum Field Theory and General Relativity. These two experimental results only reinforce today the need to find an underlying common framework of the two: the elusive theory of Quantum Gravity. Over the past thirty years, several alternatives have been proposed as theories of Quantum Gravity, chief among them String Theory. While these theories are yet to be tested experimentally, key lessons have already been learned. Whatever the theory of Quantum Gravity may be, it must incorporate random geometry in one form or another....

  16. Declarative Networking

    CERN Document Server

    Loo, Boon Thau

    2012-01-01

    Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. Declarative networking proposes the use of a declarative query language for specifying and implementing network protocols, and employs a dataflow framework at runtime for communication and maintenance of network state. The primary goal of declarative networking is to greatly simplify the process of specifying, implementing, deploying and evolving a network design. In addition, decla

  17. Neuronal avalanches in complex networks

    Directory of Open Access Journals (Sweden)

    Victor Hernandez-Urbina

    2016-12-01

    Full Text Available Brain networks are neither regular nor random. Their structure allows for optimal information processing and transmission across the entire neural substrate of an organism. However, for topological features to be appropriately harnessed, brain networks should implement a dynamical regime which prevents phase-locked and chaotic behaviour. Critical neural dynamics refer to a dynamical regime in which the system is poised at the boundary between regularity and randomness. It has been reported that neural systems poised at this boundary achieve maximum computational power. In this paper, we review recent results regarding critical neural dynamics that emerge from systems whose underlying structure exhibits complex network properties.

  18. Molecular ecological network analyses.

    Science.gov (United States)

    Deng, Ye; Jiang, Yi-Huei; Yang, Yunfeng; He, Zhili; Luo, Feng; Zhou, Jizhong

    2012-05-30

    Understanding the interaction among different species within a community and their responses to environmental changes is a central goal in ecology. However, defining the network structure in a microbial community is very challenging due to their extremely high diversity and as-yet uncultivated status. Although recent advance of metagenomic technologies, such as high throughout sequencing and functional gene arrays, provide revolutionary tools for analyzing microbial community structure, it is still difficult to examine network interactions in a microbial community based on high-throughput metagenomics data. Here, we describe a novel mathematical and bioinformatics framework to construct ecological association networks named molecular ecological networks (MENs) through Random Matrix Theory (RMT)-based methods. Compared to other network construction methods, this approach is remarkable in that the network is automatically defined and robust to noise, thus providing excellent solutions to several common issues associated with high-throughput metagenomics data. We applied it to determine the network structure of microbial communities subjected to long-term experimental warming based on pyrosequencing data of 16 S rRNA genes. We showed that the constructed MENs under both warming and unwarming conditions exhibited topological features of scale free, small world and modularity, which were consistent with previously described molecular ecological networks. Eigengene analysis indicated that the eigengenes represented the module profiles relatively well. In consistency with many other studies, several major environmental traits including temperature and soil pH were found to be important in determining network interactions in the microbial communities examined. To facilitate its application by the scientific community, all these methods and statistical tools have been integrated into a comprehensive Molecular Ecological Network Analysis Pipeline (MENAP), which is open

  19. The complex network reliability and influential nodes

    Science.gov (United States)

    Li, Kai; He, Yongfeng

    2017-08-01

    In order to study the complex network node important degree and reliability, considering semi-local centrality, betweenness centrality and PageRank algorithm, through the simulation method to gradually remove nodes and recalculate the importance in the random network, small world network and scale-free network. Study the relationship between the largest connected component and node removed proportion, the research results show that betweenness centrality and PageRank algorithm based on the global information network are more effective for evaluating the importance of nodes, and the reliability of the network is related to the network topology.

  20. Random matrix improved subspace clustering

    KAUST Repository

    Couillet, Romain

    2017-03-06

    This article introduces a spectral method for statistical subspace clustering. The method is built upon standard kernel spectral clustering techniques, however carefully tuned by theoretical understanding arising from random matrix findings. We show in particular that our method provides high clustering performance while standard kernel choices provably fail. An application to user grouping based on vector channel observations in the context of massive MIMO wireless communication networks is provided.