Information transfer in community structured multiplex networks

NASA Astrophysics Data System (ADS)

Solé Ribalta, Albert; Granell, Clara; Gómez, Sergio; Arenas, Alex

2015-08-01

The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

Challenges in network science: Applications to infrastructures, climate, social systems and economics

NASA Astrophysics Data System (ADS)

Havlin, S.; Kenett, D. Y.; Ben-Jacob, E.; Bunde, A.; Cohen, R.; Hermann, H.; Kantelhardt, J. W.; Kertész, J.; Kirkpatrick, S.; Kurths, J.; Portugali, J.; Solomon, S.

2012-11-01

Network theory has become one of the most visible theoretical frameworks that can be applied to the description, analysis, understanding, design and repair of multi-level complex systems. Complex networks occur everywhere, in man-made and human social systems, in organic and inorganic matter, from nano to macro scales, and in natural and anthropogenic structures. New applications are developed at an ever-increasing rate and the promise for future growth is high, since increasingly we interact with one another within these vital and complex environments. Despite all the great successes of this field, crucial aspects of multi-level complex systems have been largely ignored. Important challenges of network science are to take into account many of these missing realistic features such as strong coupling between networks (networks are not isolated), the dynamics of networks (networks are not static), interrelationships between structure, dynamics and function of networks, interdependencies in given networks (and other classes of links, including different signs of interactions), and spatial properties (including geographical aspects) of networks. This aim of this paper is to introduce and discuss the challenges that future network science needs to address, and how different disciplines will be accordingly affected.

The Applied Mathematics for Power Systems (AMPS)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chertkov, Michael

2012-07-24

Increased deployment of new technologies, e.g., renewable generation and electric vehicles, is rapidly transforming electrical power networks by crossing previously distinct spatiotemporal scales and invalidating many traditional approaches for designing, analyzing, and operating power grids. This trend is expected to accelerate over the coming years, bringing the disruptive challenge of complexity, but also opportunities to deliver unprecedented efficiency and reliability. Our Applied Mathematics for Power Systems (AMPS) Center will discover, enable, and solve emerging mathematics challenges arising in power systems and, more generally, in complex engineered networks. We will develop foundational applied mathematics resulting in rigorous algorithms and simulation toolboxesmore » for modern and future engineered networks. The AMPS Center deconstruction/reconstruction approach 'deconstructs' complex networks into sub-problems within non-separable spatiotemporal scales, a missing step in 20th century modeling of engineered networks. These sub-problems are addressed within the appropriate AMPS foundational pillar - complex systems, control theory, and optimization theory - and merged or 'reconstructed' at their boundaries into more general mathematical descriptions of complex engineered networks where important new questions are formulated and attacked. These two steps, iterated multiple times, will bridge the growing chasm between the legacy power grid and its future as a complex engineered network.« less

Long-Term Monitoring Network Optimization Evaluation for Operable Unit 2, Bunker Hill Mining and Metallurgical Complex Superfund Site, Idaho

EPA Pesticide Factsheets

This report presents a description and evaluation of the ground water and surface water monitoring program associated with the Bunker Hill Mining and Metallurgical Complex Superfund Site (Bunker Hill) Operable Unit (OU) 2.

A complex systems analysis of stick-slip dynamics of a laboratory fault

DOE Office of Scientific and Technical Information (OSTI.GOV)

Walker, David M.; Tordesillas, Antoinette, E-mail: atordesi@unimelb.edu.au; Small, Michael

2014-03-15

We study the stick-slip behavior of a granular bed of photoelastic disks sheared by a rough slider pulled along the surface. Time series of a proxy for granular friction are examined using complex systems methods to characterize the observed stick-slip dynamics of this laboratory fault. Nonlinear surrogate time series methods show that the stick-slip behavior appears more complex than a periodic dynamics description. Phase space embedding methods show that the dynamics can be locally captured within a four to six dimensional subspace. These slider time series also provide an experimental test for recent complex network methods. Phase space networks, constructedmore » by connecting nearby phase space points, proved useful in capturing the key features of the dynamics. In particular, network communities could be associated to slip events and the ranking of small network subgraphs exhibited a heretofore unreported ordering.« less

Systems Biology Graphical Notation: Entity Relationship language Level 1 Version 2.

PubMed

Sorokin, Anatoly; Le Novère, Nicolas; Luna, Augustin; Czauderna, Tobias; Demir, Emek; Haw, Robin; Mi, Huaiyu; Moodie, Stuart; Schreiber, Falk; Villéger, Alice

2015-09-04

The Systems Biological Graphical Notation (SBGN) is an international community effort for standardized graphical representations of biological pathways and networks. The goal of SBGN is to provide unambiguous pathway and network maps for readers with different scientific backgrounds as well as to support efficient and accurate exchange of biological knowledge between different research communities, industry, and other players in systems biology. Three SBGN languages, Process Description (PD), Entity Relationship (ER) and Activity Flow (AF), allow for the representation of different aspects of biological and biochemical systems at different levels of detail. The SBGN Entity Relationship language (ER) represents biological entities and their interactions and relationships within a network. SBGN ER focuses on all potential relationships between entities without considering temporal aspects. The nodes (elements) describe biological entities, such as proteins and complexes. The edges (connections) provide descriptions of interactions and relationships (or influences), e.g., complex formation, stimulation and inhibition. Among all three languages of SBGN, ER is the closest to protein interaction networks in biological literature and textbooks, but its well-defined semantics offer a superior precision in expressing biological knowledge.

The use of network analysis to study complex animal communication systems: a study on nightingale song.

PubMed

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-06-22

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the 'small-world' character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval.

The use of network analysis to study complex animal communication systems: a study on nightingale song

PubMed Central

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-01-01

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the ‘small-world’ character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval. PMID:24807258

Network Analysis: Applications for the Developing Brain

PubMed Central

Chu-Shore, Catherine J.; Kramer, Mark A.; Bianchi, Matt T.; Caviness, Verne S.; Cash, Sydney S.

2011-01-01

Development of the human brain follows a complex trajectory of age-specific anatomical and physiological changes. The application of network analysis provides an illuminating perspective on the dynamic interregional and global properties of this intricate and complex system. Here, we provide a critical synopsis of methods of network analysis with a focus on developing brain networks. After discussing basic concepts and approaches to network analysis, we explore the primary events of anatomical cortical development from gestation through adolescence. Upon this framework, we describe early work revealing the evolution of age-specific functional brain networks in normal neurodevelopment. Finally, we review how these relationships can be altered in disease and perhaps even rectified with treatment. While this method of description and inquiry remains in early form, there is already substantial evidence that the application of network models and analysis to understanding normal and abnormal human neural development holds tremendous promise for future discovery. PMID:21303762

Logic-Based Models for the Analysis of Cell Signaling Networks†

PubMed Central

2010-01-01

Computational models are increasingly used to analyze the operation of complex biochemical networks, including those involved in cell signaling networks. Here we review recent advances in applying logic-based modeling to mammalian cell biology. Logic-based models represent biomolecular networks in a simple and intuitive manner without describing the detailed biochemistry of each interaction. A brief description of several logic-based modeling methods is followed by six case studies that demonstrate biological questions recently addressed using logic-based models and point to potential advances in model formalisms and training procedures that promise to enhance the utility of logic-based methods for studying the relationship between environmental inputs and phenotypic or signaling state outputs of complex signaling networks. PMID:20225868

Epidemic modeling in complex realities.

PubMed

Colizza, Vittoria; Barthélemy, Marc; Barrat, Alain; Vespignani, Alessandro

2007-04-01

In our global world, the increasing complexity of social relations and transport infrastructures are key factors in the spread of epidemics. In recent years, the increasing availability of computer power has enabled both to obtain reliable data allowing one to quantify the complexity of the networks on which epidemics may propagate and to envision computational tools able to tackle the analysis of such propagation phenomena. These advances have put in evidence the limits of homogeneous assumptions and simple spatial diffusion approaches, and stimulated the inclusion of complex features and heterogeneities relevant in the description of epidemic diffusion. In this paper, we review recent progresses that integrate complex systems and networks analysis with epidemic modelling and focus on the impact of the various complex features of real systems on the dynamics of epidemic spreading.

Systems Biology Graphical Notation: Process Description language Level 1 Version 1.3.

PubMed

Moodie, Stuart; Le Novère, Nicolas; Demir, Emek; Mi, Huaiyu; Villéger, Alice

2015-09-04

The Systems Biological Graphical Notation (SBGN) is an international community effort for standardized graphical representations of biological pathways and networks. The goal of SBGN is to provide unambiguous pathway and network maps for readers with different scientific backgrounds as well as to support efficient and accurate exchange of biological knowledge between different research communities, industry, and other players in systems biology. Three SBGN languages, Process Description (PD), Entity Relationship (ER) and Activity Flow (AF), allow for the representation of different aspects of biological and biochemical systems at different levels of detail. The SBGN Process Description language represents biological entities and processes between these entities within a network. SBGN PD focuses on the mechanistic description and temporal dependencies of biological interactions and transformations. The nodes (elements) are split into entity nodes describing, e.g., metabolites, proteins, genes and complexes, and process nodes describing, e.g., reactions and associations. The edges (connections) provide descriptions of relationships (or influences) between the nodes, such as consumption, production, stimulation and inhibition. Among all three languages of SBGN, PD is the closest to metabolic and regulatory pathways in biological literature and textbooks, but its well-defined semantics offer a superior precision in expressing biological knowledge.

A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks

NASA Astrophysics Data System (ADS)

Yasami, Yasser; Safaei, Farshad

2018-02-01

The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of cascade prediction in terms of accuracy.

Measures for brain connectivity analysis: nodes centrality and their invariant patterns

NASA Astrophysics Data System (ADS)

da Silva, Laysa Mayra Uchôa; Baltazar, Carlos Arruda; Silva, Camila Aquemi; Ribeiro, Mauricio Watanabe; de Aratanha, Maria Adelia Albano; Deolindo, Camila Sardeto; Rodrigues, Abner Cardoso; Machado, Birajara Soares

2017-07-01

The high dynamical complexity of the brain is related to its small-world topology, which enable both segregated and integrated information processing capabilities. Several measures of connectivity estimation have already been employed to characterize functional brain networks from multivariate electrophysiological data. However, understanding the properties of each measure that lead to a better description of the real topology and capture the complex phenomena present in the brain remains challenging. In this work we compared four nonlinear connectivity measures and show that each method characterizes distinct features of brain interactions. The results suggest an invariance of global network parameters from different behavioral states and that more complete description may be reached considering local features, independently of the connectivity measure employed. Our findings also point to future perspectives in connectivity studies that combine distinct and complementary dependence measures in assembling higher dimensions manifolds.

Improved Autoassociative Neural Networks

NASA Technical Reports Server (NTRS)

Hand, Charles

2003-01-01

Improved autoassociative neural networks, denoted nexi, have been proposed for use in controlling autonomous robots, including mobile exploratory robots of the biomorphic type. In comparison with conventional autoassociative neural networks, nexi would be more complex but more capable in that they could be trained to do more complex tasks. A nexus would use bit weights and simple arithmetic in a manner that would enable training and operation without a central processing unit, programs, weight registers, or large amounts of memory. Only a relatively small amount of memory (to hold the bit weights) and a simple logic application- specific integrated circuit would be needed. A description of autoassociative neural networks is prerequisite to a meaningful description of a nexus. An autoassociative network is a set of neurons that are completely connected in the sense that each neuron receives input from, and sends output to, all the other neurons. (In some instantiations, a neuron could also send output back to its own input terminal.) The state of a neuron is completely determined by the inner product of its inputs with weights associated with its input channel. Setting the weights sets the behavior of the network. The neurons of an autoassociative network are usually regarded as comprising a row or vector. Time is a quantized phenomenon for most autoassociative networks in the sense that time proceeds in discrete steps. At each time step, the row of neurons forms a pattern: some neurons are firing, some are not. Hence, the current state of an autoassociative network can be described with a single binary vector. As time goes by, the network changes the vector. Autoassociative networks move vectors over hyperspace landscapes of possibilities.

Structural reducibility of multilayer networks

NASA Astrophysics Data System (ADS)

de Domenico, Manlio; Nicosia, Vincenzo; Arenas, Alexandre; Latora, Vito

2015-04-01

Many complex systems can be represented as networks consisting of distinct types of interactions, which can be categorized as links belonging to different layers. For example, a good description of the full protein-protein interactome requires, for some organisms, up to seven distinct network layers, accounting for different genetic and physical interactions, each containing thousands of protein-protein relationships. A fundamental open question is then how many layers are indeed necessary to accurately represent the structure of a multilayered complex system. Here we introduce a method based on quantum theory to reduce the number of layers to a minimum while maximizing the distinguishability between the multilayer network and the corresponding aggregated graph. We validate our approach on synthetic benchmarks and we show that the number of informative layers in some real multilayer networks of protein-genetic interactions, social, economical and transportation systems can be reduced by up to 75%.

Epidemic processes in complex networks

NASA Astrophysics Data System (ADS)

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.

Complex-network description of thermal quantum states in the Ising spin chain

NASA Astrophysics Data System (ADS)

Sundar, Bhuvanesh; Valdez, Marc Andrew; Carr, Lincoln D.; Hazzard, Kaden R. A.

2018-05-01

We use network analysis to describe and characterize an archetypal quantum system—an Ising spin chain in a transverse magnetic field. We analyze weighted networks for this quantum system, with link weights given by various measures of spin-spin correlations such as the von Neumann and Rényi mutual information, concurrence, and negativity. We analytically calculate the spin-spin correlations in the system at an arbitrary temperature by mapping the Ising spin chain to fermions, as well as numerically calculate the correlations in the ground state using matrix product state methods, and then analyze the resulting networks using a variety of network measures. We demonstrate that the network measures show some traits of complex networks already in this spin chain, arguably the simplest quantum many-body system. The network measures give insight into the phase diagram not easily captured by more typical quantities, such as the order parameter or correlation length. For example, the network structure varies with transverse field and temperature, and the structure in the quantum critical fan is different from the ordered and disordered phases.

Analysis of network motifs in cellular regulation: Structural similarities, input-output relations and signal integration.

PubMed

Straube, Ronny

2017-12-01

Much of the complexity of regulatory networks derives from the necessity to integrate multiple signals and to avoid malfunction due to cross-talk or harmful perturbations. Hence, one may expect that the input-output behavior of larger networks is not necessarily more complex than that of smaller network motifs which suggests that both can, under certain conditions, be described by similar equations. In this review, we illustrate this approach by discussing the similarities that exist in the steady state descriptions of a simple bimolecular reaction, covalent modification cycles and bacterial two-component systems. Interestingly, in all three systems fundamental input-output characteristics such as thresholds, ultrasensitivity or concentration robustness are described by structurally similar equations. Depending on the system the meaning of the parameters can differ ranging from protein concentrations and affinity constants to complex parameter combinations which allows for a quantitative understanding of signal integration in these systems. We argue that this approach may also be extended to larger regulatory networks. Copyright © 2017 Elsevier B.V. All rights reserved.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Transition Features from Simplicity-Universality to Complexity-Diversification Under UHNTF

NASA Astrophysics Data System (ADS)

Fang, Jin-Qing; Li, Yong

2010-02-01

A large unified hybrid network model with a variable speed growth (LUHNM-VSG) is proposed as third model of the unified hybrid network theoretical framework (UHNTF). A hybrid growth ratio vg of deterministic linking number to random linking number and variable speed growth index α are introduced in it. The main effects of vg and α on topological transition features of the LUHNM-VSG are revealed. For comparison with the other models, we construct a type of the network complexity pyramid with seven levels, in which from the bottom level-1 to the top level-7 of the pyramid simplicity-universality is increasing but complexity-diversity is decreasing. The transition relations between them depend on matching of four hybrid ratios (dr, fd, gr, vg). Thus the most of network models can be investigated in the unification way via four hybrid ratios (dr, fd, gr, vg). The LUHNM-VSG as the level-1 of the pyramid is much better and closer to description of real-world networks as well as has potential application.

Modeling of contact tracing in social networks

NASA Astrophysics Data System (ADS)

Tsimring, Lev S.; Huerta, Ramón

2003-07-01

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

Network Modeling Reveals Prevalent Negative Regulatory Relationships between Signaling Sectors in Arabidopsis Immune Signaling

PubMed Central

Sato, Masanao; Tsuda, Kenichi; Wang, Lin; Coller, John; Watanabe, Yuichiro; Glazebrook, Jane; Katagiri, Fumiaki

2010-01-01

Biological signaling processes may be mediated by complex networks in which network components and network sectors interact with each other in complex ways. Studies of complex networks benefit from approaches in which the roles of individual components are considered in the context of the network. The plant immune signaling network, which controls inducible responses to pathogen attack, is such a complex network. We studied the Arabidopsis immune signaling network upon challenge with a strain of the bacterial pathogen Pseudomonas syringae expressing the effector protein AvrRpt2 (Pto DC3000 AvrRpt2). This bacterial strain feeds multiple inputs into the signaling network, allowing many parts of the network to be activated at once. mRNA profiles for 571 immune response genes of 22 Arabidopsis immunity mutants and wild type were collected 6 hours after inoculation with Pto DC3000 AvrRpt2. The mRNA profiles were analyzed as detailed descriptions of changes in the network state resulting from the genetic perturbations. Regulatory relationships among the genes corresponding to the mutations were inferred by recursively applying a non-linear dimensionality reduction procedure to the mRNA profile data. The resulting static network model accurately predicted 23 of 25 regulatory relationships reported in the literature, suggesting that predictions of novel regulatory relationships are also accurate. The network model revealed two striking features: (i) the components of the network are highly interconnected; and (ii) negative regulatory relationships are common between signaling sectors. Complex regulatory relationships, including a novel negative regulatory relationship between the early microbe-associated molecular pattern-triggered signaling sectors and the salicylic acid sector, were further validated. We propose that prevalent negative regulatory relationships among the signaling sectors make the plant immune signaling network a “sector-switching” network, which effectively balances two apparently conflicting demands, robustness against pathogenic perturbations and moderation of negative impacts of immune responses on plant fitness. PMID:20661428

A pairwise maximum entropy model accurately describes resting-state human brain networks

PubMed Central

Watanabe, Takamitsu; Hirose, Satoshi; Wada, Hiroyuki; Imai, Yoshio; Machida, Toru; Shirouzu, Ichiro; Konishi, Seiki; Miyashita, Yasushi; Masuda, Naoki

2013-01-01

The resting-state human brain networks underlie fundamental cognitive functions and consist of complex interactions among brain regions. However, the level of complexity of the resting-state networks has not been quantified, which has prevented comprehensive descriptions of the brain activity as an integrative system. Here, we address this issue by demonstrating that a pairwise maximum entropy model, which takes into account region-specific activity rates and pairwise interactions, can be robustly and accurately fitted to resting-state human brain activities obtained by functional magnetic resonance imaging. Furthermore, to validate the approximation of the resting-state networks by the pairwise maximum entropy model, we show that the functional interactions estimated by the pairwise maximum entropy model reflect anatomical connexions more accurately than the conventional functional connectivity method. These findings indicate that a relatively simple statistical model not only captures the structure of the resting-state networks but also provides a possible method to derive physiological information about various large-scale brain networks. PMID:23340410

Novel indexes based on network structure to indicate financial market

NASA Astrophysics Data System (ADS)

Zhong, Tao; Peng, Qinke; Wang, Xiao; Zhang, Jing

2016-02-01

There have been various achievements to understand and to analyze the financial market by complex network model. However, current studies analyze the financial network model but seldom present quantified indexes to indicate or forecast the price action of market. In this paper, the stock market is modeled as a dynamic network, in which the vertices refer to listed companies and edges refer to their rank-based correlation based on price series. Characteristics of the network are analyzed and then novel indexes are introduced into market analysis, which are calculated from maximum and fully-connected subnets. The indexes are compared with existing ones and the results confirm that our indexes perform better to indicate the daily trend of market composite index in advance. Via investment simulation, the performance of our indexes is analyzed in detail. The results indicate that the dynamic complex network model could not only serve as a structural description of the financial market, but also work to predict the market and guide investment by indexes.

Complex network description of the ionosphere

NASA Astrophysics Data System (ADS)

Lu, Shikun; Zhang, Hao; Li, Xihai; Li, Yihong; Niu, Chao; Yang, Xiaoyun; Liu, Daizhi

2018-03-01

Complex networks have emerged as an essential approach of geoscience to generate novel insights into the nature of geophysical systems. To investigate the dynamic processes in the ionosphere, a directed complex network is constructed, based on a probabilistic graph of the vertical total electron content (VTEC) from 2012. The results of the power-law hypothesis test show that both the out-degree and in-degree distribution of the ionospheric network are not scale-free. Thus, the distribution of the interactions in the ionosphere is homogenous. None of the geospatial positions play an eminently important role in the propagation of the dynamic ionospheric processes. The spatial analysis of the ionospheric network shows that the interconnections principally exist between adjacent geographical locations, indicating that the propagation of the dynamic processes primarily depends on the geospatial distance in the ionosphere. Moreover, the joint distribution of the edge distances with respect to longitude and latitude directions shows that the dynamic processes travel further along the longitude than along the latitude in the ionosphere. The analysis of small-world-ness indicates that the ionospheric network possesses the small-world property, which can make the ionosphere stable and efficient in the propagation of dynamic processes.

Analysis of the structure of complex networks at different resolution levels

NASA Astrophysics Data System (ADS)

Arenas, A.; Fernández, A.; Gómez, S.

2008-05-01

Modular structure is ubiquitous in real-world complex networks, and its detection is important because it gives insights into the structure-functionality relationship. The standard approach is based on the optimization of a quality function, modularity, which is a relative quality measure for the partition of a network into modules. Recently, some authors (Fortunato and Barthélemy 2007 Proc. Natl Acad. Sci. USA 104 36 and Kumpula et al 2007 Eur. Phys. J. B 56 41) have pointed out that the optimization of modularity has a fundamental drawback: the existence of a resolution limit beyond which no modular structure can be detected even though these modules might have their own entity. The reason is that several topological descriptions of the network coexist at different scales, which is, in general, a fingerprint of complex systems. Here, we propose a method that allows for multiple resolution screening of the modular structure. The method has been validated using synthetic networks, discovering the predefined structures at all scales. Its application to two real social networks allows us to find the exact splits reported in the literature, as well as the substructure beyond the actual split.

Using RDF to Model the Structure and Process of Systems

NASA Astrophysics Data System (ADS)

Rodriguez, Marko A.; Watkins, Jennifer H.; Bollen, Johan; Gershenson, Carlos

Many systems can be described in terms of networks of discrete elements and their various relationships to one another. A semantic network, or multi-relational network, is a directed labeled graph consisting of a heterogeneous set of entities connected by a heterogeneous set of relationships. Semantic networks serve as a promising general-purpose modeling substrate for complex systems. Various standardized formats and tools are now available to support practical, large-scale semantic network models. First, the Resource Description Framework (RDF) offers a standardized semantic network data model that can be further formalized by ontology modeling languages such as RDF Schema (RDFS) and the Web Ontology Language (OWL). Second, the recent introduction of highly performant triple-stores (i.e. semantic network databases) allows semantic network models on the order of 109 edges to be efficiently stored and manipulated. RDF and its related technologies are currently used extensively in the domains of computer science, digital library science, and the biological sciences. This article will provide an introduction to RDF/RDFS/OWL and an examination of its suitability to model discrete element complex systems.

Pattern recognition tool based on complex network-based approach

NASA Astrophysics Data System (ADS)

Casanova, Dalcimar; Backes, André Ricardo; Martinez Bruno, Odemir

2013-02-01

This work proposed a generalization of the method proposed by the authors: 'A complex network-based approach for boundary shape analysis'. Instead of modelling a contour into a graph and use complex networks rules to characterize it, here, we generalize the technique. This way, the work proposes a mathematical tool for characterization signals, curves and set of points. To evaluate the pattern description power of the proposal, an experiment of plat identification based on leaf veins image are conducted. Leaf vein is a taxon characteristic used to plant identification proposes, and one of its characteristics is that these structures are complex, and difficult to be represented as a signal or curves and this way to be analyzed in a classical pattern recognition approach. Here, we model the veins as a set of points and model as graphs. As features, we use the degree and joint degree measurements in a dynamic evolution. The results demonstrates that the technique has a good power of discrimination and can be used for plant identification, as well as other complex pattern recognition tasks.

The application of ANN for zone identification in a complex reservoir

DOE Office of Scientific and Technical Information (OSTI.GOV)

White, A.C.; Molnar, D.; Aminian, K.

1995-12-31

Reservoir characterization plays a critical role in appraising the economic success of reservoir management and development methods. Nearly all reservoirs show some degree of heterogeneity, which invariably impacts production. As a result, the production performance of a complex reservoir cannot be realistically predicted without accurate reservoir description. Characterization of a heterogeneous reservoir is a complex problem. The difficulty stems from the fact that sufficient data to accurately predict the distribution of the formation attributes are not usually available. Generally the geophysical logs are available from a considerable number of wells in the reservoir. Therefore, a methodology for reservoir description andmore » characterization utilizing only well logs data represents a significant technical as well as economic advantage. One of the key issues in the description and characterization of heterogeneous formations is the distribution of various zones and their properties. In this study, several artificial neural networks (ANN) were successfully designed and developed for zone identification in a heterogeneous formation from geophysical well logs. Granny Creek Field in West Virginia has been selected as the study area in this paper. This field has produced oil from Big Injun Formation since the early 1900`s. The water flooding operations were initiated in the 1970`s and are currently still in progress. Well log data on a substantial number of wells in this reservoir were available and were collected. Core analysis results were also available from a few wells. The log data from 3 wells along with the various zone definitions were utilized to train the networks for zone recognition. The data from 2 other wells with previously determined zones, based on the core and log data, were then utilized to verify the developed networks predictions. The results indicated that ANN can be a useful tool for accurately identifying the zones in complex reservoirs.« less

Design and implementation of a software package to control a network of robotic observatories

NASA Astrophysics Data System (ADS)

Tuparev, G.; Nicolova, I.; Zlatanov, B.; Mihova, D.; Popova, I.; Hessman, F. V.

2006-09-01

We present a description of a reusable software package able to control a large, heterogeneous network of fully and semi-robotic observatories initially developed to run the MONET network of two 1.2 m telescopes. Special attention is given to the design of a robust, long-term observation scheduler which also allows the trading of observation time and facilities within various networks. The handling of the ``Phase I&II" project-development process, the time-accounting between complex organizational structures, and usability issues for making the package accessible not only to professional astronomers, but also to amateurs and high-school students is discussed. A simple RTML-based solution to link multiple networks is demonstrated.

Cellular automata with object-oriented features for parallel molecular network modeling.

PubMed

Zhu, Hao; Wu, Yinghui; Huang, Sui; Sun, Yan; Dhar, Pawan

2005-06-01

Cellular automata are an important modeling paradigm for studying the dynamics of large, parallel systems composed of multiple, interacting components. However, to model biological systems, cellular automata need to be extended beyond the large-scale parallelism and intensive communication in order to capture two fundamental properties characteristic of complex biological systems: hierarchy and heterogeneity. This paper proposes extensions to a cellular automata language, Cellang, to meet this purpose. The extended language, with object-oriented features, can be used to describe the structure and activity of parallel molecular networks within cells. Capabilities of this new programming language include object structure to define molecular programs within a cell, floating-point data type and mathematical functions to perform quantitative computation, message passing capability to describe molecular interactions, as well as new operators, statements, and built-in functions. We discuss relevant programming issues of these features, including the object-oriented description of molecular interactions with molecule encapsulation, message passing, and the description of heterogeneity and anisotropy at the cell and molecule levels. By enabling the integration of modeling at the molecular level with system behavior at cell, tissue, organ, or even organism levels, the program will help improve our understanding of how complex and dynamic biological activities are generated and controlled by parallel functioning of molecular networks. Index Terms-Cellular automata, modeling, molecular network, object-oriented.

Multiscale fracture network characterization and impact on flow: A case study on the Latemar carbonate platform

NASA Astrophysics Data System (ADS)

Hardebol, N. J.; Maier, C.; Nick, H.; Geiger, S.; Bertotti, G.; Boro, H.

2015-12-01

A fracture network arrangement is quantified across an isolated carbonate platform from outcrop and aerial imagery to address its impact on fluid flow. The network is described in terms of fracture density, orientation, and length distribution parameters. Of particular interest is the role of fracture cross connections and abutments on the effective permeability. Hence, the flow simulations explicitly account for network topology by adopting Discrete-Fracture-and-Matrix description. The interior of the Latemar carbonate platform (Dolomites, Italy) is taken as outcrop analogue for subsurface reservoirs of isolated carbonate build-ups that exhibit a fracture-dominated permeability. New is our dual strategy to describe the fracture network both as deterministic- and stochastic-based inputs for flow simulations. The fracture geometries are captured explicitly and form a multiscale data set by integration of interpretations from outcrops, airborne imagery, and lidar. The deterministic network descriptions form the basis for descriptive rules that are diagnostic of the complex natural fracture arrangement. The fracture networks exhibit a variable degree of multitier hierarchies with smaller-sized fractures abutting against larger fractures under both right and oblique angles. The influence of network topology on connectivity is quantified using Discrete-Fracture-Single phase fluid flow simulations. The simulation results show that the effective permeability for the fracture and matrix ensemble can be 50 to 400 times higher than the matrix permeability of 1.0 · 10-14 m2. The permeability enhancement is strongly controlled by the connectivity of the fracture network. Therefore, the degree of intersecting and abutting fractures should be captured from outcrops with accuracy to be of value as analogue.

Colloquium: Fractional calculus view of complexity: A tutorial

NASA Astrophysics Data System (ADS)

West, Bruce J.

2014-10-01

The fractional calculus has been part of the mathematics and science literature for 310 years. However, it is only in the past decade or so that it has drawn the attention of mainstream science as a way to describe the dynamics of complex phenomena with long-term memory, spatial heterogeneity, along with nonstationary and nonergodic statistics. The most recent application encompasses complex networks, which require new ways of thinking about the world. Part of the new cognition is provided by the fractional calculus description of temporal and topological complexity. Consequently, this Colloquium is not so much a tutorial on the mathematics of the fractional calculus as it is an exploration of how complex phenomena in the physical, social, and life sciences that have eluded traditional mathematical modeling become less mysterious when certain historical assumptions such as differentiability are discarded and the ordinary calculus is replaced with the fractional calculus. Exemplars considered include the fractional differential equations describing the dynamics of viscoelastic materials, turbulence, foraging, and phase transitions in complex social networks.

Healthcare financing, decentralization and regional health planning: federal transfers and the healthcare networks in Minas Gerais, Brazil.

PubMed

Moreira, Laura Monteiro de Castro; Ferré, Felipe; Andrade, Eli Iola Gurgel

2017-04-01

The Decrees 4279/10 and 7508/11 established norms to guide health politics, with impacts on funding of the Middle and High Complexity Hospital and Outpatient. To verify the effects on the consolidation of care networks in Minas Gerais, we performed an analytical-descriptive study of the National Health Fund from 2006 to 2014. We observed decentralization of responsibilities, accompanied of resources and innovative financing mechanisms, resulting expansion of the network care model. The federal government definitions suggest reduction of the autonomy and limitation of regional solutions.

Beyond description. Comment on "Approaching human language with complex networks" by Cong and Liu

NASA Astrophysics Data System (ADS)

Ferrer-i-Cancho, R.

2014-12-01

In their historical overview, Cong & Liu highlight Sausurre as the father of modern linguistics [1]. They apparently miss G.K. Zipf as a pioneer of the view of language as a complex system. His idea of a balance between unification and diversification forces in the organization of natural systems, e.g., vocabularies [2], can be seen as a precursor of the view of complexity as a balance between order (unification) and disorder (diversification) near the edge of chaos [3]. Although not mentioned by Cong & Liu somewhere else, trade-offs between hearer and speaker needs are very important in Zipf's view, which has inspired research on the optimal networks mapping words into meanings [4-6]. Quantitative linguists regard G.K. Zipf as the funder of modern quantitative linguistics [7], a discipline where statistics plays a central role as in network science. Interestingly, that centrality of statistics is missing Saussure's work and that of many of his successors.

Network collaboration of organisations for homeless individuals in the Montreal region

PubMed Central

Fleury, Marie-Josée; Grenier, Guy; Lesage, Alain; Ma, Nan; Ngui, André Ngamini

2014-01-01

Introduction We know little about the intensity and determinants of interorganisational collaboration within the homeless network. This study describes the characteristics and relationships (along with the variables predicting their degree of interorganisational collaboration) of 68 organisations of such a network in Montreal (Quebec, Canada). Theory and methods Data were collected primarily through a self-administered questionnaire. Descriptive analyses were conducted followed by social network and multivariate analyses. Results The Montreal homeless network has a high density (50.5%) and a decentralised structure and maintains a mostly informal collaboration with the public and cross-sectorial sectors. The network density showed more frequent contacts among four types of organisations which could point to the existence of cliques. Four variables predicted interorganisational collaboration: organisation type, number of services offered, volume of referrals and satisfaction with the relationships with public organisations. Conclusions and discussion The Montreal homeless network seems adequate to address non-complex homelessness problems. Considering, however, that most homeless individuals present chronic and complex profiles, it appears necessary to have a more formal and better integrated network of homeless organisations, particularly in the health and social service sectors, in order to improve services. PMID:24520216

Ictal visual hallucinations due to frontal lobe epilepsy in a patient with bipolar disorder☆

PubMed Central

Manfioli, Valeria; Saladini, Marina; Cagnin, Annachiara

2013-01-01

In ictal psychosis with complex visual hallucinations (VHs), widespread functional changes of cortical networks have been suggested. We describe the clinical and EEG findings of a patient with bipolar disorder who manifested complex VHs associated with intense emotional symptoms caused by frontal epileptic seizures. This description highlights the challenges of diagnosing the epileptic nature of new psychotic phenomena in patients with previous psychiatric disorders and shines light into the role of the frontal cortex in the genesis of complex VHs. PMID:25667849

Collective Intelligence: Aggregation of Information from Neighbors in a Guessing Game.

PubMed

Pérez, Toni; Zamora, Jordi; Eguíluz, Víctor M

2016-01-01

Complex systems show the capacity to aggregate information and to display coordinated activity. In the case of social systems the interaction of different individuals leads to the emergence of norms, trends in political positions, opinions, cultural traits, and even scientific progress. Examples of collective behavior can be observed in activities like the Wikipedia and Linux, where individuals aggregate their knowledge for the benefit of the community, and citizen science, where the potential of collectives to solve complex problems is exploited. Here, we conducted an online experiment to investigate the performance of a collective when solving a guessing problem in which each actor is endowed with partial information and placed as the nodes of an interaction network. We measure the performance of the collective in terms of the temporal evolution of the accuracy, finding no statistical difference in the performance for two classes of networks, regular lattices and random networks. We also determine that a Bayesian description captures the behavior pattern the individuals follow in aggregating information from neighbors to make decisions. In comparison with other simple decision models, the strategy followed by the players reveals a suboptimal performance of the collective. Our contribution provides the basis for the micro-macro connection between individual based descriptions and collective phenomena.

Collective Intelligence: Aggregation of Information from Neighbors in a Guessing Game

PubMed Central

Pérez, Toni; Zamora, Jordi; Eguíluz, Víctor M.

2016-01-01

Complex systems show the capacity to aggregate information and to display coordinated activity. In the case of social systems the interaction of different individuals leads to the emergence of norms, trends in political positions, opinions, cultural traits, and even scientific progress. Examples of collective behavior can be observed in activities like the Wikipedia and Linux, where individuals aggregate their knowledge for the benefit of the community, and citizen science, where the potential of collectives to solve complex problems is exploited. Here, we conducted an online experiment to investigate the performance of a collective when solving a guessing problem in which each actor is endowed with partial information and placed as the nodes of an interaction network. We measure the performance of the collective in terms of the temporal evolution of the accuracy, finding no statistical difference in the performance for two classes of networks, regular lattices and random networks. We also determine that a Bayesian description captures the behavior pattern the individuals follow in aggregating information from neighbors to make decisions. In comparison with other simple decision models, the strategy followed by the players reveals a suboptimal performance of the collective. Our contribution provides the basis for the micro-macro connection between individual based descriptions and collective phenomena. PMID:27093274

Airport-Noise Levels and Annoyance Model (ALAMO) user's guide

NASA Technical Reports Server (NTRS)

Deloach, R.; Donaldson, J. L.; Johnson, M. J.

1986-01-01

A guide for the use of the Airport-Noise Level and Annoyance MOdel (ALAMO) at the Langley Research Center computer complex is provided. This document is divided into 5 primary sections, the introduction, the purpose of the model, and an in-depth description of the following subsystems: baseline, noise reduction simulation and track analysis. For each subsystem, the user is provided with a description of architecture, an explanation of subsystem use, sample results, and a case runner's check list. It is assumed that the user is familiar with the operations at the Langley Research Center (LaRC) computer complex, the Network Operating System (NOS 1.4) and CYBER Control Language. Incorporated within the ALAMO model is a census database system called SITE II.

The development of Human Functional Brain Networks

PubMed Central

Power, Jonathan D; Fair, Damien A; Schlaggar, Bradley L

2010-01-01

Recent advances in MRI technology have enabled precise measurements of correlated activity throughout the brain, leading to the first comprehensive descriptions of functional brain networks in humans. This article reviews the growing literature on the development of functional networks, from infancy through adolescence, as measured by resting state functional connectivity MRI. We note several limitations of traditional approaches to describing brain networks, and describe a powerful framework for analyzing networks, called graph theory. We argue that characterization of the development of brain systems (e.g. the default mode network) should be comprehensive, considering not only relationships within a given system, but also how these relationships are situated within wider network contexts. We note that, despite substantial reorganization of functional connectivity, several large-scale network properties appear to be preserved across development, suggesting that functional brain networks, even in children, are organized in manners similar to other complex systems. PMID:20826306

Chemical-gene interaction networks and causal reasoning for biological effects prediction and prioritization of contaminants for environmental monitoring and surveillance (poster)

EPA Science Inventory

Product Description:Evaluation of the potential effects of complex mixtures of chemicals in the environment is challenged by the lack of extensive toxicity data for many chemicals. However, there are growing sources of online information that curate and compile literature reports...

Complex Adaptive Systems Based Data Integration: Theory and Applications

ERIC Educational Resources Information Center

Rohn, Eliahu

2008-01-01

Data Definition Languages (DDLs) have been created and used to represent data in programming languages and in database dictionaries. This representation includes descriptions in the form of data fields and relations in the form of a hierarchy, with the common exception of relational databases where relations are flat. Network computing created an…

Equilibria, information and frustration in heterogeneous network games with conflicting preferences

NASA Astrophysics Data System (ADS)

Mazzoli, M.; Sánchez, A.

2017-11-01

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has addressed this issue by combining the physics of complex networks with a description of interactions in terms of evolutionary game theory. We here take this research a step further by introducing a most salient societal factor such as the individuals’ preferences, a characteristic that is key to understanding much of the social phenomenology these days. We consider a heterogeneous, agent-based model in which agents interact strategically with their neighbors, but their preferences and payoffs for the possible actions differ. We study how such a heterogeneous network behaves under evolutionary dynamics and different strategic interactions, namely coordination games and best shot games. With this model we study the emergence of the equilibria predicted analytically in random graphs under best response dynamics, and we extend this test to unexplored contexts like proportional imitation and scale free networks. We show that some theoretically predicted equilibria do not arise in simulations with incomplete information, and we demonstrate the importance of the graph topology and the payoff function parameters for some games. Finally, we discuss our results with the available experimental evidence on coordination games, showing that our model agrees better with the experiment than standard economic theories, and draw hints as to how to maximize social efficiency in situations of conflicting preferences.

Participation and social networks of school-age children with complex communication needs: a descriptive study.

PubMed

Thirumanickam, Abirami; Raghavendra, Parimala; Olsson, Catherine

2011-09-01

Social participation becomes particularly important in middle childhood, as it contributes towards the acquisition and development of critical life skills such as developing friendships and a sense of belonging. However, only limited literature is available on the impact of communication difficulties on social participation in middle childhood. This study compared the participation patterns of school-age children with and without physical disabilities and complex communication needs in extracurricular activities. Participants included five children between 6-9 years of age with moderate-severe physical disability and complex communication needs, and five matched peers. Findings showed that children with physical disability and complex communication needs engaged in activities with reduced variety, lower frequency, fewer partners and in limited venues, but reported higher levels of enjoyment and preference for activity participation, than their matched peers. These children also had fewer same-aged friends, but more paid workers in their social circle. This small-scale descriptive study provides some preliminary evidence about the impact of severe communication difficulties on participation and socialization.

Using Social Network Measures in Wildlife Disease Ecology, Epidemiology, and Management

PubMed Central

Silk, Matthew J.; Croft, Darren P.; Delahay, Richard J.; Hodgson, David J.; Boots, Mike; Weber, Nicola; McDonald, Robbie A.

2017-01-01

Abstract Contact networks, behavioral interactions, and shared use of space can all have important implications for the spread of disease in animals. Social networks enable the quantification of complex patterns of interactions; therefore, network analysis is becoming increasingly widespread in the study of infectious disease in animals, including wildlife. We present an introductory guide to using social-network-analytical approaches in wildlife disease ecology, epidemiology, and management. We focus on providing detailed practical guidance for the use of basic descriptive network measures by suggesting the research questions to which each technique is best suited and detailing the software available for each. We also discuss how using network approaches can be used beyond the study of social contacts and across a range of spatial and temporal scales. Finally, we integrate these approaches to examine how network analysis can be used to inform the implementation and monitoring of effective disease management strategies. PMID:28596616

A Complex-Valued Firing-Rate Model That Approximates the Dynamics of Spiking Networks

PubMed Central

Schaffer, Evan S.; Ostojic, Srdjan; Abbott, L. F.

2013-01-01

Firing-rate models provide an attractive approach for studying large neural networks because they can be simulated rapidly and are amenable to mathematical analysis. Traditional firing-rate models assume a simple form in which the dynamics are governed by a single time constant. These models fail to replicate certain dynamic features of populations of spiking neurons, especially those involving synchronization. We present a complex-valued firing-rate model derived from an eigenfunction expansion of the Fokker-Planck equation and apply it to the linear, quadratic and exponential integrate-and-fire models. Despite being almost as simple as a traditional firing-rate description, this model can reproduce firing-rate dynamics due to partial synchronization of the action potentials in a spiking model, and it successfully predicts the transition to spike synchronization in networks of coupled excitatory and inhibitory neurons. PMID:24204236

IT product competition Network

NASA Astrophysics Data System (ADS)

Xu, Xiu-Lian; Zhou, Lei; Shi, Jian-Jun; Wang, Yong-Li; Feng, Ai-Xia; He, Da-Ren

2008-03-01

Along with the technical development, the IT product competition becomes increasingly fierce in recent years. The factories, which produce the same IT product, have to improve continuously their own product quality for taking a large piece of cake in the product sale market. We suggest using a complex network description for the IT product competition. In the network the factories are defined as nodes, and two nodes are connected by a link if they produce a common IT product. The edge represents the sale competition relationship. 2121 factories and 265 products have been investigated. Some statistical properties, such as the degree distribution, node strength distribution, assortativity, and node degree correlation have been empirically obtained.

Dissecting innate immune responses with the tools of systems biology.

PubMed

Smith, Kelly D; Bolouri, Hamid

2005-02-01

Systems biology strives to derive accurate predictive descriptions of complex systems such as innate immunity. The innate immune system is essential for host defense, yet the resulting inflammatory response must be tightly regulated. Current understanding indicates that this system is controlled by complex regulatory networks, which maintain homoeostasis while accurately distinguishing pathogenic infections from harmless exposures. Recent studies have used high throughput technologies and computational techniques that presage predictive models and will be the foundation of a systems level understanding of innate immunity.

Topology of molecular interaction networks.

PubMed

Winterbach, Wynand; Van Mieghem, Piet; Reinders, Marcel; Wang, Huijuan; de Ridder, Dick

2013-09-16

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that they share underlying design principles with many other types of networks.Initial studies suggested that molecular interaction network topology is related to biological function and evolution. However, further whole-network analyses did not lead to a unified view on what this relation may look like, with conclusions highly dependent on the type of molecular interactions considered and the metrics used to study them. It is unclear whether global network topology drives function, as suggested by some researchers, or whether it is simply a byproduct of evolution or even an artefact of representing complex molecular interaction networks as graphs.Nevertheless, network biology has progressed significantly over the last years. We review the literature, focusing on two major developments. First, realizing that molecular interaction networks can be naturally decomposed into subsystems (such as modules and pathways), topology is increasingly studied locally rather than globally. Second, there is a move from a descriptive approach to a predictive one: rather than correlating biological network topology to generic properties such as robustness, it is used to predict specific functions or phenotypes.Taken together, this change in focus from globally descriptive to locally predictive points to new avenues of research. In particular, multi-scale approaches are developments promising to drive the study of molecular interaction networks further.

Topology of molecular interaction networks

PubMed Central

2013-01-01

Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that they share underlying design principles with many other types of networks. Initial studies suggested that molecular interaction network topology is related to biological function and evolution. However, further whole-network analyses did not lead to a unified view on what this relation may look like, with conclusions highly dependent on the type of molecular interactions considered and the metrics used to study them. It is unclear whether global network topology drives function, as suggested by some researchers, or whether it is simply a byproduct of evolution or even an artefact of representing complex molecular interaction networks as graphs. Nevertheless, network biology has progressed significantly over the last years. We review the literature, focusing on two major developments. First, realizing that molecular interaction networks can be naturally decomposed into subsystems (such as modules and pathways), topology is increasingly studied locally rather than globally. Second, there is a move from a descriptive approach to a predictive one: rather than correlating biological network topology to generic properties such as robustness, it is used to predict specific functions or phenotypes. Taken together, this change in focus from globally descriptive to locally predictive points to new avenues of research. In particular, multi-scale approaches are developments promising to drive the study of molecular interaction networks further. PMID:24041013

Analysis of Stomata Distribution Patterns for Quantification of the Foliar Plasticity of Tradescantia Zebrina

NASA Astrophysics Data System (ADS)

Batista Florindo, Joao; Landini, Gabriel; Almeida Filho, Humberto; Martinez Bruno, Odemir

2015-09-01

Here we propose a method for the analysis of the stomata distribution patterns on the surface of plant leaves. We also investigate how light exposure during growth can affect stomata distribution and the plasticity of leaves. Understanding foliar plasticity (the ability of leaves to modify their structural organization to adapt to changing environmental resources) is a fundamental problem in Agricultural and Environmental Sciences. Most published work on quantification of stomata has concentrated on descriptions of their density per unit of leaf area, however density alone does not provide a complete description of the problem and leaves several unanswered questions (e.g. whether the stomata patterns change across various areas of the leaf, or how the patterns change under varying observational scales). We used two approaches here, to know, multiscale fractal dimension and complex networks, as a means to provide a description of the complexity of these distributions. In the experiments, we used 18 samples from the plant Tradescantia Zebrina grown under three different conditions (4 hours of artificial light each day, 24 hours of artificial light each day, and sunlight) for a total of 69 days. The network descriptors were capable of correctly discriminating the different conditions in 88% of cases, while the fractal descriptors discriminated 83% of the samples. This is a significant improvement over the correct classification rates achieved when using only stomata density (56% of the samples).

A toolbox for discrete modelling of cell signalling dynamics.

PubMed

Paterson, Yasmin Z; Shorthouse, David; Pleijzier, Markus W; Piterman, Nir; Bendtsen, Claus; Hall, Benjamin A; Fisher, Jasmin

2018-06-18

In an age where the volume of data regarding biological systems exceeds our ability to analyse it, many researchers are looking towards systems biology and computational modelling to help unravel the complexities of gene and protein regulatory networks. In particular, the use of discrete modelling allows generation of signalling networks in the absence of full quantitative descriptions of systems, which are necessary for ordinary differential equation (ODE) models. In order to make such techniques more accessible to mainstream researchers, tools such as the BioModelAnalyzer (BMA) have been developed to provide a user-friendly graphical interface for discrete modelling of biological systems. Here we use the BMA to build a library of discrete target functions of known canonical molecular interactions, translated from ordinary differential equations (ODEs). We then show that these BMA target functions can be used to reconstruct complex networks, which can correctly predict many known genetic perturbations. This new library supports the accessibility ethos behind the creation of BMA, providing a toolbox for the construction of complex cell signalling models without the need for extensive experience in computer programming or mathematical modelling, and allows for construction and simulation of complex biological systems with only small amounts of quantitative data.

Exploring molecular networks using MONET ontology.

PubMed

Silva, João Paulo Müller da; Lemke, Ney; Mombach, José Carlos; Souza, José Guilherme Camargo de; Sinigaglia, Marialva; Vieira, Renata

2006-03-31

The description of the complex molecular network responsible for cell behavior requires new tools to integrate large quantities of experimental data in the design of biological information systems. These tools could be used in the characterization of these networks and in the formulation of relevant biological hypotheses. The building of an ontology is a crucial step because it integrates in a coherent framework the concepts necessary to accomplish such a task. We present MONET (molecular network), an extensible ontology and an architecture designed to facilitate the integration of data originating from different public databases in a single- and well-documented relational database, that is compatible with MONET formal definition. We also present an example of an application that can easily be implemented using these tools.

Semantic mapping reveals distinct patterns in descriptions of social relations in adults with autism spectrum disorder.

PubMed

Luo, Sean X; Shinall, Jacqueline A; Peterson, Bradley S; Gerber, Andrew J

2016-08-01

Adults with autism spectrum disorder (ASD) may describe other individuals differently compared with typical adults. In this study, we first asked participants to describe closely related individuals such as parents and close friends with 10 positive and 10 negative characteristics. We then used standard natural language processing methods to digitize and visualize these descriptions. The complex patterns of these descriptive sentences exhibited a difference in semantic space between individuals with ASD and control participants. Machine learning algorithms were able to automatically detect and discriminate between these two groups. Furthermore, we showed that these descriptive sentences from adults with ASD exhibited fewer connections as defined by word-word co-occurrences in descriptions, and these connections in words formed a less "small-world" like network. Autism Res 2016, 9: 846-853. © 2015 International Society for Autism Research, Wiley Periodicals, Inc. © 2015 International Society for Autism Research, Wiley Periodicals, Inc.

Coarse-Grained Descriptions of Dynamics for Networks with Both Intrinsic and Structural Heterogeneities

PubMed Central

Bertalan, Tom; Wu, Yan; Laing, Carlo; Gear, C. William; Kevrekidis, Ioannis G.

2017-01-01

Finding accurate reduced descriptions for large, complex, dynamically evolving networks is a crucial enabler to their simulation, analysis, and ultimately design. Here, we propose and illustrate a systematic and powerful approach to obtaining good collective coarse-grained observables—variables successfully summarizing the detailed state of such networks. Finding such variables can naturally lead to successful reduced dynamic models for the networks. The main premise enabling our approach is the assumption that the behavior of a node in the network depends (after a short initial transient) on the node identity: a set of descriptors that quantify the node properties, whether intrinsic (e.g., parameters in the node evolution equations) or structural (imparted to the node by its connectivity in the particular network structure). The approach creates a natural link with modeling and “computational enabling technology” developed in the context of Uncertainty Quantification. In our case, however, we will not focus on ensembles of different realizations of a problem, each with parameters randomly selected from a distribution. We will instead study many coupled heterogeneous units, each characterized by randomly assigned (heterogeneous) parameter value(s). One could then coin the term Heterogeneity Quantification for this approach, which we illustrate through a model dynamic network consisting of coupled oscillators with one intrinsic heterogeneity (oscillator individual frequency) and one structural heterogeneity (oscillator degree in the undirected network). The computational implementation of the approach, its shortcomings and possible extensions are also discussed. PMID:28659781

IndeCut evaluates performance of network motif discovery algorithms.

PubMed

Ansariola, Mitra; Megraw, Molly; Koslicki, David

2018-05-01

Genomic networks represent a complex map of molecular interactions which are descriptive of the biological processes occurring in living cells. Identifying the small over-represented circuitry patterns in these networks helps generate hypotheses about the functional basis of such complex processes. Network motif discovery is a systematic way of achieving this goal. However, a reliable network motif discovery outcome requires generating random background networks which are the result of a uniform and independent graph sampling method. To date, there has been no method to numerically evaluate whether any network motif discovery algorithm performs as intended on realistically sized datasets-thus it was not possible to assess the validity of resulting network motifs. In this work, we present IndeCut, the first method to date that characterizes network motif finding algorithm performance in terms of uniform sampling on realistically sized networks. We demonstrate that it is critical to use IndeCut prior to running any network motif finder for two reasons. First, IndeCut indicates the number of samples needed for a tool to produce an outcome that is both reproducible and accurate. Second, IndeCut allows users to choose the tool that generates samples in the most independent fashion for their network of interest among many available options. The open source software package is available at https://github.com/megrawlab/IndeCut. megrawm@science.oregonstate.edu or david.koslicki@math.oregonstate.edu. Supplementary data are available at Bioinformatics online.

Embedding dynamical networks into distributed models

NASA Astrophysics Data System (ADS)

Innocenti, Giacomo; Paoletti, Paolo

2015-07-01

Large networks of interacting dynamical systems are well-known for the complex behaviours they are able to display, even when each node features a quite simple dynamics. Despite examples of such networks being widespread both in nature and in technological applications, the interplay between the local and the macroscopic behaviour, through the interconnection topology, is still not completely understood. Moreover, traditional analytical methods for dynamical response analysis fail because of the intrinsically large dimension of the phase space of the network which makes the general problem intractable. Therefore, in this paper we develop an approach aiming to condense all the information in a compact description based on partial differential equations. By focusing on propagative phenomena, rigorous conditions under which the original network dynamical properties can be successfully analysed within the proposed framework are derived as well. A network of Fitzhugh-Nagumo systems is finally used to illustrate the effectiveness of the proposed method.

Dynamics and thermodynamics of open chemical networks

NASA Astrophysics Data System (ADS)

Esposito, Massimiliano

Open chemical networks (OCN) are large sets of coupled chemical reactions where some of the species are chemostated (i.e. continuously restored from the environment). Cell metabolism is a notable example of OCN. Two results will be presented. First, dissipation in OCN operating in nonequilibrium steady-states strongly depends on the network topology (algebraic properties of the stoichiometric matrix). An application to oligosaccharides exchange dynamics performed by so-called D-enzymes will be provided. Second, at low concentration the dissipation of OCN is in general inaccurately predicted by deterministic dynamics (i.e. nonlinear rate equations for the species concentrations). In this case a description in terms of the chemical master equation is necessary. A notable exception is provided by so-called deficiency zero networks, i.e. chemical networks with no hidden cycles present in the graph of reactant complexes.

Universal model for collective access patterns in the Internet traffic dynamics: A superstatistical approach

NASA Astrophysics Data System (ADS)

Tamazian, A.; Nguyen, V. D.; Markelov, O. A.; Bogachev, M. I.

2016-07-01

We suggest a universal phenomenological description for the collective access patterns in the Internet traffic dynamics both at local and wide area network levels that takes into account erratic fluctuations imposed by cooperative user behaviour. Our description is based on the superstatistical approach and leads to the q-exponential inter-session time and session size distributions that are also in perfect agreement with empirical observations. The validity of the proposed description is confirmed explicitly by the analysis of complete 10-day traffic traces from the WIDE backbone link and from the local campus area network downlink from the Internet Service Provider. Remarkably, the same functional forms have been observed in the historic access patterns from single WWW servers. The suggested approach effectively accounts for the complex interplay of both “calm” and “bursty” user access patterns within a single-model setting. It also provides average sojourn time estimates with reasonable accuracy, as indicated by the queuing system performance simulation, this way largely overcoming the failure of Poisson modelling of the Internet traffic dynamics.

Role of Interfacial Water Molecules in Proline-rich Ligand Recognition by the Src Homology 3 Domain of Abl*

PubMed Central

Palencia, Andres; Camara-Artigas, Ana; Pisabarro, M. Teresa; Martinez, Jose C.; Luque, Irene

2010-01-01

The interaction of Abl-Src homology 3 domain (SH3) with the high affinity peptide p41 is the most notable example of the inconsistency existing between the currently accepted description of SH3 complexes and their binding thermodynamic signature. We had previously hypothesized that the presence of interfacial water molecules is partially responsible for this thermodynamic behavior. We present here a thermodynamic, structural, and molecular dynamics simulation study of the interaction of p41 with Abl-SH3 and a set of mutants designed to alter the water-mediated interaction network. Our results provide a detailed description of the dynamic properties of the interfacial water molecules and a molecular interpretation of the thermodynamic effects elicited by the mutations in terms of the modulation of the water-mediated hydrogen bond network. In the light of these results, a new dual binding mechanism is proposed that provides a better description of proline-rich ligand recognition by Abl-SH3 and that has important implications for rational design. PMID:19906645

Role of interfacial water molecules in proline-rich ligand recognition by the Src homology 3 domain of Abl.

PubMed

Palencia, Andres; Camara-Artigas, Ana; Pisabarro, M Teresa; Martinez, Jose C; Luque, Irene

2010-01-22

The interaction of Abl-Src homology 3 domain (SH3) with the high affinity peptide p41 is the most notable example of the inconsistency existing between the currently accepted description of SH3 complexes and their binding thermodynamic signature. We had previously hypothesized that the presence of interfacial water molecules is partially responsible for this thermodynamic behavior. We present here a thermodynamic, structural, and molecular dynamics simulation study of the interaction of p41 with Abl-SH3 and a set of mutants designed to alter the water-mediated interaction network. Our results provide a detailed description of the dynamic properties of the interfacial water molecules and a molecular interpretation of the thermodynamic effects elicited by the mutations in terms of the modulation of the water-mediated hydrogen bond network. In the light of these results, a new dual binding mechanism is proposed that provides a better description of proline-rich ligand recognition by Abl-SH3 and that has important implications for rational design.

Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds

DTIC Science & Technology

2007-03-01

for. Our PF Chang dinners and Starbuck coffee breaks were pivotal in reconstituting me to take on another day at AFIT. I don’t know how I would’ve done...performance of assign. Option Description Value -s <seed> Random Number Generator Seed varies -P Prune Unsuable Pclasses n/a -H <float> Branching

Deep hierarchical attention network for video description

NASA Astrophysics Data System (ADS)

Li, Shuohao; Tang, Min; Zhang, Jun

2018-03-01

Pairing video to natural language description remains a challenge in computer vision and machine translation. Inspired by image description, which uses an encoder-decoder model for reducing visual scene into a single sentence, we propose a deep hierarchical attention network for video description. The proposed model uses convolutional neural network (CNN) and bidirectional LSTM network as encoders while a hierarchical attention network is used as the decoder. Compared to encoder-decoder models used in video description, the bidirectional LSTM network can capture the temporal structure among video frames. Moreover, the hierarchical attention network has an advantage over single-layer attention network on global context modeling. To make a fair comparison with other methods, we evaluate the proposed architecture with different types of CNN structures and decoders. Experimental results on the standard datasets show that our model has a more superior performance than the state-of-the-art techniques.

Quantification of Degeneracy in Biological Systems for Characterization of Functional Interactions Between Modules

PubMed Central

Li, Yao; Dwivedi, Gaurav; Huang, Wen; Yi, Yingfei

2012-01-01

There is an evolutionary advantage in having multiple components with overlapping functionality (i.e degeneracy) in organisms. While theoretical considerations of degeneracy have been well established in neural networks using information theory, the same concepts have not been developed for differential systems, which form the basis of many biochemical reaction network descriptions in systems biology. Here we establish mathematical definitions of degeneracy, complexity and robustness that allow for the quantification of these properties in a system. By exciting a dynamical system with noise, the mutual information associated with a selected observable output and the interacting subspaces of input components can be used to define both complexity and degeneracy. The calculation of degeneracy in a biological network is a useful metric for evaluating features such as the sensitivity of a biological network to environmental evolutionary pressure. Using a two-receptor signal transduction network, we find that redundant components will not yield high degeneracy whereas compensatory mechanisms established by pathway crosstalk will. This form of analysis permits interrogation of large-scale differential systems for non-identical, functionally equivalent features that have evolved to maintain homeostasis during disruption of individual components. PMID:22619750

Noise-induced polarization switching in complex networks

NASA Astrophysics Data System (ADS)

Haerter, Jan O.; Díaz-Guilera, Albert; Serrano, M. Ángeles

2017-04-01

The combination of bistability and noise is ubiquitous in complex systems, from biology to social interactions, and has important implications for their functioning and resilience. Here we use a simple three-state dynamical process, in which nodes go from one pole to another through an intermediate state, to show that noise can induce polarization switching in bistable systems if dynamical correlations are significant. In large, fully connected networks, where dynamical correlations can be neglected, increasing noise yields a collapse of bistability to an unpolarized configuration where the three possible states of the nodes are equally likely. In contrast, increased noise induces abrupt and irreversible polarization switching in sparsely connected networks. In multiplexes, where each layer can have a different polarization tendency, one layer is dominant and progressively imposes its polarization state on the other, offsetting or promoting the ability of noise to switch its polarization. Overall, we show that the interplay of noise and dynamical correlations can yield discontinuous transitions between extremes, which cannot be explained by a simple mean-field description.

Back to the biology in systems biology: what can we learn from biomolecular networks?

PubMed

Huang, Sui

2004-02-01

Genome-scale molecular networks, including protein interaction and gene regulatory networks, have taken centre stage in the investigation of the burgeoning disciplines of systems biology and biocomplexity. What do networks tell us? Some see in networks simply the comprehensive, detailed description of all cellular pathways, others seek in networks simple, higher-order qualities that emerge from the collective action of the individual pathways. This paper discusses networks from an encompassing category of thinking that will hopefully help readers to bridge the gap between these polarised viewpoints. Systems biology so far has emphasised the characterisation of large pathway maps. Now one has to ask: where is the actual biology in 'systems biology'? As structures midway between genome and phenome, and by serving as an 'extended genotype' or an 'elementary phenotype', molecular networks open a new window to the study of evolution and gene function in complex living systems. For the study of evolution, features in network topology offer a novel starting point for addressing the old debate on the relative contributions of natural selection versus intrinsic constraints to a particular trait. To study the function of genes, it is necessary not only to see them in the context of gene networks, but also to reach beyond describing network topology and to embrace the global dynamics of networks that will reveal higher-order, collective behaviour of the interacting genes. This will pave the way to understanding how the complexity of genome-wide molecular networks collapses to produce a robust whole-cell behaviour that manifests as tightly-regulated switching between distinct cell fates - the basis for multicellular life.

Nonlinear model of epidemic spreading in a complex social network.

PubMed

Kosiński, Robert A; Grabowski, A

2007-10-01

The epidemic spreading in a human society is a complex process, which can be described on the basis of a nonlinear mathematical model. In such an approach the complex and hierarchical structure of social network (which has implications for the spreading of pathogens and can be treated as a complex network), can be taken into account. In our model each individual has one of the four permitted states: susceptible, infected, infective, unsusceptible or dead. This refers to the SEIR model used in epidemiology. The state of an individual changes in time, depending on the previous state and the interactions with other individuals. The description of the interpersonal contacts is based on the experimental observations of the social relations in the community. It includes spatial localization of the individuals and hierarchical structure of interpersonal interactions. Numerical simulations were performed for different types of epidemics, giving the progress of a spreading process and typical relationships (e.g. range of epidemic in time, the epidemic curve). The spreading process has a complex and spatially chaotic character. The time dependence of the number of infective individuals shows the nonlinear character of the spreading process. We investigate the influence of the preventive vaccinations on the spreading process. In particular, for a critical value of preventively vaccinated individuals the percolation threshold is observed and the epidemic is suppressed.

Using LOTOS for Formalizing Wireless Sensor Network Applications

PubMed Central

Rosa, Nelson Souto; Cunha, Paulo Roberto Freire

2007-01-01

The number of wireless sensor network (WSN) applications is rapidly increasing and becoming an integral part of sensor nodes. These applications have been widely developed on TinyOS operating system using the nesC programming language. However, due to the tight integration to physical world, limited node power and resources (CPU and memory) and complexity of combining components into an application, to build such applications is not a trivial task. In this context, we present an approach for treating with this complexity adopting a formal description technique, namely LOTOS, for formalising the WSN applications ‘behaviour. The formalisation has three main benefits: better understanding on how the application actually works, checking of desired properties of the application's behaviour, and simulation facilities. In order to illustrate the proposed approach, we apply it to two nesC traditional applications, namely BLink and Sense.

Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening

PubMed Central

Mu, Lin

2018-01-01

This work introduces a number of algebraic topology approaches, including multi-component persistent homology, multi-level persistent homology, and electrostatic persistence for the representation, characterization, and description of small molecules and biomolecular complexes. In contrast to the conventional persistent homology, multi-component persistent homology retains critical chemical and biological information during the topological simplification of biomolecular geometric complexity. Multi-level persistent homology enables a tailored topological description of inter- and/or intra-molecular interactions of interest. Electrostatic persistence incorporates partial charge information into topological invariants. These topological methods are paired with Wasserstein distance to characterize similarities between molecules and are further integrated with a variety of machine learning algorithms, including k-nearest neighbors, ensemble of trees, and deep convolutional neural networks, to manifest their descriptive and predictive powers for protein-ligand binding analysis and virtual screening of small molecules. Extensive numerical experiments involving 4,414 protein-ligand complexes from the PDBBind database and 128,374 ligand-target and decoy-target pairs in the DUD database are performed to test respectively the scoring power and the discriminatory power of the proposed topological learning strategies. It is demonstrated that the present topological learning outperforms other existing methods in protein-ligand binding affinity prediction and ligand-decoy discrimination. PMID:29309403

A Collaboration Network Model Of Cytokine-Protein Network

NASA Astrophysics Data System (ADS)

Zou, Sheng-Rong; Zhou, Ta; Peng, Yu-Jing; Guo, Zhong-Wei; Gu, Chang-Gui; He, Da-Ren

2008-03-01

Complex networks provide us a new view for investigation of immune systems. We collect data through STRING database and present a network description with cooperation network model. The cytokine-protein network model we consider is constituted by two kinds of nodes, one is immune cytokine types which can be regarded as collaboration acts, the other one is protein type which can be regarded as collaboration actors. From act degree distribution that can be well described by typical SPL (shifted power law) functions [1], we find that HRAS, TNFRSF13C, S100A8, S100A1, MAPK8, S100A7, LIF, CCL4, CXCL13 are highly collaborated with other proteins. It reveals that these mediators are important in cytokine-protein network to regulate immune activity. Dyad in the collaboration networks can be defined as two proteins and they appear in one cytokine collaboration relationship. The dyad act degree distribution can also be well described by typical SPL functions. [1] Assortativity and act degree distribution of some collaboration networks, Hui Chang, Bei-Bei Su, Yue-Ping Zhou, Daren He, Physica A, 383 (2007) 687-702

The Adoption and Diffusion of Information and Communication Technology in the Base of the Pyramid Population of Sub-Saharan Africa: A Study of Nigerian University Students

ERIC Educational Resources Information Center

Etim, Alice Sunday

2010-01-01

The global environment is a complex network of people who are grouped using different types of information. In each country, people are grouped based on such information as age, race, ethnicity, educational qualification, income, occupation, and net worth. These socioeconomic descriptions of people have relevance in our current Information Age.…

The connection-set algebra--a novel formalism for the representation of connectivity structure in neuronal network models.

PubMed

Djurfeldt, Mikael

2012-07-01

The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.

Can simple rules control development of a pioneer vertebrate neuronal network generating behavior?

PubMed

Roberts, Alan; Conte, Deborah; Hull, Mike; Merrison-Hort, Robert; al Azad, Abul Kalam; Buhl, Edgar; Borisyuk, Roman; Soffe, Stephen R

2014-01-08

How do the pioneer networks in the axial core of the vertebrate nervous system first develop? Fundamental to understanding any full-scale neuronal network is knowledge of the constituent neurons, their properties, synaptic interconnections, and normal activity. Our novel strategy uses basic developmental rules to generate model networks that retain individual neuron and synapse resolution and are capable of reproducing correct, whole animal responses. We apply our developmental strategy to young Xenopus tadpoles, whose brainstem and spinal cord share a core vertebrate plan, but at a tractable complexity. Following detailed anatomical and physiological measurements to complete a descriptive library of each type of spinal neuron, we build models of their axon growth controlled by simple chemical gradients and physical barriers. By adding dendrites and allowing probabilistic formation of synaptic connections, we reconstruct network connectivity among up to 2000 neurons. When the resulting "network" is populated by model neurons and synapses, with properties based on physiology, it can respond to sensory stimulation by mimicking tadpole swimming behavior. This functioning model represents the most complete reconstruction of a vertebrate neuronal network that can reproduce the complex, rhythmic behavior of a whole animal. The findings validate our novel developmental strategy for generating realistic networks with individual neuron- and synapse-level resolution. We use it to demonstrate how early functional neuronal connectivity and behavior may in life result from simple developmental "rules," which lay out a scaffold for the vertebrate CNS without specific neuron-to-neuron recognition.

MapReduce Algorithms for Inferring Gene Regulatory Networks from Time-Series Microarray Data Using an Information-Theoretic Approach.

PubMed

Abduallah, Yasser; Turki, Turki; Byron, Kevin; Du, Zongxuan; Cervantes-Cervantes, Miguel; Wang, Jason T L

2017-01-01

Gene regulation is a series of processes that control gene expression and its extent. The connections among genes and their regulatory molecules, usually transcription factors, and a descriptive model of such connections are known as gene regulatory networks (GRNs). Elucidating GRNs is crucial to understand the inner workings of the cell and the complexity of gene interactions. To date, numerous algorithms have been developed to infer gene regulatory networks. However, as the number of identified genes increases and the complexity of their interactions is uncovered, networks and their regulatory mechanisms become cumbersome to test. Furthermore, prodding through experimental results requires an enormous amount of computation, resulting in slow data processing. Therefore, new approaches are needed to expeditiously analyze copious amounts of experimental data resulting from cellular GRNs. To meet this need, cloud computing is promising as reported in the literature. Here, we propose new MapReduce algorithms for inferring gene regulatory networks on a Hadoop cluster in a cloud environment. These algorithms employ an information-theoretic approach to infer GRNs using time-series microarray data. Experimental results show that our MapReduce program is much faster than an existing tool while achieving slightly better prediction accuracy than the existing tool.

Profile of High School Students’ Propositional Network Representation when Interpreting Convention Diagrams

NASA Astrophysics Data System (ADS)

Fatiha, M.; Rahmat, A.; Solihat, R.

2017-09-01

The delivery of concepts in studying Biology often represented through a diagram to easily makes student understand about Biology material. One way to knowing the students’ understanding about diagram can be seen from causal relationship that is constructed by student in the propositional network representation form. This research reveal the trend of students’ propositional network representation patterns when confronted with convention diagram. This descriptive research involved 32 students at one of senior high school in Bandung. The research data was acquired by worksheet that was filled by diagram and it was developed according on information processing standards. The result of this research revealed three propositional network representation patterns are linear relationship, simple reciprocal relationship, and complex reciprocal relationship. The dominating pattern is linear form that is simply connect some information components in diagram by 59,4% students, the reciprocal relationship form with medium level by 28,1% students while the complex reciprocal relationship by only 3,1% and the rest was students who failed to connect information components by 9,4%. Based on results, most of student only able to connect information components on the picture in linear form and a few student constructing reciprocal relationship between information components on convention diagram.

Holocene monsoon variability as resolved in small complex networks from palaeodata

NASA Astrophysics Data System (ADS)

Rehfeld, K.; Marwan, N.; Breitenbach, S.; Kurths, J.

2012-04-01

To understand the impacts of Holocene precipitation and/or temperature changes in the spatially extensive and complex region of Asia, it is promising to combine the information from palaeo archives, such as e.g. stalagmites, tree rings and marine sediment records from India and China. To this end, complex networks present a powerful and increasingly popular tool for the description and analysis of interactions within complex spatially extended systems in the geosciences and therefore appear to be predestined for this task. Such a network is typically constructed by thresholding a similarity matrix which in turn is based on a set of time series representing the (Earth) system dynamics at different locations. Looking into the pre-instrumental past, information about the system's processes and thus its state is available only through the reconstructed time series which -- most often -- are irregularly sampled in time and space. Interpolation techniques are often used for signal reconstruction, but they introduce additional errors, especially when records have large gaps. We have recently developed and extensively tested methods to quantify linear (Pearson correlation) and non-linear (mutual information) similarity in presence of heterogeneous and irregular sampling. To illustrate our approach we derive small networks from significantly correlated, linked, time series which are supposed to capture the underlying Asian Monsoon dynamics. We assess and discuss whether and where links and directionalities in these networks from irregularly sampled time series can be soundly detected. Finally, we investigate the role of the Northern Hemispheric temperature with respect to the correlation patterns and find that those derived from warm phases (e.g. Medieval Warm Period) are significantly different from patterns found in cold phases (e.g. Little Ice Age).

The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction.

PubMed

Casey, M

1996-08-15

Recurrent neural networks (RNNs) can learn to perform finite state computations. It is shown that an RNN performing a finite state computation must organize its state space to mimic the states in the minimal deterministic finite state machine that can perform that computation, and a precise description of the attractor structure of such systems is given. This knowledge effectively predicts activation space dynamics, which allows one to understand RNN computation dynamics in spite of complexity in activation dynamics. This theory provides a theoretical framework for understanding finite state machine (FSM) extraction techniques and can be used to improve training methods for RNNs performing FSM computations. This provides an example of a successful approach to understanding a general class of complex systems that has not been explicitly designed, e.g., systems that have evolved or learned their internal structure.

Instrument Remote Control Application Framework

NASA Technical Reports Server (NTRS)

Ames, Troy; Hostetter, Carl F.

2006-01-01

The Instrument Remote Control (IRC) architecture is a flexible, platform-independent application framework that is well suited for the control and monitoring of remote devices and sensors. IRC enables significant savings in development costs by utilizing extensible Markup Language (XML) descriptions to configure the framework for a specific application. The Instrument Markup Language (IML) is used to describe the commands used by an instrument, the data streams produced, the rules for formatting commands and parsing the data, and the method of communication. Often no custom code is needed to communicate with a new instrument or device. An IRC instance can advertise and publish a description about a device or subscribe to another device's description on a network. This simple capability of dynamically publishing and subscribing to interfaces enables a very flexible, self-adapting architecture for monitoring and control of complex instruments in diverse environments.

Maintenance of time and frequency in the Jet Propulsion Laboratory's Deep Space Network using the Global Positioning System

NASA Technical Reports Server (NTRS)

Clements, P. A.; Borutzki, S. E.; Kirk, A.

1984-01-01

The Deep Space Network (DSN), managed by the Jet Propulsion Laboratory for NASA, must maintain time and frequency within specified limits in order to accurately track the spacecraft engaged in deep space exploration. Various methods are used to coordinate the clocks among the three tracking complexes. These methods include Loran-C, TV Line 10, Very Long Baseline Interferometry (VLBI), and the Global Positioning System (GPS). Calculations are made to obtain frequency offsets and Allan variances. These data are analyzed and used to monitor the performance of the hydrogen masers that provide the reference frequencies for the DSN Frequency and Timing System (DFT). Areas of discussion are: (1) a brief history of the GPS timing receivers in the DSN, (2) a description of the data and information flow, (3) data on the performance of the DSN master clocks and GPS measurement system, and (4) a description of hydrogen maser frequency steering using these data.

Evolutionary games on multilayer networks: a colloquium

NASA Astrophysics Data System (ADS)

Wang, Zhen; Wang, Lin; Szolnoki, Attila; Perc, Matjaž

2015-05-01

Networks form the backbone of many complex systems, ranging from the Internet to human societies. Accordingly, not only is the range of our interactions limited and thus best described and modeled by networks, it is also a fact that the networks that are an integral part of such models are often interdependent or even interconnected. Networks of networks or multilayer networks are therefore a more apt description of social systems. This colloquium is devoted to evolutionary games on multilayer networks, and in particular to the evolution of cooperation as one of the main pillars of modern human societies. We first give an overview of the most significant conceptual differences between single-layer and multilayer networks, and we provide basic definitions and a classification of the most commonly used terms. Subsequently, we review fascinating and counterintuitive evolutionary outcomes that emerge due to different types of interdependencies between otherwise independent populations. The focus is on coupling through the utilities of players, through the flow of information, as well as through the popularity of different strategies on different network layers. The colloquium highlights the importance of pattern formation and collective behavior for the promotion of cooperation under adverse conditions, as well as the synergies between network science and evolutionary game theory.

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

NASA Astrophysics Data System (ADS)

Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo

2015-11-01

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively implement neighbourhood-based link prediction entirely in the bipartite domain.

Ribbon networks for modeling navigable paths of autonomous agents in virtual environments.

PubMed

Willemsen, Peter; Kearney, Joseph K; Wang, Hongling

2006-01-01

This paper presents the Environment Description Framework (EDF) for modeling complex networks of intersecting roads and pathways in virtual environments. EDF represents information about the layout of streets and sidewalks, the rules that govern behavior on roads and walkways, and the locations of agents with respect to navigable structures. The framework serves as the substrate on which behavior programs for autonomous vehicles and pedestrians are built. Pathways are modeled as ribbons in space. The ribbon structure provides a natural coordinate frame for defining the local geometry of navigable surfaces. EDF includes a powerful runtime interface supported by robust and efficient code for locating objects on the ribbon network, for mapping between Cartesian and ribbon coordinates, and for determining behavioral constraints imposed by the environment.

End-to-end network models encompassing terrestrial, wireless, and satellite components

NASA Astrophysics Data System (ADS)

Boyarko, Chandler L.; Britton, John S.; Flores, Phil E.; Lambert, Charles B.; Pendzick, John M.; Ryan, Christopher M.; Shankman, Gordon L.; Williams, Ramon P.

2004-08-01

Development of network models that reflect true end-to-end architectures such as the Transformational Communications Architecture need to encompass terrestrial, wireless and satellite component to truly represent all of the complexities in a world wide communications network. Use of best-in-class tools including OPNET, Satellite Tool Kit (STK), Popkin System Architect and their well known XML-friendly definitions, such as OPNET Modeler's Data Type Description (DTD), or socket-based data transfer modules, such as STK/Connect, enable the sharing of data between applications for more rapid development of end-to-end system architectures and a more complete system design. By sharing the results of and integrating best-in-class tools we are able to (1) promote sharing of data, (2) enhance the fidelity of our results and (3) allow network and application performance to be viewed in the context of the entire enterprise and its processes.

The TRANSFAC project as an example of framework technology that supports the analysis of genomic regulation.

PubMed

Wingender, Edgar

2008-07-01

Since its beginning as a data collection more than 20 years ago, the TRANSFAC project underwent an evolution to become the basis for a complex platform for the description and analysis of gene regulatory events and networks. In the following, I describe what the original concepts were, what their present status is and how they may be expected to contribute to future system biology approaches.

What's Next in Complex Networks? Capturing the Concept of Attacking Play in Invasive Team Sports.

PubMed

Ramos, João; Lopes, Rui J; Araújo, Duarte

2018-01-01

The evolution of performance analysis within sports sciences is tied to technology development and practitioner demands. However, how individual and collective patterns self-organize and interact in invasive team sports remains elusive. Social network analysis has been recently proposed to resolve some aspects of this problem, and has proven successful in capturing collective features resulting from the interactions between team members as well as a powerful communication tool. Despite these advances, some fundamental team sports concepts such as an attacking play have not been properly captured by the more common applications of social network analysis to team sports performance. In this article, we propose a novel approach to team sports performance centered on sport concepts, namely that of an attacking play. Network theory and tools including temporal and bipartite or multilayered networks were used to capture this concept. We put forward eight questions directly related to team performance to discuss how common pitfalls in the use of network tools for capturing sports concepts can be avoided. Some answers are advanced in an attempt to be more precise in the description of team dynamics and to uncover other metrics directly applied to sport concepts, such as the structure and dynamics of attacking plays. Finally, we propose that, at this stage of knowledge, it may be advantageous to build up from fundamental sport concepts toward complex network theory and tools, and not the other way around.

Role of Graph Architecture in Controlling Dynamical Networks with Applications to Neural Systems.

PubMed

Kim, Jason Z; Soffer, Jonathan M; Kahn, Ari E; Vettel, Jean M; Pasqualetti, Fabio; Bassett, Danielle S

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviors such as synchronization. While descriptions of these behaviors are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behavior. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behavior in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Role of graph architecture in controlling dynamical networks with applications to neural systems

NASA Astrophysics Data System (ADS)

Kim, Jason Z.; Soffer, Jonathan M.; Kahn, Ari E.; Vettel, Jean M.; Pasqualetti, Fabio; Bassett, Danielle S.

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviours such as synchronization. Although descriptions of these behaviours are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behaviour. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behaviour in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Optimal Output of Distributed Generation Based On Complex Power Increment

NASA Astrophysics Data System (ADS)

Wu, D.; Bao, H.

2017-12-01

In order to meet the growing demand for electricity and improve the cleanliness of power generation, new energy generation, represented by wind power generation, photovoltaic power generation, etc has been widely used. The new energy power generation access to distribution network in the form of distributed generation, consumed by local load. However, with the increase of the scale of distribution generation access to the network, the optimization of its power output is becoming more and more prominent, which needs further study. Classical optimization methods often use extended sensitivity method to obtain the relationship between different power generators, but ignore the coupling parameter between nodes makes the results are not accurate; heuristic algorithm also has defects such as slow calculation speed, uncertain outcomes. This article proposes a method called complex power increment, the essence of this method is the analysis of the power grid under steady power flow. After analyzing the results we can obtain the complex scaling function equation between the power supplies, the coefficient of the equation is based on the impedance parameter of the network, so the description of the relation of variables to the coefficients is more precise Thus, the method can accurately describe the power increment relationship, and can obtain the power optimization scheme more accurately and quickly than the extended sensitivity method and heuristic method.

Genome Scale Modeling in Systems Biology: Algorithms and Resources

PubMed Central

Najafi, Ali; Bidkhori, Gholamreza; Bozorgmehr, Joseph H.; Koch, Ina; Masoudi-Nejad, Ali

2014-01-01

In recent years, in silico studies and trial simulations have complemented experimental procedures. A model is a description of a system, and a system is any collection of interrelated objects; an object, moreover, is some elemental unit upon which observations can be made but whose internal structure either does not exist or is ignored. Therefore, any network analysis approach is critical for successful quantitative modeling of biological systems. This review highlights some of most popular and important modeling algorithms, tools, and emerging standards for representing, simulating and analyzing cellular networks in five sections. Also, we try to show these concepts by means of simple example and proper images and graphs. Overall, systems biology aims for a holistic description and understanding of biological processes by an integration of analytical experimental approaches along with synthetic computational models. In fact, biological networks have been developed as a platform for integrating information from high to low-throughput experiments for the analysis of biological systems. We provide an overview of all processes used in modeling and simulating biological networks in such a way that they can become easily understandable for researchers with both biological and mathematical backgrounds. Consequently, given the complexity of generated experimental data and cellular networks, it is no surprise that researchers have turned to computer simulation and the development of more theory-based approaches to augment and assist in the development of a fully quantitative understanding of cellular dynamics. PMID:24822031

Brain correlates of aesthetic judgment of beauty.

PubMed

Jacobsen, Thomas; Schubotz, Ricarda I; Höfel, Lea; Cramon, D Yves V

2006-01-01

Functional MRI was used to investigate the neural correlates of aesthetic judgments of beauty of geometrical shapes. Participants performed evaluative aesthetic judgments (beautiful or not?) and descriptive symmetry judgments (symmetric or not?) on the same stimulus material. Symmetry was employed because aesthetic judgments are known to be often guided by criteria of symmetry. Novel, abstract graphic patterns were presented to minimize influences of attitudes or memory-related processes and to test effects of stimulus symmetry and complexity. Behavioral results confirmed the influence of stimulus symmetry and complexity on aesthetic judgments. Direct contrasts showed specific activations for aesthetic judgments in the frontomedian cortex (BA 9/10), bilateral prefrontal BA 45/47, and posterior cingulate, left temporal pole, and the temporoparietal junction. In contrast, symmetry judgments elicited specific activations in parietal and premotor areas subserving spatial processing. Interestingly, beautiful judgments enhanced BOLD signals not only in the frontomedian cortex, but also in the left intraparietal sulcus of the symmetry network. Moreover, stimulus complexity caused differential effects for each of the two judgment types. Findings indicate aesthetic judgments of beauty to rely on a network partially overlapping with that underlying evaluative judgments on social and moral cues and substantiate the significance of symmetry and complexity for our judgment of beauty.

Information geometric methods for complexity

NASA Astrophysics Data System (ADS)

Felice, Domenico; Cafaro, Carlo; Mancini, Stefano

2018-03-01

Research on the use of information geometry (IG) in modern physics has witnessed significant advances recently. In this review article, we report on the utilization of IG methods to define measures of complexity in both classical and, whenever available, quantum physical settings. A paradigmatic example of a dramatic change in complexity is given by phase transitions (PTs). Hence, we review both global and local aspects of PTs described in terms of the scalar curvature of the parameter manifold and the components of the metric tensor, respectively. We also report on the behavior of geodesic paths on the parameter manifold used to gain insight into the dynamics of PTs. Going further, we survey measures of complexity arising in the geometric framework. In particular, we quantify complexity of networks in terms of the Riemannian volume of the parameter space of a statistical manifold associated with a given network. We are also concerned with complexity measures that account for the interactions of a given number of parts of a system that cannot be described in terms of a smaller number of parts of the system. Finally, we investigate complexity measures of entropic motion on curved statistical manifolds that arise from a probabilistic description of physical systems in the presence of limited information. The Kullback-Leibler divergence, the distance to an exponential family and volumes of curved parameter manifolds, are examples of essential IG notions exploited in our discussion of complexity. We conclude by discussing strengths, limits, and possible future applications of IG methods to the physics of complexity.

Automatic discovery of the communication network topology for building a supercomputer model

NASA Astrophysics Data System (ADS)

Sobolev, Sergey; Stefanov, Konstantin; Voevodin, Vadim

2016-10-01

The Research Computing Center of Lomonosov Moscow State University is developing the Octotron software suite for automatic monitoring and mitigation of emergency situations in supercomputers so as to maximize hardware reliability. The suite is based on a software model of the supercomputer. The model uses a graph to describe the computing system components and their interconnections. One of the most complex components of a supercomputer that needs to be included in the model is its communication network. This work describes the proposed approach for automatically discovering the Ethernet communication network topology in a supercomputer and its description in terms of the Octotron model. This suite automatically detects computing nodes and switches, collects information about them and identifies their interconnections. The application of this approach is demonstrated on the "Lomonosov" and "Lomonosov-2" supercomputers.

Generalizing Gillespie’s Direct Method to Enable Network-Free Simulations

DOE PAGES

Suderman, Ryan T.; Mitra, Eshan David; Lin, Yen Ting; ...

2018-03-28

Gillespie’s direct method for stochastic simulation of chemical kinetics is a staple of computational systems biology research. However, the algorithm requires explicit enumeration of all reactions and all chemical species that may arise in the system. In many cases, this is not feasible due to the combinatorial explosion of reactions and species in biological networks. Rule-based modeling frameworks provide a way to exactly represent networks containing such combinatorial complexity, and generalizations of Gillespie’s direct method have been developed as simulation engines for rule-based modeling languages. Here, we provide both a high-level description of the algorithms underlying the simulation engines, termedmore » network-free simulation algorithms, and how they have been applied in systems biology research. We also define a generic rule-based modeling framework and describe a number of technical details required for adapting Gillespie’s direct method for network-free simulation. Lastly, we briefly discuss potential avenues for advancing network-free simulation and the role they continue to play in modeling dynamical systems in biology.« less

Effects of temporal correlations in social multiplex networks.

PubMed

Starnini, Michele; Baronchelli, Andrea; Pastor-Satorras, Romualdo

2017-08-17

Multi-layered networks represent a major advance in the description of natural complex systems, and their study has shed light on new physical phenomena. Despite its importance, however, the role of the temporal dimension in their structure and function has not been investigated in much detail so far. Here we study the temporal correlations between layers exhibited by real social multiplex networks. At a basic level, the presence of such correlations implies a certain degree of predictability in the contact pattern, as we quantify by an extension of the entropy and mutual information analyses proposed for the single-layer case. At a different level, we demonstrate that temporal correlations are a signature of a 'multitasking' behavior of network agents, characterized by a higher level of switching between different social activities than expected in a uncorrelated pattern. Moreover, temporal correlations significantly affect the dynamics of coupled epidemic processes unfolding on the network. Our work opens the way for the systematic study of temporal multiplex networks and we anticipate it will be of interest to researchers in a broad array of fields.

Generalizing Gillespie’s Direct Method to Enable Network-Free Simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suderman, Ryan T.; Mitra, Eshan David; Lin, Yen Ting

Gillespie’s direct method for stochastic simulation of chemical kinetics is a staple of computational systems biology research. However, the algorithm requires explicit enumeration of all reactions and all chemical species that may arise in the system. In many cases, this is not feasible due to the combinatorial explosion of reactions and species in biological networks. Rule-based modeling frameworks provide a way to exactly represent networks containing such combinatorial complexity, and generalizations of Gillespie’s direct method have been developed as simulation engines for rule-based modeling languages. Here, we provide both a high-level description of the algorithms underlying the simulation engines, termedmore » network-free simulation algorithms, and how they have been applied in systems biology research. We also define a generic rule-based modeling framework and describe a number of technical details required for adapting Gillespie’s direct method for network-free simulation. Lastly, we briefly discuss potential avenues for advancing network-free simulation and the role they continue to play in modeling dynamical systems in biology.« less

Network analysis: A new way of understanding psychopathology?

PubMed

Fonseca-Pedrero, Eduardo

Current taxonomic systems are based on a descriptive and categorical approach where psychopathological symptoms and signs are caused by a hypothetical underlying mental disorder. In order to circumvent the limitations of classification systems, it is necessary to incorporate new conceptual and psychometric models that allow to understand, analyze and intervene in psychopathological phenomena from another perspective. The main goal was to present a new approach called network analysis for its application in the field of psychopathology. First of all, a brief introduction where psychopathological disorders are conceived as complex dynamic systems was carried out. Key concepts, as well as the different types of networks and the procedures for their estimation, are discussed. Following this, centrality measures, important for the understanding of the network as well as to examine the relevance of the variables within the network were addressed. These factors were then exemplified by estimating a network of self-reported psychopathological symptoms in a representative sample of adolescents. Finally, a brief recapitulation is made and future lines of research are discussed. Copyright © 2017 SEP y SEPB. Publicado por Elsevier España, S.L.U. All rights reserved.

Development of pacemaker properties and rhythmogenic mechanisms in the mouse embryonic respiratory network

PubMed Central

Chevalier, Marc; Toporikova, Natalia; Simmers, John; Thoby-Brisson, Muriel

2016-01-01

Breathing is a vital rhythmic behavior generated by hindbrain neuronal circuitry, including the preBötzinger complex network (preBötC) that controls inspiration. The emergence of preBötC network activity during prenatal development has been described, but little is known regarding inspiratory neurons expressing pacemaker properties at embryonic stages. Here, we combined calcium imaging and electrophysiological recordings in mouse embryo brainstem slices together with computational modeling to reveal the existence of heterogeneous pacemaker oscillatory properties relying on distinct combinations of burst-generating INaP and ICAN conductances. The respective proportion of the different inspiratory pacemaker subtypes changes during prenatal development. Concomitantly, network rhythmogenesis switches from a purely INaP/ICAN-dependent mechanism at E16.5 to a combined pacemaker/network-driven process at E18.5. Our results provide the first description of pacemaker bursting properties in embryonic preBötC neurons and indicate that network rhythmogenesis undergoes important changes during prenatal development through alterations in both circuit properties and the biophysical characteristics of pacemaker neurons. DOI: http://dx.doi.org/10.7554/eLife.16125.001 PMID:27434668

Noisy Oscillations in the Actin Cytoskeleton of Chemotactic Amoeba.

PubMed

Negrete, Jose; Pumir, Alain; Hsu, Hsin-Fang; Westendorf, Christian; Tarantola, Marco; Beta, Carsten; Bodenschatz, Eberhard

2016-09-30

Biological systems with their complex biochemical networks are known to be intrinsically noisy. Here we investigate the dynamics of actin polymerization of amoeboid cells, which are close to the onset of oscillations. We show that the large phenotypic variability in the polymerization dynamics can be accurately captured by a generic nonlinear oscillator model in the presence of noise. We determine the relative role of the noise with a single dimensionless, experimentally accessible parameter, thus providing a quantitative description of the variability in a population of cells. Our approach, which rests on a generic description of a system close to a Hopf bifurcation and includes the effect of noise, can characterize the dynamics of a large class of noisy systems close to an oscillatory instability.

Noisy Oscillations in the Actin Cytoskeleton of Chemotactic Amoeba

NASA Astrophysics Data System (ADS)

Negrete, Jose; Pumir, Alain; Hsu, Hsin-Fang; Westendorf, Christian; Tarantola, Marco; Beta, Carsten; Bodenschatz, Eberhard

2016-09-01

Biological systems with their complex biochemical networks are known to be intrinsically noisy. Here we investigate the dynamics of actin polymerization of amoeboid cells, which are close to the onset of oscillations. We show that the large phenotypic variability in the polymerization dynamics can be accurately captured by a generic nonlinear oscillator model in the presence of noise. We determine the relative role of the noise with a single dimensionless, experimentally accessible parameter, thus providing a quantitative description of the variability in a population of cells. Our approach, which rests on a generic description of a system close to a Hopf bifurcation and includes the effect of noise, can characterize the dynamics of a large class of noisy systems close to an oscillatory instability.

Modeling of the U1 snRNP assembly pathway in alternative splicing in human cells using Petri nets.

PubMed

Kielbassa, J; Bortfeldt, R; Schuster, S; Koch, I

2009-02-01

The investigation of spliceosomal processes is currently a topic of intense research in molecular biology. In the molecular mechanism of alternative splicing, a multi-protein-RNA complex - the spliceosome - plays a crucial role. To understand the biological processes of alternative splicing, it is essential to comprehend the biogenesis of the spliceosome. In this paper, we propose the first abstract model of the regulatory assembly pathway of the human spliceosomal subunit U1. Using Petri nets, we describe its highly ordered assembly that takes place in a stepwise manner. Petri net theory represents a mathematical formalism to model and analyze systems with concurrent processes at different abstraction levels with the possibility to combine them into a uniform description language. There exist many approaches to determine static and dynamic properties of Petri nets, which can be applied to analyze biochemical systems. In addition, Petri net tools usually provide intuitively understandable graphical network representations, which facilitate the dialog between experimentalists and theoreticians. Our Petri net model covers binding, transport, signaling, and covalent modification processes. Through the computation of structural and behavioral Petri net properties and their interpretation in biological terms, we validate our model and use it to get a better understanding of the complex processes of the assembly pathway. We can explain the basic network behavior, using minimal T-invariants which represent special pathways through the network. We find linear as well as cyclic pathways. We determine the P-invariants that represent conserved moieties in a network. The simulation of the net demonstrates the importance of the stability of complexes during the maturation pathway. We can show that complexes that dissociate too fast, hinder the formation of the complete U1 snRNP.

Empirical transfer functions for stations in the Central California seismological network

USGS Publications Warehouse

Bakun, W.H.; Dratler, Jay

1976-01-01

A sequence of calibration signals composed of a station identification code, a transient from the release of the seismometer mass at rest from a known displacement from the equilibrium position, and a transient from a known step in voltage to the amplifier input are generated by the automatic daily calibration system (ADCS) now operational in the U.S. Geological Survey central California seismographic network. Documentation of a sequence of interactive programs to compute, from the calibration data, the complex transfer functions for the seismographic system (ground motion through digitizer) the electronics (amplifier through digitizer), and the seismometer alone are presented. The analysis utilizes the Fourier transform technique originally suggested by Espinosa et al (1962). Section I is a general description of seismographic calibration. Section II contrasts the 'Fourier transform' and the 'least-squares' techniques for analyzing transient calibration signals. Theoretical consideration for the Fourier transform technique used here are described in Section III. Section IV is a detailed description of the sequence of calibration signals generated by the ADCS. Section V is a brief 'cookbook description' of the calibration programs; Section VI contains a detailed sample program execution. Section VII suggests the uses of the resultant empirical transfer functions. Supplemental interactive programs by which smooth response functions, suitable for reducing seismic data to ground motion, are also documented in Section VII. Appendices A and B contain complete listings of the Fortran source Codes while Appendix C is an update containing preliminary results obtained from an analysis of some of the calibration signals from stations in the seismographic network near Oroville, California.

Maintenance of Time and Frequency in the DSN Using the Global Positioning System

NASA Technical Reports Server (NTRS)

Clements, P. A.; Kirk, A.; Borutzki, S. E.

1985-01-01

The Deep Space Network must maintain time and frequency within specified limits in order to accurately track the spacecraft engaged in deep space exploration. The DSN has three tracking complexes, located approximately equidistantly around the Earth. Various methods are used to coordinate the clocks among the three complexes. These methods include Loran-C, TV Line 10, very long baseline interferometry (VLBI), and the Global Positioning System (GPS). The GPS is becoming increasingly important because of the accuracy, precision, and rapid availability of the data; GPS receivers have been installed at each of the DSN complexes and are used to obtain daily time offsets between the master clock at each site and UTC(USNO/NBS). Calculations are made to obtain frequency offsets and Allan variances. These data are analyzed and used to monitor the performance of the hydrogen masers that provide the reference frequencies for the DSN frequency and timing system (DFT). A brief history of the GPS timing receivers in the DSN, a description of the data and information flow, data on the performance of the DSN master clocks and GPS measurement system, and a description of hydrogen maser frequency steering using these data are presented.

The visual display of regulatory information and networks.

PubMed

Pirson, I; Fortemaison, N; Jacobs, C; Dremier, S; Dumont, J E; Maenhaut, C

2000-10-01

Cell regulation and signal transduction are becoming increasingly complex, with reports of new cross-signalling, feedback, and feedforward regulations between pathways and between the multiple isozymes discovered at each step of these pathways. However, this information, which requires pages of text for its description, can be summarized in very simple schemes, although there is no consensus on the drawing of such schemes. This article presents a simple set of rules that allows a lot of information to be inserted in easily understandable displays.

Sociometric network structure and its association with methamphetamine use norms among homeless youth

PubMed Central

Barman-Adhikari, Anamika; Begun, Stephanie; Rice, Eric; Yoshioka-Maxwell, Amanda; Perez-Portillo, Andrea

2016-01-01

Homeless youths' social networks are consistently linked with their substance use. Social networks influence behavior through several mechanisms, especially social norms. This study used sociometric analyses to understand whether social norms of drug use behaviors are clustered in network structures and whether these perceived norms (descriptive and injunctive) influence youths' drug use behaviors. An event-based approach was used to delineate boundaries of the two sociometric networks of homeless youth, one in Los Angeles, CA (n = 160) and the other in Santa Monica, CA (n = 130). Network characteristics included centrality (i.e., popularity) and cohesiveness (location in dense subnetworks). The primary outcome was recent methamphetamine use. Results revealed that both descriptive and injunctive norms influenced methamphetamine use. Network cohesion was found to be associated with perception of both descriptive and injunctive norms in both networks, however in opposite directions. Network interventions therefore might be effective if designed to capitalize on social influence that naturally occurs in cohesive parts of networks. PMID:27194667

Modelling and simulating decision processes of linked lives: An approach based on concurrent processes and stochastic race.

PubMed

Warnke, Tom; Reinhardt, Oliver; Klabunde, Anna; Willekens, Frans; Uhrmacher, Adelinde M

2017-10-01

Individuals' decision processes play a central role in understanding modern migration phenomena and other demographic processes. Their integration into agent-based computational demography depends largely on suitable support by a modelling language. We are developing the Modelling Language for Linked Lives (ML3) to describe the diverse decision processes of linked lives succinctly in continuous time. The context of individuals is modelled by networks the individual is part of, such as family ties and other social networks. Central concepts, such as behaviour conditional on agent attributes, age-dependent behaviour, and stochastic waiting times, are tightly integrated in the language. Thereby, alternative decisions are modelled by concurrent processes that compete by stochastic race. Using a migration model, we demonstrate how this allows for compact description of complex decisions, here based on the Theory of Planned Behaviour. We describe the challenges for the simulation algorithm posed by stochastic race between multiple concurrent complex decisions.

Variable-free exploration of stochastic models: a gene regulatory network example.

PubMed

Erban, Radek; Frewen, Thomas A; Wang, Xiao; Elston, Timothy C; Coifman, Ronald; Nadler, Boaz; Kevrekidis, Ioannis G

2007-04-21

Finding coarse-grained, low-dimensional descriptions is an important task in the analysis of complex, stochastic models of gene regulatory networks. This task involves (a) identifying observables that best describe the state of these complex systems and (b) characterizing the dynamics of the observables. In a previous paper [R. Erban et al., J. Chem. Phys. 124, 084106 (2006)] the authors assumed that good observables were known a priori, and presented an equation-free approach to approximate coarse-grained quantities (i.e., effective drift and diffusion coefficients) that characterize the long-time behavior of the observables. Here we use diffusion maps [R. Coifman et al., Proc. Natl. Acad. Sci. U.S.A. 102, 7426 (2005)] to extract appropriate observables ("reduction coordinates") in an automated fashion; these involve the leading eigenvectors of a weighted Laplacian on a graph constructed from network simulation data. We present lifting and restriction procedures for translating between physical variables and these data-based observables. These procedures allow us to perform equation-free, coarse-grained computations characterizing the long-term dynamics through the design and processing of short bursts of stochastic simulation initialized at appropriate values of the data-based observables.

Recent development and biomedical applications of probabilistic Boolean networks

PubMed Central

2013-01-01

Probabilistic Boolean network (PBN) modelling is a semi-quantitative approach widely used for the study of the topology and dynamic aspects of biological systems. The combined use of rule-based representation and probability makes PBN appealing for large-scale modelling of biological networks where degrees of uncertainty need to be considered. A considerable expansion of our knowledge in the field of theoretical research on PBN can be observed over the past few years, with a focus on network inference, network intervention and control. With respect to areas of applications, PBN is mainly used for the study of gene regulatory networks though with an increasing emergence in signal transduction, metabolic, and also physiological networks. At the same time, a number of computational tools, facilitating the modelling and analysis of PBNs, are continuously developed. A concise yet comprehensive review of the state-of-the-art on PBN modelling is offered in this article, including a comparative discussion on PBN versus similar models with respect to concepts and biomedical applications. Due to their many advantages, we consider PBN to stand as a suitable modelling framework for the description and analysis of complex biological systems, ranging from molecular to physiological levels. PMID:23815817

Topological structures in the equities market network

PubMed Central

Leibon, Gregory; Pauls, Scott; Rockmore, Daniel; Savell, Robert

2008-01-01

We present a new method for articulating scale-dependent topological descriptions of the network structure inherent in many complex systems. The technique is based on “partition decoupled null models,” a new class of null models that incorporate the interaction of clustered partitions into a random model and generalize the Gaussian ensemble. As an application, we analyze a correlation matrix derived from 4 years of close prices of equities in the New York Stock Exchange (NYSE) and National Association of Securities Dealers Automated Quotation (NASDAQ). In this example, we expose (i) a natural structure composed of 2 interacting partitions of the market that both agrees with and generalizes standard notions of scale (e.g., sector and industry) and (ii) structure in the first partition that is a topological manifestation of a well-known pattern of capital flow called “sector rotation.” Our approach gives rise to a natural form of multiresolution analysis of the underlying time series that naturally decomposes the basic data in terms of the effects of the different scales at which it clusters. We support our conclusions and show the robustness of the technique with a successful analysis on a simulated network with an embedded topological structure. The equities market is a prototypical complex system, and we expect that our approach will be of use in understanding a broad class of complex systems in which correlation structures are resident.

Adverse outcome pathway networks II: Network analytics.

PubMed

Villeneuve, Daniel L; Angrish, Michelle M; Fortin, Marie C; Katsiadaki, Ioanna; Leonard, Marc; Margiotta-Casaluci, Luigi; Munn, Sharon; O'Brien, Jason M; Pollesch, Nathan L; Smith, L Cody; Zhang, Xiaowei; Knapen, Dries

2018-06-01

Toxicological responses to stressors are more complex than the simple one-biological-perturbation to one-adverse-outcome model portrayed by individual adverse outcome pathways (AOPs). Consequently, the AOP framework was designed to facilitate de facto development of AOP networks that can aid in the understanding and prediction of pleiotropic and interactive effects more common to environmentally realistic, complex exposure scenarios. The present study introduces nascent concepts related to the qualitative analysis of AOP networks. First, graph theory-based approaches for identifying important topological features are illustrated using 2 example AOP networks derived from existing AOP descriptions. Second, considerations for identifying the most significant path(s) through an AOP network from either a biological or risk assessment perspective are described. Finally, approaches for identifying interactions among AOPs that may result in additive, synergistic, or antagonistic responses (or previously undefined emergent patterns of response) are introduced. Along with a companion article (part I), these concepts set the stage for the development of tools and case studies that will facilitate more rigorous analysis of AOP networks, and the utility of AOP network-based predictions, for use in research and regulatory decision-making. The present study addresses one of the major themes identified through a Society of Environmental Toxicology and Chemistry Horizon Scanning effort focused on advancing the AOP framework. Environ Toxicol Chem 2018;37:1734-1748. © 2018 The Authors. Environmental Toxicology and Chemistry published by Wiley Periodicals, Inc. on behalf of SETAC. This article is a US government work and, as such, is in the public domain in the United States of America. © 2018 The Authors. Environmental Toxicology and Chemistry published by Wiley Periodicals, Inc. on behalf of SETAC. This article is a US government work and, as such, is in the public domain in the United States of America.

Chinese Mainland Movie Network

NASA Astrophysics Data System (ADS)

Liu, Ai-Fen; Xue, Yu-Hua; He, Da-Ren

2008-03-01

We propose describing a large kind of cooperation-competition networks by bipartite graphs and their unipartite projections. In the graphs the topological structure describe the cooperation-competition configuration of the basic elements, and the vertex weight describe their different roles in cooperation or results of competition. This complex network description may be helpful for finding and understanding common properties of cooperation-competition systems. In order to show an example, we performed an empirical investigation on the movie cooperation-competition network within recent 80 years in the Chinese mainland. In the net the movies are defined as nodes, and two nodes are connected by a link if a common main movie actor performs in them. The edge represents the competition relationship between two movies for more audience among a special audience colony. We obtained the statistical properties, such as the degree distribution, act degree distribution, act size distribution, and distribution of the total node weight, and explored the influence factors of Chinese mainland movie competition intensity.

Comparison of Analytical and Numerical Performance Predictions for an International Space Station Node 3 Internal Active Thermal Control System Regenerative Heat Exchanger

NASA Technical Reports Server (NTRS)

Wise, Stephen A.; Holt, James M.

2002-01-01

The complexity of International Space Station (ISS) systems modeling often necessitates the concurrence of various dissimilar, parallel analysis techniques to validate modeling. This was the case with a feasibility and performance study of the ISS Node 3 Regenerative Heat Exchanger (RHX). A thermo-hydraulic network model was created and analyzed in SINDA/FLUINT. A less complex, closed form solution of the systems dynamics was created using an Excel Spreadsheet. The purpose of this paper is to provide a brief description of the modeling processes utilized, the results and benefits of each to the ISS Node 3 RHX study.

Comparison of Analytical and Numerical Performance Predictions for a Regenerative Heat Exchanger in the International Space Station Node 3 Internal Active Thermal Control System

NASA Technical Reports Server (NTRS)

Wise, Stephen A.; Holt, James M.; Turner, Larry D. (Technical Monitor)

2001-01-01

The complexity of International Space Station (ISS) systems modeling often necessitates the concurrence of various dissimilar, parallel analysis techniques to validate modeling. This was the case with a feasibility and performance study of the ISS Node 3 Regenerative Heat Exchanger (RHX). A thermo-hydraulic network model was created and analyzed in SINDA/FLUINT. A less complex, closed form solution of the system dynamics was created using Excel. The purpose of this paper is to provide a brief description of the modeling processes utilized, the results and benefits of each to the ISS Node 3 RHX study.

Development and evaluation of packet video schemes

NASA Technical Reports Server (NTRS)

Sayood, Khalid; Chen, Y. C.; Hadenfeldt, A. C.

1990-01-01

Reflecting the two tasks proposed for the current year, namely a feasibility study of simulating the NASA network, and a study of progressive transmission schemes, are presented. The view of the NASA network, gleaned from the various technical reports made available to use, is provided. Also included is a brief overview of how the current simulator could be modified to accomplish the goal of simulating the NASA network. As the material in this section would be the basis for the actual simulation, it is important to make sure that it is an accurate reflection of the requirements on the simulator. Brief descriptions of the set of progressive transmission algorithms selected for the study are contained. The results available in the literature were obtained under a variety of different assumptions, not all of which are stated. As such, the only way to compare the efficiency and the implementational complexity of the various algorithms is to simulate them.

A Learning Framework for Winner-Take-All Networks with Stochastic Synapses.

PubMed

Mostafa, Hesham; Cauwenberghs, Gert

2018-06-01

Many recent generative models make use of neural networks to transform the probability distribution of a simple low-dimensional noise process into the complex distribution of the data. This raises the question of whether biological networks operate along similar principles to implement a probabilistic model of the environment through transformations of intrinsic noise processes. The intrinsic neural and synaptic noise processes in biological networks, however, are quite different from the noise processes used in current abstract generative networks. This, together with the discrete nature of spikes and local circuit interactions among the neurons, raises several difficulties when using recent generative modeling frameworks to train biologically motivated models. In this letter, we show that a biologically motivated model based on multilayer winner-take-all circuits and stochastic synapses admits an approximate analytical description. This allows us to use the proposed networks in a variational learning setting where stochastic backpropagation is used to optimize a lower bound on the data log likelihood, thereby learning a generative model of the data. We illustrate the generality of the proposed networks and learning technique by using them in a structured output prediction task and a semisupervised learning task. Our results extend the domain of application of modern stochastic network architectures to networks where synaptic transmission failure is the principal noise mechanism.

Realistic modeling of neurons and networks: towards brain simulation.

PubMed

D'Angelo, Egidio; Solinas, Sergio; Garrido, Jesus; Casellato, Claudia; Pedrocchi, Alessandra; Mapelli, Jonathan; Gandolfi, Daniela; Prestori, Francesca

2013-01-01

Realistic modeling is a new advanced methodology for investigating brain functions. Realistic modeling is based on a detailed biophysical description of neurons and synapses, which can be integrated into microcircuits. The latter can, in turn, be further integrated to form large-scale brain networks and eventually to reconstruct complex brain systems. Here we provide a review of the realistic simulation strategy and use the cerebellar network as an example. This network has been carefully investigated at molecular and cellular level and has been the object of intense theoretical investigation. The cerebellum is thought to lie at the core of the forward controller operations of the brain and to implement timing and sensory prediction functions. The cerebellum is well described and provides a challenging field in which one of the most advanced realistic microcircuit models has been generated. We illustrate how these models can be elaborated and embedded into robotic control systems to gain insight into how the cellular properties of cerebellar neurons emerge in integrated behaviors. Realistic network modeling opens up new perspectives for the investigation of brain pathologies and for the neurorobotic field.

Realistic modeling of neurons and networks: towards brain simulation

PubMed Central

D’Angelo, Egidio; Solinas, Sergio; Garrido, Jesus; Casellato, Claudia; Pedrocchi, Alessandra; Mapelli, Jonathan; Gandolfi, Daniela; Prestori, Francesca

Summary Realistic modeling is a new advanced methodology for investigating brain functions. Realistic modeling is based on a detailed biophysical description of neurons and synapses, which can be integrated into microcircuits. The latter can, in turn, be further integrated to form large-scale brain networks and eventually to reconstruct complex brain systems. Here we provide a review of the realistic simulation strategy and use the cerebellar network as an example. This network has been carefully investigated at molecular and cellular level and has been the object of intense theoretical investigation. The cerebellum is thought to lie at the core of the forward controller operations of the brain and to implement timing and sensory prediction functions. The cerebellum is well described and provides a challenging field in which one of the most advanced realistic microcircuit models has been generated. We illustrate how these models can be elaborated and embedded into robotic control systems to gain insight into how the cellular properties of cerebellar neurons emerge in integrated behaviors. Realistic network modeling opens up new perspectives for the investigation of brain pathologies and for the neurorobotic field. PMID:24139652

Chimera-like states in a neuronal network model of the cat brain

NASA Astrophysics Data System (ADS)

Santos, M. S.; Szezech, J. D.; Borges, F. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.; Viana, R. L.; Kurths, J.

2017-08-01

Neuronal systems have been modeled by complex networks in different description levels. Recently, it has been verified that networks can simultaneously exhibit one coherent and other incoherent domain, known as chimera states. In this work, we study the existence of chimera states in a network considering the connectivity matrix based on the cat cerebral cortex. The cerebral cortex of the cat can be separated in 65 cortical areas organised into the four cognitive regions: visual, auditory, somatosensory-motor and frontolimbic. We consider a network where the local dynamics is given by the Hindmarsh-Rose model. The Hindmarsh-Rose equations are a well known model of neuronal activity that has been considered to simulate membrane potential in neuron. Here, we analyse under which conditions chimera states are present, as well as the affects induced by intensity of coupling on them. We observe the existence of chimera states in that incoherent structure can be composed of desynchronised spikes or desynchronised bursts. Moreover, we find that chimera states with desynchronised bursts are more robust to neuronal noise than with desynchronised spikes.

Network representation of protein interactions: Theory of graph description and analysis.

PubMed

Kurzbach, Dennis

2016-09-01

A methodological framework is presented for the graph theoretical interpretation of NMR data of protein interactions. The proposed analysis generalizes the idea of network representations of protein structures by expanding it to protein interactions. This approach is based on regularization of residue-resolved NMR relaxation times and chemical shift data and subsequent construction of an adjacency matrix that represents the underlying protein interaction as a graph or network. The network nodes represent protein residues. Two nodes are connected if two residues are functionally correlated during the protein interaction event. The analysis of the resulting network enables the quantification of the importance of each amino acid of a protein for its interactions. Furthermore, the determination of the pattern of correlations between residues yields insights into the functional architecture of an interaction. This is of special interest for intrinsically disordered proteins, since the structural (three-dimensional) architecture of these proteins and their complexes is difficult to determine. The power of the proposed methodology is demonstrated at the example of the interaction between the intrinsically disordered protein osteopontin and its natural ligand heparin. © 2016 The Protein Society.

Scaling Laws of Discrete-Fracture-Network Models

NASA Astrophysics Data System (ADS)

Philippe, D.; Olivier, B.; Caroline, D.; Jean-Raynald, D.

2006-12-01

The statistical description of fracture networks through scale still remains a concern for geologists, considering the complexity of fracture networks. A challenging task of the last 20-years studies has been to find a solid and rectifiable rationale to the trivial observation that fractures exist everywhere and at all sizes. The emergence of fractal models and power-law distributions quantifies this fact, and postulates in some ways that small-scale fractures are genetically linked to their larger-scale relatives. But the validation of these scaling concepts still remains an issue considering the unreachable amount of information that would be necessary with regards to the complexity of natural fracture networks. Beyond the theoretical interest, a scaling law is a basic and necessary ingredient of Discrete-Fracture-Network models (DFN) that are used for many environmental and industrial applications (groundwater resources, mining industry, assessment of the safety of deep waste disposal sites, ..). Indeed, such a function is necessary to assemble scattered data, taken at different scales, into a unified scaling model, and to interpolate fracture densities between observations. In this study, we discuss some important issues related to scaling laws of DFN: - We first describe a complete theoretical and mathematical framework that takes account of both the fracture- size distribution and the fracture clustering through scales (fractal dimension). - We review the scaling laws that have been obtained, and we discuss the ability of fracture datasets to really constrain the parameters of the DFN model. - And finally we discuss the limits of scaling models.

Lattice based Kinetic Monte Carlo Simulations of a complex chemical reaction network

NASA Astrophysics Data System (ADS)

Danielson, Thomas; Savara, Aditya; Hin, Celine

Lattice Kinetic Monte Carlo (KMC) simulations offer a powerful alternative to using ordinary differential equations for the simulation of complex chemical reaction networks. Lattice KMC provides the ability to account for local spatial configurations of species in the reaction network, resulting in a more detailed description of the reaction pathway. In KMC simulations with a large number of reactions, the range of transition probabilities can span many orders of magnitude, creating subsets of processes that occur more frequently or more rarely. Consequently, processes that have a high probability of occurring may be selected repeatedly without actually progressing the system (i.e. the forward and reverse process for the same reaction). In order to avoid the repeated occurrence of fast frivolous processes, it is necessary to throttle the transition probabilities in such a way that avoids altering the overall selectivity. Likewise, as the reaction progresses, new frequently occurring species and reactions may be introduced, making a dynamic throttling algorithm a necessity. We present a dynamic steady-state detection scheme with the goal of accurately throttling rate constants in order to optimize the KMC run time without compromising the selectivity of the reaction network. The algorithm has been applied to a large catalytic chemical reaction network, specifically that of methanol oxidative dehydrogenation, as well as additional pathways on CeO2(111) resulting in formaldehyde, CO, methanol, CO2, H2 and H2O as gas products.

Multiscale Modeling of Gene-Behavior Associations in an Artificial Neural Network Model of Cognitive Development.

PubMed

Thomas, Michael S C; Forrester, Neil A; Ronald, Angelica

2016-01-01

In the multidisciplinary field of developmental cognitive neuroscience, statistical associations between levels of description play an increasingly important role. One example of such associations is the observation of correlations between relatively common gene variants and individual differences in behavior. It is perhaps surprising that such associations can be detected despite the remoteness of these levels of description, and the fact that behavior is the outcome of an extended developmental process involving interaction of the whole organism with a variable environment. Given that they have been detected, how do such associations inform cognitive-level theories? To investigate this question, we employed a multiscale computational model of development, using a sample domain drawn from the field of language acquisition. The model comprised an artificial neural network model of past-tense acquisition trained using the backpropagation learning algorithm, extended to incorporate population modeling and genetic algorithms. It included five levels of description-four internal: genetic, network, neurocomputation, behavior; and one external: environment. Since the mechanistic assumptions of the model were known and its operation was relatively transparent, we could evaluate whether cross-level associations gave an accurate picture of causal processes. We established that associations could be detected between artificial genes and behavioral variation, even under polygenic assumptions of a many-to-one relationship between genes and neurocomputational parameters, and when an experience-dependent developmental process interceded between the action of genes and the emergence of behavior. We evaluated these associations with respect to their specificity (to different behaviors, to function vs. structure), to their developmental stability, and to their replicability, as well as considering issues of missing heritability and gene-environment interactions. We argue that gene-behavior associations can inform cognitive theory with respect to effect size, specificity, and timing. The model demonstrates a means by which researchers can undertake multiscale modeling with respect to cognition and develop highly specific and complex hypotheses across multiple levels of description. Copyright © 2015 Cognitive Science Society, Inc.

Using Open Geographic Data to Generate Natural Language Descriptions for Hydrological Sensor Networks.

PubMed

Molina, Martin; Sanchez-Soriano, Javier; Corcho, Oscar

2015-07-03

Providing descriptions of isolated sensors and sensor networks in natural language, understandable by the general public, is useful to help users find relevant sensors and analyze sensor data. In this paper, we discuss the feasibility of using geographic knowledge from public databases available on the Web (such as OpenStreetMap, Geonames, or DBpedia) to automatically construct such descriptions. We present a general method that uses such information to generate sensor descriptions in natural language. The results of the evaluation of our method in a hydrologic national sensor network showed that this approach is feasible and capable of generating adequate sensor descriptions with a lower development effort compared to other approaches. In the paper we also analyze certain problems that we found in public databases (e.g., heterogeneity, non-standard use of labels, or rigid search methods) and their impact in the generation of sensor descriptions.

Using Open Geographic Data to Generate Natural Language Descriptions for Hydrological Sensor Networks

PubMed Central

Molina, Martin; Sanchez-Soriano, Javier; Corcho, Oscar

2015-01-01

Providing descriptions of isolated sensors and sensor networks in natural language, understandable by the general public, is useful to help users find relevant sensors and analyze sensor data. In this paper, we discuss the feasibility of using geographic knowledge from public databases available on the Web (such as OpenStreetMap, Geonames, or DBpedia) to automatically construct such descriptions. We present a general method that uses such information to generate sensor descriptions in natural language. The results of the evaluation of our method in a hydrologic national sensor network showed that this approach is feasible and capable of generating adequate sensor descriptions with a lower development effort compared to other approaches. In the paper we also analyze certain problems that we found in public databases (e.g., heterogeneity, non-standard use of labels, or rigid search methods) and their impact in the generation of sensor descriptions. PMID:26151211

Measuring and modeling correlations in multiplex networks.

PubMed

Nicosia, Vincenzo; Latora, Vito

2015-09-01

The interactions among the elementary components of many complex systems can be qualitatively different. Such systems are therefore naturally described in terms of multiplex or multilayer networks, i.e., networks where each layer stands for a different type of interaction between the same set of nodes. There is today a growing interest in understanding when and why a description in terms of a multiplex network is necessary and more informative than a single-layer projection. Here we contribute to this debate by presenting a comprehensive study of correlations in multiplex networks. Correlations in node properties, especially degree-degree correlations, have been thoroughly studied in single-layer networks. Here we extend this idea to investigate and characterize correlations between the different layers of a multiplex network. Such correlations are intrinsically multiplex, and we first study them empirically by constructing and analyzing several multiplex networks from the real world. In particular, we introduce various measures to characterize correlations in the activity of the nodes and in their degree at the different layers and between activities and degrees. We show that real-world networks exhibit indeed nontrivial multiplex correlations. For instance, we find cases where two layers of the same multiplex network are positively correlated in terms of node degrees, while other two layers are negatively correlated. We then focus on constructing synthetic multiplex networks, proposing a series of models to reproduce the correlations observed empirically and/or to assess their relevance.

Describing environmental public health data: implementing a descriptive metadata standard on the environmental public health tracking network.

PubMed

Patridge, Jeff; Namulanda, Gonza

2008-01-01

The Environmental Public Health Tracking (EPHT) Network provides an opportunity to bring together diverse environmental and health effects data by integrating}?> local, state, and national databases of environmental hazards, environmental exposures, and health effects. To help users locate data on the EPHT Network, the network will utilize descriptive metadata that provide critical information as to the purpose, location, content, and source of these data. Since 2003, the Centers for Disease Control and Prevention's EPHT Metadata Subgroup has been working to initiate the creation and use of descriptive metadata. Efforts undertaken by the group include the adoption of a metadata standard, creation of an EPHT-specific metadata profile, development of an open-source metadata creation tool, and promotion of the creation of descriptive metadata by changing the perception of metadata in the public health culture.

Analysis of Microbial Functions in the Rhizosphere Using a Metabolic-Network Based Framework for Metagenomics Interpretation

PubMed Central

Ofaim, Shany; Ofek-Lalzar, Maya; Sela, Noa; Jinag, Jiandong; Kashi, Yechezkel; Minz, Dror; Freilich, Shiri

2017-01-01

Advances in metagenomics enable high resolution description of complex bacterial communities in their natural environments. Consequently, conceptual approaches for community level functional analysis are in high need. Here, we introduce a framework for a metagenomics-based analysis of community functions. Environment-specific gene catalogs, derived from metagenomes, are processed into metabolic-network representation. By applying established ecological conventions, network-edges (metabolic functions) are assigned with taxonomic annotations according to the dominance level of specific groups. Once a function-taxonomy link is established, prediction of the impact of dominant taxa on the overall community performances is assessed by simulating removal or addition of edges (taxa associated functions). This approach is demonstrated on metagenomic data describing the microbial communities from the root environment of two crop plants – wheat and cucumber. Predictions for environment-dependent effects revealed differences between treatments (root vs. soil), corresponding to documented observations. Metabolism of specific plant exudates (e.g., organic acids, flavonoids) was linked with distinct taxonomic groups in simulated root, but not soil, environments. These dependencies point to the impact of these metabolite families as determinants of community structure. Simulations of the activity of pairwise combinations of taxonomic groups (order level) predicted the possible production of complementary metabolites. Complementation profiles allow formulating a possible metabolic role for observed co-occurrence patterns. For example, production of tryptophan-associated metabolites through complementary interactions is unique to the tryptophan-deficient cucumber root environment. Our approach enables formulation of testable predictions for species contribution to community activity and exploration of the functional outcome of structural shifts in complex bacterial communities. Understanding community-level metabolism is an essential step toward the manipulation and optimization of microbial function. Here, we introduce an analysis framework addressing three key challenges of such data: producing quantified links between taxonomy and function; contextualizing discrete functions into communal networks; and simulating environmental impact on community performances. New technologies will soon provide a high-coverage description of biotic and a-biotic aspects of complex microbial communities such as these found in gut and soil. This framework was designed to allow the integration of high-throughput metabolomic and metagenomic data toward tackling the intricate associations between community structure, community function, and metabolic inputs. PMID:28878756

Sociometric network structure and its association with methamphetamine use norms among homeless youth.

PubMed

Barman-Adhikari, Anamika; Begun, Stephanie; Rice, Eric; Yoshioka-Maxwell, Amanda; Perez-Portillo, Andrea

2016-07-01

Homeless youths' social networks are consistently linked with their substance use. Social networks influence behavior through several mechanisms, especially social norms. This study used sociometric analyses to understand whether social norms of drug use behaviors are clustered in network structures and whether these perceived norms (descriptive and injunctive) influence youths' drug use behaviors. An event-based approach was used to delineate boundaries of the two sociometric networks of homeless youth, one in Los Angeles, CA (n = 160) and the other in Santa Monica, CA (n = 130). Network characteristics included centrality (i.e., popularity) and cohesiveness (location in dense subnetworks). The primary outcome was recent methamphetamine use. Results revealed that both descriptive and injunctive norms influenced methamphetamine use. Network cohesion was found to be associated with perception of both descriptive and injunctive norms in both networks, however in opposite directions. Network interventions therefore might be effective if designed to capitalize on social influence that naturally occurs in cohesive parts of networks. Copyright © 2016 Elsevier Inc. All rights reserved.

Automatic Decision Support for Clinical Diagnostic Literature Using Link Analysis in a Weighted Keyword Network.

PubMed

Li, Shuqing; Sun, Ying; Soergel, Dagobert

2017-12-23

We present a novel approach to recommending articles from the medical literature that support clinical diagnostic decision-making, giving detailed descriptions of the associated ideas and principles. The specific goal is to retrieve biomedical articles that help answer questions of a specified type about a particular case. Based on the filtered keywords, MeSH(Medical Subject Headings) lexicon and the automatically extracted acronyms, the relationship between keywords and articles was built. The paper gives a detailed description of the process of by which keywords were measured and relevant articles identified based on link analysis in a weighted keywords network. Some important challenges identified in this study include the extraction of diagnosis-related keywords and a collection of valid sentences based on the keyword co-occurrence analysis and existing descriptions of symptoms. All data were taken from medical articles provided in the TREC (Text Retrieval Conference) clinical decision support track 2015. Ten standard topics and one demonstration topic were tested. In each case, a maximum of five articles with the highest relevance were returned. The total user satisfaction of 3.98 was 33% higher than average. The results also suggested that the smaller the number of results, the higher the average satisfaction. However, a few shortcomings were also revealed since medical literature recommendation for clinical diagnostic decision support is so complex a topic that it cannot be fully addressed through the semantic information carried solely by keywords in existing descriptions of symptoms. Nevertheless, the fact that these articles are actually relevant will no doubt inspire future research.

Network inoculation: Heteroclinics and phase transitions in an epidemic model

NASA Astrophysics Data System (ADS)

Yang, Hui; Rogers, Tim; Gross, Thilo

2016-08-01

In epidemiological modelling, dynamics on networks, and, in particular, adaptive and heterogeneous networks have recently received much interest. Here, we present a detailed analysis of a previously proposed model that combines heterogeneity in the individuals with adaptive rewiring of the network structure in response to a disease. We show that in this model, qualitative changes in the dynamics occur in two phase transitions. In a macroscopic description, one of these corresponds to a local bifurcation, whereas the other one corresponds to a non-local heteroclinic bifurcation. This model thus provides a rare example of a system where a phase transition is caused by a non-local bifurcation, while both micro- and macro-level dynamics are accessible to mathematical analysis. The bifurcation points mark the onset of a behaviour that we call network inoculation. In the respective parameter region, exposure of the system to a pathogen will lead to an outbreak that collapses but leaves the network in a configuration where the disease cannot reinvade, despite every agent returning to the susceptible class. We argue that this behaviour and the associated phase transitions can be expected to occur in a wide class of models of sufficient complexity.

A complex network description on traditional Chinese medicine system

NASA Astrophysics Data System (ADS)

Sun, Anzheng; Zhang, Peipei; He, Yue; Su, Beibei; He, Da-Ren

2004-03-01

Chinese traditional philosophy believes that a healthy body can adjust itself to reach a dynamic equilibrium with the environment. At an ill state the equilibrium is lost. Any single medicine can only attack one problem and cannot recover the whole equilibrium. A prescription formulation (PF) usually contains an "emperor" or principal medicine, several "minister" or assistant medicines, some accessorial medicines, and one or two inducting or harmonizing edicines. Therefore different traditional Chinese medicine (TCM) appears in different number of PFs. The whole TCM system may be viewed as a network set composed of many complete graphs (PFs). The TCMs, which have the highest node degrees in the network, serve as the "bridges" between the complete graphs for forming the network. While the TCMs, which have lowest node degrees in the network, serve as the "emperors" in each complete graph. According to this idea we have performed a manual statistical investigation on approximately 1000 PFs and computed 8 different tatistical properties of the network. The results show that TCM system is a scale-free one and has a nice clustering structure. We are suggesting a dynamical model to describe the development of TCM system.

Towards a microscopic description of the free-energy landscape of water.

PubMed

Prada-Gracia, Diego; Shevchuk, Roman; Hamm, Peter; Rao, Francesco

2012-10-14

Free-energy landscape theory is often used to describe complex molecular systems. Here, a microscopic description of water structure and dynamics based on configuration-space-networks and molecular dynamics simulations of the TIP4P/2005 model is applied to investigate the free-energy landscape of water. The latter is built on top of a large set of water microstates describing the kinetic stability of local hydrogen-bond arrangements up to the second solvation shell. In temperature space, the landscape displays three different regimes. At around ambient conditions, the free-energy surface is characterized by many short-lived basins of attraction which are structurally well-defined (inhomogeneous regime). At lower temperatures instead, the liquid rapidly becomes homogeneous. In this regime, the free energy is funneled-like, with fully coordinated water arrangements at the bottom of the funnel. Finally, a third regime develops below the temperature of maximal compressibility (Widom line) where the funnel becomes steeper with few interconversions between microstates other than the fully coordinated ones. Our results present a way to manage the complexity of water structure and dynamics, connecting microscopic properties to its ensemble behavior.

Gene network analysis: from heart development to cardiac therapy.

PubMed

Ferrazzi, Fulvia; Bellazzi, Riccardo; Engel, Felix B

2015-03-01

Networks offer a flexible framework to represent and analyse the complex interactions between components of cellular systems. In particular gene networks inferred from expression data can support the identification of novel hypotheses on regulatory processes. In this review we focus on the use of gene network analysis in the study of heart development. Understanding heart development will promote the elucidation of the aetiology of congenital heart disease and thus possibly improve diagnostics. Moreover, it will help to establish cardiac therapies. For example, understanding cardiac differentiation during development will help to guide stem cell differentiation required for cardiac tissue engineering or to enhance endogenous repair mechanisms. We introduce different methodological frameworks to infer networks from expression data such as Boolean and Bayesian networks. Then we present currently available temporal expression data in heart development and discuss the use of network-based approaches in published studies. Collectively, our literature-based analysis indicates that gene network analysis constitutes a promising opportunity to infer therapy-relevant regulatory processes in heart development. However, the use of network-based approaches has so far been limited by the small amount of samples in available datasets. Thus, we propose to acquire high-resolution temporal expression data to improve the mathematical descriptions of regulatory processes obtained with gene network inference methodologies. Especially probabilistic methods that accommodate the intrinsic variability of biological systems have the potential to contribute to a deeper understanding of heart development.

Neural network prediction of carbonate lithofacies from well logs, Big Bow and Sand Arroyo Creek fields, Southwest Kansas

USGS Publications Warehouse

Qi, L.; Carr, T.R.

2006-01-01

In the Hugoton Embayment of southwestern Kansas, St. Louis Limestone reservoirs have relatively low recovery efficiencies, attributed to the heterogeneous nature of the oolitic deposits. This study establishes quantitative relationships between digital well logs and core description data, and applies these relationships in a probabilistic sense to predict lithofacies in 90 uncored wells across the Big Bow and Sand Arroyo Creek fields. In 10 wells, a single hidden-layer neural network based on digital well logs and core described lithofacies of the limestone depositional texture was used to train and establish a non-linear relationship between lithofacies assignments from detailed core descriptions and selected log curves. Neural network models were optimized by selecting six predictor variables and automated cross-validation with neural network parameters and then used to predict lithofacies on the whole data set of the 2023 half-foot intervals from the 10 cored wells with the selected network size of 35 and a damping parameter of 0.01. Predicted lithofacies results compared to actual lithofacies displays absolute accuracies of 70.37-90.82%. Incorporating adjoining lithofacies, within-one lithofacies improves accuracy slightly (93.72%). Digital logs from uncored wells were batch processed to predict lithofacies and probabilities related to each lithofacies at half-foot resolution corresponding to log units. The results were used to construct interpolated cross-sections and useful depositional patterns of St. Louis lithofacies were illustrated, e.g., the concentration of oolitic deposits (including lithofacies 5 and 6) along local highs and the relative dominance of quartz-rich carbonate grainstone (lithofacies 1) in the zones A and B of the St. Louis Limestone. Neural network techniques are applicable to other complex reservoirs, in which facies geometry and distribution are the key factors controlling heterogeneity and distribution of rock properties. Future work involves extension of the neural network to predict reservoir properties, and construction of three-dimensional geo-models. ?? 2005 Elsevier Ltd. All rights reserved.

A Visually Attractive "Interconnected Network of Ideas" for Organizing the Teaching and Learning of Descriptive Inorganic Chemistry

ERIC Educational Resources Information Center

Rodgers, Glen E.

2014-01-01

A visually attractive interconnected network of ideas that helps general and second-year inorganic chemistry students make sense of the descriptive inorganic chemistry of the main-group elements is presented. The eight network components include the periodic law, the uniqueness principle, the diagonal effect, the inert-pair effect, the…

Bootstrapping on Undirected Binary Networks Via Statistical Mechanics

NASA Astrophysics Data System (ADS)

Fushing, Hsieh; Chen, Chen; Liu, Shan-Yu; Koehl, Patrice

2014-09-01

We propose a new method inspired from statistical mechanics for extracting geometric information from undirected binary networks and generating random networks that conform to this geometry. In this method an undirected binary network is perceived as a thermodynamic system with a collection of permuted adjacency matrices as its states. The task of extracting information from the network is then reformulated as a discrete combinatorial optimization problem of searching for its ground state. To solve this problem, we apply multiple ensembles of temperature regulated Markov chains to establish an ultrametric geometry on the network. This geometry is equipped with a tree hierarchy that captures the multiscale community structure of the network. We translate this geometry into a Parisi adjacency matrix, which has a relative low energy level and is in the vicinity of the ground state. The Parisi adjacency matrix is then further optimized by making block permutations subject to the ultrametric geometry. The optimal matrix corresponds to the macrostate of the original network. An ensemble of random networks is then generated such that each of these networks conforms to this macrostate; the corresponding algorithm also provides an estimate of the size of this ensemble. By repeating this procedure at different scales of the ultrametric geometry of the network, it is possible to compute its evolution entropy, i.e. to estimate the evolution of its complexity as we move from a coarse to a fine description of its geometric structure. We demonstrate the performance of this method on simulated as well as real data networks.

A simplified method of performance indicators development for epidemiological surveillance networks--application to the RESAPATH surveillance network.

PubMed

Sorbe, A; Chazel, M; Gay, E; Haenni, M; Madec, J-Y; Hendrikx, P

2011-06-01

Develop and calculate performance indicators allows to continuously follow the operation of an epidemiological surveillance network. This is an internal evaluation method, implemented by the coordinators in collaboration with all the actors of the network. Its purpose is to detect weak points in order to optimize management. A method for the development of performance indicators of epidemiological surveillance networks was developed in 2004 and was applied to several networks. Its implementation requires a thorough description of the network environment and all its activities to define priority indicators. Since this method is considered to be complex, our objective consisted in developing a simplified approach and applying it to an epidemiological surveillance network. We applied the initial method to a theoretical network model to obtain a list of generic indicators that can be adapted to any surveillance network. We obtained a list of 25 generic performance indicators, intended to be reformulated and described according to the specificities of each network. It was used to develop performance indicators for RESAPATH, an epidemiological surveillance network of antimicrobial resistance in pathogenic bacteria of animal origin in France. This application allowed us to validate the simplified method, its value in terms of practical implementation, and its level of user acceptance. Its ease of use and speed of application compared to the initial method argue in favor of its use on broader scale. Copyright © 2011 Elsevier Masson SAS. All rights reserved.

A mathematical model for mesenchymal and chemosensitive cell dynamics.

PubMed

Häcker, Anita

2012-01-01

The structure of an underlying tissue network has a strong impact on cell dynamics. If, in addition, cells alter the network by mechanical and chemical interactions, their movement is called mesenchymal. Important examples for mesenchymal movement include fibroblasts in wound healing and metastatic tumour cells. This paper is focused on the latter. Based on the anisotropic biphasic theory of Barocas and Tranquillo, which models a fibre network and interstitial solution as two-component fluid, a mathematical model for the interactions of cells with a fibre network is developed. A new description for fibre reorientation is given and orientation-dependent proteolysis is added to the model. With respect to cell dynamics, the equation, based on anisotropic diffusion, is extended by haptotaxis and chemotaxis. The chemoattractants are the solute network fragments, emerging from proteolysis, and the epidermal growth factor which may guide the cells to a blood vessel. Moreover the cell migration is impeded at either high or low network density. This new model enables us to study chemotactic cell migration in a complex fibre network and the consequential network deformation. Numerical simulations for the cell migration and network deformation are carried out in two space dimensions. Simulations of cell migration in underlying tissue networks visualise the impact of the network structure on cell dynamics. In a scenario for fibre reorientation between cell clusters good qualitative agreement with experimental results is achieved. The invasion speeds of cells in an aligned and an isotropic fibre network are compared. © Springer-Verlag 2011

Text Authorship Identified Using the Dynamics of Word Co-Occurrence Networks

PubMed Central

Akimushkin, Camilo; Amancio, Diego Raphael; Oliveira, Osvaldo Novais

2017-01-01

Automatic identification of authorship in disputed documents has benefited from complex network theory as this approach does not require human expertise or detailed semantic knowledge. Networks modeling entire books can be used to discriminate texts from different sources and understand network growth mechanisms, but only a few studies have probed the suitability of networks in modeling small chunks of text to grasp stylistic features. In this study, we introduce a methodology based on the dynamics of word co-occurrence networks representing written texts to classify a corpus of 80 texts by 8 authors. The texts were divided into sections with equal number of linguistic tokens, from which time series were created for 12 topological metrics. Since 73% of all series were stationary (ARIMA(p, 0, q)) and the remaining were integrable of first order (ARIMA(p, 1, q)), probability distributions could be obtained for the global network metrics. The metrics exhibit bell-shaped non-Gaussian distributions, and therefore distribution moments were used as learning attributes. With an optimized supervised learning procedure based on a nonlinear transformation performed by Isomap, 71 out of 80 texts were correctly classified using the K-nearest neighbors algorithm, i.e. a remarkable 88.75% author matching success rate was achieved. Hence, purely dynamic fluctuations in network metrics can characterize authorship, thus paving the way for a robust description of large texts in terms of small evolving networks. PMID:28125703

FUSE: a profit maximization approach for functional summarization of biological networks.

PubMed

Seah, Boon-Siew; Bhowmick, Sourav S; Dewey, C Forbes; Yu, Hanry

2012-03-21

The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI) using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator) that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL) principle to maximize information gain of the summary graph while satisfying the level of detail constraint. We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

Statistical mechanics of high-density bond percolation

NASA Astrophysics Data System (ADS)

Timonin, P. N.

2018-05-01

High-density (HD) percolation describes the percolation of specific κ -clusters, which are the compact sets of sites each connected to κ nearest filled sites at least. It takes place in the classical patterns of independently distributed sites or bonds in which the ordinary percolation transition also exists. Hence, the study of series of κ -type HD percolations amounts to the description of classical clusters' structure for which κ -clusters constitute κ -cores nested one into another. Such data are needed for description of a number of physical, biological, and information properties of complex systems on random lattices, graphs, and networks. They range from magnetic properties of semiconductor alloys to anomalies in supercooled water and clustering in biological and social networks. Here we present the statistical mechanics approach to study HD bond percolation on an arbitrary graph. It is shown that the generating function for κ -clusters' size distribution can be obtained from the partition function of the specific q -state Potts-Ising model in the q →1 limit. Using this approach we find exact κ -clusters' size distributions for the Bethe lattice and Erdos-Renyi graph. The application of the method to Euclidean lattices is also discussed.

From image captioning to video summary using deep recurrent networks and unsupervised segmentation

NASA Astrophysics Data System (ADS)

Morosanu, Bogdan-Andrei; Lemnaru, Camelia

2018-04-01

Automatic captioning systems based on recurrent neural networks have been tremendously successful at providing realistic natural language captions for complex and varied image data. We explore methods for adapting existing models trained on large image caption data sets to a similar problem, that of summarising videos using natural language descriptions and frame selection. These architectures create internal high level representations of the input image that can be used to define probability distributions and distance metrics on these distributions. Specifically, we interpret each hidden unit inside a layer of the caption model as representing the un-normalised log probability of some unknown image feature of interest for the caption generation process. We can then apply well understood statistical divergence measures to express the difference between images and create an unsupervised segmentation of video frames, classifying consecutive images of low divergence as belonging to the same context, and those of high divergence as belonging to different contexts. To provide a final summary of the video, we provide a group of selected frames and a text description accompanying them, allowing a user to perform a quick exploration of large unlabeled video databases.

Human mobility in a continuum approach.

PubMed

Simini, Filippo; Maritan, Amos; Néda, Zoltán

2013-01-01

Human mobility is investigated using a continuum approach that allows to calculate the probability to observe a trip to any arbitrary region, and the fluxes between any two regions. The considered description offers a general and unified framework, in which previously proposed mobility models like the gravity model, the intervening opportunities model, and the recently introduced radiation model are naturally resulting as special cases. A new form of radiation model is derived and its validity is investigated using observational data offered by commuting trips obtained from the United States census data set, and the mobility fluxes extracted from mobile phone data collected in a western European country. The new modeling paradigm offered by this description suggests that the complex topological features observed in large mobility and transportation networks may be the result of a simple stochastic process taking place on an inhomogeneous landscape.

Human Mobility in a Continuum Approach

PubMed Central

Simini, Filippo; Maritan, Amos; Néda, Zoltán

2013-01-01

Human mobility is investigated using a continuum approach that allows to calculate the probability to observe a trip to any arbitrary region, and the fluxes between any two regions. The considered description offers a general and unified framework, in which previously proposed mobility models like the gravity model, the intervening opportunities model, and the recently introduced radiation model are naturally resulting as special cases. A new form of radiation model is derived and its validity is investigated using observational data offered by commuting trips obtained from the United States census data set, and the mobility fluxes extracted from mobile phone data collected in a western European country. The new modeling paradigm offered by this description suggests that the complex topological features observed in large mobility and transportation networks may be the result of a simple stochastic process taking place on an inhomogeneous landscape. PMID:23555885

Ontology patterns for complex topographic feature yypes

USGS Publications Warehouse

Varanka, Dalia E.

2011-01-01

Complex feature types are defined as integrated relations between basic features for a shared meaning or concept. The shared semantic concept is difficult to define in commonly used geographic information systems (GIS) and remote sensing technologies. The role of spatial relations between complex feature parts was recognized in early GIS literature, but had limited representation in the feature or coverage data models of GIS. Spatial relations are more explicitly specified in semantic technology. In this paper, semantics for topographic feature ontology design patterns (ODP) are developed as data models for the representation of complex features. In the context of topographic processes, component assemblages are supported by resource systems and are found on local landscapes. The topographic ontology is organized across six thematic modules that can account for basic feature types, resource systems, and landscape types. Types of complex feature attributes include location, generative processes and physical description. Node/edge networks model standard spatial relations and relations specific to topographic science to represent complex features. To demonstrate these concepts, data from The National Map of the U. S. Geological Survey was converted and assembled into ODP.

A cross-validation package driving Netica with python

USGS Publications Warehouse

Fienen, Michael N.; Plant, Nathaniel G.

2014-01-01

Bayesian networks (BNs) are powerful tools for probabilistically simulating natural systems and emulating process models. Cross validation is a technique to avoid overfitting resulting from overly complex BNs. Overfitting reduces predictive skill. Cross-validation for BNs is known but rarely implemented due partly to a lack of software tools designed to work with available BN packages. CVNetica is open-source, written in Python, and extends the Netica software package to perform cross-validation and read, rebuild, and learn BNs from data. Insights gained from cross-validation and implications on prediction versus description are illustrated with: a data-driven oceanographic application; and a model-emulation application. These examples show that overfitting occurs when BNs become more complex than allowed by supporting data and overfitting incurs computational costs as well as causing a reduction in prediction skill. CVNetica evaluates overfitting using several complexity metrics (we used level of discretization) and its impact on performance metrics (we used skill).

Beyond blow-up in excitatory integrate and fire neuronal networks: Refractory period and spontaneous activity.

PubMed

Cáceres, María J; Perthame, Benoît

2014-06-07

The Network Noisy Leaky Integrate and Fire equation is among the simplest model allowing for a self-consistent description of neural networks and gives a rule to determine the probability to find a neuron at the potential v. However, its mathematical structure is still poorly understood and, concerning its solutions, very few results are available. In the midst of them, a recent result shows blow-up in finite time for fully excitatory networks. The intuitive explanation is that each firing neuron induces a discharge of the others; thus increases the activity and consequently the discharge rate of the full network. In order to better understand the details of the phenomena and show that the equation is more complex and fruitful than expected, we analyze further the model. We extend the finite time blow-up result to the case when neurons, after firing, enter a refractory state for a given period of time. We also show that spontaneous activity may occur when, additionally, randomness is included on the firing potential VF in regimes where blow-up occurs for a fixed value of VF. Copyright © 2014 Elsevier Ltd. All rights reserved.

Probabilistic Models and Generative Neural Networks: Towards an Unified Framework for Modeling Normal and Impaired Neurocognitive Functions

PubMed Central

Testolin, Alberto; Zorzi, Marco

2016-01-01

Connectionist models can be characterized within the more general framework of probabilistic graphical models, which allow to efficiently describe complex statistical distributions involving a large number of interacting variables. This integration allows building more realistic computational models of cognitive functions, which more faithfully reflect the underlying neural mechanisms at the same time providing a useful bridge to higher-level descriptions in terms of Bayesian computations. Here we discuss a powerful class of graphical models that can be implemented as stochastic, generative neural networks. These models overcome many limitations associated with classic connectionist models, for example by exploiting unsupervised learning in hierarchical architectures (deep networks) and by taking into account top-down, predictive processing supported by feedback loops. We review some recent cognitive models based on generative networks, and we point out promising research directions to investigate neuropsychological disorders within this approach. Though further efforts are required in order to fill the gap between structured Bayesian models and more realistic, biophysical models of neuronal dynamics, we argue that generative neural networks have the potential to bridge these levels of analysis, thereby improving our understanding of the neural bases of cognition and of pathologies caused by brain damage. PMID:27468262

Network Catastrophe: Self-Organized Patterns Reveal both the Instability and the Structure of Complex Networks

PubMed Central

Moon, Hankyu; Lu, Tsai-Ching

2015-01-01

Critical events in society or biological systems can be understood as large-scale self-emergent phenomena due to deteriorating stability. We often observe peculiar patterns preceding these events, posing a question of—how to interpret the self-organized patterns to know more about the imminent crisis. We start with a very general description — of interacting population giving rise to large-scale emergent behaviors that constitute critical events. Then we pose a key question: is there a quantifiable relation between the network of interactions and the emergent patterns? Our investigation leads to a fundamental understanding to: 1. Detect the system's transition based on the principal mode of the pattern dynamics; 2. Identify its evolving structure based on the observed patterns. The main finding of this study is that while the pattern is distorted by the network of interactions, its principal mode is invariant to the distortion even when the network constantly evolves. Our analysis on real-world markets show common self-organized behavior near the critical transitions, such as housing market collapse and stock market crashes, thus detection of critical events before they are in full effect is possible. PMID:25822423

Network Catastrophe: Self-Organized Patterns Reveal both the Instability and the Structure of Complex Networks

NASA Astrophysics Data System (ADS)

Moon, Hankyu; Lu, Tsai-Ching

2015-03-01

Critical events in society or biological systems can be understood as large-scale self-emergent phenomena due to deteriorating stability. We often observe peculiar patterns preceding these events, posing a question of--how to interpret the self-organized patterns to know more about the imminent crisis. We start with a very general description -- of interacting population giving rise to large-scale emergent behaviors that constitute critical events. Then we pose a key question: is there a quantifiable relation between the network of interactions and the emergent patterns? Our investigation leads to a fundamental understanding to: 1. Detect the system's transition based on the principal mode of the pattern dynamics; 2. Identify its evolving structure based on the observed patterns. The main finding of this study is that while the pattern is distorted by the network of interactions, its principal mode is invariant to the distortion even when the network constantly evolves. Our analysis on real-world markets show common self-organized behavior near the critical transitions, such as housing market collapse and stock market crashes, thus detection of critical events before they are in full effect is possible.

Probabilistic Models and Generative Neural Networks: Towards an Unified Framework for Modeling Normal and Impaired Neurocognitive Functions.

PubMed

Testolin, Alberto; Zorzi, Marco

2016-01-01

Connectionist models can be characterized within the more general framework of probabilistic graphical models, which allow to efficiently describe complex statistical distributions involving a large number of interacting variables. This integration allows building more realistic computational models of cognitive functions, which more faithfully reflect the underlying neural mechanisms at the same time providing a useful bridge to higher-level descriptions in terms of Bayesian computations. Here we discuss a powerful class of graphical models that can be implemented as stochastic, generative neural networks. These models overcome many limitations associated with classic connectionist models, for example by exploiting unsupervised learning in hierarchical architectures (deep networks) and by taking into account top-down, predictive processing supported by feedback loops. We review some recent cognitive models based on generative networks, and we point out promising research directions to investigate neuropsychological disorders within this approach. Though further efforts are required in order to fill the gap between structured Bayesian models and more realistic, biophysical models of neuronal dynamics, we argue that generative neural networks have the potential to bridge these levels of analysis, thereby improving our understanding of the neural bases of cognition and of pathologies caused by brain damage.

Simulation of Hydraulic and Natural Fracture Interaction Using a Coupled DFN-DEM Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou, J.; Huang, H.; Deo, M.

2016-03-01

The presence of natural fractures will usually result in a complex fracture network due to the interactions between hydraulic and natural fracture. The reactivation of natural fractures can generally provide additional flow paths from formation to wellbore which play a crucial role in improving the hydrocarbon recovery in these ultra-low permeability reservoir. Thus, accurate description of the geometry of discrete fractures and bedding is highly desired for accurate flow and production predictions. Compared to conventional continuum models that implicitly represent the discrete feature, Discrete Fracture Network (DFN) models could realistically model the connectivity of discontinuities at both reservoir scale andmore » well scale. In this work, a new hybrid numerical model that couples Discrete Fracture Network (DFN) and Dual-Lattice Discrete Element Method (DL-DEM) is proposed to investigate the interaction between hydraulic fracture and natural fractures. Based on the proposed model, the effects of natural fracture orientation, density and injection properties on hydraulic-natural fractures interaction are investigated.« less

Simulation of Hydraulic and Natural Fracture Interaction Using a Coupled DFN-DEM Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

J. Zhou; H. Huang; M. Deo

The presence of natural fractures will usually result in a complex fracture network due to the interactions between hydraulic and natural fracture. The reactivation of natural fractures can generally provide additional flow paths from formation to wellbore which play a crucial role in improving the hydrocarbon recovery in these ultra-low permeability reservoir. Thus, accurate description of the geometry of discrete fractures and bedding is highly desired for accurate flow and production predictions. Compared to conventional continuum models that implicitly represent the discrete feature, Discrete Fracture Network (DFN) models could realistically model the connectivity of discontinuities at both reservoir scale andmore » well scale. In this work, a new hybrid numerical model that couples Discrete Fracture Network (DFN) and Dual-Lattice Discrete Element Method (DL-DEM) is proposed to investigate the interaction between hydraulic fracture and natural fractures. Based on the proposed model, the effects of natural fracture orientation, density and injection properties on hydraulic-natural fractures interaction are investigated.« less

How Genetics Has Helped Piece Together the MAPK Signaling Pathway.

PubMed

Ashton-Beaucage, Dariel; Therrien, Marc

2017-01-01

Cells respond to changes in their environment, to developmental cues, and to pathogen aggression through the action of a complex network of proteins. These networks can be decomposed into a multitude of signaling pathways that relay signals from the microenvironment to the cellular components involved in eliciting a specific response. Perturbations in these signaling processes are at the root of multiple pathologies, the most notable of these being cancer. The study of receptor tyrosine kinase (RTK) signaling led to the first description of a mechanism whereby an extracellular signal is transmitted to the nucleus to induce a transcriptional response. Genetic studies conducted in drosophila and nematodes have provided key elements to this puzzle. Here, we briefly discuss the somewhat lesser known contribution of these multicellular organisms to our understanding of what has come to be known as the prototype of signaling pathways. We also discuss the ostensibly much larger network of regulators that has emerged from recent functional genomic investigations of RTK/RAS/ERK signaling.

Inferring the mesoscale structure of layered, edge-valued, and time-varying networks

NASA Astrophysics Data System (ADS)

Peixoto, Tiago P.

2015-10-01

Many network systems are composed of interdependent but distinct types of interactions, which cannot be fully understood in isolation. These different types of interactions are often represented as layers, attributes on the edges, or as a time dependence of the network structure. Although they are crucial for a more comprehensive scientific understanding, these representations offer substantial challenges. Namely, it is an open problem how to precisely characterize the large or mesoscale structure of network systems in relation to these additional aspects. Furthermore, the direct incorporation of these features invariably increases the effective dimension of the network description, and hence aggravates the problem of overfitting, i.e., the use of overly complex characterizations that mistake purely random fluctuations for actual structure. In this work, we propose a robust and principled method to tackle these problems, by constructing generative models of modular network structure, incorporating layered, attributed and time-varying properties, as well as a nonparametric Bayesian methodology to infer the parameters from data and select the most appropriate model according to statistical evidence. We show that the method is capable of revealing hidden structure in layered, edge-valued, and time-varying networks, and that the most appropriate level of granularity with respect to the additional dimensions can be reliably identified. We illustrate our approach on a variety of empirical systems, including a social network of physicians, the voting correlations of deputies in the Brazilian national congress, the global airport network, and a proximity network of high-school students.

Information flow in the auditory cortical network

PubMed Central

Hackett, Troy A.

2011-01-01

Auditory processing in the cerebral cortex is comprised of an interconnected network of auditory and auditory-related areas distributed throughout the forebrain. The nexus of auditory activity is located in temporal cortex among several specialized areas, or fields, that receive dense inputs from the medial geniculate complex. These areas are collectively referred to as auditory cortex. Auditory activity is extended beyond auditory cortex via connections with auditory-related areas elsewhere in the cortex. Within this network, information flows between areas to and from countless targets, but in a manner that is characterized by orderly regional, areal and laminar patterns. These patterns reflect some of the structural constraints that passively govern the flow of information at all levels of the network. In addition, the exchange of information within these circuits is dynamically regulated by intrinsic neurochemical properties of projecting neurons and their targets. This article begins with an overview of the principal circuits and how each is related to information flow along major axes of the network. The discussion then turns to a description of neurochemical gradients along these axes, highlighting recent work on glutamate transporters in the thalamocortical projections to auditory cortex. The article concludes with a brief discussion of relevant neurophysiological findings as they relate to structural gradients in the network. PMID:20116421

Axial complex and associated structures of the sea urchin Strongylocentrotus pallidus (Sars, G.O. 1871) (Echinodermata: Echinoidea).

PubMed

Ezhova, Olga Vladimirovna; Malakhov, Vladimir Vasil'yevich; Egorova, Ekaterina Alekseevna

2018-06-01

Studies of echinoid microscopic anatomy over the last two centuries have created a number of inaccuracies and mistakes that have accumulated in the descriptions of the intricate organization of the coelomic system of Echinoidea. To clarify the situation, we reconstructed the axial complex and radial complex of the echinoid Strongylocentrotus pallidus. The water ring is located between the perivisceral coelom and the perioral coelom. The oral haemal ring lies between the coelothelia of the water-vascular, perivisceral, and perioral rings. The axial part of the axial organ communicates with the oral haemal ring in interradius CD, but the axial coelom does not form the axocoelomic perihaemal ring. The ventral intestinal haemal vessel originates from the oral haemal ring in radius A, and then branches into a network of capillaries, from which the dorsal intestinal vessel starts. The pericardial coelom envelopes the pericardial part of the axial organ, the lacunae of which communicate with the haemocoel of the body wall and with the axial part of the axial organ. The genital haemal ring and the dorsal intestinal vessel communicate with the axial organ. The genital coelom passes in the CD interradius on the side opposite to the hindgut. There is a somatocoelomic perihaemal ring, which sends a pair of coelomic outgrowths into each radius, accompanied by a radial haemal vessel in the oral part. The mistakes and inaccuracies of early descriptions of the echinoid axial complex are listed. The axial complex and associated structures of sea urchins are compared with other eleutherozoans. © 2018 Wiley Periodicals, Inc.

Discovering the Network and Communicating amoungst Astronomy Librarians: or Finding my Feet

NASA Astrophysics Data System (ADS)

Hurn, Mark David

A light-hearted description of starting work and finding the networks in astronomy libraries. Starting with a description of my librarianship career before astronomy. Networking with (SLIL Special Librarians In London). Why I applied for this job. Starting work at the Institute of Astronomy. A brief description of the Institute library. A glorious tradition: IoA librarians past and present. Getting to know the computers. Joining email lists (ASTROLIB and SLAPAM). Adventures with email and web forums. Saying hello, introducing myself to other Astronomy librarians (RAS and ROE). Other libraries and other networks (SLIC and CLG) in Cambridge. Other libraries in Britain. Unusual inter-library loan sources. Getting on with the job: my plans for the future. Looking back: where I went right and where I went wrong.

Descriptive and Injunctive Network Norms Associated with Non Medical Use of Prescription Drugs among Homeless Youth

PubMed Central

Barman-Adhikari, Anamika; Al Tayyib, Alia; Begun, Stephanie; Bowen, Elizabeth; Rice, Eric

2016-01-01

Background Nonmedical use of prescription drugs (NMUPD) among youth and young adults is being increasingly recognized as a significant public health problem. Homeless youth in particular are more likely to engage in NMUPD compared to housed youth. Studies suggest that network norms are strongly associated with a range of substance use behaviors. However, evidence regarding the association between network norms and NMUPD is scarce. We sought to understand whether social network norms of NMUPD are associated with engagement in NMUPD among homeless youth. Methods 1,046 homeless youth were recruited from three drop-in centers in Los Angeles, CA and were interviewed regarding their individual and social network characteristics. Multivariate logistic regression was employed to evaluate the significance of associations between social norms (descriptive and injunctive) and self-reported NMUPD. Results Approximately 25% of youth reported past 30-day NMUPD. However, more youth (32.28%) of youth believed that their network members engage in NMUPD, perhaps suggesting some pluralistic ignorance bias. Both descriptive and injunctive norms were associated with self-reported NMUPD among homeless youth. However, these varied by network type, with presence of NMUPD engaged street-based and home-based peers (descriptive norm) increasing the likelihood of NMUPD, while objections from family-members (injunctive norm) decreasing that likelihood. Conclusions Our findings suggest that, like other substance use behaviors, NMUPD is also influenced by youths’ perceptions of the behaviors of their social network members. Therefore, prevention and interventions programs designed to influence NMUPD might benefit from taking a social network norms approach. PMID:27563741

Descriptive and injunctive network norms associated with nonmedical use of prescription drugs among homeless youth.

PubMed

Barman-Adhikari, Anamika; Al Tayyib, Alia; Begun, Stephanie; Bowen, Elizabeth; Rice, Eric

2017-01-01

Nonmedical use of prescription drugs (NMUPD) among youth and young adults is being increasingly recognized as a significant public health problem. Homeless youth in particular are more likely to engage in NMUPD compared to housed youth. Studies suggest that network norms are strongly associated with a range of substance use behaviors. However, evidence regarding the association between network norms and NMUPD is scarce. We sought to understand whether social network norms of NMUPD are associated with engagement in NMUPD among homeless youth. 1046 homeless youth were recruited from three drop-in centers in Los Angeles, CA and were interviewed regarding their individual and social network characteristics. Multivariate logistic regression was employed to evaluate the significance of associations between social norms (descriptive and injunctive) and self-reported NMUPD. Approximately 25% of youth reported past 30-day NMUPD. However, more youth (32.28%) of youth believed that their network members engage in NMUPD, perhaps suggesting some pluralistic ignorance bias. Both descriptive and injunctive norms were associated with self-reported NMUPD among homeless youth. However, these varied by network type, with presence of NMUPD engaged street-based and home-based peers (descriptive norm) increasing the likelihood of NMUPD, while objections from family-members (injunctive norm) decreasing that likelihood. Our findings suggest that, like other substance use behaviors, NMUPD is also influenced by youths' perceptions of the behaviors of their social network members. Therefore, prevention and interventions programs designed to influence NMUPD might benefit from taking a social network norms approach. Copyright © 2016 Elsevier Ltd. All rights reserved.

The Best of the Network 1993.

ERIC Educational Resources Information Center

Middle Grades Reading Network, Evansville, IN.

This booklet presents descriptions of 19 reading programs that encourage Indiana middle-grade students to read. The programs described in the booklet were part of the Middle Grades Reading Network and were funded with competitive $5000 "minigrants." Essays (descriptions of the reading programs) in the booklet are: "Building a…

Running MONET and SALT with Remote Telescope Markup Language 3.0

NASA Astrophysics Data System (ADS)

Hessman, F. V.; Romero, E.

2003-05-01

Complex robotic and service observations in heterogenous networks of telescopes require a common telescopic lingua franca for the description and transport of observing requests and results. Building upon the experience gained within the Hands-On Universe (HOU) and advanced amateur communities with Remote Telescope Markup Language (RTML) Version 2.1 (http://sunra.lbl.gov/rtml), we have implemented a revised RTML syntax (Version 3.0) which is fully capable of - running the two 1.2m MONET robotic telescopes for a very inhomogeneous clientel from 3 research institutions and high school classes all over the world; - connecting MONET to the HOU telescope network; - connecting MONET as a trigger to the 11m SALT telescope; - providing all the objects needed to perform and document internet-based user support, ranging all the way from proposal submission and time-allocation to observation reports.

Sensor fusion V; Proceedings of the Meeting, Boston, MA, Nov. 15-17, 1992

NASA Technical Reports Server (NTRS)

Schenker, Paul S. (Editor)

1992-01-01

Topics addressed include 3D object perception, human-machine interface in multisensor systems, sensor fusion architecture, fusion of multiple and distributed sensors, interface and decision models for sensor fusion, computational networks, simple sensing for complex action, multisensor-based control, and metrology and calibration of multisensor systems. Particular attention is given to controlling 3D objects by sketching 2D views, the graphical simulation and animation environment for flexible structure robots, designing robotic systems from sensorimotor modules, cylindrical object reconstruction from a sequence of images, an accurate estimation of surface properties by integrating information using Bayesian networks, an adaptive fusion model for a distributed detection system, multiple concurrent object descriptions in support of autonomous navigation, robot control with multiple sensors and heuristic knowledge, and optical array detectors for image sensors calibration. (No individual items are abstracted in this volume)

A Look Inside HIV Resistance through Retroviral Protease Interaction Maps

PubMed Central

Kontijevskis, Aleksejs; Prusis, Peteris; Petrovska, Ramona; Yahorava, Sviatlana; Mutulis, Felikss; Mutule, Ilze; Komorowski, Jan; Wikberg, Jarl E. S

2007-01-01

Retroviruses affect a large number of species, from fish and birds to mammals and humans, with global socioeconomic negative impacts. Here the authors report and experimentally validate a novel approach for the analysis of the molecular networks that are involved in the recognition of substrates by retroviral proteases. Using multivariate analysis of the sequence-based physiochemical descriptions of 61 retroviral proteases comprising wild-type proteases, natural mutants, and drug-resistant forms of proteases from nine different viral species in relation to their ability to cleave 299 substrates, the authors mapped the physicochemical properties and cross-dependencies of the amino acids of the proteases and their substrates, which revealed a complex molecular interaction network of substrate recognition and cleavage. The approach allowed a detailed analysis of the molecular–chemical mechanisms involved in substrate cleavage by retroviral proteases. PMID:17352531

Ethics in actor networks, or: what Latour could learn from Darwin and Dewey.

PubMed

Waelbers, Katinka; Dorstewitz, Philipp

2014-03-01

In contemporary Science, Technology and Society (STS) studies, Bruno Latour's Actor Network Theory (ANT) is often used to study how social change arises from interaction between people and technologies. Though Latour's approach is rich in the sense of enabling scholars to appreciate the complexity of many relevant technological, environmental, and social factors in their studies, the approach is poor from an ethical point of view: the doings of things and people are couched in one and the same behaviorist (third person) vocabulary without giving due recognition to the ethical relevance of human intelligence, sympathy and reflection in making responsible choices. This article argues that two other naturalist projects, the non-teleological virtue ethics of Charles Darwin and the pragmatist instrumentalism of John Dewey can enrich ANT-based STS studies, both, in a descriptive and in a normative sense.

Topological evolution of the internet public opinion

NASA Astrophysics Data System (ADS)

Lian, Ying; Dong, Xuefan; Liu, Yijun

2017-11-01

The Internet forms a platform featured with high liquidity, accessibility and concealment for the public to express their respective views on certain events, thus leading to a large network graph. Due to such environmental features, the public opinions formed on the Internet are different from those on traditional media. Studies focusing on the former area are relatively fewer. In addition, the majority of existing methods proposed for constructing the Internet public opinion topological structure are based on the classic BA model, thus resulting in drawbacks in the range of simplicity and a lack of strict deduction. Therefore, based on the complex networks theory, a model applied to describe the topology of the Internet public opinion is deduced with rigorous derivation in the present paper. Results show that the proposed expression could well reflect the degree distribution of Internet public opinion which follows an analogous power law distribution, and that the peak value and the degree distribution are not correlative to each other. Moreover, it has been also proved that compared to the classic BA model, the proposed model has better accuracy performance in the description of the degree distribution of the Internet public opinion, which contributes to future studies focusing on this area. Thus, an attempt has been made to give the first theoretical description of the Internet public opinion topology in the present paper. In addition, it is also the first paper focusing on the solution of networks degree distribution with an exponential growth form.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sun, Amy Cha-Tien; Downes, Paula Sue; Heinen, Russell

Analysis of chemical supply chains is an inherently complex task, given the dependence of these supply chains on multiple infrastructure systems (e.g., the petroleum sector, transportation, etc.). This effort requires data and information at various levels of resolution, ranging from network-level distribution systems to individual chemical reactions. Sandia National Laboratories (Sandia) has integrated its existing simulation and infrastructure analysis capabilities with chemical data models to analyze the chemical supply chains of several nationally critical chemical commodities. This paper describes how Sandia models the ethylene supply chain; that is, the supply chain for the most widely used raw material for plasticsmore » production including a description of the types of data and modeling capabilities that are required to represent the ethylene supply chain. The paper concludes with a description of Sandia's use the model to project how the supply chain would be affected by and adapt to a disruptive scenario hurricane.« less

Synchronization in node of complex networks consist of complex chaotic system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wei, Qiang, E-mail: qiangweibeihua@163.com; Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin; Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024

2014-07-15

A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.

Meta-connectomics: human brain network and connectivity meta-analyses.

PubMed

Crossley, N A; Fox, P T; Bullmore, E T

2016-04-01

Abnormal brain connectivity or network dysfunction has been suggested as a paradigm to understand several psychiatric disorders. We here review the use of novel meta-analytic approaches in neuroscience that go beyond a summary description of existing results by applying network analysis methods to previously published studies and/or publicly accessible databases. We define this strategy of combining connectivity with other brain characteristics as 'meta-connectomics'. For example, we show how network analysis of task-based neuroimaging studies has been used to infer functional co-activation from primary data on regional activations. This approach has been able to relate cognition to functional network topology, demonstrating that the brain is composed of cognitively specialized functional subnetworks or modules, linked by a rich club of cognitively generalized regions that mediate many inter-modular connections. Another major application of meta-connectomics has been efforts to link meta-analytic maps of disorder-related abnormalities or MRI 'lesions' to the complex topology of the normative connectome. This work has highlighted the general importance of network hubs as hotspots for concentration of cortical grey-matter deficits in schizophrenia, Alzheimer's disease and other disorders. Finally, we show how by incorporating cellular and transcriptional data on individual nodes with network models of the connectome, studies have begun to elucidate the microscopic mechanisms underpinning the macroscopic organization of whole-brain networks. We argue that meta-connectomics is an exciting field, providing robust and integrative insights into brain organization that will likely play an important future role in consolidating network models of psychiatric disorders.

On Complex Networks Representation and Computation of Hydrologycal Quantities

NASA Astrophysics Data System (ADS)

Serafin, F.; Bancheri, M.; David, O.; Rigon, R.

2017-12-01

Water is our blue gold. Despite results of discovery-based science keep warning public opinion about the looming worldwide water crisis, water is still treated as a not worth taking resource. Could a different multi-scale perspective affect environmental decision-making more deeply? Can also a further pairing to a new graphical representation of processes interaction sway decision-making more effectively and public opinion consequently?This abstract introduces a complex networks driven way to represent catchments eco-hydrology and related flexible informatics to manage it. The representation is built upon mathematical category. A category is an algebraic structure that comprises "objects" linked by "arrows". It is an evolution of Petri Nets said Time Continuous Petri Nets (TCPN). It aims to display (water) budgets processes and catchment interactions using explicative and self-contained symbolism. The result improves readability of physical processes compared to current descriptions. The IT perspective hinges on the Object Modeling System (OMS) v3. The latter is a non-invasive flexible environmental modeling framework designed to support component-based model development. The implementation of a Directed Acyclic Graph (DAG) data structure, named Net3, has recently enhanced its flexibility. Net3 represents interacting systems as complex networks: vertices match up with any sort of time evolving quantity; edges correspond to their data (fluxes) interchange. It currently hosts JGrass-NewAge components, and those implementing travel time analysis of fluxes. Further bio-physical or management oriented components can be easily added.This talk introduces both graphical representation and related informatics exercising actual applications and examples.

A structural and theoretical study of the alkylammonium nitrates forefather: Liquid methylammonium nitrate

NASA Astrophysics Data System (ADS)

Gontrani, Lorenzo; Caminiti, Ruggero; Salma, Umme; Campetella, Marco

2017-09-01

We present here a structural and vibrational analysis of melted methylammonium nitrate, the simplest compound of the family of alkylammonium nitrates. The static and dynamical features calculated were endorsed by comparing the experimental X-ray data with the theoretical ones. A reliable description cannot be obtained with classical molecular dynamics owing to polarization effects. Contrariwise, the structure factor and the vibrational frequencies obtained from ab initio molecular dynamics trajectories are in very good agreement with the experiment. A careful analysis has provided additional information on the complex hydrogen bonding network that exists in this liquid.

Principles and Policies for International Coordination of Research Data Networks

NASA Astrophysics Data System (ADS)

Parsons, M. A.; Mokrane, M.; Sorvari, S.; Treloar, A.; Smith, C.

2017-12-01

International data networks enable the sharing of data within and between scientific disciplines and countries and thus provide the foundation for Open Science. Developing effective and sustainable international research data networks is critical for progress in many areas of research and for science to address complex global societal challenges. However, the development and maintenance of effective networks is not always easy, particularly in a context where public resources for science are limited and international cooperation is not a priority for many countries. The global landscape for data sharing in science is complex; many international data networks already exist and have highly variable structures. Some are linked to large intergovernmental research infrastructures, have highly developed centralized services and deal mainly with the data needs of single disciplines. Some are highly distributed, have much less rigid governance structures and provide access to data from many different domains. Most are somewhere between these two extremes and they cover different geographic regions, from regional to global. All provide a mix of data and associated data services which meets the needs of the research community to various extents and this provision depends on a mix of hardware, software, standards and protocols and human skills. These come together, working across national boundaries, in technical and social networks. In all of this, what makes a network function effectively or not is unclear. This means that there is also no simple answer to what can usefully be done at the policy level to promote the development of effective and sustainable data networks. Hence the rational for the present project - to study a variety of currently successful networks, explore the challenges that they are facing and the lessons that can be learned from confronting these challenges, and, where applicable, to translate this analysis into potential policy actions. Detailed descriptive, operational and reflective information was collected on a total of 31 international data networks including several in the geosciences domain. This presentation will summarize the lessons learned and overall conclusions and recommendations from the project.

Rights and duties policy implementation in Chile: health-care professionals' perceptions.

PubMed

Barrera, Constanza R; Negrón, Camila P; Barría, R Mauricio; Méndez, Claudio A

2016-10-01

To explore the perceptions of health professionals in an integrated network of public provision of health services regarding the implementation of the Law on Rights and Duties of People in Chile. Qualitative descriptive study. A stratified qualitative sample of 53 professionals from five low complexity centres and one from a high complexity centre, all part of the integrated network of health services in Valdivia, Los Rios Region, Chile, were selected according to the criteria of an overall saturation of the explored dimensions. The information was gathered through a semi-structured, in-depth interview carried out after signing the informed consent. Data were analysed using an inductive approach of content analysis. Three categories emerged from the interviews: conceptualization and knowledge, factors influencing the implementation and recommendations for strengthening the implementation, and seven subcategories. It was highlighted that health professionals in the health-care network perceived difficulties in implementing the Law on rights and duties of patients. Among them were the lack of knowledge about the Law, poor exposure and a lack of resources for its implementation. They suggested adapting the infrastructure of the institution and offering training as recommendations to improve the implementation of the Law. There are hindering factors for the implementation of the Law related to organizational and professional gaps in the institutions providing health care. © 2015 The Authors. Health Expectations. Published by John Wiley & Sons Ltd.

Seamless Tracing of Human Behavior Using Complementary Wearable and House-Embedded Sensors

PubMed Central

Augustyniak, Piotr; Smoleń, Magdalena; Mikrut, Zbigniew; Kańtoch, Eliasz

2014-01-01

This paper presents a multimodal system for seamless surveillance of elderly people in their living environment. The system uses simultaneously a wearable sensor network for each individual and premise-embedded sensors specific for each environment. The paper demonstrates the benefits of using complementary information from two types of mobility sensors: visual flow-based image analysis and an accelerometer-based wearable network. The paper provides results for indoor recognition of several elementary poses and outdoor recognition of complex movements. Instead of complete system description, particular attention was drawn to a polar histogram-based method of visual pose recognition, complementary use and synchronization of the data from wearable and premise-embedded networks and an automatic danger detection algorithm driven by two premise- and subject-related databases. The novelty of our approach also consists in feeding the databases with real-life recordings from the subject, and in using the dynamic time-warping algorithm for measurements of distance between actions represented as elementary poses in behavioral records. The main results of testing our method include: 95.5% accuracy of elementary pose recognition by the video system, 96.7% accuracy of elementary pose recognition by the accelerometer-based system, 98.9% accuracy of elementary pose recognition by the combined accelerometer and video-based system, and 80% accuracy of complex outdoor activity recognition by the accelerometer-based wearable system. PMID:24787640

Structure and dynamics of molecular networks: A novel paradigm of drug discovery: A comprehensive review

PubMed Central

Csermely, Peter; Korcsmáros, Tamás; Kiss, Huba J.M.; London, Gábor; Nussinov, Ruth

2013-01-01

Despite considerable progress in genome- and proteome-based high-throughput screening methods and in rational drug design, the increase in approved drugs in the past decade did not match the increase of drug development costs. Network description and analysis not only gives a systems-level understanding of drug action and disease complexity, but can also help to improve the efficiency of drug design. We give a comprehensive assessment of the analytical tools of network topology and dynamics. The state-of-the-art use of chemical similarity, protein structure, protein-protein interaction, signaling, genetic interaction and metabolic networks in the discovery of drug targets is summarized. We propose that network targeting follows two basic strategies. The “central hit strategy” selectively targets central node/edges of the flexible networks of infectious agents or cancer cells to kill them. The “network influence strategy” works against other diseases, where an efficient reconfiguration of rigid networks needs to be achieved. It is shown how network techniques can help in the identification of single-target, edgetic, multi-target and allo-network drug target candidates. We review the recent boom in network methods helping hit identification, lead selection optimizing drug efficacy, as well as minimizing side-effects and drug toxicity. Successful network-based drug development strategies are shown through the examples of infections, cancer, metabolic diseases, neurodegenerative diseases and aging. Summarizing >1200 references we suggest an optimized protocol of network-aided drug development, and provide a list of systems-level hallmarks of drug quality. Finally, we highlight network-related drug development trends helping to achieve these hallmarks by a cohesive, global approach. PMID:23384594

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: The Fractal Dimensions of Complex Networks

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, XU

2009-08-01

It is shown that many real complex networks share distinctive features, such as the small-world effect and the heterogeneous property of connectivity of vertices, which are different from random networks and regular lattices. Although these features capture the important characteristics of complex networks, their applicability depends on the style of networks. To unravel the universal characteristics many complex networks have in common, we study the fractal dimensions of complex networks using the method introduced by Shanker. We find that the average 'density' (ρ(r)) of complex networks follows a better power-law function as a function of distance r with the exponent df, which is defined as the fractal dimension, in some real complex networks. Furthermore, we study the relation between df and the shortcuts Nadd in small-world networks and the size N in regular lattices. Our present work provides a new perspective to understand the dependence of the fractal dimension df on the complex network structure.

Earth and environmental science in the 1980's: Part 1: Environmental data systems, supercomputer facilities and networks

NASA Technical Reports Server (NTRS)

1986-01-01

Overview descriptions of on-line environmental data systems, supercomputer facilities, and networks are presented. Each description addresses the concepts of content, capability, and user access relevant to the point of view of potential utilization by the Earth and environmental science community. The information on similar systems or facilities is presented in parallel fashion to encourage and facilitate intercomparison. In addition, summary sheets are given for each description, and a summary table precedes each section.

Mapping and discrimination of networks in the complexity-entropy plane

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here we explore the possibility to classify complex networks by means of a statistical complexity measure that has formerly been successfully applied to distinguish different types of chaotic and stochastic time series. It is composed of a network's averaged per-node entropic measure characterizing the network's information content and the associated Jenson-Shannon divergence as a measure of disequilibrium. We study 29 real-world networks and show that networks of the same category tend to cluster in distinct areas of the resulting complexity-entropy plane. We demonstrate that within our framework, connectome networks exhibit among the highest complexity while, e.g., transportation and infrastructure networks display significantly lower values. Furthermore, we demonstrate the utility of our framework by applying it to families of random scale-free and Watts-Strogatz model networks. We then show in a second application that the proposed framework is useful to objectively construct threshold-based networks, such as functional climate networks or recurrence networks, by choosing the threshold such that the statistical network complexity is maximized.

Using Social Network Analysis to Investigate Positive EOL Communication.

PubMed

Xu, Jiayun; Yang, Rumei; Wilson, Andrew; Reblin, Maija; Clayton, Margaret F; Ellington, Lee

2018-04-30

End of life (EOL) communication is a complex process involving the whole family and multiple care providers. Applications of analysis techniques that account for communication beyond the patient and patient/provider, will improve clinical understanding of EOL communication. To introduce the use of social network analysis to EOL communication data, and to provide an example of applying social network analysis to home hospice interactions. We provide a description of social network analysis using social network analysis to model communication patterns during home hospice nursing visits. We describe three social network attributes (i.e. magnitude, directionality, and reciprocity) in the expression of positive emotion among hospice nurses, family caregivers, and hospice cancer patients. Differences in communication structure by primary family caregiver gender and across time were also examined. Magnitude (frequency) in the expression of positive emotion occurred most often between nurses and caregivers or nurses and patients. Female caregivers directed more positive emotion to nurses, and nurses directed more positive emotion to other family caregivers when the primary family caregiver was male. Reciprocity (mutuality) in positive emotion declined towards day of death, but increased on day of actual patient death. There was variation in reciprocity by the type of positive emotion expressed. Our example demonstrates that social network analysis can be used to better understand the process of EOL communication. Social network analysis can be expanded to other areas of EOL research, such as EOL decision-making and health care teamwork. Copyright © 2018. Published by Elsevier Inc.

Using neural networks for prediction of air pollution index in industrial city

NASA Astrophysics Data System (ADS)

Rahman, P. A.; Panchenko, A. A.; Safarov, A. M.

2017-10-01

This scientific paper is dedicated to the use of artificial neural networks for the ecological prediction of state of the atmospheric air of an industrial city for capability of the operative environmental decisions. In the paper, there is also the described development of two types of prediction models for determining of the air pollution index on the basis of neural networks: a temporal (short-term forecast of the pollutants content in the air for the nearest days) and a spatial (forecast of atmospheric pollution index in any point of city). The stages of development of the neural network models are briefly overviewed and description of their parameters is also given. The assessment of the adequacy of the prediction models, based on the calculation of the correlation coefficient between the output and reference data, is also provided. Moreover, due to the complexity of perception of the «neural network code» of the offered models by the ordinary users, the software implementations allowing practical usage of neural network models are also offered. It is established that the obtained neural network models provide sufficient reliable forecast, which means that they are an effective tool for analyzing and predicting the behavior of dynamics of the air pollution in an industrial city. Thus, this scientific work successfully develops the urgent matter of forecasting of the atmospheric air pollution index in industrial cities based on the use of neural network models.

Insensitive dependence of delay-induced oscillation death on complex networks

NASA Astrophysics Data System (ADS)

Zou, Wei; Zheng, Xing; Zhan, Meng

2011-06-01

Oscillation death (also called amplitude death), a phenomenon of coupling induced stabilization of an unstable equilibrium, is studied for an arbitrary symmetric complex network with delay-coupled oscillators, and the critical conditions for its linear stability are explicitly obtained. All cases including one oscillator, a pair of oscillators, regular oscillator networks, and complex oscillator networks with delay feedback coupling, can be treated in a unified form. For an arbitrary symmetric network, we find that the corresponding smallest eigenvalue of the Laplacian λN (0 >λN ≥ -1) completely determines the death island, and as λN is located within the insensitive parameter region for nearly all complex networks, the death island keeps nearly the largest and does not sensitively depend on the complex network structures. This insensitivity effect has been tested for many typical complex networks including Watts-Strogatz (WS) and Newman-Watts (NW) small world networks, general scale-free (SF) networks, Erdos-Renyi (ER) random networks, geographical networks, and networks with community structures and is expected to be helpful for our understanding of dynamics on complex networks.

Equation-oriented specification of neural models for simulations

PubMed Central

Stimberg, Marcel; Goodman, Dan F. M.; Benichoux, Victor; Brette, Romain

2013-01-01

Simulating biological neuronal networks is a core method of research in computational neuroscience. A full specification of such a network model includes a description of the dynamics and state changes of neurons and synapses, as well as the synaptic connectivity patterns and the initial values of all parameters. A standard approach in neuronal modeling software is to build network models based on a library of pre-defined components and mechanisms; if a model component does not yet exist, it has to be defined in a special-purpose or general low-level language and potentially be compiled and linked with the simulator. Here we propose an alternative approach that allows flexible definition of models by writing textual descriptions based on mathematical notation. We demonstrate that this approach allows the definition of a wide range of models with minimal syntax. Furthermore, such explicit model descriptions allow the generation of executable code for various target languages and devices, since the description is not tied to an implementation. Finally, this approach also has advantages for readability and reproducibility, because the model description is fully explicit, and because it can be automatically parsed and transformed into formatted descriptions. The presented approach has been implemented in the Brian2 simulator. PMID:24550820

Large-Scale Modeling of Epileptic Seizures: Scaling Properties of Two Parallel Neuronal Network Simulation Algorithms

DOE PAGES

Pesce, Lorenzo L.; Lee, Hyong C.; Hereld, Mark; ...

2013-01-01

Our limited understanding of the relationship between the behavior of individual neurons and large neuronal networks is an important limitation in current epilepsy research and may be one of the main causes of our inadequate ability to treat it. Addressing this problem directly via experiments is impossibly complex; thus, we have been developing and studying medium-large-scale simulations of detailed neuronal networks to guide us. Flexibility in the connection schemas and a complete description of the cortical tissue seem necessary for this purpose. In this paper we examine some of the basic issues encountered in these multiscale simulations. We have determinedmore » the detailed behavior of two such simulators on parallel computer systems. The observed memory and computation-time scaling behavior for a distributed memory implementation were very good over the range studied, both in terms of network sizes (2,000 to 400,000 neurons) and processor pool sizes (1 to 256 processors). Our simulations required between a few megabytes and about 150 gigabytes of RAM and lasted between a few minutes and about a week, well within the capability of most multinode clusters. Therefore, simulations of epileptic seizures on networks with millions of cells should be feasible on current supercomputers.« less

[The regionalized healthcare network in Santa Catarina State, Brazil, from 2011 to 2015: governance system and oral healthcare].

PubMed

Godoi, Heloisa; Andrade, Selma Regina de; Mello, Ana Lúcia Schaefer Ferreira de

2017-09-28

: The objective was to describe the governance system used in structuring the regionalized healthcare network in Santa Catarina State, Brazil, based on the Bipartite Inter-Managerial Commission (CIB), with a focus on structuring of oral healthcare. This was a qualitative, exploratory-descriptive documental study, based on the foundations of governance as an analytical tool through identification of the dimensions actors, norms, nodal points, and processes. Secondary data were collected from the minutes of CIB meetings held from January 2011 to December 2015. The analysis shows weaknesses in CIB governance in Santa Catarina in relation to regionalized structuring of oral healthcare from a network perspective. Structuring of oral healthcare occurs in parallel to that of other thematic networks in the state and shows the expansion of dental services, especially those with medium complexity, as an effect of the prevailing governance process. The relations established between administrators and decision-making processes allowed recognizing this network's "prescription", since there is little negotiation and local demand, limited more to following recommendations and incentives from the federal/state sphere, intermediated by staff from the State Health Secretariat. Thus, setting a policy agenda for oral healthcare for the population of Santa Catarina is weakened, with a peripheral position in relation to other health programs.

Power prediction in mobile communication systems using an optimal neural-network structure.

PubMed

Gao, X M; Gao, X Z; Tanskanen, J A; Ovaska, S J

1997-01-01

Presents a novel neural-network-based predictor for received power level prediction in direct sequence code division multiple access (DS/CDMA) systems. The predictor consists of an adaptive linear element (Adaline) followed by a multilayer perceptron (MLP). An important but difficult problem in designing such a cascade predictor is to determine the complexity of the networks. We solve this problem by using the predictive minimum description length (PMDL) principle to select the optimal numbers of input and hidden nodes. This approach results in a predictor with both good noise attenuation and excellent generalization capability. The optimized neural networks are used for predictive filtering of very noisy Rayleigh fading signals with 1.8 GHz carrier frequency. Our results show that the optimal neural predictor can provide smoothed in-phase and quadrature signals with signal-to-noise ratio (SNR) gains of about 12 and 7 dB at the urban mobile speeds of 5 and 50 km/h, respectively. The corresponding power signal SNR gains are about 11 and 5 dB. Therefore, the neural predictor is well suitable for power control applications where ldquodelaylessrdquo noise attenuation and efficient reduction of fast fading are required.

The National Wind Erosion Research Network: Building a standardized long-term data resource for aeolian research, modeling and land management

USGS Publications Warehouse

Webb, Nicholas P.; Herrick, Jeffrey E.; Van Zee, Justin W; Courtright, Ericha M; Hugenholtz, Ted M; Zobeck, Ted M; Okin, Gregory S.; Barchyn, Thomas E; Billings, Benjamin J; Boyd, Robert A.; Clingan, Scott D; Cooper, Brad F; Duniway, Michael C.; Derner, Justin D.; Fox, Fred A; Havstad, Kris M.; Heilman, Philip; LaPlante, Valerie; Ludwig, Noel A; Metz, Loretta J; Nearing, Mark A; Norfleet, M Lee; Pierson, Frederick B; Sanderson, Matt A; Sharrat, Brenton S; Steiner, Jean L; Tatarko, John; Tedela, Negussie H; Todelo, David; Unnasch, Robert S; Van Pelt, R Scott; Wagner, Larry

2016-01-01

The National Wind Erosion Research Network was established in 2014 as a collaborative effort led by the United States Department of Agriculture’s Agricultural Research Service and Natural Resources Conservation Service, and the United States Department of the Interior’s Bureau of Land Management, to address the need for a long-term research program to meet critical challenges in wind erosion research and management in the United States. The Network has three aims: (1) provide data to support understanding of basic aeolian processes across land use types, land cover types, and management practices, (2) support development and application of models to assess wind erosion and dust emission and their impacts on human and environmental systems, and (3) encourage collaboration among the aeolian research community and resource managers for the transfer of wind erosion technologies. The Network currently consists of thirteen intensively instrumented sites providing measurements of aeolian sediment transport rates, meteorological conditions, and soil and vegetation properties that influence wind erosion. Network sites are located across rangelands, croplands, and deserts of the western US. In support of Network activities, http://winderosionnetwork.org was developed as a portal for information about the Network, providing site descriptions, measurement protocols, and data visualization tools to facilitate collaboration with scientists and managers interested in the Network and accessing Network products. The Network provides a mechanism for engaging national and international partners in a wind erosion research program that addresses the need for improved understanding and prediction of aeolian processes across complex and diverse land use types and management practices.

Firing rate dynamics in recurrent spiking neural networks with intrinsic and network heterogeneity.

PubMed

Ly, Cheng

2015-12-01

Heterogeneity of neural attributes has recently gained a lot of attention and is increasing recognized as a crucial feature in neural processing. Despite its importance, this physiological feature has traditionally been neglected in theoretical studies of cortical neural networks. Thus, there is still a lot unknown about the consequences of cellular and circuit heterogeneity in spiking neural networks. In particular, combining network or synaptic heterogeneity and intrinsic heterogeneity has yet to be considered systematically despite the fact that both are known to exist and likely have significant roles in neural network dynamics. In a canonical recurrent spiking neural network model, we study how these two forms of heterogeneity lead to different distributions of excitatory firing rates. To analytically characterize how these types of heterogeneities affect the network, we employ a dimension reduction method that relies on a combination of Monte Carlo simulations and probability density function equations. We find that the relationship between intrinsic and network heterogeneity has a strong effect on the overall level of heterogeneity of the firing rates. Specifically, this relationship can lead to amplification or attenuation of firing rate heterogeneity, and these effects depend on whether the recurrent network is firing asynchronously or rhythmically firing. These observations are captured with the aforementioned reduction method, and furthermore simpler analytic descriptions based on this dimension reduction method are developed. The final analytic descriptions provide compact and descriptive formulas for how the relationship between intrinsic and network heterogeneity determines the firing rate heterogeneity dynamics in various settings.

Design of an ontology for medical image manipulation: an example applied for DICOM extensions

NASA Astrophysics Data System (ADS)

Aubry, Florent; Chameroy, Virginie; Todd-Pokropek, Andrew; Di Paola, Robert

1999-07-01

Currently, various data formats are widely used for medical imags, e.g. DICOM for exchange through network and storage media, and INTERFILE for image exchange in nuclear medicine. These formats are only able partly to solve problems arising in accessing and handling imags. To solve such problems, an ontology dedicated to the description of data and knowledge involved in the handling and the management of medical images has been designed. The ontology offers a semantic frame of reference to which manipulation tools can refer. It considers various point of view on the data, related to the context of production, the content,and the data quality. It supports several levels of abstraction, going from a declarative level related to the examination type to the implementation level. Moreover, the ontology provides mechanisms allowing the creation and the description of new entities. It can, thus, act as an intermediate language ensuring accurate reuse of the entities. This paper, which presents work in progress, is focused on the description of the ontology and points out how to use it for the description of and the access to DICOM or INTERFILE entities, and for the extension of the DICOM or INTERFILE dictionaries, by adding new entities, in order to describe complex relationships between images.

Sampling from complex networks using distributed learning automata

NASA Astrophysics Data System (ADS)

Rezvanian, Alireza; Rahmati, Mohammad; Meybodi, Mohammad Reza

2014-02-01

A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly social networks. Recently, major studies are reported for the characterization of social networks due to a growing trend in analysis of online social networks as dynamic complex large-scale graphs. Due to the large scale and limited access of real networks, the network model is characterized using an appropriate part of a network by sampling approaches. In this paper, a new sampling algorithm based on distributed learning automata has been proposed for sampling from complex networks. In the proposed algorithm, a set of distributed learning automata cooperate with each other in order to take appropriate samples from the given network. To investigate the performance of the proposed algorithm, several simulation experiments are conducted on well-known complex networks. Experimental results are compared with several sampling methods in terms of different measures. The experimental results demonstrate the superiority of the proposed algorithm over the others.

Rheology of multiphase polymer systems using novel "melt rigidity" evaluation approach

NASA Astrophysics Data System (ADS)

Kracalik, Milan

2015-04-01

Multiphase polymer systems like blends, composites and nanocomposites exhibit complex rheological behaviour due to physical and also possibly chemical interactions between individual phases. Up to now, rheology of heterogeneous polymer systems has been usually described by evaluation of viscosity curve (shear thinning phenomenon), storage modulus curve (formation of secondary plateau) or plotting information about damping behaviour (e.g. Van Gurp-Palmen-plot). On the contrary to evaluation of damping behaviour, "melt rigidity" approach has been introduced for description of physical network of rigid particles in polymer matrix as relation of ∫G'/∫G" over specific frequency range. This approach has been experimentally proved for polymer nanocomposites in order to compare shear flow characteristics with elongational flow field. In this contribution, LDPE-clay nanocomposites with different dispersion grades (physical networks) have been prepared and characterized by both conventional as well as novel "melt rigidity" approach.

An Approach to Automated Fusion System Design and Adaptation

PubMed Central

Fritze, Alexander; Mönks, Uwe; Holst, Christoph-Alexander; Lohweg, Volker

2017-01-01

Industrial applications are in transition towards modular and flexible architectures that are capable of self-configuration and -optimisation. This is due to the demand of mass customisation and the increasing complexity of industrial systems. The conversion to modular systems is related to challenges in all disciplines. Consequently, diverse tasks such as information processing, extensive networking, or system monitoring using sensor and information fusion systems need to be reconsidered. The focus of this contribution is on distributed sensor and information fusion systems for system monitoring, which must reflect the increasing flexibility of fusion systems. This contribution thus proposes an approach, which relies on a network of self-descriptive intelligent sensor nodes, for the automatic design and update of sensor and information fusion systems. This article encompasses the fusion system configuration and adaptation as well as communication aspects. Manual interaction with the flexibly changing system is reduced to a minimum. PMID:28300762

An Approach to Automated Fusion System Design and Adaptation.

PubMed

Fritze, Alexander; Mönks, Uwe; Holst, Christoph-Alexander; Lohweg, Volker

2017-03-16

Industrial applications are in transition towards modular and flexible architectures that are capable of self-configuration and -optimisation. This is due to the demand of mass customisation and the increasing complexity of industrial systems. The conversion to modular systems is related to challenges in all disciplines. Consequently, diverse tasks such as information processing, extensive networking, or system monitoring using sensor and information fusion systems need to be reconsidered. The focus of this contribution is on distributed sensor and information fusion systems for system monitoring, which must reflect the increasing flexibility of fusion systems. This contribution thus proposes an approach, which relies on a network of self-descriptive intelligent sensor nodes, for the automatic design and update of sensor and information fusion systems. This article encompasses the fusion system configuration and adaptation as well as communication aspects. Manual interaction with the flexibly changing system is reduced to a minimum.

A symbolic/subsymbolic interface protocol for cognitive modeling

PubMed Central

Simen, Patrick; Polk, Thad

2009-01-01

Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential for understanding cognition under all but the most extreme viewpoints (namely, that cognition consists exclusively of digitally implemented rules; or instead, involves no rules whatsoever). Making this mapping reduces to specifying an interface between symbolic and subsymbolic descriptions of brain activity. To that end, we propose parameterization techniques for building cognitive models as programmable, structured, recurrent neural networks. Feedback strength in these models determines whether their components implement classically subsymbolic neural network functions (e.g., pattern recognition), or instead, logical rules and digital memory. These techniques support the implementation of limited production systems. Though inherently sequential and symbolic, these neural production systems can exploit principles of parallel, analog processing from decision-making models in psychology and neuroscience to explain the effects of brain damage on problem solving behavior. PMID:20711520

Adiabatic coarse-graining and simulations of stochastic biochemical networks

PubMed Central

Sinitsyn, N. A.; Hengartner, Nicolas; Nemenman, Ilya

2009-01-01

We propose a universal approach for analysis and fast simulations of stiff stochastic biochemical networks, which rests on elimination of fast chemical species without a loss of information about mesoscopic, non-Poissonian fluctuations of the slow ones. Our approach is similar to the Born–Oppenheimer approximation in quantum mechanics and follows from the stochastic path integral representation of the cumulant generating function of reaction events. In applications with a small number of chemical reactions, it produces analytical expressions for cumulants of chemical fluxes between the slow variables. This allows for a low-dimensional, interpretable representation and can be used for high-accuracy, low-complexity coarse-grained numerical simulations. As an example, we derive the coarse-grained description for a chain of biochemical reactions and show that the coarse-grained and the microscopic simulations agree, but the former is 3 orders of magnitude faster. PMID:19525397

Hardware-software complex of informing passengers of forecasted route transport arrival at stop

NASA Astrophysics Data System (ADS)

Pogrebnoy, V. Yu; Pushkarev, M. I.; Fadeev, A. S.

2017-02-01

The paper presents the hardware-software complex of informing the passengers of the forecasted route transport arrival. A client-server architecture of the forecasting information system is represented and an electronic information board prototype is described. The scheme of information transfer and processing, starting with receiving navigating telemetric data from a transport vehicle and up to the time of passenger public transport arrival at the stop, as well as representation of the information on the electronic board is illustrated and described. Methods and algorithms of determination of the transport vehicle current location in the city route network are considered in detail. The description of the proposed forecasting model of transport vehicle arrival time at the stop is given. The obtained result is applied in Tomsk for forecasting and displaying the arrival time information at the stops.

A Markovian event-based framework for stochastic spiking neural networks.

PubMed

Touboul, Jonathan D; Faugeras, Olivier D

2011-11-01

In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks.

Learning in Structured Connectionist Networks

DTIC Science & Technology

1988-04-01

the structure is too rigid and learning too difficult for cognitive modeling. Two algorithms for learning simple, feature-based concept descriptions...and learning too difficult for cognitive model- ing. Two algorithms for learning simple, feature-based concept descriptions were also implemented. The...Term Goals Recent progress in connectionist research has been encouraging; networks have success- fully modeled human performance for various cognitive

Effects of patch quality and network structure on patch occupancy dynamics of a yellow-bellied marmot metapopulation.

PubMed

Ozgul, Arpat; Armitage, Kenneth B; Blumstein, Daniel T; Vanvuren, Dirk H; Oli, Madan K

2006-01-01

1. The presence/absence of a species at a particular site is the simplest form of data that can be collected during ecological field studies. We used 13 years (1990-2002) of survey data to parameterize a stochastic patch occupancy model for a metapopulation of the yellow-bellied marmot in Colorado, and investigated the significance of particular patches and the influence of site quality, network characteristics and regional stochasticity on the metapopulation persistence. 2. Persistence of the yellow-bellied marmot metapopulation was strongly dependent on the high quality colony sites, and persistence probability was highly sensitive to small changes in the quality of these sites. 3. A relatively small number of colony sites was ultimately responsible for the regional persistence. However, lower quality satellite sites also made a significant contribution to long-term metapopulation persistence, especially when regional stochasticity was high. 4. The northern network of the marmot metapopulation was more stable compared to the southern network, and the persistence of the southern network depended heavily on the northern network. 5. Although complex models of metapopulation dynamics may provide a more accurate description of metapopulation dynamics, such models are data-intensive. Our study, one of the very few applications of stochastic patch occupancy models to a mammalian species, suggests that stochastic patch occupancy models can provide important insights into metapopulation dynamics using data that are easy to collect.

Network analysis of Bogotá's Ciclovía Recreativa, a self-organized multisectorial community program to promote physical activity in a middle-income country.

PubMed

Meisel, Jose D; Sarmiento, Olga L; Montes, Felipe; Martinez, Edwin O; Lemoine, Pablo D; Valdivia, Juan A; Brownson, Ross C; Zarama, Roberto

2014-01-01

Conduct a social network analysis of the health and non-health related organizations that participate in Bogotá's Ciclovía Recreativa (Ciclovía). Cross-sectional study. Ciclovía is a multisectoral community-based mass program in which streets are temporarily closed to motorized transport, allowing exclusive access to individuals for leisure activities and physical activity. Twenty-five organizations that participate in the Ciclovía. Seven variables were examined by using network analytic methods: relationship, link attributes (integration, contact, and importance), and node attributes (leadership, years in the program, and the sector of the organization). The network analytic methods were based on a visual descriptive analysis and an exponential random graph model. Analysis shows that the most central organizations in the network were outside of the Health sector and include Sports and Recreation, Government, and Security sectors. The organizations work in clusters formed by organizations of different sectors. Organization importance and structural predictors were positively related to integration, while the number of years working with Ciclovía was negatively associated with integration. Ciclovía is a network whose structure emerged as a self-organized complex system. Ciclovía of Bogotá is an example of a program with public health potential formed by organizations of multiple sectors with Sports and Recreation as the most central.

Hybrid function projective synchronization in complex dynamical networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

User-based representation of time-resolved multimodal public transportation networks.

PubMed

Alessandretti, Laura; Karsai, Márton; Gauvin, Laetitia

2016-07-01

Multimodal transportation systems, with several coexisting services like bus, tram and metro, can be represented as time-resolved multilayer networks where the different transportation modes connecting the same set of nodes are associated with distinct network layers. Their quantitative description became possible recently due to openly accessible datasets describing the geo-localized transportation dynamics of large urban areas. Advancements call for novel analytics, which combines earlier established methods and exploits the inherent complexity of the data. Here, we provide a novel user-based representation of public transportation systems, which combines representations, accounting for the presence of multiple lines and reducing the effect of spatial embeddedness, while considering the total travel time, its variability across the schedule, and taking into account the number of transfers necessary. After the adjustment of earlier techniques to the novel representation framework, we analyse the public transportation systems of several French municipal areas and identify hidden patterns of privileged connections. Furthermore, we study their efficiency as compared to the commuting flow. The proposed representation could help to enhance resilience of local transportation systems to provide better design policies for future developments.

Marketing for health-care organizations: an introduction to network management.

PubMed

Boonekamp, L C

1994-01-01

The introduction of regulated competition in health care in several Western countries confronts health care providing organizations with changing relationships, with their environment and a need for knowledge and skills to analyse and improve their market position. Marketing receives more and more attention, as recent developments in this field of study provide a specific perspective on the relationships between an organization and external and internal parties. In doing so, a basis is offered for network management. A problem is that the existing marketing literature is not entirely appropriate for the specific characteristics of health care. After a description of the developments in marketing and its most recent key concepts, the applicability of these concepts in health-care organizations is discussed. States that for the health-care sector, dominated by complex networks of interorganizational relationships, the strategic marketing vision on relationships can be very useful. At the same time however, the operationalization of these concepts requires special attention and a distinct role of the management of health-care organizations, because of the characteristics of such organizations and the specific type of their service delivery.

User-based representation of time-resolved multimodal public transportation networks

PubMed Central

Alessandretti, Laura; Gauvin, Laetitia

2016-01-01

Multimodal transportation systems, with several coexisting services like bus, tram and metro, can be represented as time-resolved multilayer networks where the different transportation modes connecting the same set of nodes are associated with distinct network layers. Their quantitative description became possible recently due to openly accessible datasets describing the geo-localized transportation dynamics of large urban areas. Advancements call for novel analytics, which combines earlier established methods and exploits the inherent complexity of the data. Here, we provide a novel user-based representation of public transportation systems, which combines representations, accounting for the presence of multiple lines and reducing the effect of spatial embeddedness, while considering the total travel time, its variability across the schedule, and taking into account the number of transfers necessary. After the adjustment of earlier techniques to the novel representation framework, we analyse the public transportation systems of several French municipal areas and identify hidden patterns of privileged connections. Furthermore, we study their efficiency as compared to the commuting flow. The proposed representation could help to enhance resilience of local transportation systems to provide better design policies for future developments. PMID:27493773

World-Wide Standardized Seismograph Network: a data users guide

USGS Publications Warehouse

Peterson, Jon R.; Hutt, Charles R.

2014-01-01

The purpose of this report, which is based on an unpublished draft prepared in the 1970s, is to provide seismologists with the information they may need to use the WWSSN data set as it becomes available in a more easily accessible and convenient format on the Internet. The report includes a description of the WWSSN network, station facilities, operations and instrumentation, a derivation of the instrument transfer functions, tables of transfer functions, a description of calibration techniques, and a description of a method used to determine important instrument constants using recorded calibration data.

Microsecond-Scale MD Simulations of HIV-1 DIS Kissing-Loop Complexes Predict Bulged-In Conformation of the Bulged Bases and Reveal Interesting Differences between Available Variants of the AMBER RNA Force Fields.

PubMed

Havrila, Marek; Zgarbová, Marie; Jurečka, Petr; Banáš, Pavel; Krepl, Miroslav; Otyepka, Michal; Šponer, Jiří

2015-12-10

We report an extensive set of explicit solvent molecular dynamics (MD) simulations (∼25 μs of accumulated simulation time) of the RNA kissing-loop complex of the HIV-1 virus initiation dimerization site. Despite many structural investigations by X-ray, NMR, and MD techniques, the position of the bulged purines of the kissing complex has not been unambiguously resolved. The X-ray structures consistently show bulged-out positions of the unpaired bases, while several NMR studies show bulged-in conformations. The NMR studies are, however, mutually inconsistent regarding the exact orientations of the bases. The earlier simulation studies predicted the bulged-out conformation; however, this finding could have been biased by the short simulation time scales. Our microsecond-long simulations reveal that all unpaired bases of the kissing-loop complex stay preferably in the interior of the kissing-loop complex. The MD results are discussed in the context of the available experimental data and we suggest that both conformations are biochemically relevant. We also show that MD provides a quite satisfactory description of this RNA system, contrasting recent reports of unsatisfactory performance of the RNA force fields for smaller systems such as tetranucleotides and tetraloops. We explain this by the fact that the kissing complex is primarily stabilized by an extensive network of Watson-Crick interactions which are rather well described by the force fields. We tested several different sets of water/ion parameters but they all lead to consistent results. However, we demonstrate that a recently suggested modification of van der Waals interactions of the Cornell et al. force field deteriorates the description of the kissing complex by the loss of key stacking interactions stabilizing the interhelical junction and excessive hydrogen-bonding interactions.

Complex quantum network geometries: Evolution and phase transitions

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

Complex quantum network geometries: Evolution and phase transitions.

PubMed

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

Surface temperature patterns in complex terrain: Daily variations and long-term change in the central Sierra Nevada, California

USGS Publications Warehouse

Lundquist, J.D.; Cayan, D.R.

2007-01-01

A realistic description of how temperatures vary with elevation is crucial for ecosystem studies and for models of basin-scale snowmelt and spring streamflow. This paper explores surface temperature variability using temperature data from an array of 37 sensors, called the Yosemite network, which traverses both slopes of the Sierra Nevada in the vicinity of Yosemite National Park, California. These data indicate that a simple lapse rate is often a poor description of the spatial temperature structure. Rather, the spatial pattern of temperature over the Yosemite network varies considerably with synoptic conditions. Empirical orthogonal functions (EOFs) were used to identify the dominant spatial temperature patterns and how they vary in time. Temporal variations of these surface temperature patterns were correlated with large-scale weather conditions, as described by National Centers for Environmental Prediction-National Center for Atmospheric Research Reanalysis data. Regression equations were used to downscale larger-scale weather parameters, such as Reanalysis winds and pressure, to the surface temperature structure over the Yosemite network. These relationships demonstrate that strong westerly winds are associated with relatively warmer temperatures on the east slope and cooler temperatures on the west slope of the Sierra, and weaker westerly winds are associated with the opposite pattern. Reanalysis data from 1948 to 2005 indicate weakening westerlies over this time period, a trend leading to relatively cooler temperatures on the east slope over decadal timescale's. This trend also appears in long-term observations and demonstrates the need to consider topographic effects when examining long-term changes in mountain regions. Copyright 2007 by the American Geophysical Union.

Thinking on building the network cardiovasology of Chinese medicine.

PubMed

Yu, Gui; Wang, Jie

2012-11-01

With advances in complex network theory, the thinking and methods regarding complex systems have changed revolutionarily. Network biology and network pharmacology were built by applying network-based approaches in biomedical research. The cardiovascular system may be regarded as a complex network, and cardiovascular diseases may be taken as the damage of structure and function of the cardiovascular network. Although Chinese medicine (CM) is effective in treating cardiovascular diseases, its mechanisms are still unclear. With the guidance of complex network theory, network biology and network pharmacology, network-based approaches could be used in the study of CM in preventing and treating cardiovascular diseases. A new discipline-network cardiovasology of CM was, therefore, developed. In this paper, complex network theory, network biology and network pharmacology were introduced and the connotation of "disease-syndrome-formula-herb" was illustrated from the network angle. Network biology could be used to analyze cardiovascular diseases and syndromes and network pharmacology could be used to analyze CM formulas and herbs. The "network-network"-based approaches could provide a new view for elucidating the mechanisms of CM treatment.

Interactive Network Analytical Tool for Instantaneous Bespoke Interrogation of Food Safety Notifications

PubMed Central

Nepusz, Tamás; Petróczi, Andrea; Naughton, Declan P.

2012-01-01

Background The globalization of food supply necessitates continued advances in regulatory control measures to ensure that citizens enjoy safe and adequate nutrition. The aim of this study was to extend previous reports on network analysis relating to food notifications by including an optional filter by type of notification and in cases of contamination, by type of contaminant in the notified foodstuff. Methodology/Principal Findings A filter function has been applied to enable processing of selected notifications by contaminant or type of notification to i) capture complexity, ii) analyze trends, and iii) identify patterns of reporting activities between countries. The program rapidly assesses nations' roles as transgressor and/or detector for each category of contaminant and for the key class of border rejection. In the open access demonstration version, the majority of notifications in the Rapid Alert System for Food and Feed were categorized by contaminant type as mycotoxin (50.4%), heavy metals (10.9%) or bacteria (20.3%). Examples are given demonstrating how network analytical approaches complement, and in some cases supersede, descriptive statistics such as frequency counts, which may give limited or potentially misleading information. One key feature is that network analysis takes the relationship between transgressor and detector countries, along with number of reports and impact simultaneously into consideration. Furhermore, the indices that compliment the network maps and reflect each country's transgressor and detector activities allow comparisons to be made between (transgressing vs. detecting) as well as within (e.g. transgressing) activities. Conclusions/significance This further development of the network analysis approach to food safety contributes to a better understanding of the complexity of the effort ensuring food is safe for consumption in the European Union. The unique patterns of the interplay between detectors and transgressors, instantly revealed by our approach, could supplement the intelligence gathered by regulatory authorities and inform risk based sampling protocols. PMID:22530063

Interactive network analytical tool for instantaneous bespoke interrogation of food safety notifications.

PubMed

Nepusz, Tamás; Petróczi, Andrea; Naughton, Declan P

2012-01-01

The globalization of food supply necessitates continued advances in regulatory control measures to ensure that citizens enjoy safe and adequate nutrition. The aim of this study was to extend previous reports on network analysis relating to food notifications by including an optional filter by type of notification and in cases of contamination, by type of contaminant in the notified foodstuff. A filter function has been applied to enable processing of selected notifications by contaminant or type of notification to i) capture complexity, ii) analyze trends, and iii) identify patterns of reporting activities between countries. The program rapidly assesses nations' roles as transgressor and/or detector for each category of contaminant and for the key class of border rejection. In the open access demonstration version, the majority of notifications in the Rapid Alert System for Food and Feed were categorized by contaminant type as mycotoxin (50.4%), heavy metals (10.9%) or bacteria (20.3%). Examples are given demonstrating how network analytical approaches complement, and in some cases supersede, descriptive statistics such as frequency counts, which may give limited or potentially misleading information. One key feature is that network analysis takes the relationship between transgressor and detector countries, along with number of reports and impact simultaneously into consideration. Furhermore, the indices that compliment the network maps and reflect each country's transgressor and detector activities allow comparisons to be made between (transgressing vs. detecting) as well as within (e.g. transgressing) activities. This further development of the network analysis approach to food safety contributes to a better understanding of the complexity of the effort ensuring food is safe for consumption in the European Union. The unique patterns of the interplay between detectors and transgressors, instantly revealed by our approach, could supplement the intelligence gathered by regulatory authorities and inform risk based sampling protocols.

An information dimension of weighted complex networks

NASA Astrophysics Data System (ADS)

Wen, Tao; Jiang, Wen

2018-07-01

The fractal and self-similarity are important properties in complex networks. Information dimension is a useful dimension for complex networks to reveal these properties. In this paper, an information dimension is proposed for weighted complex networks. Based on the box-covering algorithm for weighted complex networks (BCANw), the proposed method can deal with the weighted complex networks which appear frequently in the real-world, and it can get the influence of the number of nodes in each box on the information dimension. To show the wide scope of information dimension, some applications are illustrated, indicating that the proposed method is effective and feasible.

Detection of protein complex from protein-protein interaction network using Markov clustering

NASA Astrophysics Data System (ADS)

Ochieng, P. J.; Kusuma, W. A.; Haryanto, T.

2017-05-01

Detection of complexes, or groups of functionally related proteins, is an important challenge while analysing biological networks. However, existing algorithms to identify protein complexes are insufficient when applied to dense networks of experimentally derived interaction data. Therefore, we introduced a graph clustering method based on Markov clustering algorithm to identify protein complex within highly interconnected protein-protein interaction networks. Protein-protein interaction network was first constructed to develop geometrical network, the network was then partitioned using Markov clustering to detect protein complexes. The interest of the proposed method was illustrated by its application to Human Proteins associated to type II diabetes mellitus. Flow simulation of MCL algorithm was initially performed and topological properties of the resultant network were analysed for detection of the protein complex. The results indicated the proposed method successfully detect an overall of 34 complexes with 11 complexes consisting of overlapping modules and 20 non-overlapping modules. The major complex consisted of 102 proteins and 521 interactions with cluster modularity and density of 0.745 and 0.101 respectively. The comparison analysis revealed MCL out perform AP, MCODE and SCPS algorithms with high clustering coefficient (0.751) network density and modularity index (0.630). This demonstrated MCL was the most reliable and efficient graph clustering algorithm for detection of protein complexes from PPI networks.

Category Theoretic Analysis of Hierarchical Protein Materials and Social Networks

PubMed Central

Spivak, David I.; Giesa, Tristan; Wood, Elizabeth; Buehler, Markus J.

2011-01-01

Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we describe an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a “concept web” or “semantic network” except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other olog. We consider simple cases of beta-helical and amyloid-like protein filaments subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog for the social network feature identical category-theoretic representations, and we proceed to precisely explicate the analogy or isomorphism between them. The examples presented here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog. This, in turn, allows for comparative studies between disparate materials or fields of application, and results in novel approaches to derive functionality in the design of de novo hierarchical systems. We discuss opportunities and challenges associated with the description of complex biological materials by using ologs as a powerful tool for analysis and design in the context of materiomics, and we present the potential impact of this approach for engineering, life sciences, and medicine. PMID:21931622

Addressing complexity in population health intervention research: the context/intervention interface.

PubMed

Minary, Laetitia; Alla, François; Cambon, Linda; Kivits, Joelle; Potvin, Louise

2018-04-01

Public health interventions are increasingly being recognised as complex and context dependent. Related to this is the need for a systemic and dynamic conception of interventions that raises the question of delineating the scope and contours of interventions in complex systems. This means identifying which elements belong to the intervention (and therefore participate in its effects and can be transferred), which ones belong to the context and interact with the former to influence results (and therefore must be taken into account when transferring the intervention) and which contextual elements are irrelevant to the intervention. This paper, from which derives criteria based on a network framework, operationalises how the context and intervention systems interact and identify what needs to be replicated as interventions are implemented in different contexts. Representing interventions as networks (composed of human and non-human entities), we introduce the idea that the density of interconnections among the various entities provides a criterion for distinguishing core intervention from intervention context without disconnecting the two systems. This differentiates endogenous and exogenous intervention contexts and the mediators that connect them, which form the fuzzy and constantly changing intervention/context interface. We propose that a network framework representing intervention/context systems constitutes a promising approach for deriving empirical criteria to delineate the scope and contour of what is replicable in an intervention. This approach should allow better identification and description of the entities that have to be transferred to ensure the potential effectiveness of an intervention in a specific context. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

Designing synthetic networks in silico: a generalised evolutionary algorithm approach.

PubMed

Smith, Robert W; van Sluijs, Bob; Fleck, Christian

2017-12-02

Evolution has led to the development of biological networks that are shaped by environmental signals. Elucidating, understanding and then reconstructing important network motifs is one of the principal aims of Systems & Synthetic Biology. Consequently, previous research has focused on finding optimal network structures and reaction rates that respond to pulses or produce stable oscillations. In this work we present a generalised in silico evolutionary algorithm that simultaneously finds network structures and reaction rates (genotypes) that can satisfy multiple defined objectives (phenotypes). The key step to our approach is to translate a schema/binary-based description of biological networks into systems of ordinary differential equations (ODEs). The ODEs can then be solved numerically to provide dynamic information about an evolved networks functionality. Initially we benchmark algorithm performance by finding optimal networks that can recapitulate concentration time-series data and perform parameter optimisation on oscillatory dynamics of the Repressilator. We go on to show the utility of our algorithm by finding new designs for robust synthetic oscillators, and by performing multi-objective optimisation to find a set of oscillators and feed-forward loops that are optimal at balancing different system properties. In sum, our results not only confirm and build on previous observations but we also provide new designs of synthetic oscillators for experimental construction. In this work we have presented and tested an evolutionary algorithm that can design a biological network to produce desired output. Given that previous designs of synthetic networks have been limited to subregions of network- and parameter-space, the use of our evolutionary optimisation algorithm will enable Synthetic Biologists to construct new systems with the potential to display a wider range of complex responses.

Cellular automata simulation of topological effects on the dynamics of feed-forward motifs

PubMed Central

Apte, Advait A; Cain, John W; Bonchev, Danail G; Fong, Stephen S

2008-01-01

Background Feed-forward motifs are important functional modules in biological and other complex networks. The functionality of feed-forward motifs and other network motifs is largely dictated by the connectivity of the individual network components. While studies on the dynamics of motifs and networks are usually devoted to the temporal or spatial description of processes, this study focuses on the relationship between the specific architecture and the overall rate of the processes of the feed-forward family of motifs, including double and triple feed-forward loops. The search for the most efficient network architecture could be of particular interest for regulatory or signaling pathways in biology, as well as in computational and communication systems. Results Feed-forward motif dynamics were studied using cellular automata and compared with differential equation modeling. The number of cellular automata iterations needed for a 100% conversion of a substrate into a target product was used as an inverse measure of the transformation rate. Several basic topological patterns were identified that order the specific feed-forward constructions according to the rate of dynamics they enable. At the same number of network nodes and constant other parameters, the bi-parallel and tri-parallel motifs provide higher network efficacy than single feed-forward motifs. Additionally, a topological property of isodynamicity was identified for feed-forward motifs where different network architectures resulted in the same overall rate of the target production. Conclusion It was shown for classes of structural motifs with feed-forward architecture that network topology affects the overall rate of a process in a quantitatively predictable manner. These fundamental results can be used as a basis for simulating larger networks as combinations of smaller network modules with implications on studying synthetic gene circuits, small regulatory systems, and eventually dynamic whole-cell models. PMID:18304325

The CARFAX road traffic information system

NASA Astrophysics Data System (ADS)

Sandell, R. S.

1984-02-01

A description of the development work and field trials which led to the completion of the dedicated traffic information service "CARFAX' is presented. The system employs a single medium frequency channel, and involves a network of low powered transmitters that operate in time division multiplex to provide traffic announcements. A description of the network distribution, equipment test, results and future system utilization is included.

Robustness and structure of complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai

This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks are much more vulnerable to localized attack compared with random attack. In the second part, we extend the tree-like generating function method to incorporating clustering structure in complex networks. We study the robustness of a complex network system, especially a network of networks (NON) with clustering structure in each network. We find that the system becomes less robust as we increase the clustering coefficient of each network. For a partially dependent network system, we also find that the influence of the clustering coefficient on network robustness decreases as we decrease the coupling strength, and the critical coupling strength qc, at which the first-order phase transition changes to second-order, increases as we increase the clustering coefficient.

Research on computer virus database management system

NASA Astrophysics Data System (ADS)

Qi, Guoquan

2011-12-01

The growing proliferation of computer viruses becomes the lethal threat and research focus of the security of network information. While new virus is emerging, the number of viruses is growing, virus classification increasing complex. Virus naming because of agencies' capture time differences can not be unified. Although each agency has its own virus database, the communication between each other lacks, or virus information is incomplete, or a small number of sample information. This paper introduces the current construction status of the virus database at home and abroad, analyzes how to standardize and complete description of virus characteristics, and then gives the information integrity, storage security and manageable computer virus database design scheme.

Entropic Nonsignaling Correlations.

PubMed

Chaves, Rafael; Budroni, Costantino

2016-06-17

We introduce the concept of entropic nonsignaling correlations, i.e., entropies arising from probabilistic theories that are compatible with the fact that we cannot transmit information instantaneously. We characterize and show the relevance of these entropic correlations in a variety of different scenarios, ranging from typical Bell experiments to more refined descriptions such as bilocality and information causality. In particular, we apply the framework to derive the first entropic inequality testing genuine tripartite nonlocality in quantum systems of arbitrary dimension and also prove the first known monogamy relation for entropic Bell inequalities. Further, within the context of complex Bell networks, we show that entropic nonlocal correlations can be activated.

Multiscale Simulations of Reactive Transport

NASA Astrophysics Data System (ADS)

Tartakovsky, D. M.; Bakarji, J.

2014-12-01

Discrete, particle-based simulations offer distinct advantages when modeling solute transport and chemical reactions. For example, Brownian motion is often used to model diffusion in complex pore networks, and Gillespie-type algorithms allow one to handle multicomponent chemical reactions with uncertain reaction pathways. Yet such models can be computationally more intensive than their continuum-scale counterparts, e.g., advection-dispersion-reaction equations. Combining the discrete and continuum models has a potential to resolve the quantity of interest with a required degree of physicochemical granularity at acceptable computational cost. We present computational examples of such "hybrid models" and discuss the challenges associated with coupling these two levels of description.

Entropic Nonsignaling Correlations

NASA Astrophysics Data System (ADS)

Chaves, Rafael; Budroni, Costantino

2016-06-01

We introduce the concept of entropic nonsignaling correlations, i.e., entropies arising from probabilistic theories that are compatible with the fact that we cannot transmit information instantaneously. We characterize and show the relevance of these entropic correlations in a variety of different scenarios, ranging from typical Bell experiments to more refined descriptions such as bilocality and information causality. In particular, we apply the framework to derive the first entropic inequality testing genuine tripartite nonlocality in quantum systems of arbitrary dimension and also prove the first known monogamy relation for entropic Bell inequalities. Further, within the context of complex Bell networks, we show that entropic nonlocal correlations can be activated.

Structural Behavioral Study on the General Aviation Network Based on Complex Network

NASA Astrophysics Data System (ADS)

Zhang, Liang; Lu, Na

2017-12-01

The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

Fuzzy Entropy Method for Quantifying Supply Chain Networks Complexity

NASA Astrophysics Data System (ADS)

Zhang, Jihui; Xu, Junqin

Supply chain is a special kind of complex network. Its complexity and uncertainty makes it very difficult to control and manage. Supply chains are faced with a rising complexity of products, structures, and processes. Because of the strong link between a supply chain’s complexity and its efficiency the supply chain complexity management becomes a major challenge of today’s business management. The aim of this paper is to quantify the complexity and organization level of an industrial network working towards the development of a ‘Supply Chain Network Analysis’ (SCNA). By measuring flows of goods and interaction costs between different sectors of activity within the supply chain borders, a network of flows is built and successively investigated by network analysis. The result of this study shows that our approach can provide an interesting conceptual perspective in which the modern supply network can be framed, and that network analysis can handle these issues in practice.

Is it the shape of the cavity, or the shape of the water in the cavity?

NASA Astrophysics Data System (ADS)

Snyder, Phillip W.; Lockett, Matthew R.; Moustakas, Demetri T.; Whitesides, George M.

2014-04-01

Historical interpretations of the thermodynamics characterizing biomolecular recognition have marginalized the role of water. An important (even, perhaps, dominant) contribution to molecular recognition in water comes from the "hydrophobic effect," in which non-polar portions of a ligand interact preferentially with non-polar regions of a protein. Water surrounds the ligand, and water fills the binding pocket of the protein: when the protein-ligand complex forms, and hydrophobic surfaces of the binding pocket and the ligand approach one another, the molecules (and hydrogen-bonded networks of molecules) of water associated with both surfaces rearrange and, in part, entirely escape into the bulk solution. It is now clear that neither of the two most commonly cited rationalizations for the hydrophobic effect-an entropy-dominated hydrophobic effect, in which ordered waters at the surface of the ligand, and water at the surface of the protein, are released to the bulk upon binding, and a "lock-and-key" model, in which the surface of a ligand interacts directly with a surface of a protein having a complementary shape-can account for water-mediated interactions between the ligand and the protein, and neither is sufficient to account for the experimental observation of both entropy- andenthalpy-dominated hydrophobic effects. What is now clear is that there is no single hydrophobic effect, with a universally applicable, common, thermodynamic description: different processes (i.e., partitioning between phases of different hydrophobicity, aggregation in water, and binding) with different thermodynamics, depend on the molecular-level details of the structures of the molecules involved, and of the aggregates that form. A "water-centric" description of the hydrophobic effect in biomolecular recognition focuses on the structures of water surrounding the ligand, and of water filling the binding pocket of the protein, both before and after binding. This view attributes the hydrophobic effect to changes in the free energy of the networks of hydrogen bonds that are formed, broken, or re-arranged when two hydrophobic surfaces approach (but do not necessarily contact) one another. The details of the molecular topography (and the polar character) of the mole- cular surfaces play an important role in determining the structure of these networks of hydrogen-bonded waters, and in the thermodynamic description of the hydrophobic effect(s). Theorists have led the formulation of this "water-centric view", although experiments are now supplying support for it. It poses complex problems for would-be "designers" of protein-ligand interactions, and for so-called "rational drug design".

Signalling networks and dynamics of allosteric transitions in bacterial chaperonin GroEL: implications for iterative annealing of misfolded proteins.

PubMed

Thirumalai, D; Hyeon, Changbong

2018-06-19

Signal transmission at the molecular level in many biological complexes occurs through allosteric transitions. Allostery describes the responses of a complex to binding of ligands at sites that are spatially well separated from the binding region. We describe the structural perturbation method, based on phonon propagation in solids, which can be used to determine the signal-transmitting allostery wiring diagram (AWD) in large but finite-sized biological complexes. Application to the bacterial chaperonin GroEL-GroES complex shows that the AWD determined from structures also drives the allosteric transitions dynamically. From both a structural and dynamical perspective these transitions are largely determined by formation and rupture of salt-bridges. The molecular description of allostery in GroEL provides insights into its function, which is quantitatively described by the iterative annealing mechanism. Remarkably, in this complex molecular machine, a deep connection is established between the structures, reaction cycle during which GroEL undergoes a sequence of allosteric transitions, and function, in a self-consistent manner.This article is part of a discussion meeting issue 'Allostery and molecular machines'. © 2018 The Author(s).

Minimum energy information fusion in sensor networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chapline, G

1999-05-11

In this paper we consider how to organize the sharing of information in a distributed network of sensors and data processors so as to provide explanations for sensor readings with minimal expenditure of energy. We point out that the Minimum Description Length principle provides an approach to information fusion that is more naturally suited to energy minimization than traditional Bayesian approaches. In addition we show that for networks consisting of a large number of identical sensors Kohonen self-organization provides an exact solution to the problem of combing the sensor outputs into minimal description length explanations.

Approaching human language with complex networks

NASA Astrophysics Data System (ADS)

Cong, Jin; Liu, Haitao

2014-12-01

The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics).

Characterization of two in vivo-expressed methyltransferases of the Mycobacterium tuberculosis complex: antigenicity and genetic regulation

PubMed Central

Golby, Paul; Nunez, Javier; Cockle, Paul J.; Ewer, Katie; Logan, Karen; Hogarth, Philip; Vordermeier, H. Martin; Hinds, Jason; Hewinson, R. Glyn; Gordon, Stephen V.

2011-01-01

Genome sequencing of Mycobacterium tuberculosis complex members has accelerated the search for new disease-control tools. Antigen mining is one area that has benefited enormously from access to genome data. As part of an ongoing antigen mining programme, we screened genes that were previously identified by transcriptome analysis as upregulated in response to an in vitro acid shock for their in vivo expression profile and antigenicity. We show that the genes encoding two methyltransferases, Mb1438c/Rv1403c and Mb1440c/Rv1404c, were highly upregulated in a mouse model of infection, and were antigenic in M. bovis-infected cattle. As the genes encoding these antigens were highly upregulated in vivo, we sought to define their genetic regulation. A mutant was constructed that was deleted for their putative regulator, Mb1439/Rv1404; loss of the regulator led to increased expression of the flanking methyltransferases and a defined set of distal genes. This work has therefore generated both applied and fundamental outputs, with the description of novel mycobacterial antigens that can now be moved into field trials, but also with the description of a regulatory network that is responsive to both in vivo and in vitro stimuli. PMID:18375799

Interest communities and flow roles in directed networks: the Twitter network of the UK riots

PubMed Central

Beguerisse-Díaz, Mariano; Garduño-Hernández, Guillermo; Vangelov, Borislav; Yaliraki, Sophia N.; Barahona, Mauricio

2014-01-01

Directionality is a crucial ingredient in many complex networks in which information, energy or influence are transmitted. In such directed networks, analysing flows (and not only the strength of connections) is crucial to reveal important features of the network that might go undetected if the orientation of connections is ignored. We showcase here a flow-based approach for community detection through the study of the network of the most influential Twitter users during the 2011 riots in England. Firstly, we use directed Markov Stability to extract descriptions of the network at different levels of coarseness in terms of interest communities, i.e. groups of nodes within which flows of information are contained and reinforced. Such interest communities reveal user groupings according to location, profession, employer and topic. The study of flows also allows us to generate an interest distance, which affords a personalized view of the attention in the network as viewed from the vantage point of any given user. Secondly, we analyse the profiles of incoming and outgoing long-range flows with a combined approach of role-based similarity and the novel relaxed minimum spanning tree algorithm to reveal that the users in the network can be classified into five roles. These flow roles go beyond the standard leader/follower dichotomy and differ from classifications based on regular/structural equivalence. We then show that the interest communities fall into distinct informational organigrams characterized by a different mix of user roles reflecting the quality of dialogue within them. Our generic framework can be used to provide insight into how flows are generated, distributed, preserved and consumed in directed networks. PMID:25297320

A signal-flow-graph approach to on-line gradient calculation.

PubMed

Campolucci, P; Uncini, A; Piazza, F

2000-08-01

A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular in the neural network community, they are often used for qualitative description rather than for rigorous representation and computational purposes. In this article, a method for both on-line and batch-backward gradient computation of a system output or cost function with respect to system parameters is derived by the SFG representation theory and its known properties. The system can be any causal, in general nonlinear and time-variant, dynamic system represented by an SFG, in particular any feedforward, time-delay, or recurrent neural network. In this work, we use discrete-time notation, but the same theory holds for the continuous-time case. The gradient is obtained in a straightforward way by the analysis of two SFGs, the original one and its adjoint (obtained from the first by simple transformations), without the complex chain rule expansions of derivatives usually employed. This method can be used for sensitivity analysis and for learning both off-line and on-line. On-line learning is particularly important since it is required by many real applications, such as digital signal processing, system identification and control, channel equalization, and predistortion.

Fokker-Planck description of conductance-based integrate-and-fire neuronal networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kovacic, Gregor; Tao, Louis; Rangan, Aaditya V.

2009-08-15

Steady dynamics of coupled conductance-based integrate-and-fire neuronal networks in the limit of small fluctuations is studied via the equilibrium states of a Fokker-Planck equation. An asymptotic approximation for the membrane-potential probability density function is derived and the corresponding gain curves are found. Validity conditions are discussed for the Fokker-Planck description and verified via direct numerical simulations.

Characterization of Radar Signals Using Neural Networks

DTIC Science & Technology

1990-12-01

e***e*e*eeeeeeeeeeeesseeeeeese*eee*e*e************s /* Function Name: load.input.ptterns Number: 4.1 /* Description: This function determines wether ...XSE.last.layer Number: 8.5 */ /* Description: The function determines wether to backpropate the *f /* parameter by the sigmoidal or linear update...Sigmoidal Function," Mathematics of Control, Signals and Systems, 2:303-314 (March 1989). 6. Dayhoff, Judith E. Neural Network Architectures. New York: Van

Mining the modular structure of protein interaction networks.

PubMed

Berenstein, Ariel José; Piñero, Janet; Furlong, Laura Inés; Chernomoretz, Ariel

2015-01-01

Cluster-based descriptions of biological networks have received much attention in recent years fostered by accumulated evidence of the existence of meaningful correlations between topological network clusters and biological functional modules. Several well-performing clustering algorithms exist to infer topological network partitions. However, due to respective technical idiosyncrasies they might produce dissimilar modular decompositions of a given network. In this contribution, we aimed to analyze how alternative modular descriptions could condition the outcome of follow-up network biology analysis. We considered a human protein interaction network and two paradigmatic cluster recognition algorithms, namely: the Clauset-Newman-Moore and the infomap procedures. We analyzed to what extent both methodologies yielded different results in terms of granularity and biological congruency. In addition, taking into account Guimera's cartographic role characterization of network nodes, we explored how the adoption of a given clustering methodology impinged on the ability to highlight relevant network meso-scale connectivity patterns. As a case study we considered a set of aging related proteins and showed that only the high-resolution modular description provided by infomap, could unveil statistically significant associations between them and inter/intra modular cartographic features. Besides reporting novel biological insights that could be gained from the discovered associations, our contribution warns against possible technical concerns that might affect the tools used to mine for interaction patterns in network biology studies. In particular our results suggested that sub-optimal partitions from the strict point of view of their modularity levels might still be worth being analyzed when meso-scale features were to be explored in connection with external source of biological knowledge.

Protein-protein interactions in paralogues: Electrostatics modulates specificity on a conserved steric scaffold

PubMed Central

Huber, Roland G.; Bond, Peter J.

2017-01-01

An improved knowledge of protein-protein interactions is essential for better understanding of metabolic and signaling networks, and cellular function. Progress tends to be based on structure determination and predictions using known structures, along with computational methods based on evolutionary information or detailed atomistic descriptions. We hypothesized that for the case of interactions across a common interface, between proteins from a pair of paralogue families or within a family of paralogues, a relatively simple interface description could distinguish between binding and non-binding pairs. Using binding data for several systems, and large-scale comparative modeling based on known template complex structures, it is found that charge-charge interactions (for groups bearing net charge) are generally a better discriminant than buried non-polar surface. This is particularly the case for paralogue families that are less divergent, with more reliable comparative modeling. We suggest that electrostatic interactions are major determinants of specificity in such systems, an observation that could be used to predict binding partners. PMID:29016650

Protein-protein interactions in paralogues: Electrostatics modulates specificity on a conserved steric scaffold.

PubMed

Ivanov, Stefan M; Cawley, Andrew; Huber, Roland G; Bond, Peter J; Warwicker, Jim

2017-01-01

An improved knowledge of protein-protein interactions is essential for better understanding of metabolic and signaling networks, and cellular function. Progress tends to be based on structure determination and predictions using known structures, along with computational methods based on evolutionary information or detailed atomistic descriptions. We hypothesized that for the case of interactions across a common interface, between proteins from a pair of paralogue families or within a family of paralogues, a relatively simple interface description could distinguish between binding and non-binding pairs. Using binding data for several systems, and large-scale comparative modeling based on known template complex structures, it is found that charge-charge interactions (for groups bearing net charge) are generally a better discriminant than buried non-polar surface. This is particularly the case for paralogue families that are less divergent, with more reliable comparative modeling. We suggest that electrostatic interactions are major determinants of specificity in such systems, an observation that could be used to predict binding partners.

Network cosmology.

PubMed

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

Network Cosmology

PubMed Central

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688

Distinctive fingerprints of erosional regimes in terrestrial channel networks

NASA Astrophysics Data System (ADS)

Grau Galofre, A.; Jellinek, M.

2017-12-01

Satellite imagery and digital elevation maps capture the large scale morphology of channel networks attributed to long term erosional processes, such as fluvial, glacial, groundwater sapping and subglacial erosion. Characteristic morphologies associated with each of these styles of erosion have been studied in detail, but there exists a knowledge gap related to their parameterization and quantification. This knowledge gap prevents a rigorous analysis of the dominant processes that shaped a particular landscape, and a comparison across styles of erosion. To address this gap, we use previous morphological descriptions of glaciers, rivers, sapping valleys and tunnel valleys to identify and measure quantitative metrics diagnostic of these distinctive styles of erosion. From digital elevation models, we identify four geometric metrics: The minimum channel width, channel aspect ratio (longest length to channel width at the outlet), presence of undulating longitudinal profiles, and tributary junction angle. We also parameterize channel network complexity in terms of its stream order and fractal dimension. We then perform a statistical classification of the channel networks using a Principal Component Analysis on measurements of these six metrics on a dataset of 70 channelized systems. We show that rivers, glaciers, groundwater seepage and subglacial meltwater erode the landscape in rigorously distinguishable ways. Our methodology can more generally be applied to identify the contributions of different processes involved in carving a channel network. In particular, we are able to identify transitions from fluvial to glaciated landscapes or vice-versa.

Use of qualitative and quantitative information in neural networks for assessing agricultural chemical contamination of domestic wells

USGS Publications Warehouse

Mishra, A.; Ray, C.; Kolpin, D.W.

2004-01-01

A neural network analysis of agrichemical occurrence in groundwater was conducted using data from a pilot study of 192 small-diameter drilled and driven wells and 115 dug and bored wells in Illinois, a regional reconnaissance network of 303 wells across 12 Midwestern states, and a study of 687 domestic wells across Iowa. Potential factors contributing to well contamination (e.g., depth to aquifer material, well depth, and distance to cropland) were investigated. These contributing factors were available in either numeric (actual or categorical) or descriptive (yes or no) format. A method was devised to use the numeric and descriptive values simultaneously. Training of the network was conducted using a standard backpropagation algorithm. Approximately 15% of the data was used for testing. Analysis indicated that training error was quite low for most data. Testing results indicated that it was possible to predict the contamination potential of a well with pesticides. However, predicting the actual level of contamination was more difficult. For pesticide occurrence in drilled and driven wells, the network predictions were good. The performance of the network was poorer for predicting nitrate occurrence in dug and bored wells. Although the data set for Iowa was large, the prediction ability of the trained network was poor, due to descriptive or categorical input parameters, compared with smaller data sets such as that for Illinois, which contained more numeric information.

The Value of Information in Distributed Decision Networks

DTIC Science & Technology

2016-03-04

formulation, and then we describe the various results at- tained. 1 Mathematical description of Distributed Decision Network un- der Information...Constraints We now define a mathematical framework for networks. Let G = (V,E) be an undirected random network (graph) drawn from a known distribution pG, 1

Approaching human language with complex networks.

PubMed

Cong, Jin; Liu, Haitao

2014-12-01

The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics). Copyright © 2014 Elsevier B.V. All rights reserved.

Visibility in the topology of complex networks

NASA Astrophysics Data System (ADS)

Tsiotas, Dimitrios; Charakopoulos, Avraam

2018-09-01

Taking its inspiration from the visibility algorithm, which was proposed by Lacasa et al. (2008) to convert a time-series into a complex network, this paper develops and proposes a novel expansion of this algorithm that allows generating a visibility graph from a complex network instead of a time-series that is currently applicable. The purpose of this approach is to apply the idea of visibility from the field of time-series to complex networks in order to interpret the network topology as a landscape. Visibility in complex networks is a multivariate property producing an associated visibility graph that maps the ability of a node "to see" other nodes in the network that lie beyond the range of its neighborhood, in terms of a control-attribute. Within this context, this paper examines the visibility topology produced by connectivity (degree) in comparison with the original (source) network, in order to detect what patterns or forces describe the mechanism under which a network is converted to a visibility graph. The overall analysis shows that visibility is a property that increases the connectivity in networks, it may contribute to pattern recognition (among which the detection of the scale-free topology) and it is worth to be applied to complex networks in order to reveal the potential of signal processing beyond the range of its neighborhood. Generally, this paper promotes interdisciplinary research in complex networks providing new insights to network science.

Graph distance for complex networks

NASA Astrophysics Data System (ADS)

Shimada, Yutaka; Hirata, Yoshito; Ikeguchi, Tohru; Aihara, Kazuyuki

2016-10-01

Networks are widely used as a tool for describing diverse real complex systems and have been successfully applied to many fields. The distance between networks is one of the most fundamental concepts for properly classifying real networks, detecting temporal changes in network structures, and effectively predicting their temporal evolution. However, this distance has rarely been discussed in the theory of complex networks. Here, we propose a graph distance between networks based on a Laplacian matrix that reflects the structural and dynamical properties of networked dynamical systems. Our results indicate that the Laplacian-based graph distance effectively quantifies the structural difference between complex networks. We further show that our approach successfully elucidates the temporal properties underlying temporal networks observed in the context of face-to-face human interactions.

Adaptive-network models of collective dynamics

NASA Astrophysics Data System (ADS)

Zschaler, G.

2012-09-01

Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge. Moreover, we show what minimal microscopic interaction rules determine whether the transition to collective motion is continuous or discontinuous. Second, we consider a model of opinion formation in groups of individuals, where we focus on the effect of directed links in adaptive networks. Extending the adaptive voter model to directed networks, we find a novel fragmentation mechanism, by which the network breaks into distinct components of opposing agents. This fragmentation is mediated by the formation of self-stabilizing structures in the network, which do not occur in the undirected case. We find that they are related to degree correlations stemming from the interplay of link directionality and adaptive topological change. Third, we discuss a model for the evolution of cooperation among self-interested agents, in which the adaptive nature of their interaction network gives rise to a novel dynamical mechanism promoting cooperation. We show that even full cooperation can be achieved asymptotically if the networks' adaptive response to the agents' dynamics is sufficiently fast.

Effect of mixed Ge/Si cross-linking on the physical properties of amorphous Ge-Si-Te networks

NASA Astrophysics Data System (ADS)

Gunasekera, K.; Boolchand, P.; Micoulaut, M.

2014-04-01

Amorphous GexSixTe1-2x glasses are studied as a function of composition by a combination of experimental and theoretical methods, allowing for a full description of the network structure in relationship with physico-chemical properties. Calorimetric and thermal measurements reveal that such glasses display an anomalous behavior across a range of compositions xc1=7.5% and

Coupled protein-ligand dynamics in truncated hemoglobin N from atomistic simulations and transition networks.

PubMed

Cazade, Pierre-André; Berezovska, Ganna; Meuwly, Markus

2015-05-01

The nature of ligand motion in proteins is difficult to characterize directly using experiment. Specifically, it is unclear to what degree these motions are coupled. All-atom simulations are used to sample ligand motion in truncated Hemoglobin N. A transition network analysis including ligand- and protein-degrees of freedom is used to analyze the microscopic dynamics. Clustering of two different subsets of MD trajectories highlights the importance of a diverse and exhaustive description to define the macrostates for a ligand-migration network. Monte Carlo simulations on the transition matrices from one particular clustering are able to faithfully capture the atomistic simulations. Contrary to clustering by ligand positions only, including a protein degree of freedom yields considerably improved coarse grained dynamics. Analysis with and without imposing detailed balance agree closely which suggests that the underlying atomistic simulations are converged with respect to sampling transitions between neighboring sites. Protein and ligand dynamics are not independent from each other and ligand migration through globular proteins is not passive diffusion. Transition network analysis is a powerful tool to analyze and characterize the microscopic dynamics in complex systems. This article is part of a Special Issue entitled Recent developments of molecular dynamics. Copyright © 2014 Elsevier B.V. All rights reserved.

Network analysis of Bogotá’s Ciclovía Recreativa, a self-organized multisectoral community program to promote physical activity in a middle-income country

PubMed Central

Meisel, Jose D; Sarmiento, Olga; Montes, Felipe; Martinez, Edwin O.; Lemoine, Pablo D; Valdivia, Juan A; Brownson, RC; Zarama, Robert

2016-01-01

Purpose Conduct a social network analysis of the health and non-health related organizations that participate in the Bogotá’s Ciclovía Recreativa (Ciclovía). Design Cross sectional study. Setting Ciclovía is a multisectoral community-based mass program in which streets are temporarily closed to motorized transport, allowing exclusive access to individuals for leisure activities and PA. Subjects 25 organizations that participate in the Ciclovía. Measures Seven variables were examined using network analytic methods: relationship, link attributes (integration, contact, and importance), and node attributes (leadership, years in the program, and the sector of the organization). Analysis The network analytic methods were based on a visual descriptive analysis and an exponential random graph model. Results Analysis shows that the most central organizations in the network were outside of the health sector and includes Sports and Recreation, Government, and Security sectors. The organizations work in clusters formed by organizations of different sectors. Organization importance and structural predictors were positively related to integration, while the number of years working with Ciclovía was negatively associated with integration. Conclusion Ciclovía is a network whose structure emerged as a self-organized complex system. Ciclovía of Bogotá is an example of a program with public health potential formed by organizations of multiple sectors with Sports and Recreation as the most central. PMID:23971523

A multi-layer MRI description of Parkinson's disease

NASA Astrophysics Data System (ADS)

La Rocca, M.; Amoroso, N.; Lella, E.; Bellotti, R.; Tangaro, S.

2017-09-01

Magnetic resonance imaging (MRI) along with complex network is currently one of the most widely adopted techniques for detection of structural changes in neurological diseases, such as Parkinson's Disease (PD). In this paper, we present a digital image processing study, within the multi-layer network framework, combining more classifiers to evaluate the informative power of the MRI features, for the discrimination of normal controls (NC) and PD subjects. We define a network for each MRI scan; the nodes are the sub-volumes (patches) the images are divided into and the links are defined using the Pearson's pairwise correlation between patches. We obtain a multi-layer network whose important network features, obtained with different feature selection methods, are used to feed a supervised multi-level random forest classifier which exploits this base of knowledge for accurate classification. Method evaluation has been carried out using T1 MRI scans of 354 individuals, including 177 PD subjects and 177 NC from the Parkinson's Progression Markers Initiative (PPMI) database. The experimental results demonstrate that the features obtained from multiplex networks are able to accurately describe PD patterns. Besides, also if a privileged scale for studying PD disease exists, exploring the informative content of more scales leads to a significant improvement of the performances in the discrimination between disease and healthy subjects. In particular, this method gives a comprehensive overview of brain regions statistically affected by the disease, an additional value to the presented study.

Linguistic complex networks: Rationale, application, interpretation, and directions. Reply to comments on "Approaching human language with complex networks"

NASA Astrophysics Data System (ADS)

Cong, Jin; Liu, Haitao

2014-12-01

Amid the enthusiasm for real-world networks of the new millennium, the enquiry into linguistic networks is flourishing not only as a productive branch of the new networks science but also as a promising approach to linguistic research. Although the complex network approach constitutes a potential opportunity to make linguistics a science, the world of linguistics seems unprepared to embrace it. For one thing, linguistics has been largely unaffected by quantitative methods. Those who are accustomed to qualitative linguistic methods may find it hard to appreciate the application of quantitative properties of language such as frequency and length, not to mention quantitative properties of language modeled as networks. With this in mind, in our review [1] we restrict ourselves to the basics of complex networks and the new insights into human language with the application of complex networks. For another, while breaking new grounds and posing new challenges for linguistics, the complex network approach to human language as a new tradition of linguistic research is faced with challenges and unsolved issues of its own. It is no surprise that the comments on our review, especially their skepticism and suggestions, focus on various different aspects of the complex network approach to human language. We are grateful to all the insightful and penetrating comments, which, together with our review, mark a significant impetus to linguistic research from the complex network approach. In this reply, we would like to address four major issues of the complex network approach to human language, namely, a) its theoretical rationale, b) its application in linguistic research, c) interpretation of the results, and d) directions of future research.

Investigating System Dependability Modeling Using AADL

NASA Technical Reports Server (NTRS)

Hall, Brendan; Driscoll, Kevin R.; Madl, Gabor

2013-01-01

This report describes Architecture Analysis & Design Language (AADL) models for a diverse set of fault-tolerant, embedded data networks and describes the methods and tools used to created these models. It also includes error models per the AADL Error Annex. Some networks were modeled using Error Detection Isolation Containment Types (EDICT). This report gives a brief description for each of the networks, a description of its modeling, the model itself, and evaluations of the tools used for creating the models. The methodology includes a naming convention that supports a systematic way to enumerate all of the potential failure modes.

Accurate Identification of MCI Patients via Enriched White-Matter Connectivity Network

NASA Astrophysics Data System (ADS)

Wee, Chong-Yaw; Yap, Pew-Thian; Brownyke, Jeffery N.; Potter, Guy G.; Steffens, David C.; Welsh-Bohmer, Kathleen; Wang, Lihong; Shen, Dinggang

Mild cognitive impairment (MCI), often a prodromal phase of Alzheimer's disease (AD), is frequently considered to be a good target for early diagnosis and therapeutic interventions of AD. Recent emergence of reliable network characterization techniques have made understanding neurological disorders at a whole brain connectivity level possible. Accordingly, we propose a network-based multivariate classification algorithm, using a collection of measures derived from white-matter (WM) connectivity networks, to accurately identify MCI patients from normal controls. An enriched description of WM connections, utilizing six physiological parameters, i.e., fiber penetration count, fractional anisotropy (FA), mean diffusivity (MD), and principal diffusivities (λ 1, λ 2, λ 3), results in six connectivity networks for each subject to account for the connection topology and the biophysical properties of the connections. Upon parcellating the brain into 90 regions-of-interest (ROIs), the average statistics of each ROI in relation to the remaining ROIs are extracted as features for classification. These features are then sieved to select the most discriminant subset of features for building an MCI classifier via support vector machines (SVMs). Cross-validation results indicate better diagnostic power of the proposed enriched WM connection description than simple description with any single physiological parameter.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

The role of syntax in complex networks: Local and global importance of verbs in a syntactic dependency network

NASA Astrophysics Data System (ADS)

Čech, Radek; Mačutek, Ján; Žabokrtský, Zdeněk

2011-10-01

Syntax of natural language has been the focus of linguistics for decades. The complex network theory, being one of new research tools, opens new perspectives on syntax properties of the language. Despite numerous partial achievements, some fundamental problems remain unsolved. Specifically, although statistical properties typical for complex networks can be observed in all syntactic networks, the impact of syntax itself on these properties is still unclear. The aim of the present study is to shed more light on the role of syntax in the syntactic network structure. In particular, we concentrate on the impact of the syntactic function of a verb in the sentence on the complex network structure. Verbs play the decisive role in the sentence structure (“local” importance). From this fact we hypothesize the importance of verbs in the complex network (“global” importance). The importance of verb in the complex network is assessed by the number of links which are directed from the node representing verb to other nodes in the network. Six languages (Catalan, Czech, Dutch, Hungarian, Italian, Portuguese) were used for testing the hypothesis.

75 FR 63253 - State-56, Network User Account Records

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-14

... DEPARTMENT OF STATE [Public Notice 7210] State-56, Network User Account Records SUMMARY: Notice is hereby given that the Department of State proposes to create a system of records, Network User Account... named ``Network User Account Records.'' It is also proposed that the new system description will be...

CD-ROM and Local Area Networks.

ERIC Educational Resources Information Center

Marks, Kenneth E.; And Others

1993-01-01

This special section on local area networks includes three articles: (1) a description of migration at Joyner Library, East Carolina University (North Carolina) to a new network server; (2) a discussion of factors to consider for network planning in school libraries; and (3) a directory of companies supplying cable, hardware, software, and…

The deep space network, Volume 11

NASA Technical Reports Server (NTRS)

1972-01-01

Deep Space Network progress in flight project support, Tracking and Data Acquisition research and technology, network engineering, hardware and software implementation, and operations are presented. Material is presented in each of the following categories: description of DSN; mission support; radio science; support research and technology; network engineering and implementation; and operations and facilities.

Underage Children and Social Networking

ERIC Educational Resources Information Center

Weeden, Shalynn; Cooke, Bethany; McVey, Michael

2013-01-01

Despite minimum age requirements for joining popular social networking services such as Facebook, many students misrepresent their real ages and join as active participants in the networks. This descriptive study examines the use of social networking services (SNSs) by children under the age of 13. The researchers surveyed a sample of 199…

Network dynamics and systems biology

NASA Astrophysics Data System (ADS)

Norrell, Johannes A.

The physics of complex systems has grown considerably as a field in recent decades, largely due to improved computational technology and increased availability of systems level data. One area in which physics is of growing relevance is molecular biology. A new field, systems biology, investigates features of biological systems as a whole, a strategy of particular importance for understanding emergent properties that result from a complex network of interactions. Due to the complicated nature of the systems under study, the physics of complex systems has a significant role to play in elucidating the collective behavior. In this dissertation, we explore three problems in the physics of complex systems, motivated in part by systems biology. The first of these concerns the applicability of Boolean models as an approximation of continuous systems. Studies of gene regulatory networks have employed both continuous and Boolean models to analyze the system dynamics, and the two have been found produce similar results in the cases analyzed. We ask whether or not Boolean models can generically reproduce the qualitative attractor dynamics of networks of continuously valued elements. Using a combination of analytical techniques and numerical simulations, we find that continuous networks exhibit two effects---an asymmetry between on and off states, and a decaying memory of events in each element's inputs---that are absent from synchronously updated Boolean models. We show that in simple loops these effects produce exactly the attractors that one would predict with an analysis of the stability of Boolean attractors, but in slightly more complicated topologies, they can destabilize solutions that are stable in the Boolean approximation, and can stabilize new attractors. Second, we investigate ensembles of large, random networks. Of particular interest is the transition between ordered and disordered dynamics, which is well characterized in Boolean systems. Networks at the transition point, called critical, exhibit many of the features of regulatory networks, and recent studies suggest that some specific regulatory networks are indeed near-critical. We ask whether certain statistical measures of the ensemble behavior of large continuous networks are reproduced by Boolean models. We find that, in spite of the lack of correspondence between attractors observed in smaller systems, the statistical characterization given by the continuous and Boolean models show close agreement, and the transition between order and disorder known in Boolean systems can occur in continuous systems as well. One effect that is not present in Boolean systems, the failure of information to propagate down chains of elements of arbitrary length, is present in a class of continuous networks. In these systems, a modified Boolean theory that takes into account the collective effect of propagation failure on chains throughout the network gives a good description of the observed behavior. We find that propagation failure pushes the system toward greater order, resulting in a partial or complete suppression of the disordered phase. Finally, we explore a dynamical process of direct biological relevance: asymmetric cell division in A. thaliana. The long term goal is to develop a model for the process that accurately accounts for both wild type and mutant behavior. To contribute to this endeavor, we use confocal microscopy to image roots in a SHORT-ROOT inducible mutant. We compute correlation functions between the locations of asymmetrically divided cells, and we construct stochastic models based on a few simple assumptions that accurately predict the non-zero correlations. Our result shows that intracellular processes alone cannot be responsible for the observed divisions, and that an intercell signaling mechanism could account for the measured correlations.

Web-based metabolic network visualization with a zooming user interface

PubMed Central

2011-01-01

Background Displaying complex metabolic-map diagrams, for Web browsers, and allowing users to interact with them for querying and overlaying expression data over them is challenging. Description We present a Web-based metabolic-map diagram, which can be interactively explored by the user, called the Cellular Overview. The main characteristic of this application is the zooming user interface enabling the user to focus on appropriate granularities of the network at will. Various searching commands are available to visually highlight sets of reactions, pathways, enzymes, metabolites, and so on. Expression data from single or multiple experiments can be overlaid on the diagram, which we call the Omics Viewer capability. The application provides Web services to highlight the diagram and to invoke the Omics Viewer. This application is entirely written in JavaScript for the client browsers and connect to a Pathway Tools Web server to retrieve data and diagrams. It uses the OpenLayers library to display tiled diagrams. Conclusions This new online tool is capable of displaying large and complex metabolic-map diagrams in a very interactive manner. This application is available as part of the Pathway Tools software that powers multiple metabolic databases including Biocyc.org: The Cellular Overview is accessible under the Tools menu. PMID:21595965

[Complexity of social and healthcare coordination in addictions and the role of the nurse].

PubMed

Molina Fernández, Antonio Jesús; González Riera, Javier; Montero Bancalero, Francisco José; Gómez-Salgado, Juan

2016-01-01

The present article discusses the psychosocial impact of basic and advanced concepts, such as social support and prevention, as well as to establish a link between theoretical models related to the social sphere on one side, and the health aspects on the other. This work is based on the context of the influence on health shared by community psychology and social psychology. Starting from the historical background of current approaches, a review is presented of those first actions focused on the care plan and they are framed in a reaction model to the drug problem, which progressed to the current healthcare network model, through the creation of Spanish National Action Plan on Drugs. The complexity of the problem is then broken down into the following key elements: Multifactorial Model of Drugs and Addictions, importance of prevention, and social support. Subsequently, a description is presented on the different levels of the healthcare network, with their different resources. This is also illustrated using a coordination protocol. Finally, it features the nursing approach to drugs, with its contributions, particularly as regards the coordination of resources, and aspects that must be developed for improvement in this area. Copyright © 2015 Elsevier España, S.L.U. All rights reserved.

Instinctive analytics for coalition operations (Conference Presentation)

NASA Astrophysics Data System (ADS)

de Mel, Geeth R.; La Porta, Thomas; Pham, Tien; Pearson, Gavin

2017-05-01

The success of future military coalition operations—be they combat or humanitarian—will increasingly depend on a system's ability to share data and processing services (e.g. aggregation, summarization, fusion), and automatically compose services in support of complex tasks at the network edge. We call such an infrastructure instinctive—i.e., an infrastructure that reacts instinctively to address the analytics task at hand. However, developing such an infrastructure is made complex for the coalition environment due to its dynamism both in terms of user requirements and service availability. In order to address the above challenge, in this paper, we highlight our research vision and sketch some initial solutions into the problem domain. Specifically, we propose means to (1) automatically infer formal task requirements from mission specifications; (2) discover data, services, and their features automatically to satisfy the identified requirements; (3) create and augment shared domain models automatically; (4) efficiently offload services to the network edge and across coalition boundaries adhering to their computational properties and costs; and (5) optimally allocate and adjust services while respecting the constraints of operating environment and service fit. We envision that the research will result in a framework which enables self-description, discover, and assemble capabilities to both data and services in support of coalition mission goals.

Detecting complexes from edge-weighted PPI networks via genes expression analysis.

PubMed

Zhang, Zehua; Song, Jian; Tang, Jijun; Xu, Xinying; Guo, Fei

2018-04-24

Identifying complexes from PPI networks has become a key problem to elucidate protein functions and identify signal and biological processes in a cell. Proteins binding as complexes are important roles of life activity. Accurate determination of complexes in PPI networks is crucial for understanding principles of cellular organization. We propose a novel method to identify complexes on PPI networks, based on different co-expression information. First, we use Markov Cluster Algorithm with an edge-weighting scheme to calculate complexes on PPI networks. Then, we propose some significant features, such as graph information and gene expression analysis, to filter and modify complexes predicted by Markov Cluster Algorithm. To evaluate our method, we test on two experimental yeast PPI networks. On DIP network, our method has Precision and F-Measure values of 0.6004 and 0.5528. On MIPS network, our method has F-Measure and S n values of 0.3774 and 0.3453. Comparing to existing methods, our method improves Precision value by at least 0.1752, F-Measure value by at least 0.0448, S n value by at least 0.0771. Experiments show that our method achieves better results than some state-of-the-art methods for identifying complexes on PPI networks, with the prediction quality improved in terms of evaluation criteria.

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik V.; Marwan, Norbert; Dijkstra, Henk A.; Kurths, Jürgen

2015-11-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology.

Flow-pattern identification and nonlinear dynamics of gas-liquid two-phase flow in complex networks.

PubMed

Gao, Zhongke; Jin, Ningde

2009-06-01

The identification of flow pattern is a basic and important issue in multiphase systems. Because of the complexity of phase interaction in gas-liquid two-phase flow, it is difficult to discern its flow pattern objectively. In this paper, we make a systematic study on the vertical upward gas-liquid two-phase flow using complex network. Three unique network construction methods are proposed to build three types of networks, i.e., flow pattern complex network (FPCN), fluid dynamic complex network (FDCN), and fluid structure complex network (FSCN). Through detecting the community structure of FPCN by the community-detection algorithm based on K -mean clustering, useful and interesting results are found which can be used for identifying five vertical upward gas-liquid two-phase flow patterns. To investigate the dynamic characteristics of gas-liquid two-phase flow, we construct 50 FDCNs under different flow conditions, and find that the power-law exponent and the network information entropy, which are sensitive to the flow pattern transition, can both characterize the nonlinear dynamics of gas-liquid two-phase flow. Furthermore, we construct FSCN and demonstrate how network statistic can be used to reveal the fluid structure of gas-liquid two-phase flow. In this paper, from a different perspective, we not only introduce complex network theory to the study of gas-liquid two-phase flow but also indicate that complex network may be a powerful tool for exploring nonlinear time series in practice.

A Novel BA Complex Network Model on Color Template Matching

PubMed Central

Han, Risheng; Yue, Guangxue; Ding, Hui

2014-01-01

A novel BA complex network model of color space is proposed based on two fundamental rules of BA scale-free network model: growth and preferential attachment. The scale-free characteristic of color space is discovered by analyzing evolving process of template's color distribution. And then the template's BA complex network model can be used to select important color pixels which have much larger effects than other color pixels in matching process. The proposed BA complex network model of color space can be easily integrated into many traditional template matching algorithms, such as SSD based matching and SAD based matching. Experiments show the performance of color template matching results can be improved based on the proposed algorithm. To the best of our knowledge, this is the first study about how to model the color space of images using a proper complex network model and apply the complex network model to template matching. PMID:25243235

A novel BA complex network model on color template matching.

PubMed

Han, Risheng; Shen, Shigen; Yue, Guangxue; Ding, Hui

2014-01-01

A novel BA complex network model of color space is proposed based on two fundamental rules of BA scale-free network model: growth and preferential attachment. The scale-free characteristic of color space is discovered by analyzing evolving process of template's color distribution. And then the template's BA complex network model can be used to select important color pixels which have much larger effects than other color pixels in matching process. The proposed BA complex network model of color space can be easily integrated into many traditional template matching algorithms, such as SSD based matching and SAD based matching. Experiments show the performance of color template matching results can be improved based on the proposed algorithm. To the best of our knowledge, this is the first study about how to model the color space of images using a proper complex network model and apply the complex network model to template matching.

Discovering Link Communities in Complex Networks by an Integer Programming Model and a Genetic Algorithm

PubMed Central

Li, Zhenping; Zhang, Xiang-Sun; Wang, Rui-Sheng; Liu, Hongwei; Zhang, Shihua

2013-01-01

Identification of communities in complex networks is an important topic and issue in many fields such as sociology, biology, and computer science. Communities are often defined as groups of related nodes or links that correspond to functional subunits in the corresponding complex systems. While most conventional approaches have focused on discovering communities of nodes, some recent studies start partitioning links to find overlapping communities straightforwardly. In this paper, we propose a new quantity function for link community identification in complex networks. Based on this quantity function we formulate the link community partition problem into an integer programming model which allows us to partition a complex network into overlapping communities. We further propose a genetic algorithm for link community detection which can partition a network into overlapping communities without knowing the number of communities. We test our model and algorithm on both artificial networks and real-world networks. The results demonstrate that the model and algorithm are efficient in detecting overlapping community structure in complex networks. PMID:24386268

An Evaluation Network for Educational Change.

ERIC Educational Resources Information Center

Marchesi, Alvaro; Martin, Elena; Martinez Arias, Rosario; Tiana, Alejandro; Moreno, Amparo

2003-01-01

Describes the experience of an evaluation network being put into practice in Spain to encourage educational change. Outlines the most relevant conditions needed for educational change and develops the description of a school evaluation network that includes all the previously described conditions. (SLD)

Minimal perceptrons for memorizing complex patterns

NASA Astrophysics Data System (ADS)

Pastor, Marissa; Song, Juyong; Hoang, Danh-Tai; Jo, Junghyo

2016-11-01

Feedforward neural networks have been investigated to understand learning and memory, as well as applied to numerous practical problems in pattern classification. It is a rule of thumb that more complex tasks require larger networks. However, the design of optimal network architectures for specific tasks is still an unsolved fundamental problem. In this study, we consider three-layered neural networks for memorizing binary patterns. We developed a new complexity measure of binary patterns, and estimated the minimal network size for memorizing them as a function of their complexity. We formulated the minimal network size for regular, random, and complex patterns. In particular, the minimal size for complex patterns, which are neither ordered nor disordered, was predicted by measuring their Hamming distances from known ordered patterns. Our predictions agree with simulations based on the back-propagation algorithm.

Dynamic Channel Network Extraction from Satellite Imagery of the Jamuna River

NASA Astrophysics Data System (ADS)

Addink, E. A.; Marra, W. A.; Kleinhans, M. G.

2010-12-01

Evolution of the largest rivers on Earth is poorly understood while their response to global change is dramatic, such as severe drought and flooding problems. Rivers with high annual dynamics, like the Jamuna, allow us to study their response to changing conditions. Most remote-sensing work so far focused only on pixel-based analysis of channels and change detection or manual digitisation of channels, which is far from urgently needed quantifiers of pattern and pattern change. Using a series of Landsat TM images taken at irregular intervals showing inter- and intra-annual variation, we demonstrate that braided rivers can be represented as nearly chain-like directional networks. These can be studied with novel methods gleaned from neurology. These networks provide an integral spatial description of the network and should not be confused with hierarchical hydrological stream network descriptions developed in the ’60s to describe drainage basins. The images were first classified into water, bare sediment and vegetation. The contiguous water body of the river was then selected and translated into a network description with bifurcations and confluences at the nodes, and interconnecting channels. Along the entire river the well-known braiding indices were derived from the network. The channel width is a crucial attribute of the channel network as this allows the calculation of bifurcation asymmetry. The width was also used with channel length as weights to all the elements in the network in the calculation of more advanced measures for the nature and evolution of the channel network. The key step here is to describe river network evolution by identifying the same node in multiple subsequent images as well as new and abandoned nodes, in order to distinguish migration of bifurcations from avulsion processes. Once identified through time, the changes in node position and the changes in the connected channels can be quantified. These changes can potentially be linked to channel migration and vegetation cover along the channels. A network evolves in time by adding or removing channels and their bifurcation- and confluence couples. Using the network topology, we quantified network properties such as `centrality’, which provides a measure for the overall importance of individual channels in a network. This is a novel and robust indicator to assess the effect of a change or engineering measure in a channel on the entire network. The physical basis for downstream propagation of information through a fluvial network is the flood conveyance and sediment transport, and for upstream propagation it is the backwater effect. Using the dynamic network description we can start quantifying the effects of local changes in the network on the entire upstream and downstream network. We conclude that the developed workflow allows the use of novel and useful measures borrowed from other sciences in river network analysis, and provides, e.g., the assessment of the importance of individual branches in a large complicated network.

Filtering Gene Ontology semantic similarity for identifying protein complexes in large protein interaction networks.

PubMed

Wang, Jian; Xie, Dong; Lin, Hongfei; Yang, Zhihao; Zhang, Yijia

2012-06-21

Many biological processes recognize in particular the importance of protein complexes, and various computational approaches have been developed to identify complexes from protein-protein interaction (PPI) networks. However, high false-positive rate of PPIs leads to challenging identification. A protein semantic similarity measure is proposed in this study, based on the ontology structure of Gene Ontology (GO) terms and GO annotations to estimate the reliability of interactions in PPI networks. Interaction pairs with low GO semantic similarity are removed from the network as unreliable interactions. Then, a cluster-expanding algorithm is used to detect complexes with core-attachment structure on filtered network. Our method is applied to three different yeast PPI networks. The effectiveness of our method is examined on two benchmark complex datasets. Experimental results show that our method performed better than other state-of-the-art approaches in most evaluation metrics. The method detects protein complexes from large scale PPI networks by filtering GO semantic similarity. Removing interactions with low GO similarity significantly improves the performance of complex identification. The expanding strategy is also effective to identify attachment proteins of complexes.

An experimental paradigm for team decision processes

NASA Technical Reports Server (NTRS)

Serfaty, D.; Kleinman, D. L.

1986-01-01

The study of distributed information processing and decision making is presently hampered by two factors: (1) The inherent complexity of the mathematical formulation of decentralized problems has prevented the development of models that could be used to predict performance in a distributed environment; and (2) The lack of comprehensive scientific empirical data on human team decision making has hindered the development of significant descriptive models. As a part of a comprehensive effort to find a new framework for multihuman decision making problems, a novel experimental research paradigm was developed involving human terms in decision making tasks. Attempts to construct parts of an integrated model with ideas from queueing networks, team theory, distributed estimation and decentralized resource management are described.

A tool for exploring the dynamics of innovative interventions for public health: the critical event card.

PubMed

Figueiro, Ana Claudia; de Araújo Oliveira, Sydia Rosana; Hartz, Zulmira; Couturier, Yves; Bernier, Jocelyne; do Socorro Machado Freire, Maria; Samico, Isabella; Medina, Maria Guadalupe; de Sa, Ronice Franco; Potvin, Louise

2017-03-01

Public health interventions are increasingly represented as complex systems. Research tools for capturing the dynamic of interventions processes, however, are practically non-existent. This paper describes the development and proof of concept process of an analytical tool, the critical event card (CEC), which supports the representation and analysis of complex interventions' evolution, based on critical events. Drawing on the actor-network theory (ANT), we developed and field-tested the tool using three innovative health interventions in northeastern Brazil. Interventions were aimed to promote health equity through intersectoral approaches; were engaged in participatory evaluation and linked to professional training programs. The CEC developing involve practitioners and researchers from projects. Proof of concept was based on document analysis, face-to-face interviews and focus groups. Analytical categories from CEC allow identifying and describing critical events as milestones in the evolution of complex interventions. Categories are (1) event description; (2) actants (human and non-human) involved; (3) interactions between actants; (4) mediations performed; (5) actions performed; (6) inscriptions produced; and (7) consequences for interventions. The CEC provides a tool to analyze and represent intersectoral internvetions' complex and dynamic evolution.

Quantification of gait parameters in freely walking wild type and sensory deprived Drosophila melanogaster

PubMed Central

Mendes, César S; Bartos, Imre; Akay, Turgay; Márka, Szabolcs; Mann, Richard S

2013-01-01

Coordinated walking in vertebrates and multi-legged invertebrates such as Drosophila melanogaster requires a complex neural network coupled to sensory feedback. An understanding of this network will benefit from systems such as Drosophila that have the ability to genetically manipulate neural activities. However, the fly's small size makes it challenging to analyze walking in this system. In order to overcome this limitation, we developed an optical method coupled with high-speed imaging that allows the tracking and quantification of gait parameters in freely walking flies with high temporal and spatial resolution. Using this method, we present a comprehensive description of many locomotion parameters, such as gait, tarsal positioning, and intersegmental and left-right coordination for wild type fruit flies. Surprisingly, we find that inactivation of sensory neurons in the fly's legs, to block proprioceptive feedback, led to deficient step precision, but interleg coordination and the ability to execute a tripod gait were unaffected. DOI: http://dx.doi.org/10.7554/eLife.00231.001 PMID:23326642

Advances in the Theory of Complex Networks

NASA Astrophysics Data System (ADS)

Peruani, Fernando

An exhaustive and comprehensive review on the theory of complex networks would imply nowadays a titanic task, and it would result in a lengthy work containing plenty of technical details of arguable relevance. Instead, this chapter addresses very briefly the ABC of complex network theory, visiting only the hallmarks of the theoretical founding, to finally focus on two of the most interesting and promising current research problems: the study of dynamical processes on transportation networks and the identification of communities in complex networks.

Complex network construction based on user group attention sequence

NASA Astrophysics Data System (ADS)

Zhang, Gaowei; Xu, Lingyu; Wang, Lei

2018-04-01

In the traditional complex network construction, it is often to use the similarity between nodes, build the weight of the network, and finally build the network. However, this approach tends to focus only on the coupling between nodes, while ignoring the information transfer between nodes and the transfer of directionality. In the network public opinion space, based on the set of stock series that the network groups pay attention to within a certain period of time, we vectorize the different stocks and build a complex network.

Asynchronous networks: modularization of dynamics theorem

NASA Astrophysics Data System (ADS)

Bick, Christian; Field, Michael

2017-02-01

Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.

Identification of hybrid node and link communities in complex networks

PubMed Central

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-01-01

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately. PMID:25728010

Identification of hybrid node and link communities in complex networks.

PubMed

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-03-02

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

Identification of hybrid node and link communities in complex networks

NASA Astrophysics Data System (ADS)

He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

2015-03-01

Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

Online Community Detection for Large Complex Networks

PubMed Central

Pan, Gang; Zhang, Wangsheng; Wu, Zhaohui; Li, Shijian

2014-01-01

Complex networks describe a wide range of systems in nature and society. To understand complex networks, it is crucial to investigate their community structure. In this paper, we develop an online community detection algorithm with linear time complexity for large complex networks. Our algorithm processes a network edge by edge in the order that the network is fed to the algorithm. If a new edge is added, it just updates the existing community structure in constant time, and does not need to re-compute the whole network. Therefore, it can efficiently process large networks in real time. Our algorithm optimizes expected modularity instead of modularity at each step to avoid poor performance. The experiments are carried out using 11 public data sets, and are measured by two criteria, modularity and NMI (Normalized Mutual Information). The results show that our algorithm's running time is less than the commonly used Louvain algorithm while it gives competitive performance. PMID:25061683

Pruning artificial neural networks using neural complexity measures.

PubMed

Jorgensen, Thomas D; Haynes, Barry P; Norlund, Charlotte C F

2008-10-01

This paper describes a new method for pruning artificial neural networks, using a measure of the neural complexity of the neural network. This measure is used to determine the connections that should be pruned. The measure computes the information-theoretic complexity of a neural network, which is similar to, yet different from previous research on pruning. The method proposed here shows how overly large and complex networks can be reduced in size, whilst retaining learnt behaviour and fitness. The technique proposed here helps to discover a network topology that matches the complexity of the problem it is meant to solve. This novel pruning technique is tested in a robot control domain, simulating a racecar. It is shown, that the proposed pruning method is a significant improvement over the most commonly used pruning method Magnitude Based Pruning. Furthermore, some of the pruned networks prove to be faster learners than the benchmark network that they originate from. This means that this pruning method can also help to unleash hidden potential in a network, because the learning time decreases substantially for a pruned a network, due to the reduction of dimensionality of the network.

Evolving Scale-Free Networks by Poisson Process: Modeling and Degree Distribution.

PubMed

Feng, Minyu; Qu, Hong; Yi, Zhang; Xie, Xiurui; Kurths, Jurgen

2016-05-01

Since the great mathematician Leonhard Euler initiated the study of graph theory, the network has been one of the most significant research subject in multidisciplinary. In recent years, the proposition of the small-world and scale-free properties of complex networks in statistical physics made the network science intriguing again for many researchers. One of the challenges of the network science is to propose rational models for complex networks. In this paper, in order to reveal the influence of the vertex generating mechanism of complex networks, we propose three novel models based on the homogeneous Poisson, nonhomogeneous Poisson and birth death process, respectively, which can be regarded as typical scale-free networks and utilized to simulate practical networks. The degree distribution and exponent are analyzed and explained in mathematics by different approaches. In the simulation, we display the modeling process, the degree distribution of empirical data by statistical methods, and reliability of proposed networks, results show our models follow the features of typical complex networks. Finally, some future challenges for complex systems are discussed.

Using complex networks to characterize international business cycles.

PubMed

Caraiani, Petre

2013-01-01

There is a rapidly expanding literature on the application of complex networks in economics that focused mostly on stock markets. In this paper, we discuss an application of complex networks to study international business cycles. We construct complex networks based on GDP data from two data sets on G7 and OECD economies. Besides the well-known correlation-based networks, we also use a specific tool for presenting causality in economics, the Granger causality. We consider different filtering methods to derive the stationary component of the GDP series for each of the countries in the samples. The networks were found to be sensitive to the detrending method. While the correlation networks provide information on comovement between the national economies, the Granger causality networks can better predict fluctuations in countries' GDP. By using them, we can obtain directed networks allows us to determine the relative influence of different countries on the global economy network. The US appears as the key player for both the G7 and OECD samples. The use of complex networks is valuable for understanding the business cycle comovements at an international level.

Nuclear charge radii: density functional theory meets Bayesian neural networks

NASA Astrophysics Data System (ADS)

Utama, R.; Chen, Wei-Chia; Piekarewicz, J.

2016-11-01

The distribution of electric charge in atomic nuclei is fundamental to our understanding of the complex nuclear dynamics and a quintessential observable to validate nuclear structure models. The aim of this study is to explore a novel approach that combines sophisticated models of nuclear structure with Bayesian neural networks (BNN) to generate predictions for the charge radii of thousands of nuclei throughout the nuclear chart. A class of relativistic energy density functionals is used to provide robust predictions for nuclear charge radii. In turn, these predictions are refined through Bayesian learning for a neural network that is trained using residuals between theoretical predictions and the experimental data. Although predictions obtained with density functional theory provide a fairly good description of experiment, our results show significant improvement (better than 40%) after BNN refinement. Moreover, these improved results for nuclear charge radii are supplemented with theoretical error bars. We have successfully demonstrated the ability of the BNN approach to significantly increase the accuracy of nuclear models in the predictions of nuclear charge radii. However, as many before us, we failed to uncover the underlying physics behind the intriguing behavior of charge radii along the calcium isotopic chain.

Inner-City Networking: Models and Opportunities.

ERIC Educational Resources Information Center

Sparrow, Judith; Vedantham, Anu

1995-01-01

Explores possibilities of inner-city networking, and provides a description of the federal government's Telecommunications and Information Infrastructure Assistance Program (TIIAP). The authors also enumerate the challenges faced by inner-city communities establishing such networks and describes TIIAP-funded programs meeting those challenges that…

7 CFR 1738.212 - Network design.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 11 2012-01-01 2012-01-01 false Network design. 1738.212 Section 1738.212 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE... the proposed network infrastructure; (4) A description of measurable service metrics and target...

7 CFR 1738.212 - Network design.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 11 2013-01-01 2013-01-01 false Network design. 1738.212 Section 1738.212 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE... the proposed network infrastructure; (4) A description of measurable service metrics and target...

7 CFR 1738.212 - Network design.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 11 2014-01-01 2014-01-01 false Network design. 1738.212 Section 1738.212 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE... the proposed network infrastructure; (4) A description of measurable service metrics and target...

A novel method for identifying disease associated protein complexes based on functional similarity protein complex networks.

PubMed

Le, Duc-Hau

2015-01-01

Protein complexes formed by non-covalent interaction among proteins play important roles in cellular functions. Computational and purification methods have been used to identify many protein complexes and their cellular functions. However, their roles in terms of causing disease have not been well discovered yet. There exist only a few studies for the identification of disease-associated protein complexes. However, they mostly utilize complicated heterogeneous networks which are constructed based on an out-of-date database of phenotype similarity network collected from literature. In addition, they only apply for diseases for which tissue-specific data exist. In this study, we propose a method to identify novel disease-protein complex associations. First, we introduce a framework to construct functional similarity protein complex networks where two protein complexes are functionally connected by either shared protein elements, shared annotating GO terms or based on protein interactions between elements in each protein complex. Second, we propose a simple but effective neighborhood-based algorithm, which yields a local similarity measure, to rank disease candidate protein complexes. Comparing the predictive performance of our proposed algorithm with that of two state-of-the-art network propagation algorithms including one we used in our previous study, we found that it performed statistically significantly better than that of these two algorithms for all the constructed functional similarity protein complex networks. In addition, it ran about 32 times faster than these two algorithms. Moreover, our proposed method always achieved high performance in terms of AUC values irrespective of the ways to construct the functional similarity protein complex networks and the used algorithms. The performance of our method was also higher than that reported in some existing methods which were based on complicated heterogeneous networks. Finally, we also tested our method with prostate cancer and selected the top 100 highly ranked candidate protein complexes. Interestingly, 69 of them were evidenced since at least one of their protein elements are known to be associated with prostate cancer. Our proposed method, including the framework to construct functional similarity protein complex networks and the neighborhood-based algorithm on these networks, could be used for identification of novel disease-protein complex associations.

Neural electrical activity and neural network growth.

PubMed

Gafarov, F M

2018-05-01

The development of central and peripheral neural system depends in part on the emergence of the correct functional connectivity in its input and output pathways. Now it is generally accepted that molecular factors guide neurons to establish a primary scaffold that undergoes activity-dependent refinement for building a fully functional circuit. However, a number of experimental results obtained recently shows that the neuronal electrical activity plays an important role in the establishing of initial interneuronal connections. Nevertheless, these processes are rather difficult to study experimentally, due to the absence of theoretical description and quantitative parameters for estimation of the neuronal activity influence on growth in neural networks. In this work we propose a general framework for a theoretical description of the activity-dependent neural network growth. The theoretical description incorporates a closed-loop growth model in which the neural activity can affect neurite outgrowth, which in turn can affect neural activity. We carried out the detailed quantitative analysis of spatiotemporal activity patterns and studied the relationship between individual cells and the network as a whole to explore the relationship between developing connectivity and activity patterns. The model, developed in this work will allow us to develop new experimental techniques for studying and quantifying the influence of the neuronal activity on growth processes in neural networks and may lead to a novel techniques for constructing large-scale neural networks by self-organization. Copyright © 2018 Elsevier Ltd. All rights reserved.

A qualitative case study in the social capital of co-professional collaborative co-practice for children with speech, language and communication needs.

PubMed

McKean, Cristina; Law, James; Laing, Karen; Cockerill, Maria; Allon-Smith, Jan; McCartney, Elspeth; Forbes, Joan

2017-07-01

Effective co-practice is essential to deliver services for children with speech, language and communication needs (SLCN). The necessary skills, knowledge and resources are distributed amongst professionals and agencies. Co-practice is complex and a number of barriers, such as 'border disputes' and poor awareness of respective priorities, have been identified. However social-relational aspects of co-practice have not been explored in sufficient depth to make recommendations for improvements in policy and practice. Here we apply social capital theory to data from practitioners: an analytical framework with the potential to move beyond descriptions of socio-cultural phenomena to inform change. Co-practice in a local authority site was examined to understand: (1) the range of social capital relations extant in the site's co-practice; (2) how these relations affected the abilities of the network to collaborate; (3) whether previously identified barriers to co-practice remain; (4) the nature of any new complexities that may have emerged; and (5) how inter-professional social capital might be fostered. A qualitative case study of SLCN provision within one local authority in England and its linked NHS partner was completed through face-to-face semi-structured interviews with professionals working with children with SLCN across the authority. Interviews, exploring barriers and facilitators to interagency working and social capital themes, were transcribed, subjected to thematic analysis using iterative methods and a thematic framework derived. We identified a number of characteristics important for the effective development of trust, reciprocity and negotiated co-practice at different levels of social capital networks: macro-service governance and policy; meso-school sites; and micro-intra-practitioner knowledge and skills. Barriers to co-practice differed from those found in earlier studies. Some negative aspects of complexity were evident, but only where networked professionalism and trust was absent between professions. Where practitioners embraced and services and systems enabled more fluid forms of collaboration, then trust and reciprocity developed. Highly collaborative forms of co-practice, inherently more complex at the service governance, macro-level, bring benefits. At the meso-level of the school and support team network there was greater capacity to individualize co-practice to the needs of the child. Capacity was increased at the micro-level of knowledge and skills to harness the overall resource distributed amongst members of the inter-professional team. The development of social capital, networks of trust across SLCN support teams, should be a priority at all levels-for practitioners, services, commissioners and schools. © 2016 Royal College of Speech and Language Therapists.

Network complexity as a measure of information processing across resting-state networks: evidence from the Human Connectome Project

PubMed Central

McDonough, Ian M.; Nashiro, Kaoru

2014-01-01

An emerging field of research focused on fluctuations in brain signals has provided evidence that the complexity of those signals, as measured by entropy, conveys important information about network dynamics (e.g., local and distributed processing). While much research has focused on how neural complexity differs in populations with different age groups or clinical disorders, substantially less research has focused on the basic understanding of neural complexity in populations with young and healthy brain states. The present study used resting-state fMRI data from the Human Connectome Project (Van Essen et al., 2013) to test the extent that neural complexity in the BOLD signal, as measured by multiscale entropy (1) would differ from random noise, (2) would differ between four major resting-state networks previously associated with higher-order cognition, and (3) would be associated with the strength and extent of functional connectivity—a complementary method of estimating information processing. We found that complexity in the BOLD signal exhibited different patterns of complexity from white, pink, and red noise and that neural complexity was differentially expressed between resting-state networks, including the default mode, cingulo-opercular, left and right frontoparietal networks. Lastly, neural complexity across all networks was negatively associated with functional connectivity at fine scales, but was positively associated with functional connectivity at coarse scales. The present study is the first to characterize neural complexity in BOLD signals at a high temporal resolution and across different networks and might help clarify the inconsistencies between neural complexity and functional connectivity, thus informing the mechanisms underlying neural complexity. PMID:24959130

Investigation of a protein complex network

NASA Astrophysics Data System (ADS)

Mashaghi, A. R.; Ramezanpour, A.; Karimipour, V.

2004-09-01

The budding yeast Saccharomyces cerevisiae is the first eukaryote whose genome has been completely sequenced. It is also the first eukaryotic cell whose proteome (the set of all proteins) and interactome (the network of all mutual interactions between proteins) has been analyzed. In this paper we study the structure of the yeast protein complex network in which weighted edges between complexes represent the number of shared proteins. It is found that the network of protein complexes is a small world network with scale free behavior for many of its distributions. However we find that there are no strong correlations between the weights and degrees of neighboring complexes. To reveal non-random features of the network we also compare it with a null model in which the complexes randomly select their proteins. Finally we propose a simple evolutionary model based on duplication and divergence of proteins.

The Deep Space Network

NASA Technical Reports Server (NTRS)

1977-01-01

The various systems and subsystems are discussed for the Deep Space Network (DSN). A description of the DSN is presented along with mission support, program planning, facility engineering, implementation and operations.

A perspective on the advancement of natural language processing tasks via topological analysis of complex networks. Comment on "Approaching human language with complex networks" by Cong and Liu

NASA Astrophysics Data System (ADS)

Amancio, Diego Raphael

2014-12-01

Concepts and methods of complex networks have been applied to probe the properties of a myriad of real systems [1]. The finding that written texts modeled as graphs share several properties of other completely different real systems has inspired the study of language as a complex system [2]. Actually, language can be represented as a complex network in its several levels of complexity. As a consequence, morphological, syntactical and semantical properties have been employed in the construction of linguistic networks [3]. Even the character level has been useful to unfold particular patterns [4,5]. In the review by Cong and Liu [6], the authors emphasize the need to use the topological information of complex networks modeling the various spheres of the language to better understand its origins, evolution and organization. In addition, the authors cite the use of networks in applications aiming at holistic typology and stylistic variations. In this context, I will discuss some possible directions that could be followed in future research directed towards the understanding of language via topological characterization of complex linguistic networks. In addition, I will comment the use of network models for language processing applications. Additional prospects for future practical research lines will also be discussed in this comment.

Maximizing information exchange between complex networks

NASA Astrophysics Data System (ADS)

West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo

2008-10-01

Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain’s response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of modern research overarching all of the traditional scientific disciplines. The transportation networks of planes, highways and railroads; the economic networks of global finance and stock markets; the social networks of terrorism, governments, businesses and churches; the physical networks of telephones, the Internet, earthquakes and global warming and the biological networks of gene regulation, the human body, clusters of neurons and food webs, share a number of apparently universal properties as the networks become increasingly complex. Ubiquitous aspects of such complex networks are the appearance of non-stationary and non-ergodic statistical processes and inverse power-law statistical distributions. Herein we review the traditional dynamical and phase-space methods for modeling such networks as their complexity increases and focus on the limitations of these procedures in explaining complex networks. Of course we will not be able to review the entire nascent field of network science, so we limit ourselves to a review of how certain complexity barriers have been surmounted using newly applied theoretical concepts such as aging, renewal, non-ergodic statistics and the fractional calculus. One emphasis of this review is information transport between complex networks, which requires a fundamental change in perception that we express as a transition from the familiar stochastic resonance to the new concept of complexity matching.

Structural complexity, movement bias, and metapopulation extinction risk in dendritic ecological networks

USGS Publications Warehouse

Campbell Grant, Evan H.

2011-01-01

Spatial complexity in metacommunities can be separated into 3 main components: size (i.e., number of habitat patches), spatial arrangement of habitat patches (network topology), and diversity of habitat patch types. Much attention has been paid to lattice-type networks, such as patch-based metapopulations, but interest in understanding ecological networks of alternative geometries is building. Dendritic ecological networks (DENs) include some increasingly threatened ecological systems, such as caves and streams. The restrictive architecture of dendritic ecological networks might have overriding implications for species persistence. I used a modeling approach to investigate how number and spatial arrangement of habitat patches influence metapopulation extinction risk in 2 DENs of different size and topology. Metapopulation persistence was higher in larger networks, but this relationship was mediated by network topology and the dispersal pathways used to navigate the network. Larger networks, especially those with greater topological complexity, generally had lower extinction risk than smaller and less-complex networks, but dispersal bias and magnitude affected the shape of this relationship. Applying these general results to real systems will require empirical data on the movement behavior of organisms and will improve our understanding of the implications of network complexity on population and community patterns and processes.

Predictive minimum description length principle approach to inferring gene regulatory networks.

PubMed

Chaitankar, Vijender; Zhang, Chaoyang; Ghosh, Preetam; Gong, Ping; Perkins, Edward J; Deng, Youping

2011-01-01

Reverse engineering of gene regulatory networks using information theory models has received much attention due to its simplicity, low computational cost, and capability of inferring large networks. One of the major problems with information theory models is to determine the threshold that defines the regulatory relationships between genes. The minimum description length (MDL) principle has been implemented to overcome this problem. The description length of the MDL principle is the sum of model length and data encoding length. A user-specified fine tuning parameter is used as control mechanism between model and data encoding, but it is difficult to find the optimal parameter. In this work, we propose a new inference algorithm that incorporates mutual information (MI), conditional mutual information (CMI), and predictive minimum description length (PMDL) principle to infer gene regulatory networks from DNA microarray data. In this algorithm, the information theoretic quantities MI and CMI determine the regulatory relationships between genes and the PMDL principle method attempts to determine the best MI threshold without the need of a user-specified fine tuning parameter. The performance of the proposed algorithm is evaluated using both synthetic time series data sets and a biological time series data set (Saccharomyces cerevisiae). The results show that the proposed algorithm produced fewer false edges and significantly improved the precision when compared to existing MDL algorithm.

The deep space network

NASA Technical Reports Server (NTRS)

1974-01-01

The progress is reported of Deep Space Network (DSN) research in the following areas: (1) flight project support, (2) spacecraft/ground communications, (3) station control and operations technology, (4) network control and processing, and (5) deep space stations. A description of the DSN functions and facilities is included.

Is There a Global Role for Metropolitan City Libraries?

ERIC Educational Resources Information Center

Mason, Marilyn Gell

1994-01-01

Discusses the potential for linking large metropolitan public libraries to international interlibrary loan networks. Issues involved in international networking, including funding, standards, network connectivity, and protectionism, are discussed. Examples of libraries capable of participating and brief descriptions of their collections are given.…

A new way to improve the robustness of complex communication networks by allocating redundancy links

NASA Astrophysics Data System (ADS)

Shi, Chunhui; Peng, Yunfeng; Zhuo, Yue; Tang, Jieying; Long, Keping

2012-03-01

We investigate the robustness of complex communication networks on allocating redundancy links. The protecting key nodes (PKN) strategy is proposed to improve the robustness of complex communication networks against intentional attack. Our numerical simulations show that allocating a few redundant links among key nodes using the PKN strategy will significantly increase the robustness of scale-free complex networks. We have also theoretically proved and demonstrated the effectiveness of the PKN strategy. We expect that our work will help achieve a better understanding of communication networks.

A density-based clustering model for community detection in complex networks

NASA Astrophysics Data System (ADS)

Zhao, Xiang; Li, Yantao; Qu, Zehui

2018-04-01

Network clustering (or graph partitioning) is an important technique for uncovering the underlying community structures in complex networks, which has been widely applied in various fields including astronomy, bioinformatics, sociology, and bibliometric. In this paper, we propose a density-based clustering model for community detection in complex networks (DCCN). The key idea is to find group centers with a higher density than their neighbors and a relatively large integrated-distance from nodes with higher density. The experimental results indicate that our approach is efficient and effective for community detection of complex networks.

A depth-first search algorithm to compute elementary flux modes by linear programming.

PubMed

Quek, Lake-Ee; Nielsen, Lars K

2014-07-30

The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand. Based on an alternative elementarity test, we developed a depth-first search algorithm using linear programming (LP) to enumerate EFMs in an exhaustive fashion. Constraints can be introduced to directly generate a subset of EFMs satisfying the set of constraints. The depth-first search algorithm has a constant memory overhead. Using flux constraints, a large LP problem can be massively divided and parallelized into independent sub-jobs for deployment into computing clusters. Since the sub-jobs do not overlap, the approach scales to utilize all available computing nodes with minimal coordination overhead or memory limitations. The speed of the algorithm was comparable to efmtool, a mainstream Double Description method, when enumerating all EFMs; the attrition power gained from performing flux feasibility tests offsets the increased computational demand of running an LP solver. Unlike the Double Description method, the algorithm enables accelerated enumeration of all EFMs satisfying a set of constraints.

Autoscoring Essays Based on Complex Networks

ERIC Educational Resources Information Center

Ke, Xiaohua; Zeng, Yongqiang; Luo, Haijiao

2016-01-01

This article presents a novel method, the Complex Dynamics Essay Scorer (CDES), for automated essay scoring using complex network features. Texts produced by college students in China were represented as scale-free networks (e.g., a word adjacency model) from which typical network features, such as the in-/out-degrees, clustering coefficient (CC),…

A balanced memory network.

PubMed

Roudi, Yasser; Latham, Peter E

2007-09-01

A fundamental problem in neuroscience is understanding how working memory--the ability to store information at intermediate timescales, like tens of seconds--is implemented in realistic neuronal networks. The most likely candidate mechanism is the attractor network, and a great deal of effort has gone toward investigating it theoretically. Yet, despite almost a quarter century of intense work, attractor networks are not fully understood. In particular, there are still two unanswered questions. First, how is it that attractor networks exhibit irregular firing, as is observed experimentally during working memory tasks? And second, how many memories can be stored under biologically realistic conditions? Here we answer both questions by studying an attractor neural network in which inhibition and excitation balance each other. Using mean-field analysis, we derive a three-variable description of attractor networks. From this description it follows that irregular firing can exist only if the number of neurons involved in a memory is large. The same mean-field analysis also shows that the number of memories that can be stored in a network scales with the number of excitatory connections, a result that has been suggested for simple models but never shown for realistic ones. Both of these predictions are verified using simulations with large networks of spiking neurons.

Offdiagonal complexity: A computationally quick complexity measure for graphs and networks

NASA Astrophysics Data System (ADS)

Claussen, Jens Christian

2007-02-01

A vast variety of biological, social, and economical networks shows topologies drastically differing from random graphs; yet the quantitative characterization remains unsatisfactory from a conceptual point of view. Motivated from the discussion of small scale-free networks, a biased link distribution entropy is defined, which takes an extremum for a power-law distribution. This approach is extended to the node-node link cross-distribution, whose nondiagonal elements characterize the graph structure beyond link distribution, cluster coefficient and average path length. From here a simple (and computationally cheap) complexity measure can be defined. This offdiagonal complexity (OdC) is proposed as a novel measure to characterize the complexity of an undirected graph, or network. While both for regular lattices and fully connected networks OdC is zero, it takes a moderately low value for a random graph and shows high values for apparently complex structures as scale-free networks and hierarchical trees. The OdC approach is applied to the Helicobacter pylori protein interaction network and randomly rewired surrogates.

Protein complex prediction in large ontology attributed protein-protein interaction networks.

PubMed

Zhang, Yijia; Lin, Hongfei; Yang, Zhihao; Wang, Jian; Li, Yanpeng; Xu, Bo

2013-01-01

Protein complexes are important for unraveling the secrets of cellular organization and function. Many computational approaches have been developed to predict protein complexes in protein-protein interaction (PPI) networks. However, most existing approaches focus mainly on the topological structure of PPI networks, and largely ignore the gene ontology (GO) annotation information. In this paper, we constructed ontology attributed PPI networks with PPI data and GO resource. After constructing ontology attributed networks, we proposed a novel approach called CSO (clustering based on network structure and ontology attribute similarity). Structural information and GO attribute information are complementary in ontology attributed networks. CSO can effectively take advantage of the correlation between frequent GO annotation sets and the dense subgraph for protein complex prediction. Our proposed CSO approach was applied to four different yeast PPI data sets and predicted many well-known protein complexes. The experimental results showed that CSO was valuable in predicting protein complexes and achieved state-of-the-art performance.

Multi-frequency complex network from time series for uncovering oil-water flow structure.

PubMed

Gao, Zhong-Ke; Yang, Yu-Xuan; Fang, Peng-Cheng; Jin, Ning-De; Xia, Cheng-Yi; Hu, Li-Dan

2015-02-04

Uncovering complex oil-water flow structure represents a challenge in diverse scientific disciplines. This challenge stimulates us to develop a new distributed conductance sensor for measuring local flow signals at different positions and then propose a novel approach based on multi-frequency complex network to uncover the flow structures from experimental multivariate measurements. In particular, based on the Fast Fourier transform, we demonstrate how to derive multi-frequency complex network from multivariate time series. We construct complex networks at different frequencies and then detect community structures. Our results indicate that the community structures faithfully represent the structural features of oil-water flow patterns. Furthermore, we investigate the network statistic at different frequencies for each derived network and find that the frequency clustering coefficient enables to uncover the evolution of flow patterns and yield deep insights into the formation of flow structures. Current results present a first step towards a network visualization of complex flow patterns from a community structure perspective.

Identifying protein complexes in PPI network using non-cooperative sequential game.

PubMed

Maulik, Ujjwal; Basu, Srinka; Ray, Sumanta

2017-08-21

Identifying protein complexes from protein-protein interaction (PPI) network is an important and challenging task in computational biology as it helps in better understanding of cellular mechanisms in various organisms. In this paper we propose a noncooperative sequential game based model for protein complex detection from PPI network. The key hypothesis is that protein complex formation is driven by mechanism that eventually optimizes the number of interactions within the complex leading to dense subgraph. The hypothesis is drawn from the observed network property named small world. The proposed multi-player game model translates the hypothesis into the game strategies. The Nash equilibrium of the game corresponds to a network partition where each protein either belong to a complex or form a singleton cluster. We further propose an algorithm to find the Nash equilibrium of the sequential game. The exhaustive experiment on synthetic benchmark and real life yeast networks evaluates the structural as well as biological significance of the network partitions.

A simple model clarifies the complicated relationships of complex networks

PubMed Central

Zheng, Bojin; Wu, Hongrun; Kuang, Li; Qin, Jun; Du, Wenhua; Wang, Jianmin; Li, Deyi

2014-01-01

Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it is widely believed that these traits origin from different causes. However, we find that a simple model based on optimisation can produce many traits, including scale-free, small-world, ultra small-world, Delta-distribution, compact, fractal, regular and random networks. Moreover, by revising the proposed model, the community-structure networks are generated. By this model and the revised versions, the complicated relationships of complex networks are illustrated. The model brings a new universal perspective to the understanding of complex networks and provide a universal method to model complex networks from the viewpoint of optimisation. PMID:25160506

JANUS: Joint Academic Network Using Satellite. Brief Description of Project. IET Papers on Broadcasting: No. 287.

ERIC Educational Resources Information Center

Bates, A. W.

The JANUS (Joint Academic Network Using Satellite) satellite network is being planned to link European institutions wishing to jointly produce distance teaching materials. Earth stations with capabilities for transmit/receive functions, voice/data functions, two 64 kbs channels, and connection to local telephone exchange and computer networks will…

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik; Marwan, Norbert; Dijkstra, Henk; Kurths, Jürgen

2016-04-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology. pyunicorn is available online at https://github.com/pik-copan/pyunicorn. Reference: J.F. Donges, J. Heitzig, B. Beronov, M. Wiedermann, J. Runge, Q.-Y. Feng, L. Tupikina, V. Stolbova, R.V. Donner, N. Marwan, H.A. Dijkstra, and J. Kurths, Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package, Chaos 25, 113101 (2015), DOI: 10.1063/1.4934554, Preprint: arxiv.org:1507.01571 [physics.data-an].

Evaluating nodes importance in complex network based on PageRank algorithm

NASA Astrophysics Data System (ADS)

Li, Kai; He, Yongfeng

2018-04-01

To evaluate the important nodes in the complex network, and aim at the problems existing in the traditional PageRank algorithm, we propose a modified PageRank algorithm. The algorithm has convergence for the evaluation of the importance of the suspended nodes and the nodes with a directed loop network. The simulation example shows the effectiveness of the modified algorithm for the evaluation of the complexity of the complex network nodes.

Dense power-law networks and simplicial complexes

NASA Astrophysics Data System (ADS)

Courtney, Owen T.; Bianconi, Ginestra

2018-05-01

There is increasing evidence that dense networks occur in on-line social networks, recommendation networks and in the brain. In addition to being dense, these networks are often also scale-free, i.e., their degree distributions follow P (k ) ∝k-γ with γ ∈(1 ,2 ] . Models of growing networks have been successfully employed to produce scale-free networks using preferential attachment, however these models can only produce sparse networks as the numbers of links and nodes being added at each time step is constant. Here we present a modeling framework which produces networks that are both dense and scale-free. The mechanism by which the networks grow in this model is based on the Pitman-Yor process. Variations on the model are able to produce undirected scale-free networks with exponent γ =2 or directed networks with power-law out-degree distribution with tunable exponent γ ∈(1 ,2 ) . We also extend the model to that of directed two-dimensional simplicial complexes. Simplicial complexes are generalization of networks that can encode the many body interactions between the parts of a complex system and as such are becoming increasingly popular to characterize different data sets ranging from social interacting systems to the brain. Our model produces dense directed simplicial complexes with power-law distribution of the generalized out-degrees of the nodes.

Metabolic Network Modeling of Microbial Interactions in Natural and Engineered Environmental Systems

PubMed Central

Perez-Garcia, Octavio; Lear, Gavin; Singhal, Naresh

2016-01-01

We review approaches to characterize metabolic interactions within microbial communities using Stoichiometric Metabolic Network (SMN) models for applications in environmental and industrial biotechnology. SMN models are computational tools used to evaluate the metabolic engineering potential of various organisms. They have successfully been applied to design and optimize the microbial production of antibiotics, alcohols and amino acids by single strains. To date however, such models have been rarely applied to analyze and control the metabolism of more complex microbial communities. This is largely attributed to the diversity of microbial community functions, metabolisms, and interactions. Here, we firstly review different types of microbial interaction and describe their relevance for natural and engineered environmental processes. Next, we provide a general description of the essential methods of the SMN modeling workflow including the steps of network reconstruction, simulation through Flux Balance Analysis (FBA), experimental data gathering, and model calibration. Then we broadly describe and compare four approaches to model microbial interactions using metabolic networks, i.e., (i) lumped networks, (ii) compartment per guild networks, (iii) bi-level optimization simulations, and (iv) dynamic-SMN methods. These approaches can be used to integrate and analyze diverse microbial physiology, ecology and molecular community data. All of them (except the lumped approach) are suitable for incorporating species abundance data but so far they have been used only to model simple communities of two to eight different species. Interactions based on substrate exchange and competition can be directly modeled using the above approaches. However, interactions based on metabolic feedbacks, such as product inhibition and synthropy require extensions to current models, incorporating gene regulation and compounding accumulation mechanisms. SMN models of microbial interactions can be used to analyze complex “omics” data and to infer and optimize metabolic processes. Thereby, SMN models are suitable to capitalize on advances in high-throughput molecular and metabolic data generation. SMN models are starting to be applied to describe microbial interactions during wastewater treatment, in-situ bioremediation, microalgae blooms methanogenic fermentation, and bioplastic production. Despite their current challenges, we envisage that SMN models have future potential for the design and development of novel growth media, biochemical pathways and synthetic microbial associations. PMID:27242701

Exploring Transformations in Caribbean Indigenous Social Networks through Visibility Studies: the Case of Late Pre-Colonial Landscapes in East-Guadeloupe (French West Indies).

PubMed

Brughmans, Tom; de Waal, Maaike S; Hofman, Corinne L; Brandes, Ulrik

2018-01-01

This paper presents a study of the visual properties of natural and Amerindian cultural landscapes in late pre-colonial East-Guadeloupe and of how these visual properties affected social interactions. Through a review of descriptive and formal visibility studies in Caribbean archaeology, it reveals that the ability of visual properties to affect past human behaviour is frequently evoked but the more complex of these hypotheses are rarely studied formally. To explore such complex hypotheses, the current study applies a range of techniques: total viewsheds, cumulative viewsheds, visual neighbourhood configurations and visibility networks. Experiments were performed to explore the control of seascapes, the functioning of hypothetical smoke signalling networks, the correlation of these visual properties with stylistic similarities of material culture found at sites and the change of visual properties over time. The results of these experiments suggest that only few sites in Eastern Guadeloupe are located in areas that are particularly suitable to visually control possible sea routes for short- and long-distance exchange; that visual control over sea areas was not a factor of importance for the existence of micro-style areas; that during the early phase of the Late Ceramic Age networks per landmass are connected and dense and that they incorporate all sites, a structure that would allow hypothetical smoke signalling networks; and that the visual properties of locations of the late sites Morne Souffleur and Morne Cybèle-1 were not ideal for defensive purposes. These results led us to propose a multi-scalar hypothesis for how lines of sight between settlements in the Lesser Antilles could have structured past human behaviour: short-distance visibility networks represent the structuring of navigation and communication within landmasses, whereas the landmasses themselves served as focal points for regional navigation and interaction. We conclude by emphasising that since our archaeological theories about visual properties usually take a multi-scalar landscape perspective, there is a need for this perspective to be reflected in our formal visibility methods as is made possible by the methods used in this paper.

The Global Special Operations Forces Network from a Partner-Nation Perspective

DTIC Science & Technology

2014-12-01

in networks vs . management of Networks. ................................80  Figure 17.  A national SOF network with SOCOM as the manager of networks...context and are asked in the natural course of things; there is no predetermination of question topics or wording. 10 descriptive section is the...struggles and challenges that occur naturally over time. As depicted in Figure 2, the network will constantly have to examine how it is evolving and, if

A study of the electrical properties of complex resistor network based on NW model

NASA Astrophysics Data System (ADS)

Chang, Yunfeng; Li, Yunting; Yang, Liu; Guo, Lu; Liu, Gaochao

2015-04-01

The power and resistance of two-port complex resistor network based on NW small world network model are studied in this paper. Mainly, we study the dependence of the network power and resistance on the degree of port vertices, the connection probability and the shortest distance. Qualitative analysis and a simplified formula for network resistance are given out. Finally, we define a branching parameter and give out its physical meaning in the analysis of complex resistor network.

Oscillations in interconnected complex networks under intentional attack

NASA Astrophysics Data System (ADS)

Zhang, Wen-Ping; Xia, Yongxiang; Tan, Fei

2016-01-01

Many real-world networks are interconnected with each other. In this paper, we study the traffic dynamics in interconnected complex networks under an intentional attack. We find that with the shortest time delay routing strategy, the traffic dynamics can show the stable state, periodic, quasi-periodic and chaotic oscillations, when the capacity redundancy parameter changes. Moreover, compared with isolated complex networks, oscillations always take place in interconnected networks more easily. Thirdly, in interconnected networks, oscillations are affected strongly by the coupling probability and coupling preference.

The Correlation Fractal Dimension of Complex Networks

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Liu, Zhenzhen; Wang, Mogei

2013-05-01

The fractality of complex networks is studied by estimating the correlation dimensions of the networks. Comparing with the previous algorithms of estimating the box dimension, our algorithm achieves a significant reduction in time complexity. For four benchmark cases tested, that is, the Escherichia coli (E. Coli) metabolic network, the Homo sapiens protein interaction network (H. Sapiens PIN), the Saccharomyces cerevisiae protein interaction network (S. Cerevisiae PIN) and the World Wide Web (WWW), experiments are provided to demonstrate the validity of our algorithm.

Using Complex Networks to Characterize International Business Cycles

PubMed Central

Caraiani, Petre

2013-01-01

Background There is a rapidly expanding literature on the application of complex networks in economics that focused mostly on stock markets. In this paper, we discuss an application of complex networks to study international business cycles. Methodology/Principal Findings We construct complex networks based on GDP data from two data sets on G7 and OECD economies. Besides the well-known correlation-based networks, we also use a specific tool for presenting causality in economics, the Granger causality. We consider different filtering methods to derive the stationary component of the GDP series for each of the countries in the samples. The networks were found to be sensitive to the detrending method. While the correlation networks provide information on comovement between the national economies, the Granger causality networks can better predict fluctuations in countries’ GDP. By using them, we can obtain directed networks allows us to determine the relative influence of different countries on the global economy network. The US appears as the key player for both the G7 and OECD samples. Conclusion The use of complex networks is valuable for understanding the business cycle comovements at an international level. PMID:23483979

Optimization of controllability and robustness of complex networks by edge directionality

NASA Astrophysics Data System (ADS)

Liang, Man; Jin, Suoqin; Wang, Dingjie; Zou, Xiufen

2016-09-01

Recently, controllability of complex networks has attracted enormous attention in various fields of science and engineering. How to optimize structural controllability has also become a significant issue. Previous studies have shown that an appropriate directional assignment can improve structural controllability; however, the evolution of the structural controllability of complex networks under attacks and cascading has always been ignored. To address this problem, this study proposes a new edge orientation method (NEOM) based on residual degree that changes the link direction while conserving topology and directionality. By comparing the results with those of previous methods in two random graph models and several realistic networks, our proposed approach is demonstrated to be an effective and competitive method for improving the structural controllability of complex networks. Moreover, numerical simulations show that our method is near-optimal in optimizing structural controllability. Strikingly, compared to the original network, our method maintains the structural controllability of the network under attacks and cascading, indicating that the NEOM can also enhance the robustness of controllability of networks. These results alter the view of the nature of controllability in complex networks, change the understanding of structural controllability and affect the design of network models to control such networks.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics.

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Theoretical Basis for Dynamic Label Propagation in Stationary Metabolic Networks under Step and Periodic Inputs

PubMed Central

Sokol, Serguei; Portais, Jean-Charles

2015-01-01

The dynamics of label propagation in a stationary metabolic network during an isotope labeling experiment can provide highly valuable information on the network topology, metabolic fluxes, and on the size of metabolite pools. However, major issues, both in the experimental set-up and in the accompanying numerical methods currently limit the application of this approach. Here, we propose a method to apply novel types of label inputs, sinusoidal or more generally periodic label inputs, to address both the practical and numerical challenges of dynamic labeling experiments. By considering a simple metabolic system, i.e. a linear, non-reversible pathway of arbitrary length, we develop mathematical descriptions of label propagation for both classical and novel label inputs. Theoretical developments and computer simulations show that the application of rectangular periodic pulses has both numerical and practical advantages over other approaches. We applied the strategy to estimate fluxes in a simulated experiment performed on a complex metabolic network (the central carbon metabolism of Escherichia coli), to further demonstrate its value in conditions which are close to those in real experiments. This study provides a theoretical basis for the rational interpretation of label propagation curves in real experiments, and will help identify the strengths, pitfalls and limitations of such experiments. The cases described here can also be used as test cases for more general numerical methods aimed at identifying network topology, analyzing metabolic fluxes or measuring concentrations of metabolites. PMID:26641860

Heteronormativity and Sexual Partnering Among Bisexual Latino Men

PubMed Central

Garcia, Jonathan; Wilson, Patrick A.; Parker, Richard G.; Severson, Nicolette

2015-01-01

Our analyses address the question of how bisexual Latino men organize their sexual partnerships. Heteronormativity can be understood as the set of social norms and normative structures that guide sexual partnering among men and women. We provide descriptive statistics to describe bisexual Latino men’s sexual partnerships. Logistic and linear regression modeling were used to explore bivariate and multivariate relationships. Of our total sample (N = 142), 41.6% had unprotected vaginal intercourse 2 months prior to the interview; 21.8 % had unprotected anal intercourse with female partners; 37.5 % had unprotected insertive anal intercourse with male partners; and 22.5 % had unprotected receptive anal intercourse with male partners. In our multivariate model, machismo was directly associated with meeting female partners through formal spaces (workplace, school, and/or church), but inversely associated with meeting male partners in formal spaces. Machismo was positively associated with meeting male sex partners through social networks (i.e., friendship and kinship networks). The more comfortable men were with homosexuality the less likely they were to meet men online and the more likely they were to meet men through social networks of friends and kinship. Interventions to reduce sexually transmitted diseases that target bisexual behavior as an epidemiological “bridge” of transmission from homosexual to heterosexual networks might very well benefit from a more complex understanding of how Latino bisexuality is patterned. Thus, this exploratory analysis might lead to a rethinking of how to address risk and vulnerability among Latino bisexual men and their sexual networks. PMID:25128415

Heteronormativity and sexual partnering among bisexual Latino men.

PubMed

Muñoz-Laboy, Miguel; Garcia, Jonathan; Wilson, Patrick A; Parker, Richard G; Severson, Nicolette

2015-05-01

Our analyses address the question of how bisexual Latino men organize their sexual partnerships. Heteronormativity can be understood as the set of social norms and normative structures that guide sexual partnering among men and women. We provide descriptive statistics to describe bisexual Latino men's sexual partnerships. Logistic and linear regression modeling were used to explore bivariate and multivariate relationships. Of our total sample (N = 142), 41.6 % had unprotected vaginal intercourse 2 months prior to the interview; 21.8 % had unprotected anal intercourse with female partners; 37.5 % had unprotected insertive anal intercourse with male partners; and 22.5 % had unprotected receptive anal intercourse with male partners. In our multivariate model, machismo was directly associated with meeting female partners through formal spaces (workplace, school, and/or church), but inversely associated with meeting male partners in formal spaces. Machismo was positively associated with meeting male sex partners through social networks (i.e., friendship and kinship networks). The more comfortable men were with homosexuality the less likely they were to meet men online and the more likely they were to meet men through social networks of friends and kinship. Interventions to reduce sexually transmitted diseases that target bisexual behavior as an epidemiological "bridge" of transmission from homosexual to heterosexual networks might very well benefit from a more complex understanding of how Latino bisexuality is patterned. Thus, this exploratory analysis might lead to a rethinking of how to address risk and vulnerability among Latino bisexual men and their sexual networks.

75 FR 9900 - Agency Forms Undergoing Paperwork Reduction Act Review

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-04

... ability of the Network to respond to a biological or chemical terrorism event. The sensitivity of all... Project Laboratory Response Network (LRN)--Existing Data Collection in use without an OMB Control Number... Disease Control and Prevention (CDC). Background and Brief Description The Laboratory Response Network...

40 CFR 58.12 - Operating schedules.

Code of Federal Regulations, 2010 CFR

2010-07-01

...) AMBIENT AIR QUALITY SURVEILLANCE Monitoring Network § 58.12 Operating schedules. State and local... part. Area-specific PAMS operating schedules must be included as part of the PAMS network description... remains once every six days. No less frequently than as part of each 5-year network assessment, the most...

40 CFR 58.12 - Operating schedules.

Code of Federal Regulations, 2011 CFR

2011-07-01

...) AMBIENT AIR QUALITY SURVEILLANCE Monitoring Network § 58.12 Operating schedules. State and local... part. Area-specific PAMS operating schedules must be included as part of the PAMS network description... remains once every six days. No less frequently than as part of each 5-year network assessment, the most...

Report on architecture description for the INFLO prototype.

DOT National Transportation Integrated Search

2014-01-01

This report documents the Architecture Description for the implementation of the Intelligent Network Flow Optimization (INFLO) Prototype bundle within the Dynamic Mobility Applications (DMA) portion of the Connected Vehicle Program. The intent is to ...

TUNS user guide supplement: Data dictionary

NASA Technical Reports Server (NTRS)

1988-01-01

Provided is a data dictionary for the Technology Utilization Network System (TUNS) providing for each element name the long name, data type, data size, descriptive name and description, data of PRI clause, legal values, and location used.

Hybrid stochastic simplifications for multiscale gene networks.

PubMed

Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

2009-09-07

Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.

Sociolinguistic Typology and Sign Languages.

PubMed

Schembri, Adam; Fenlon, Jordan; Cormier, Kearsy; Johnston, Trevor

2018-01-01

This paper examines the possible relationship between proposed social determinants of morphological 'complexity' and how this contributes to linguistic diversity, specifically via the typological nature of the sign languages of deaf communities. We sketch how the notion of morphological complexity, as defined by Trudgill (2011), applies to sign languages. Using these criteria, sign languages appear to be languages with low to moderate levels of morphological complexity. This may partly reflect the influence of key social characteristics of communities on the typological nature of languages. Although many deaf communities are relatively small and may involve dense social networks (both social characteristics that Trudgill claimed may lend themselves to morphological 'complexification'), the picture is complicated by the highly variable nature of the sign language acquisition for most deaf people, and the ongoing contact between native signers, hearing non-native signers, and those deaf individuals who only acquire sign languages in later childhood and early adulthood. These are all factors that may work against the emergence of morphological complexification. The relationship between linguistic typology and these key social factors may lead to a better understanding of the nature of sign language grammar. This perspective stands in contrast to other work where sign languages are sometimes presented as having complex morphology despite being young languages (e.g., Aronoff et al., 2005); in some descriptions, the social determinants of morphological complexity have not received much attention, nor has the notion of complexity itself been specifically explored.

A Complex Network Perspective on Clinical Science

PubMed Central

Hofmann, Stefan G.; Curtiss, Joshua; McNally, Richard J.

2016-01-01

Contemporary classification systems for mental disorders assume that abnormal behaviors are expressions of latent disease entities. An alternative to the latent disease model is the complex network approach. Instead of assuming that symptoms arise from an underlying disease entity, the complex network approach holds that disorders exist as systems of interrelated elements of a network. This approach also provides a framework for the understanding of therapeutic change. Depending on the structure of the network, change can occur abruptly once the network reaches a critical threshold (the tipping point). Homogeneous and highly connected networks often recover more slowly from local perturbations when the network approaches the tipping point, allowing for the possibility to predict treatment change, relapse, and recovery. In this article we discuss the complex network approach as an alternative to the latent disease model, and we discuss its implications for classification, therapy, relapse, and recovery. PMID:27694457

Generating description with multi-feature fusion and saliency maps of image

NASA Astrophysics Data System (ADS)

Liu, Lisha; Ding, Yuxuan; Tian, Chunna; Yuan, Bo

2018-04-01

Generating description for an image can be regard as visual understanding. It is across artificial intelligence, machine learning, natural language processing and many other areas. In this paper, we present a model that generates description for images based on RNN (recurrent neural network) with object attention and multi-feature of images. The deep recurrent neural networks have excellent performance in machine translation, so we use it to generate natural sentence description for images. The proposed method uses single CNN (convolution neural network) that is trained on ImageNet to extract image features. But we think it can not adequately contain the content in images, it may only focus on the object area of image. So we add scene information to image feature using CNN which is trained on Places205. Experiments show that model with multi-feature extracted by two CNNs perform better than which with a single feature. In addition, we make saliency weights on images to emphasize the salient objects in images. We evaluate our model on MSCOCO based on public metrics, and the results show that our model performs better than several state-of-the-art methods.

Manuals of Cultural Systems

NASA Astrophysics Data System (ADS)

Ballonoff, Paul

2014-10-01

Ethnography often studies social networks including empirical descriptions of marriages and families. We initially concentrate on a special subset of networks which we call configurations. We show that descriptions of the possible outcomes of viable histories form a manual, and an orthoalgebra. We then study cases where family sizes vary, and show that this also forms a manual. In fact, it demonstrates adiabatic invariance, a property often associated with physical system conservation laws, and which here expresses conservation of the viability of a cultural system.

Efficient methods and readily customizable libraries for managing complexity of large networks.

PubMed

Dogrusoz, Ugur; Karacelik, Alper; Safarli, Ilkin; Balci, Hasan; Dervishi, Leonard; Siper, Metin Can

2018-01-01

One common problem in visualizing real-life networks, including biological pathways, is the large size of these networks. Often times, users find themselves facing slow, non-scaling operations due to network size, if not a "hairball" network, hindering effective analysis. One extremely useful method for reducing complexity of large networks is the use of hierarchical clustering and nesting, and applying expand-collapse operations on demand during analysis. Another such method is hiding currently unnecessary details, to later gradually reveal on demand. Major challenges when applying complexity reduction operations on large networks include efficiency and maintaining the user's mental map of the drawing. We developed specialized incremental layout methods for preserving a user's mental map while managing complexity of large networks through expand-collapse and hide-show operations. We also developed open-source JavaScript libraries as plug-ins to the web based graph visualization library named Cytsocape.js to implement these methods as complexity management operations. Through efficient specialized algorithms provided by these extensions, one can collapse or hide desired parts of a network, yielding potentially much smaller networks, making them more suitable for interactive visual analysis. This work fills an important gap by making efficient implementations of some already known complexity management techniques freely available to tool developers through a couple of open source, customizable software libraries, and by introducing some heuristics which can be applied upon such complexity management techniques to ensure preserving mental map of users.

Graph theoretical analysis of complex networks in the brain

PubMed Central

Stam, Cornelis J; Reijneveld, Jaap C

2007-01-01

Since the discovery of small-world and scale-free networks the study of complex systems from a network perspective has taken an enormous flight. In recent years many important properties of complex networks have been delineated. In particular, significant progress has been made in understanding the relationship between the structural properties of networks and the nature of dynamics taking place on these networks. For instance, the 'synchronizability' of complex networks of coupled oscillators can be determined by graph spectral analysis. These developments in the theory of complex networks have inspired new applications in the field of neuroscience. Graph analysis has been used in the study of models of neural networks, anatomical connectivity, and functional connectivity based upon fMRI, EEG and MEG. These studies suggest that the human brain can be modelled as a complex network, and may have a small-world structure both at the level of anatomical as well as functional connectivity. This small-world structure is hypothesized to reflect an optimal situation associated with rapid synchronization and information transfer, minimal wiring costs, as well as a balance between local processing and global integration. The topological structure of functional networks is probably restrained by genetic and anatomical factors, but can be modified during tasks. There is also increasing evidence that various types of brain disease such as Alzheimer's disease, schizophrenia, brain tumours and epilepsy may be associated with deviations of the functional network topology from the optimal small-world pattern. PMID:17908336

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cameron, Maria K., E-mail: cameron@math.umd.edu

We develop computational tools for spectral analysis of stochastic networks representing energy landscapes of atomic and molecular clusters. Physical meaning and some properties of eigenvalues, left and right eigenvectors, and eigencurrents are discussed. We propose an approach to compute a collection of eigenpairs and corresponding eigencurrents describing the most important relaxation processes taking place in the system on its way to the equilibrium. It is suitable for large and complex stochastic networks where pairwise transition rates, given by the Arrhenius law, vary by orders of magnitude. The proposed methodology is applied to the network representing the Lennard-Jones-38 cluster created bymore » Wales's group. Its energy landscape has a double funnel structure with a deep and narrow face-centered cubic funnel and a shallower and wider icosahedral funnel. However, the complete spectrum of the generator matrix of the Lennard-Jones-38 network has no appreciable spectral gap separating the eigenvalue corresponding to the escape from the icosahedral funnel. We provide a detailed description of the escape process from the icosahedral funnel using the eigencurrent and demonstrate a superexponential growth of the corresponding eigenvalue. The proposed spectral approach is compared to the methodology of the Transition Path Theory. Finally, we discuss whether the Lennard-Jones-38 cluster is metastable from the points of view of a mathematician and a chemical physicist, and make a connection with experimental works.« less

Vehicle Detection in Aerial Images Based on Region Convolutional Neural Networks and Hard Negative Example Mining.

PubMed

Tang, Tianyu; Zhou, Shilin; Deng, Zhipeng; Zou, Huanxin; Lei, Lin

2017-02-10

Detecting vehicles in aerial imagery plays an important role in a wide range of applications. The current vehicle detection methods are mostly based on sliding-window search and handcrafted or shallow-learning-based features, having limited description capability and heavy computational costs. Recently, due to the powerful feature representations, region convolutional neural networks (CNN) based detection methods have achieved state-of-the-art performance in computer vision, especially Faster R-CNN. However, directly using it for vehicle detection in aerial images has many limitations: (1) region proposal network (RPN) in Faster R-CNN has poor performance for accurately locating small-sized vehicles, due to the relatively coarse feature maps; and (2) the classifier after RPN cannot distinguish vehicles and complex backgrounds well. In this study, an improved detection method based on Faster R-CNN is proposed in order to accomplish the two challenges mentioned above. Firstly, to improve the recall, we employ a hyper region proposal network (HRPN) to extract vehicle-like targets with a combination of hierarchical feature maps. Then, we replace the classifier after RPN by a cascade of boosted classifiers to verify the candidate regions, aiming at reducing false detection by negative example mining. We evaluate our method on the Munich vehicle dataset and the collected vehicle dataset, with improvements in accuracy and robustness compared to existing methods.

Transient response of nonlinear polymer networks: A kinetic theory

NASA Astrophysics Data System (ADS)

Vernerey, Franck J.

2018-06-01

Dynamic networks are found in a majority of natural materials, but also in engineering materials, such as entangled polymers and physically cross-linked gels. Owing to their transient bond dynamics, these networks display a rich class of behaviors, from elasticity, rheology, self-healing, or growth. Although classical theories in rheology and mechanics have enabled us to characterize these materials, there is still a gap in our understanding on how individuals (i.e., the mechanics of each building blocks and its connection with others) affect the emerging response of the network. In this work, we introduce an alternative way to think about these networks from a statistical point of view. More specifically, a network is seen as a collection of individual polymer chains connected by weak bonds that can associate and dissociate over time. From the knowledge of these individual chains (elasticity, transient attachment, and detachment events), we construct a statistical description of the population and derive an evolution equation of their distribution based on applied deformation and their local interactions. We specifically concentrate on nonlinear elastic response that follows from the strain stiffening response of individual chains of finite size. Upon appropriate averaging operations and using a mean field approximation, we show that the distribution can be replaced by a so-called chain distribution tensor that is used to determine important macroscopic measures such as stress, energy storage and dissipation in the network. Prediction of the kinetic theory are then explored against known experimental measurement of polymer responses under uniaxial loading. It is found that even under the simplest assumptions of force-independent chain kinetics, the model is able to reproduce complex time-dependent behaviors of rubber and self-healing supramolecular polymers.

Complex-valued multistate associative memory with nonlinear multilevel functions for gray-level image reconstruction.

PubMed

Tanaka, Gouhei; Aihara, Kazuyuki

2009-09-01

A widely used complex-valued activation function for complex-valued multistate Hopfield networks is revealed to be essentially based on a multilevel step function. By replacing the multilevel step function with other multilevel characteristics, we present two alternative complex-valued activation functions. One is based on a multilevel sigmoid function, while the other on a characteristic of a multistate bifurcating neuron. Numerical experiments show that both modifications to the complex-valued activation function bring about improvements in network performance for a multistate associative memory. The advantage of the proposed networks over the complex-valued Hopfield networks with the multilevel step function is more outstanding when a complex-valued neuron represents a larger number of multivalued states. Further, the performance of the proposed networks in reconstructing noisy 256 gray-level images is demonstrated in comparison with other recent associative memories to clarify their advantages and disadvantages.

Network command processing system overview

NASA Technical Reports Server (NTRS)

Nam, Yon-Woo; Murphy, Lisa D.

1993-01-01

The Network Command Processing System (NCPS) developed for the National Aeronautics and Space Administration (NASA) Ground Network (GN) stations is a spacecraft command system utilizing a MULTIBUS I/68030 microprocessor. This system was developed and implemented at ground stations worldwide to provide a Project Operations Control Center (POCC) with command capability for support of spacecraft operations such as the LANDSAT, Shuttle, Tracking and Data Relay Satellite, and Nimbus-7. The NCPS consolidates multiple modulation schemes for supporting various manned/unmanned orbital platforms. The NCPS interacts with the POCC and a local operator to process configuration requests, generate modulated uplink sequences, and inform users of the ground command link status. This paper presents the system functional description, hardware description, and the software design.

78 FR 306 - Proposed Data Collections Submitted for Public Comment and Recommendations

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-03

... Network to respond to a biological or chemical threat event. The sensitivity of all information associated... this notice. Proposed Project Laboratory Response Network (LRN) (OMB No. 0920-0850, Exp. 5/31/ 2013... Prevention (CDC). Background and Brief Description The Laboratory Response Network (LRN) was established by...

77 FR 53212 - Notice of Proposed Information Collection: Comment Request Strong Cities Strong Communities...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-31

... Information Collection: Comment Request Strong Cities Strong Communities National Resource Network AGENCY... National Resource Network. OMB Control Number, if applicable: 2528--Pending. Description of the need for... information related to the proposed Strong Cities Strong Communities National Resource Network. The U.S...

76 FR 12983 - Notice of Proposed Information Collection: Comment Request; Tenant Resource Network Program

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-09

... DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT [Docket No. FR-5484-N-06] Notice of Proposed Information Collection: Comment Request; Tenant Resource Network Program AGENCY: Office of the Assistant...: Tenant Resource Network Program. OMB Control Number, if applicable: 2502-new-65pTRNP. Description of the...

Social Networking on the Semantic Web

ERIC Educational Resources Information Center

Finin, Tim; Ding, Li; Zhou, Lina; Joshi, Anupam

2005-01-01

Purpose: Aims to investigate the way that the semantic web is being used to represent and process social network information. Design/methodology/approach: The Swoogle semantic web search engine was used to construct several large data sets of Resource Description Framework (RDF) documents with social network information that were encoded using the…

Teacher Corps Networking: Purpose and Potential.

ERIC Educational Resources Information Center

Ford, Paul; And Others

An overview is presented of the objectives of the Far West Teacher Corps Network. A description is given of the development of the network and achievements in the areas of community involvement, inservice teacher education, exceptional child programs, management information systems, and project management and evaluation. Chapters are included on…

Optimizing Nutrient Uptake in Biological Transport Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

2013-03-01

Many biological systems employ complex networks of vascular tubes to facilitate transport of solute nutrients, examples include the vascular system of plants (phloem), some fungi, and the slime-mold Physarum. It is believed that such networks are optimized through evolution for carrying out their designated task. We propose a set of hydrodynamic governing equations for solute transport in a complex network, and obtain the optimal network architecture for various classes of optimizing functionals. We finally discuss the topological properties and statistical mechanics of the resulting complex networks, and examine correspondence of the obtained networks to those found in actual biological systems.

FY 1991 RDT&E Descriptive Summaries

DTIC Science & Technology

1990-01-01

OF PROJECT : The Defense Sciences program element provides the technical foundation for long-term improvements in military equiment...DESCRIPTION OF PROJECT : Develop the fundamental technology in advanced digital structures and network concepts for smaller, more powerful, less expensive...DESCRIPTION OF PROJECT : The 1985 Defense Science Board (DSB) noted that the United States was behind and failing further behind in armor and

The Structure of Male Adolescent Peer Networks and Risk for Intimate Partner Violence Perpetration: Findings from a National Sample

ERIC Educational Resources Information Center

Casey, Erin A.; Beadnell, Blair

2010-01-01

Although peer networks have been implicated as influential in a range of adolescent behaviors, little is known about relationships between peer network structures and risk for intimate partner violence (IPV) among youth. This study is a descriptive analysis of how peer network "types" may be related to subsequent risk for IPV…

Reconstruction of Complex Network based on the Noise via QR Decomposition and Compressed Sensing.

PubMed

Li, Lixiang; Xu, Dafei; Peng, Haipeng; Kurths, Jürgen; Yang, Yixian

2017-11-08

It is generally known that the states of network nodes are stable and have strong correlations in a linear network system. We find that without the control input, the method of compressed sensing can not succeed in reconstructing complex networks in which the states of nodes are generated through the linear network system. However, noise can drive the dynamics between nodes to break the stability of the system state. Therefore, a new method integrating QR decomposition and compressed sensing is proposed to solve the reconstruction problem of complex networks under the assistance of the input noise. The state matrix of the system is decomposed by QR decomposition. We construct the measurement matrix with the aid of Gaussian noise so that the sparse input matrix can be reconstructed by compressed sensing. We also discover that noise can build a bridge between the dynamics and the topological structure. Experiments are presented to show that the proposed method is more accurate and more efficient to reconstruct four model networks and six real networks by the comparisons between the proposed method and only compressed sensing. In addition, the proposed method can reconstruct not only the sparse complex networks, but also the dense complex networks.

Understanding large multiprotein complexes: applying a multiple allosteric networks model to explain the function of the Mediator transcription complex.

PubMed

Lewis, Brian A

2010-01-15

The regulation of transcription and of many other cellular processes involves large multi-subunit protein complexes. In the context of transcription, it is known that these complexes serve as regulatory platforms that connect activator DNA-binding proteins to a target promoter. However, there is still a lack of understanding regarding the function of these complexes. Why do multi-subunit complexes exist? What is the molecular basis of the function of their constituent subunits, and how are these subunits organized within a complex? What is the reason for physical connections between certain subunits and not others? In this article, I address these issues through a model of network allostery and its application to the eukaryotic RNA polymerase II Mediator transcription complex. The multiple allosteric networks model (MANM) suggests that protein complexes such as Mediator exist not only as physical but also as functional networks of interconnected proteins through which information is transferred from subunit to subunit by the propagation of an allosteric state known as conformational spread. Additionally, there are multiple distinct sub-networks within the Mediator complex that can be defined by their connections to different subunits; these sub-networks have discrete functions that are activated when specific subunits interact with other activator proteins.

Robust pinning control of heterogeneous complex networks with jointly connected topologies and time-varying parametric uncertainty

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2018-05-01

The pinning/leader control problems provide the design of the leader or pinning controller in order to guide a complex network to a desired trajectory or target (synchronisation or consensus). Let a time-invariant complex network, pinning/leader control problems include the design of the leader or pinning controller gain and number of nodes to pin in order to guide a network to a desired trajectory (synchronization or consensus). Usually, lower is the number of pinned nodes larger is the pinning gain required to assess network synchronisation. On the other side, realistic application scenario of complex networks is characterised by switching topologies, time-varying node coupling strength and link weight that make hard to solve the pinning/leader control problem. Additionally, the system dynamics at nodes can be heterogeneous. In this paper, we derive robust stabilisation conditions of time-varying heterogeneous complex networks with jointly connected topologies when coupling strength and link weight interactions are affected by time-varying uncertainties. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, we formulate low computationally demanding stabilisability conditions to design a pinning/leader control gain for robust network synchronisation. The effectiveness of the proposed approach is shown by several design examples applied to a paradigmatic well-known complex network composed of heterogeneous Chua's circuits.

Reconfigurable optical implementation of quantum complex networks

NASA Astrophysics Data System (ADS)

Nokkala, J.; Arzani, F.; Galve, F.; Zambrini, R.; Maniscalco, S.; Piilo, J.; Treps, N.; Parigi, V.

2018-05-01

Network theory has played a dominant role in understanding the structure of complex systems and their dynamics. Recently, quantum complex networks, i.e. collections of quantum systems arranged in a non-regular topology, have been theoretically explored leading to significant progress in a multitude of diverse contexts including, e.g., quantum transport, open quantum systems, quantum communication, extreme violation of local realism, and quantum gravity theories. Despite important progress in several quantum platforms, the implementation of complex networks with arbitrary topology in quantum experiments is still a demanding task, especially if we require both a significant size of the network and the capability of generating arbitrary topology—from regular to any kind of non-trivial structure—in a single setup. Here we propose an all optical and reconfigurable implementation of quantum complex networks. The experimental proposal is based on optical frequency combs, parametric processes, pulse shaping and multimode measurements allowing the arbitrary control of the number of the nodes (optical modes) and topology of the links (interactions between the modes) within the network. Moreover, we also show how to simulate quantum dynamics within the network combined with the ability to address its individual nodes. To demonstrate the versatility of these features, we discuss the implementation of two recently proposed probing techniques for quantum complex networks and structured environments.

Understanding a successful obesity prevention initiative in children under 5 from a systems perspective.

PubMed

Owen, Brynle; Brown, Andrew D; Kuhlberg, Jill; Millar, Lynne; Nichols, Melanie; Economos, Christina; Allender, Steven

2018-01-01

Systems thinking represents an innovative and logical approach to understanding complexity in community-based obesity prevention interventions. We report on an approach to apply systems thinking to understand the complexity of a successful obesity prevention intervention in early childhood (children aged up to 5 years) conducted in a regional city in Victoria, Australia. A causal loop diagram (CLD) was developed to represent system elements related to a successful childhood obesity prevention intervention in early childhood. Key stakeholder interviews (n = 16) were examined retrospectively to generate purposive text data, create microstructures, and form a CLD. A CLD representing key stakeholder perceptions of a successful intervention comprised six key feedback loops explaining changes in project implementation over time. The loops described the dynamics of collaboration, network formation, community awareness, human resources, project clarity, and innovation. The CLD developed provides a replicable means to capture, evaluate and disseminate a description of the dynamic elements of a successful obesity prevention intervention in early childhood.

A method to identify and analyze biological programs through automated reasoning

PubMed Central

Yordanov, Boyan; Dunn, Sara-Jane; Kugler, Hillel; Smith, Austin; Martello, Graziano; Emmott, Stephen

2016-01-01

Predictive biology is elusive because rigorous, data-constrained, mechanistic models of complex biological systems are difficult to derive and validate. Current approaches tend to construct and examine static interaction network models, which are descriptively rich, but often lack explanatory and predictive power, or dynamic models that can be simulated to reproduce known behavior. However, in such approaches implicit assumptions are introduced as typically only one mechanism is considered, and exhaustively investigating all scenarios is impractical using simulation. To address these limitations, we present a methodology based on automated formal reasoning, which permits the synthesis and analysis of the complete set of logical models consistent with experimental observations. We test hypotheses against all candidate models, and remove the need for simulation by characterizing and simultaneously analyzing all mechanistic explanations of observed behavior. Our methodology transforms knowledge of complex biological processes from sets of possible interactions and experimental observations to precise, predictive biological programs governing cell function. PMID:27668090

Dynamic protein interaction networks and new structural paradigms in signaling

PubMed Central

Csizmok, Veronika; Follis, Ariele Viacava; Kriwacki, Richard W.; Forman-Kay, Julie D.

2017-01-01

Understanding signaling and other complex biological processes requires elucidating the critical roles of intrinsically disordered proteins and regions (IDPs/IDRs), which represent ~30% of the proteome and enable unique regulatory mechanisms. In this review we describe the structural heterogeneity of disordered proteins that underpins these mechanisms and the latest progress in obtaining structural descriptions of ensembles of disordered proteins that are needed for linking structure and dynamics to function. We describe the diverse interactions of IDPs that can have unusual characteristics such as “ultrasensitivity” and “regulated folding and unfolding”. We also summarize the mounting data showing that large-scale assembly and protein phase separation occurs within a variety of signaling complexes and cellular structures. In addition, we discuss efforts to therapeutically target disordered proteins with small molecules. Overall, we interpret the remodeling of disordered state ensembles due to binding and post-translational modifications within an expanded framework for allostery that provides significant insights into how disordered proteins transmit biological information. PMID:26922996

Fast Recall for Complex-Valued Hopfield Neural Networks with Projection Rules.

PubMed

Kobayashi, Masaki

2017-01-01

Many models of neural networks have been extended to complex-valued neural networks. A complex-valued Hopfield neural network (CHNN) is a complex-valued version of a Hopfield neural network. Complex-valued neurons can represent multistates, and CHNNs are available for the storage of multilevel data, such as gray-scale images. The CHNNs are often trapped into the local minima, and their noise tolerance is low. Lee improved the noise tolerance of the CHNNs by detecting and exiting the local minima. In the present work, we propose a new recall algorithm that eliminates the local minima. We show that our proposed recall algorithm not only accelerated the recall but also improved the noise tolerance through computer simulations.

Community detection in complex networks by using membrane algorithm

NASA Astrophysics Data System (ADS)

Liu, Chuang; Fan, Linan; Liu, Zhou; Dai, Xiang; Xu, Jiamei; Chang, Baoren

Community detection in complex networks is a key problem of network analysis. In this paper, a new membrane algorithm is proposed to solve the community detection in complex networks. The proposed algorithm is based on membrane systems, which consists of objects, reaction rules, and a membrane structure. Each object represents a candidate partition of a complex network, and the quality of objects is evaluated according to network modularity. The reaction rules include evolutionary rules and communication rules. Evolutionary rules are responsible for improving the quality of objects, which employ the differential evolutionary algorithm to evolve objects. Communication rules implement the information exchanged among membranes. Finally, the proposed algorithm is evaluated on synthetic, real-world networks with real partitions known and the large-scaled networks with real partitions unknown. The experimental results indicate the superior performance of the proposed algorithm in comparison with other experimental algorithms.

Orchestrating Distributed Resource Ensembles for Petascale Science

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baldin, Ilya; Mandal, Anirban; Ruth, Paul

2014-04-24

Distributed, data-intensive computational science applications of interest to DOE scientific com- munities move large amounts of data for experiment data management, distributed analysis steps, remote visualization, and accessing scientific instruments. These applications need to orchestrate ensembles of resources from multiple resource pools and interconnect them with high-capacity multi- layered networks across multiple domains. It is highly desirable that mechanisms are designed that provide this type of resource provisioning capability to a broad class of applications. It is also important to have coherent monitoring capabilities for such complex distributed environments. In this project, we addressed these problems by designing an abstractmore » API, enabled by novel semantic resource descriptions, for provisioning complex and heterogeneous resources from multiple providers using their native provisioning mechanisms and control planes: computational, storage, and multi-layered high-speed network domains. We used an extensible resource representation based on semantic web technologies to afford maximum flexibility to applications in specifying their needs. We evaluated the effectiveness of provisioning using representative data-intensive ap- plications. We also developed mechanisms for providing feedback about resource performance to the application, to enable closed-loop feedback control and dynamic adjustments to resource allo- cations (elasticity). This was enabled through development of a novel persistent query framework that consumes disparate sources of monitoring data, including perfSONAR, and provides scalable distribution of asynchronous notifications.« less

Optical Neural Classification Of Binary Patterns

NASA Astrophysics Data System (ADS)

Gustafson, Steven C.; Little, Gordon R.

1988-05-01

Binary pattern classification that may be implemented using optical hardware and neural network algorithms is considered. Pattern classification problems that have no concise description (as in classifying handwritten characters) or no concise computation (as in NP-complete problems) are expected to be particularly amenable to this approach. For example, optical processors that efficiently classify binary patterns in accordance with their Boolean function complexity might be designed. As a candidate for such a design, an optical neural network model is discussed that is designed for binary pattern classification and that consists of an optical resonator with a dynamic multiplex-recorded reflection hologram and a phase conjugate mirror with thresholding and gain. In this model, learning or training examples of binary patterns may be recorded on the hologram such that one bit in each pattern marks the pattern class. Any input pattern, including one with an unknown class or marker bit, will be modified by a large number of parallel interactions with the reflection hologram and nonlinear mirror. After perhaps several seconds and 100 billion interactions, a steady-state pattern may develop with a marker bit that represents a minimum-Boolean-complexity classification of the input pattern. Computer simulations are presented that illustrate progress in understanding the behavior of this model and in developing a processor design that could have commanding and enduring performance advantages compared to current pattern classification techniques.

Characterization of complex networks by higher order neighborhood properties

NASA Astrophysics Data System (ADS)

Andrade, R. F. S.; Miranda, J. G. V.; Pinho, S. T. R.; Lobão, T. P.

2008-01-01

A concept of higher order neighborhood in complex networks, introduced previously [Phys. Rev. E 73, 046101 (2006)], is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order neighborhood as a network in itself, represented by a corresponding adjacency matrix, and to settle a plenty of new parameters in order to obtain a best characterization of the whole network. Usual network indices are then used to evaluate the properties of each neighborhood. The identification of high order neighborhoods is also regarded as intermediary step towards the evaluation of global network properties, like the diameter, average shortest path between node, and network fractal dimension. Results for a large number of typical networks are presented and discussed.

A Method for Predicting Protein Complexes from Dynamic Weighted Protein-Protein Interaction Networks.

PubMed

Liu, Lizhen; Sun, Xiaowu; Song, Wei; Du, Chao

2018-06-01

Predicting protein complexes from protein-protein interaction (PPI) network is of great significance to recognize the structure and function of cells. A protein may interact with different proteins under different time or conditions. Existing approaches only utilize static PPI network data that may lose much temporal biological information. First, this article proposed a novel method that combines gene expression data at different time points with traditional static PPI network to construct different dynamic subnetworks. Second, to further filter out the data noise, the semantic similarity based on gene ontology is regarded as the network weight together with the principal component analysis, which is introduced to deal with the weight computing by three traditional methods. Third, after building a dynamic PPI network, a predicting protein complexes algorithm based on "core-attachment" structural feature is applied to detect complexes from each dynamic subnetworks. Finally, it is revealed from the experimental results that our method proposed in this article performs well on detecting protein complexes from dynamic weighted PPI networks.

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

NASA Astrophysics Data System (ADS)

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.

Network survivability performance (computer diskette)

NASA Astrophysics Data System (ADS)

1993-11-01

File characteristics: Data file; 1 file. Physical description: 1 computer diskette; 3 1/2 in.; high density; 2.0MB. System requirements: Mac; Word. This technical report has been developed to address the survivability of telecommunications networks including services. It responds to the need for a common understanding of, and assessment techniques for network survivability, availability, integrity, and reliability. It provides a basis for designing and operating telecommunication networks to user expectations for network survivability.

Realizing actual feedback control of complex network

NASA Astrophysics Data System (ADS)

Tu, Chengyi; Cheng, Yuhua

2014-06-01

In this paper, we present the concept of feedbackability and how to identify the Minimum Feedbackability Set of an arbitrary complex directed network. Furthermore, we design an estimator and a feedback controller accessing one MFS to realize actual feedback control, i.e. control the system to our desired state according to the estimated system internal state from the output of estimator. Last but not least, we perform numerical simulations of a small linear time-invariant dynamics network and a real simple food network to verify the theoretical results. The framework presented here could make an arbitrary complex directed network realize actual feedback control and deepen our understanding of complex systems.

A Balanced Memory Network

PubMed Central

Roudi, Yasser; Latham, Peter E

2007-01-01

A fundamental problem in neuroscience is understanding how working memory—the ability to store information at intermediate timescales, like tens of seconds—is implemented in realistic neuronal networks. The most likely candidate mechanism is the attractor network, and a great deal of effort has gone toward investigating it theoretically. Yet, despite almost a quarter century of intense work, attractor networks are not fully understood. In particular, there are still two unanswered questions. First, how is it that attractor networks exhibit irregular firing, as is observed experimentally during working memory tasks? And second, how many memories can be stored under biologically realistic conditions? Here we answer both questions by studying an attractor neural network in which inhibition and excitation balance each other. Using mean-field analysis, we derive a three-variable description of attractor networks. From this description it follows that irregular firing can exist only if the number of neurons involved in a memory is large. The same mean-field analysis also shows that the number of memories that can be stored in a network scales with the number of excitatory connections, a result that has been suggested for simple models but never shown for realistic ones. Both of these predictions are verified using simulations with large networks of spiking neurons. PMID:17845070

Ant colony clustering with fitness perception and pheromone diffusion for community detection in complex networks

NASA Astrophysics Data System (ADS)

Ji, Junzhong; Song, Xiangjing; Liu, Chunnian; Zhang, Xiuzhen

2013-08-01

Community structure detection in complex networks has been intensively investigated in recent years. In this paper, we propose an adaptive approach based on ant colony clustering to discover communities in a complex network. The focus of the method is the clustering process of an ant colony in a virtual grid, where each ant represents a node in the complex network. During the ant colony search, the method uses a new fitness function to percept local environment and employs a pheromone diffusion model as a global information feedback mechanism to realize information exchange among ants. A significant advantage of our method is that the locations in the grid environment and the connections of the complex network structure are simultaneously taken into account in ants moving. Experimental results on computer-generated and real-world networks show the capability of our method to successfully detect community structures.

Small-time Scale Network Traffic Prediction Based on Complex-valued Neural Network

NASA Astrophysics Data System (ADS)

Yang, Bin

2017-07-01

Accurate models play an important role in capturing the significant characteristics of the network traffic, analyzing the network dynamic, and improving the forecasting accuracy for system dynamics. In this study, complex-valued neural network (CVNN) model is proposed to further improve the accuracy of small-time scale network traffic forecasting. Artificial bee colony (ABC) algorithm is proposed to optimize the complex-valued and real-valued parameters of CVNN model. Small-scale traffic measurements data namely the TCP traffic data is used to test the performance of CVNN model. Experimental results reveal that CVNN model forecasts the small-time scale network traffic measurement data very accurately

Characterizing core-periphery structure of complex network by h-core and fingerprint curve

NASA Astrophysics Data System (ADS)

Li, Simon S.; Ye, Adam Y.; Qi, Eric P.; Stanley, H. Eugene; Ye, Fred Y.

2018-02-01

It is proposed that the core-periphery structure of complex networks can be simulated by h-cores and fingerprint curves. While the features of core structure are characterized by h-core, the features of periphery structure are visualized by rose or spiral curve as the fingerprint curve linking to entire-network parameters. It is suggested that a complex network can be approached by h-core and rose curves as the first-order Fourier-approach, where the core-periphery structure is characterized by five parameters: network h-index, network radius, degree power, network density and average clustering coefficient. The simulation looks Fourier-like analysis.

Robust outer synchronization between two nonlinear complex networks with parametric disturbances and mixed time-varying delays

NASA Astrophysics Data System (ADS)

Zhang, Chuan; Wang, Xingyuan; Luo, Chao; Li, Junqiu; Wang, Chunpeng

2018-03-01

In this paper, we focus on the robust outer synchronization problem between two nonlinear complex networks with parametric disturbances and mixed time-varying delays. Firstly, a general complex network model is proposed. Besides the nonlinear couplings, the network model in this paper can possess parametric disturbances, internal time-varying delay, discrete time-varying delay and distributed time-varying delay. Then, according to the robust control strategy, linear matrix inequality and Lyapunov stability theory, several outer synchronization protocols are strictly derived. Simple linear matrix controllers are designed to driver the response network synchronize to the drive network. Additionally, our results can be applied on the complex networks without parametric disturbances. Finally, by utilizing the delayed Lorenz chaotic system as the dynamics of all nodes, simulation examples are given to demonstrate the effectiveness of our theoretical results.

Individual nodeʼs contribution to the mesoscale of complex networks

NASA Astrophysics Data System (ADS)

Klimm, Florian; Borge-Holthoefer, Javier; Wessel, Niels; Kurths, Jürgen; Zamora-López, Gorka

2014-12-01

The analysis of complex networks is devoted to the statistical characterization of the topology of graphs at different scales of organization in order to understand their functionality. While the modular structure of networks has become an essential element to better apprehend their complexity, the efforts to characterize the mesoscale of networks have focused on the identification of the modules rather than describing the mesoscale in an informative manner. Here we propose a framework to characterize the position every node takes within the modular configuration of complex networks and to evaluate their function accordingly. For illustration, we apply this framework to a set of synthetic networks, empirical neural networks, and to the transcriptional regulatory network of the Mycobacterium tuberculosis. We find that the architecture of both neuronal and transcriptional networks are optimized for the processing of multisensory information with the coexistence of well-defined modules of specialized components and the presence of hubs conveying information from and to the distinct functional domains.

Limited-path-length entanglement percolation in quantum complex networks

NASA Astrophysics Data System (ADS)

Cuquet, Martí; Calsamiglia, John

2011-03-01

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

The deep space network, volume 12

NASA Technical Reports Server (NTRS)

1972-01-01

Progress in the development of the DSN is reported along with TDA research and technology, network engineering, hardware, and software implementation. Included are descriptions of the DSN function and facilities, Helios mission support, Mariner Venus/Mercury 1973 mission support, Viking mission support, tracking and ground-based navigation, communications, network control and data processing, and deep space stations.

U.S. National PM2.5 Chemical Speciation Monitoring Networks – CSN and IMPROVE: Description of Networks

EPA Science Inventory

The U.S. Environmental Protection Agency (EPA) initiated the national PM2.5 Chemical Speciation Monitoring Network (CSN) in 2000 to support evaluation of long-term trends and to better quantify the impact of sources on particulate matter (PM) concentrations in the size range belo...

Earthquake Complex Network Analysis Before and After the Mw 8.2 Earthquake in Iquique, Chile

NASA Astrophysics Data System (ADS)

Pasten, D.

2017-12-01

The earthquake complex networks have shown that they are abble to find specific features in seismic data set. In space, this networkshave shown a scale-free behavior for the probability distribution of connectivity, in directed networks and theyhave shown a small-world behavior, for the undirected networks.In this work, we present an earthquake complex network analysis for the large earthquake Mw 8.2 in the north ofChile (near to Iquique) in April, 2014. An earthquake complex network is made dividing the three dimensional space intocubic cells, if one of this cells contain an hypocenter, we name this cell like a node. The connections between nodes aregenerated in time. We follow the time sequence of seismic events and we are making the connections betweennodes. Now, we have two different networks: a directed and an undirected network. Thedirected network takes in consideration the time-direction of the connections, that is very important for the connectivityof the network: we are considering the connectivity, ki of the i-th node, like the number of connections going out ofthe node i plus the self-connections (if two seismic events occurred successive in time in the same cubic cell, we havea self-connection). The undirected network is made removing the direction of the connections and the self-connectionsfrom the directed network. For undirected networks, we are considering only if two nodes are or not connected.We have built a directed complex network and an undirected complex network, before and after the large earthquake in Iquique. We have used magnitudes greater than Mw = 1.0 and Mw = 3.0. We found that this method can recognize the influence of thissmall seismic events in the behavior of the network and we found that the size of the cell used to build the network isanother important factor to recognize the influence of the large earthquake in this complex system. This method alsoshows a difference in the values of the critical exponent γ (for the probability distribution of connectivity in the directednetwork) before and after the large earthquake, but this method does not show a change in the clustering behavior ofthe undirected network, before and after the large earthquake, showing a small-world behavior for the network beforeand after of this large seismic event.

Centralities in simplicial complexes. Applications to protein interaction networks.

PubMed

Estrada, Ernesto; Ross, Grant J

2018-02-07

Complex networks can be used to represent complex systems which originate in the real world. Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex. We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness, betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes. We study the degree distributions of these centralities at the different levels. We also compare and describe the differences between the centralities at the different levels. Using these centralities we study a method for detecting essential proteins in PPI networks of cells and explain the varying abilities of the centrality measures at the different levels in identifying these essential proteins. Copyright © 2017 Elsevier Ltd. All rights reserved.

Enabling Controlling Complex Networks with Local Topological Information.

PubMed

Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene

2018-03-15

Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.

Terminal-oriented computer-communication networks.

NASA Technical Reports Server (NTRS)

Schwartz, M.; Boorstyn, R. R.; Pickholtz, R. L.

1972-01-01

Four examples of currently operating computer-communication networks are described in this tutorial paper. They include the TYMNET network, the GE Information Services network, the NASDAQ over-the-counter stock-quotation system, and the Computer Sciences Infonet. These networks all use programmable concentrators for combining a multiplicity of terminals. Included in the discussion for each network is a description of the overall network structure, the handling and transmission of messages, communication requirements, routing and reliability consideration where applicable, operating data and design specifications where available, and unique design features in the area of computer communications.

CytoCluster: A Cytoscape Plugin for Cluster Analysis and Visualization of Biological Networks.

PubMed

Li, Min; Li, Dongyan; Tang, Yu; Wu, Fangxiang; Wang, Jianxin

2017-08-31

Nowadays, cluster analysis of biological networks has become one of the most important approaches to identifying functional modules as well as predicting protein complexes and network biomarkers. Furthermore, the visualization of clustering results is crucial to display the structure of biological networks. Here we present CytoCluster, a cytoscape plugin integrating six clustering algorithms, HC-PIN (Hierarchical Clustering algorithm in Protein Interaction Networks), OH-PIN (identifying Overlapping and Hierarchical modules in Protein Interaction Networks), IPCA (Identifying Protein Complex Algorithm), ClusterONE (Clustering with Overlapping Neighborhood Expansion), DCU (Detecting Complexes based on Uncertain graph model), IPC-MCE (Identifying Protein Complexes based on Maximal Complex Extension), and BinGO (the Biological networks Gene Ontology) function. Users can select different clustering algorithms according to their requirements. The main function of these six clustering algorithms is to detect protein complexes or functional modules. In addition, BinGO is used to determine which Gene Ontology (GO) categories are statistically overrepresented in a set of genes or a subgraph of a biological network. CytoCluster can be easily expanded, so that more clustering algorithms and functions can be added to this plugin. Since it was created in July 2013, CytoCluster has been downloaded more than 9700 times in the Cytoscape App store and has already been applied to the analysis of different biological networks. CytoCluster is available from http://apps.cytoscape.org/apps/cytocluster.

CytoCluster: A Cytoscape Plugin for Cluster Analysis and Visualization of Biological Networks

PubMed Central

Li, Min; Li, Dongyan; Tang, Yu; Wang, Jianxin

2017-01-01

Nowadays, cluster analysis of biological networks has become one of the most important approaches to identifying functional modules as well as predicting protein complexes and network biomarkers. Furthermore, the visualization of clustering results is crucial to display the structure of biological networks. Here we present CytoCluster, a cytoscape plugin integrating six clustering algorithms, HC-PIN (Hierarchical Clustering algorithm in Protein Interaction Networks), OH-PIN (identifying Overlapping and Hierarchical modules in Protein Interaction Networks), IPCA (Identifying Protein Complex Algorithm), ClusterONE (Clustering with Overlapping Neighborhood Expansion), DCU (Detecting Complexes based on Uncertain graph model), IPC-MCE (Identifying Protein Complexes based on Maximal Complex Extension), and BinGO (the Biological networks Gene Ontology) function. Users can select different clustering algorithms according to their requirements. The main function of these six clustering algorithms is to detect protein complexes or functional modules. In addition, BinGO is used to determine which Gene Ontology (GO) categories are statistically overrepresented in a set of genes or a subgraph of a biological network. CytoCluster can be easily expanded, so that more clustering algorithms and functions can be added to this plugin. Since it was created in July 2013, CytoCluster has been downloaded more than 9700 times in the Cytoscape App store and has already been applied to the analysis of different biological networks. CytoCluster is available from http://apps.cytoscape.org/apps/cytocluster. PMID:28858211

Complexities’ day-to-day dynamic evolution analysis and prediction for a Didi taxi trip network based on complex network theory

NASA Astrophysics Data System (ADS)

Zhang, Lin; Lu, Jian; Zhou, Jialin; Zhu, Jinqing; Li, Yunxuan; Wan, Qian

2018-03-01

Didi Dache is the most popular taxi order mobile app in China, which provides online taxi-hailing service. The obtained big database from this app could be used to analyze the complexities’ day-to-day dynamic evolution of Didi taxi trip network (DTTN) from the level of complex network dynamics. First, this paper proposes the data cleaning and modeling methods for expressing Nanjing’s DTTN as a complex network. Second, the three consecutive weeks’ data are cleaned to establish 21 DTTNs based on the proposed big data processing technology. Then, multiple topology measures that characterize the complexities’ day-to-day dynamic evolution of these networks are provided. Third, these measures of 21 DTTNs are calculated and subsequently explained with actual implications. They are used as a training set for modeling the BP neural network which is designed for predicting DTTN complexities evolution. Finally, the reliability of the designed BP neural network is verified by comparing with the actual data and the results obtained from ARIMA method simultaneously. Because network complexities are the basis for modeling cascading failures and conducting link prediction in complex system, this proposed research framework not only provides a novel perspective for analyzing DTTN from the level of system aggregated behavior, but can also be used to improve the DTTN management level.

Construction of ontology augmented networks for protein complex prediction.

PubMed

Zhang, Yijia; Lin, Hongfei; Yang, Zhihao; Wang, Jian

2013-01-01

Protein complexes are of great importance in understanding the principles of cellular organization and function. The increase in available protein-protein interaction data, gene ontology and other resources make it possible to develop computational methods for protein complex prediction. Most existing methods focus mainly on the topological structure of protein-protein interaction networks, and largely ignore the gene ontology annotation information. In this article, we constructed ontology augmented networks with protein-protein interaction data and gene ontology, which effectively unified the topological structure of protein-protein interaction networks and the similarity of gene ontology annotations into unified distance measures. After constructing ontology augmented networks, a novel method (clustering based on ontology augmented networks) was proposed to predict protein complexes, which was capable of taking into account the topological structure of the protein-protein interaction network, as well as the similarity of gene ontology annotations. Our method was applied to two different yeast protein-protein interaction datasets and predicted many well-known complexes. The experimental results showed that (i) ontology augmented networks and the unified distance measure can effectively combine the structure closeness and gene ontology annotation similarity; (ii) our method is valuable in predicting protein complexes and has higher F1 and accuracy compared to other competing methods.

The new Langley Research Center advanced real-time simulation (ARTS) system

NASA Technical Reports Server (NTRS)

Crawford, D. J.; Cleveland, J. I., II

1986-01-01

Based on a survey of current local area network technology with special attention paid to high bandwidth and very low transport delay requirements, NASA's Langley Research Center designed a new simulation subsystem using the computer automated measurement and control (CAMAC) network. This required significant modifications to the standard CAMAC system and development of a network switch, a clocking system, new conversion equipment, new consoles, supporting software, etc. This system is referred to as the advanced real-time simulation (ARTS) system. It is presently being built at LaRC. This paper provides a functional and physical description of the hardware and a functional description of the software. The requirements which drove the design are presented as well as present performance figures and status.

MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure

PubMed Central

2010-01-01

Background The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of the cell. Over the past few years, several independent high-throughput experiments have helped to catalogue enormous amount of physical protein interaction data from organisms such as yeast. However, these individual datasets show lack of correlation with each other and also contain substantial number of false positives (noise). Over these years, several affinity scoring schemes have also been devised to improve the qualities of these datasets. Therefore, the challenge now is to detect meaningful as well as novel complexes from protein interaction (PPI) networks derived by combining datasets from multiple sources and by making use of these affinity scoring schemes. In the attempt towards tackling this challenge, the Markov Clustering algorithm (MCL) has proved to be a popular and reasonably successful method, mainly due to its scalability, robustness, and ability to work on scored (weighted) networks. However, MCL produces many noisy clusters, which either do not match known complexes or have additional proteins that reduce the accuracies of correctly predicted complexes. Results Inspired by recent experimental observations by Gavin and colleagues on the modularity structure in yeast complexes and the distinctive properties of "core" and "attachment" proteins, we develop a core-attachment based refinement method coupled to MCL for reconstruction of yeast complexes from scored (weighted) PPI networks. We combine physical interactions from two recent "pull-down" experiments to generate an unscored PPI network. We then score this network using available affinity scoring schemes to generate multiple scored PPI networks. The evaluation of our method (called MCL-CAw) on these networks shows that: (i) MCL-CAw derives larger number of yeast complexes and with better accuracies than MCL, particularly in the presence of natural noise; (ii) Affinity scoring can effectively reduce the impact of noise on MCL-CAw and thereby improve the quality (precision and recall) of its predicted complexes; (iii) MCL-CAw responds well to most available scoring schemes. We discuss several instances where MCL-CAw was successful in deriving meaningful complexes, and where it missed a few proteins or whole complexes due to affinity scoring of the networks. We compare MCL-CAw with several recent complex detection algorithms on unscored and scored networks, and assess the relative performance of the algorithms on these networks. Further, we study the impact of augmenting physical datasets with computationally inferred interactions for complex detection. Finally, we analyse the essentiality of proteins within predicted complexes to understand a possible correlation between protein essentiality and their ability to form complexes. Conclusions We demonstrate that core-attachment based refinement in MCL-CAw improves the predictions of MCL on yeast PPI networks. We show that affinity scoring improves the performance of MCL-CAw. PMID:20939868

Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison

NASA Astrophysics Data System (ADS)

De Domenico, Manlio; Biamonte, Jacob

2016-10-01

Any physical system can be viewed from the perspective that information is implicitly represented in its state. However, the quantification of this information when it comes to complex networks has remained largely elusive. In this work, we use techniques inspired by quantum statistical mechanics to define an entropy measure for complex networks and to develop a set of information-theoretic tools, based on network spectral properties, such as Rényi q entropy, generalized Kullback-Leibler and Jensen-Shannon divergences, the latter allowing us to define a natural distance measure between complex networks. First, we show that by minimizing the Kullback-Leibler divergence between an observed network and a parametric network model, inference of model parameter(s) by means of maximum-likelihood estimation can be achieved and model selection can be performed with appropriate information criteria. Second, we show that the information-theoretic metric quantifies the distance between pairs of networks and we can use it, for instance, to cluster the layers of a multilayer system. By applying this framework to networks corresponding to sites of the human microbiome, we perform hierarchical cluster analysis and recover with high accuracy existing community-based associations. Our results imply that spectral-based statistical inference in complex networks results in demonstrably superior performance as well as a conceptual backbone, filling a gap towards a network information theory.

Advanced functional network analysis in the geosciences: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Runge, Jakob; Schultz, Hanna C. H.; Wiedermann, Marc; Zech, Alraune; Feldhoff, Jan; Rheinwalt, Aljoscha; Kutza, Hannes; Radebach, Alexander; Marwan, Norbert; Kurths, Jürgen

2013-04-01

Functional networks are a powerful tool for analyzing large geoscientific datasets such as global fields of climate time series originating from observations or model simulations. pyunicorn (pythonic unified complex network and recurrence analysis toolbox) is an open-source, fully object-oriented and easily parallelizable package written in the language Python. It allows for constructing functional networks (aka climate networks) representing the structure of statistical interrelationships in large datasets and, subsequently, investigating this structure using advanced methods of complex network theory such as measures for networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn allows to study the complex dynamics of geoscientific systems as recorded by time series by means of recurrence networks and visibility graphs. The range of possible applications of the package is outlined drawing on several examples from climatology.

Percolation of localized attack on complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2015-02-01

The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks are neither random nor hub-targeted, but localized, where a group of neighboring nodes in a network are attacked and fail. In this paper we develop a percolation framework to analytically and numerically study the robustness of complex networks against such localized attack. In particular, we investigate this robustness in Erdős-Rényi networks, random-regular networks, and scale-free networks. Our results provide insight into how to better protect networks, enhance cybersecurity, and facilitate the design of more robust infrastructures.

Emergence of criticality in the transportation passenger flow: scaling and renormalization in the Seoul bus system.

PubMed

Goh, Segun; Lee, Keumsook; Choi, Moo Young; Fortin, Jean-Yves

2014-01-01

Social systems have recently attracted much attention, with attempts to understand social behavior with the aid of statistical mechanics applied to complex systems. Collective properties of such systems emerge from couplings between components, for example, individual persons, transportation nodes such as airports or subway stations, and administrative districts. Among various collective properties, criticality is known as a characteristic property of a complex system, which helps the systems to respond flexibly to external perturbations. This work considers the criticality of the urban transportation system entailed in the massive smart card data on the Seoul transportation network. Analyzing the passenger flow on the Seoul bus system during one week, we find explicit power-law correlations in the system, that is, power-law behavior of the strength correlation function of bus stops and verify scale invariance of the strength fluctuations. Such criticality is probed by means of the scaling and renormalization analysis of the modified gravity model applied to the system. Here a group of nearby (bare) bus stops are transformed into a (renormalized) "block stop" and the scaling relations of the network density turn out to be closely related to the fractal dimensions of the system, revealing the underlying structure. Specifically, the resulting renormalized values of the gravity exponent and of the Hill coefficient give a good description of the Seoul bus system: The former measures the characteristic dimensionality of the network whereas the latter reflects the coupling between distinct transportation modes. It is thus demonstrated that such ideas of physics as scaling and renormalization can be applied successfully to social phenomena exemplified by the passenger flow.

Emergence of Criticality in the Transportation Passenger Flow: Scaling and Renormalization in the Seoul Bus System

PubMed Central

Goh, Segun; Lee, Keumsook; Choi, MooYoung; Fortin, Jean-Yves

2014-01-01

Social systems have recently attracted much attention, with attempts to understand social behavior with the aid of statistical mechanics applied to complex systems. Collective properties of such systems emerge from couplings between components, for example, individual persons, transportation nodes such as airports or subway stations, and administrative districts. Among various collective properties, criticality is known as a characteristic property of a complex system, which helps the systems to respond flexibly to external perturbations. This work considers the criticality of the urban transportation system entailed in the massive smart card data on the Seoul transportation network. Analyzing the passenger flow on the Seoul bus system during one week, we find explicit power-law correlations in the system, that is, power-law behavior of the strength correlation function of bus stops and verify scale invariance of the strength fluctuations. Such criticality is probed by means of the scaling and renormalization analysis of the modified gravity model applied to the system. Here a group of nearby (bare) bus stops are transformed into a (renormalized) “block stop” and the scaling relations of the network density turn out to be closely related to the fractal dimensions of the system, revealing the underlying structure. Specifically, the resulting renormalized values of the gravity exponent and of the Hill coefficient give a good description of the Seoul bus system: The former measures the characteristic dimensionality of the network whereas the latter reflects the coupling between distinct transportation modes. It is thus demonstrated that such ideas of physics as scaling and renormalization can be applied successfully to social phenomena exemplified by the passenger flow. PMID:24599221

Local network assessment

NASA Astrophysics Data System (ADS)

Glen, D. V.

1985-04-01

Local networks, related standards activities of the Institute of Electrical and Electronics Engineers the American National Standards Institute and other elements are presented. These elements include: (1) technology choices such as topology, transmission media, and access protocols; (2) descriptions of standards for the 802 local area networks (LAN's); high speed local networks (HSLN's) and military specification local networks; and (3) intra- and internetworking using bridges and gateways with protocols Interconnection (OSI) reference model. The convergence of LAN/PBX technology is also described.

Decision support systems and methods for complex networks

DOEpatents

Huang, Zhenyu [Richland, WA; Wong, Pak Chung [Richland, WA; Ma, Jian [Richland, WA; Mackey, Patrick S [Richland, WA; Chen, Yousu [Richland, WA; Schneider, Kevin P [Seattle, WA

2012-02-28

Methods and systems for automated decision support in analyzing operation data from a complex network. Embodiments of the present invention utilize these algorithms and techniques not only to characterize the past and present condition of a complex network, but also to predict future conditions to help operators anticipate deteriorating and/or problem situations. In particular, embodiments of the present invention characterize network conditions from operation data using a state estimator. Contingency scenarios can then be generated based on those network conditions. For at least a portion of all of the contingency scenarios, risk indices are determined that describe the potential impact of each of those scenarios. Contingency scenarios with risk indices are presented visually as graphical representations in the context of a visual representation of the complex network. Analysis of the historical risk indices based on the graphical representations can then provide trends that allow for prediction of future network conditions.

A universal indicator of critical state transitions in noisy complex networked systems

PubMed Central

Liang, Junhao; Hu, Yanqing; Chen, Guanrong; Zhou, Tianshou

2017-01-01

Critical transition, a phenomenon that a system shifts suddenly from one state to another, occurs in many real-world complex networks. We propose an analytical framework for exactly predicting the critical transition in a complex networked system subjected to noise effects. Our prediction is based on the characteristic return time of a simple one-dimensional system derived from the original higher-dimensional system. This characteristic time, which can be easily calculated using network data, allows us to systematically separate the respective roles of dynamics, noise and topology of the underlying networked system. We find that the noise can either prevent or enhance critical transitions, playing a key role in compensating the network structural defect which suffers from either internal failures or environmental changes, or both. Our analysis of realistic or artificial examples reveals that the characteristic return time is an effective indicator for forecasting the sudden deterioration of complex networks. PMID:28230166

Adaptive exponential synchronization of complex-valued Cohen-Grossberg neural networks with known and unknown parameters.

PubMed

Hu, Jin; Zeng, Chunna

2017-02-01

The complex-valued Cohen-Grossberg neural network is a special kind of complex-valued neural network. In this paper, the synchronization problem of a class of complex-valued Cohen-Grossberg neural networks with known and unknown parameters is investigated. By using Lyapunov functionals and the adaptive control method based on parameter identification, some adaptive feedback schemes are proposed to achieve synchronization exponentially between the drive and response systems. The results obtained in this paper have extended and improved some previous works on adaptive synchronization of Cohen-Grossberg neural networks. Finally, two numerical examples are given to demonstrate the effectiveness of the theoretical results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Epidemic threshold of the susceptible-infected-susceptible model on complex networks

NASA Astrophysics Data System (ADS)

Lee, Hyun Keun; Shim, Pyoung-Seop; Noh, Jae Dong

2013-06-01

We demonstrate that the susceptible-infected-susceptible (SIS) model on complex networks can have an inactive Griffiths phase characterized by a slow relaxation dynamics. It contrasts with the mean-field theoretical prediction that the SIS model on complex networks is active at any nonzero infection rate. The dynamic fluctuation of infected nodes, ignored in the mean field approach, is responsible for the inactive phase. It is proposed that the question whether the epidemic threshold of the SIS model on complex networks is zero or not can be resolved by the percolation threshold in a model where nodes are occupied in degree-descending order. Our arguments are supported by the numerical studies on scale-free network models.

Bell Inequalities for Complex Networks

DTIC Science & Technology

2015-10-26

AFRL-AFOSR-VA-TR-2015-0355 YIP Bell Inequalities for Complex Networks Greg Ver Steeg UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES Final Report 10/26...performance report PI: Greg Ver Steeg Young Investigator Award Grant Title: Bell Inequalities for Complex Networks Grant #: FA9550-12-1-0417 Reporting...October 20, 2015 Final Report for “Bell Inequalities for Complex Networks” Greg Ver Steeg Abstract This effort studied new methods to understand the effect

A complex-network perspective on Alexander's wholeness

NASA Astrophysics Data System (ADS)

Jiang, Bin

2016-12-01

The wholeness, conceived and developed by Christopher Alexander, is what exists to some degree or other in space and matter, and can be described by precise mathematical language. However, it remains somehow mysterious and elusive, and therefore hard to grasp. This paper develops a complex network perspective on the wholeness to better understand the nature of order or beauty for sustainable design. I bring together a set of complexity-science subjects such as complex networks, fractal geometry, and in particular underlying scaling hierarchy derived by head/tail breaks - a classification scheme and a visualization tool for data with a heavy-tailed distribution, in order to make Alexander's profound thoughts more accessible to design practitioners and complexity-science researchers. Through several case studies (some of which Alexander studied), I demonstrate that the complex-network perspective helps reduce the mystery of wholeness and brings new insights to Alexander's thoughts on the concept of wholeness or objective beauty that exists in fine and deep structure. The complex-network perspective enables us to see things in their wholeness, and to better understand how the kind of structural beauty emerges from local actions guided by the 15 fundamental properties, and in particular by differentiation and adaptation processes. The wholeness goes beyond current complex network theory towards design or creation of living structures.

Identifying influential nodes in complex networks: A node information dimension approach

NASA Astrophysics Data System (ADS)

Bian, Tian; Deng, Yong

2018-04-01

In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method.

The Curriculum Prerequisite Network: Modeling the Curriculum as a Complex System

ERIC Educational Resources Information Center

Aldrich, Preston R.

2015-01-01

This article advances the prerequisite network as a means to visualize the hidden structure in an academic curriculum. Networks have been used to represent a variety of complex systems ranging from social systems to biochemical pathways and protein interactions. Here, I treat the academic curriculum as a complex system with nodes representing…

Self-organization of network dynamics into local quantized states.

PubMed

Nicolaides, Christos; Juanes, Ruben; Cueto-Felgueroso, Luis

2016-02-17

Self-organization and pattern formation in network-organized systems emerges from the collective activation and interaction of many interconnected units. A striking feature of these non-equilibrium structures is that they are often localized and robust: only a small subset of the nodes, or cell assembly, is activated. Understanding the role of cell assemblies as basic functional units in neural networks and socio-technical systems emerges as a fundamental challenge in network theory. A key open question is how these elementary building blocks emerge, and how they operate, linking structure and function in complex networks. Here we show that a network analogue of the Swift-Hohenberg continuum model-a minimal-ingredients model of nodal activation and interaction within a complex network-is able to produce a complex suite of localized patterns. Hence, the spontaneous formation of robust operational cell assemblies in complex networks can be explained as the result of self-organization, even in the absence of synaptic reinforcements.

Pinning impulsive control algorithms for complex network

NASA Astrophysics Data System (ADS)

Sun, Wen; Lü, Jinhu; Chen, Shihua; Yu, Xinghuo

2014-03-01

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

Systematic Assessment of the Impact of User Roles on Network Flow Patterns

DTIC Science & Technology

2017-09-01

Protocol SNMP Simple Network Management Protocol SQL Structured Query Language SSH Secure Shell SYN TCP Sync Flag SVDD Support Vector Data Description SVM...and evaluating users based on roles provide the best approach for defining normal digital behaviors? People are individuals, with different interests...activities on the network. We evaluate the assumption that users sharing similar roles exhibit similar network behaviors, and contrast the level of similarity

Functional and nonfunctional testing of ATM networks

NASA Astrophysics Data System (ADS)

Ricardo, Manuel; Ferreira, M. E. P.; Guimaraes, Francisco E.; Mamede, J.; Henriques, M.; da Silva, Jorge A.; Carrapatoso, E.

1995-02-01

ATM network will support new multimedia services that will require new protocols, those services and protocols will need different test strategies and tools. In this paper, the concepts of functional and non-functional testers of ATM networks are discussed, a multimedia service and its requirements are presented and finally, a summary description of an ATM network and of the test tool that will be used to validate it are presented.

Hybrid stochastic simplifications for multiscale gene networks

PubMed Central

Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

2009-01-01

Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach. PMID:19735554

Error and attack tolerance of complex networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Jeong, Hawoong; Barabási, Albert-László

2000-07-01

Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network. Complex communication networks display a surprising degree of robustness: although key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. Here we demonstrate that error tolerance is not shared by all redundant systems: it is displayed only by a class of inhomogeneously wired networks, called scale-free networks, which include the World-Wide Web, the Internet, social networks and cells. We find that such networks display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates. However, error tolerance comes at a high price in that these networks are extremely vulnerable to attacks (that is, to the selection and removal of a few nodes that play a vital role in maintaining the network's connectivity). Such error tolerance and attack vulnerability are generic properties of communication networks.

Blood Perfusion in Microfluidic Models of Pulmonary Capillary Networks: Role of Geometry and Hematocrit

NASA Astrophysics Data System (ADS)

Stauber, Hagit; Waisman, Dan; Sznitman, Josue; Technion-IIT Team; Department of Neonatology Carmel Medical Center; Faculty of Medicine-Technion IIT Collaboration

2015-11-01

Microfluidic platforms are increasingly used to study blood microflows at true physiological scale due to their ability to overcome manufacturing obstacle of complex anatomical morphologies, such as the organ-specific architectures of the microcirculation. In the present work, we utilize microfluidic platforms to devise in vitro models of the underlying pulmonary capillary networks (PCN), where capillary lengths and diameters are similar to the size of RBCs (~ 5-10 μm). To better understand flow characteristics and dispersion of red blood cells (RBCs) in PCNs, we have designed microfluidic models of alveolar capillary beds inspired by the seminal ``sheet flow'' model of Fung and Sobin (1969). Our microfluidic PCNs feature confined arrays of staggered pillars with diameters of ~ 5,7 and 10 μm, mimicking the dense structure of pulmonary capillary meshes. The devices are perfused with suspensions of RBCs at varying hematocrit levels under different flow rates. Whole-field velocity patterns using micro-PIV and single-cell tracking using PTV are obtained with fluorescently-labelled RBCs and discussed. Our experiments deliver a real-scale quantitative description of RBC perfusion characteristics across the pulmonary capillary microcirculation.

Fluctuations and Noise in Stochastic Spread of Respiratory Infection Epidemics in Social Networks

NASA Astrophysics Data System (ADS)

Yulmetyev, Renat; Emelyanova, Natalya; Demin, Sergey; Gafarov, Fail; Hänggi, Peter; Yulmetyeva, Dinara

2003-05-01

For the analysis of epidemic and disease dynamics complexity, it is necessary to understand the basic principles and notions of its spreading in long-time memory media. Here we considering the problem from a theoretical and practical viewpoint, presenting the quantitative evidence confirming the existence of stochastic long-range memory and robust chaos in a real time series of respiratory infections of human upper respiratory track. In this work we present a new statistical method of analyzing the spread of grippe and acute respiratory track infections epidemic process of human upper respiratory track by means of the theory of discrete non-Markov stochastic processes. We use the results of our recent theory (Phys. Rev. E 65, 046107 (2002)) for the study of statistical effects of memory in real data series, describing the epidemic dynamics of human acute respiratory track infections and grippe. The obtained results testify to an opportunity of the strict quantitative description of the regular and stochastic components in epidemic dynamics of social networks with a view to time discreteness and effects of statistical memory.

Optimal one-way and roundtrip journeys design by mixed-integer programming

NASA Astrophysics Data System (ADS)

Ribeiro, Isabel M.; Vale, Cecília

2017-12-01

The introduction of multimodal/intermodal networks in transportation problems, especially when considering roundtrips, adds complexity to the models. This article presents two models for the optimization of intermodal trips as a contribution to the integration of transport modes in networks. The first model is devoted to one-way trips while the second one is dedicated to roundtrips. The original contribution of this research to transportation is mainly the consideration of roundtrips in the optimization process of intermodal transport, especially because the transport mode between two nodes on the return trip should be the same as the one on the outward trip if both nodes are visited on the return trip, which is a valuable aspect for transport companies. The mathematical formulations of both models leads to mixed binary linear programs, which is not a common approach for this type of problem. In this article, as well as the model description, computational experience is included to highlight the importance and efficiency of the proposed models, which may provide a valuable tool for transport managers.

The Glymphatic Pathway.

PubMed

Benveniste, Helene; Lee, Hedok; Volkow, Nora D

2017-01-01

The overall premise of this review is that cerebrospinal fluid (CSF) is transported within a dedicated peri-vascular network facilitating metabolic waste clearance from the central nervous system while we sleep. The anatomical profile of the network is complex and has been defined as a peri-arterial CSF influx pathway and peri-venous clearance routes, which are functionally coupled by interstitial bulk flow supported by astrocytic aquaporin 4 water channels. The role of the newly discovered system in the brain is equivalent to the lymphatic system present in other body organs and has been termed the "glymphatic pathway" or "(g)lymphatics" because of its dependence on glial cells. We will discuss and review the general anatomy and physiology of CSF from the perspective of the glymphatic pathway, a discovery which has greatly improved our understanding of key factors that control removal of metabolic waste products from the central nervous system in health and disease and identifies an additional purpose for sleep. A brief historical and factual description of CSF production and transport will precede the ensuing discussion of the glymphatic system along with a discussion of its clinical implications.

Vaccinomics, adversomics, and the immune response network theory: Individualized vaccinology in the 21st century

PubMed Central

Poland, Gregory A.; Kennedy, Richard B.; McKinney, Brett A.; Ovsyannikova, Inna G.; Lambert, Nathaniel D.; Jacobson, Robert M.; Oberg, Ann L.

2013-01-01

Vaccines, like drugs and medical procedures, are increasingly amenable to individualization or personalization, often based on novel data resulting from high throughput “omics” technologies. As a result of these technologies, 21st century vaccinology will increasingly see the abandonment of a “one size fits all” approach to vaccine dosing and delivery, as well as the abandonment of the empiric “isolate–inactivate–inject” paradigm for vaccine development. In this review, we discuss the immune response network theory and its application to the new field of vaccinomics and adversomics, and illustrate how vaccinomics can lead to new vaccine candidates, new understandings of how vaccines stimulate immune responses, new biomarkers for vaccine response, and facilitate the understanding of what genetic and other factors might be responsible for rare side effects due to vaccines. Perhaps most exciting will be the ability, at a systems biology level, to integrate increasingly complex high throughput data into descriptive and predictive equations for immune responses to vaccines. Herein, we discuss the above with a view toward the future of vaccinology. PMID:23755893

Transnational Research Networks in Chinese Scientific Production. An Investigation on Health-Industry Related Sectors.

PubMed

Rubini, Lauretta; Pollio, Chiara; Di Tommaso, Marco R

2017-08-29

Transnational research networks (TRN) are becoming increasingly complex. Such complexity may have both positive and negative effects on the quality of research. Our work studies the evolution over time of Chinese TRN and the role of complexity on the quality of Chinese research, given the leading role this country has recently acquired in international science. We focus on the fields of geriatrics and gerontology. We build an original dataset of all scientific publications of China in these areas in 2009, 2012 and 2015, starting from the ISI Web of Knowledge (ISI WoK) database. Using Social Network Analysis (SNA), we analyze the change in scientific network structure across time. Second, we design indices to control for the different aspects of networks complexity (number of authors, country heterogeneity and institutional heterogeneity) and we perform negative binomial regressions to identify the main determinants of research quality. Our analysis shows that research networks in the field of geriatrics and gerontology have gradually become wider in terms of countries and have become more balanced. Furthermore, our results identify that different forms of complexity have different impacts on quality, including a reciprocal moderating effect. In particular, according to our analysis, research quality benefits from complex research networks both in terms of countries and of types of institutions involved, but that such networks should be "compact" in terms of number of authors. Eventually, we suggest that complexity should be carefully taken into account when designing policies aimed at enhancing the quality of research.

Meta-modeling of the pesticide fate model MACRO for groundwater exposure assessments using artificial neural networks

NASA Astrophysics Data System (ADS)

Stenemo, Fredrik; Lindahl, Anna M. L.; Gärdenäs, Annemieke; Jarvis, Nicholas

2007-08-01

Several simple index methods that use easily accessible data have been developed and included in decision-support systems to estimate pesticide leaching across larger areas. However, these methods often lack important process descriptions (e.g. macropore flow), which brings into question their reliability. Descriptions of macropore flow have been included in simulation models, but these are too complex and demanding for spatial applications. To resolve this dilemma, a neural network simulation meta-model of the dual-permeability macropore flow model MACRO was created for pesticide groundwater exposure assessment. The model was parameterized using pedotransfer functions that require as input the clay and sand content of the topsoil and subsoil, and the topsoil organic carbon content. The meta-model also requires the topsoil pesticide half-life and the soil organic carbon sorption coefficient as input. A fully connected feed-forward multilayer perceptron classification network with two hidden layers, linked to fully connected feed-forward multilayer perceptron neural networks with one hidden layer, trained on sub-sets of the target variable, was shown to be a suitable meta-model for the intended purpose. A Fourier amplitude sensitivity test showed that the model output (the 80th percentile average yearly pesticide concentration at 1 m depth for a 20 year simulation period) was sensitive to all input parameters. The two input parameters related to pesticide characteristics (i.e. soil organic carbon sorption coefficient and topsoil pesticide half-life) were the most influential, but texture in the topsoil was also quite important since it was assumed to control the mass exchange coefficient that regulates the strength of macropore flow. This is in contrast to models based on the advection-dispersion equation where soil texture is relatively unimportant. The use of the meta-model is exemplified with a case-study where the spatial variability of pesticide leaching is mapped for a small field. It was shown that the area of the field that contributes most to leaching depends on the properties of the compound in question. It is concluded that the simulation meta-model of MACRO should prove useful for mapping relative pesticide leaching risks at large scales.

Fusion of shallow and deep features for classification of high-resolution remote sensing images

NASA Astrophysics Data System (ADS)

Gao, Lang; Tian, Tian; Sun, Xiao; Li, Hang

2018-02-01

Effective spectral and spatial pixel description plays a significant role for the classification of high resolution remote sensing images. Current approaches of pixel-based feature extraction are of two main kinds: one includes the widelyused principal component analysis (PCA) and gray level co-occurrence matrix (GLCM) as the representative of the shallow spectral and shape features, and the other refers to the deep learning-based methods which employ deep neural networks and have made great promotion on classification accuracy. However, the former traditional features are insufficient to depict complex distribution of high resolution images, while the deep features demand plenty of samples to train the network otherwise over fitting easily occurs if only limited samples are involved in the training. In view of the above, we propose a GLCM-based convolution neural network (CNN) approach to extract features and implement classification for high resolution remote sensing images. The employment of GLCM is able to represent the original images and eliminate redundant information and undesired noises. Meanwhile, taking shallow features as the input of deep network will contribute to a better guidance and interpretability. In consideration of the amount of samples, some strategies such as L2 regularization and dropout methods are used to prevent over-fitting. The fine-tuning strategy is also used in our study to reduce training time and further enhance the generalization performance of the network. Experiments with popular data sets such as PaviaU data validate that our proposed method leads to a performance improvement compared to individual involved approaches.

Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes

NASA Astrophysics Data System (ADS)

Kyriakopoulos, Charalampos; Grossmann, Gerrit; Wolf, Verena; Bortolussi, Luca

2018-01-01

Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree kmax of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large kmax. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.

Network model of bilateral power markets based on complex networks

NASA Astrophysics Data System (ADS)

Wu, Yang; Liu, Junyong; Li, Furong; Yan, Zhanxin; Zhang, Li

2014-06-01

The bilateral power transaction (BPT) mode becomes a typical market organization with the restructuring of electric power industry, the proper model which could capture its characteristics is in urgent need. However, the model is lacking because of this market organization's complexity. As a promising approach to modeling complex systems, complex networks could provide a sound theoretical framework for developing proper simulation model. In this paper, a complex network model of the BPT market is proposed. In this model, price advantage mechanism is a precondition. Unlike other general commodity transactions, both of the financial layer and the physical layer are considered in the model. Through simulation analysis, the feasibility and validity of the model are verified. At same time, some typical statistical features of BPT network are identified. Namely, the degree distribution follows the power law, the clustering coefficient is low and the average path length is a bit long. Moreover, the topological stability of the BPT network is tested. The results show that the network displays a topological robustness to random market member's failures while it is fragile against deliberate attacks, and the network could resist cascading failure to some extent. These features are helpful for making decisions and risk management in BPT markets.

Complex network view of evolving manifolds

NASA Astrophysics Data System (ADS)

da Silva, Diamantino C.; Bianconi, Ginestra; da Costa, Rui A.; Dorogovtsev, Sergey N.; Mendes, José F. F.

2018-03-01

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by the condition that at each step, all the faces must be triangles. Stochastic application of these operations leads to random networks with different architectures. We perform extensive numerical simulations and explore the geometries of growing and equilibrium complex networks generated by these transformations and their local structural properties. This characterization includes the Hausdorff and spectral dimensions of the resulting networks, their degree distributions, and various structural correlations. Our results reveal a rich zoo of architectures and geometries of these networks, some of which appear to be small worlds while others are finite dimensional with Hausdorff dimension equal or higher than the original dimensionality of their simplices. The range of spectral dimensions of the evolving triangulations turns out to be from about 1.4 to infinity. Our models include simplicial complexes representing manifolds with evolving topologies, for example, an h -holed torus with a progressively growing number of holes. This evolving graph demonstrates features of a small-world network and has a particularly heavy-tailed degree distribution.

Modeling the complex activity of sickle cell and thalassemia specialist nurses in England.

PubMed

Leary, Alison; Anionwu, Elizabeth N

2014-01-01

Specialist advanced practice nursing in hemoglobinopathies has a rich historical and descriptive literature. Subsequent work has shown that the role is valued by patients and families and also by other professionals. However, there is little empirical research on the complexity of activity of these services in terms of interventions offered. In addition, the work of clinical nurse specialists in England has been devalued through a perception of oversimplification. The purpose of this study was to understand the complexity of expert nursing practice in sickle cell and thalassemia. The approach taken to modeling complexity was used from common methods in mathematical modeling and computational mathematics. Knowledge discovery through data was the underpinning framework used in this study using a priori mined data. This allowed categorization of activity and articulation of complexity. In total, 8966 nursing events were captured over 1639 hours from a total of 22.8 whole time equivalents, and several data sources were mined. The work of specialist nurses in this area is complex in terms of the physical and psychosocial care they provide. The nurses also undertook case management activity such as utilizing a very large network of professionals, and others participated in admission avoidance work and education of patients' families and other staff. The work of nurses specializing in hemoglobinopathy care is complex and multidimensional and is likely to contribute to the quality of care in a cost-effective way. An understanding of this complexity can be used as an underpinning to establishing key performance indicators, optimum caseload calculations, and economic evaluation.

Practices and Strategies of Self-Initiated Language Learning in an Online Social Network Discussion Forum: A Descriptive Case Study

ERIC Educational Resources Information Center

Hsieh, Hsiu-Wei

2012-01-01

The proliferation of information and communication technologies and the prevalence of online social networks have facilitated the opportunities for informal learning of foreign languages. However, little educational research has been conducted on how individuals utilize those social networks to take part in self-initiated language learning without…

Computers in Curricula Program for Networked College Level Writing Process Instruction: A First Year Report.

ERIC Educational Resources Information Center

Balajthy, Ernest

The first section of this report lists a variety of advantages and disadvantages of educational applications of Local Area Networks (LANs), with descriptive and evaluative comments on how the Union County Computers in the Curricula Network Project (Cranford, New Jersey) dealt with each. The second section of the report describes the following…

Information and material flows in complex networks

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Armbruster, Dieter; Mikhailov, Alexander S.; Lefeber, Erjen

2006-04-01

In this special issue, an overview of the Thematic Institute (TI) on Information and Material Flows in Complex Systems is given. The TI was carried out within EXYSTENCE, the first EU Network of Excellence in the area of complex systems. Its motivation, research approach and subjects are presented here. Among the various methods used are many-particle and statistical physics, nonlinear dynamics, as well as complex systems, network and control theory. The contributions are relevant for complex systems as diverse as vehicle and data traffic in networks, logistics, production, and material flows in biological systems. The key disciplines involved are socio-, econo-, traffic- and bio-physics, and a new research area that could be called “biologistics”.

A depth-first search algorithm to compute elementary flux modes by linear programming

PubMed Central

2014-01-01

Background The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand. Results Based on an alternative elementarity test, we developed a depth-first search algorithm using linear programming (LP) to enumerate EFMs in an exhaustive fashion. Constraints can be introduced to directly generate a subset of EFMs satisfying the set of constraints. The depth-first search algorithm has a constant memory overhead. Using flux constraints, a large LP problem can be massively divided and parallelized into independent sub-jobs for deployment into computing clusters. Since the sub-jobs do not overlap, the approach scales to utilize all available computing nodes with minimal coordination overhead or memory limitations. Conclusions The speed of the algorithm was comparable to efmtool, a mainstream Double Description method, when enumerating all EFMs; the attrition power gained from performing flux feasibility tests offsets the increased computational demand of running an LP solver. Unlike the Double Description method, the algorithm enables accelerated enumeration of all EFMs satisfying a set of constraints. PMID:25074068

Discovering protein complexes in protein interaction networks via exploring the weak ties effect

PubMed Central

2012-01-01

Background Studying protein complexes is very important in biological processes since it helps reveal the structure-functionality relationships in biological networks and much attention has been paid to accurately predict protein complexes from the increasing amount of protein-protein interaction (PPI) data. Most of the available algorithms are based on the assumption that dense subgraphs correspond to complexes, failing to take into account the inherence organization within protein complex and the roles of edges. Thus, there is a critical need to investigate the possibility of discovering protein complexes using the topological information hidden in edges. Results To provide an investigation of the roles of edges in PPI networks, we show that the edges connecting less similar vertices in topology are more significant in maintaining the global connectivity, indicating the weak ties phenomenon in PPI networks. We further demonstrate that there is a negative relation between the weak tie strength and the topological similarity. By using the bridges, a reliable virtual network is constructed, in which each maximal clique corresponds to the core of a complex. By this notion, the detection of the protein complexes is transformed into a classic all-clique problem. A novel core-attachment based method is developed, which detects the cores and attachments, respectively. A comprehensive comparison among the existing algorithms and our algorithm has been made by comparing the predicted complexes against benchmark complexes. Conclusions We proved that the weak tie effect exists in the PPI network and demonstrated that the density is insufficient to characterize the topological structure of protein complexes. Furthermore, the experimental results on the yeast PPI network show that the proposed method outperforms the state-of-the-art algorithms. The analysis of detected modules by the present algorithm suggests that most of these modules have well biological significance in context of complexes, suggesting that the roles of edges are critical in discovering protein complexes. PMID:23046740

Predicting protein complex geometries with a neural network.

PubMed

Chae, Myong-Ho; Krull, Florian; Lorenzen, Stephan; Knapp, Ernst-Walter

2010-03-01

A major challenge of the protein docking problem is to define scoring functions that can distinguish near-native protein complex geometries from a large number of non-native geometries (decoys) generated with noncomplexed protein structures (unbound docking). In this study, we have constructed a neural network that employs the information from atom-pair distance distributions of a large number of decoys to predict protein complex geometries. We found that docking prediction can be significantly improved using two different types of polar hydrogen atoms. To train the neural network, 2000 near-native decoys of even distance distribution were used for each of the 185 considered protein complexes. The neural network normalizes the information from different protein complexes using an additional protein complex identity input neuron for each complex. The parameters of the neural network were determined such that they mimic a scoring funnel in the neighborhood of the native complex structure. The neural network approach avoids the reference state problem, which occurs in deriving knowledge-based energy functions for scoring. We show that a distance-dependent atom pair potential performs much better than a simple atom-pair contact potential. We have compared the performance of our scoring function with other empirical and knowledge-based scoring functions such as ZDOCK 3.0, ZRANK, ITScore-PP, EMPIRE, and RosettaDock. In spite of the simplicity of the method and its functional form, our neural network-based scoring function achieves a reasonable performance in rigid-body unbound docking of proteins. Proteins 2010. (c) 2009 Wiley-Liss, Inc.

A program code generator for multiphysics biological simulation using markup languages.

PubMed

Amano, Akira; Kawabata, Masanari; Yamashita, Yoshiharu; Rusty Punzalan, Florencio; Shimayoshi, Takao; Kuwabara, Hiroaki; Kunieda, Yoshitoshi

2012-01-01

To cope with the complexity of the biological function simulation models, model representation with description language is becoming popular. However, simulation software itself becomes complex in these environment, thus, it is difficult to modify the simulation conditions, target computation resources or calculation methods. In the complex biological function simulation software, there are 1) model equations, 2) boundary conditions and 3) calculation schemes. Use of description model file is useful for first point and partly second point, however, third point is difficult to handle for various calculation schemes which is required for simulation models constructed from two or more elementary models. We introduce a simulation software generation system which use description language based description of coupling calculation scheme together with cell model description file. By using this software, we can easily generate biological simulation code with variety of coupling calculation schemes. To show the efficiency of our system, example of coupling calculation scheme with three elementary models are shown.

Overlapping community detection in weighted networks via a Bayesian approach

NASA Astrophysics Data System (ADS)

Chen, Yi; Wang, Xiaolong; Xiang, Xin; Tang, Buzhou; Chen, Qingcai; Fan, Shixi; Bu, Junzhao

2017-02-01

Complex networks as a powerful way to represent complex systems have been widely studied during the past several years. One of the most important tasks of complex network analysis is to detect communities embedded in networks. In the real world, weighted networks are very common and may contain overlapping communities where a node is allowed to belong to multiple communities. In this paper, we propose a novel Bayesian approach, called the Bayesian mixture network (BMN) model, to detect overlapping communities in weighted networks. The advantages of our method are (i) providing soft-partition solutions in weighted networks; (ii) providing soft memberships, which quantify 'how strongly' a node belongs to a community. Experiments on a large number of real and synthetic networks show that our model has the ability in detecting overlapping communities in weighted networks and is competitive with other state-of-the-art models at shedding light on community partition.

Epidemic outbreaks in complex heterogeneous networks

NASA Astrophysics Data System (ADS)

Moreno, Y.; Pastor-Satorras, R.; Vespignani, A.

2002-04-01

We present a detailed analytical and numerical study for the spreading of infections with acquired immunity in complex population networks. We show that the large connectivity fluctuations usually found in these networks strengthen considerably the incidence of epidemic outbreaks. Scale-free networks, which are characterized by diverging connectivity fluctuations in the limit of a very large number of nodes, exhibit the lack of an epidemic threshold and always show a finite fraction of infected individuals. This particular weakness, observed also in models without immunity, defines a new epidemiological framework characterized by a highly heterogeneous response of the system to the introduction of infected individuals with different connectivity. The understanding of epidemics in complex networks might deliver new insights in the spread of information and diseases in biological and technological networks that often appear to be characterized by complex heterogeneous architectures.

Complex network approach to classifying classical piano compositions

NASA Astrophysics Data System (ADS)

Xin, Chen; Zhang, Huishu; Huang, Jiping

2016-10-01

Complex network has been regarded as a useful tool handling systems with vague interactions. Hence, numerous applications have arised. In this paper we construct complex networks for 770 classical piano compositions of Mozart, Beethoven and Chopin based on musical note pitches and lengths. We find prominent distinctions among network edges of different composers. Some stylized facts can be explained by such parameters of network structures and topologies. Further, we propose two classification methods for music styles and genres according to the discovered distinctions. These methods are easy to implement and the results are sound. This work suggests that complex network could be a decent way to analyze the characteristics of musical notes, since it could provide a deep view into understanding of the relationships among notes in musical compositions and evidence for classification of different composers, styles and genres of music.

Statistically Validated Networks in Bipartite Complex Systems

PubMed Central

Tumminello, Michele; Miccichè, Salvatore; Lillo, Fabrizio; Piilo, Jyrki; Mantegna, Rosario N.

2011-01-01

Many complex systems present an intrinsic bipartite structure where elements of one set link to elements of the second set. In these complex systems, such as the system of actors and movies, elements of one set are qualitatively different than elements of the other set. The properties of these complex systems are typically investigated by constructing and analyzing a projected network on one of the two sets (for example the actor network or the movie network). Complex systems are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set, and this heterogeneity makes it very difficult to discriminate links of the projected network that are just reflecting system's heterogeneity from links relevant to unveil the properties of the system. Here we introduce an unsupervised method to statistically validate each link of a projected network against a null hypothesis that takes into account system heterogeneity. We apply the method to a biological, an economic and a social complex system. The method we propose is able to detect network structures which are very informative about the organization and specialization of the investigated systems, and identifies those relationships between elements of the projected network that cannot be explained simply by system heterogeneity. We also show that our method applies to bipartite systems in which different relationships might have different qualitative nature, generating statistically validated networks in which such difference is preserved. PMID:21483858

Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks

DTIC Science & Technology

2009-09-01

Wireless Sensor Network (WSN) Simulator Research Personnel: Dr. Ali Abu-El Humos Task No. Task Current Status 1 Literature review and problem definition...networks.com/ [2] S. Dulman, P. Havinga, "A Simulation Template for Wireless Sensor Networks ," Supplement of the Sixth International Symposium on Autonomous... Sensor Network (WSN) Simulator 76 I Breakdown of the Research Activity to Tasks 76 II Description of the Tasks 76 Task 1 Literature Review and

ProteoLens: a visual analytic tool for multi-scale database-driven biological network data mining.

PubMed

Huan, Tianxiao; Sivachenko, Andrey Y; Harrison, Scott H; Chen, Jake Y

2008-08-12

New systems biology studies require researchers to understand how interplay among myriads of biomolecular entities is orchestrated in order to achieve high-level cellular and physiological functions. Many software tools have been developed in the past decade to help researchers visually navigate large networks of biomolecular interactions with built-in template-based query capabilities. To further advance researchers' ability to interrogate global physiological states of cells through multi-scale visual network explorations, new visualization software tools still need to be developed to empower the analysis. A robust visual data analysis platform driven by database management systems to perform bi-directional data processing-to-visualizations with declarative querying capabilities is needed. We developed ProteoLens as a JAVA-based visual analytic software tool for creating, annotating and exploring multi-scale biological networks. It supports direct database connectivity to either Oracle or PostgreSQL database tables/views, on which SQL statements using both Data Definition Languages (DDL) and Data Manipulation languages (DML) may be specified. The robust query languages embedded directly within the visualization software help users to bring their network data into a visualization context for annotation and exploration. ProteoLens supports graph/network represented data in standard Graph Modeling Language (GML) formats, and this enables interoperation with a wide range of other visual layout tools. The architectural design of ProteoLens enables the de-coupling of complex network data visualization tasks into two distinct phases: 1) creating network data association rules, which are mapping rules between network node IDs or edge IDs and data attributes such as functional annotations, expression levels, scores, synonyms, descriptions etc; 2) applying network data association rules to build the network and perform the visual annotation of graph nodes and edges according to associated data values. We demonstrated the advantages of these new capabilities through three biological network visualization case studies: human disease association network, drug-target interaction network and protein-peptide mapping network. The architectural design of ProteoLens makes it suitable for bioinformatics expert data analysts who are experienced with relational database management to perform large-scale integrated network visual explorations. ProteoLens is a promising visual analytic platform that will facilitate knowledge discoveries in future network and systems biology studies.

Computing biological functions using BioΨ, a formal description of biological processes based on elementary bricks of actions

PubMed Central

Pérès, Sabine; Felicori, Liza; Rialle, Stéphanie; Jobard, Elodie; Molina, Franck

2010-01-01

Motivation: In the available databases, biological processes are described from molecular and cellular points of view, but these descriptions are represented with text annotations that make it difficult to handle them for computation. Consequently, there is an obvious need for formal descriptions of biological processes. Results: We present a formalism that uses the BioΨ concepts to model biological processes from molecular details to networks. This computational approach, based on elementary bricks of actions, allows us to calculate on biological functions (e.g. process comparison, mapping structure–function relationships, etc.). We illustrate its application with two examples: the functional comparison of proteases and the functional description of the glycolysis network. This computational approach is compatible with detailed biological knowledge and can be applied to different kinds of systems of simulation. Availability: www.sysdiag.cnrs.fr/publications/supplementary-materials/BioPsi_Manager/ Contact: sabine.peres@sysdiag.cnrs.fr; franck.molina@sysdiag.cnrs.fr Supplementary information: Supplementary data are available at Bioinformatics online. PMID:20448138

A spectral approach for the quantitative description of cardiac collagen network from nonlinear optical imaging.

PubMed

Masè, Michela; Cristoforetti, Alessandro; Avogaro, Laura; Tessarolo, Francesco; Piccoli, Federico; Caola, Iole; Pederzolli, Carlo; Graffigna, Angelo; Ravelli, Flavia

2015-01-01

The assessment of collagen structure in cardiac pathology, such as atrial fibrillation (AF), is essential for a complete understanding of the disease. This paper introduces a novel methodology for the quantitative description of collagen network properties, based on the combination of nonlinear optical microscopy with a spectral approach of image processing and analysis. Second-harmonic generation (SHG) microscopy was applied to atrial tissue samples from cardiac surgery patients, providing label-free, selective visualization of the collagen structure. The spectral analysis framework, based on 2D-FFT, was applied to the SHG images, yielding a multiparametric description of collagen fiber orientation (angle and anisotropy indexes) and texture scale (dominant wavelength and peak dispersion indexes). The proof-of-concept application of the methodology showed the capability of our approach to detect and quantify differences in the structural properties of the collagen network in AF versus sinus rhythm patients. These results suggest the potential of our approach in the assessment of collagen properties in cardiac pathologies related to a fibrotic structural component.

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

NASA Technical Reports Server (NTRS)

Moore, J. Strother

1992-01-01

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Discovering functional interdependence relationship in PPI networks for protein complex identification.

PubMed

Lam, Winnie W M; Chan, Keith C C

2012-04-01

Protein molecules interact with each other in protein complexes to perform many vital functions, and different computational techniques have been developed to identify protein complexes in protein-protein interaction (PPI) networks. These techniques are developed to search for subgraphs of high connectivity in PPI networks under the assumption that the proteins in a protein complex are highly interconnected. While these techniques have been shown to be quite effective, it is also possible that the matching rate between the protein complexes they discover and those that are previously determined experimentally be relatively low and the "false-alarm" rate can be relatively high. This is especially the case when the assumption of proteins in protein complexes being more highly interconnected be relatively invalid. To increase the matching rate and reduce the false-alarm rate, we have developed a technique that can work effectively without having to make this assumption. The name of the technique called protein complex identification by discovering functional interdependence (PCIFI) searches for protein complexes in PPI networks by taking into consideration both the functional interdependence relationship between protein molecules and the network topology of the network. The PCIFI works in several steps. The first step is to construct a multiple-function protein network graph by labeling each vertex with one or more of the molecular functions it performs. The second step is to filter out protein interactions between protein pairs that are not functionally interdependent of each other in the statistical sense. The third step is to make use of an information-theoretic measure to determine the strength of the functional interdependence between all remaining interacting protein pairs. Finally, the last step is to try to form protein complexes based on the measure of the strength of functional interdependence and the connectivity between proteins. For performance evaluation, PCIFI was used to identify protein complexes in real PPI network data and the protein complexes it found were matched against those that were previously known in MIPS. The results show that PCIFI can be an effective technique for the identification of protein complexes. The protein complexes it found can match more known protein complexes with a smaller false-alarm rate and can provide useful insights into the understanding of the functional interdependence relationships between proteins in protein complexes.

Turing instability in reaction-diffusion models on complex networks

NASA Astrophysics Data System (ADS)

Ide, Yusuke; Izuhara, Hirofumi; Machida, Takuya

2016-09-01

In this paper, the Turing instability in reaction-diffusion models defined on complex networks is studied. Here, we focus on three types of models which generate complex networks, i.e. the Erdős-Rényi, the Watts-Strogatz, and the threshold network models. From analysis of the Laplacian matrices of graphs generated by these models, we numerically reveal that stable and unstable regions of a homogeneous steady state on the parameter space of two diffusion coefficients completely differ, depending on the network architecture. In addition, we theoretically discuss the stable and unstable regions in the cases of regular enhanced ring lattices which include regular circles, and networks generated by the threshold network model when the number of vertices is large enough.

Practical synchronization on complex dynamical networks via optimal pinning control

NASA Astrophysics Data System (ADS)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Mind Operational Semantics and Brain Operational Architectonics: A Putative Correspondence

PubMed Central

Benedetti, Giulio; Marchetti, Giorgio; Fingelkurts, Alexander A; Fingelkurts, Andrew A

2010-01-01

Despite allowing for the unprecedented visualization of brain functional activity, modern neurobiological techniques have not yet been able to provide satisfactory answers to important questions about the relationship between brain and mind. The aim of this paper is to show how two different but complementary approaches, Mind Operational Semantics (OS) and Brain Operational Architectonics (OA), can help bridge the gap between a specific kind of mental activity—the higher-order reflective thought or linguistic thought—and brain. The fundamental notion that allows the two different approaches to be jointly used under a common framework is that of operation. According to OS, which is based on introspection and linguistic data, the meanings of words can be analyzed in terms of elemental mental operations (EOMC), amongst which those of attention play a key role. Linguistic thought is made possible by special kinds of elements, which OS calls “correlators”, which have the function of tying together the other elements of thought, which OS calls “correlata” (a "correlational network” that is, a sentence, is so formed). Therefore, OS conceives of linguistic thought as a hierarchy of operations of increasing complexity. Likewise, according to OA, which is based on the joint analysis of cognitive and electromagnetic data (EEG and MEG), every conscious phenomenon is brought to existence by the joint operations of many functional and transient neuronal assemblies in the brain. According to OA, the functioning of the brain is always operational (made up of operations), and its structure is characterized by a hierarchy of operations of increasing complexity: single neurons, single assemblies of neurons, synchronized neuronal assemblies or Operational Modules (OM), integrated or complex OMs. The authors put forward the hypothesis that the whole level of OS’s description (EOMC, correlators, and correlational networks) corresponds to the level of OMs (or set of them) of different complexity within OA’s theory: EOMC could correspond to simple OMs, correlators to complex OMs and the correlational network to a set of simple and complex OMs. Finally, a set of experiments is proposed to verify the putative correspondence between OS and OA and prove the existence of an integrated continuum between brain and mind. PMID:21113277

Percolation and Reinforcement on Complex Networks

NASA Astrophysics Data System (ADS)

Yuan, Xin

Complex networks appear in almost every aspect of our daily life and are widely studied in the fields of physics, mathematics, finance, biology and computer science. This work utilizes percolation theory in statistical physics to explore the percolation properties of complex networks and develops a reinforcement scheme on improving network resilience. This dissertation covers two major parts of my Ph.D. research on complex networks: i) probe--in the context of both traditional percolation and k-core percolation--the resilience of complex networks with tunable degree distributions or directed dependency links under random, localized or targeted attacks; ii) develop and propose a reinforcement scheme to eradicate catastrophic collapses that occur very often in interdependent networks. We first use generating function and probabilistic methods to obtain analytical solutions to percolation properties of interest, such as the giant component size and the critical occupation probability. We study uncorrelated random networks with Poisson, bi-Poisson, power-law, and Kronecker-delta degree distributions and construct those networks which are based on the configuration model. The computer simulation results show remarkable agreement with theoretical predictions. We discover an increase of network robustness as the degree distribution broadens and a decrease of network robustness as directed dependency links come into play under random attacks. We also find that targeted attacks exert the biggest damage to the structure of both single and interdependent networks in k-core percolation. To strengthen the resilience of interdependent networks, we develop and propose a reinforcement strategy and obtain the critical amount of reinforced nodes analytically for interdependent Erdḧs-Renyi networks and numerically for scale-free and for random regular networks. Our mechanism leads to improvement of network stability of the West U.S. power grid. This dissertation provides us with a deeper understanding of the effects of structural features on network stability and fresher insights into designing resilient interdependent infrastructure networks.

Quasi-projective synchronization of fractional-order complex-valued recurrent neural networks.

PubMed

Yang, Shuai; Yu, Juan; Hu, Cheng; Jiang, Haijun

2018-08-01

In this paper, without separating the complex-valued neural networks into two real-valued systems, the quasi-projective synchronization of fractional-order complex-valued neural networks is investigated. First, two new fractional-order inequalities are established by using the theory of complex functions, Laplace transform and Mittag-Leffler functions, which generalize traditional inequalities with the first-order derivative in the real domain. Additionally, different from hybrid control schemes given in the previous work concerning the projective synchronization, a simple and linear control strategy is designed in this paper and several criteria are derived to ensure quasi-projective synchronization of the complex-valued neural networks with fractional-order based on the established fractional-order inequalities and the theory of complex functions. Moreover, the error bounds of quasi-projective synchronization are estimated. Especially, some conditions are also presented for the Mittag-Leffler synchronization of the addressed neural networks. Finally, some numerical examples with simulations are provided to show the effectiveness of the derived theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Mass fluctuation kinetics: Capturing stochastic effects in systems of chemical reactions through coupled mean-variance computations

NASA Astrophysics Data System (ADS)

Gómez-Uribe, Carlos A.; Verghese, George C.

2007-01-01

The intrinsic stochastic effects in chemical reactions, and particularly in biochemical networks, may result in behaviors significantly different from those predicted by deterministic mass action kinetics (MAK). Analyzing stochastic effects, however, is often computationally taxing and complex. The authors describe here the derivation and application of what they term the mass fluctuation kinetics (MFK), a set of deterministic equations to track the means, variances, and covariances of the concentrations of the chemical species in the system. These equations are obtained by approximating the dynamics of the first and second moments of the chemical master equation. Apart from needing knowledge of the system volume, the MFK description requires only the same information used to specify the MAK model, and is not significantly harder to write down or apply. When the effects of fluctuations are negligible, the MFK description typically reduces to MAK. The MFK equations are capable of describing the average behavior of the network substantially better than MAK, because they incorporate the effects of fluctuations on the evolution of the means. They also account for the effects of the means on the evolution of the variances and covariances, to produce quite accurate uncertainty bands around the average behavior. The MFK computations, although approximate, are significantly faster than Monte Carlo methods for computing first and second moments in systems of chemical reactions. They may therefore be used, perhaps along with a few Monte Carlo simulations of sample state trajectories, to efficiently provide a detailed picture of the behavior of a chemical system.

Mining integrated semantic networks for drug repositioning opportunities

PubMed Central

Mullen, Joseph; Tipney, Hannah

2016-01-01

Current research and development approaches to drug discovery have become less fruitful and more costly. One alternative paradigm is that of drug repositioning. Many marketed examples of repositioned drugs have been identified through serendipitous or rational observations, highlighting the need for more systematic methodologies to tackle the problem. Systems level approaches have the potential to enable the development of novel methods to understand the action of therapeutic compounds, but requires an integrative approach to biological data. Integrated networks can facilitate systems level analyses by combining multiple sources of evidence to provide a rich description of drugs, their targets and their interactions. Classically, such networks can be mined manually where a skilled person is able to identify portions of the graph (semantic subgraphs) that are indicative of relationships between drugs and highlight possible repositioning opportunities. However, this approach is not scalable. Automated approaches are required to systematically mine integrated networks for these subgraphs and bring them to the attention of the user. We introduce a formal framework for the definition of integrated networks and their associated semantic subgraphs for drug interaction analysis and describe DReSMin, an algorithm for mining semantically-rich networks for occurrences of a given semantic subgraph. This algorithm allows instances of complex semantic subgraphs that contain data about putative drug repositioning opportunities to be identified in a computationally tractable fashion, scaling close to linearly with network data. We demonstrate the utility of our approach by mining an integrated drug interaction network built from 11 sources. This work identified and ranked 9,643,061 putative drug-target interactions, showing a strong correlation between highly scored associations and those supported by literature. We discuss the 20 top ranked associations in more detail, of which 14 are novel and 6 are supported by the literature. We also show that our approach better prioritizes known drug-target interactions, than other state-of-the art approaches for predicting such interactions. PMID:26844016

Planning Marine Reserve Networks for Both Feature Representation and Demographic Persistence Using Connectivity Patterns

PubMed Central

Bode, Michael; Williamson, David H.; Weeks, Rebecca; Jones, Geoff P.; Almany, Glenn R.; Harrison, Hugo B.; Hopf, Jess K.; Pressey, Robert L.

2016-01-01

Marine reserve networks must ensure the representation of important conservation features, and also guarantee the persistence of key populations. For many species, designing reserve networks is complicated by the absence or limited availability of spatial and life-history data. This is particularly true for data on larval dispersal, which has only recently become available. However, systematic conservation planning methods currently incorporate demographic processes through unsatisfactory surrogates. There are therefore two key challenges to designing marine reserve networks that achieve feature representation and demographic persistence constraints. First, constructing a method that efficiently incorporates persistence as well as complementary feature representation. Second, incorporating persistence using a mechanistic description of population viability, rather than a proxy such as size or distance. Here we construct a novel systematic conservation planning method that addresses both challenges, and parameterise it to design a hypothetical marine reserve network for fringing coral reefs in the Keppel Islands, Great Barrier Reef, Australia. For this application, we describe how demographic persistence goals can be constructed for an important reef fish species in the region, the bar-cheeked trout (Plectropomus maculatus). We compare reserve networks that are optimally designed for either feature representation or demographic persistence, with a reserve network that achieves both goals simultaneously. As well as being practically applicable, our analyses also provide general insights into marine reserve planning for both representation and demographic persistence. First, persistence constraints for dispersive organisms are likely to be much harder to achieve than representation targets, due to their greater complexity. Second, persistence and representation constraints pull the reserve network design process in divergent directions, making it difficult to efficiently achieve both constraints. Although our method can be readily applied to the data-rich Keppel Islands case study, we finally consider the factors that limit the method’s utility in information-poor contexts common in marine conservation. PMID:27168206

Robustness and percolation of holes in complex networks

NASA Astrophysics Data System (ADS)

Zhou, Andu; Maletić, Slobodan; Zhao, Yi

2018-07-01

Efficient robustness and fault tolerance of complex network is significantly influenced by its connectivity, commonly modeled by the structure of pairwise relations between network elements, i.e., nodes. Nevertheless, aggregations of nodes build higher-order structures embedded in complex network, which may be more vulnerable when the fraction of nodes is removed. The structure of higher-order aggregations of nodes can be naturally modeled by simplicial complexes, whereas the removal of nodes affects the values of topological invariants, like the number of higher-dimensional holes quantified with Betti numbers. Following the methodology of percolation theory, as the fraction of nodes is removed, new holes appear, which have the role of merger between already present holes. In the present article, relationship between the robustness and homological properties of complex network is studied, through relating the graph-theoretical signatures of robustness and the quantities derived from topological invariants. The simulation results of random failures and intentional attacks on networks suggest that the changes of graph-theoretical signatures of robustness are followed by differences in the distribution of number of holes per cluster under different attack strategies. In the broader sense, the results indicate the importance of topological invariants research for obtaining further insights in understanding dynamics taking place over complex networks.

Modeling the Internet of Things, Self-Organizing and Other Complex Adaptive Communication Networks: A Cognitive Agent-Based Computing Approach.

PubMed

Laghari, Samreen; Niazi, Muaz A

2016-01-01

Computer Networks have a tendency to grow at an unprecedented scale. Modern networks involve not only computers but also a wide variety of other interconnected devices ranging from mobile phones to other household items fitted with sensors. This vision of the "Internet of Things" (IoT) implies an inherent difficulty in modeling problems. It is practically impossible to implement and test all scenarios for large-scale and complex adaptive communication networks as part of Complex Adaptive Communication Networks and Environments (CACOONS). The goal of this study is to explore the use of Agent-based Modeling as part of the Cognitive Agent-based Computing (CABC) framework to model a Complex communication network problem. We use Exploratory Agent-based Modeling (EABM), as part of the CABC framework, to develop an autonomous multi-agent architecture for managing carbon footprint in a corporate network. To evaluate the application of complexity in practical scenarios, we have also introduced a company-defined computer usage policy. The conducted experiments demonstrated two important results: Primarily CABC-based modeling approach such as using Agent-based Modeling can be an effective approach to modeling complex problems in the domain of IoT. Secondly, the specific problem of managing the Carbon footprint can be solved using a multiagent system approach.

Detection of Protein Complexes Based on Penalized Matrix Decomposition in a Sparse Protein⁻Protein Interaction Network.

PubMed

Cao, Buwen; Deng, Shuguang; Qin, Hua; Ding, Pingjian; Chen, Shaopeng; Li, Guanghui

2018-06-15

High-throughput technology has generated large-scale protein interaction data, which is crucial in our understanding of biological organisms. Many complex identification algorithms have been developed to determine protein complexes. However, these methods are only suitable for dense protein interaction networks, because their capabilities decrease rapidly when applied to sparse protein⁻protein interaction (PPI) networks. In this study, based on penalized matrix decomposition ( PMD ), a novel method of penalized matrix decomposition for the identification of protein complexes (i.e., PMD pc ) was developed to detect protein complexes in the human protein interaction network. This method mainly consists of three steps. First, the adjacent matrix of the protein interaction network is normalized. Second, the normalized matrix is decomposed into three factor matrices. The PMD pc method can detect protein complexes in sparse PPI networks by imposing appropriate constraints on factor matrices. Finally, the results of our method are compared with those of other methods in human PPI network. Experimental results show that our method can not only outperform classical algorithms, such as CFinder, ClusterONE, RRW, HC-PIN, and PCE-FR, but can also achieve an ideal overall performance in terms of a composite score consisting of F-measure, accuracy (ACC), and the maximum matching ratio (MMR).

Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation.

PubMed

Li, Shuai; Li, Yangming

2013-10-28

The Sylvester equation is often encountered in mathematics and control theory. For the general time-invariant Sylvester equation problem, which is defined in the domain of complex numbers, the Bartels-Stewart algorithm and its extensions are effective and widely used with an O(n³) time complexity. When applied to solving the time-varying Sylvester equation, the computation burden increases intensively with the decrease of sampling period and cannot satisfy continuous realtime calculation requirements. For the special case of the general Sylvester equation problem defined in the domain of real numbers, gradient-based recurrent neural networks are able to solve the time-varying Sylvester equation in real time, but there always exists an estimation error while a recently proposed recurrent neural network by Zhang et al [this type of neural network is called Zhang neural network (ZNN)] converges to the solution ideally. The advancements in complex-valued neural networks cast light to extend the existing real-valued ZNN for solving the time-varying real-valued Sylvester equation to its counterpart in the domain of complex numbers. In this paper, a complex-valued ZNN for solving the complex-valued Sylvester equation problem is investigated and the global convergence of the neural network is proven with the proposed nonlinear complex-valued activation functions. Moreover, a special type of activation function with a core function, called sign-bi-power function, is proven to enable the ZNN to converge in finite time, which further enhances its advantage in online processing. In this case, the upper bound of the convergence time is also derived analytically. Simulations are performed to evaluate and compare the performance of the neural network with different parameters and activation functions. Both theoretical analysis and numerical simulations validate the effectiveness of the proposed method.

The Multi-Parameter Wireless Sensing System (MPwise): Its Description and Application to Earthquake Risk Mitigation.

PubMed

Boxberger, Tobias; Fleming, Kevin; Pittore, Massimiliano; Parolai, Stefano; Pilz, Marco; Mikulla, Stefan

2017-10-20

The Multi-Parameter Wireless Sensing (MPwise) system is an innovative instrumental design that allows different sensor types to be combined with relatively high-performance computing and communications components. These units, which incorporate off-the-shelf components, can undertake complex information integration and processing tasks at the individual unit or node level (when used in a network), allowing the establishment of networks that are linked by advanced, robust and rapid communications routing and network topologies. The system (and its predecessors) was originally designed for earthquake risk mitigation, including earthquake early warning (EEW), rapid response actions, structural health monitoring, and site-effect characterization. For EEW, MPwise units are capable of on-site, decentralized, independent analysis of the recorded ground motion and based on this, may issue an appropriate warning, either by the unit itself or transmitted throughout a network by dedicated alarming procedures. The multi-sensor capabilities of the system allow it to be instrumented with standard strong- and weak-motion sensors, broadband sensors, MEMS (namely accelerometers), cameras, temperature and humidity sensors, and GNSS receivers. In this work, the MPwise hardware, software and communications schema are described, as well as an overview of its possible applications. While focusing on earthquake risk mitigation actions, the aim in the future is to expand its capabilities towards a more multi-hazard and risk mitigation role. Overall, MPwise offers considerable flexibility and has great potential in contributing to natural hazard risk mitigation.

The Multi-Parameter Wireless Sensing System (MPwise): Its Description and Application to Earthquake Risk Mitigation

PubMed Central

Boxberger, Tobias; Fleming, Kevin; Pittore, Massimiliano; Parolai, Stefano; Pilz, Marco; Mikulla, Stefan

2017-01-01

The Multi-Parameter Wireless Sensing (MPwise) system is an innovative instrumental design that allows different sensor types to be combined with relatively high-performance computing and communications components. These units, which incorporate off-the-shelf components, can undertake complex information integration and processing tasks at the individual unit or node level (when used in a network), allowing the establishment of networks that are linked by advanced, robust and rapid communications routing and network topologies. The system (and its predecessors) was originally designed for earthquake risk mitigation, including earthquake early warning (EEW), rapid response actions, structural health monitoring, and site-effect characterization. For EEW, MPwise units are capable of on-site, decentralized, independent analysis of the recorded ground motion and based on this, may issue an appropriate warning, either by the unit itself or transmitted throughout a network by dedicated alarming procedures. The multi-sensor capabilities of the system allow it to be instrumented with standard strong- and weak-motion sensors, broadband sensors, MEMS (namely accelerometers), cameras, temperature and humidity sensors, and GNSS receivers. In this work, the MPwise hardware, software and communications schema are described, as well as an overview of its possible applications. While focusing on earthquake risk mitigation actions, the aim in the future is to expand its capabilities towards a more multi-hazard and risk mitigation role. Overall, MPwise offers considerable flexibility and has great potential in contributing to natural hazard risk mitigation. PMID:29053608

78 FR 20910 - Combined Notice of Filings #1

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-08

...-001. Applicants: ExxonMobil Baton Rouge Complex. Description: Compliance filing to be effective 8/26.../13. Docket Numbers: ER13-122-001. Applicants: ExxonMobil Beaumont Complex. Description: Compliance... p.m. ET 4/18/13. Docket Numbers: ER13-123-001. Applicants: ExxonMobil LaBarge Shute Creek Treating...

Ultrastable cellulosome-adhesion complex tightens under load.

PubMed

Schoeler, Constantin; Malinowska, Klara H; Bernardi, Rafael C; Milles, Lukas F; Jobst, Markus A; Durner, Ellis; Ott, Wolfgang; Fried, Daniel B; Bayer, Edward A; Schulten, Klaus; Gaub, Hermann E; Nash, Michael A

2014-12-08

Challenging environments have guided nature in the development of ultrastable protein complexes. Specialized bacteria produce discrete multi-component protein networks called cellulosomes to effectively digest lignocellulosic biomass. While network assembly is enabled by protein interactions with commonplace affinities, we show that certain cellulosomal ligand-receptor interactions exhibit extreme resistance to applied force. Here, we characterize the ligand-receptor complex responsible for substrate anchoring in the Ruminococcus flavefaciens cellulosome using single-molecule force spectroscopy and steered molecular dynamics simulations. The complex withstands forces of 600-750 pN, making it one of the strongest bimolecular interactions reported, equivalent to half the mechanical strength of a covalent bond. Our findings demonstrate force activation and inter-domain stabilization of the complex, and suggest that certain network components serve as mechanical effectors for maintaining network integrity. This detailed understanding of cellulosomal network components may help in the development of biocatalysts for production of fuels and chemicals from renewable plant-derived biomass.

Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks

NASA Astrophysics Data System (ADS)

Cui, Yaozu; Wang, Xingyuan; Eustace, Justine

2014-12-01

Community structure is a common phenomenon in complex networks, and it has been shown that some communities in complex networks often overlap each other. So in this paper we propose a new algorithm to detect overlapping community structure in complex networks. To identify the overlapping community structure, our algorithm firstly extracts fully connected sub-graphs which are maximal sub-graphs from original networks. Then two maximal sub-graphs having the key pair-vertices can be merged into a new larger sub-graph using some belonging degree functions. Furthermore we extend the modularity function to evaluate the proposed algorithm. In addition, overlapping nodes between communities are founded successfully. Finally we report the comparison between the modularity and the computational complexity of the proposed algorithm with some other existing algorithms. The experimental results show that the proposed algorithm gives satisfactory results.

State criminal justice telecommunications (STACOM). Volume 4: Network design software user's guide

NASA Technical Reports Server (NTRS)

Lee, J. J.

1977-01-01

A user's guide to the network design program is presented. The program is written in FORTRAN V and implemented on a UNIVAC 1108 computer under the EXEC-8 operating system which enables the user to construct least-cost network topologies for criminal justice digital telecommunications networks. A complete description of program features, inputs, processing logic, and outputs is presented, and a sample run and a program listing are included.

Using TENS for pain control: the state of the evidence

PubMed Central

Vance, Carol GT; Dailey, Dana L; Rakel, Barbara A; Sluka, Kathleen A

2014-01-01

Summary Transcutaneous electrical nerve stimulation (TENS) is a nonpharmacological intervention that activates a complex neuronal network to reduce pain by activating descending inhibitory systems in the central nervous system to reduce hyperalgesia. The evidence for TENS efficacy is conflicting and requires not only description but also critique. Population-specific systemic reviews and meta-analyses are emerging, indicating both HF and LF TENS being shown to provide analgesia, specifically when applied at a strong, nonpainful intensity. The purpose of this article is to provide a critical review of the latest basic science and clinical evidence for TENS. Additional research is necessary to determine if TENS has effects specific to mechanical stimuli and/or beyond reduction of pain and will improve activity levels, function and quality of life. PMID:24953072

Modeling complex metabolic reactions, ecological systems, and financial and legal networks with MIANN models based on Markov-Wiener node descriptors.

PubMed

Duardo-Sánchez, Aliuska; Munteanu, Cristian R; Riera-Fernández, Pablo; López-Díaz, Antonio; Pazos, Alejandro; González-Díaz, Humberto

2014-01-27

The use of numerical parameters in Complex Network analysis is expanding to new fields of application. At a molecular level, we can use them to describe the molecular structure of chemical entities, protein interactions, or metabolic networks. However, the applications are not restricted to the world of molecules and can be extended to the study of macroscopic nonliving systems, organisms, or even legal or social networks. On the other hand, the development of the field of Artificial Intelligence has led to the formulation of computational algorithms whose design is based on the structure and functioning of networks of biological neurons. These algorithms, called Artificial Neural Networks (ANNs), can be useful for the study of complex networks, since the numerical parameters that encode information of the network (for example centralities/node descriptors) can be used as inputs for the ANNs. The Wiener index (W) is a graph invariant widely used in chemoinformatics to quantify the molecular structure of drugs and to study complex networks. In this work, we explore for the first time the possibility of using Markov chains to calculate analogues of node distance numbers/W to describe complex networks from the point of view of their nodes. These parameters are called Markov-Wiener node descriptors of order k(th) (W(k)). Please, note that these descriptors are not related to Markov-Wiener stochastic processes. Here, we calculated the W(k)(i) values for a very high number of nodes (>100,000) in more than 100 different complex networks using the software MI-NODES. These networks were grouped according to the field of application. Molecular networks include the Metabolic Reaction Networks (MRNs) of 40 different organisms. In addition, we analyzed other biological and legal and social networks. These include the Interaction Web Database Biological Networks (IWDBNs), with 75 food webs or ecological systems and the Spanish Financial Law Network (SFLN). The calculated W(k)(i) values were used as inputs for different ANNs in order to discriminate correct node connectivity patterns from incorrect random patterns. The MIANN models obtained present good values of Sensitivity/Specificity (%): MRNs (78/78), IWDBNs (90/88), and SFLN (86/84). These preliminary results are very promising from the point of view of a first exploratory study and suggest that the use of these models could be extended to the high-throughput re-evaluation of connectivity in known complex networks (collation).

How good is crude MDL for solving the bias-variance dilemma? An empirical investigation based on Bayesian networks.

PubMed

Cruz-Ramírez, Nicandro; Acosta-Mesa, Héctor Gabriel; Mezura-Montes, Efrén; Guerra-Hernández, Alejandro; Hoyos-Rivera, Guillermo de Jesús; Barrientos-Martínez, Rocío Erandi; Gutiérrez-Fragoso, Karina; Nava-Fernández, Luis Alonso; González-Gaspar, Patricia; Novoa-del-Toro, Elva María; Aguilera-Rueda, Vicente Josué; Ameca-Alducin, María Yaneli

2014-01-01

The bias-variance dilemma is a well-known and important problem in Machine Learning. It basically relates the generalization capability (goodness of fit) of a learning method to its corresponding complexity. When we have enough data at hand, it is possible to use these data in such a way so as to minimize overfitting (the risk of selecting a complex model that generalizes poorly). Unfortunately, there are many situations where we simply do not have this required amount of data. Thus, we need to find methods capable of efficiently exploiting the available data while avoiding overfitting. Different metrics have been proposed to achieve this goal: the Minimum Description Length principle (MDL), Akaike's Information Criterion (AIC) and Bayesian Information Criterion (BIC), among others. In this paper, we focus on crude MDL and empirically evaluate its performance in selecting models with a good balance between goodness of fit and complexity: the so-called bias-variance dilemma, decomposition or tradeoff. Although the graphical interaction between these dimensions (bias and variance) is ubiquitous in the Machine Learning literature, few works present experimental evidence to recover such interaction. In our experiments, we argue that the resulting graphs allow us to gain insights that are difficult to unveil otherwise: that crude MDL naturally selects balanced models in terms of bias-variance, which not necessarily need be the gold-standard ones. We carry out these experiments using a specific model: a Bayesian network. In spite of these motivating results, we also should not overlook three other components that may significantly affect the final model selection: the search procedure, the noise rate and the sample size.

How Good Is Crude MDL for Solving the Bias-Variance Dilemma? An Empirical Investigation Based on Bayesian Networks

PubMed Central

Cruz-Ramírez, Nicandro; Acosta-Mesa, Héctor Gabriel; Mezura-Montes, Efrén; Guerra-Hernández, Alejandro; Hoyos-Rivera, Guillermo de Jesús; Barrientos-Martínez, Rocío Erandi; Gutiérrez-Fragoso, Karina; Nava-Fernández, Luis Alonso; González-Gaspar, Patricia; Novoa-del-Toro, Elva María; Aguilera-Rueda, Vicente Josué; Ameca-Alducin, María Yaneli

2014-01-01

The bias-variance dilemma is a well-known and important problem in Machine Learning. It basically relates the generalization capability (goodness of fit) of a learning method to its corresponding complexity. When we have enough data at hand, it is possible to use these data in such a way so as to minimize overfitting (the risk of selecting a complex model that generalizes poorly). Unfortunately, there are many situations where we simply do not have this required amount of data. Thus, we need to find methods capable of efficiently exploiting the available data while avoiding overfitting. Different metrics have been proposed to achieve this goal: the Minimum Description Length principle (MDL), Akaike’s Information Criterion (AIC) and Bayesian Information Criterion (BIC), among others. In this paper, we focus on crude MDL and empirically evaluate its performance in selecting models with a good balance between goodness of fit and complexity: the so-called bias-variance dilemma, decomposition or tradeoff. Although the graphical interaction between these dimensions (bias and variance) is ubiquitous in the Machine Learning literature, few works present experimental evidence to recover such interaction. In our experiments, we argue that the resulting graphs allow us to gain insights that are difficult to unveil otherwise: that crude MDL naturally selects balanced models in terms of bias-variance, which not necessarily need be the gold-standard ones. We carry out these experiments using a specific model: a Bayesian network. In spite of these motivating results, we also should not overlook three other components that may significantly affect the final model selection: the search procedure, the noise rate and the sample size. PMID:24671204

Self-motion perception: assessment by computer-generated animations

NASA Technical Reports Server (NTRS)

Parker, D. E.; Harm, D. L.; Sandoz, G. R.; Skinner, N. C.

1998-01-01

The goal of this research is more precise description of adaptation to sensory rearrangements, including microgravity, by development of improved procedures for assessing spatial orientation perception. Thirty-six subjects reported perceived self-motion following exposure to complex inertial-visual motion. Twelve subjects were assigned to each of 3 perceptual reporting procedures: (a) animation movie selection, (b) written report selection and (c) verbal report generation. The question addressed was: do reports produced by these procedures differ with respect to complexity and reliability? Following repeated (within-day and across-day) exposures to 4 different "motion profiles," subjects either (a) selected movies presented on a laptop computer, or (b) selected written descriptions from a booklet, or (c) generated self-motion verbal descriptions that corresponded most closely with their motion experience. One "complexity" and 2 reliability "scores" were calculated. Contrary to expectations, reliability and complexity scores were essentially equivalent for the animation movie selection and written report selection procedures. Verbal report generation subjects exhibited less complexity than did subjects in the other conditions and their reports were often ambiguous. The results suggest that, when selecting from carefully written descriptions and following appropriate training, people may be better able to describe their self-motion experience with words than is usually believed.

ReNE: A Cytoscape Plugin for Regulatory Network Enhancement

PubMed Central

Politano, Gianfranco; Benso, Alfredo; Savino, Alessandro; Di Carlo, Stefano

2014-01-01

One of the biggest challenges in the study of biological regulatory mechanisms is the integration, americanmodeling, and analysis of the complex interactions which take place in biological networks. Despite post transcriptional regulatory elements (i.e., miRNAs) are widely investigated in current research, their usage and visualization in biological networks is very limited. Regulatory networks are commonly limited to gene entities. To integrate networks with post transcriptional regulatory data, researchers are therefore forced to manually resort to specific third party databases. In this context, we introduce ReNE, a Cytoscape 3.x plugin designed to automatically enrich a standard gene-based regulatory network with more detailed transcriptional, post transcriptional, and translational data, resulting in an enhanced network that more precisely models the actual biological regulatory mechanisms. ReNE can automatically import a network layout from the Reactome or KEGG repositories, or work with custom pathways described using a standard OWL/XML data format that the Cytoscape import procedure accepts. Moreover, ReNE allows researchers to merge multiple pathways coming from different sources. The merged network structure is normalized to guarantee a consistent and uniform description of the network nodes and edges and to enrich all integrated data with additional annotations retrieved from genome-wide databases like NCBI, thus producing a pathway fully manageable through the Cytoscape environment. The normalized network is then analyzed to include missing transcription factors, miRNAs, and proteins. The resulting enhanced network is still a fully functional Cytoscape network where each regulatory element (transcription factor, miRNA, gene, protein) and regulatory mechanism (up-regulation/down-regulation) is clearly visually identifiable, thus enabling a better visual understanding of its role and the effect in the network behavior. The enhanced network produced by ReNE is exportable in multiple formats for further analysis via third party applications. ReNE can be freely installed from the Cytoscape App Store (http://apps.cytoscape.org/apps/rene) and the full source code is freely available for download through a SVN repository accessible at http://www.sysbio.polito.it/tools_svn/BioInformatics/Rene/releases/. ReNE enhances a network by only integrating data from public repositories, without any inference or prediction. The reliability of the introduced interactions only depends on the reliability of the source data, which is out of control of ReNe developers. PMID:25541727

Surveying hospital network structure in New York State: how are they structured?

PubMed

Nauenberg, E; Brewer, C S

2000-01-01

We determine the most common network structures in New York state. The taxonomy employed uses three structural dimensions: integration, complexity, and risk-sharing between organizations. Based on a survey conducted in 1996, the most common type of network (26.4 percent) had medium levels of integration, medium or high levels of complexity, and some risk-sharing. Also common were networks with low levels of integration, low levels of complexity, and no risk-sharing (22.1 percent).

On the robustness of complex heterogeneous gene expression networks.

PubMed

Gómez-Gardeñes, Jesús; Moreno, Yamir; Floría, Luis M

2005-04-01

We analyze a continuous gene expression model on the underlying topology of a complex heterogeneous network. Numerical simulations aimed at studying the chaotic and periodic dynamics of the model are performed. The results clearly indicate that there is a region in which the dynamical and structural complexity of the system avoid chaotic attractors. However, contrary to what has been reported for Random Boolean Networks, the chaotic phase cannot be completely suppressed, which has important bearings on network robustness and gene expression modeling.

Community structure from spectral properties in complex networks

NASA Astrophysics Data System (ADS)

Servedio, V. D. P.; Colaiori, F.; Capocci, A.; Caldarelli, G.

2005-06-01

We analyze the spectral properties of complex networks focusing on their relation to the community structure, and develop an algorithm based on correlations among components of different eigenvectors. The algorithm applies to general weighted networks, and, in a suitably modified version, to the case of directed networks. Our method allows to correctly detect communities in sharply partitioned graphs, however it is useful to the analysis of more complex networks, without a well defined cluster structure, as social and information networks. As an example, we test the algorithm on a large scale data-set from a psychological experiment of free word association, where it proves to be successful both in clustering words, and in uncovering mental association patterns.

Connecting Core Percolation and Controllability of Complex Networks

PubMed Central

Jia, Tao; Pósfai, Márton

2014-01-01

Core percolation is a fundamental structural transition in complex networks related to a wide range of important problems. Recent advances have provided us an analytical framework of core percolation in uncorrelated random networks with arbitrary degree distributions. Here we apply the tools in analysis of network controllability. We confirm analytically that the emergence of the bifurcation in control coincides with the formation of the core and the structure of the core determines the control mode of the network. We also derive the analytical expression related to the controllability robustness by extending the deduction in core percolation. These findings help us better understand the interesting interplay between the structural and dynamical properties of complex networks. PMID:24946797

Star polymers as unit cells for coarse-graining cross-linked networks

NASA Astrophysics Data System (ADS)

Molotilin, Taras Y.; Maduar, Salim R.; Vinogradova, Olga I.

2018-03-01

Reducing the complexity of cross-linked polymer networks by preserving their main macroscale properties is key to understanding them, and a crucial issue is to relate individual properties of the polymer constituents to those of the reduced network. Here we study polymer networks in a good solvent, by considering star polymers as their unit elements, and first quantify the interaction between their centers of masses. We then reduce the complexity of a network by replacing sets of its bridged star polymers by equivalent effective soft particles with dense cores. Our coarse graining allows us to approximate complex polymer networks by much simpler ones, keeping their relevant mechanical properties, as illustrated in computer experiments.

Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights.

PubMed

Wang, Jin-Liang; Wu, Huai-Ning; Huang, Tingwen; Ren, Shun-Yan; Wu, Jigang

2017-08-01

A complex dynamical network consisting of N identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.

Automated conflict resolution issues

NASA Technical Reports Server (NTRS)

Wike, Jeffrey S.

1991-01-01

A discussion is presented of how conflicts for Space Network resources should be resolved in the ATDRSS era. The following topics are presented: a description of how resource conflicts are currently resolved; a description of issues associated with automated conflict resolution; present conflict resolution strategies; and topics for further discussion.

A Framework for Supporting Survivability, Network Planning and Cross-Layer Optimization in Future Multi-Domain Terabit Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baldin, Ilya; Huang, Shu; Gopidi, Rajesh

This final project report describes the accomplishments, products and publications from the award. It includes the overview of the project goals to devise a framework for managing resources in multi-domain, multi-layer networks, as well the details of the mathematical problem formulation and the description of the prototype built to prove the concept.

Response of power systems to the San Fernando Valley earthquake of 9 February 1971. Final report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schiff, A.J.; Yao, J.T.P.

1972-01-01

The impact of the San Fernando Valley earthquake on electric power systems is discussed. Particular attention focused on the following three areas; (1) the effects of an earthquake on the power network in the Western States, (2) the failure of subsystems and components of the power system, and (3) the loss of power to hospitals. The report includes sections on the description and functions of major components of a power network, existing procedures to protect the network, safety devices within the system which influence the network, a summary of the effects of the San Fernando Valley earthquake on the Westernmore » States Power Network, and present efforts to reduce the network vulnerability to faults. Also included in the report are a review of design procedures and practices prior to the San Fernando Valley earthquake and descriptions of types of damage to electrical equipment, dynamic analysis of equipment failures, equipment surviving the San Fernando Valley earthquake and new seismic design specifications. In addition, some observations and insights gained during the study, which are not directly related to power systems are discussed.« less

Characterizing complex networks through statistics of Möbius transformations

NASA Astrophysics Data System (ADS)

Jaćimović, Vladimir; Crnkić, Aladin

2017-04-01

It is well-known now that dynamics of large populations of globally (all-to-all) coupled oscillators can be reduced to low-dimensional submanifolds (WS transformation and OA ansatz). Marvel et al. (2009) described an intriguing algebraic structure standing behind this reduction: oscillators evolve by the action of the group of Möbius transformations. Of course, dynamics in complex networks of coupled oscillators is highly complex and not reducible. Still, closer look unveils that even in complex networks some (possibly overlapping) groups of oscillators evolve by Möbius transformations. In this paper, we study properties of the network by identifying Möbius transformations in the dynamics of oscillators. This enables us to introduce some new (statistical) concepts that characterize the network. In particular, the notion of coherence of the network (or subnetwork) is proposed. This conceptual approach is meaningful for the broad class of networks, including those with time-delayed, noisy or mixed interactions. In this paper, several simple (random) graphs are studied illustrating the meaning of the concepts introduced in the paper.

Self-organization of network dynamics into local quantized states

DOE PAGES

Nicolaides, Christos; Juanes, Ruben; Cueto-Felgueroso, Luis

2016-02-17

Self-organization and pattern formation in network-organized systems emerges from the collective activation and interaction of many interconnected units. A striking feature of these non-equilibrium structures is that they are often localized and robust: only a small subset of the nodes, or cell assembly, is activated. Understanding the role of cell assemblies as basic functional units in neural networks and socio-technical systems emerges as a fundamental challenge in network theory. A key open question is how these elementary building blocks emerge, and how they operate, linking structure and function in complex networks. Here we show that a network analogue of themore » Swift-Hohenberg continuum model—a minimal-ingredients model of nodal activation and interaction within a complex network—is able to produce a complex suite of localized patterns. Thus, the spontaneous formation of robust operational cell assemblies in complex networks can be explained as the result of self-organization, even in the absence of synaptic reinforcements.« less

Self-organization of network dynamics into local quantized states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nicolaides, Christos; Juanes, Ruben; Cueto-Felgueroso, Luis

Self-organization and pattern formation in network-organized systems emerges from the collective activation and interaction of many interconnected units. A striking feature of these non-equilibrium structures is that they are often localized and robust: only a small subset of the nodes, or cell assembly, is activated. Understanding the role of cell assemblies as basic functional units in neural networks and socio-technical systems emerges as a fundamental challenge in network theory. A key open question is how these elementary building blocks emerge, and how they operate, linking structure and function in complex networks. Here we show that a network analogue of themore » Swift-Hohenberg continuum model—a minimal-ingredients model of nodal activation and interaction within a complex network—is able to produce a complex suite of localized patterns. Thus, the spontaneous formation of robust operational cell assemblies in complex networks can be explained as the result of self-organization, even in the absence of synaptic reinforcements.« less

Generalized activity equations for spiking neural network dynamics.

PubMed

Buice, Michael A; Chow, Carson C

2013-01-01

Much progress has been made in uncovering the computational capabilities of spiking neural networks. However, spiking neurons will always be more expensive to simulate compared to rate neurons because of the inherent disparity in time scales-the spike duration time is much shorter than the inter-spike time, which is much shorter than any learning time scale. In numerical analysis, this is a classic stiff problem. Spiking neurons are also much more difficult to study analytically. One possible approach to making spiking networks more tractable is to augment mean field activity models with some information about spiking correlations. For example, such a generalized activity model could carry information about spiking rates and correlations between spikes self-consistently. Here, we will show how this can be accomplished by constructing a complete formal probabilistic description of the network and then expanding around a small parameter such as the inverse of the number of neurons in the network. The mean field theory of the system gives a rate-like description. The first order terms in the perturbation expansion keep track of covariances.

Combining complex networks and data mining: Why and how

NASA Astrophysics Data System (ADS)

Zanin, M.; Papo, D.; Sousa, P. A.; Menasalvas, E.; Nicchi, A.; Kubik, E.; Boccaletti, S.

2016-05-01

The increasing power of computer technology does not dispense with the need to extract meaningful information out of data sets of ever growing size, and indeed typically exacerbates the complexity of this task. To tackle this general problem, two methods have emerged, at chronologically different times, that are now commonly used in the scientific community: data mining and complex network theory. Not only do complex network analysis and data mining share the same general goal, that of extracting information from complex systems to ultimately create a new compact quantifiable representation, but they also often address similar problems too. In the face of that, a surprisingly low number of researchers turn out to resort to both methodologies. One may then be tempted to conclude that these two fields are either largely redundant or totally antithetic. The starting point of this review is that this state of affairs should be put down to contingent rather than conceptual differences, and that these two fields can in fact advantageously be used in a synergistic manner. An overview of both fields is first provided, some fundamental concepts of which are illustrated. A variety of contexts in which complex network theory and data mining have been used in a synergistic manner are then presented. Contexts in which the appropriate integration of complex network metrics can lead to improved classification rates with respect to classical data mining algorithms and, conversely, contexts in which data mining can be used to tackle important issues in complex network theory applications are illustrated. Finally, ways to achieve a tighter integration between complex networks and data mining, and open lines of research are discussed.

Data systems and computer science space data systems: Onboard networking and testbeds

NASA Technical Reports Server (NTRS)

Dalton, Dan

1991-01-01

The technical objectives are to develop high-performance, space-qualifiable, onboard computing, storage, and networking technologies. The topics are presented in viewgraph form and include the following: justification; technology challenges; program description; and state-of-the-art assessment.

THE EPANET PROGRAMMER'S TOOLKIT FOR ANALYSIS OF WATER DISTRIBUTION SYSTEMS

EPA Science Inventory

The EPANET Programmer's Toolkit is a collection of functions that helps simplify computer programming of water distribution network analyses. the functions can be used to read in a pipe network description file, modify selected component properties, run multiple hydraulic and wa...

Using arborescences to estimate hierarchicalness in directed complex networks

PubMed Central

2018-01-01

Complex networks are a useful tool for the understanding of complex systems. One of the emerging properties of such systems is their tendency to form hierarchies: networks can be organized in levels, with nodes in each level exerting control on the ones beneath them. In this paper, we focus on the problem of estimating how hierarchical a directed network is. We propose a structural argument: a network has a strong top-down organization if we need to delete only few edges to reduce it to a perfect hierarchy—an arborescence. In an arborescence, all edges point away from the root and there are no horizontal connections, both characteristics we desire in our idealization of what a perfect hierarchy requires. We test our arborescence score in synthetic and real-world directed networks against the current state of the art in hierarchy detection: agony, flow hierarchy and global reaching centrality. These tests highlight that our arborescence score is intuitive and we can visualize it; it is able to better distinguish between networks with and without a hierarchical structure; it agrees the most with the literature about the hierarchy of well-studied complex systems; and it is not just a score, but it provides an overall scheme of the underlying hierarchy of any directed complex network. PMID:29381761