Editorial [Special issue on software defined networks and infrastructures, network function virtualisation, autonomous systems and network management

DOE PAGES

Biswas, Amitava; Liu, Chen; Monga, Inder; ...

2016-01-01

For last few years, there has been a tremendous growth in data traffic due to high adoption rate of mobile devices and cloud computing. Internet of things (IoT) will stimulate even further growth. This is increasing scale and complexity of telecom/internet service provider (SP) and enterprise data centre (DC) compute and network infrastructures. As a result, managing these large network-compute converged infrastructures is becoming complex and cumbersome. To cope up, network and DC operators are trying to automate network and system operations, administrations and management (OAM) functions. OAM includes all non-functional mechanisms which keep the network running.

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.

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.

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

Gilson, M.; Kouvaris, N. E.; Deco, G.; Zamora-López, G.

2018-05-01

Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.

Ecological networks and their fragility.

PubMed

Montoya, José M; Pimm, Stuart L; Solé, Ricard V

2006-07-20

Darwin used the metaphor of a 'tangled bank' to describe the complex interactions between species. Those interactions are varied: they can be antagonistic ones involving predation, herbivory and parasitism, or mutualistic ones, such as those involving the pollination of flowers by insects. Moreover, the metaphor hints that the interactions may be complex to the point of being impossible to understand. All interactions can be visualized as ecological networks, in which species are linked together, either directly or indirectly through intermediate species. Ecological networks, although complex, have well defined patterns that both illuminate the ecological mechanisms underlying them and promise a better understanding of the relationship between complexity and ecological stability.

Statistical significance of the rich-club phenomenon in complex networks

NASA Astrophysics Data System (ADS)

Jiang, Zhi-Qiang; Zhou, Wei-Xing

2008-04-01

We propose that the rich-club phenomenon in complex networks should be defined in the spirit of bootstrapping, in which a null model is adopted to assess the statistical significance of the rich-club detected. Our method can serve as a definition of the rich-club phenomenon and is applied to analyze three real networks and three model networks. The results show significant improvement compared with previously reported results. We report a dilemma with an exceptional example, showing that there does not exist an omnipotent definition for the rich-club phenomenon.

Epidemic dynamics and endemic states in complex networks

NASA Astrophysics Data System (ADS)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-06-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Adaptive identifier for uncertain complex nonlinear systems based on continuous neural networks.

PubMed

Alfaro-Ponce, Mariel; Cruz, Amadeo Argüelles; Chairez, Isaac

2014-03-01

This paper presents the design of a complex-valued differential neural network identifier for uncertain nonlinear systems defined in the complex domain. This design includes the construction of an adaptive algorithm to adjust the parameters included in the identifier. The algorithm is obtained based on a special class of controlled Lyapunov functions. The quality of the identification process is characterized using the practical stability framework. Indeed, the region where the identification error converges is derived by the same Lyapunov method. This zone is defined by the power of uncertainties and perturbations affecting the complex-valued uncertain dynamics. Moreover, this convergence zone is reduced to its lowest possible value using ideas related to the so-called ellipsoid methodology. Two simple but informative numerical examples are developed to show how the identifier proposed in this paper can be used to approximate uncertain nonlinear systems valued in the complex domain.

Uncovering Neuronal Networks Defined by Consistent Between-Neuron Spike Timing from Neuronal Spike Recordings

PubMed Central

2018-01-01

Abstract It is widely assumed that distributed neuronal networks are fundamental to the functioning of the brain. Consistent spike timing between neurons is thought to be one of the key principles for the formation of these networks. This can involve synchronous spiking or spiking with time delays, forming spike sequences when the order of spiking is consistent. Finding networks defined by their sequence of time-shifted spikes, denoted here as spike timing networks, is a tremendous challenge. As neurons can participate in multiple spike sequences at multiple between-spike time delays, the possible complexity of networks is prohibitively large. We present a novel approach that is capable of (1) extracting spike timing networks regardless of their sequence complexity, and (2) that describes their spiking sequences with high temporal precision. We achieve this by decomposing frequency-transformed neuronal spiking into separate networks, characterizing each network’s spike sequence by a time delay per neuron, forming a spike sequence timeline. These networks provide a detailed template for an investigation of the experimental relevance of their spike sequences. Using simulated spike timing networks, we show network extraction is robust to spiking noise, spike timing jitter, and partial occurrences of the involved spike sequences. Using rat multineuron recordings, we demonstrate the approach is capable of revealing real spike timing networks with sub-millisecond temporal precision. By uncovering spike timing networks, the prevalence, structure, and function of complex spike sequences can be investigated in greater detail, allowing us to gain a better understanding of their role in neuronal functioning. PMID:29789811

Network morphospace

PubMed Central

Avena-Koenigsberger, Andrea; Goñi, Joaquín; Solé, Ricard; Sporns, Olaf

2015-01-01

The structure of complex networks has attracted much attention in recent years. It has been noted that many real-world examples of networked systems share a set of common architectural features. This raises important questions about their origin, for example whether such network attributes reflect common design principles or constraints imposed by selectional forces that have shaped the evolution of network topology. Is it possible to place the many patterns and forms of complex networks into a common space that reveals their relations, and what are the main rules and driving forces that determine which positions in such a space are occupied by systems that have actually evolved? We suggest that these questions can be addressed by combining concepts from two currently relatively unconnected fields. One is theoretical morphology, which has conceptualized the relations between morphological traits defined by mathematical models of biological form. The second is network science, which provides numerous quantitative tools to measure and classify different patterns of local and global network architecture across disparate types of systems. Here, we explore a new theoretical concept that lies at the intersection between both fields, the ‘network morphospace’. Defined by axes that represent specific network traits, each point within such a space represents a location occupied by networks that share a set of common ‘morphological’ characteristics related to aspects of their connectivity. Mapping a network morphospace reveals the extent to which the space is filled by existing networks, thus allowing a distinction between actual and impossible designs and highlighting the generative potential of rules and constraints that pervade the evolution of complex systems. PMID:25540237

A Security Assessment Mechanism for Software-Defined Networking-Based Mobile Networks.

PubMed

Luo, Shibo; Dong, Mianxiong; Ota, Kaoru; Wu, Jun; Li, Jianhua

2015-12-17

Software-Defined Networking-based Mobile Networks (SDN-MNs) are considered the future of 5G mobile network architecture. With the evolving cyber-attack threat, security assessments need to be performed in the network management. Due to the distinctive features of SDN-MNs, such as their dynamic nature and complexity, traditional network security assessment methodologies cannot be applied directly to SDN-MNs, and a novel security assessment methodology is needed. In this paper, an effective security assessment mechanism based on attack graphs and an Analytic Hierarchy Process (AHP) is proposed for SDN-MNs. Firstly, this paper discusses the security assessment problem of SDN-MNs and proposes a methodology using attack graphs and AHP. Secondly, to address the diversity and complexity of SDN-MNs, a novel attack graph definition and attack graph generation algorithm are proposed. In order to quantify security levels, the Node Minimal Effort (NME) is defined to quantify attack cost and derive system security levels based on NME. Thirdly, to calculate the NME of an attack graph that takes the dynamic factors of SDN-MN into consideration, we use AHP integrated with the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) as the methodology. Finally, we offer a case study to validate the proposed methodology. The case study and evaluation show the advantages of the proposed security assessment mechanism.

A Security Assessment Mechanism for Software-Defined Networking-Based Mobile Networks

PubMed Central

Luo, Shibo; Dong, Mianxiong; Ota, Kaoru; Wu, Jun; Li, Jianhua

2015-01-01

Software-Defined Networking-based Mobile Networks (SDN-MNs) are considered the future of 5G mobile network architecture. With the evolving cyber-attack threat, security assessments need to be performed in the network management. Due to the distinctive features of SDN-MNs, such as their dynamic nature and complexity, traditional network security assessment methodologies cannot be applied directly to SDN-MNs, and a novel security assessment methodology is needed. In this paper, an effective security assessment mechanism based on attack graphs and an Analytic Hierarchy Process (AHP) is proposed for SDN-MNs. Firstly, this paper discusses the security assessment problem of SDN-MNs and proposes a methodology using attack graphs and AHP. Secondly, to address the diversity and complexity of SDN-MNs, a novel attack graph definition and attack graph generation algorithm are proposed. In order to quantify security levels, the Node Minimal Effort (NME) is defined to quantify attack cost and derive system security levels based on NME. Thirdly, to calculate the NME of an attack graph that takes the dynamic factors of SDN-MN into consideration, we use AHP integrated with the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) as the methodology. Finally, we offer a case study to validate the proposed methodology. The case study and evaluation show the advantages of the proposed security assessment mechanism. PMID:26694409

The topological requirements for robust perfect adaptation in networks of any size.

PubMed

Araujo, Robyn P; Liotta, Lance A

2018-05-01

Robustness, and the ability to function and thrive amid changing and unfavorable environments, is a fundamental requirement for living systems. Until now it has been an open question how large and complex biological networks can exhibit robust behaviors, such as perfect adaptation to a variable stimulus, since complexity is generally associated with fragility. Here we report that all networks that exhibit robust perfect adaptation (RPA) to a persistent change in stimulus are decomposable into well-defined modules, of which there exist two distinct classes. These two modular classes represent a topological basis for all RPA-capable networks, and generate the full set of topological realizations of the internal model principle for RPA in complex, self-organizing, evolvable bionetworks. This unexpected result supports the notion that evolutionary processes are empowered by simple and scalable modular design principles that promote robust performance no matter how large or complex the underlying networks become.

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.

Using Genome-Wide Expression Profiling to Define Gene Networks Relevant to the Study of Complex Traits: From RNA Integrity to Network Topology

PubMed Central

O'Brien, M.A.; Costin, B.N.; Miles, M.F.

2014-01-01

Postgenomic studies of the function of genes and their role in disease have now become an area of intense study since efforts to define the raw sequence material of the genome have largely been completed. The use of whole-genome approaches such as microarray expression profiling and, more recently, RNA-sequence analysis of transcript abundance has allowed an unprecedented look at the workings of the genome. However, the accurate derivation of such high-throughput data and their analysis in terms of biological function has been critical to truly leveraging the postgenomic revolution. This chapter will describe an approach that focuses on the use of gene networks to both organize and interpret genomic expression data. Such networks, derived from statistical analysis of large genomic datasets and the application of multiple bioinformatics data resources, poten-tially allow the identification of key control elements for networks associated with human disease, and thus may lead to derivation of novel therapeutic approaches. However, as discussed in this chapter, the leveraging of such networks cannot occur without a thorough understanding of the technical and statistical factors influencing the derivation of genomic expression data. Thus, while the catch phrase may be “it's the network … stupid,” the understanding of factors extending from RNA isolation to genomic profiling technique, multivariate statistics, and bioinformatics are all critical to defining fully useful gene networks for study of complex biology. PMID:23195313

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.

Hierarchical thinking in network biology: the unbiased modularization of biochemical networks.

PubMed

Papin, Jason A; Reed, Jennifer L; Palsson, Bernhard O

2004-12-01

As reconstructed biochemical reaction networks continue to grow in size and scope, there is a growing need to describe the functional modules within them. Such modules facilitate the study of biological processes by deconstructing complex biological networks into conceptually simple entities. The definition of network modules is often based on intuitive reasoning. As an alternative, methods are being developed for defining biochemical network modules in an unbiased fashion. These unbiased network modules are mathematically derived from the structure of the whole network under consideration.

Software Defined Networking (SDN) controlled all optical switching networks with multi-dimensional switching architecture

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Ji, Yuefeng; Zhang, Jie; Li, Hui; Xiong, Qianjin; Qiu, Shaofeng

2014-08-01

Ultrahigh throughout capacity requirement is challenging the current optical switching nodes with the fast development of data center networks. Pbit/s level all optical switching networks need to be deployed soon, which will cause the high complexity of node architecture. How to control the future network and node equipment together will become a new problem. An enhanced Software Defined Networking (eSDN) control architecture is proposed in the paper, which consists of Provider NOX (P-NOX) and Node NOX (N-NOX). With the cooperation of P-NOX and N-NOX, the flexible control of the entire network can be achieved. All optical switching network testbed has been experimentally demonstrated with efficient control of enhanced Software Defined Networking (eSDN). Pbit/s level all optical switching nodes in the testbed are implemented based on multi-dimensional switching architecture, i.e. multi-level and multi-planar. Due to the space and cost limitation, each optical switching node is only equipped with four input line boxes and four output line boxes respectively. Experimental results are given to verify the performance of our proposed control and switching architecture.

On the Simulation-Based Reliability of Complex Emergency Logistics Networks in Post-Accident Rescues.

PubMed

Wang, Wei; Huang, Li; Liang, Xuedong

2018-01-06

This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks' statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies.

Visualizing Transmedia Networks: Links, Paths and Peripheries

ERIC Educational Resources Information Center

Ruppel, Marc Nathaniel

2012-01-01

'Visualizing Transmedia Networks: Links, Paths and Peripheries' examines the increasingly complex rhetorical intersections between narrative and media ("old" and "new") in the creation of transmedia fictions, loosely defined as multisensory and multimodal stories told extensively across a diverse media set. In order…

A complex network-based importance measure for mechatronics systems

NASA Astrophysics Data System (ADS)

Wang, Yanhui; Bi, Lifeng; Lin, Shuai; Li, Man; Shi, Hao

2017-01-01

In view of the negative impact of functional dependency, this paper attempts to provide an alternative importance measure called Improved-PageRank (IPR) for measuring the importance of components in mechatronics systems. IPR is a meaningful extension of the centrality measures in complex network, which considers usage reliability of components and functional dependency between components to increase importance measures usefulness. Our work makes two important contributions. First, this paper integrates the literature of mechatronic architecture and complex networks theory to define component network. Second, based on the notion of component network, a meaningful IPR is brought into the identifying of important components. In addition, the IPR component importance measures, and an algorithm to perform stochastic ordering of components due to the time-varying nature of usage reliability of components and functional dependency between components, are illustrated with a component network of bogie system that consists of 27 components.

Distinguishing fiction from non-fiction with complex networks

NASA Astrophysics Data System (ADS)

Larue, David M.; Carr, Lincoln D.; Jones, Linnea K.; Stevanak, Joe T.

2014-03-01

Complex Network Measures are applied to networks constructed from texts in English to demonstrate an initial viability in textual analysis. Texts from novels and short stories obtained from Project Gutenberg and news stories obtained from NPR are selected. Unique word stems in a text are used as nodes in an associated unweighted undirected network, with edges connecting words occurring within a certain number of words somewhere in the text. Various combinations of complex network measures are computed for each text's network. Fisher's Linear Discriminant analysis is used to build a parameter optimizing the ability to separate the texts according to their genre. Success rates in the 70% range for correctly distinguishing fiction from non-fiction were obtained using edges defined as within four words, using 400 word samples from 400 texts from each of the two genres with some combinations of measures such as the power-law exponents of degree distributions and clustering coefficients.

Local synchronization of a complex network model.

PubMed

Yu, Wenwu; Cao, Jinde; Chen, Guanrong; Lü, Jinhu; Han, Jian; Wei, Wei

2009-02-01

This paper introduces a novel complex network model to evaluate the reputation of virtual organizations. By using the Lyapunov function and linear matrix inequality approaches, the local synchronization of the proposed model is further investigated. Here, the local synchronization is defined by the inner synchronization within a group which does not mean the synchronization between different groups. Moreover, several sufficient conditions are derived to ensure the local synchronization of the proposed network model. Finally, several representative examples are given to show the effectiveness of the proposed methods and theories.

On the Simulation-Based Reliability of Complex Emergency Logistics Networks in Post-Accident Rescues

PubMed Central

Wang, Wei; Huang, Li; Liang, Xuedong

2018-01-01

This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks’ statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies. PMID:29316614

Hypergraph topological quantities for tagged social networks.

PubMed

Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

2009-09-01

Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.

Hypergraph topological quantities for tagged social networks

NASA Astrophysics Data System (ADS)

Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

2009-09-01

Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.

Software For Graphical Representation Of A Network

NASA Technical Reports Server (NTRS)

Mcallister, R. William; Mclellan, James P.

1993-01-01

System Visualization Tool (SVT) computer program developed to provide systems engineers with means of graphically representing networks. Generates diagrams illustrating structures and states of networks defined by users. Provides systems engineers powerful tool simplifing analysis of requirements and testing and maintenance of complex software-controlled systems. Employs visual models supporting analysis of chronological sequences of requirements, simulation data, and related software functions. Applied to pneumatic, hydraulic, and propellant-distribution networks. Used to define and view arbitrary configurations of such major hardware components of system as propellant tanks, valves, propellant lines, and engines. Also graphically displays status of each component. Advantage of SVT: utilizes visual cues to represent configuration of each component within network. Written in Turbo Pascal(R), version 5.0.

Avalanches and generalized memory associativity in a network model for conscious and unconscious mental functioning

NASA Astrophysics Data System (ADS)

Siddiqui, Maheen; Wedemann, Roseli S.; Jensen, Henrik Jeldtoft

2018-01-01

We explore statistical characteristics of avalanches associated with the dynamics of a complex-network model, where two modules corresponding to sensorial and symbolic memories interact, representing unconscious and conscious mental processes. The model illustrates Freud's ideas regarding the neuroses and that consciousness is related with symbolic and linguistic memory activity in the brain. It incorporates the Stariolo-Tsallis generalization of the Boltzmann Machine in order to model memory retrieval and associativity. In the present work, we define and measure avalanche size distributions during memory retrieval, in order to gain insight regarding basic aspects of the functioning of these complex networks. The avalanche sizes defined for our model should be related to the time consumed and also to the size of the neuronal region which is activated, during memory retrieval. This allows the qualitative comparison of the behaviour of the distribution of cluster sizes, obtained during fMRI measurements of the propagation of signals in the brain, with the distribution of avalanche sizes obtained in our simulation experiments. This comparison corroborates the indication that the Nonextensive Statistical Mechanics formalism may indeed be more well suited to model the complex networks which constitute brain and mental structure.

Advanced Fault Diagnosis Methods in Molecular Networks

PubMed Central

Habibi, Iman; Emamian, Effat S.; Abdi, Ali

2014-01-01

Analysis of the failure of cell signaling networks is an important topic in systems biology and has applications in target discovery and drug development. In this paper, some advanced methods for fault diagnosis in signaling networks are developed and then applied to a caspase network and an SHP2 network. The goal is to understand how, and to what extent, the dysfunction of molecules in a network contributes to the failure of the entire network. Network dysfunction (failure) is defined as failure to produce the expected outputs in response to the input signals. Vulnerability level of a molecule is defined as the probability of the network failure, when the molecule is dysfunctional. In this study, a method to calculate the vulnerability level of single molecules for different combinations of input signals is developed. Furthermore, a more complex yet biologically meaningful method for calculating the multi-fault vulnerability levels is suggested, in which two or more molecules are simultaneously dysfunctional. Finally, a method is developed for fault diagnosis of networks based on a ternary logic model, which considers three activity levels for a molecule instead of the previously published binary logic model, and provides equations for the vulnerabilities of molecules in a ternary framework. Multi-fault analysis shows that the pairs of molecules with high vulnerability typically include a highly vulnerable molecule identified by the single fault analysis. The ternary fault analysis for the caspase network shows that predictions obtained using the more complex ternary model are about the same as the predictions of the simpler binary approach. This study suggests that by increasing the number of activity levels the complexity of the model grows; however, the predictive power of the ternary model does not appear to be increased proportionally. PMID:25290670

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.

Minimizing communication cost among distributed controllers in software defined networks

NASA Astrophysics Data System (ADS)

Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

2016-08-01

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

Towards a Framework for Evolvable Network Design

NASA Astrophysics Data System (ADS)

Hassan, Hoda; Eltarras, Ramy; Eltoweissy, Mohamed

The layered Internet architecture that had long guided network design and protocol engineering was an “interconnection architecture” defining a framework for interconnecting networks rather than a model for generic network structuring and engineering. We claim that the approach of abstracting the network in terms of an internetwork hinders the thorough understanding of the network salient characteristics and emergent behavior resulting in impeding design evolution required to address extreme scale, heterogeneity, and complexity. This paper reports on our work in progress that aims to: 1) Investigate the problem space in terms of the factors and decisions that influenced the design and development of computer networks; 2) Sketch the core principles for designing complex computer networks; and 3) Propose a model and related framework for building evolvable, adaptable and self organizing networks We will adopt a bottom up strategy primarily focusing on the building unit of the network model, which we call the “network cell”. The model is inspired by natural complex systems. A network cell is intrinsically capable of specialization, adaptation and evolution. Subsequently, we propose CellNet; a framework for evolvable network design. We outline scenarios for using the CellNet framework to enhance legacy Internet protocol stack.

Identifying protein complexes based on brainstorming strategy.

PubMed

Shen, Xianjun; Zhou, Jin; Yi, Li; Hu, Xiaohua; He, Tingting; Yang, Jincai

2016-11-01

Protein complexes comprising of interacting proteins in protein-protein interaction network (PPI network) play a central role in driving biological processes within cells. Recently, more and more swarm intelligence based algorithms to detect protein complexes have been emerging, which have become the research hotspot in proteomics field. In this paper, we propose a novel algorithm for identifying protein complexes based on brainstorming strategy (IPC-BSS), which is integrated into the main idea of swarm intelligence optimization and the improved K-means algorithm. Distance between the nodes in PPI network is defined by combining the network topology and gene ontology (GO) information. Inspired by human brainstorming process, IPC-BSS algorithm firstly selects the clustering center nodes, and then they are separately consolidated with the other nodes with short distance to form initial clusters. Finally, we put forward two ways of updating the initial clusters to search optimal results. Experimental results show that our IPC-BSS algorithm outperforms the other classic algorithms on yeast and human PPI networks, and it obtains many predicted protein complexes with biological significance. Copyright © 2016 Elsevier Inc. All rights reserved.

Microfluidic neurite guidance to study structure-function relationships in topologically-complex population-based neural networks.

PubMed

Honegger, Thibault; Thielen, Moritz I; Feizi, Soheil; Sanjana, Neville E; Voldman, Joel

2016-06-22

The central nervous system is a dense, layered, 3D interconnected network of populations of neurons, and thus recapitulating that complexity for in vitro CNS models requires methods that can create defined topologically-complex neuronal networks. Several three-dimensional patterning approaches have been developed but none have demonstrated the ability to control the connections between populations of neurons. Here we report a method using AC electrokinetic forces that can guide, accelerate, slow down and push up neurites in un-modified collagen scaffolds. We present a means to create in vitro neural networks of arbitrary complexity by using such forces to create 3D intersections of primary neuronal populations that are plated in a 2D plane. We report for the first time in vitro basic brain motifs that have been previously observed in vivo and show that their functional network is highly decorrelated to their structure. This platform can provide building blocks to reproduce in vitro the complexity of neural circuits and provide a minimalistic environment to study the structure-function relationship of the brain circuitry.

Microfluidic neurite guidance to study structure-function relationships in topologically-complex population-based neural networks

NASA Astrophysics Data System (ADS)

Honegger, Thibault; Thielen, Moritz I.; Feizi, Soheil; Sanjana, Neville E.; Voldman, Joel

2016-06-01

The central nervous system is a dense, layered, 3D interconnected network of populations of neurons, and thus recapitulating that complexity for in vitro CNS models requires methods that can create defined topologically-complex neuronal networks. Several three-dimensional patterning approaches have been developed but none have demonstrated the ability to control the connections between populations of neurons. Here we report a method using AC electrokinetic forces that can guide, accelerate, slow down and push up neurites in un-modified collagen scaffolds. We present a means to create in vitro neural networks of arbitrary complexity by using such forces to create 3D intersections of primary neuronal populations that are plated in a 2D plane. We report for the first time in vitro basic brain motifs that have been previously observed in vivo and show that their functional network is highly decorrelated to their structure. This platform can provide building blocks to reproduce in vitro the complexity of neural circuits and provide a minimalistic environment to study the structure-function relationship of the brain circuitry.

Self-determined mechanisms in complex networks

NASA Astrophysics Data System (ADS)

Liu, Yang; Yuan, Jian; Shan, Xiuming; Ren, Yong; Ma, Zhengxin

2008-03-01

Self-organized networks are pervasive in communication systems such as the Internet, overlay networks, peer-to-peer networks, and cluster-based services. These networks evolve into complex topologies, under specific driving forces, i.e. user demands, technological innovations, design objectives and so on. Our study focuses on the driving forces behind individual evolutions of network components, and their stimulation and domination to the self-organized networks which are defined as self-determined mechanisms in this paper. Understanding forces underlying the evolution of networks should enable informed design decisions and help to avoid unwanted surprises, such as congestion collapse. A case study on the macroscopic evolution of the Internet topology of autonomous systems under a specific driving force is then presented. Using computer simulations, it is found that the power-law degree distribution can originate from a connection preference to larger numbers of users, and that the small-world property can be caused by rapid growth in the number of users. Our results provide a new feasible perspective to understand intrinsic fundamentals in the topological evolution of complex networks.

Software Defined Networking challenges and future direction: A case study of implementing SDN features on OpenStack private cloud

NASA Astrophysics Data System (ADS)

Shamugam, Veeramani; Murray, I.; Leong, J. A.; Sidhu, Amandeep S.

2016-03-01

Cloud computing provides services on demand instantly, such as access to network infrastructure consisting of computing hardware, operating systems, network storage, database and applications. Network usage and demands are growing at a very fast rate and to meet the current requirements, there is a need for automatic infrastructure scaling. Traditional networks are difficult to automate because of the distributed nature of their decision making process for switching or routing which are collocated on the same device. Managing complex environments using traditional networks is time-consuming and expensive, especially in the case of generating virtual machines, migration and network configuration. To mitigate the challenges, network operations require efficient, flexible, agile and scalable software defined networks (SDN). This paper discuss various issues in SDN and suggests how to mitigate the network management related issues. A private cloud prototype test bed was setup to implement the SDN on the OpenStack platform to test and evaluate the various network performances provided by the various configurations.

Discovering Network Structure Beyond Communities

NASA Astrophysics Data System (ADS)

Nishikawa, Takashi; Motter, Adilson E.

2011-11-01

To understand the formation, evolution, and function of complex systems, it is crucial to understand the internal organization of their interaction networks. Partly due to the impossibility of visualizing large complex networks, resolving network structure remains a challenging problem. Here we overcome this difficulty by combining the visual pattern recognition ability of humans with the high processing speed of computers to develop an exploratory method for discovering groups of nodes characterized by common network properties, including but not limited to communities of densely connected nodes. Without any prior information about the nature of the groups, the method simultaneously identifies the number of groups, the group assignment, and the properties that define these groups. The results of applying our method to real networks suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest.

Complexity in neuronal noise depends on network interconnectivity.

PubMed

Serletis, Demitre; Zalay, Osbert C; Valiante, Taufik A; Bardakjian, Berj L; Carlen, Peter L

2011-06-01

"Noise," or noise-like activity (NLA), defines background electrical membrane potential fluctuations at the cellular level of the nervous system, comprising an important aspect of brain dynamics. Using whole-cell voltage recordings from fast-spiking stratum oriens interneurons and stratum pyramidale neurons located in the CA3 region of the intact mouse hippocampus, we applied complexity measures from dynamical systems theory (i.e., 1/f(γ) noise and correlation dimension) and found evidence for complexity in neuronal NLA, ranging from high- to low-complexity dynamics. Importantly, these high- and low-complexity signal features were largely dependent on gap junction and chemical synaptic transmission. Progressive neuronal isolation from the surrounding local network via gap junction blockade (abolishing gap junction-dependent spikelets) and then chemical synaptic blockade (abolishing excitatory and inhibitory post-synaptic potentials), or the reverse order of these treatments, resulted in emergence of high-complexity NLA dynamics. Restoring local network interconnectivity via blockade washout resulted in resolution to low-complexity behavior. These results suggest that the observed increase in background NLA complexity is the result of reduced network interconnectivity, thereby highlighting the potential importance of the NLA signal to the study of network state transitions arising in normal and abnormal brain dynamics (such as in epilepsy, for example).

Communications network design and costing model technical manual

NASA Technical Reports Server (NTRS)

Logan, K. P.; Somes, S. S.; Clark, C. A.

1983-01-01

This computer model provides the capability for analyzing long-haul trunking networks comprising a set of user-defined cities, traffic conditions, and tariff rates. Networks may consist of all terrestrial connectivity, all satellite connectivity, or a combination of terrestrial and satellite connectivity. Network solutions provide the least-cost routes between all cities, the least-cost network routing configuration, and terrestrial and satellite service cost totals. The CNDC model allows analyses involving three specific FCC-approved tariffs, which are uniquely structured and representative of most existing service connectivity and pricing philosophies. User-defined tariffs that can be variations of these three tariffs are accepted as input to the model and allow considerable flexibility in network problem specification. The resulting model extends the domain of network analysis from traditional fixed link cost (distance-sensitive) problems to more complex problems involving combinations of distance and traffic-sensitive tariffs.

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.

Evolution of Cooperation in Social Dilemmas on Complex Networks

PubMed Central

Iyer, Swami; Killingback, Timothy

2016-01-01

Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner’s dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games. PMID:26928428

The BioPlex Network: A Systematic Exploration of the Human Interactome.

PubMed

Huttlin, Edward L; Ting, Lily; Bruckner, Raphael J; Gebreab, Fana; Gygi, Melanie P; Szpyt, John; Tam, Stanley; Zarraga, Gabriela; Colby, Greg; Baltier, Kurt; Dong, Rui; Guarani, Virginia; Vaites, Laura Pontano; Ordureau, Alban; Rad, Ramin; Erickson, Brian K; Wühr, Martin; Chick, Joel; Zhai, Bo; Kolippakkam, Deepak; Mintseris, Julian; Obar, Robert A; Harris, Tim; Artavanis-Tsakonas, Spyros; Sowa, Mathew E; De Camilli, Pietro; Paulo, Joao A; Harper, J Wade; Gygi, Steven P

2015-07-16

Protein interactions form a network whose structure drives cellular function and whose organization informs biological inquiry. Using high-throughput affinity-purification mass spectrometry, we identify interacting partners for 2,594 human proteins in HEK293T cells. The resulting network (BioPlex) contains 23,744 interactions among 7,668 proteins with 86% previously undocumented. BioPlex accurately depicts known complexes, attaining 80%-100% coverage for most CORUM complexes. The network readily subdivides into communities that correspond to complexes or clusters of functionally related proteins. More generally, network architecture reflects cellular localization, biological process, and molecular function, enabling functional characterization of thousands of proteins. Network structure also reveals associations among thousands of protein domains, suggesting a basis for examining structurally related proteins. Finally, BioPlex, in combination with other approaches, can be used to reveal interactions of biological or clinical significance. For example, mutations in the membrane protein VAPB implicated in familial amyotrophic lateral sclerosis perturb a defined community of interactors. Copyright © 2015 Elsevier Inc. All rights reserved.

The BioPlex Network: A Systematic Exploration of the Human Interactome

PubMed Central

Huttlin, Edward L.; Ting, Lily; Bruckner, Raphael J.; Gebreab, Fana; Gygi, Melanie P.; Szpyt, John; Tam, Stanley; Zarraga, Gabriela; Colby, Greg; Baltier, Kurt; Dong, Rui; Guarani, Virginia; Vaites, Laura Pontano; Ordureau, Alban; Rad, Ramin; Erickson, Brian K.; Wühr, Martin; Chick, Joel; Zhai, Bo; Kolippakkam, Deepak; Mintseris, Julian; Obar, Robert A.; Harris, Tim; Artavanis-Tsakonas, Spyros; Sowa, Mathew E.; DeCamilli, Pietro; Paulo, Joao A.; Harper, J. Wade; Gygi, Steven P.

2015-01-01

SUMMARY Protein interactions form a network whose structure drives cellular function and whose organization informs biological inquiry. Using high-throughput affinity-purification mass spectrometry, we identify interacting partners for 2,594 human proteins in HEK293T cells. The resulting network (BioPlex) contains 23,744 interactions among 7,668 proteins with 86% previously undocumented. BioPlex accurately depicts known complexes, attaining 80-100% coverage for most CORUM complexes. The network readily subdivides into communities that correspond to complexes or clusters of functionally related proteins. More generally, network architecture reflects cellular localization, biological process, and molecular function, enabling functional characterization of thousands of proteins. Network structure also reveals associations among thousands of protein domains, suggesting a basis for examining structurally-related proteins. Finally, BioPlex, in combination with other approaches can be used to reveal interactions of biological or clinical significance. For example, mutations in the membrane protein VAPB implicated in familial Amyotrophic Lateral Sclerosis perturb a defined community of interactors. PMID:26186194

Modeling the Internet of Things, Self-Organizing and Other Complex Adaptive Communication Networks: A Cognitive Agent-Based Computing Approach

PubMed Central

2016-01-01

Background 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. Purpose 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. Method 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. Results 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. PMID:26812235

Complexity in relational processing predicts changes in functional brain network dynamics.

PubMed

Cocchi, Luca; Halford, Graeme S; Zalesky, Andrew; Harding, Ian H; Ramm, Brentyn J; Cutmore, Tim; Shum, David H K; Mattingley, Jason B

2014-09-01

The ability to link variables is critical to many high-order cognitive functions, including reasoning. It has been proposed that limits in relating variables depend critically on relational complexity, defined formally as the number of variables to be related in solving a problem. In humans, the prefrontal cortex is known to be important for reasoning, but recent studies have suggested that such processes are likely to involve widespread functional brain networks. To test this hypothesis, we used functional magnetic resonance imaging and a classic measure of deductive reasoning to examine changes in brain networks as a function of relational complexity. As expected, behavioral performance declined as the number of variables to be related increased. Likewise, increments in relational complexity were associated with proportional enhancements in brain activity and task-based connectivity within and between 2 cognitive control networks: A cingulo-opercular network for maintaining task set, and a fronto-parietal network for implementing trial-by-trial control. Changes in effective connectivity as a function of increased relational complexity suggested a key role for the left dorsolateral prefrontal cortex in integrating and implementing task set in a trial-by-trial manner. Our findings show that limits in relational processing are manifested in the brain as complexity-dependent modulations of large-scale networks. © The Author 2013. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A genetic algorithm for solving supply chain network design model

NASA Astrophysics Data System (ADS)

Firoozi, Z.; Ismail, N.; Ariafar, S. H.; Tang, S. H.; Ariffin, M. K. M. A.

2013-09-01

Network design is by nature costly and optimization models play significant role in reducing the unnecessary cost components of a distribution network. This study proposes a genetic algorithm to solve a distribution network design model. The structure of the chromosome in the proposed algorithm is defined in a novel way that in addition to producing feasible solutions, it also reduces the computational complexity of the algorithm. Computational results are presented to show the algorithm performance.

An Adaptive Complex Network Model for Brain Functional Networks

PubMed Central

Gomez Portillo, Ignacio J.; Gleiser, Pablo M.

2009-01-01

Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence) of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution. PMID:19738902

Multiscale unfolding of real networks by geometric renormalization

NASA Astrophysics Data System (ADS)

García-Pérez, Guillermo; Boguñá, Marián; Serrano, M. Ángeles

2018-06-01

Symmetries in physical theories denote invariance under some transformation, such as self-similarity under a change of scale. The renormalization group provides a powerful framework to study these symmetries, leading to a better understanding of the universal properties of phase transitions. However, the small-world property of complex networks complicates application of the renormalization group by introducing correlations between coexisting scales. Here, we provide a framework for the investigation of complex networks at different resolutions. The approach is based on geometric representations, which have been shown to sustain network navigability and to reveal the mechanisms that govern network structure and evolution. We define a geometric renormalization group for networks by embedding them into an underlying hidden metric space. We find that real scale-free networks show geometric scaling under this renormalization group transformation. We unfold the networks in a self-similar multilayer shell that distinguishes the coexisting scales and their interactions. This in turn offers a basis for exploring critical phenomena and universality in complex networks. It also affords us immediate practical applications, including high-fidelity smaller-scale replicas of large networks and a multiscale navigation protocol in hyperbolic space, which betters those on single layers.

Identifying the most influential spreaders in complex networks by an Extended Local K-Shell Sum

NASA Astrophysics Data System (ADS)

Yang, Fan; Zhang, Ruisheng; Yang, Zhao; Hu, Rongjing; Li, Mengtian; Yuan, Yongna; Li, Keqin

Identifying influential spreaders is crucial for developing strategies to control the spreading process on complex networks. Following the well-known K-Shell (KS) decomposition, several improved measures are proposed. However, these measures cannot identify the most influential spreaders accurately. In this paper, we define a Local K-Shell Sum (LKSS) by calculating the sum of the K-Shell indices of the neighbors within 2-hops of a given node. Based on the LKSS, we propose an Extended Local K-Shell Sum (ELKSS) centrality to rank spreaders. The ELKSS is defined as the sum of the LKSS of the nearest neighbors of a given node. By assuming that the spreading process on networks follows the Susceptible-Infectious-Recovered (SIR) model, we perform extensive simulations on a series of real networks to compare the performance between the ELKSS centrality and other six measures. The results show that the ELKSS centrality has a better performance than the six measures to distinguish the spreading ability of nodes and to identify the most influential spreaders accurately.

On the origins of hierarchy in complex networks

PubMed Central

Corominas-Murtra, Bernat; Goñi, Joaquín; Solé, Ricard V.; Rodríguez-Caso, Carlos

2013-01-01

Hierarchy seems to pervade complexity in both living and artificial systems. Despite its relevance, no general theory that captures all features of hierarchy and its origins has been proposed yet. Here we present a formal approach resulting from the convergence of theoretical morphology and network theory that allows constructing a 3D morphospace of hierarchies and hence comparing the hierarchical organization of ecological, cellular, technological, and social networks. Embedded within large voids in the morphospace of all possible hierarchies, four major groups are identified. Two of them match the expected from random networks with similar connectivity, thus suggesting that nonadaptive factors are at work. Ecological and gene networks define the other two, indicating that their topological order is the result of functional constraints. These results are consistent with an exploration of the morphospace, using in silico evolved networks. PMID:23898177

Robustness of Synchrony in Complex Networks and Generalized Kirchhoff Indices

NASA Astrophysics Data System (ADS)

Tyloo, M.; Coletta, T.; Jacquod, Ph.

2018-02-01

In network theory, a question of prime importance is how to assess network vulnerability in a fast and reliable manner. With this issue in mind, we investigate the response to external perturbations of coupled dynamical systems on complex networks. We find that for specific, nonaveraged perturbations, the response of synchronous states depends on the eigenvalues of the stability matrix of the unperturbed dynamics, as well as on its eigenmodes via their overlap with the perturbation vector. Once averaged over properly defined ensembles of perturbations, the response is given by new graph topological indices, which we introduce as generalized Kirchhoff indices. These findings allow for a fast and reliable method for assessing the specific or average vulnerability of a network against changing operational conditions, faults, or external attacks.

Identifying critical transitions and their leading biomolecular networks in complex diseases.

PubMed

Liu, Rui; Li, Meiyi; Liu, Zhi-Ping; Wu, Jiarui; Chen, Luonan; Aihara, Kazuyuki

2012-01-01

Identifying a critical transition and its leading biomolecular network during the initiation and progression of a complex disease is a challenging task, but holds the key to early diagnosis and further elucidation of the essential mechanisms of disease deterioration at the network level. In this study, we developed a novel computational method for identifying early-warning signals of the critical transition and its leading network during a disease progression, based on high-throughput data using a small number of samples. The leading network makes the first move from the normal state toward the disease state during a transition, and thus is causally related with disease-driving genes or networks. Specifically, we first define a state-transition-based local network entropy (SNE), and prove that SNE can serve as a general early-warning indicator of any imminent transitions, regardless of specific differences among systems. The effectiveness of this method was validated by functional analysis and experimental data.

Some characteristics of supernetworks based on unified hybrid network theory framework

NASA Astrophysics Data System (ADS)

Liu, Qiang; Fang, Jin-Qing; Li, Yong

Comparing with single complex networks, supernetworks are more close to the real world in some ways, and have become the newest research hot spot in the network science recently. Some progresses have been made in the research of supernetworks, but the theoretical research method and complex network characteristics of supernetwork models are still needed to further explore. In this paper, we propose three kinds of supernetwork models with three layers based on the unified hybrid network theory framework (UHNTF), and introduce preferential and random linking, respectively, between the upper and lower layers. Then we compared the topological characteristics of the single networks with the supernetwork models. In order to analyze the influence of the interlayer edges on network characteristics, the cross-degree is defined as a new important parameter. Then some interesting new phenomena are found, the results imply this supernetwork model has reference value and application potential.

Implicity Defined Neural Networks for Sequence Labeling

DTIC Science & Technology

2017-02-13

popularity of the Long Short - Term Memory (LSTM) (Hochreiter and Schmidhuber, 1997) and variants such as the Gated Recurrent Unit (GRU) (Cho et al., 2014...bidirectional lstm and other neural network architectures. Neural Net- works 18(5):602–610. Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long short - term ...hid- den states of the network to coupled together, allowing potential improvement on problems with complex, long -distance dependencies. Initial

Fuzzy and neural control

NASA Technical Reports Server (NTRS)

Berenji, Hamid R.

1992-01-01

Fuzzy logic and neural networks provide new methods for designing control systems. Fuzzy logic controllers do not require a complete analytical model of a dynamic system and can provide knowledge-based heuristic controllers for ill-defined and complex systems. Neural networks can be used for learning control. In this chapter, we discuss hybrid methods using fuzzy logic and neural networks which can start with an approximate control knowledge base and refine it through reinforcement learning.

Spectral properties of Google matrix of Wikipedia and other networks

NASA Astrophysics Data System (ADS)

Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.

2013-05-01

We study the properties of eigenvalues and eigenvectors of the Google matrix of the Wikipedia articles hyperlink network and other real networks. With the help of the Arnoldi method, we analyze the distribution of eigenvalues in the complex plane and show that eigenstates with significant eigenvalue modulus are located on well defined network communities. We also show that the correlator between PageRank and CheiRank vectors distinguishes different organizations of information flow on BBC and Le Monde web sites.

Uncertainty Reduction for Stochastic Processes on Complex Networks

NASA Astrophysics Data System (ADS)

Radicchi, Filippo; Castellano, Claudio

2018-05-01

Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules, the ability to predict system configurations is generally characterized by a large uncertainty. Selecting a fraction of the nodes and observing their state may help to reduce the uncertainty about the unobserved nodes. However, choosing these points of observation in an optimal way is a highly nontrivial task, depending on the nature of the stochastic process and on the structure of the underlying interaction pattern. In this paper, we introduce a computationally efficient algorithm to determine quasioptimal solutions to the problem. The method leverages network sparsity to reduce computational complexity from exponential to almost quadratic, thus allowing the straightforward application of the method to mid-to-large-size systems. Although the method is exact only for equilibrium stochastic processes defined on trees, it turns out to be effective also for out-of-equilibrium processes on sparse loopy networks.

Analyzing the causation of a railway accident based on a complex network

NASA Astrophysics Data System (ADS)

Ma, Xin; Li, Ke-Ping; Luo, Zi-Yan; Zhou, Jin

2014-02-01

In this paper, a new model is constructed for the causation analysis of railway accident based on the complex network theory. In the model, the nodes are defined as various manifest or latent accident causal factors. By employing the complex network theory, especially its statistical indicators, the railway accident as well as its key causations can be analyzed from the overall perspective. As a case, the “7.23” China—Yongwen railway accident is illustrated based on this model. The results show that the inspection of signals and the checking of line conditions before trains run played an important role in this railway accident. In conclusion, the constructed model gives a theoretical clue for railway accident prediction and, hence, greatly reduces the occurrence of railway accidents.

The game of go as a complex network

NASA Astrophysics Data System (ADS)

Georgeot, Bertrand; Giraud, Olivier; Kandiah, Vivek

2014-03-01

We have studied the game of go, one of the most ancient and complex board games, from a complex network perspective. We have defined a proper categorization of moves taking into account the local environment, and shown that in this case Zipf's law emerges from data taken from real games. The network shows differences between professional and amateur games, different level of amateurs, or different phases of the game. Certain eigenvectors are localized on specific groups of moves which correspond to different strategies (communities of moves). The point of view developed should allow to better modelize such games and could also help to design simulators which could in the future beat good human players. Our approach could be used for other types of games, and in parallel shed light on the human decision making process.

Complex-valued Multidirectional Associative Memory

NASA Astrophysics Data System (ADS)

Kobayashi, Masaki; Yamazaki, Haruaki

Hopfield model is a representative associative memory. It was improved to Bidirectional Associative Memory(BAM) by Kosko and Multidirectional Associative Memory(MAM) by Hagiwara. They have two layers or multilayers. Since they have symmetric connections between layers, they ensure to converge. MAM can deal with multiples of many patterns, such as (x1, x2,…), where xm is the pattern on layer-m. Noest, Hirose and Nemoto proposed complex-valued Hopfield model. Lee proposed complex-valued Bidirectional Associative Memory. Zemel proved the rotation invariance of complex-valued Hopfield model. It means that the rotated pattern also stored. In this paper, the complex-valued Multidirectional Associative Memory is proposed. The rotation invariance is also proved. Moreover it is shown by computer simulation that the differences of angles of given patterns are automatically reduced. At first we define complex-valued Multidirectional Associative Memory. Then we define the energy function of network. By using energy function, we prove that the network ensures to converge. Next, we define the learning law and show the characteristic of recall process. The characteristic means that the differences of angles of given patterns are automatically reduced. Especially we prove the following theorem. In case that only a multiple of patterns is stored, if patterns with different angles are given to each layer, the differences are automatically reduced. Finally, we invest that the differences of angles influence the noise robustness. It reduce the noise robustness, because input to each layer become small. We show that by computer simulations.

Hierarchy Measure for Complex Networks

PubMed Central

Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

2012-01-01

Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477

Knowledge Discovery in Spectral Data by Means of Complex Networks

PubMed Central

Zanin, Massimiliano; Papo, David; Solís, José Luis González; Espinosa, Juan Carlos Martínez; Frausto-Reyes, Claudio; Anda, Pascual Palomares; Sevilla-Escoboza, Ricardo; Boccaletti, Stefano; Menasalvas, Ernestina; Sousa, Pedro

2013-01-01

In the last decade, complex networks have widely been applied to the study of many natural and man-made systems, and to the extraction of meaningful information from the interaction structures created by genes and proteins. Nevertheless, less attention has been devoted to metabonomics, due to the lack of a natural network representation of spectral data. Here we define a technique for reconstructing networks from spectral data sets, where nodes represent spectral bins, and pairs of them are connected when their intensities follow a pattern associated with a disease. The structural analysis of the resulting network can then be used to feed standard data-mining algorithms, for instance for the classification of new (unlabeled) subjects. Furthermore, we show how the structure of the network is resilient to the presence of external additive noise, and how it can be used to extract relevant knowledge about the development of the disease. PMID:24957895

Knowledge discovery in spectral data by means of complex networks.

PubMed

Zanin, Massimiliano; Papo, David; Solís, José Luis González; Espinosa, Juan Carlos Martínez; Frausto-Reyes, Claudio; Anda, Pascual Palomares; Sevilla-Escoboza, Ricardo; Jaimes-Reategui, Rider; Boccaletti, Stefano; Menasalvas, Ernestina; Sousa, Pedro

2013-03-11

In the last decade, complex networks have widely been applied to the study of many natural and man-made systems, and to the extraction of meaningful information from the interaction structures created by genes and proteins. Nevertheless, less attention has been devoted to metabonomics, due to the lack of a natural network representation of spectral data. Here we define a technique for reconstructing networks from spectral data sets, where nodes represent spectral bins, and pairs of them are connected when their intensities follow a pattern associated with a disease. The structural analysis of the resulting network can then be used to feed standard data-mining algorithms, for instance for the classification of new (unlabeled) subjects. Furthermore, we show how the structure of the network is resilient to the presence of external additive noise, and how it can be used to extract relevant knowledge about the development of the disease.

New Abstraction Networks and a New Visualization Tool in Support of Auditing the SNOMED CT Content

PubMed Central

Geller, James; Ochs, Christopher; Perl, Yehoshua; Xu, Junchuan

2012-01-01

Medical terminologies are large and complex. Frequently, errors are hidden in this complexity. Our objective is to find such errors, which can be aided by deriving abstraction networks from a large terminology. Abstraction networks preserve important features but eliminate many minor details, which are often not useful for identifying errors. Providing visualizations for such abstraction networks aids auditors by allowing them to quickly focus on elements of interest within a terminology. Previously we introduced area taxonomies and partial area taxonomies for SNOMED CT. In this paper, two advanced, novel kinds of abstraction networks, the relationship-constrained partial area subtaxonomy and the root-constrained partial area subtaxonomy are defined and their benefits are demonstrated. We also describe BLUSNO, an innovative software tool for quickly generating and visualizing these SNOMED CT abstraction networks. BLUSNO is a dynamic, interactive system that provides quick access to well organized information about SNOMED CT. PMID:23304293

New abstraction networks and a new visualization tool in support of auditing the SNOMED CT content.

PubMed

Geller, James; Ochs, Christopher; Perl, Yehoshua; Xu, Junchuan

2012-01-01

Medical terminologies are large and complex. Frequently, errors are hidden in this complexity. Our objective is to find such errors, which can be aided by deriving abstraction networks from a large terminology. Abstraction networks preserve important features but eliminate many minor details, which are often not useful for identifying errors. Providing visualizations for such abstraction networks aids auditors by allowing them to quickly focus on elements of interest within a terminology. Previously we introduced area taxonomies and partial area taxonomies for SNOMED CT. In this paper, two advanced, novel kinds of abstraction networks, the relationship-constrained partial area subtaxonomy and the root-constrained partial area subtaxonomy are defined and their benefits are demonstrated. We also describe BLUSNO, an innovative software tool for quickly generating and visualizing these SNOMED CT abstraction networks. BLUSNO is a dynamic, interactive system that provides quick access to well organized information about SNOMED CT.

Multiple tipping points and optimal repairing in interacting networks

PubMed Central

Majdandzic, Antonio; Braunstein, Lidia A.; Curme, Chester; Vodenska, Irena; Levy-Carciente, Sary; Eugene Stanley, H.; Havlin, Shlomo

2016-01-01

Systems composed of many interacting dynamical networks—such as the human body with its biological networks or the global economic network consisting of regional clusters—often exhibit complicated collective dynamics. Three fundamental processes that are typically present are failure, damage spread and recovery. Here we develop a model for such systems and find a very rich phase diagram that becomes increasingly more complex as the number of interacting networks increases. In the simplest example of two interacting networks we find two critical points, four triple points, ten allowed transitions and two ‘forbidden' transitions, as well as complex hysteresis loops. Remarkably, we find that triple points play the dominant role in constructing the optimal repairing strategy in damaged interacting systems. To test our model, we analyse an example of real interacting financial networks and find evidence of rapid dynamical transitions between well-defined states, in agreement with the predictions of our model. PMID:26926803

Topological Characteristics of the Hong Kong Stock Market: A Test-based P-threshold Approach to Understanding Network Complexity

NASA Astrophysics Data System (ADS)

Xu, Ronghua; Wong, Wing-Keung; Chen, Guanrong; Huang, Shuo

2017-02-01

In this paper, we analyze the relationship among stock networks by focusing on the statistically reliable connectivity between financial time series, which accurately reflects the underlying pure stock structure. To do so, we firstly filter out the effect of market index on the correlations between paired stocks, and then take a t-test based P-threshold approach to lessening the complexity of the stock network based on the P values. We demonstrate the superiority of its performance in understanding network complexity by examining the Hong Kong stock market. By comparing with other filtering methods, we find that the P-threshold approach extracts purely and significantly correlated stock pairs, which reflect the well-defined hierarchical structure of the market. In analyzing the dynamic stock networks with fixed-size moving windows, our results show that three global financial crises, covered by the long-range time series, can be distinguishingly indicated from the network topological and evolutionary perspectives. In addition, we find that the assortativity coefficient can manifest the financial crises and therefore can serve as a good indicator of the financial market development.

Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms.

PubMed

Lee, Chankyun; Cao, Xiaoyuan; Yoshikane, Noboru; Tsuritani, Takehiro; Rhee, June-Koo Kevin

2015-10-19

The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study.

An IEEE 1451.1 Architecture for ISHM Applications

NASA Technical Reports Server (NTRS)

Morris, Jon A.; Turowski, Mark; Schmalzel, John L.; Figueroa, Jorge F.

2007-01-01

The IEEE 1451.1 Standard for a Smart Transducer Interface defines a common network information model for connecting and managing smart elements in control and data acquisition networks using network-capable application processors (NCAPs). The Standard is a network-neutral design model that is easily ported across operating systems and physical networks for implementing complex acquisition and control applications by simply plugging in the appropriate network level drivers. To simplify configuration and tracking of transducer and actuator details, the family of 1451 standards defines a Transducer Electronic Data Sheet (TEDS) that is associated with each physical element. The TEDS contains all of the pertinent information about the physical operations of a transducer (such as operating regions, calibration tables, and manufacturer information), which the NCAP uses to configure the system to support a specific transducer. The Integrated Systems Health Management (ISHM) group at NASA's John C. Stennis Space Center (SSC) has been developing an ISHM architecture that utilizes IEEE 1451.1 as the primary configuration and data acquisition mechanism for managing and collecting information from a network of distributed intelligent sensing elements. This work has involved collaboration with other NASA centers, universities and aerospace industries to develop IEEE 1451.1 compliant sensors and interfaces tailored to support health assessment of complex systems. This paper and presentation describe the development and implementation of an interface for the configuration, management and communication of data, information and knowledge generated by a distributed system of IEEE 1451.1 intelligent elements monitoring a rocket engine test system. In this context, an intelligent element is defined as one incorporating support for the IEEE 1451.x standards and additional ISHM functions. Our implementation supports real-time collection of both measurement data (raw ADC counts and converted engineering units) and health statistics produced by each intelligent element. The handling of configuration, calibration and health information is automated by using the TEDS in combination with other electronic data sheets extensions to convey health parameters. By integrating the IEEE 1451.1 Standard for a Smart Transducer Interface with ISHM technologies, each element within a complex system becomes a highly flexible computation engine capable of self-validation and performing other measures of the quality of information it is producing.

42 CFR 414.402 - Definitions.

Code of Federal Regulations, 2010 CFR

2010-10-01

.... Network means a group of small suppliers that form a legal entity to provide competitively bid items... Food, Drug and Cosmetic Act, as defined in § 414.202 of this part and group 3 complex rehabilitative...

Water Diplomacy: A Synthesis of Explicit and Tacit Water Information to Create Actionable Knowledge

NASA Astrophysics Data System (ADS)

Islam, S.; Moomaw, W.; Portney, K.; Reed, M.; Vogel, R. M.; Water Diplomacy

2011-12-01

Water issues are complex because they cross multiple boundaries and involve various stakeholders with competing needs. The origin of many water issues is a dynamic consequence of competition and feedback among variables in the natural, societal and political domains. Together, these interactions generate what we call water networks. As population growth, economic development and climate change impose pressures on finite water resources, management of these water networks becomes crucial. Science alone is not sufficient; nor can policy-making that does not take science into account yield sustainable management solutions. Rather, sustainable solutions may only be found through a diplomatic or negotiated approach that simultaneously takes science, policy, and politics into account. Water issues need to be understood as the product of competition, interconnection, and feedback among variables in the Natural and Societal Domains (NSDs). Within the natural domain: water quantity (Q), water quality (P), and ecosystem (E) constrain and define network dynamics. While in the societal domain, interactions among culture and values (V), assets (C), and governance and institutions (G) create complex contextual differences in the network. These six NSD variables constitute the nodes of a water network while interactions and feedback among natural, societal and political forces define the complexity of a network. The knowledge needed to resolve water conflicts and to manage water networks effectively must extend beyond scientific assessment that ignore societal variables (C, G, and V) or treat them as exogenous, and beyond policy analysis that does not consider the impact of natural variables (E, P, and Q) and the couplings among them. Many water conflicts arise when NSD variables, and the networks they define, are mismanaged. These networks are open-ended systems that cross boundaries (physical, disciplinary, and jurisdictional ) and change continuously; thus, efforts to manage them assuming that they have fixed boundaries , or can be optimized with scientific objectivity without properly accounting for contextual differences, are likely to fail. Once water conflicts are framed properly, the tools of joint fact-finding and collaborative problem-solving can be used to negotiate solutions that are both adaptive and enforceable. We will use AquaPedia - a growing knowledge base of water issues from across the world - to demonstrate the utility of this synthesis of explicit and tacit knowledge in addressing water problems and creating actionable knowledge.

A Statistical Test of Walrasian Equilibrium by Means of Complex Networks Theory

NASA Astrophysics Data System (ADS)

Bargigli, Leonardo; Viaggiu, Stefano; Lionetto, Andrea

2016-10-01

We represent an exchange economy in terms of statistical ensembles for complex networks by introducing the concept of market configuration. This is defined as a sequence of nonnegative discrete random variables {w_{ij}} describing the flow of a given commodity from agent i to agent j. This sequence can be arranged in a nonnegative matrix W which we can regard as the representation of a weighted and directed network or digraph G. Our main result consists in showing that general equilibrium theory imposes highly restrictive conditions upon market configurations, which are in most cases not fulfilled by real markets. An explicit example with reference to the e-MID interbank credit market is provided.

Evolutionary features of academic articles co-keyword network and keywords co-occurrence network: Based on two-mode affiliation network

NASA Astrophysics Data System (ADS)

Li, Huajiao; An, Haizhong; Wang, Yue; Huang, Jiachen; Gao, Xiangyun

2016-05-01

Keeping abreast of trends in the articles and rapidly grasping a body of article's key points and relationship from a holistic perspective is a new challenge in both literature research and text mining. As the important component, keywords can present the core idea of the academic article. Usually, articles on a single theme or area could share one or some same keywords, and we can analyze topological features and evolution of the articles co-keyword networks and keywords co-occurrence networks to realize the in-depth analysis of the articles. This paper seeks to integrate statistics, text mining, complex networks and visualization to analyze all of the academic articles on one given theme, complex network(s). All 5944 ;complex networks; articles that were published between 1990 and 2013 and are available on the Web of Science are extracted. Based on the two-mode affiliation network theory, a new frontier of complex networks, we constructed two different networks, one taking the articles as nodes, the co-keyword relationships as edges and the quantity of co-keywords as the weight to construct articles co-keyword network, and another taking the articles' keywords as nodes, the co-occurrence relationships as edges and the quantity of simultaneous co-occurrences as the weight to construct keyword co-occurrence network. An integrated method for analyzing the topological features and evolution of the articles co-keyword network and keywords co-occurrence networks is proposed, and we also defined a new function to measure the innovation coefficient of the articles in annual level. This paper provides a useful tool and process for successfully achieving in-depth analysis and rapid understanding of the trends and relationships of articles in a holistic perspective.

Maximum likelihood: Extracting unbiased information from complex networks

NASA Astrophysics Data System (ADS)

Garlaschelli, Diego; Loffredo, Maria I.

2008-07-01

The choice of free parameters in network models is subjective, since it depends on what topological properties are being monitored. However, we show that the maximum likelihood (ML) principle indicates a unique, statistically rigorous parameter choice, associated with a well-defined topological feature. We then find that, if the ML condition is incompatible with the built-in parameter choice, network models turn out to be intrinsically ill defined or biased. To overcome this problem, we construct a class of safely unbiased models. We also propose an extension of these results that leads to the fascinating possibility to extract, only from topological data, the “hidden variables” underlying network organization, making them “no longer hidden.” We test our method on World Trade Web data, where we recover the empirical gross domestic product using only topological information.

A transcription factor hierarchy defines an environmental stress response network.

PubMed

Song, Liang; Huang, Shao-Shan Carol; Wise, Aaron; Castanon, Rosa; Nery, Joseph R; Chen, Huaming; Watanabe, Marina; Thomas, Jerushah; Bar-Joseph, Ziv; Ecker, Joseph R

2016-11-04

Environmental stresses are universally encountered by microbes, plants, and animals. Yet systematic studies of stress-responsive transcription factor (TF) networks in multicellular organisms have been limited. The phytohormone abscisic acid (ABA) influences the expression of thousands of genes, allowing us to characterize complex stress-responsive regulatory networks. Using chromatin immunoprecipitation sequencing, we identified genome-wide targets of 21 ABA-related TFs to construct a comprehensive regulatory network in Arabidopsis thaliana Determinants of dynamic TF binding and a hierarchy among TFs were defined, illuminating the relationship between differential gene expression patterns and ABA pathway feedback regulation. By extrapolating regulatory characteristics of observed canonical ABA pathway components, we identified a new family of transcriptional regulators modulating ABA and salt responsiveness and demonstrated their utility to modulate plant resilience to osmotic stress. Copyright © 2016, American Association for the Advancement of Science.

A conceptual model of the role of complexity in the care of patients with multiple chronic conditions.

PubMed

Grembowski, David; Schaefer, Judith; Johnson, Karin E; Fischer, Henry; Moore, Susan L; Tai-Seale, Ming; Ricciardi, Richard; Fraser, James R; Miller, Donald; LeRoy, Lisa

2014-03-01

Effective healthcare for people with multiple chronic conditions (MCC) is a US priority, but the inherent complexity makes both research and delivery of care particularly challenging. As part of AHRQ Multiple Chronic Conditions Research Network (MCCRN) efforts, the Network developed a conceptual model to guide research in this area. To synthesize methodological and topical issues relevant to MCC patient care into a framework that can improve the delivery of care and advance future research about caring for patients with MCC. The Network synthesized essential constructs for MCC research identified from roundtable discussion, input from expert advisors, and previously published models. The AHRQ MCCRN conceptual model defines complexity as the gap between patient needs and healthcare services, taking into account both the multiple considerations that affect the needs of MCC patients, as well as the contextual factors that influence service delivery. The model reframes processes and outcomes to include not only clinical care quality and experience, but also patient health, well being, and quality of life. The single-condition paradigm for treating needs one-by-one falls apart and highlights the need for care systems to address dynamic patient needs. Defining complexity in terms of the misalignment between patient needs and services offers new insights in how to research and develop solutions to patient care needs.

The C. elegans Connectome Consists of Homogenous Circuits with Defined Functional Roles

PubMed Central

Azulay, Aharon; Zaslaver, Alon

2016-01-01

A major goal of systems neuroscience is to decipher the structure-function relationship in neural networks. Here we study network functionality in light of the common-neighbor-rule (CNR) in which a pair of neurons is more likely to be connected the more common neighbors it shares. Focusing on the fully-mapped neural network of C. elegans worms, we establish that the CNR is an emerging property in this connectome. Moreover, sets of common neighbors form homogenous structures that appear in defined layers of the network. Simulations of signal propagation reveal their potential functional roles: signal amplification and short-term memory at the sensory/inter-neuron layer, and synchronized activity at the motoneuron layer supporting coordinated movement. A coarse-grained view of the neural network based on homogenous connected sets alone reveals a simple modular network architecture that is intuitive to understand. These findings provide a novel framework for analyzing larger, more complex, connectomes once these become available. PMID:27606684

Brain Modularity Mediates the Relation between Task Complexity and Performance

NASA Astrophysics Data System (ADS)

Ye, Fengdan; Yue, Qiuhai; Martin, Randi; Fischer-Baum, Simon; Ramos-Nuã+/-Ez, Aurora; Deem, Michael

Recent work in cognitive neuroscience has focused on analyzing the brain as a network, rather than a collection of independent regions. Prior studies taking this approach have found that individual differences in the degree of modularity of the brain network relate to performance on cognitive tasks. However, inconsistent results concerning the direction of this relationship have been obtained, with some tasks showing better performance as modularity increases, and other tasks showing worse performance. A recent theoretical model suggests that these inconsistencies may be explained on the grounds that high-modularity networks favor performance on simple tasks whereas low-modularity networks favor performance on complex tasks. The current study tests these predictions by relating modularity from resting-state fMRI to performance on a set of behavioral tasks. Complex and simple tasks were defined on the basis of whether they drew on executive attention. Consistent with predictions, we found a negative correlation between individuals' modularity and their performance on the complex tasks but a positive correlation with performance on the simple tasks. The results presented here provide a framework for linking measures of whole brain organization to cognitive processing.

Markets on Networks

NASA Astrophysics Data System (ADS)

Toroczkai, Zoltan; Anghel, Marian; Bassler, Kevin; Korniss, Gyorgy

2003-03-01

The dynamics of human, and most biological populations is characterized by competition for resources. By its own nature, this dynamics creates the group of "elites", formed by those agents who have strategies that are the most successful in the given situation, and therefore the rest of the agents will tend to follow, imitate, or interact with them, creating a social structure of leadership in the agent society. These inter-agent communications generate a complex social network with small-world character which itself forms the substrate for a second network, the action network. The latter is a highly dynamic, adaptive, directed network, defined by those inter-agent communication links on the substrate along which the passed information /prediction is acted upon by the other agents. By using the minority game for competition dynamics, here we show that when the substrate network is highly connected, the action network spontaneously develops hubs with a broad distribution of out-degrees, defining a robust leadership structure that is scale-free. Furthermore, in certain, realistic parameter ranges, facilitated by information passing on the action network, agents can spontaneously generate a high degree of cooperation making the collective almost maximally efficient.

Modeling Psychological Attributes in Psychology – An Epistemological Discussion: Network Analysis vs. Latent Variables

PubMed Central

Guyon, Hervé; Falissard, Bruno; Kop, Jean-Luc

2017-01-01

Network Analysis is considered as a new method that challenges Latent Variable models in inferring psychological attributes. With Network Analysis, psychological attributes are derived from a complex system of components without the need to call on any latent variables. But the ontological status of psychological attributes is not adequately defined with Network Analysis, because a psychological attribute is both a complex system and a property emerging from this complex system. The aim of this article is to reappraise the legitimacy of latent variable models by engaging in an ontological and epistemological discussion on psychological attributes. Psychological attributes relate to the mental equilibrium of individuals embedded in their social interactions, as robust attractors within complex dynamic processes with emergent properties, distinct from physical entities located in precise areas of the brain. Latent variables thus possess legitimacy, because the emergent properties can be conceptualized and analyzed on the sole basis of their manifestations, without exploring the upstream complex system. However, in opposition with the usual Latent Variable models, this article is in favor of the integration of a dynamic system of manifestations. Latent Variables models and Network Analysis thus appear as complementary approaches. New approaches combining Latent Network Models and Network Residuals are certainly a promising new way to infer psychological attributes, placing psychological attributes in an inter-subjective dynamic approach. Pragmatism-realism appears as the epistemological framework required if we are to use latent variables as representations of psychological attributes. PMID:28572780

The complex networks approach for authorship attribution of books

NASA Astrophysics Data System (ADS)

Mehri, Ali; Darooneh, Amir H.; Shariati, Ashrafalsadat

2012-04-01

Authorship analysis by means of textual features is an important task in linguistic studies. We employ complex networks theory to tackle this disputed problem. In this work, we focus on some measurable quantities of word co-occurrence network of each book for authorship characterization. Based on the network features, attribution probability is defined for authorship identification. Furthermore, two scaling exponents, q-parameter and α-exponent, are combined to classify personal writing style with acceptable high resolution power. The q-parameter, generally known as the nonextensivity measure, is calculated for degree distribution and the α-exponent comes from a power law relationship between number of links and number of nodes in the co-occurrence network constructed for different books written by each author. The applicability of the presented method is evaluated in an experiment with thirty six books of five Persian litterateurs. Our results show high accuracy rate in authorship attribution.

The structural role of weak and strong links in a financial market network

NASA Astrophysics Data System (ADS)

Garas, A.; Argyrakis, P.; Havlin, S.

2008-05-01

We investigate the properties of correlation based networks originating from economic complex systems, such as the network of stocks traded at the New York Stock Exchange (NYSE). The weaker links (low correlation) of the system are found to contribute to the overall connectivity of the network significantly more than the strong links (high correlation). We find that nodes connected through strong links form well defined communities. These communities are clustered together in more complex ways compared to the widely used classification according to the economic activity. We find that some companies, such as General Electric (GE), Coca Cola (KO), and others, can be involved in different communities. The communities are found to be quite stable over time. Similar results were obtained by investigating markets completely different in size and properties, such as the Athens Stock Exchange (ASE). The present method may be also useful for other networks generated through correlations.

Adaptive capacity of geographical clusters: Complexity science and network theory approach

NASA Astrophysics Data System (ADS)

Albino, Vito; Carbonara, Nunzia; Giannoccaro, Ilaria

This paper deals with the adaptive capacity of geographical clusters (GCs), that is a relevant topic in the literature. To address this topic, GC is considered as a complex adaptive system (CAS). Three theoretical propositions concerning the GC adaptive capacity are formulated by using complexity theory. First, we identify three main properties of CAS s that affect the adaptive capacity, namely the interconnectivity, the heterogeneity, and the level of control, and define how the value of these properties influence the adaptive capacity. Then, we associate these properties with specific GC characteristics so obtaining the key conditions of GCs that give them the adaptive capacity so assuring their competitive advantage. To test these theoretical propositions, a case study on two real GCs is carried out. The considered GCs are modeled as networks where firms are nodes and inter-firms relationships are links. Heterogeneity, interconnectivity, and level of control are considered as network properties and thus measured by using the methods of the network theory.

Core regulatory network motif underlies the ocellar complex patterning in Drosophila melanogaster

NASA Astrophysics Data System (ADS)

Aguilar-Hidalgo, D.; Lemos, M. C.; Córdoba, A.

2015-03-01

During organogenesis, developmental programs governed by Gene Regulatory Networks (GRN) define the functionality, size and shape of the different constituents of living organisms. Robustness, thus, is an essential characteristic that GRNs need to fulfill in order to maintain viability and reproducibility in a species. In the present work we analyze the robustness of the patterning for the ocellar complex formation in Drosophila melanogaster fly. We have systematically pruned the GRN that drives the development of this visual system to obtain the minimum pathway able to satisfy this pattern. We found that the mechanism underlying the patterning obeys to the dynamics of a 3-nodes network motif with a double negative feedback loop fed by a morphogenetic gradient that triggers the inhibition in a French flag problem fashion. A Boolean modeling of the GRN confirms robustness in the patterning mechanism showing the same result for different network complexity levels. Interestingly, the network provides a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli. This theoretical result predicts that the ocellar pattern may underlie oscillatory dynamics in its genetic regulation.

Multiplex PageRank.

PubMed

Halu, Arda; Mondragón, Raúl J; Panzarasa, Pietro; Bianconi, Ginestra

2013-01-01

Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

An evaluation of Bayesian techniques for controlling model complexity and selecting inputs in a neural network for short-term load forecasting.

PubMed

Hippert, Henrique S; Taylor, James W

2010-04-01

Artificial neural networks have frequently been proposed for electricity load forecasting because of their capabilities for the nonlinear modelling of large multivariate data sets. Modelling with neural networks is not an easy task though; two of the main challenges are defining the appropriate level of model complexity, and choosing the input variables. This paper evaluates techniques for automatic neural network modelling within a Bayesian framework, as applied to six samples containing daily load and weather data for four different countries. We analyse input selection as carried out by the Bayesian 'automatic relevance determination', and the usefulness of the Bayesian 'evidence' for the selection of the best structure (in terms of number of neurones), as compared to methods based on cross-validation. Copyright 2009 Elsevier Ltd. All rights reserved.

A Model of Biological Attacks on a Realistic Population

NASA Astrophysics Data System (ADS)

Carley, Kathleen M.; Fridsma, Douglas; Casman, Elizabeth; Altman, Neal; Chen, Li-Chiou; Kaminsky, Boris; Nave, Demian; Yahja, Alex

The capability to assess the impacts of large-scale biological attacks and the efficacy of containment policies is critical and requires knowledge-intensive reasoning about social response and disease transmission within a complex social system. There is a close linkage among social networks, transportation networks, disease spread, and early detection. Spatial dimensions related to public gathering places such as hospitals, nursing homes, and restaurants, can play a major role in epidemics [Klovdahl et. al. 2001]. Like natural epidemics, bioterrorist attacks unfold within spatially defined, complex social systems, and the societal and networked response can have profound effects on their outcome. This paper focuses on bioterrorist attacks, but the model has been applied to emergent and familiar diseases as well.

Topological Characteristics of the Hong Kong Stock Market: A Test-based P-threshold Approach to Understanding Network Complexity

PubMed Central

Xu, Ronghua; Wong, Wing-Keung; Chen, Guanrong; Huang, Shuo

2017-01-01

In this paper, we analyze the relationship among stock networks by focusing on the statistically reliable connectivity between financial time series, which accurately reflects the underlying pure stock structure. To do so, we firstly filter out the effect of market index on the correlations between paired stocks, and then take a t-test based P-threshold approach to lessening the complexity of the stock network based on the P values. We demonstrate the superiority of its performance in understanding network complexity by examining the Hong Kong stock market. By comparing with other filtering methods, we find that the P-threshold approach extracts purely and significantly correlated stock pairs, which reflect the well-defined hierarchical structure of the market. In analyzing the dynamic stock networks with fixed-size moving windows, our results show that three global financial crises, covered by the long-range time series, can be distinguishingly indicated from the network topological and evolutionary perspectives. In addition, we find that the assortativity coefficient can manifest the financial crises and therefore can serve as a good indicator of the financial market development. PMID:28145494

Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

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

Chinthavali, Supriya

Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) andmore » the criticality index is found to be effective for one test network to identify the vulnerable nodes.« less

Considerations for Software Defined Networking (SDN): Approaches and use cases

NASA Astrophysics Data System (ADS)

Bakshi, K.

Software Defined Networking (SDN) is an evolutionary approach to network design and functionality based on the ability to programmatically modify the behavior of network devices. SDN uses user-customizable and configurable software that's independent of hardware to enable networked systems to expand data flow control. SDN is in large part about understanding and managing a network as a unified abstraction. It will make networks more flexible, dynamic, and cost-efficient, while greatly simplifying operational complexity. And this advanced solution provides several benefits including network and service customizability, configurability, improved operations, and increased performance. There are several approaches to SDN and its practical implementation. Among them, two have risen to prominence with differences in pedigree and implementation. This paper's main focus will be to define, review, and evaluate salient approaches and use cases of the OpenFlow and Virtual Network Overlay approaches to SDN. OpenFlow is a communication protocol that gives access to the forwarding plane of a network's switches and routers. The Virtual Network Overlay relies on a completely virtualized network infrastructure and services to abstract the underlying physical network, which allows the overlay to be mobile to other physical networks. This is an important requirement for cloud computing, where applications and associated network services are migrated to cloud service providers and remote data centers on the fly as resource demands dictate. The paper will discuss how and where SDN can be applied and implemented, including research and academia, virtual multitenant data center, and cloud computing applications. Specific attention will be given to the cloud computing use case, where automated provisioning and programmable overlay for scalable multi-tenancy is leveraged via the SDN approach.

Biological network motif detection and evaluation

PubMed Central

2011-01-01

Background Molecular level of biological data can be constructed into system level of data as biological networks. Network motifs are defined as over-represented small connected subgraphs in networks and they have been used for many biological applications. Since network motif discovery involves computationally challenging processes, previous algorithms have focused on computational efficiency. However, we believe that the biological quality of network motifs is also very important. Results We define biological network motifs as biologically significant subgraphs and traditional network motifs are differentiated as structural network motifs in this paper. We develop five algorithms, namely, EDGEGO-BNM, EDGEBETWEENNESS-BNM, NMF-BNM, NMFGO-BNM and VOLTAGE-BNM, for efficient detection of biological network motifs, and introduce several evaluation measures including motifs included in complex, motifs included in functional module and GO term clustering score in this paper. Experimental results show that EDGEGO-BNM and EDGEBETWEENNESS-BNM perform better than existing algorithms and all of our algorithms are applicable to find structural network motifs as well. Conclusion We provide new approaches to finding network motifs in biological networks. Our algorithms efficiently detect biological network motifs and further improve existing algorithms to find high quality structural network motifs, which would be impossible using existing algorithms. The performances of the algorithms are compared based on our new evaluation measures in biological contexts. We believe that our work gives some guidelines of network motifs research for the biological networks. PMID:22784624

Three-dimensional {Co(3+)-Zn2+} and {Co(3+)-Cd2+} networks originated from carboxylate-rich building blocks: syntheses, structures, and heterogeneous catalysis.

PubMed

Kumar, Girijesh; Gupta, Rajeev

2013-10-07

The present work shows the utilization of Co(3+) complexes appended with either para- or meta-arylcarboxylic acid groups as the molecular building blocks for the construction of three-dimensional {Co(3+)-Zn(2+)} and {Co(3+)-Cd(2+)} heterobimetallic networks. The structural characterizations of these networks show several interesting features including well-defined pores and channels. These networks function as heterogeneous and reusable catalysts for the regio- and stereoselective ring-opening reactions of various epoxides and size-selective cyanation reactions of assorted aldehydes.

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Network geometry with flavor: From complexity to quantum geometry

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d -dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s =-1 ,0 ,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d . In d =1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d >1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t . Interestingly the NGF remains fully classical but its statistical properties reveal the relation to its quantum mechanical description. In fact the δ -dimensional faces of the NGF have generalized degrees that follow either the Fermi-Dirac, Boltzmann, or Bose-Einstein statistics depending on the flavor s and the dimensions d and δ .

Network geometry with flavor: From complexity to quantum geometry.

PubMed

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d-dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s=-1,0,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d. In d=1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d>1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t. Interestingly the NGF remains fully classical but its statistical properties reveal the relation to its quantum mechanical description. In fact the δ-dimensional faces of the NGF have generalized degrees that follow either the Fermi-Dirac, Boltzmann, or Bose-Einstein statistics depending on the flavor s and the dimensions d and δ.

Coarse-graining and self-dissimilarity of complex networks

NASA Astrophysics Data System (ADS)

Itzkovitz, Shalev; Levitt, Reuven; Kashtan, Nadav; Milo, Ron; Itzkovitz, Michael; Alon, Uri

2005-01-01

Can complex engineered and biological networks be coarse-grained into smaller and more understandable versions in which each node represents an entire pattern in the original network? To address this, we define coarse-graining units as connectivity patterns which can serve as the nodes of a coarse-grained network and present algorithms to detect them. We use this approach to systematically reverse-engineer electronic circuits, forming understandable high-level maps from incomprehensible transistor wiring: first, a coarse-grained version in which each node is a gate made of several transistors is established. Then the coarse-grained network is itself coarse-grained, resulting in a high-level blueprint in which each node is a circuit module made of many gates. We apply our approach also to a mammalian protein signal-transduction network, to find a simplified coarse-grained network with three main signaling channels that resemble multi-layered perceptrons made of cross-interacting MAP-kinase cascades. We find that both biological and electronic networks are “self-dissimilar,” with different network motifs at each level. The present approach may be used to simplify a variety of directed and nondirected, natural and designed networks.

Proteins Encoded in Genomic Regions Associated with Immune-Mediated Disease Physically Interact and Suggest Underlying Biology

PubMed Central

Rossin, Elizabeth J.; Lage, Kasper; Raychaudhuri, Soumya; Xavier, Ramnik J.; Tatar, Diana; Benita, Yair

2011-01-01

Genome-wide association studies (GWAS) have defined over 150 genomic regions unequivocally containing variation predisposing to immune-mediated disease. Inferring disease biology from these observations, however, hinges on our ability to discover the molecular processes being perturbed by these risk variants. It has previously been observed that different genes harboring causal mutations for the same Mendelian disease often physically interact. We sought to evaluate the degree to which this is true of genes within strongly associated loci in complex disease. Using sets of loci defined in rheumatoid arthritis (RA) and Crohn's disease (CD) GWAS, we build protein–protein interaction (PPI) networks for genes within associated loci and find abundant physical interactions between protein products of associated genes. We apply multiple permutation approaches to show that these networks are more densely connected than chance expectation. To confirm biological relevance, we show that the components of the networks tend to be expressed in similar tissues relevant to the phenotypes in question, suggesting the network indicates common underlying processes perturbed by risk loci. Furthermore, we show that the RA and CD networks have predictive power by demonstrating that proteins in these networks, not encoded in the confirmed list of disease associated loci, are significantly enriched for association to the phenotypes in question in extended GWAS analysis. Finally, we test our method in 3 non-immune traits to assess its applicability to complex traits in general. We find that genes in loci associated to height and lipid levels assemble into significantly connected networks but did not detect excess connectivity among Type 2 Diabetes (T2D) loci beyond chance. Taken together, our results constitute evidence that, for many of the complex diseases studied here, common genetic associations implicate regions encoding proteins that physically interact in a preferential manner, in line with observations in Mendelian disease. PMID:21249183

Reconstruction of Complex Directional Networks with Group Lasso Nonlinear Conditional Granger Causality.

PubMed

Yang, Guanxue; Wang, Lin; Wang, Xiaofan

2017-06-07

Reconstruction of networks underlying complex systems is one of the most crucial problems in many areas of engineering and science. In this paper, rather than identifying parameters of complex systems governed by pre-defined models or taking some polynomial and rational functions as a prior information for subsequent model selection, we put forward a general framework for nonlinear causal network reconstruction from time-series with limited observations. With obtaining multi-source datasets based on the data-fusion strategy, we propose a novel method to handle nonlinearity and directionality of complex networked systems, namely group lasso nonlinear conditional granger causality. Specially, our method can exploit different sets of radial basis functions to approximate the nonlinear interactions between each pair of nodes and integrate sparsity into grouped variables selection. The performance characteristic of our approach is firstly assessed with two types of simulated datasets from nonlinear vector autoregressive model and nonlinear dynamic models, and then verified based on the benchmark datasets from DREAM3 Challenge4. Effects of data size and noise intensity are also discussed. All of the results demonstrate that the proposed method performs better in terms of higher area under precision-recall curve.

Label propagation algorithm for community detection based on node importance and label influence

NASA Astrophysics Data System (ADS)

Zhang, Xian-Kun; Ren, Jing; Song, Chen; Jia, Jia; Zhang, Qian

2017-09-01

Recently, the detection of high-quality community has become a hot spot in the research of social network. Label propagation algorithm (LPA) has been widely concerned since it has the advantages of linear time complexity and is unnecessary to define objective function and the number of community in advance. However, LPA has the shortcomings of uncertainty and randomness in the label propagation process, which affects the accuracy and stability of the community. For large-scale social network, this paper proposes a novel label propagation algorithm for community detection based on node importance and label influence (LPA_NI). The experiments with comparative algorithms on real-world networks and synthetic networks have shown that LPA_NI can significantly improve the quality of community detection and shorten the iteration period. Also, it has better accuracy and stability in the case of similar complexity.

Dynamic Business Networks: A Headache for Sustainable Systems Interoperability

NASA Astrophysics Data System (ADS)

Agostinho, Carlos; Jardim-Goncalves, Ricardo

Collaborative networked environments emerged with the spread of the internet, contributing to overcome past communication barriers, and identifying interoperability as an essential property. When achieved seamlessly, efficiency is increased in the entire product life cycle. Nowadays, most organizations try to attain interoperability by establishing peer-to-peer mappings with the different partners, or in optimized networks, by using international standard models as the core for information exchange. In current industrial practice, mappings are only defined once, and the morphisms that represent them, are hardcoded in the enterprise systems. This solution has been effective for static environments, where enterprise and product models are valid for decades. However, with an increasingly complex and dynamic global market, models change frequently to answer new customer requirements. This paper draws concepts from the complex systems science and proposes a framework for sustainable systems interoperability in dynamic networks, enabling different organizations to evolve at their own rate.

Peeking Network States with Clustered Patterns

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

Kim, Jinoh; Sim, Alex

2015-10-20

Network traffic monitoring has long been a core element for effec- tive network management and security. However, it is still a chal- lenging task with a high degree of complexity for comprehensive analysis when considering multiple variables and ever-increasing traffic volumes to monitor. For example, one of the widely con- sidered approaches is to scrutinize probabilistic distributions, but it poses a scalability concern and multivariate analysis is not gen- erally supported due to the exponential increase of the complexity. In this work, we propose a novel method for network traffic moni- toring based on clustering, one of the powerful deep-learningmore » tech- niques. We show that the new approach enables us to recognize clustered results as patterns representing the network states, which can then be utilized to evaluate “similarity” of network states over time. In addition, we define a new quantitative measure for the similarity between two compared network states observed in dif- ferent time windows, as a supportive means for intuitive analysis. Finally, we demonstrate the clustering-based network monitoring with public traffic traces, and show that the proposed approach us- ing the clustering method has a great opportunity for feasible, cost- effective network monitoring.« less

Network Approach to Disease Diagnosis

NASA Astrophysics Data System (ADS)

Sharma, Amitabh; Bashan, Amir; Barabasi, Alber-Laszlo

2014-03-01

Human diseases could be viewed as perturbations of the underlying biological system. A thorough understanding of the topological and dynamical properties of the biological system is crucial to explain the mechanisms of many complex diseases. Recently network-based approaches have provided a framework for integrating multi-dimensional biological data that results in a better understanding of the pathophysiological state of complex diseases. Here we provide a network-based framework to improve the diagnosis of complex diseases. This framework is based on the integration of transcriptomics and the interactome. We analyze the overlap between the differentially expressed (DE) genes and disease genes (DGs) based on their locations in the molecular interaction network (''interactome''). Disease genes and their protein products tend to be much more highly connected than random, hence defining a disease sub-graph (called disease module) in the interactome. DE genes, even though different from the known set of DGs, may be significantly associated with the disease when considering their closeness to the disease module in the interactome. This new network approach holds the promise to improve the diagnosis of patients who cannot be diagnosed using conventional tools. Support was provided by HL066289 and HL105339 grants from the U.S. National Institutes of Health.

Lateral Prefrontal Cortex Subregions Make Dissociable Contributions during Fluid Reasoning

PubMed Central

Thompson, Russell; Duncan, John; Owen, Adrian M.

2011-01-01

Reasoning is a key component of adaptable “executive” behavior and is known to depend on a network of frontal and parietal brain regions. However, the mechanisms by which this network supports reasoning and adaptable behavior remain poorly defined. Here, we examine the relationship between reasoning, executive control, and frontoparietal function in a series of nonverbal reasoning experiments. Our results demonstrate that, in accordance with previous studies, a network of frontal and parietal brain regions is recruited during reasoning. Our results also reveal that this network can be fractionated according to how different subregions respond when distinct reasoning demands are manipulated. While increased rule complexity modulates activity within a right lateralized network including the middle frontal gyrus and the superior parietal cortex, analogical reasoning demand—or the requirement to remap rules on to novel features—recruits the left inferior rostrolateral prefrontal cortex and the lateral occipital complex. In contrast, the posterior extent of the inferior frontal gyrus, associated with simpler executive demands, is not differentially sensitive to rule complexity or analogical demand. These findings accord well with the hypothesis that different reasoning demands are supported by different frontal and parietal subregions. PMID:20483908

Delay-induced Turing-like waves for one-species reaction-diffusion model on a network

NASA Astrophysics Data System (ADS)

Petit, Julien; Carletti, Timoteo; Asllani, Malbor; Fanelli, Duccio

2015-09-01

A one-species time-delay reaction-diffusion system defined on a complex network is studied. Traveling waves are predicted to occur following a symmetry-breaking instability of a homogeneous stationary stable solution, subject to an external nonhomogeneous perturbation. These are generalized Turing-like waves that materialize in a single-species populations dynamics model, as the unexpected byproduct of the imposed delay in the diffusion part. Sufficient conditions for the onset of the instability are mathematically provided by performing a linear stability analysis adapted to time-delayed differential equations. The method here developed exploits the properties of the Lambert W-function. The prediction of the theory are confirmed by direct numerical simulation carried out for a modified version of the classical Fisher model, defined on a Watts-Strogatz network and with the inclusion of the delay.

Primordial Evolution in the Finitary Process Soup

NASA Astrophysics Data System (ADS)

Görnerup, Olof; Crutchfield, James P.

A general and basic model of primordial evolution—a soup of reacting finitary and discrete processes—is employed to identify and analyze fundamental mechanisms that generate and maintain complex structures in prebiotic systems. The processes—ɛ-machines as defined in computational mechanics—and their interaction networks both provide well defined notions of structure. This enables us to quantitatively demonstrate hierarchical self-organization in the soup in terms of complexity. We found that replicating processes evolve the strategy of successively building higher levels of organization by autocatalysis. Moreover, this is facilitated by local components that have low structural complexity, but high generality. In effect, the finitary process soup spontaneously evolves a selection pressure that favors such components. In light of the finitary process soup's generality, these results suggest a fundamental law of hierarchical systems: global complexity requires local simplicity.

Spreading to localized targets in complex networks

NASA Astrophysics Data System (ADS)

Sun, Ye; Ma, Long; Zeng, An; Wang, Wen-Xu

2016-12-01

As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and news propagation, the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, the influential spreaders identified by our method can effectively avoid infecting the non-target nodes in the spreading process.

Extracting information from multiplex networks

NASA Astrophysics Data System (ADS)

Iacovacci, Jacopo; Bianconi, Ginestra

2016-06-01

Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ ˜ S for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.

Implicitly Defined Neural Networks for Sequence Labeling

DTIC Science & Technology

2017-07-31

network are coupled together, in order to improve perfor- mance on complex, long-range dependencies in either direction of a sequence. We contrast our...struc- ture. 1.1 Related Work Long-range dependencies have been an issue as long as there have been NLP tasks, and there are many ef- fective approaches...retain informa- tion about dependencies . The Bidirectional LSTM (b- LSTM) (Graves and Schmidhuber, 2005), a natural ex- tension of (Schuster and Paliwal

Improved result on stability analysis of discrete stochastic neural networks with time delay

NASA Astrophysics Data System (ADS)

Wu, Zhengguang; Su, Hongye; Chu, Jian; Zhou, Wuneng

2009-04-01

This Letter investigates the problem of exponential stability for discrete stochastic time-delay neural networks. By defining a novel Lyapunov functional, an improved delay-dependent exponential stability criterion is established in terms of linear matrix inequality (LMI) approach. Meanwhile, the computational complexity of the newly established stability condition is reduced because less variables are involved. Numerical example is given to illustrate the effectiveness and the benefits of the proposed method.

Responses to olfactory signals reflect network structure of flower-visitor interactions.

PubMed

Junker, Robert R; Höcherl, Nicole; Blüthgen, Nico

2010-07-01

1. Network analyses provide insights into the diversity and complexity of ecological interactions and have motivated conclusions about community stability and co-evolution. However, biological traits and mechanisms such as chemical signals regulating the interactions between individual species--the microstructure of a network--are poorly understood. 2. We linked the responses of receivers (flower visitors) towards signals (flower scent) to the structure of a highly diverse natural flower-insect network. For each interaction, we define link temperature--a newly developed metric--as the deviation of the observed interaction strength from neutrality, assuming that animals randomly interact with flowers. 3. Link temperature was positively correlated to the specific visitors' responses to floral scents, experimentally examined in a mobile olfactometer. Thus, communication between plants and consumers via phytochemical signals reflects a significant part of the microstructure in a complex network. Negative as well as positive responses towards floral scents contributed to these results, where individual experience was important apart from innate behaviour. 4. Our results indicate that: (1) biological mechanisms have a profound impact on the microstructure of complex networks that underlies the outcome of aggregate statistics, and (2) floral scents act as a filter, promoting the visitation of some flower visitors, but also inhibiting the visitation of others.

Indoor Subspacing to Implement Indoorgml for Indoor Navigation

NASA Astrophysics Data System (ADS)

Jung, H.; Lee, J.

2015-10-01

According to an increasing demand for indoor navigation, there are great attempts to develop applicable indoor network. Representation for a room as a node is not sufficient to apply complex and large buildings. As OGC established IndoorGML, subspacing to partition the space for constructing logical network is introduced. Concerning subspacing for indoor network, transition space like halls or corridors also have to be considered. This study presents the subspacing process for creating an indoor network in shopping mall. Furthermore, categorization of transition space is performed and subspacing of this space is considered. Hall and squares in mall is especially defined for subspacing. Finally, implementation of subspacing process for indoor network is presented.

A method to integrate patterned electrospun fibers with microfluidic systems to generate complex microenvironments for cell culture applications

PubMed Central

Wallin, Patric; Zandén, Carl; Carlberg, Björn; Hellström Erkenstam, Nina; Liu, Johan; Gold, Julie

2012-01-01

The properties of a cell’s microenvironment are one of the main driving forces in cellular fate processes and phenotype expression invivo. The ability to create controlled cell microenvironments invitro becomes increasingly important for studying or controlling phenotype expression in tissue engineering and drug discovery applications. This includes the capability to modify material surface properties within well-defined liquid environments in cell culture systems. One successful approach to mimic extra cellular matrix is with porous electrospun polymer fiber scaffolds, while microfluidic networks have been shown to efficiently generate spatially and temporally defined liquid microenvironments. Here, a method to integrate electrospun fibers with microfluidic networks was developed in order to form complex cell microenvironments with the capability to vary relevant parameters. Spatially defined regions of electrospun fibers of both aligned and random orientation were patterned on glass substrates that were irreversibly bonded to microfluidic networks produced in poly-dimethyl-siloxane. Concentration gradients obtained in the fiber containing channels were characterized experimentally and compared with values obtained by computational fluid dynamic simulations. Velocity and shear stress profiles, as well as vortex formation, were calculated to evaluate the influence of fiber pads on fluidic properties. The suitability of the system to support cell attachment and growth was demonstrated with a fibroblast cell line. The potential of the platform was further verified by a functional investigation of neural stem cell alignment in response to orientation of electrospun fibers versus a microfluidic generated chemoattractant gradient of stromal cell-derived factor 1 alpha. The described method is a competitive strategy to create complex microenvironments invitro that allow detailed studies on the interplay of topography, substrate surface properties, and soluble microenvironment on cellular fate processes. PMID:23781291

Harnessing expert knowledge: Defining a Bayesian network decision model with limited data-Model structure for the vibration qualification problem

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

Rizzo, Davinia B.; Blackburn, Mark R.

As systems become more complex, systems engineers rely on experts to inform decisions. There are few experts and limited data in many complex new technologies. This challenges systems engineers as they strive to plan activities such as qualification in an environment where technical constraints are coupled with the traditional cost, risk, and schedule constraints. Bayesian network (BN) models provide a framework to aid systems engineers in planning qualification efforts with complex constraints by harnessing expert knowledge and incorporating technical factors. By quantifying causal factors, a BN model can provide data about the risk of implementing a decision supplemented with informationmore » on driving factors. This allows a systems engineer to make informed decisions and examine “what-if” scenarios. This paper discusses a novel process developed to define a BN model structure based primarily on expert knowledge supplemented with extremely limited data (25 data sets or less). The model was developed to aid qualification decisions—specifically to predict the suitability of six degrees of freedom (6DOF) vibration testing for qualification. The process defined the model structure with expert knowledge in an unbiased manner. Finally, validation during the process execution and of the model provided evidence the process may be an effective tool in harnessing expert knowledge for a BN model.« less

Harnessing expert knowledge: Defining a Bayesian network decision model with limited data-Model structure for the vibration qualification problem

DOE PAGES

Rizzo, Davinia B.; Blackburn, Mark R.

2018-03-30

As systems become more complex, systems engineers rely on experts to inform decisions. There are few experts and limited data in many complex new technologies. This challenges systems engineers as they strive to plan activities such as qualification in an environment where technical constraints are coupled with the traditional cost, risk, and schedule constraints. Bayesian network (BN) models provide a framework to aid systems engineers in planning qualification efforts with complex constraints by harnessing expert knowledge and incorporating technical factors. By quantifying causal factors, a BN model can provide data about the risk of implementing a decision supplemented with informationmore » on driving factors. This allows a systems engineer to make informed decisions and examine “what-if” scenarios. This paper discusses a novel process developed to define a BN model structure based primarily on expert knowledge supplemented with extremely limited data (25 data sets or less). The model was developed to aid qualification decisions—specifically to predict the suitability of six degrees of freedom (6DOF) vibration testing for qualification. The process defined the model structure with expert knowledge in an unbiased manner. Finally, validation during the process execution and of the model provided evidence the process may be an effective tool in harnessing expert knowledge for a BN model.« less

The role of stabilizing and communicating symptoms given overlapping communities in psychopathology networks.

PubMed

Blanken, Tessa F; Deserno, Marie K; Dalege, Jonas; Borsboom, Denny; Blanken, Peter; Kerkhof, Gerard A; Cramer, Angélique O J

2018-04-11

Network theory, as a theoretical and methodological framework, is energizing many research fields, among which clinical psychology and psychiatry. Fundamental to the network theory of psychopathology is the role of specific symptoms and their interactions. Current statistical tools, however, fail to fully capture this constitutional property. We propose community detection tools as a means to evaluate the complex network structure of psychopathology, free from its original boundaries of distinct disorders. Unique to this approach is that symptoms can belong to multiple communities. Using a large community sample and spanning a broad range of symptoms (Symptom Checklist-90-Revised), we identified 18 communities of interconnected symptoms. The differential role of symptoms within and between communities offers a framework to study the clinical concepts of comorbidity, heterogeneity and hallmark symptoms. Symptoms with many and strong connections within a community, defined as stabilizing symptoms, could be thought of as the core of a community, whereas symptoms that belong to multiple communities, defined as communicating symptoms, facilitate the communication between problem areas. We propose that defining symptoms on their stabilizing and/or communicating role within and across communities accelerates our understanding of these clinical phenomena, central to research and treatment of psychopathology.

The effect of the neural activity on topological properties of growing neural networks.

PubMed

Gafarov, F M; Gafarova, V R

2016-09-01

The connectivity structure in cortical networks defines how information is transmitted and processed, and it is a source of the complex spatiotemporal patterns of network's development, and the process of creation and deletion of connections is continuous in the whole life of the organism. In this paper, we study how neural activity influences the growth process in neural networks. By using a two-dimensional activity-dependent growth model we demonstrated the neural network growth process from disconnected neurons to fully connected networks. For making quantitative investigation of the network's activity influence on its topological properties we compared it with the random growth network not depending on network's activity. By using the random graphs theory methods for the analysis of the network's connections structure it is shown that the growth in neural networks results in the formation of a well-known "small-world" network.

The 'wired' universe of organic chemistry.

PubMed

Grzybowski, Bartosz A; Bishop, Kyle J M; Kowalczyk, Bartlomiej; Wilmer, Christopher E

2009-04-01

The millions of reactions performed and compounds synthesized by organic chemists over the past two centuries connect to form a network larger than the metabolic networks of higher organisms and rivalling the complexity of the World Wide Web. Despite its apparent randomness, the network of chemistry has a well-defined, modular architecture. The network evolves in time according to trends that have not changed since the inception of the discipline, and thus project into chemistry's future. Analysis of organic chemistry using the tools of network theory enables the identification of most 'central' organic molecules, and for the prediction of which and how many molecules will be made in the future. Statistical analyses based on network connectivity are useful in optimizing parallel syntheses, in estimating chemical reactivity, and more.

Statistical Mechanics of Temporal and Interacting Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun

In the last ten years important breakthroughs in the understanding of the topology of complexity have been made in the framework of network science. Indeed it has been found that many networks belong to the universality classes called small-world networks or scale-free networks. Moreover it was found that the complex architecture of real world networks strongly affects the critical phenomena defined on these structures. Nevertheless the main focus of the research has been the characterization of single and static networks. Recently, temporal networks and interacting networks have attracted large interest. Indeed many networks are interacting or formed by a multilayer structure. Example of these networks are found in social networks where an individual might be at the same time part of different social networks, in economic and financial networks, in physiology or in infrastructure systems. Moreover, many networks are temporal, i.e. the links appear and disappear on the fast time scale. Examples of these networks are social networks of contacts such as face-to-face interactions or mobile-phone communication, the time-dependent correlations in the brain activity and etc. Understanding the evolution of temporal and multilayer networks and characterizing critical phenomena in these systems is crucial if we want to describe, predict and control the dynamics of complex system. In this thesis, we investigate several statistical mechanics models of temporal and interacting networks, to shed light on the dynamics of this new generation of complex networks. First, we investigate a model of temporal social networks aimed at characterizing human social interactions such as face-to-face interactions and phone-call communication. Indeed thanks to the availability of data on these interactions, we are now in the position to compare the proposed model to the real data finding good agreement. Second, we investigate the entropy of temporal networks and growing networks , to provide a new framework to quantify the information encoded in these networks and to answer a fundamental problem in network science: how complex are temporal and growing networks. Finally, we consider two examples of critical phenomena in interacting networks. In particular, on one side we investigate the percolation of interacting networks by introducing antagonistic interactions. On the other side, we investigate a model of political election based on the percolation of antagonistic networks. The aim of this research is to show how antagonistic interactions change the physics of critical phenomena on interacting networks. We believe that the work presented in these thesis offers the possibility to appreciate the large variability of problems that can be addressed in the new framework of temporal and interacting networks.

Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation

PubMed Central

Kitson, Alison; Brook, Alan; Harvey, Gill; Jordan, Zoe; Marshall, Rhianon; O’Shea, Rebekah; Wilson, David

2018-01-01

Many representations of the movement of healthcare knowledge through society exist, and multiple models for the translation of evidence into policy and practice have been articulated. Most are linear or cyclical and very few come close to reflecting the dense and intricate relationships, systems and politics of organizations and the processes required to enact sustainable improvements. We illustrate how using complexity and network concepts can better inform knowledge translation (KT) and argue that changing the way we think and talk about KT could enhance the creation and movement of knowledge throughout those systems needing to develop and utilise it. From our theoretical refinement, we propose that KT is a complex network composed of five interdependent sub-networks, or clusters, of key processes (problem identification [PI], knowledge creation [KC], knowledge synthesis [KS], implementation [I], and evaluation [E]) that interact dynamically in different ways at different times across one or more sectors (community; health; government; education; research for example). We call this the KT Complexity Network, defined as a network that optimises the effective, appropriate and timely creation and movement of knowledge to those who need it in order to improve what they do. Activation within and throughout any one of these processes and systems depends upon the agents promoting the change, successfully working across and between multiple systems and clusters. The case is presented for moving to a way of thinking about KT using complexity and network concepts. This extends the thinking that is developing around integrated KT approaches. There are a number of policy and practice implications that need to be considered in light of this shift in thinking. PMID:29524952

Dynamical and topological aspects of consensus formation in complex networks

NASA Astrophysics Data System (ADS)

Chacoma, A.; Mato, G.; Kuperman, M. N.

2018-04-01

The present work analyzes a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple message, is generated by interactions during the agent's walk and manifest itself in the collapse of the various opinions into a single one. We analyze how the topology of the underlying networks and the rules of interaction between the agents promote or inhibit the emergence of this consensus. We find that non-linear interaction rules are required to form consensus and that consensus is more easily achieved in networks whose degree distribution is narrower.

Power Allocation and Outage Probability Analysis for SDN-based Radio Access Networks

NASA Astrophysics Data System (ADS)

Zhao, Yongxu; Chen, Yueyun; Mai, Zhiyuan

2018-01-01

In this paper, performance of Access network Architecture based SDN (Software Defined Network) is analyzed with respect to the power allocation issue. A power allocation scheme PSO-PA (Particle Swarm Optimization-power allocation) algorithm is proposed, the proposed scheme is subjected to constant total power with the objective of minimizing system outage probability. The entire access network resource configuration is controlled by the SDN controller, then it sends the optimized power distribution factor to the base station source node (SN) and the relay node (RN). Simulation results show that the proposed scheme reduces the system outage probability at a low complexity.

Synaptic activity induces input-specific rearrangements in a targeted synaptic protein interaction network.

PubMed

Lautz, Jonathan D; Brown, Emily A; VanSchoiack, Alison A Williams; Smith, Stephen E P

2018-05-27

Cells utilize dynamic, network level rearrangements in highly interconnected protein interaction networks to transmit and integrate information from distinct signaling inputs. Despite the importance of protein interaction network dynamics, the organizational logic underlying information flow through these networks is not well understood. Previously, we developed the quantitative multiplex co-immunoprecipitation platform, which allows for the simultaneous and quantitative measurement of the amount of co-association between large numbers of proteins in shared complexes. Here, we adapt quantitative multiplex co-immunoprecipitation to define the activity dependent dynamics of an 18-member protein interaction network in order to better understand the underlying principles governing glutamatergic signal transduction. We first establish that immunoprecipitation detected by flow cytometry can detect activity dependent changes in two known protein-protein interactions (Homer1-mGluR5 and PSD-95-SynGAP). We next demonstrate that neuronal stimulation elicits a coordinated change in our targeted protein interaction network, characterized by the initial dissociation of Homer1 and SynGAP-containing complexes followed by increased associations among glutamate receptors and PSD-95. Finally, we show that stimulation of distinct glutamate receptor types results in different modular sets of protein interaction network rearrangements, and that cells activate both modules in order to integrate complex inputs. This analysis demonstrates that cells respond to distinct types of glutamatergic input by modulating different combinations of protein co-associations among a targeted network of proteins. Our data support a model of synaptic plasticity in which synaptic stimulation elicits dissociation of preexisting multiprotein complexes, opening binding slots in scaffold proteins and allowing for the recruitment of additional glutamatergic receptors. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Robustness surfaces of complex networks

NASA Astrophysics Data System (ADS)

Manzano, Marc; Sahneh, Faryad; Scoglio, Caterina; Calle, Eusebi; Marzo, Jose Luis

2014-09-01

Despite the robustness of complex networks has been extensively studied in the last decade, there still lacks a unifying framework able to embrace all the proposed metrics. In the literature there are two open issues related to this gap: (a) how to dimension several metrics to allow their summation and (b) how to weight each of the metrics. In this work we propose a solution for the two aforementioned problems by defining the R*-value and introducing the concept of robustness surface (Ω). The rationale of our proposal is to make use of Principal Component Analysis (PCA). We firstly adjust to 1 the initial robustness of a network. Secondly, we find the most informative robustness metric under a specific failure scenario. Then, we repeat the process for several percentage of failures and different realizations of the failure process. Lastly, we join these values to form the robustness surface, which allows the visual assessment of network robustness variability. Results show that a network presents different robustness surfaces (i.e., dissimilar shapes) depending on the failure scenario and the set of metrics. In addition, the robustness surface allows the robustness of different networks to be compared.

Robustness surfaces of complex networks.

PubMed

Manzano, Marc; Sahneh, Faryad; Scoglio, Caterina; Calle, Eusebi; Marzo, Jose Luis

2014-09-02

Despite the robustness of complex networks has been extensively studied in the last decade, there still lacks a unifying framework able to embrace all the proposed metrics. In the literature there are two open issues related to this gap: (a) how to dimension several metrics to allow their summation and (b) how to weight each of the metrics. In this work we propose a solution for the two aforementioned problems by defining the R*-value and introducing the concept of robustness surface (Ω). The rationale of our proposal is to make use of Principal Component Analysis (PCA). We firstly adjust to 1 the initial robustness of a network. Secondly, we find the most informative robustness metric under a specific failure scenario. Then, we repeat the process for several percentage of failures and different realizations of the failure process. Lastly, we join these values to form the robustness surface, which allows the visual assessment of network robustness variability. Results show that a network presents different robustness surfaces (i.e., dissimilar shapes) depending on the failure scenario and the set of metrics. In addition, the robustness surface allows the robustness of different networks to be compared.

Defining NADH-Driven Allostery Regulating Apoptosis-Inducing Factor

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

Brosey, Chris A.; Ho, Chris; Long, Winnie Z.

Apoptosis-inducing factor (AIF) is critical for mitochondrial respiratory complex biogenesis and for mediating necroptotic parthanatos; these functions are seemingly regulated by enigmatic allosteric switching driven by NADH charge-transfer complex (CTC) formation. In this paper, we define molecular pathways linking AIF's active site to allosteric switching regions by characterizing dimer-permissive mutants using small-angle X-ray scattering (SAXS) and crystallography and by probing AIF-CTC communication networks using molecular dynamics simulations. Collective results identify two pathways propagating allostery from the CTC active site: (1) active-site H454 links to S480 of AIF's central β-strand to modulate a hydrophobic border at the dimerization interface, and (2)more » an interaction network links AIF's FAD cofactor, central β-strand, and Cβ-clasp whereby R529 reorientation initiates C-loop release during CTC formation. Finally, this knowledge of AIF allostery and its flavoswitch mechanism provides a foundation for biologically understanding and biomedically controlling its participation in mitochondrial homeostasis and cell death.« less

Defining NADH-Driven Allostery Regulating Apoptosis-Inducing Factor

DOE PAGES

Brosey, Chris A.; Ho, Chris; Long, Winnie Z.; ...

2016-11-03

Apoptosis-inducing factor (AIF) is critical for mitochondrial respiratory complex biogenesis and for mediating necroptotic parthanatos; these functions are seemingly regulated by enigmatic allosteric switching driven by NADH charge-transfer complex (CTC) formation. In this paper, we define molecular pathways linking AIF's active site to allosteric switching regions by characterizing dimer-permissive mutants using small-angle X-ray scattering (SAXS) and crystallography and by probing AIF-CTC communication networks using molecular dynamics simulations. Collective results identify two pathways propagating allostery from the CTC active site: (1) active-site H454 links to S480 of AIF's central β-strand to modulate a hydrophobic border at the dimerization interface, and (2)more » an interaction network links AIF's FAD cofactor, central β-strand, and Cβ-clasp whereby R529 reorientation initiates C-loop release during CTC formation. Finally, this knowledge of AIF allostery and its flavoswitch mechanism provides a foundation for biologically understanding and biomedically controlling its participation in mitochondrial homeostasis and cell death.« less

Design Principles of Regulatory Networks: Searching for the Molecular Algorithms of the Cell

PubMed Central

Lim, Wendell A.; Lee, Connie M.; Tang, Chao

2013-01-01

A challenge in biology is to understand how complex molecular networks in the cell execute sophisticated regulatory functions. Here we explore the idea that there are common and general principles that link network structures to biological functions, principles that constrain the design solutions that evolution can converge upon for accomplishing a given cellular task. We describe approaches for classifying networks based on abstract architectures and functions, rather than on the specific molecular components of the networks. For any common regulatory task, can we define the space of all possible molecular solutions? Such inverse approaches might ultimately allow the assembly of a design table of core molecular algorithms that could serve as a guide for building synthetic networks and modulating disease networks. PMID:23352241

Bridges in complex networks

NASA Astrophysics Data System (ADS)

Wu, Ang-Kun; Tian, Liang; Liu, Yang-Yu

2018-01-01

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but they have a fraction of bridges that is very similar to their degree-preserving randomizations. We define an edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have a very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction and the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.

The complex network of musical tastes

NASA Astrophysics Data System (ADS)

Buldú, Javier M.; Cano, P.; Koppenberger, M.; Almendral, Juan A.; Boccaletti, S.

2007-06-01

We present an empirical study of the evolution of a social network constructed under the influence of musical tastes. The network is obtained thanks to the selfless effort of a broad community of users who share playlists of their favourite songs with other users. When two songs co-occur in a playlist a link is created between them, leading to a complex network where songs are the fundamental nodes. In this representation, songs in the same playlist could belong to different musical genres, but they are prone to be linked by a certain musical taste (e.g. if songs A and B co-occur in several playlists, an user who likes A will probably like also B). Indeed, playlist collections such as the one under study are the basic material that feeds some commercial music recommendation engines. Since playlists have an input date, we are able to evaluate the topology of this particular complex network from scratch, observing how its characteristic parameters evolve in time. We compare our results with those obtained from an artificial network defined by means of a null model. This comparison yields some insight on the evolution and structure of such a network, which could be used as ground data for the development of proper models. Finally, we gather information that can be useful for the development of music recommendation engines and give some hints about how top-hits appear.

Centrality in earthquake multiplex networks

NASA Astrophysics Data System (ADS)

Lotfi, Nastaran; Darooneh, Amir Hossein; Rodrigues, Francisco A.

2018-06-01

Seismic time series has been mapped as a complex network, where a geographical region is divided into square cells that represent the nodes and connections are defined according to the sequence of earthquakes. In this paper, we map a seismic time series to a temporal network, described by a multiplex network, and characterize the evolution of the network structure in terms of the eigenvector centrality measure. We generalize previous works that considered the single layer representation of earthquake networks. Our results suggest that the multiplex representation captures better earthquake activity than methods based on single layer networks. We also verify that the regions with highest seismological activities in Iran and California can be identified from the network centrality analysis. The temporal modeling of seismic data provided here may open new possibilities for a better comprehension of the physics of earthquakes.

Using NetMaster to manage IBM networks

NASA Technical Reports Server (NTRS)

Ginsburg, Guss

1991-01-01

After defining a network and conveying its importance to support the activities at the JSC, the need for network management based on the size and complexity of the IBM SNA network at JSC is demonstrated. Network Management consists of being aware of component status and the ability to control resources to meet the availability and service needs of users. The concerns of the user are addressed as well as those of the staff responsible for managing the network. It is explained how NetMaster (a network management system for managing SNA networks) is used to enhance reliability and maximize service to SNA network users through automated procedures. The following areas are discussed: customization, problem and configuration management, and system measurement applications of NetMaster. Also, several examples are given that demonstrate NetMaster's ability to manage and control the network, integrate various product functions, as well as provide useful management information.

Mutual Information Rate and Bounds for It

PubMed Central

Baptista, Murilo S.; Rubinger, Rero M.; Viana, Emilson R.; Sartorelli, José C.; Parlitz, Ulrich; Grebogi, Celso

2012-01-01

The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators. PMID:23112809

Stochastic blockmodeling of the modules and core of the Caenorhabditis elegans connectome.

PubMed

Pavlovic, Dragana M; Vértes, Petra E; Bullmore, Edward T; Schafer, William R; Nichols, Thomas E

2014-01-01

Recently, there has been much interest in the community structure or mesoscale organization of complex networks. This structure is characterised either as a set of sparsely inter-connected modules or as a highly connected core with a sparsely connected periphery. However, it is often difficult to disambiguate these two types of mesoscale structure or, indeed, to summarise the full network in terms of the relationships between its mesoscale constituents. Here, we estimate a community structure with a stochastic blockmodel approach, the Erdős-Rényi Mixture Model, and compare it to the much more widely used deterministic methods, such as the Louvain and Spectral algorithms. We used the Caenorhabditis elegans (C. elegans) nervous system (connectome) as a model system in which biological knowledge about each node or neuron can be used to validate the functional relevance of the communities obtained. The deterministic algorithms derived communities with 4-5 modules, defined by sparse inter-connectivity between all modules. In contrast, the stochastic Erdős-Rényi Mixture Model estimated a community with 9 blocks or groups which comprised a similar set of modules but also included a clearly defined core, made of 2 small groups. We show that the "core-in-modules" decomposition of the worm brain network, estimated by the Erdős-Rényi Mixture Model, is more compatible with prior biological knowledge about the C. elegans nervous system than the purely modular decomposition defined deterministically. We also show that the blockmodel can be used both to generate stochastic realisations (simulations) of the biological connectome, and to compress network into a small number of super-nodes and their connectivity. We expect that the Erdős-Rényi Mixture Model may be useful for investigating the complex community structures in other (nervous) systems.

A Decade of Neural Networks: Practical Applications and Prospects

NASA Technical Reports Server (NTRS)

Kemeny, Sabrina E.

1994-01-01

The Jet Propulsion Laboratory Neural Network Workshop, sponsored by NASA and DOD, brings together sponsoring agencies, active researchers, and the user community to formulate a vision for the next decade of neural network research and application prospects. While the speed and computing power of microprocessors continue to grow at an ever-increasing pace, the demand to intelligently and adaptively deal with the complex, fuzzy, and often ill-defined world around us remains to a large extent unaddressed. Powerful, highly parallel computing paradigms such as neural networks promise to have a major impact in addressing these needs. Papers in the workshop proceedings highlight benefits of neural networks in real-world applications compared to conventional computing techniques. Topics include fault diagnosis, pattern recognition, and multiparameter optimization.

Chaotic mixing in three-dimensional microvascular networks fabricated by direct-write assembly.

PubMed

Therriault, Daniel; White, Scott R; Lewis, Jennifer A

2003-04-01

The creation of geometrically complex fluidic devices is a subject of broad fundamental and technological interest. Here, we demonstrate the fabrication of three-dimensional (3D) microvascular networks through direct-write assembly of a fugitive organic ink. This approach yields a pervasive network of smooth cylindrical channels (approximately 10-300 microm) with defined connectivity. Square-spiral towers, isolated within this vascular network, promote fluid mixing through chaotic advection. These vertical towers give rise to dramatic improvements in mixing relative to simple straight (1D) and square-wave (2D) channels while significantly reducing the device planar footprint. We envisage that 3D microvascular networks will provide an enabling platform for a wide array of fluidic-based applications.

Centrality measures in temporal networks with time series analysis

NASA Astrophysics Data System (ADS)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Wang, Xiaojie; Yi, Dongyun

2017-05-01

The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.

Encoding sensory and motor patterns as time-invariant trajectories in recurrent neural networks

PubMed Central

2018-01-01

Much of the information the brain processes and stores is temporal in nature—a spoken word or a handwritten signature, for example, is defined by how it unfolds in time. However, it remains unclear how neural circuits encode complex time-varying patterns. We show that by tuning the weights of a recurrent neural network (RNN), it can recognize and then transcribe spoken digits. The model elucidates how neural dynamics in cortical networks may resolve three fundamental challenges: first, encode multiple time-varying sensory and motor patterns as stable neural trajectories; second, generalize across relevant spatial features; third, identify the same stimuli played at different speeds—we show that this temporal invariance emerges because the recurrent dynamics generate neural trajectories with appropriately modulated angular velocities. Together our results generate testable predictions as to how recurrent networks may use different mechanisms to generalize across the relevant spatial and temporal features of complex time-varying stimuli. PMID:29537963

Encoding sensory and motor patterns as time-invariant trajectories in recurrent neural networks.

PubMed

Goudar, Vishwa; Buonomano, Dean V

2018-03-14

Much of the information the brain processes and stores is temporal in nature-a spoken word or a handwritten signature, for example, is defined by how it unfolds in time. However, it remains unclear how neural circuits encode complex time-varying patterns. We show that by tuning the weights of a recurrent neural network (RNN), it can recognize and then transcribe spoken digits. The model elucidates how neural dynamics in cortical networks may resolve three fundamental challenges: first, encode multiple time-varying sensory and motor patterns as stable neural trajectories; second, generalize across relevant spatial features; third, identify the same stimuli played at different speeds-we show that this temporal invariance emerges because the recurrent dynamics generate neural trajectories with appropriately modulated angular velocities. Together our results generate testable predictions as to how recurrent networks may use different mechanisms to generalize across the relevant spatial and temporal features of complex time-varying stimuli. © 2018, Goudar et al.

Folding energy landscape and network dynamics of small globular proteins

PubMed Central

Hori, Naoto; Chikenji, George; Berry, R. Stephen; Takada, Shoji

2009-01-01

The folding energy landscape of proteins has been suggested to be funnel-like with some degree of ruggedness on the slope. How complex the landscape, however, is still rather unclear. Many experiments for globular proteins suggested relative simplicity, whereas molecular simulations of shorter peptides implied more complexity. Here, by using complete conformational sampling of 2 globular proteins, protein G and src SH3 domain and 2 related random peptides, we investigated their energy landscapes, topological properties of folding networks, and folding dynamics. The projected energy surfaces of globular proteins were funneled in the vicinity of the native but also have other quite deep, accessible minima, whereas the randomized peptides have many local basins, including some leading to seriously misfolded forms. Dynamics in the denatured part of the network exhibited basin-hopping itinerancy among many conformations, whereas the protein reached relatively well-defined final stages that led to their native states. We also found that the folding network has the hierarchic nature characterized by the scale-free and the small-world properties. PMID:19114654

Folding energy landscape and network dynamics of small globular proteins.

PubMed

Hori, Naoto; Chikenji, George; Berry, R Stephen; Takada, Shoji

2009-01-06

The folding energy landscape of proteins has been suggested to be funnel-like with some degree of ruggedness on the slope. How complex the landscape, however, is still rather unclear. Many experiments for globular proteins suggested relative simplicity, whereas molecular simulations of shorter peptides implied more complexity. Here, by using complete conformational sampling of 2 globular proteins, protein G and src SH3 domain and 2 related random peptides, we investigated their energy landscapes, topological properties of folding networks, and folding dynamics. The projected energy surfaces of globular proteins were funneled in the vicinity of the native but also have other quite deep, accessible minima, whereas the randomized peptides have many local basins, including some leading to seriously misfolded forms. Dynamics in the denatured part of the network exhibited basin-hopping itinerancy among many conformations, whereas the protein reached relatively well-defined final stages that led to their native states. We also found that the folding network has the hierarchic nature characterized by the scale-free and the small-world properties.

Analytical solution for a class of network dynamics with mechanical and financial applications

NASA Astrophysics Data System (ADS)

Krejčí, P.; Lamba, H.; Melnik, S.; Rachinskii, D.

2014-09-01

We show that for a certain class of dynamics at the nodes the response of a network of any topology to arbitrary inputs is defined in a simple way by its response to a monotone input. The nodes may have either a discrete or continuous set of states and there is no limit on the complexity of the network. The results provide both an efficient numerical method and the potential for accurate analytic approximation of the dynamics on such networks. As illustrative applications, we introduce a quasistatic mechanical model with objects interacting via frictional forces and a financial market model with avalanches and critical behavior that are generated by momentum trading strategies.

Evolution of SH2 domains and phosphotyrosine signalling networks

PubMed Central

Liu, Bernard A.; Nash, Piers D.

2012-01-01

Src homology 2 (SH2) domains mediate selective protein–protein interactions with tyrosine phosphorylated proteins, and in doing so define specificity of phosphotyrosine (pTyr) signalling networks. SH2 domains and protein-tyrosine phosphatases expand alongside protein-tyrosine kinases (PTKs) to coordinate cellular and organismal complexity in the evolution of the unikont branch of the eukaryotes. Examination of conserved families of PTKs and SH2 domain proteins provides fiduciary marks that trace the evolutionary landscape for the development of complex cellular systems in the proto-metazoan and metazoan lineages. The evolutionary provenance of conserved SH2 and PTK families reveals the mechanisms by which diversity is achieved through adaptations in tissue-specific gene transcription, altered ligand binding, insertions of linear motifs and the gain or loss of domains following gene duplication. We discuss mechanisms by which pTyr-mediated signalling networks evolve through the development of novel and expanded families of SH2 domain proteins and the elaboration of connections between pTyr-signalling proteins. These changes underlie the variety of general and specific signalling networks that give rise to tissue-specific functions and increasingly complex developmental programmes. Examination of SH2 domains from an evolutionary perspective provides insight into the process by which evolutionary expansion and modification of molecular protein interaction domain proteins permits the development of novel protein-interaction networks and accommodates adaptation of signalling networks. PMID:22889907

Efficient Transmission of Subthreshold Signals in Complex Networks of Spiking Neurons

PubMed Central

Torres, Joaquin J.; Elices, Irene; Marro, J.

2015-01-01

We investigate the efficient transmission and processing of weak, subthreshold signals in a realistic neural medium in the presence of different levels of the underlying noise. Assuming Hebbian weights for maximal synaptic conductances—that naturally balances the network with excitatory and inhibitory synapses—and considering short-term synaptic plasticity affecting such conductances, we found different dynamic phases in the system. This includes a memory phase where population of neurons remain synchronized, an oscillatory phase where transitions between different synchronized populations of neurons appears and an asynchronous or noisy phase. When a weak stimulus input is applied to each neuron, increasing the level of noise in the medium we found an efficient transmission of such stimuli around the transition and critical points separating different phases for well-defined different levels of stochasticity in the system. We proved that this intriguing phenomenon is quite robust, as it occurs in different situations including several types of synaptic plasticity, different type and number of stored patterns and diverse network topologies, namely, diluted networks and complex topologies such as scale-free and small-world networks. We conclude that the robustness of the phenomenon in different realistic scenarios, including spiking neurons, short-term synaptic plasticity and complex networks topologies, make very likely that it could also occur in actual neural systems as recent psycho-physical experiments suggest. PMID:25799449

Use of neural networks to model complex immunogenetic associations of disease: human leukocyte antigen impact on the progression of human immunodeficiency virus infection.

PubMed

Ioannidis, J P; McQueen, P G; Goedert, J J; Kaslow, R A

1998-03-01

Complex immunogenetic associations of disease involving a large number of gene products are difficult to evaluate with traditional statistical methods and may require complex modeling. The authors evaluated the performance of feed-forward backpropagation neural networks in predicting rapid progression to acquired immunodeficiency syndrome (AIDS) for patients with human immunodeficiency virus (HIV) infection on the basis of major histocompatibility complex variables. Networks were trained on data from patients from the Multicenter AIDS Cohort Study (n = 139) and then validated on patients from the DC Gay cohort (n = 102). The outcome of interest was rapid disease progression, defined as progression to AIDS in <6 years from seroconversion. Human leukocyte antigen (HLA) variables were selected as network inputs with multivariate regression and a previously described algorithm selecting markers with extreme point estimates for progression risk. Network performance was compared with that of logistic regression. Networks with 15 HLA inputs and a single hidden layer of five nodes achieved a sensitivity of 87.5% and specificity of 95.6% in the training set, vs. 77.0% and 76.9%, respectively, achieved by logistic regression. When validated on the DC Gay cohort, networks averaged a sensitivity of 59.1% and specificity of 74.3%, vs. 53.1% and 61.4%, respectively, for logistic regression. Neural networks offer further support to the notion that HIV disease progression may be dependent on complex interactions between different class I and class II alleles and transporters associated with antigen processing variants. The effect in the current models is of moderate magnitude, and more data as well as other host and pathogen variables may need to be considered to improve the performance of the models. Artificial intelligence methods may complement linear statistical methods for evaluating immunogenetic associations of disease.

Classification of volcanic ash particles using a convolutional neural network and probability.

PubMed

Shoji, Daigo; Noguchi, Rina; Otsuki, Shizuka; Hino, Hideitsu

2018-05-25

Analyses of volcanic ash are typically performed either by qualitatively classifying ash particles by eye or by quantitatively parameterizing its shape and texture. While complex shapes can be classified through qualitative analyses, the results are subjective due to the difficulty of categorizing complex shapes into a single class. Although quantitative analyses are objective, selection of shape parameters is required. Here, we applied a convolutional neural network (CNN) for the classification of volcanic ash. First, we defined four basal particle shapes (blocky, vesicular, elongated, rounded) generated by different eruption mechanisms (e.g., brittle fragmentation), and then trained the CNN using particles composed of only one basal shape. The CNN could recognize the basal shapes with over 90% accuracy. Using the trained network, we classified ash particles composed of multiple basal shapes based on the output of the network, which can be interpreted as a mixing ratio of the four basal shapes. Clustering of samples by the averaged probabilities and the intensity is consistent with the eruption type. The mixing ratio output by the CNN can be used to quantitatively classify complex shapes in nature without categorizing forcibly and without the need for shape parameters, which may lead to a new taxonomy.

Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks.

PubMed

Wang, Zhijun; Mirdamadi, Reza; Wang, Qing

2016-01-01

Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building.

The roosting spatial network of a bird-predator bat.

PubMed

Fortuna, Miguel A; Popa-Lisseanu, Ana G; Ibáñez, Carlos; Bascompte, Jordi

2009-04-01

The use of roosting sites by animal societies is important in conservation biology, animal behavior, and epidemiology. The giant noctule bat (Nyctalus lasiopterus) constitutes fission-fusion societies whose members spread every day in multiple trees for shelter. To assess how the pattern of roosting use determines the potential for information exchange or disease spreading, we applied the framework of complex networks. We found a social and spatial segregation of the population in well-defined modules or compartments, formed by groups of bats sharing the same trees. Inside each module, we revealed an asymmetric use of trees by bats representative of a nested pattern. By applying a simple epidemiological model, we show that there is a strong correlation between network structure and the rate and shape of infection dynamics. This modular structure slows down the spread of diseases and the exchange of information through the entire network. The implication for management is complex, affecting differently the cohesion inside and among colonies and the transmission of parasites and diseases. Network analysis can hence be applied to quantifying the conservation status of individual trees used by species depending on hollows for shelter.

Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks

PubMed Central

Wang, Zhijun; Mirdamadi, Reza; Wang, Qing

2016-01-01

Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building. PMID:28540284

Integration of Network Biology and Imaging to Study Cancer Phenotypes and Responses.

PubMed

Tian, Ye; Wang, Sean S; Zhang, Zhen; Rodriguez, Olga C; Petricoin, Emanuel; Shih, Ie-Ming; Chan, Daniel; Avantaggiati, Maria; Yu, Guoqiang; Ye, Shaozhen; Clarke, Robert; Wang, Chao; Zhang, Bai; Wang, Yue; Albanese, Chris

2014-01-01

Ever growing "omics" data and continuously accumulated biological knowledge provide an unprecedented opportunity to identify molecular biomarkers and their interactions that are responsible for cancer phenotypes that can be accurately defined by clinical measurements such as in vivo imaging. Since signaling or regulatory networks are dynamic and context-specific, systematic efforts to characterize such structural alterations must effectively distinguish significant network rewiring from random background fluctuations. Here we introduced a novel integration of network biology and imaging to study cancer phenotypes and responses to treatments at the molecular systems level. Specifically, Differential Dependence Network (DDN) analysis was used to detect statistically significant topological rewiring in molecular networks between two phenotypic conditions, and in vivo Magnetic Resonance Imaging (MRI) was used to more accurately define phenotypic sample groups for such differential analysis. We applied DDN to analyze two distinct phenotypic groups of breast cancer and study how genomic instability affects the molecular network topologies in high-grade ovarian cancer. Further, FDA-approved arsenic trioxide (ATO) and the ND2-SmoA1 mouse model of Medulloblastoma (MB) were used to extend our analyses of combined MRI and Reverse Phase Protein Microarray (RPMA) data to assess tumor responses to ATO and to uncover the complexity of therapeutic molecular biology.

The relationship between structure and function in locally observed complex networks

NASA Astrophysics Data System (ADS)

Comin, Cesar H.; Viana, Matheus P.; Costa, Luciano da F.

2013-01-01

Recently, studies looking at the small scale interactions taking place in complex networks have started to unveil the wealth of interactions that occur between groups of nodes. Such findings make the claim for a new systematic methodology to quantify, at node level, how dynamics are influenced (or differentiated) by the structure of the underlying system. Here we define a new measure that, based on the dynamical characteristics obtained for a large set of initial conditions, compares the dynamical behavior of the nodes present in the system. Through this measure, we find that the geographic and Barabási-Albert models have a high capacity for generating networks that exhibit groups of nodes with distinct dynamics compared to the rest of the network. The application of our methodology is illustrated with respect to two real systems. In the first we use the neuronal network of the nematode Caenorhabditis elegans to show that the interneurons of the ventral cord of the nematode present a very large dynamical differentiation when compared to the rest of the network. The second application concerns the SIS epidemic model on an airport network, where we quantify how different the distribution of infection times of high and low degree nodes can be, when compared to the expected value for the network.

Architecture of the human interactome defines protein communities and disease networks

PubMed Central

Huttlin, Edward L.; Bruckner, Raphael J.; Paulo, Joao A.; Cannon, Joe R.; Ting, Lily; Baltier, Kurt; Colby, Greg; Gebreab, Fana; Gygi, Melanie P.; Parzen, Hannah; Szpyt, John; Tam, Stanley; Zarraga, Gabriela; Pontano-Vaites, Laura; Swarup, Sharan; White, Anne E.; Schweppe, Devin K.; Rad, Ramin; Erickson, Brian K.; Obar, Robert A.; Guruharsha, K.G.; Li, Kejie; Artavanis-Tsakonas, Spyros; Gygi, Steven P.; Harper, J. Wade

2017-01-01

The physiology of a cell can be viewed as the product of thousands of proteins acting in concert to shape the cellular response. Coordination is achieved in part through networks of protein-protein interactions that assemble functionally related proteins into complexes, organelles, and signal transduction pathways. Understanding the architecture of the human proteome has the potential to inform cellular, structural, and evolutionary mechanisms and is critical to elucidation of how genome variation contributes to disease1–3. Here, we present BioPlex 2.0 (Biophysical Interactions of ORFEOME-derived complexes), which employs robust affinity purification-mass spectrometry (AP-MS) methodology4 to elucidate protein interaction networks and co-complexes nucleated by more than 25% of protein coding genes from the human genome, and constitutes the largest such network to date. With >56,000 candidate interactions, BioPlex 2.0 contains >29,000 previously unknown co-associations and provides functional insights into hundreds of poorly characterized proteins while enhancing network-based analyses of domain associations, subcellular localization, and co-complex formation. Unsupervised Markov clustering (MCL)5 of interacting proteins identified more than 1300 protein communities representing diverse cellular activities. Genes essential for cell fitness6,7 are enriched within 53 communities representing central cellular functions. Moreover, we identified 442 communities associated with more than 2000 disease annotations, placing numerous candidate disease genes into a cellular framework. BioPlex 2.0 exceeds previous experimentally derived interaction networks in depth and breadth, and will be a valuable resource for exploring the biology of incompletely characterized proteins and for elucidating larger-scale patterns of proteome organization. PMID:28514442

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

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

2012-03-01

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

Quantum Game of Life

NASA Astrophysics Data System (ADS)

Glick, Aaron; Carr, Lincoln; Calarco, Tommaso; Montangero, Simone

2014-03-01

In order to investigate the emergence of complexity in quantum systems, we present a quantum game of life, inspired by Conway's classic game of life. Through Matrix Product State (MPS) calculations, we simulate the evolution of quantum systems, dictated by a Hamiltonian that defines the rules of our quantum game. We analyze the system through a number of measures which elicit the emergence of complexity in terms of spatial organization, system dynamics, and non-local mutual information within the network. Funded by NSF

Sustainable development goals for global health: facilitating good governance in a complex environment.

PubMed

Haffeld, Just

2013-11-01

Increasing complexity is following in the wake of rampant globalization. Thus, the discussion about Sustainable Development Goals (SDGs) requires new thinking that departs from a critique of current policy tools in exploration of a complexity-friendly approach. This article argues that potential SDGs should: treat stakeholders, like states, business and civil society actors, as agents on different aggregate levels of networks; incorporate good governance processes that facilitate early involvement of relevant resources, as well as equitable participation, consultative processes, and regular policy and programme implementation reviews; anchor adoption and enforcement of such rules to democratic processes in accountable organizations; and include comprehensive systems evaluations, including procedural indicators. A global framework convention for health could be a suitable instrument for handling some of the challenges related to the governance of a complex environment. It could structure and legitimize government involvement, engage stakeholders, arrange deliberation and decision-making processes with due participation and regular policy review, and define minimum standards for health services. A monitoring scheme could ensure that agents in networks comply according to whole-systems targets, locally defined outcome indicators, and process indicators, thus resolving the paradox of government control vs. local policy space. A convention could thus exploit the energy created in the encounter between civil society, international organizations and national authorities. Copyright © 2013 Reproductive Health Matters. Published by Elsevier Ltd. All rights reserved.

Simulating Operation of a Complex Sensor Network

NASA Technical Reports Server (NTRS)

Jennings, Esther; Clare, Loren; Woo, Simon

2008-01-01

Simulation Tool for ASCTA Microsensor Network Architecture (STAMiNA) ["ASCTA" denotes the Advanced Sensors Collaborative Technology Alliance.] is a computer program for evaluating conceptual sensor networks deployed over terrain to provide military situational awareness. This or a similar program is needed because of the complexity of interactions among such diverse phenomena as sensing and communication portions of a network, deployment of sensor nodes, effects of terrain, data-fusion algorithms, and threat characteristics. STAMiNA is built upon a commercial network-simulator engine, with extensions to include both sensing and communication models in a discrete-event simulation environment. Users can define (1) a mission environment, including terrain features; (2) objects to be sensed; (3) placements and modalities of sensors, abilities of sensors to sense objects of various types, and sensor false alarm rates; (4) trajectories of threatening objects; (5) means of dissemination and fusion of data; and (6) various network configurations. By use of STAMiNA, one can simulate detection of targets through sensing, dissemination of information by various wireless communication subsystems under various scenarios, and fusion of information, incorporating such metrics as target-detection probabilities, false-alarm rates, and communication loads, and capturing effects of terrain and threat.

Robustness surfaces of complex networks

PubMed Central

Manzano, Marc; Sahneh, Faryad; Scoglio, Caterina; Calle, Eusebi; Marzo, Jose Luis

2014-01-01

Despite the robustness of complex networks has been extensively studied in the last decade, there still lacks a unifying framework able to embrace all the proposed metrics. In the literature there are two open issues related to this gap: (a) how to dimension several metrics to allow their summation and (b) how to weight each of the metrics. In this work we propose a solution for the two aforementioned problems by defining the R*-value and introducing the concept of robustness surface (Ω). The rationale of our proposal is to make use of Principal Component Analysis (PCA). We firstly adjust to 1 the initial robustness of a network. Secondly, we find the most informative robustness metric under a specific failure scenario. Then, we repeat the process for several percentage of failures and different realizations of the failure process. Lastly, we join these values to form the robustness surface, which allows the visual assessment of network robustness variability. Results show that a network presents different robustness surfaces (i.e., dissimilar shapes) depending on the failure scenario and the set of metrics. In addition, the robustness surface allows the robustness of different networks to be compared. PMID:25178402

Flow networks for Ocean currents

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Molkenthin, Nora; Marwan, Norbert; Kurths, Jürgen

2014-05-01

Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e., by its high computational complexity, we here introduce a new, discrete construction of flow-networks, which is then applied to static and dynamic velocity fields. Analyzing the flow-networks of prototypical flows we find that our approach can highlight the zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. We also apply the method to time series data of the Equatorial Pacific Ocean Current and the Gulf Stream ocean current for the changing velocity fields, which could not been done before, and analyse the properties of the dynamical system. Flow-networks can be powerful tools to theoretically understand the step from system's dynamics to network's topology that can be analyzed using network measures and is used for shading light on different climatic phenomena.

A network of networks model to study phase synchronization using structural connection matrix of human brain

NASA Astrophysics Data System (ADS)

Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.

2018-04-01

The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.

Multiscale Embedded Gene Co-expression Network Analysis

PubMed Central

Song, Won-Min; Zhang, Bin

2015-01-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma. PMID:26618778

Multiscale Embedded Gene Co-expression Network Analysis.

PubMed

Song, Won-Min; Zhang, Bin

2015-11-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma.

International migration network: Topology and modeling

NASA Astrophysics Data System (ADS)

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

International migration network: topology and modeling.

PubMed

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

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.

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.

Describing Elementary Teachers' Operative Systems: A Case Study

ERIC Educational Resources Information Center

Dotger, Sharon; McQuitty, Vicki

2014-01-01

This case study introduces the notion of an operative system to describe elementary teachers' knowledge and practice. Drawing from complex systems theory, the operative system is defined as the network of knowledge and practices that constituted teachers' work within a lesson study cycle. Data were gathered throughout a lesson study cycle in which…

Miniature EVA Software Defined Radio

NASA Technical Reports Server (NTRS)

Pozhidaev, Aleksey

2012-01-01

As NASA embarks upon developing the Next-Generation Extra Vehicular Activity (EVA) Radio for deep space exploration, the demands on EVA battery life will substantially increase. The number of modes and frequency bands required will continue to grow in order to enable efficient and complex multi-mode operations including communications, navigation, and tracking applications. Whether conducting astronaut excursions, communicating to soldiers, or first responders responding to emergency hazards, NASA has developed an innovative, affordable, miniaturized, power-efficient software defined radio that offers unprecedented power-efficient flexibility. This lightweight, programmable, S-band, multi-service, frequency- agile EVA software defined radio (SDR) supports data, telemetry, voice, and both standard and high-definition video. Features include a modular design, an easily scalable architecture, and the EVA SDR allows for both stationary and mobile battery powered handheld operations. Currently, the radio is equipped with an S-band RF section. However, its scalable architecture can accommodate multiple RF sections simultaneously to cover multiple frequency bands. The EVA SDR also supports multiple network protocols. It currently implements a Hybrid Mesh Network based on the 802.11s open standard protocol. The radio targets RF channel data rates up to 20 Mbps and can be equipped with a real-time operating system (RTOS) that can be switched off for power-aware applications. The EVA SDR's modular design permits implementation of the same hardware at all Network Nodes concept. This approach assures the portability of the same software into any radio in the system. It also brings several benefits to the entire system including reducing system maintenance, system complexity, and development cost.

Reconstruction of stochastic temporal networks through diffusive arrival times

NASA Astrophysics Data System (ADS)

Li, Xun; Li, Xiang

2017-06-01

Temporal networks have opened a new dimension in defining and quantification of complex interacting systems. Our ability to identify and reproduce time-resolved interaction patterns is, however, limited by the restricted access to empirical individual-level data. Here we propose an inverse modelling method based on first-arrival observations of the diffusion process taking place on temporal networks. We describe an efficient coordinate-ascent implementation for inferring stochastic temporal networks that builds in particular but not exclusively on the null model assumption of mutually independent interaction sequences at the dyadic level. The results of benchmark tests applied on both synthesized and empirical network data sets confirm the validity of our algorithm, showing the feasibility of statistically accurate inference of temporal networks only from moderate-sized samples of diffusion cascades. Our approach provides an effective and flexible scheme for the temporally augmented inverse problems of network reconstruction and has potential in a broad variety of applications.

Neural networks for vertical microcode compaction

NASA Astrophysics Data System (ADS)

Chu, Pong P.

1992-09-01

Neural networks provide an alternative way to solve complex optimization problems. Instead of performing a program of instructions sequentially as in a traditional computer, neural network model explores many competing hypotheses simultaneously using its massively parallel net. The paper shows how to use the neural network approach to perform vertical micro-code compaction for a micro-programmed control unit. The compaction procedure includes two basic steps. The first step determines the compatibility classes and the second step selects a minimal subset to cover the control signals. Since the selection process is an NP- complete problem, to find an optimal solution is impractical. In this study, we employ a customized neural network to obtain the minimal subset. We first formalize this problem, and then define an `energy function' and map it to a two-layer fully connected neural network. The modified network has two types of neurons and can always obtain a valid solution.

Reconstruction of stochastic temporal networks through diffusive arrival times

PubMed Central

Li, Xun; Li, Xiang

2017-01-01

Temporal networks have opened a new dimension in defining and quantification of complex interacting systems. Our ability to identify and reproduce time-resolved interaction patterns is, however, limited by the restricted access to empirical individual-level data. Here we propose an inverse modelling method based on first-arrival observations of the diffusion process taking place on temporal networks. We describe an efficient coordinate-ascent implementation for inferring stochastic temporal networks that builds in particular but not exclusively on the null model assumption of mutually independent interaction sequences at the dyadic level. The results of benchmark tests applied on both synthesized and empirical network data sets confirm the validity of our algorithm, showing the feasibility of statistically accurate inference of temporal networks only from moderate-sized samples of diffusion cascades. Our approach provides an effective and flexible scheme for the temporally augmented inverse problems of network reconstruction and has potential in a broad variety of applications. PMID:28604687

Discovering Hematopoietic Mechanisms Through Genome-Wide Analysis of GATA Factor Chromatin Occupancy

PubMed Central

Fujiwara, Tohru; O'Geen, Henriette; Keles, Sunduz; Blahnik, Kimberly; Linnemann, Amelia K.; Kang, Yoon-A; Choi, Kyunghee; Farnham, Peggy J.; Bresnick, Emery H.

2009-01-01

SUMMARY GATA factors interact with simple DNA motifs (WGATAR) to regulate critical processes, including hematopoiesis, but very few WGATAR motifs are occupied in genomes. Given the rudimentary knowledge of mechanisms underlying this restriction, and how GATA factors establish genetic networks, we used ChIP-seq to define GATA-1 and GATA-2 occupancy genome-wide in erythroid cells. Coupled with genetic complementation analysis and transcriptional profiling, these studies revealed a rich collection of targets containing a characteristic binding motif of greater complexity than WGATAR. GATA factors occupied loci encoding multiple components of the Scl/TAL1 complex, a master regulator of hematopoiesis and leukemogenic target. Mechanistic analyses provided evidence for cross-regulatory and autoregulatory interactions among components of this complex, including GATA-2 induction of the hematopoietic corepressor ETO-2 and an ETO-2 negative autoregulatory loop. These results establish fundamental principles underlying GATA factor mechanisms in chromatin and illustrate a complex network of considerable importance for the control of hematopoiesis. PMID:19941826

Complex Network Simulation of Forest Network Spatial Pattern in Pearl River Delta

NASA Astrophysics Data System (ADS)

Zeng, Y.

2017-09-01

Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network's power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network's degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network's main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc.) for networking a standard and base datum.

Tropomyosin modulates erythrocyte membrane stability

PubMed Central

An, Xiuli; Salomao, Marcela; Guo, Xinhua; Gratzer, Walter; Mohandas, Narla

2007-01-01

The ternary complex of spectrin, actin, and 4.1R (human erythrocyte protein 4.1) defines the nodes of the erythrocyte membrane skeletal network and is inseparable from membrane stability under mechanical stress. These junctions also contain tropomyosin (TM) and the other actin-binding proteins, adducin, protein 4.9, tropomodulin, and a small proportion of capZ, the functions of which are poorly defined. Here, we have examined the consequences of selective elimination of TM from the membrane. We have shown that the mechanical stability of the membranes of resealed ghosts devoid of TM is grossly, but reversibly, impaired. That the decreased membrane stability of TM-depleted membranes is the result of destabilization of the ternary complex of the network junctions is demonstrated by the strongly facilitated entry into the junctions in situ of a β-spectrin peptide, containing the actin- and 4.1R-binding sites, after extraction of the TM. The stabilizing effect of TM is highly specific, in that it is only the endogenous isotype, and not the slightly longer muscle TM that can bind to the depleted membranes and restore their mechanical stability. These findings have enabled us identify a function for TM in elevating the mechanical stability of erythrocyte membranes by stabilizing the spectrin-actin-4.1R junctional complex. PMID:17008534

An interactive graphics program for manipulation and display of panel method geometry

NASA Technical Reports Server (NTRS)

Hall, J. F.; Neuhart, D. H.; Walkley, K. B.

1983-01-01

Modern aerodynamic panel methods that handle large, complex geometries have made evident the need to interactively manipulate, modify, and view such configurations. With this purpose in mind, the GEOM program was developed. It is a menu driven, interactive program that uses the Tektronix PLOT 10 graphics software to display geometry configurations which are characterized by an abutting set of networks. These networks are composed of quadrilateral panels which are described by the coordinates of their corners. GEOM is divided into fourteen executive controlled functions. These functions are used to build configurations, scale and rotate networks, transpose networks defining M and N lines, graphically display selected networks, join and split networks, create wake networks, produce symmetric images of networks, repanel and rename networks, display configuration cross sections, and output network geometry in two formats. A data base management system is used to facilitate data transfers in this program. A sample session illustrating various capabilities of the code is included as a guide to program operation.

General analytical solutions for DC/AC circuit-network analysis

NASA Astrophysics Data System (ADS)

Rubido, Nicolás; Grebogi, Celso; Baptista, Murilo S.

2017-06-01

In this work, we present novel general analytical solutions for the currents that are developed in the edges of network-like circuits when some nodes of the network act as sources/sinks of DC or AC current. We assume that Ohm's law is valid at every edge and that charge at every node is conserved (with the exception of the source/sink nodes). The resistive, capacitive, and/or inductive properties of the lines in the circuit define a complex network structure with given impedances for each edge. Our solution for the currents at each edge is derived in terms of the eigenvalues and eigenvectors of the Laplacian matrix of the network defined from the impedances. This derivation also allows us to compute the equivalent impedance between any two nodes of the circuit and relate it to currents in a closed circuit which has a single voltage generator instead of many input/output source/sink nodes. This simplifies the treatment that could be done via Thévenin's theorem. Contrary to solving Kirchhoff's equations, our derivation allows to easily calculate the redistribution of currents that occurs when the location of sources and sinks changes within the network. Finally, we show that our solutions are identical to the ones found from Circuit Theory nodal analysis.

Random walks with long-range steps generated by functions of Laplacian matrices

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Michelitsch, T. M.; Collet, B. A.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

2018-04-01

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information in the Laplacian matrix, that describes the connections of a network, to a dynamic determined by functions of this matrix. The resulting processes are non-local allowing transitions of the random walker from one node to nodes beyond its nearest neighbors. We find that only two types of Laplacian functions are admissible with distinct behaviors for long-range steps in the infinite network limit: type (i) functions generate Brownian motions, type (ii) functions Lévy flights. For this asymptotic long-range step behavior only the lowest non-vanishing order of the Laplacian function is relevant, namely first order for type (i), and fractional order for type (ii) functions. In the first part, we discuss spectral properties of the Laplacian matrix and a series of relations that are maintained by a particular type of functions that allow to define random walks on any type of undirected connected networks. Once described general properties, we explore characteristics of random walk strategies that emerge from particular cases with functions defined in terms of exponentials, logarithms and powers of the Laplacian as well as relations of these dynamics with non-local strategies like Lévy flights and fractional transport. Finally, we analyze the global capacity of these random walk strategies to explore networks like lattices and trees and different types of random and complex networks.

Analysis of diverse regulatory networks in a hierarchical context shows consistent tendencies for collaboration in the middle levels

PubMed Central

Bhardwaj, Nitin; Yan, Koon-Kiu; Gerstein, Mark B.

2010-01-01

Gene regulatory networks have been shown to share some common aspects with commonplace social governance structures. Thus, we can get some intuition into their organization by arranging them into well-known hierarchical layouts. These hierarchies, in turn, can be placed between the extremes of autocracies, with well-defined levels and clear chains of command, and democracies, without such defined levels and with more co-regulatory partnerships between regulators. In general, the presence of partnerships decreases the variation in information flow amongst nodes within a level, more evenly distributing stress. Here we study various regulatory networks (transcriptional, modification, and phosphorylation) for five diverse species, Escherichia coli to human. We specify three levels of regulators—top, middle, and bottom—which collectively govern the non-regulator targets lying in the lowest fourth level. We define quantities for nodes, levels, and entire networks that measure their degree of collaboration and autocratic vs. democratic character. We show individual regulators have a range of partnership tendencies: Some regulate their targets in combination with other regulators in local instantiations of democratic structure, whereas others regulate mostly in isolation, in more autocratic fashion. Overall, we show that in all networks studied the middle level has the highest collaborative propensity and coregulatory partnerships occur most frequently amongst midlevel regulators, an observation that has parallels in corporate settings where middle managers must interact most to ensure organizational effectiveness. There is, however, one notable difference between networks in different species: The amount of collaborative regulation and democratic character increases markedly with overall genomic complexity. PMID:20351254

[Creation of expert centers on endometriosis].

PubMed

Daraï, Emile; Bendifallah, Sofiane; Chabbert-Buffet, Nathalie; Golfier, François

2017-12-01

Endometriosis is a frequent pathology with a high incidence of deep infiltrating endometriosis and complex forms that can affect 20% of patients with endometriosis. The incidence of infertility associated with endometriosis can reach 50%. The complexity of care requires the creation of expert centers working in networks with general practitioners. Criteria for defining these expert centers are being drawn up, based on structural criteria (multidisciplinary consultation meeting), links with medical assistance structures for procreation and activity criteria for severe and complex forms (number of interventions per center and per surgeon). Copyright © 2017. Published by Elsevier Masson SAS.

An Ontology for Modeling Complex Inter-relational Organizations

NASA Astrophysics Data System (ADS)

Wautelet, Yves; Neysen, Nicolas; Kolp, Manuel

This paper presents an ontology for organizational modeling through multiple complementary aspects. The primary goal of the ontology is to dispose of an adequate set of related concepts for studying complex organizations involved in a lot of relationships at the same time. In this paper, we define complex organizations as networked organizations involved in a market eco-system that are playing several roles simultaneously. In such a context, traditional approaches focus on the macro analytic level of transactions; this is supplemented here with a micro analytic study of the actors' rationale. At first, the paper overviews enterprise ontologies literature to position our proposal and exposes its contributions and limitations. The ontology is then brought to an advanced level of formalization: a meta-model in the form of a UML class diagram allows to overview the ontology concepts and their relationships which are formally defined. Finally, the paper presents the case study on which the ontology has been validated.

Rule-based modeling and simulations of the inner kinetochore structure.

PubMed

Tschernyschkow, Sergej; Herda, Sabine; Gruenert, Gerd; Döring, Volker; Görlich, Dennis; Hofmeister, Antje; Hoischen, Christian; Dittrich, Peter; Diekmann, Stephan; Ibrahim, Bashar

2013-09-01

Combinatorial complexity is a central problem when modeling biochemical reaction networks, since the association of a few components can give rise to a large variation of protein complexes. Available classical modeling approaches are often insufficient for the analysis of very large and complex networks in detail. Recently, we developed a new rule-based modeling approach that facilitates the analysis of spatial and combinatorially complex problems. Here, we explore for the first time how this approach can be applied to a specific biological system, the human kinetochore, which is a multi-protein complex involving over 100 proteins. Applying our freely available SRSim software to a large data set on kinetochore proteins in human cells, we construct a spatial rule-based simulation model of the human inner kinetochore. The model generates an estimation of the probability distribution of the inner kinetochore 3D architecture and we show how to analyze this distribution using information theory. In our model, the formation of a bridge between CenpA and an H3 containing nucleosome only occurs efficiently for higher protein concentration realized during S-phase but may be not in G1. Above a certain nucleosome distance the protein bridge barely formed pointing towards the importance of chromatin structure for kinetochore complex formation. We define a metric for the distance between structures that allow us to identify structural clusters. Using this modeling technique, we explore different hypothetical chromatin layouts. Applying a rule-based network analysis to the spatial kinetochore complex geometry allowed us to integrate experimental data on kinetochore proteins, suggesting a 3D model of the human inner kinetochore architecture that is governed by a combinatorial algebraic reaction network. This reaction network can serve as bridge between multiple scales of modeling. Our approach can be applied to other systems beyond kinetochores. Copyright © 2013 Elsevier Ltd. All rights reserved.

Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks

NASA Astrophysics Data System (ADS)

Gong, Xinwei

This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing complexity values for networks in the ordered and critical phases and for highly disordered networks, peaking somewhere in the disordered phase. Individual nodes with high complexity have, on average, a larger influence on the system dynamics. Lastly, a semi-annealed approximation that preserves the correlation between states at neighboring nodes is introduced to study a social game-inspired network model in which all links are bidirectional and all nodes have a self-input. The technique developed here is shown to yield accurate predictions of distribution of players' states, and accounts for some nontrivial collective behavior of game theoretic interest.

Network of likes and dislikes: Conflict and membership

NASA Astrophysics Data System (ADS)

Park, Hye Jin; Yi, Su Do; Kim, Dae Joong; Kim, Beom Jun

2016-11-01

We all have friends and foes. In the study of complex networks, such a pairwise interaction is described by a directed link since the relation is not necessarily symmetric. We study a real network constructed from a survey in which each individual chooses five members (s)he wants to work with, and other five (s)he does not like to work together. Although everyone's outdegrees for such like and dislike links are fixed to five, respectively, it is found that indegree sequence for each type of links exhibits very different behaviors. We also pursue to answer the question of proper divisions of the organization based on the concept of happiness defined for each directed relation. For example, two individuals connected by like (dislike) links in both directions are happy if they belong to the same (different) group(s). We then adopt the framework of the q-state Potts model with long-ranged ferromagnetic and antiferromagnetic interactions and discuss the group structure in the organization that minimizes a suitably defined unhappiness.

Empirical study on human acupuncture point network

NASA Astrophysics Data System (ADS)

Li, Jian; Shen, Dan; Chang, Hui; He, Da-Ren

2007-03-01

Chinese medical theory is ancient and profound, however is confined by qualitative and faint understanding. The effect of Chinese acupuncture in clinical practice is unique and effective, and the human acupuncture points play a mysterious and special role, however there is no modern scientific understanding on human acupuncture points until today. For this reason, we attend to use complex network theory, one of the frontiers in the statistical physics, for describing the human acupuncture points and their connections. In the network nodes are defined as the acupuncture points, two nodes are connected by an edge when they are used for a medical treatment of a common disease. A disease is defined as an act. Some statistical properties have been obtained. The results certify that the degree distribution, act degree distribution, and the dependence of the clustering coefficient on both of them obey SPL distribution function, which show a function interpolating between a power law and an exponential decay. The results may be helpful for understanding Chinese medical theory.

Limitations and tradeoffs in synchronization of large-scale networks with uncertain links

PubMed Central

Diwadkar, Amit; Vaidya, Umesh

2016-01-01

The synchronization of nonlinear systems connected over large-scale networks has gained popularity in a variety of applications, such as power grids, sensor networks, and biology. Stochastic uncertainty in the interconnections is a ubiquitous phenomenon observed in these physical and biological networks. We provide a size-independent network sufficient condition for the synchronization of scalar nonlinear systems with stochastic linear interactions over large-scale networks. This sufficient condition, expressed in terms of nonlinear dynamics, the Laplacian eigenvalues of the nominal interconnections, and the variance and location of the stochastic uncertainty, allows us to define a synchronization margin. We provide an analytical characterization of important trade-offs between the internal nonlinear dynamics, network topology, and uncertainty in synchronization. For nearest neighbour networks, the existence of an optimal number of neighbours with a maximum synchronization margin is demonstrated. An analytical formula for the optimal gain that produces the maximum synchronization margin allows us to compare the synchronization properties of various complex network topologies. PMID:27067994

Energy Landscape of Social Balance

NASA Astrophysics Data System (ADS)

Marvel, Seth A.; Strogatz, Steven H.; Kleinberg, Jon M.

2009-11-01

We model a close-knit community of friends and enemies as a fully connected network with positive and negative signs on its edges. Theories from social psychology suggest that certain sign patterns are more stable than others. This notion of social “balance” allows us to define an energy landscape for such networks. Its structure is complex: numerical experiments reveal a landscape dimpled with local minima of widely varying energy levels. We derive rigorous bounds on the energies of these local minima and prove that they have a modular structure that can be used to classify them.

Energy landscape of social balance.

PubMed

Marvel, Seth A; Strogatz, Steven H; Kleinberg, Jon M

2009-11-06

We model a close-knit community of friends and enemies as a fully connected network with positive and negative signs on its edges. Theories from social psychology suggest that certain sign patterns are more stable than others. This notion of social "balance" allows us to define an energy landscape for such networks. Its structure is complex: numerical experiments reveal a landscape dimpled with local minima of widely varying energy levels. We derive rigorous bounds on the energies of these local minima and prove that they have a modular structure that can be used to classify them.

Yeast Phenomics: An Experimental Approach for Modeling Gene Interaction Networks that Buffer Disease

PubMed Central

Hartman, John L.; Stisher, Chandler; Outlaw, Darryl A.; Guo, Jingyu; Shah, Najaf A.; Tian, Dehua; Santos, Sean M.; Rodgers, John W.; White, Richard A.

2015-01-01

The genome project increased appreciation of genetic complexity underlying disease phenotypes: many genes contribute each phenotype and each gene contributes multiple phenotypes. The aspiration of predicting common disease in individuals has evolved from seeking primary loci to marginal risk assignments based on many genes. Genetic interaction, defined as contributions to a phenotype that are dependent upon particular digenic allele combinations, could improve prediction of phenotype from complex genotype, but it is difficult to study in human populations. High throughput, systematic analysis of S. cerevisiae gene knockouts or knockdowns in the context of disease-relevant phenotypic perturbations provides a tractable experimental approach to derive gene interaction networks, in order to deduce by cross-species gene homology how phenotype is buffered against disease-risk genotypes. Yeast gene interaction network analysis to date has revealed biology more complex than previously imagined. This has motivated the development of more powerful yeast cell array phenotyping methods to globally model the role of gene interaction networks in modulating phenotypes (which we call yeast phenomic analysis). The article illustrates yeast phenomic technology, which is applied here to quantify gene X media interaction at higher resolution and supports use of a human-like media for future applications of yeast phenomics for modeling human disease. PMID:25668739

A complex network approach for nanoparticle agglomeration analysis in nanoscale images

NASA Astrophysics Data System (ADS)

Machado, Bruno Brandoli; Scabini, Leonardo Felipe; Margarido Orue, Jonatan Patrick; de Arruda, Mauro Santos; Goncalves, Diogo Nunes; Goncalves, Wesley Nunes; Moreira, Raphaell; Rodrigues-Jr, Jose F.

2017-02-01

Complex networks have been widely used in science and technology because of their ability to represent several systems. One of these systems is found in Biochemistry, in which the synthesis of new nanoparticles is a hot topic. However, the interpretation of experimental results in the search of new nanoparticles poses several challenges. This is due to the characteristics of nanoparticle images and due to their multiple intricate properties; one property of recurrent interest is the agglomeration of particles. Addressing this issue, this paper introduces an approach that uses complex networks to detect and describe nanoparticle agglomerates so to foster easier and more insightful analyses. In this approach, each detected particle in an image corresponds to a vertice and the distances between the particles define a criterion for creating edges. Edges are created if the distance is smaller than a radius of interest. Once this network is set, we calculate several discrete measures able to reveal the most outstanding agglomerates in a nanoparticle image. Experimental results using images of scanning tunneling microscopy (STM) of gold nanoparticles demonstrated the effectiveness of the proposed approach over several samples, as reflected by the separability between particles in three usual settings. The results also demonstrated efficacy for both convex and non-convex agglomerates.

Space Mobile Network: A Near Earth Communications and Navigation Architecture

NASA Technical Reports Server (NTRS)

Israel, David J.; Heckler, Gregory W.; Menrad, Robert J.

2016-01-01

This paper shares key findings of NASA's Earth Regime Network Evolution Study (ERNESt) team resulting from its 18-month effort to define a wholly new architecture-level paradigm for the exploitation of space by civil space and commercial sector organizations. Since the launch of Sputnik in October 1957 spaceflight missions have remained highly scripted activities from launch through disposal. The utilization of computer technology has enabled dramatic increases in mission complexity; but, the underlying premise that the diverse actions necessary to meet mission goals requires minute-by-minute scripting, defined weeks in advance of execution, for the life of the mission has remained. This archetype was appropriate for a "new frontier" but now risks overtly constraining the potential market-based opportunities for the innovation considered necessary to efficiently address the complexities associated with meeting communications and navigation requirements projected to be characteristics of the next era of space exploration: a growing number of missions in simultaneous execution, increased variance of mission types and growth in location/orbital regime diversity. The resulting ERNESt architectural cornerstone - the Space Mobile Network (SMN) - was envisioned as critical to creating an environment essential to meeting these future challenges in political, programmatic, technological and budgetary terms. The SMN incorporates technologies such as: Disruption Tolerant Networking (DTN) and optical communications, as well as new operations concepts such as User Initiated Services (UIS) to provide user services analogous to today's terrestrial mobile network user. Results developed in collaboration with NASA's Space Communications and Navigation (SCaN) Division and field centers are reported on. Findings have been validated via briefings to external focus groups and initial ground-based demonstrations. The SMN opens new niches for exploitation by the marketplace of mission planners and service providers.

WINDENG - a new network in Europe

NASA Astrophysics Data System (ADS)

Sempreviva, A. M.; Barthelmie, R.; Landberg, L.; Heinemann, D.; Strack, M.; Christensen, L.; Stefanatos, N.; Svenson, J.; Lavagnini, A.; Tammelin, B.

2003-04-01

A European training-through-research network is underway in which wind conditions relevant to wind turbine and wind farm design for the implementation of the wind energy in Europe are being studied. The network is based on:- - The success of a previous network within the EU Human Capital and Mobility programme in establishing links among European institutes through the co-operative effort of young scientists working in countries other than their own. - The need to foster the necessary exchange of experiences and personal contacts in order to produce a fruitful collaboration for the academic and research institutions and private companies involved. The aim of the network is to bring together young and experienced researchers to work jointly to define the basis for the design of wind turbines and wind fans in different environments. The goals are:- - To define reliable values for turbulence descriptors to be used in modelling the turbulent wind fields, spectra, coherence in homogeneous and complex terrain and offshore, to offer guidelines for wind turbine design. - To improve existing methods used for modelling wind climates under the different situations existing within Europe to offer reliable tools for wind farm designers in complex terrain and offshore. - To address all European climates from the cold Baltic and nearby North Sea to warmer Mediterranean regions. - To supply knowledge of use to EU energy policies, to local authorities or national and international energy agencies and authorities. Furthermore it will offer guidelines for the best turbine design and best sitting procedures for isolated generators or turbine parks. The project got underway in September 2002 and the first positions for young researchers are expected to begin in early 2003. This poster will present the first scientific and practical results.

Geometry of complex networks and topological centrality

NASA Astrophysics Data System (ADS)

Ranjan, Gyan; Zhang, Zhi-Li

2013-09-01

We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L). The squared distance of a node i to the origin in this n-dimensional space (lii+), yields a topological centrality index, defined as C∗(i)=1/lii+. In turn, the sum of reciprocals of individual node centralities, ∑i1/C∗(i)=∑ilii+, or the trace of L, yields the well-known Kirchhoff index (K), an overall structural descriptor for the network. To put into context this geometric definition of centrality, we provide alternative interpretations of the proposed indices that connect them to meaningful topological characteristics - first, as forced detour overheads and frequency of recurrences in random walks that has an interesting analogy to voltage distributions in the equivalent electrical network; and then as the average connectedness of i in all the bi-partitions of the graph. These interpretations respectively help establish the topological centrality (C∗(i)) of node i as a measure of its overall position as well as its overall connectedness in the network; thus reflecting the robustness of i to random multiple edge failures. Through empirical evaluations using synthetic and real world networks, we demonstrate how the topological centrality is better able to distinguish nodes in terms of their structural roles in the network and, along with Kirchhoff index, is appropriately sensitive to perturbations/re-wirings in the network.

The Cancer Cell Map Initiative: Defining the Hallmark Networks of Cancer

PubMed Central

Krogan, Nevan J.; Lippman, Scott; Agard, David A.; Ashworth, Alan; Ideker, Trey

2017-01-01

Progress in DNA sequencing has revealed the startling complexity of cancer genomes, which typically carry thousands of somatic mutations. However, it remains unclear which are the key driver mutations or dependencies in a given cancer and how these influence pathogenesis and response to therapy. Although tumors of similar types and clinical outcomes can have patterns of mutations that are strikingly different, it is becoming apparent that these mutations recurrently hijack the same hallmark molecular pathways and networks. For this reason, it is likely that successful interpretation of cancer genomes will require comprehensive knowledge of the molecular networks under selective pressure in oncogenesis. Here we announce the creation of a new effort, called The Cancer Cell Map Initiative (CCMI), aimed at systematically detailing these complex interactions among cancer genes and how they differ between diseased and healthy states. We discuss recent progress that enables creation of these Cancer Cell Maps across a range of tumor types and how they can be used to target networks disrupted in individual patients, significantly accelerating the development of precision medicine. PMID:26000852

The cancer cell map initiative: defining the hallmark networks of cancer.

PubMed

Krogan, Nevan J; Lippman, Scott; Agard, David A; Ashworth, Alan; Ideker, Trey

2015-05-21

Progress in DNA sequencing has revealed the startling complexity of cancer genomes, which typically carry thousands of somatic mutations. However, it remains unclear which are the key driver mutations or dependencies in a given cancer and how these influence pathogenesis and response to therapy. Although tumors of similar types and clinical outcomes can have patterns of mutations that are strikingly different, it is becoming apparent that these mutations recurrently hijack the same hallmark molecular pathways and networks. For this reason, it is likely that successful interpretation of cancer genomes will require comprehensive knowledge of the molecular networks under selective pressure in oncogenesis. Here we announce the creation of a new effort, The Cancer Cell Map Initiative (CCMI), aimed at systematically detailing these complex interactions among cancer genes and how they differ between diseased and healthy states. We discuss recent progress that enables creation of these cancer cell maps across a range of tumor types and how they can be used to target networks disrupted in individual patients, significantly accelerating the development of precision medicine. Copyright © 2015 Elsevier Inc. All rights reserved.

Modularity and the spread of perturbations in complex dynamical systems

NASA Astrophysics Data System (ADS)

Kolchinsky, Artemy; Gates, Alexander J.; Rocha, Luis M.

2015-12-01

We propose a method to decompose dynamical systems based on the idea that modules constrain the spread of perturbations. We find partitions of system variables that maximize "perturbation modularity," defined as the autocovariance of coarse-grained perturbed trajectories. The measure effectively separates the fast intramodular from the slow intermodular dynamics of perturbation spreading (in this respect, it is a generalization of the "Markov stability" method of network community detection). Our approach captures variation of modular organization across different system states, time scales, and in response to different kinds of perturbations: aspects of modularity which are all relevant to real-world dynamical systems. It offers a principled alternative to detecting communities in networks of statistical dependencies between system variables (e.g., "relevance networks" or "functional networks"). Using coupled logistic maps, we demonstrate that the method uncovers hierarchical modular organization planted in a system's coupling matrix. Additionally, in homogeneously coupled map lattices, it identifies the presence of self-organized modularity that depends on the initial state, dynamical parameters, and type of perturbations. Our approach offers a powerful tool for exploring the modular organization of complex dynamical systems.

Quick fuzzy backpropagation algorithm.

PubMed

Nikov, A; Stoeva, S

2001-03-01

A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) single output neural networks in case of training patterns with different targets; and (2) multiple output neural networks in case of training patterns with equivalued target vector. They support the automation of the weights training process (quasi-unsupervised learning) establishing the target value(s) depending on the network's input values. In these cases the simulation results confirm the convergence of both algorithms. An example with a large-sized neural network illustrates the significantly greater training speed of the QuickFBP rather than the FBP algorithm. The adaptation of an interactive web system to users on the basis of the QuickFBP algorithm is presented. Since the QuickFBP algorithm ensures quasi-unsupervised learning, this implies its broad applicability in areas of adaptive and adaptable interactive systems, data mining, etc. applications.

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.

Modularity and the spread of perturbations in complex dynamical systems.

PubMed

Kolchinsky, Artemy; Gates, Alexander J; Rocha, Luis M

2015-12-01

We propose a method to decompose dynamical systems based on the idea that modules constrain the spread of perturbations. We find partitions of system variables that maximize "perturbation modularity," defined as the autocovariance of coarse-grained perturbed trajectories. The measure effectively separates the fast intramodular from the slow intermodular dynamics of perturbation spreading (in this respect, it is a generalization of the "Markov stability" method of network community detection). Our approach captures variation of modular organization across different system states, time scales, and in response to different kinds of perturbations: aspects of modularity which are all relevant to real-world dynamical systems. It offers a principled alternative to detecting communities in networks of statistical dependencies between system variables (e.g., "relevance networks" or "functional networks"). Using coupled logistic maps, we demonstrate that the method uncovers hierarchical modular organization planted in a system's coupling matrix. Additionally, in homogeneously coupled map lattices, it identifies the presence of self-organized modularity that depends on the initial state, dynamical parameters, and type of perturbations. Our approach offers a powerful tool for exploring the modular organization of complex dynamical systems.

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

Morphological inversion of complex diffusion

NASA Astrophysics Data System (ADS)

Nguyen, V. A. T.; Vural, D. C.

2017-09-01

Epidemics, neural cascades, power failures, and many other phenomena can be described by a diffusion process on a network. To identify the causal origins of a spread, it is often necessary to identify the triggering initial node. Here, we define a new morphological operator and use it to detect the origin of a diffusive front, given the final state of a complex network. Our method performs better than algorithms based on distance (closeness) and Jordan centrality. More importantly, our method is applicable regardless of the specifics of the forward model, and therefore can be applied to a wide range of systems such as identifying the patient zero in an epidemic, pinpointing the neuron that triggers a cascade, identifying the original malfunction that causes a catastrophic infrastructure failure, and inferring the ancestral species from which a heterogeneous population evolves.

Towards a unified theory of health-disease: II. Holopathogenesis

PubMed Central

Almeida-Filho, Naomar

2014-01-01

This article presents a systematic framework for modeling several classes of illness-sickness-disease named as Holopathogenesis. Holopathogenesis is defined as processes of over-determination of diseases and related conditions taken as a whole, comprising selected facets of the complex object Health. First, a conceptual background of Holopathogenesis is presented as a series of significant interfaces (biomolecular-immunological, physiopathological-clinical, epidemiological-ecosocial). Second, propositions derived from Holopathogenesis are introduced in order to allow drawing the disease-illness-sickness complex as a hierarchical network of networks. Third, a formalization of intra- and inter-level correspondences, over-determination processes, effects and links of Holopathogenesis models is proposed. Finally, the Holopathogenesis frame is evaluated as a comprehensive theoretical pathology taken as a preliminary step towards a unified theory of health-disease. PMID:24897040

"Time-dependent flow-networks"

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Molkentin, Nora; Lopez, Cristobal; Hernandez-Garcia, Emilio; Marwan, Norbert; Kurths, Jürgen

2015-04-01

Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply information or heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e. high computational complexity and fixed variety of the flows in the underlying system, we introduce a new, method of flow-networks for changing in time velocity fields including external forcing in the system, noise and temperature-decay. Method of the flow-network construction can be divided into several steps: first we obtain the linear recursive equation for the temperature time-series. Then we compute the correlation matrix for time-series averaging the tensor product over all realizations of the noise, which we interpret as a weighted adjacency matrix of the flow-network and analyze using network measures. We apply the method to different types of moving flows with geographical relevance such as meandering flow. Analyzing the flow-networks using network measures we find that our approach can highlight zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. Flow-networks can be powerful tool to understand the connection between system's dynamics and network's topology analyzed using network measures in order to shed light on different climatic phenomena.

Software Defined Network Monitoring Scheme Using Spectral Graph Theory and Phantom Nodes

DTIC Science & Technology

2014-09-01

networks is the emergence of software - defined networking ( SDN ) [1]. SDN has existed for the...Chapter III for network monitoring. A. SOFTWARE DEFINED NETWORKS SDNs provide a new and innovative method to simplify network hardware by logically...and R. Giladi, “Performance analysis of software - defined networking ( SDN ),” in Proc. of IEEE 21st International Symposium on Modeling, Analysis

Stochastic Blockmodeling of the Modules and Core of the Caenorhabditis elegans Connectome

PubMed Central

Pavlovic, Dragana M.; Vértes, Petra E.; Bullmore, Edward T.; Schafer, William R.; Nichols, Thomas E.

2014-01-01

Recently, there has been much interest in the community structure or mesoscale organization of complex networks. This structure is characterised either as a set of sparsely inter-connected modules or as a highly connected core with a sparsely connected periphery. However, it is often difficult to disambiguate these two types of mesoscale structure or, indeed, to summarise the full network in terms of the relationships between its mesoscale constituents. Here, we estimate a community structure with a stochastic blockmodel approach, the Erdős-Rényi Mixture Model, and compare it to the much more widely used deterministic methods, such as the Louvain and Spectral algorithms. We used the Caenorhabditis elegans (C. elegans) nervous system (connectome) as a model system in which biological knowledge about each node or neuron can be used to validate the functional relevance of the communities obtained. The deterministic algorithms derived communities with 4–5 modules, defined by sparse inter-connectivity between all modules. In contrast, the stochastic Erdős-Rényi Mixture Model estimated a community with 9 blocks or groups which comprised a similar set of modules but also included a clearly defined core, made of 2 small groups. We show that the “core-in-modules” decomposition of the worm brain network, estimated by the Erdős-Rényi Mixture Model, is more compatible with prior biological knowledge about the C. elegans nervous system than the purely modular decomposition defined deterministically. We also show that the blockmodel can be used both to generate stochastic realisations (simulations) of the biological connectome, and to compress network into a small number of super-nodes and their connectivity. We expect that the Erdős-Rényi Mixture Model may be useful for investigating the complex community structures in other (nervous) systems. PMID:24988196

Subnetworks of percolation backbones to model karst systems around Tulum, Mexico

NASA Astrophysics Data System (ADS)

Hendrick, Martin; Renard, Philippe

2016-11-01

Karstic caves, which play a key role in groundwater transport, are often organized as complex connected networks resulting from the dissolution of carbonate rocks. In this work, we propose a new model to describe and study the structures of the two largest submersed karst networks in the world. Both of these networks are located in the area of Tulum (Quintana Roo, Mexico). In a previous work te{hendrick2016fractal} we showed that these networks behave as self-similar structures exhibiting well-defined scaling behaviours. In this paper, we suggest that these networks can be modeled using substructures of percolation clusters (θ-subnetworks) having similar structural behaviour (in terms of fractal dimension and conductivity exponent) to those observed in Tulum's karst networks. We show in addition that these θ-subnetworks correspond to structures that minimise a global function, where this global function includes energy dissipation by the viscous forces when water flows through the network, and the cost of network formation itself.

Toward Optimal Transport Networks

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.

2008-01-01

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Prioritisation of associations between protein domains and complex diseases using domain-domain interaction networks.

PubMed

Wang, W; Zhang, W; Jiang, R; Luan, Y

2010-05-01

It is of vital importance to find genetic variants that underlie human complex diseases and locate genes that are responsible for these diseases. Since proteins are typically composed of several structural domains, it is reasonable to assume that harmful genetic variants may alter structures of protein domains, affect functions of proteins and eventually cause disorders. With this understanding, the authors explore the possibility of recovering associations between protein domains and complex diseases. The authors define associations between protein domains and disease families on the basis of associations between non-synonymous single nucleotide polymorphisms (nsSNPs) and complex diseases, similarities between diseases, and relations between proteins and domains. Based on a domain-domain interaction network, the authors propose a 'guilt-by-proximity' principle to rank candidate domains according to their average distance to a set of seed domains in the domain-domain interaction network. The authors validate the method through large-scale cross-validation experiments on simulated linkage intervals, random controls and the whole genome. Results show that areas under receiver operating characteristic curves (AUC scores) can be as high as 77.90%, and the mean rank ratios can be as low as 21.82%. The authors further offer a freely accessible web interface for a genome-wide landscape of associations between domains and disease families.

The AGING Initiative experience: a call for sustained support for team science networks.

PubMed

Garg, Tullika; Anzuoni, Kathryn; Landyn, Valentina; Hajduk, Alexandra; Waring, Stephen; Hanson, Leah R; Whitson, Heather E

2018-05-18

Team science, defined as collaborative research efforts that leverage the expertise of diverse disciplines, is recognised as a critical means to address complex healthcare challenges, but the practical implementation of team science can be difficult. Our objective is to describe the barriers, solutions and lessons learned from our team science experience as applied to the complex and growing challenge of multiple chronic conditions (MCC). MCC is the presence of two or more chronic conditions that have a collective adverse effect on health status, function or quality of life, and that require complex healthcare management, decision-making or coordination. Due to the increasing impact on the United States society, MCC research has been identified as a high priority research area by multiple federal agencies. In response to this need, two national research entities, the Healthcare Systems Research Network (HCSRN) and the Claude D. Pepper Older Americans Independence Centers (OAIC), formed the Advancing Geriatrics Infrastructure and Network Growth (AGING) Initiative to build nationwide capacity for MCC team science. This article describes the structure, lessons learned and initial outcomes of the AGING Initiative. We call for funding mechanisms to sustain infrastructures that have demonstrated success in fostering team science and innovation in translating findings to policy change necessary to solve complex problems in healthcare.

Bayesian networks in overlay recipe optimization

NASA Astrophysics Data System (ADS)

Binns, Lewis A.; Reynolds, Greg; Rigden, Timothy C.; Watkins, Stephen; Soroka, Andrew

2005-05-01

Currently, overlay measurements are characterized by "recipe", which defines both physical parameters such as focus, illumination et cetera, and also the software parameters such as algorithm to be used and regions of interest. Setting up these recipes requires both engineering time and wafer availability on an overlay tool, so reducing these requirements will result in higher tool productivity. One of the significant challenges to automating this process is that the parameters are highly and complexly correlated. At the same time, a high level of traceability and transparency is required in the recipe creation process, so a technique that maintains its decisions in terms of well defined physical parameters is desirable. Running time should be short, given the system (automatic recipe creation) is being implemented to reduce overheads. Finally, a failure of the system to determine acceptable parameters should be obvious, so a certainty metric is also desirable. The complex, nonlinear interactions make solution by an expert system difficult at best, especially in the verification of the resulting decision network. The transparency requirements tend to preclude classical neural networks and similar techniques. Genetic algorithms and other "global minimization" techniques require too much computational power (given system footprint and cost requirements). A Bayesian network, however, provides a solution to these requirements. Such a network, with appropriate priors, can be used during recipe creation / optimization not just to select a good set of parameters, but also to guide the direction of search, by evaluating the network state while only incomplete information is available. As a Bayesian network maintains an estimate of the probability distribution of nodal values, a maximum-entropy approach can be utilized to obtain a working recipe in a minimum or near-minimum number of steps. In this paper we discuss the potential use of a Bayesian network in such a capacity, reducing the amount of engineering intervention. We discuss the benefits of this approach, especially improved repeatability and traceability of the learning process, and quantification of uncertainty in decisions made. We also consider the problems associated with this approach, especially in detailed construction of network topology, validation of the Bayesian network and the recipes it generates, and issues arising from the integration of a Bayesian network with a complex multithreaded application; these primarily relate to maintaining Bayesian network and system architecture integrity.

Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs

NASA Astrophysics Data System (ADS)

Dorn, Britta; Hüffner, Falk; Krüger, Dominikus; Niedermeier, Rolf; Uhlmann, Johannes

We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions. This problem has applications in communication networks and in understanding protein interaction based cell regulation mechanisms. Since this problem is NP-hard, research so far concentrated on polynomial-time approximation algorithms and tractable special cases. We take the viewpoint of parameterized algorithmics and examine several parameters related to the maximum signal flow over vertices or edges. We provide several fixed-parameter tractability results, and in one case a sharp complexity dichotomy between a linear-time solvable case and a slightly more general NP-hard case. We examine the value of these parameters for several real-world network instances. For many relevant cases, the NP-hard problem can be solved to optimality. In this way, parameterized analysis yields both deeper insight into the computational complexity and practical solving strategies.

Hepatitis C Virus Proteins Interact with the Endosomal Sorting Complex Required for Transport (ESCRT) Machinery via Ubiquitination To Facilitate Viral Envelopment.

PubMed

Barouch-Bentov, Rina; Neveu, Gregory; Xiao, Fei; Beer, Melanie; Bekerman, Elena; Schor, Stanford; Campbell, Joseph; Boonyaratanakornkit, Jim; Lindenbach, Brett; Lu, Albert; Jacob, Yves; Einav, Shirit

2016-11-01

Enveloped viruses commonly utilize late-domain motifs, sometimes cooperatively with ubiquitin, to hijack the endosomal sorting complex required for transport (ESCRT) machinery for budding at the plasma membrane. However, the mechanisms underlying budding of viruses lacking defined late-domain motifs and budding into intracellular compartments are poorly characterized. Here, we map a network of hepatitis C virus (HCV) protein interactions with the ESCRT machinery using a mammalian-cell-based protein interaction screen and reveal nine novel interactions. We identify HRS (hepatocyte growth factor-regulated tyrosine kinase substrate), an ESCRT-0 complex component, as an important entry point for HCV into the ESCRT pathway and validate its interactions with the HCV nonstructural (NS) proteins NS2 and NS5A in HCV-infected cells. Infectivity assays indicate that HRS is an important factor for efficient HCV assembly. Specifically, by integrating capsid oligomerization assays, biophysical analysis of intracellular viral particles by continuous gradient centrifugations, proteolytic digestion protection, and RNase digestion protection assays, we show that HCV co-opts HRS to mediate a late assembly step, namely, envelopment. In the absence of defined late-domain motifs, K63-linked polyubiquitinated lysine residues in the HCV NS2 protein bind the HRS ubiquitin-interacting motif to facilitate assembly. Finally, ESCRT-III and VPS/VTA1 components are also recruited by HCV proteins to mediate assembly. These data uncover involvement of ESCRT proteins in intracellular budding of a virus lacking defined late-domain motifs and a novel mechanism by which HCV gains entry into the ESCRT network, with potential implications for other viruses. Viruses commonly bud at the plasma membrane by recruiting the host ESCRT machinery via conserved motifs termed late domains. The mechanism by which some viruses, such as HCV, bud intracellularly is, however, poorly characterized. Moreover, whether envelopment of HCV and other viruses lacking defined late domains is ESCRT mediated and, if so, what the entry points into the ESCRT pathway are remain unknown. Here, we report the interaction network of HCV with the ESCRT machinery and a critical role for HRS, an ESCRT-0 complex component, in HCV envelopment. Viral protein ubiquitination was discovered to be a signal for HRS binding and HCV assembly, thereby functionally compensating for the absence of late domains. These findings characterize how a virus lacking defined late domains co-opts ESCRT to bud intracellularly. Since the ESCRT machinery is essential for the life cycle of multiple viruses, better understanding of this virus-host interplay may yield targets for broad-spectrum antiviral therapies. Copyright © 2016 Barouch-Bentov et al.

Thermodynamic characterization of networks using graph polynomials

NASA Astrophysics Data System (ADS)

Ye, Cheng; Comin, César H.; Peron, Thomas K. DM.; Silva, Filipi N.; Rodrigues, Francisco A.; Costa, Luciano da F.; Torsello, Andrea; Hancock, Edwin R.

2015-09-01

In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

Relating the large-scale structure of time series and visibility networks.

PubMed

Rodríguez, Miguel A

2017-06-01

The structure of time series is usually characterized by means of correlations. A new proposal based on visibility networks has been considered recently. Visibility networks are complex networks mapped from surfaces or time series using visibility properties. The structures of time series and visibility networks are closely related, as shown by means of fractional time series in recent works. In these works, a simple relationship between the Hurst exponent H of fractional time series and the exponent of the distribution of edges γ of the corresponding visibility network, which exhibits a power law, is shown. To check and generalize these results, in this paper we delve into this idea of connected structures by defining both structures more properly. In addition to the exponents used before, H and γ, which take into account local properties, we consider two more exponents that, as we will show, characterize global properties. These are the exponent α for time series, which gives the scaling of the variance with the size as var∼T^{2α}, and the exponent κ of their corresponding network, which gives the scaling of the averaged maximum of the number of edges, 〈k_{M}〉∼N^{κ}. With this representation, a more precise connection between the structures of general time series and their associated visibility network is achieved. Similarities and differences are more clearly established, and new scaling forms of complex networks appear in agreement with their respective classes of time series.

CytoViz: an artistic mapping of network measurements as living organisms in a VR application

NASA Astrophysics Data System (ADS)

López Silva, Brenda A.; Renambot, Luc

2007-02-01

CytoViz is an artistic, real-time information visualization driven by statistical information gathered during gigabit network transfers to the Scalable Adaptive Graphical Environment (SAGE) at various events. Data streams are mapped to cellular organisms defining their structure and behavior as autonomous agents. Network bandwidth drives the growth of each entity and the latency defines its physics-based independent movements. The collection of entity is bound within the 3D representation of the local venue. This visual and animated metaphor allows the public to experience the complexity of high-speed network streams that are used in the scientific community. Moreover, CytoViz displays the presence of discoverable Bluetooth devices carried by nearby persons. The concept is to generate an event-specific, real-time visualization that creates informational 3D patterns based on actual local presence. The observed Bluetooth traffic is put in opposition of the wide-area networking traffic by overlaying 2D animations on top of the 3D world. Each device is mapped to an animation fading over time while displaying the name of the detected device and its unique physical address. CytoViz was publicly presented at two major international conferences in 2005 (iGrid2005 in San Diego, CA and SC05 in Seattle, WA).

Analysing human mobility patterns of hiking activities through complex network theory.

PubMed

Lera, Isaac; Pérez, Toni; Guerrero, Carlos; Eguíluz, Víctor M; Juiz, Carlos

2017-01-01

The exploitation of high volume of geolocalized data from social sport tracking applications of outdoor activities can be useful for natural resource planning and to understand the human mobility patterns during leisure activities. This geolocalized data represents the selection of hike activities according to subjective and objective factors such as personal goals, personal abilities, trail conditions or weather conditions. In our approach, human mobility patterns are analysed from trajectories which are generated by hikers. We propose the generation of the trail network identifying special points in the overlap of trajectories. Trail crossings and trailheads define our network and shape topological features. We analyse the trail network of Balearic Islands, as a case of study, using complex weighted network theory. The analysis is divided into the four seasons of the year to observe the impact of weather conditions on the network topology. The number of visited places does not decrease despite the large difference in the number of samples of the two seasons with larger and lower activity. It is in summer season where it is produced the most significant variation in the frequency and localization of activities from inland regions to coastal areas. Finally, we compare our model with other related studies where the network possesses a different purpose. One finding of our approach is the detection of regions with relevant importance where landscape interventions can be applied in function of the communities.

Analysing human mobility patterns of hiking activities through complex network theory

PubMed Central

Pérez, Toni; Guerrero, Carlos; Eguíluz, Víctor M.; Juiz, Carlos

2017-01-01

The exploitation of high volume of geolocalized data from social sport tracking applications of outdoor activities can be useful for natural resource planning and to understand the human mobility patterns during leisure activities. This geolocalized data represents the selection of hike activities according to subjective and objective factors such as personal goals, personal abilities, trail conditions or weather conditions. In our approach, human mobility patterns are analysed from trajectories which are generated by hikers. We propose the generation of the trail network identifying special points in the overlap of trajectories. Trail crossings and trailheads define our network and shape topological features. We analyse the trail network of Balearic Islands, as a case of study, using complex weighted network theory. The analysis is divided into the four seasons of the year to observe the impact of weather conditions on the network topology. The number of visited places does not decrease despite the large difference in the number of samples of the two seasons with larger and lower activity. It is in summer season where it is produced the most significant variation in the frequency and localization of activities from inland regions to coastal areas. Finally, we compare our model with other related studies where the network possesses a different purpose. One finding of our approach is the detection of regions with relevant importance where landscape interventions can be applied in function of the communities. PMID:28542280

Homological scaffolds of brain functional networks

PubMed Central

Petri, G.; Expert, P.; Turkheimer, F.; Carhart-Harris, R.; Nutt, D.; Hellyer, P. J.; Vaccarino, F.

2014-01-01

Networks, as efficient representations of complex systems, have appealed to scientists for a long time and now permeate many areas of science, including neuroimaging (Bullmore and Sporns 2009 Nat. Rev. Neurosci. 10, 186–198. (doi:10.1038/nrn2618)). Traditionally, the structure of complex networks has been studied through their statistical properties and metrics concerned with node and link properties, e.g. degree-distribution, node centrality and modularity. Here, we study the characteristics of functional brain networks at the mesoscopic level from a novel perspective that highlights the role of inhomogeneities in the fabric of functional connections. This can be done by focusing on the features of a set of topological objects—homological cycles—associated with the weighted functional network. We leverage the detected topological information to define the homological scaffolds, a new set of objects designed to represent compactly the homological features of the correlation network and simultaneously make their homological properties amenable to networks theoretical methods. As a proof of principle, we apply these tools to compare resting-state functional brain activity in 15 healthy volunteers after intravenous infusion of placebo and psilocybin—the main psychoactive component of magic mushrooms. The results show that the homological structure of the brain's functional patterns undergoes a dramatic change post-psilocybin, characterized by the appearance of many transient structures of low stability and of a small number of persistent ones that are not observed in the case of placebo. PMID:25401177

Fuzzy Adaptive Control for Intelligent Autonomous Space Exploration Problems

NASA Technical Reports Server (NTRS)

Esogbue, Augustine O.

1998-01-01

The principal objective of the research reported here is the re-design, analysis and optimization of our newly developed neural network fuzzy adaptive controller model for complex processes capable of learning fuzzy control rules using process data and improving its control through on-line adaption. The learned improvement is according to a performance objective function that provides evaluative feedback; this performance objective is broadly defined to meet long-range goals over time. Although fuzzy control had proven effective for complex, nonlinear, imprecisely-defined processes for which standard models and controls are either inefficient, impractical or cannot be derived, the state of the art prior to our work showed that procedures for deriving fuzzy control, however, were mostly ad hoc heuristics. The learning ability of neural networks was exploited to systematically derive fuzzy control and permit on-line adaption and in the process optimize control. The operation of neural networks integrates very naturally with fuzzy logic. The neural networks which were designed and tested using simulation software and simulated data, followed by realistic industrial data were reconfigured for application on several platforms as well as for the employment of improved algorithms. The statistical procedures of the learning process were investigated and evaluated with standard statistical procedures (such as ANOVA, graphical analysis of residuals, etc.). The computational advantage of dynamic programming-like methods of optimal control was used to permit on-line fuzzy adaptive control. Tests for the consistency, completeness and interaction of the control rules were applied. Comparisons to other methods and controllers were made so as to identify the major advantages of the resulting controller model. Several specific modifications and extensions were made to the original controller. Additional modifications and explorations have been proposed for further study. Some of these are in progress in our laboratory while others await additional support. All of these enhancements will improve the attractiveness of the controller as an effective tool for the on line control of an array of complex process environments.

Ensemble Classification of Alzheimer's Disease and Mild Cognitive Impairment Based on Complex Graph Measures from Diffusion Tensor Images

PubMed Central

Ebadi, Ashkan; Dalboni da Rocha, Josué L.; Nagaraju, Dushyanth B.; Tovar-Moll, Fernanda; Bramati, Ivanei; Coutinho, Gabriel; Sitaram, Ranganatha; Rashidi, Parisa

2017-01-01

The human brain is a complex network of interacting regions. The gray matter regions of brain are interconnected by white matter tracts, together forming one integrative complex network. In this article, we report our investigation about the potential of applying brain connectivity patterns as an aid in diagnosing Alzheimer's disease and Mild Cognitive Impairment (MCI). We performed pattern analysis of graph theoretical measures derived from Diffusion Tensor Imaging (DTI) data representing structural brain networks of 45 subjects, consisting of 15 patients of Alzheimer's disease (AD), 15 patients of MCI, and 15 healthy subjects (CT). We considered pair-wise class combinations of subjects, defining three separate classification tasks, i.e., AD-CT, AD-MCI, and CT-MCI, and used an ensemble classification module to perform the classification tasks. Our ensemble framework with feature selection shows a promising performance with classification accuracy of 83.3% for AD vs. MCI, 80% for AD vs. CT, and 70% for MCI vs. CT. Moreover, our findings suggest that AD can be related to graph measures abnormalities at Brodmann areas in the sensorimotor cortex and piriform cortex. In this way, node redundancy coefficient and load centrality in the primary motor cortex were recognized as good indicators of AD in contrast to MCI. In general, load centrality, betweenness centrality, and closeness centrality were found to be the most relevant network measures, as they were the top identified features at different nodes. The present study can be regarded as a “proof of concept” about a procedure for the classification of MRI markers between AD dementia, MCI, and normal old individuals, due to the small and not well-defined groups of AD and MCI patients. Future studies with larger samples of subjects and more sophisticated patient exclusion criteria are necessary toward the development of a more precise technique for clinical diagnosis. PMID:28293162

Sexual networks: measuring sexual selection in structured, polyandrous populations.

PubMed

McDonald, Grant C; James, Richard; Krause, Jens; Pizzari, Tommaso

2013-03-05

Sexual selection is traditionally measured at the population level, assuming that populations lack structure. However, increasing evidence undermines this approach, indicating that intrasexual competition in natural populations often displays complex patterns of spatial and temporal structure. This complexity is due in part to the degree and mechanisms of polyandry within a population, which can influence the intensity and scale of both pre- and post-copulatory sexual competition. Attempts to measure selection at the local and global scale have been made through multi-level selection approaches. However, definitions of local scale are often based on physical proximity, providing a rather coarse measure of local competition, particularly in polyandrous populations where the local scale of pre- and post-copulatory competition may differ drastically from each other. These limitations can be solved by social network analysis, which allows us to define a unique sexual environment for each member of a population: 'local scale' competition, therefore, becomes an emergent property of a sexual network. Here, we first propose a novel quantitative approach to measure pre- and post-copulatory sexual selection, which integrates multi-level selection with information on local scale competition derived as an emergent property of networks of sexual interactions. We then use simple simulations to illustrate the ways in which polyandry can impact estimates of sexual selection. We show that for intermediate levels of polyandry, the proposed network-based approach provides substantially more accurate measures of sexual selection than the more traditional population-level approach. We argue that the increasing availability of fine-grained behavioural datasets provides exciting new opportunities to develop network approaches to study sexual selection in complex societies.

Controllability and observability analysis for vertex domination centrality in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu

2014-06-01

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks.

Controllability and observability analysis for vertex domination centrality in directed networks

PubMed Central

Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu

2014-01-01

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks. PMID:24954137

An improved game-theoretic approach to uncover overlapping communities

NASA Astrophysics Data System (ADS)

Sun, Hong-Liang; Ch'Ng, Eugene; Yong, Xi; Garibaldi, Jonathan M.; See, Simon; Chen, Duan-Bing

How can we uncover overlapping communities from complex networks to understand the inherent structures and functions? Chen et al. firstly proposed a community game (Game) to study this problem, and the overlapping communities have been discovered when the game is convergent. It is based on the assumption that each vertex of the underlying network is a rational game player to maximize its utility. In this paper, we investigate how similar vertices affect the formation of community game. The Adamic-Adar Index (AA Index) has been employed to define the new utility function. This novel method has been evaluated on both synthetic and real-world networks. Experimental study shows that it has significant improvement of accuracy (from 4.8% to 37.6%) compared with the Game on 10 real networks. It is more efficient on Facebook networks (FN) and Amazon co-purchasing networks than on other networks. This result implicates that “friend circles of friends” of Facebook are valuable to understand the overlapping community division.

Analysis of Cisco Open Network Environment (ONE) OpenFlow Controller Implementation

DTIC Science & Technology

2014-08-01

Software - Defined Networking ( SDN ), when fully realized, offer many improvements over the current rigid and...functionalities like handshake, connection setup, switch management, and security. 15. SUBJECT TERMS OpenFlow, software - defined networking , Cisco ONE, SDN ...innovating packet-forwarding technologies. Network device roles are strictly defined with little or no flexibility. In Software - Defined Networks ( SDNs ),

The IBD interactome: an integrated view of aetiology, pathogenesis and therapy.

PubMed

de Souza, Heitor S P; Fiocchi, Claudio; Iliopoulos, Dimitrios

2017-12-01

Crohn's disease and ulcerative colitis are prototypical complex diseases characterized by chronic and heterogeneous manifestations, induced by interacting environmental, genomic, microbial and immunological factors. These interactions result in an overwhelming complexity that cannot be tackled by studying the totality of each pathological component (an '-ome') in isolation without consideration of the interaction among all relevant -omes that yield an overall 'network effect'. The outcome of this effect is the 'IBD interactome', defined as a disease network in which dysregulation of individual -omes causes intestinal inflammation mediated by dysfunctional molecular modules. To define the IBD interactome, new concepts and tools are needed to implement a systems approach; an unbiased data-driven integration strategy that reveals key players of the system, pinpoints the central drivers of inflammation and enables development of targeted therapies. Powerful bioinformatics tools able to query and integrate multiple -omes are available, enabling the integration of genomic, epigenomic, transcriptomic, proteomic, metabolomic and microbiome information to build a comprehensive molecular map of IBD. This approach will enable identification of IBD molecular subtypes, correlations with clinical phenotypes and elucidation of the central hubs of the IBD interactome that will aid discovery of compounds that can specifically target the hubs that control the disease.

The topology and dynamics of complex networks

NASA Astrophysics Data System (ADS)

Dezso, Zoltan

We start with a brief introduction about the topological properties of real networks. Most real networks are scale-free, being characterized by a power-law degree distribution. The scale-free nature of real networks leads to unexpected properties such as the vanishing epidemic threshold. Traditional methods aiming to reduce the spreading rate of viruses cannot succeed on eradicating the epidemic on a scale-free network. We demonstrate that policies that discriminate between the nodes, curing mostly the highly connected nodes, can restore a finite epidemic threshold and potentially eradicate the virus. We find that the more biased a policy is towards the hubs, the more chance it has to bring the epidemic threshold above the virus' spreading rate. We continue by studying a large Web portal as a model system for a rapidly evolving network. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power law distribution, in contrast with the exponential expected for Poisson processes. We show that the exponent characterizing the individual user's browsing patterns determines the power-law decay in a document's visitation. Finally, we turn our attention to biological networks and demonstrate quantitatively that protein complexes in the yeast, Saccharomyces cerevisiae, are comprised of a core in which subunits are highly coexpressed, display the same deletion phenotype (essential or non-essential) and share identical functional classification and cellular localization. The results allow us to define the deletion phenotype and cellular task of most known complexes, and to identify with high confidence the biochemical role of hundreds of proteins with yet unassigned functionality.

Efficient, Decentralized Detection of Qualitative Spatial Events in a Dynamic Scalar Field

PubMed Central

Jeong, Myeong-Hun; Duckham, Matt

2015-01-01

This paper describes an efficient, decentralized algorithm to monitor qualitative spatial events in a dynamic scalar field. The events of interest involve changes to the critical points (i.e., peak, pits and passes) and edges of the surface network derived from the field. Four fundamental types of event (appearance, disappearance, movement and switch) are defined. Our algorithm is designed to rely purely on qualitative information about the neighborhoods of nodes in the sensor network and does not require information about nodes’ coordinate positions. Experimental investigations confirm that our algorithm is efficient, with O(n) overall communication complexity (where n is the number of nodes in the sensor network), an even load balance and low operational latency. The accuracy of event detection is comparable to established centralized algorithms for the identification of critical points of a surface network. Our algorithm is relevant to a broad range of environmental monitoring applications of sensor networks. PMID:26343672

Efficient, Decentralized Detection of Qualitative Spatial Events in a Dynamic Scalar Field.

PubMed

Jeong, Myeong-Hun; Duckham, Matt

2015-08-28

This paper describes an efficient, decentralized algorithm to monitor qualitative spatial events in a dynamic scalar field. The events of interest involve changes to the critical points (i.e., peak, pits and passes) and edges of the surface network derived from the field. Four fundamental types of event (appearance, disappearance, movement and switch) are defined. Our algorithm is designed to rely purely on qualitative information about the neighborhoods of nodes in the sensor network and does not require information about nodes' coordinate positions. Experimental investigations confirm that our algorithm is efficient, with O(n) overall communication complexity (where n is the number of nodes in the sensor network), an even load balance and low operational latency. The accuracy of event detection is comparable to established centralized algorithms for the identification of critical points of a surface network. Our algorithm is relevant to a broad range of environmental monitoring applications of sensor networks.

[Innovative teleradiology network: concept and experience report].

PubMed

Kämmerer, M; Bethge, O T; Antoch, G

2014-04-01

(DICOM E-MAIL provides a standardized way for exchanging DICOM objects (Digital Imaging and Communications in Medicine) and further relevant patient data for the treatment context reliably and securely via encrypted e-mails. The current version of the DICOM E-MAIL standard recommendations of the"Deutsche Röntgengesellschaft" (DRG, German Röntgen Society) defines for the first time options for setting up a special directory service for the provision and distribution of communication data of all participants in a network. By using such"telephone books", networks of any size can be operated independent of the provider. Compared to a Cross-Enterprise Document Sharing (XDS) scenario, the required infrastructure is considerably less complex and quicker to realize. Critical success factors are, in addition to the technology and an effective support, that the participants themselves contribute to the further development of the network and in this way, the network approach can be practiced.

Integrating complexity into data-driven multi-hazard supply chain network strategies

USGS Publications Warehouse

Long, Suzanna K.; Shoberg, Thomas G.; Ramachandran, Varun; Corns, Steven M.; Carlo, Hector J.

2013-01-01

Major strategies in the wake of a large-scale disaster have focused on short-term emergency response solutions. Few consider medium-to-long-term restoration strategies that reconnect urban areas to the national supply chain networks (SCN) and their supporting infrastructure. To re-establish this connectivity, the relationships within the SCN must be defined and formulated as a model of a complex adaptive system (CAS). A CAS model is a representation of a system that consists of large numbers of inter-connections, demonstrates non-linear behaviors and emergent properties, and responds to stimulus from its environment. CAS modeling is an effective method of managing complexities associated with SCN restoration after large-scale disasters. In order to populate the data space large data sets are required. Currently access to these data is hampered by proprietary restrictions. The aim of this paper is to identify the data required to build a SCN restoration model, look at the inherent problems associated with these data, and understand the complexity that arises due to integration of these data.

Using food network unfolding to evaluate food-web complexity in terms of biodiversity: theory and applications.

PubMed

Kato, Yoshikazu; Kondoh, Michio; Ishikawa, Naoto F; Togashi, Hiroyuki; Kohmatsu, Yukihiro; Yoshimura, Mayumi; Yoshimizu, Chikage; Haraguchi, Takashi F; Osada, Yutaka; Ohte, Nobuhito; Tokuchi, Naoko; Okuda, Noboru; Miki, Takeshi; Tayasu, Ichiro

2018-07-01

Food-web complexity often hinders disentangling functionally relevant aspects of food-web structure and its relationships to biodiversity. Here, we present a theoretical framework to evaluate food-web complexity in terms of biodiversity. Food network unfolding is a theoretical method to transform a complex food web into a linear food chain based on ecosystem processes. Based on this method, we can define three biodiversity indices, horizontal diversity (D H ), vertical diversity (D V ) and range diversity (D R ), which are associated with the species diversity within each trophic level, diversity of trophic levels, and diversity in resource use, respectively. These indices are related to Shannon's diversity index (H'), where H' = D H  + D V  - D R . Application of the framework to three riverine macroinvertebrate communities revealed that D indices, calculated from biomass and stable isotope features, captured well the anthropogenic, seasonal, or other within-site changes in food-web structures that could not be captured with H' alone. © 2018 John Wiley & Sons Ltd/CNRS.

Controlling Complex Systems and Developing Dynamic Technology

NASA Astrophysics Data System (ADS)

Avizienis, Audrius Victor

In complex systems, control and understanding become intertwined. Following Ilya Prigogine, we define complex systems as having control parameters which mediate transitions between distinct modes of dynamical behavior. From this perspective, determining the nature of control parameters and demonstrating the associated dynamical phase transitions are practically equivalent and fundamental to engaging with complexity. In the first part of this work, a control parameter is determined for a non-equilibrium electrochemical system by studying a transition in the morphology of structures produced by an electroless deposition reaction. Specifically, changing the size of copper posts used as the substrate for growing metallic silver structures by the reduction of Ag+ from solution under diffusion-limited reaction conditions causes a dynamical phase transition in the crystal growth process. For Cu posts with edge lengths on the order of one micron, local forces promoting anisotropic growth predominate, and the reaction produces interconnected networks of Ag nanowires. As the post size is increased above 10 microns, the local interfacial growth reaction dynamics couple with the macroscopic diffusion field, leading to spatially propagating instabilities in the electrochemical potential which induce periodic branching during crystal growth, producing dendritic deposits. This result is interesting both as an example of control and understanding in a complex system, and as a useful combination of top-down lithography with bottom-up electrochemical self-assembly. The second part of this work focuses on the technological development of devices fabricated using this non-equilibrium electrochemical process, towards a goal of integrating a complex network as a dynamic functional component in a neuromorphic computing device. Self-assembled networks of silver nanowires were reacted with sulfur to produce interfacial "atomic switches": silver-silver sulfide junctions, which exhibit complex dynamics (e.g. both short- and long-term changes in conductivity) in response to applied voltage signals. Characterization of these atomic switch networks (ASNs) brought out interesting parallels to biological neural networks, including power-law scaling in the statistics of electrical signal propagation and dynamic self-organization of differentiated subnetworks. A reservoir computing (RC) strategy was employed to utilize measurements of electrical signals dynamically generated in ASNs to perform time-series memory and manipulation tasks including a parity test and arbitrary waveform generation. These results represent the useful integration of a complex network into a dynamic physical RC device.

An alternative way to track the hot money in turbulent times

NASA Astrophysics Data System (ADS)

Sensoy, Ahmet

2015-02-01

During recent years, networks have proven to be an efficient way to characterize and investigate a wide range of complex financial systems. In this study, we first obtain the dynamic conditional correlations between filtered exchange rates (against US dollar) of several countries and introduce a time-varying threshold correlation level to define dynamic strong correlations between these exchange rates. Then, using evolving networks obtained from strong correlations, we propose an alternative approach to track the hot money in turbulent times. The approach is demonstrated for the time period including the financial turmoil of 2008. Other applications are also discussed.

Correlation between elastic and plastic deformations of partially cured epoxy networks

NASA Astrophysics Data System (ADS)

Müller, Michael; Böhm, Robert; Geller, Sirko; Kupfer, Robert; Jäger, Hubert; Gude, Maik

2018-05-01

The thermo-mechanical behavior of polymer matrix materials is strongly dependent on the curing reaction as well as temperature and time. To date, investigations of epoxy resins and their composites mainly focused on the elastic domain because plastic deformation of cross-linked polymer networks was considered as irrelevant or not feasible. This paper presents a novel approach which combines both elastic and plastic domain. Based on an analytical framework describing the storage modulus, analogous parameter combinations are defined in order to reduce complexity when variations in temperature, strain rate and degree of cure are encountered.

High-resolution mapping reveals topologically distinct cellular pools of phosphatidylserine

PubMed Central

Fairn, Gregory D.; Schieber, Nicole L.; Ariotti, Nicholas; Murphy, Samantha; Kuerschner, Lars; Webb, Richard I.; Grinstein, Sergio

2011-01-01

Phosphatidylserine (PS) plays a central role in cell signaling and in the biosynthesis of other lipids. To date, however, the subcellular distribution and transmembrane topology of this crucial phospholipid remain ill-defined. We transfected cells with a GFP-tagged C2 domain of lactadherin to detect by light and electron microscopy PS exposed on the cytosolic leaflet of the plasmalemma and organellar membranes. Cytoplasmically exposed PS was found to be clustered on the plasma membrane, and to be associated with caveolae, the trans-Golgi network, and endocytic organelles including intraluminal vesicles of multivesicular endosomes. This labeling pattern was compared with the total cellular distribution of PS as visualized using a novel on-section technique. These complementary methods revealed PS in the interior of the ER, Golgi complex, and mitochondria. These results indicate that PS in the lumenal monolayer of the ER and Golgi complex becomes exposed cytosolically at the trans-Golgi network. Transmembrane flipping of PS may contribute to the exit of cargo from the Golgi complex. PMID:21788369

Genetic and environmental pathways to complex diseases.

PubMed

Gohlke, Julia M; Thomas, Reuben; Zhang, Yonqing; Rosenstein, Michael C; Davis, Allan P; Murphy, Cynthia; Becker, Kevin G; Mattingly, Carolyn J; Portier, Christopher J

2009-05-05

Pathogenesis of complex diseases involves the integration of genetic and environmental factors over time, making it particularly difficult to tease apart relationships between phenotype, genotype, and environmental factors using traditional experimental approaches. Using gene-centered databases, we have developed a network of complex diseases and environmental factors through the identification of key molecular pathways associated with both genetic and environmental contributions. Comparison with known chemical disease relationships and analysis of transcriptional regulation from gene expression datasets for several environmental factors and phenotypes clustered in a metabolic syndrome and neuropsychiatric subnetwork supports our network hypotheses. This analysis identifies natural and synthetic retinoids, antipsychotic medications, Omega 3 fatty acids, and pyrethroid pesticides as potential environmental modulators of metabolic syndrome phenotypes through PPAR and adipocytokine signaling and organophosphate pesticides as potential environmental modulators of neuropsychiatric phenotypes. Identification of key regulatory pathways that integrate genetic and environmental modulators define disease associated targets that will allow for efficient screening of large numbers of environmental factors, screening that could set priorities for further research and guide public health decisions.

Electromagnetic game modeling through Tensor Analysis of Networks and Game Theory

NASA Astrophysics Data System (ADS)

Maurice, Olivier; Reineix, Alain; Lalléchère, Sébastien

2014-10-01

A complex system involves events coming from natural behaviors. Whatever is the complicated face of machines, they are still far from the complexity of natural systems. Currently, economy is one of the rare science trying to find out some ways to model human behavior. These attempts involve game theory and psychology. Our purpose is to develop a formalism able to take in charge both game and hardware modeling. We first present the Tensorial Analysis of Networks, used for the material part of the system. Then, we detail the mathematical objects defined in order to describe the evolution of the system and its gaming side. To illustrate the discussion we consider the case of a drone whose electronic can be disturbed by a radar field, but this drone must fly as near as possible close to this radar.

Hepatitis C Virus Proteins Interact with the Endosomal Sorting Complex Required for Transport (ESCRT) Machinery via Ubiquitination To Facilitate Viral Envelopment

PubMed Central

Barouch-Bentov, Rina; Neveu, Gregory; Xiao, Fei; Beer, Melanie; Bekerman, Elena; Schor, Stanford; Campbell, Joseph; Boonyaratanakornkit, Jim; Lindenbach, Brett; Lu, Albert; Jacob, Yves

2016-01-01

ABSTRACT Enveloped viruses commonly utilize late-domain motifs, sometimes cooperatively with ubiquitin, to hijack the endosomal sorting complex required for transport (ESCRT) machinery for budding at the plasma membrane. However, the mechanisms underlying budding of viruses lacking defined late-domain motifs and budding into intracellular compartments are poorly characterized. Here, we map a network of hepatitis C virus (HCV) protein interactions with the ESCRT machinery using a mammalian-cell-based protein interaction screen and reveal nine novel interactions. We identify HRS (hepatocyte growth factor-regulated tyrosine kinase substrate), an ESCRT-0 complex component, as an important entry point for HCV into the ESCRT pathway and validate its interactions with the HCV nonstructural (NS) proteins NS2 and NS5A in HCV-infected cells. Infectivity assays indicate that HRS is an important factor for efficient HCV assembly. Specifically, by integrating capsid oligomerization assays, biophysical analysis of intracellular viral particles by continuous gradient centrifugations, proteolytic digestion protection, and RNase digestion protection assays, we show that HCV co-opts HRS to mediate a late assembly step, namely, envelopment. In the absence of defined late-domain motifs, K63-linked polyubiquitinated lysine residues in the HCV NS2 protein bind the HRS ubiquitin-interacting motif to facilitate assembly. Finally, ESCRT-III and VPS/VTA1 components are also recruited by HCV proteins to mediate assembly. These data uncover involvement of ESCRT proteins in intracellular budding of a virus lacking defined late-domain motifs and a novel mechanism by which HCV gains entry into the ESCRT network, with potential implications for other viruses. PMID:27803188

Cross stratum resources protection in fog-computing-based radio over fiber networks for 5G services

NASA Astrophysics Data System (ADS)

Guo, Shaoyong; Shao, Sujie; Wang, Yao; Yang, Hui

2017-09-01

In order to meet the requirement of internet of things (IoT) and 5G, the cloud radio access network is a paradigm which converges all base stations computational resources into a cloud baseband unit (BBU) pool, while the distributed radio frequency signals are collected by remote radio head (RRH). A precondition for centralized processing in the BBU pool is an interconnection fronthaul network with high capacity and low delay. However, it has become more complex and frequent in the interaction between RRH and BBU and resource scheduling among BBUs in cloud. Cloud radio over fiber network has been proposed in our previous work already. In order to overcome the complexity and latency, in this paper, we first present a novel cross stratum resources protection (CSRP) architecture in fog-computing-based radio over fiber networks (F-RoFN) for 5G services. Additionally, a cross stratum protection (CSP) scheme considering the network survivability is introduced in the proposed architecture. The CSRP with CSP scheme can effectively pull the remote processing resource locally to implement the cooperative radio resource management, enhance the responsiveness and resilience to the dynamic end-to-end 5G service demands, and globally optimize optical network, wireless and fog resources. The feasibility and efficiency of the proposed architecture with CSP scheme are verified on our software defined networking testbed in terms of service latency, transmission success rate, resource occupation rate and blocking probability.

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

A network function-based definition of communities in complex networks.

PubMed

Chauhan, Sanjeev; Girvan, Michelle; Ott, Edward

2012-09-01

We consider an alternate definition of community structure that is functionally motivated. We define network community structure based on the function the network system is intended to perform. In particular, as a specific example of this approach, we consider communities whose function is enhanced by the ability to synchronize and/or by resilience to node failures. Previous work has shown that, in many cases, the largest eigenvalue of the network's adjacency matrix controls the onset of both synchronization and percolation processes. Thus, for networks whose functional performance is dependent on these processes, we propose a method that divides a given network into communities based on maximizing a function of the largest eigenvalues of the adjacency matrices of the resulting communities. We also explore the differences between the partitions obtained by our method and the modularity approach (which is based solely on consideration of network structure). We do this for several different classes of networks. We find that, in many cases, modularity-based partitions do almost as well as our function-based method in finding functional communities, even though modularity does not specifically incorporate consideration of function.

Making sense out of spinal cord somatosensory development

PubMed Central

Seal, Rebecca P.

2016-01-01

The spinal cord integrates and relays somatosensory input, leading to complex motor responses. Research over the past couple of decades has identified transcription factor networks that function during development to define and instruct the generation of diverse neuronal populations within the spinal cord. A number of studies have now started to connect these developmentally defined populations with their roles in somatosensory circuits. Here, we review our current understanding of how neuronal diversity in the dorsal spinal cord is generated and we discuss the logic underlying how these neurons form the basis of somatosensory circuits. PMID:27702783

Multilayer network of language: A unified framework for structural analysis of linguistic subsystems

NASA Astrophysics Data System (ADS)

Martinčić-Ipšić, Sanda; Margan, Domagoj; Meštrović, Ana

2016-09-01

Recently, the focus of complex networks' research has shifted from the analysis of isolated properties of a system toward a more realistic modeling of multiple phenomena - multilayer networks. Motivated by the prosperity of multilayer approach in social, transport or trade systems, we introduce the multilayer networks for language. The multilayer network of language is a unified framework for modeling linguistic subsystems and their structural properties enabling the exploration of their mutual interactions. Various aspects of natural language systems can be represented as complex networks, whose vertices depict linguistic units, while links model their relations. The multilayer network of language is defined by three aspects: the network construction principle, the linguistic subsystem and the language of interest. More precisely, we construct a word-level (syntax and co-occurrence) and a subword-level (syllables and graphemes) network layers, from four variations of original text (in the modeled language). The analysis and comparison of layers at the word and subword-levels are employed in order to determine the mechanism of the structural influences between linguistic units and subsystems. The obtained results suggest that there are substantial differences between the networks' structures of different language subsystems, which are hidden during the exploration of an isolated layer. The word-level layers share structural properties regardless of the language (e.g. Croatian or English), while the syllabic subword-level expresses more language dependent structural properties. The preserved weighted overlap quantifies the similarity of word-level layers in weighted and directed networks. Moreover, the analysis of motifs reveals a close topological structure of the syntactic and syllabic layers for both languages. The findings corroborate that the multilayer network framework is a powerful, consistent and systematic approach to model several linguistic subsystems simultaneously and hence to provide a more unified view on language.

Structural covariance networks are coupled to expression of genes enriched in supragranular layers of the human cortex.

PubMed

Romero-Garcia, Rafael; Whitaker, Kirstie J; Váša, František; Seidlitz, Jakob; Shinn, Maxwell; Fonagy, Peter; Dolan, Raymond J; Jones, Peter B; Goodyer, Ian M; Bullmore, Edward T; Vértes, Petra E

2018-05-01

Complex network topology is characteristic of many biological systems, including anatomical and functional brain networks (connectomes). Here, we first constructed a structural covariance network from MRI measures of cortical thickness on 296 healthy volunteers, aged 14-24 years. Next, we designed a new algorithm for matching sample locations from the Allen Brain Atlas to the nodes of the SCN. Subsequently we used this to define, transcriptomic brain networks by estimating gene co-expression between pairs of cortical regions. Finally, we explored the hypothesis that transcriptional networks and structural MRI connectomes are coupled. A transcriptional brain network (TBN) and a structural covariance network (SCN) were correlated across connection weights and showed qualitatively similar complex topological properties: assortativity, small-worldness, modularity, and a rich-club. In both networks, the weight of an edge was inversely related to the anatomical (Euclidean) distance between regions. There were differences between networks in degree and distance distributions: the transcriptional network had a less fat-tailed degree distribution and a less positively skewed distance distribution than the SCN. However, cortical areas connected to each other within modules of the SCN had significantly higher levels of whole genome co-expression than expected by chance. Nodes connected in the SCN had especially high levels of expression and co-expression of a human supragranular enriched (HSE) gene set that has been specifically located to supragranular layers of human cerebral cortex and is known to be important for large-scale, long-distance cortico-cortical connectivity. This coupling of brain transcriptome and connectome topologies was largely but not entirely accounted for by the common constraint of physical distance on both networks. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

Measure of robustness for complex networks

NASA Astrophysics Data System (ADS)

Youssef, Mina Nabil

Critical infrastructures are repeatedly attacked by external triggers causing tremendous amount of damages. Any infrastructure can be studied using the powerful theory of complex networks. A complex network is composed of extremely large number of different elements that exchange commodities providing significant services. The main functions of complex networks can be damaged by different types of attacks and failures that degrade the network performance. These attacks and failures are considered as disturbing dynamics, such as the spread of viruses in computer networks, the spread of epidemics in social networks, and the cascading failures in power grids. Depending on the network structure and the attack strength, every network differently suffers damages and performance degradation. Hence, quantifying the robustness of complex networks becomes an essential task. In this dissertation, new metrics are introduced to measure the robustness of technological and social networks with respect to the spread of epidemics, and the robustness of power grids with respect to cascading failures. First, we introduce a new metric called the Viral Conductance (VCSIS ) to assess the robustness of networks with respect to the spread of epidemics that are modeled through the susceptible/infected/susceptible (SIS) epidemic approach. In contrast to assessing the robustness of networks based on a classical metric, the epidemic threshold, the new metric integrates the fraction of infected nodes at steady state for all possible effective infection strengths. Through examples, VCSIS provides more insights about the robustness of networks than the epidemic threshold. In addition, both the paradoxical robustness of Barabasi-Albert preferential attachment networks and the effect of the topology on the steady state infection are studied, to show the importance of quantifying the robustness of networks. Second, a new metric VCSIR is introduced to assess the robustness of networks with respect to the spread of susceptible/infected/recovered (SIR) epidemics. To compute VCSIR, we propose a novel individual-based approach to model the spread of SIR epidemics in networks, which captures the infection size for a given effective infection rate. Thus, VCSIR quantitatively integrates the infection strength with the corresponding infection size. To optimize the VCSIR metric, a new mitigation strategy is proposed, based on a temporary reduction of contacts in social networks. The social contact network is modeled as a weighted graph that describes the frequency of contacts among the individuals. Thus, we consider the spread of an epidemic as a dynamical system, and the total number of infection cases as the state of the system, while the weight reduction in the social network is the controller variable leading to slow/reduce the spread of epidemics. Using optimal control theory, the obtained solution represents an optimal adaptive weighted network defined over a finite time interval. Moreover, given the high complexity of the optimization problem, we propose two heuristics to find the near optimal solutions by reducing the contacts among the individuals in a decentralized way. Finally, the cascading failures that can take place in power grids and have recently caused several blackouts are studied. We propose a new metric to assess the robustness of the power grid with respect to the cascading failures. The power grid topology is modeled as a network, which consists of nodes and links representing power substations and transmission lines, respectively. We also propose an optimal islanding strategy to protect the power grid when a cascading failure event takes place in the grid. The robustness metrics are numerically evaluated using real and synthetic networks to quantify their robustness with respect to disturbing dynamics. We show that the proposed metrics outperform the classical metrics in quantifying the robustness of networks and the efficiency of the mitigation strategies. In summary, our work advances the network science field in assessing the robustness of complex networks with respect to various disturbing dynamics.

Entropy of network ensembles

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

2009-03-01

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

Mechanically tunable actin networks using programmable DNA based cross-linkers

NASA Astrophysics Data System (ADS)

Schnauss, Joerg; Lorenz, Jessica; Schuldt, Carsten; Kaes, Josef; Smith, David

Cells employ multiple cross-linkers with very different properties. Studies of the entire phase space, however, were infeasible since they were restricted to naturally occurring cross-linkers. These components cannot be controllably varied and differ in many parameters. We resolve this limitation by forming artificial actin cross-linkers, which can be controllably varied. The basic building block is DNA enabling a well-defined length variation. DNA can be attached to actin binding peptides with known binding affinities. We used bulk rheology to investigate mechanical properties of these networks. We were able to reproduce mechanical features of actin networks cross-linked by fascin by using a short version of our artificial complex with a high binding affinity. Additionally, we were able to resemble findings for the cross-linker alpha-actinin by employing a long cross-linker with a low binding affinity. Between these natural limits we investigated three different cross-linker lengths each with two different binding affinities. With these controlled variations we are able to precisely screen the phase space of cross-linked actin networks by changing only one specific parameter and not the entire set of properties as in the case of naturally occurring cross-linking complexes.

Interests diffusion on a semantic multiplex. Comparing Computer Science and American Physical Society communities

NASA Astrophysics Data System (ADS)

D'Agostino, Gregorio; De Nicola, Antonio

2016-10-01

Exploiting the information about members of a Social Network (SN) represents one of the most attractive and dwelling subjects for both academic and applied scientists. The community of Complexity Science and especially those researchers working on multiplex social systems are devoting increasing efforts to outline general laws, models, and theories, to the purpose of predicting emergent phenomena in SN's (e.g. success of a product). On the other side the semantic web community aims at engineering a new generation of advanced services tailored to specific people needs. This implies defining constructs, models and methods for handling the semantic layer of SNs. We combined models and techniques from both the former fields to provide a hybrid approach to understand a basic (yet complex) phenomenon: the propagation of individual interests along the social networks. Since information may move along different social networks, one should take into account a multiplex structure. Therefore we introduced the notion of "Semantic Multiplex". In this paper we analyse two different semantic social networks represented by authors publishing in the Computer Science and those in the American Physical Society Journals. The comparison allows to outline common and specific features.

Modular and Orthogonal Synthesis of Hybrid Polymers and Networks

PubMed Central

Liu, Shuang; Dicker, Kevin T.; Jia, Xinqiao

2015-01-01

Biomaterials scientists strive to develop polymeric materials with distinct chemical make-up, complex molecular architectures, robust mechanical properties and defined biological functions by drawing inspirations from biological systems. Salient features of biological designs include (1) repetitive presentation of basic motifs; and (2) efficient integration of diverse building blocks. Thus, an appealing approach to biomaterials synthesis is to combine synthetic and natural building blocks in a modular fashion employing novel chemical methods. Over the past decade, orthogonal chemistries have become powerful enabling tools for the modular synthesis of advanced biomaterials. These reactions require building blocks with complementary functionalities, occur under mild conditions in the presence of biological molecules and living cells and proceed with high yield and exceptional selectivity. These chemistries have facilitated the construction of complex polymers and networks in a step-growth fashion, allowing facile modulation of materials properties by simple variations of the building blocks. In this review, we first summarize features of several types of orthogonal chemistries. We then discuss recent progress in the synthesis of step growth linear polymers, dendrimers and networks that find application in drug delivery, 3D cell culture and tissue engineering. Overall, orthogonal reactions and modulular synthesis have not only minimized the steps needed for the desired chemical transformations but also maximized the diversity and functionality of the final products. The modular nature of the design, combined with the potential synergistic effect of the hybrid system, will likely result in novel hydrogel matrices with robust structures and defined functions. PMID:25572255

Assessment of the integration capability of system architectures from a complex and distributed software systems perspective

NASA Astrophysics Data System (ADS)

Leuchter, S.; Reinert, F.; Müller, W.

2014-06-01

Procurement and design of system architectures capable of network centric operations demand for an assessment scheme in order to compare different alternative realizations. In this contribution an assessment method for system architectures targeted at the C4ISR domain is presented. The method addresses the integration capability of software systems from a complex and distributed software system perspective focusing communication, interfaces and software. The aim is to evaluate the capability to integrate a system or its functions within a system-of-systems network. This method uses approaches from software architecture quality assessment and applies them on the system architecture level. It features a specific goal tree of several dimensions that are relevant for enterprise integration. These dimensions have to be weighed against each other and totalized using methods from the normative decision theory in order to reflect the intention of the particular enterprise integration effort. The indicators and measurements for many of the considered quality features rely on a model based view on systems, networks, and the enterprise. That means it is applicable to System-of-System specifications based on enterprise architectural frameworks relying on defined meta-models or domain ontologies for defining views and viewpoints. In the defense context we use the NATO Architecture Framework (NAF) to ground respective system models. The proposed assessment method allows evaluating and comparing competing system designs regarding their future integration potential. It is a contribution to the system-of-systems engineering methodology.

Fermi-Dirac statistics and traffic in complex networks.

PubMed

de Moura, Alessandro P S

2005-06-01

We propose an idealized model for traffic in a network, in which many particles move randomly from node to node, following the network's links, and it is assumed that at most one particle can occupy any given node. This is intended to mimic the finite forwarding capacity of nodes in communication networks, thereby allowing the possibility of congestion and jamming phenomena. We show that the particles behave like free fermions, with appropriately defined energy-level structure and temperature. The statistical properties of this system are thus given by the corresponding Fermi-Dirac distribution. We use this to obtain analytical expressions for dynamical quantities of interest, such as the mean occupation of each node and the transport efficiency, for different network topologies and particle densities. We show that the subnetwork of free nodes always fragments into small isolated clusters for a sufficiently large number of particles, implying a communication breakdown at some density for all network topologies. These results are compared to direct simulations.

Network analysis of mesoscale optical recordings to assess regional, functional connectivity.

PubMed

Lim, Diana H; LeDue, Jeffrey M; Murphy, Timothy H

2015-10-01

With modern optical imaging methods, it is possible to map structural and functional connectivity. Optical imaging studies that aim to describe large-scale neural connectivity often need to handle large and complex datasets. In order to interpret these datasets, new methods for analyzing structural and functional connectivity are being developed. Recently, network analysis, based on graph theory, has been used to describe and quantify brain connectivity in both experimental and clinical studies. We outline how to apply regional, functional network analysis to mesoscale optical imaging using voltage-sensitive-dye imaging and channelrhodopsin-2 stimulation in a mouse model. We include links to sample datasets and an analysis script. The analyses we employ can be applied to other types of fluorescence wide-field imaging, including genetically encoded calcium indicators, to assess network properties. We discuss the benefits and limitations of using network analysis for interpreting optical imaging data and define network properties that may be used to compare across preparations or other manipulations such as animal models of disease.

[Dynamic paradigm in psychopathology: "chaos theory", from physics to psychiatry].

PubMed

Pezard, L; Nandrino, J L

2001-01-01

For the last thirty years, progress in the field of physics, known as "Chaos theory"--or more precisely: non-linear dynamical systems theory--has increased our understanding of complex systems dynamics. This framework's formalism is general enough to be applied in other domains, such as biology or psychology, where complex systems are the rule rather than the exception. Our goal is to show here that this framework can become a valuable tool in scientific fields such as neuroscience and psychiatry where objects possess natural time dependency (i.e. dynamical properties) and non-linear characteristics. The application of non-linear dynamics concepts on these topics is more precise than a loose metaphor and can throw a new light on mental functioning and dysfunctioning. A class of neural networks (recurrent neural networks) constitutes an example of the implementation of the dynamical system concept and provides models of cognitive processes (15). The state of activity of the network is represented in its state space and the time evolution of this state is a trajectory in this space. After a period of time those networks settle on an equilibrium (a kind of attractor). The strength of connections between neurons define the number and relations between those attractors. The attractors of the network are usually interpreted as "mental representations". When an initial condition is imposed to the network, the evolution towards an attractor is considered as a model of information processing (27). This information processing is not defined in a symbolic manner but is a result of the interaction between distributed elements. Several properties of dynamical models can be used to define a way where the symbolic properties emerge from physical and dynamical properties (28) and thus they can be candidates for the definition of the emergence of mental properties on the basis of neuronal dynamics (42). Nevertheless, mental properties can also be considered as the result of an underlying dynamics without explicit mention of the neuronal one (47). In that case, dynamical tools can be used to elucidate the Freudian psychodynamics (34, 35). Recurrent neuronal networks have been used to propose interpretation of several mental dysfunctions (12). For example in the case of schizophrenia, it has been proposed that troubles in the cortical pruning during development (13) may cause a decrease in neural network storage ability and lead to the creation of spurious attractors. Those attractors do not correspond to stored memories and attract a large amount of initial conditions: they were thus associated to reality distorsion observed in schizophrenia (14). Nevertheless, the behavior of these models are too simple to be directly compared with real physiological data. In fact, equilibrium attractors are hardly met in biological dynamics. More complex behaviors (such as oscillations or chaos) should thus to be taken into account. The study of chaotic behavior have lead to the development of numerical methods devoted to the analysis of complex time series (17). These methods may be used to characterise the dynamical processes at the time-scales of both the cerebral dynamics and the clinical symptoms variations. The application of these methods to physiological signals have shown that complex behaviors are related to healthy states whereas simple dynamics are related to pathology (8). These studies have thus confirmed the notion of "dynamical disease" (20, 21) which denotes pathological conditions characterised by changes in physiological rhythms. Depression has been studied within this framework (25, 32) in order to define possible changes in brain electrical rhythms related to this trouble and its evolution. It has been shown that controls' brain dynamics is more complex than depressive one and that the recovery of a complex brain activity depends on the number of previous episodes. In the case of the symptoms time evolution, several studies have demonstrated that non-linear dynamical process may be involved in the recurrence of symptoms in troubles such as manic-depressive illness (9) or schizophrenia (51). These observations can contribute to more parcimonious interpretation of the time course of these illnesses than usual theories. In the search of a relationship between brain dynamics and mental troubles, it has been shown in three depressed patients an important correlation between the characteristics of brain dynamics and the intensity of depressive mood (49). This preliminary observation is in accordance with the emergence hypothesis according which changes in neuronal dynamics should be related to changes in mental processes. We reviewed here some theoretical and experimental results related to the use of "physical" dynamical theory in the field of psychopathology. It has been argued that these applications go beyond metaphor and that they are empirically founded. Nevertheless, these studies only constitute first steps on the way of a cautious development and definition of a "dynamical paradigm" in psychopathology. The introduction of concepts from dynamics such as complexity and dynamical changes (i.e. bifurcations) permits a new perspective on function and dysfunction of the mind/brain and the time evolution of symptoms. Moreover, it offers a ground for the hypothesis of the emergence of mental properties on the basis of neuronal dynamics (42). Since this theory can help to throw light on classical problems in psychopathology, we consider that a precise examination of both its theoretical and empirical consequences is requested to define its validity on this topic.

APINetworks: A general API for the treatment of complex networks in arbitrary computational environments

NASA Astrophysics Data System (ADS)

Niño, Alfonso; Muñoz-Caro, Camelia; Reyes, Sebastián

2015-11-01

The last decade witnessed a great development of the structural and dynamic study of complex systems described as a network of elements. Therefore, systems can be described as a set of, possibly, heterogeneous entities or agents (the network nodes) interacting in, possibly, different ways (defining the network edges). In this context, it is of practical interest to model and handle not only static and homogeneous networks but also dynamic, heterogeneous ones. Depending on the size and type of the problem, these networks may require different computational approaches involving sequential, parallel or distributed systems with or without the use of disk-based data structures. In this work, we develop an Application Programming Interface (APINetworks) for the modeling and treatment of general networks in arbitrary computational environments. To minimize dependency between components, we decouple the network structure from its function using different packages for grouping sets of related tasks. The structural package, the one in charge of building and handling the network structure, is the core element of the system. In this work, we focus in this API structural component. We apply an object-oriented approach that makes use of inheritance and polymorphism. In this way, we can model static and dynamic networks with heterogeneous elements in the nodes and heterogeneous interactions in the edges. In addition, this approach permits a unified treatment of different computational environments. Tests performed on a C++11 version of the structural package show that, on current standard computers, the system can handle, in main memory, directed and undirected linear networks formed by tens of millions of nodes and edges. Our results compare favorably to those of existing tools.

Methods of information geometry in computational system biology (consistency between chemical and biological evolution).

PubMed

Astakhov, Vadim

2009-01-01

Interest in simulation of large-scale metabolic networks, species development, and genesis of various diseases requires new simulation techniques to accommodate the high complexity of realistic biological networks. Information geometry and topological formalisms are proposed to analyze information processes. We analyze the complexity of large-scale biological networks as well as transition of the system functionality due to modification in the system architecture, system environment, and system components. The dynamic core model is developed. The term dynamic core is used to define a set of causally related network functions. Delocalization of dynamic core model provides a mathematical formalism to analyze migration of specific functions in biosystems which undergo structure transition induced by the environment. The term delocalization is used to describe these processes of migration. We constructed a holographic model with self-poetic dynamic cores which preserves functional properties under those transitions. Topological constraints such as Ricci flow and Pfaff dimension were found for statistical manifolds which represent biological networks. These constraints can provide insight on processes of degeneration and recovery which take place in large-scale networks. We would like to suggest that therapies which are able to effectively implement estimated constraints, will successfully adjust biological systems and recover altered functionality. Also, we mathematically formulate the hypothesis that there is a direct consistency between biological and chemical evolution. Any set of causal relations within a biological network has its dual reimplementation in the chemistry of the system environment.

Process Network Approach to Understanding How Forest Ecosystems Adapt to Changes

NASA Astrophysics Data System (ADS)

Kim, J.; Yun, J.; Hong, J.; Kwon, H.; Chun, J.

2011-12-01

Sustainability challenges are transforming science and its role in society. Complex systems science has emerged as an inevitable field of education and research, which transcends disciplinary boundaries and focuses on understanding of the dynamics of complex social-ecological systems (SES). SES is a combined system of social and ecological components and drivers that interact and give rise to results, which could not be understood on the basis of sociological or ecological considerations alone. However, both systems may be viewed as a network of processes, and such a network hierarchy may serve as a hinge to bridge social and ecological systems. As a first step toward such effort, we attempted to delineate and interpret such process networks in forest ecosystems, which play a critical role in the cycles of carbon and water from local to global scales. These cycles and their variability, in turn, play an important role in the emergent and self-organizing interactions between forest ecosystems and their environment. Ruddell and Kumar (2009) define a process network as a network of feedback loops and the related time scales, which describe the magnitude and direction of the flow of energy, matter, and information between the different variables in a complex system. Observational evidence, based on micrometeorological eddy covariance measurements, suggests that heterogeneity and disturbances in forest ecosystems in monsoon East Asia may facilitate to build resilience for adaptation to change. Yet, the principles that characterize the role of variability in these interactions remain elusive. In this presentation, we report results from the analysis of multivariate ecohydrologic and biogeochemical time series data obtained from temperate forest ecosystems in East Asia based on information flow statistics.

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.

Fuzzy Edge Connectivity of Graphical Fuzzy State Space Model in Multi-connected System

NASA Astrophysics Data System (ADS)

Harish, Noor Ainy; Ismail, Razidah; Ahmad, Tahir

2010-11-01

Structured networks of interacting components illustrate complex structure in a direct or intuitive way. Graph theory provides a mathematical modeling for studying interconnection among elements in natural and man-made systems. On the other hand, directed graph is useful to define and interpret the interconnection structure underlying the dynamics of the interacting subsystem. Fuzzy theory provides important tools in dealing various aspects of complexity, imprecision and fuzziness of the network structure of a multi-connected system. Initial development for systems of Fuzzy State Space Model (FSSM) and a fuzzy algorithm approach were introduced with the purpose of solving the inverse problems in multivariable system. In this paper, fuzzy algorithm is adapted in order to determine the fuzzy edge connectivity between subsystems, in particular interconnected system of Graphical Representation of FSSM. This new approach will simplify the schematic diagram of interconnection of subsystems in a multi-connected system.

Automated adaptive inference of phenomenological dynamical models.

PubMed

Daniels, Bryan C; Nemenman, Ilya

2015-08-21

Dynamics of complex systems is often driven by large and intricate networks of microscopic interactions, whose sheer size obfuscates understanding. With limited experimental data, many parameters of such dynamics are unknown, and thus detailed, mechanistic models risk overfitting and making faulty predictions. At the other extreme, simple ad hoc models often miss defining features of the underlying systems. Here we develop an approach that instead constructs phenomenological, coarse-grained models of network dynamics that automatically adapt their complexity to the available data. Such adaptive models produce accurate predictions even when microscopic details are unknown. The approach is computationally tractable, even for a relatively large number of dynamical variables. Using simulated data, it correctly infers the phase space structure for planetary motion, avoids overfitting in a biological signalling system and produces accurate predictions for yeast glycolysis with tens of data points and over half of the interacting species unobserved.

Scale-free networks of the earth’s surface

NASA Astrophysics Data System (ADS)

Liu, Gang; He, Jing; Luo, Kaitian; Gao, Peichao; Ma, Lei

2016-06-01

Studying the structure of real complex systems is of paramount importance in science and engineering. Despite our understanding of lots of real systems, we hardly cognize our unique living environment — the earth. The structural complexity of the earth’s surface is, however, still unknown in detail. Here, we define the modeling of graph topology for the earth’s surface, using the satellite images of the earth’s surface under different spatial resolutions derived from Google Earth. We find that the graph topologies of the earth’s surface are scale-free networks regardless of the spatial resolutions. For different spatial resolutions, the exponents of power-law distributions and the modularity are both quite different; however, the average clustering coefficient is approximately equal to a constant. We explore the morphology study of the earth’s surface, which enables a comprehensive understanding of the morphological feature of the earth’s surface.

Automated adaptive inference of phenomenological dynamical models

PubMed Central

Daniels, Bryan C.; Nemenman, Ilya

2015-01-01

Dynamics of complex systems is often driven by large and intricate networks of microscopic interactions, whose sheer size obfuscates understanding. With limited experimental data, many parameters of such dynamics are unknown, and thus detailed, mechanistic models risk overfitting and making faulty predictions. At the other extreme, simple ad hoc models often miss defining features of the underlying systems. Here we develop an approach that instead constructs phenomenological, coarse-grained models of network dynamics that automatically adapt their complexity to the available data. Such adaptive models produce accurate predictions even when microscopic details are unknown. The approach is computationally tractable, even for a relatively large number of dynamical variables. Using simulated data, it correctly infers the phase space structure for planetary motion, avoids overfitting in a biological signalling system and produces accurate predictions for yeast glycolysis with tens of data points and over half of the interacting species unobserved. PMID:26293508

Reconstructing metabolic flux vectors from extreme pathways: defining the alpha-spectrum.

PubMed

Wiback, Sharon J; Mahadevan, Radhakrishnan; Palsson, Bernhard Ø

2003-10-07

The move towards genome-scale analysis of cellular functions has necessitated the development of analytical (in silico) methods to understand such large and complex biochemical reaction networks. One such method is extreme pathway analysis that uses stoichiometry and thermodynamic irreversibly to define mathematically unique, systemic metabolic pathways. These extreme pathways form the edges of a high-dimensional convex cone in the flux space that contains all the attainable steady state solutions, or flux distributions, for the metabolic network. By definition, any steady state flux distribution can be described as a nonnegative linear combination of the extreme pathways. To date, much effort has been focused on calculating, defining, and understanding these extreme pathways. However, little work has been performed to determine how these extreme pathways contribute to a given steady state flux distribution. This study represents an initial effort aimed at defining how physiological steady state solutions can be reconstructed from a network's extreme pathways. In general, there is not a unique set of nonnegative weightings on the extreme pathways that produce a given steady state flux distribution but rather a range of possible values. This range can be determined using linear optimization to maximize and minimize the weightings of a particular extreme pathway in the reconstruction, resulting in what we have termed the alpha-spectrum. The alpha-spectrum defines which extreme pathways can and cannot be included in the reconstruction of a given steady state flux distribution and to what extent they individually contribute to the reconstruction. It is shown that accounting for transcriptional regulatory constraints can considerably shrink the alpha-spectrum. The alpha-spectrum is computed and interpreted for two cases; first, optimal states of a skeleton representation of core metabolism that include transcriptional regulation, and second for human red blood cell metabolism under various physiological, non-optimal conditions.

A research on the application of software defined networking in satellite network architecture

NASA Astrophysics Data System (ADS)

Song, Huan; Chen, Jinqiang; Cao, Suzhi; Cui, Dandan; Li, Tong; Su, Yuxing

2017-10-01

Software defined network is a new type of network architecture, which decouples control plane and data plane of traditional network, has the feature of flexible configurations and is a direction of the next generation terrestrial Internet development. Satellite network is an important part of the space-ground integrated information network, while the traditional satellite network has the disadvantages of difficult network topology maintenance and slow configuration. The application of SDN technology in satellite network can solve these problems that traditional satellite network faces. At present, the research on the application of SDN technology in satellite network is still in the stage of preliminary study. In this paper, we start with introducing the SDN technology and satellite network architecture. Then we mainly introduce software defined satellite network architecture, as well as the comparison of different software defined satellite network architecture and satellite network virtualization. Finally, the present research status and development trend of SDN technology in satellite network are analyzed.

Influence of Gap-Filling to Generate Continuous Datasets on Process Network Analysis

NASA Astrophysics Data System (ADS)

Yun, J.; Kim, J.; Kim, S.; Chun, J.

2013-12-01

The interplay of environmental conditions, energy, matter, and information defines the context and constraints for the set of processes and structures that may emerge during self-organization in complex ecosystems. Following Ruddell and Kumar (2009), we have evaluated statistical measures of characterizing the organization of the information flow in ecohydrological process networks in a deciduous forest ecosystem. We used the time series data obtained in 2008 (normal year) from the KoFlux forest tower site in central Korea. The 30-minute averages of eddy fluxes of energy, water and CO2 were measured at 40m above an oak-dominated old deciduous forest along with other micrometeorological variables. In this analysis, we selected 13 variables: atmospheric pressure (Pa), net ecosystem CO2 exchange (NEE), gross primary productivity (GPP), ecosystem respiration (RE), latent heat flux (LE), precipitation (Precip), solar radiation (Rg), air temperature (T), vapor pressure deficit (VPD), sensible heat flux (H), canopy temperature (Tc), wind direction (WD), and wind speed (WS). Our results support that a process network approach can be used to formally resolve feedback, time scales, and subsystems that define the complex ecosystem's organization by considering mutual information and transfer entropy simultaneously. We also observed that the turbulent and atmospheric boundary layer subsystems are coupled through feedback loops, and form a regional self-organizing subsystem in August when the forest is in healthy environment. In particular, we noted that the observed feedback loops in the process network disappeared when the time series data were artificially gap-filled for missing data, which is a common practice in post-data processing. In this presentation, we report the influence of gap-filling on the process network analysis by artificially assigning different sizes and periods of missing data and discuss the implication of our results on validation and calibration of ecosystem models. Acknowledgment. This research was supported by the Korea Meteorological Administration Research and Development Program under Grant CATER 2013-3030.

Tagging and tracking individual networks within a complex mitochondrial web with photoactivatable GFP.

PubMed

Twig, Gilad; Graf, Solomon A; Wikstrom, Jakob D; Mohamed, Hibo; Haigh, Sarah E; Elorza, Alvaro; Deutsch, Motti; Zurgil, Naomi; Reynolds, Nicole; Shirihai, Orian S

2006-07-01

Assembly of mitochondria into networks supports fuel metabolism and calcium transport and is involved in the cellular response to apoptotic stimuli. A mitochondrial network is defined as a continuous matrix lumen whose boundaries limit molecular diffusion. Observation of individual networks has proven challenging in live cells that possess dense populations of mitochondria. Investigation into the electrical and morphological properties of mitochondrial networks has therefore not yielded consistent conclusions. In this study we used matrix-targeted, photoactivatable green fluorescent protein to tag single mitochondrial networks. This approach, coupled with real-time monitoring of mitochondrial membrane potential, permitted the examination of matrix lumen continuity and fusion and fission events over time. We found that adjacent and intertwined mitochondrial structures often represent a collection of distinct networks. We additionally found that all areas of a single network are invariably equipotential, suggesting that a heterogeneous pattern of membrane potential within a cell's mitochondria represents differences between discrete networks. Interestingly, fission events frequently occurred without any gross morphological changes and particularly without fragmentation. These events, which are invisible under standard confocal microscopy, redefine the mitochondrial network boundaries and result in electrically disconnected daughter units.

Optical network democratization.

PubMed

Nejabati, Reza; Peng, Shuping; Simeonidou, Dimitra

2016-03-06

The current Internet infrastructure is not able to support independent evolution and innovation at physical and network layer functionalities, protocols and services, while at same time supporting the increasing bandwidth demands of evolving and heterogeneous applications. This paper addresses this problem by proposing a completely democratized optical network infrastructure. It introduces the novel concepts of the optical white box and bare metal optical switch as key technology enablers for democratizing optical networks. These are programmable optical switches whose hardware is loosely connected internally and is completely separated from their control software. To alleviate their complexity, a multi-dimensional abstraction mechanism using software-defined network technology is proposed. It creates a universal model of the proposed switches without exposing their technological details. It also enables a conventional network programmer to develop network applications for control of the optical network without specific technical knowledge of the physical layer. Furthermore, a novel optical network virtualization mechanism is proposed, enabling the composition and operation of multiple coexisting and application-specific virtual optical networks sharing the same physical infrastructure. Finally, the optical white box and the abstraction mechanism are experimentally evaluated, while the virtualization mechanism is evaluated with simulation. © 2016 The Author(s).

Local Difference Measures between Complex Networks for Dynamical System Model Evaluation

PubMed Central

Lange, Stefan; Donges, Jonathan F.; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation. Building on a recent study by Feldhoff et al. [1] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system. Three types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node-weighted graphs are discussed. PMID:25856374

Local difference measures between complex networks for dynamical system model evaluation.

PubMed

Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node-weighted graphs are discussed.

The study of RMB exchange rate complex networks based on fluctuation mode

NASA Astrophysics Data System (ADS)

Yao, Can-Zhong; Lin, Ji-Nan; Zheng, Xu-Zhou; Liu, Xiao-Feng

2015-10-01

In the paper, we research on the characteristics of RMB exchange rate time series fluctuation with methods of symbolization and coarse gaining. First, based on fluctuation features of RMB exchange rate, we define the first type of fluctuation mode as one specific foreign currency against RMB in four days' fluctuating situations, and the second type as four different foreign currencies against RMB in one day's fluctuating situation. With the transforming method, we construct the unique-currency and multi-currency complex networks. Further, through analyzing the topological features including out-degree, betweenness centrality and clustering coefficient of fluctuation-mode complex networks, we find that the out-degree distribution of both types of fluctuation mode basically follows power-law distributions with exponents between 1 and 2. The further analysis reveals that the out-degree and the clustering coefficient generally obey the approximated negative correlation. With this result, we confirm previous observations showing that the RMB exchange rate exhibits a characteristic of long-range memory. Finally, we analyze the most probable transmission route of fluctuation modes, and provide probability prediction matrix. The transmission route for RMB exchange rate fluctuation modes exhibits the characteristics of partially closed loop, repeat and reversibility, which lays a solid foundation for predicting RMB exchange rate fluctuation patterns with large volume of data.

Topology of foreign exchange markets using hierarchical structure methods

NASA Astrophysics Data System (ADS)

Naylor, Michael J.; Rose, Lawrence C.; Moyle, Brendan J.

2007-08-01

This paper uses two physics derived hierarchical techniques, a minimal spanning tree and an ultrametric hierarchical tree, to extract a topological influence map for major currencies from the ultrametric distance matrix for 1995-2001. We find that these two techniques generate a defined and robust scale free network with meaningful taxonomy. The topology is shown to be robust with respect to method, to time horizon and is stable during market crises. This topology, appropriately used, gives a useful guide to determining the underlying economic or regional causal relationships for individual currencies and to understanding the dynamics of exchange rate price determination as part of a complex network.

Properties of language networks and language systems. Comment on "Approaching human language with complex networks" by Cong and Liu

NASA Astrophysics Data System (ADS)

Yu, Shuiyuan; Xu, Chunshan

2014-12-01

Language is generally considered a defining feature of human beings, a key medium for interpersonal communication, a fundamental tool for human thinking and an important vehicle for culture transmission. For the anthropoids to evolve into human being, the emergence of linguistic system is a vital step. Then, how can language serve functions so complicated and so important? To answer this question, it is necessary to probe into a central topic in linguistics: the structure of language, which has been inevitably involved in various fields of linguistic research-the functions of languages, the evolution of languages, the typology of languages, etc.

Noise Response Data Reveal Novel Controllability Gramian for Nonlinear Network Dynamics

PubMed Central

Kashima, Kenji

2016-01-01

Control of nonlinear large-scale dynamical networks, e.g., collective behavior of agents interacting via a scale-free connection topology, is a central problem in many scientific and engineering fields. For the linear version of this problem, the so-called controllability Gramian has played an important role to quantify how effectively the dynamical states are reachable by a suitable driving input. In this paper, we first extend the notion of the controllability Gramian to nonlinear dynamics in terms of the Gibbs distribution. Next, we show that, when the networks are open to environmental noise, the newly defined Gramian is equal to the covariance matrix associated with randomly excited, but uncontrolled, dynamical state trajectories. This fact theoretically justifies a simple Monte Carlo simulation that can extract effectively controllable subdynamics in nonlinear complex networks. In addition, the result provides a novel insight into the relationship between controllability and statistical mechanics. PMID:27264780

Programmable multimode quantum networks

PubMed Central

Armstrong, Seiji; Morizur, Jean-François; Janousek, Jiri; Hage, Boris; Treps, Nicolas; Lam, Ping Koy; Bachor, Hans-A.

2012-01-01

Entanglement between large numbers of quantum modes is the quintessential resource for future technologies such as the quantum internet. Conventionally, the generation of multimode entanglement in optics requires complex layouts of beamsplitters and phase shifters in order to transform the input modes into entangled modes. Here we report the highly versatile and efficient generation of various multimode entangled states with the ability to switch between different linear optics networks in real time. By defining our modes to be combinations of different spatial regions of one beam, we may use just one pair of multi-pixel detectors in order to measure multiple entangled modes. We programme virtual networks that are fully equivalent to the physical linear optics networks they are emulating. We present results for N=2 up to N=8 entangled modes here, including N=2, 3, 4 cluster states. Our approach introduces the highly sought after attributes of flexibility and scalability to multimode entanglement. PMID:22929783

Transition Characteristic Analysis of Traffic Evolution Process for Urban Traffic Network

PubMed Central

Chen, Hong; Li, Yang

2014-01-01

The characterization of the dynamics of traffic states remains fundamental to seeking for the solutions of diverse traffic problems. To gain more insights into traffic dynamics in the temporal domain, this paper explored temporal characteristics and distinct regularity in the traffic evolution process of urban traffic network. We defined traffic state pattern through clustering multidimensional traffic time series using self-organizing maps and construct a pattern transition network model that is appropriate for representing and analyzing the evolution progress. The methodology is illustrated by an application to data flow rate of multiple road sections from Network of Shenzhen's Nanshan District, China. Analysis and numerical results demonstrated that the methodology permits extracting many useful traffic transition characteristics including stability, preference, activity, and attractiveness. In addition, more information about the relationships between these characteristics was extracted, which should be helpful in understanding the complex behavior of the temporal evolution features of traffic patterns. PMID:24982969

Metabolic Pathways and Networks Associated with Tobacco Use in Military Personnel

PubMed Central

Jones, Dean P.; Walker, Douglas I.; Uppal, Karan; Rohrbeck, Patricia; Mallon, Timothy M.; Go, Young-Mi

2016-01-01

Objective Use high-resolution metabolomics (HRM) to identify metabolic pathways and networks associated with tobacco use in military personnel. Methods Four hundred de-identified samples obtained from the Department of Defense Serum Repository were classified as tobacco users or non-users according to cotinine content. HRM and bioinformatic methods were used to determine pathways and networks associated with classification. Results Eighty individuals were classified as tobacco users compared to 320 non-users based on cotinine levels ≥10 ng/mL. Alterations in lipid and xenobiotic metabolism, and diverse effects on amino acid, sialic acid and purine and pyrimidine metabolism were observed. Importantly, network analysis showed broad effects on metabolic associations not simply linked to well-defined pathways. Conclusions Tobacco use has complex metabolic effects which must be considered in evaluation of deployment-associated environmental exposures in military personnel. PMID:27501098

Topology Analysis of Social Networks Extracted from Literature

PubMed Central

2015-01-01

In a world where complex networks are an increasingly important part of science, it is interesting to question how the new reading of social realities they provide applies to our cultural background and in particular, popular culture. Are authors of successful novels able to reproduce social networks faithful to the ones found in reality? Is there any common trend connecting an author’s oeuvre, or a genre of fiction? Such an analysis could provide new insight on how we, as a culture, perceive human interactions and consume media. The purpose of the work presented in this paper is to define the signature of a novel’s story based on the topological analysis of its social network of characters. For this purpose, an automated tool was built that analyses the dialogs in novels, identifies characters and computes their relationships in a time-dependent manner in order to assess the network’s evolution over the course of the story. PMID:26039072

On Crowd-verification of Biological Networks

PubMed Central

Ansari, Sam; Binder, Jean; Boue, Stephanie; Di Fabio, Anselmo; Hayes, William; Hoeng, Julia; Iskandar, Anita; Kleiman, Robin; Norel, Raquel; O’Neel, Bruce; Peitsch, Manuel C.; Poussin, Carine; Pratt, Dexter; Rhrissorrakrai, Kahn; Schlage, Walter K.; Stolovitzky, Gustavo; Talikka, Marja

2013-01-01

Biological networks with a structured syntax are a powerful way of representing biological information generated from high density data; however, they can become unwieldy to manage as their size and complexity increase. This article presents a crowd-verification approach for the visualization and expansion of biological networks. Web-based graphical interfaces allow visualization of causal and correlative biological relationships represented using Biological Expression Language (BEL). Crowdsourcing principles enable participants to communally annotate these relationships based on literature evidences. Gamification principles are incorporated to further engage domain experts throughout biology to gather robust peer-reviewed information from which relationships can be identified and verified. The resulting network models will represent the current status of biological knowledge within the defined boundaries, here processes related to human lung disease. These models are amenable to computational analysis. For some period following conclusion of the challenge, the published models will remain available for continuous use and expansion by the scientific community. PMID:24151423

Metabolic Pathways and Networks Associated With Tobacco Use in Military Personnel.

PubMed

Jones, Dean P; Walker, Douglas I; Uppal, Karan; Rohrbeck, Patricia; Mallon, Col Timothy M; Go, Young-Mi

2016-08-01

The aim of this study is to use high-resolution metabolomics (HRM) to identify metabolic pathways and networks associated with tobacco use in military personnel. Four hundred deidentified samples obtained from the Department of Defense Serum Repository were classified as tobacco users or nonusers according to cotinine content. HRM and bioinformatic methods were used to determine pathways and networks associated with classification. Eighty individuals were classified as tobacco users compared with 320 nonusers on the basis of cotinine levels at least 10 ng/mL. Alterations in lipid and xenobiotic metabolism, and diverse effects on amino acid, sialic acid, and purine and pyrimidine metabolism were observed. Importantly, network analysis showed broad effects on metabolic associations not simply linked to well-defined pathways. Tobacco use has complex metabolic effects that must be considered in evaluation of deployment-associated environmental exposures in military personnel.

A New Stochastic Technique for Painlevé Equation-I Using Neural Network Optimized with Swarm Intelligence

PubMed Central

Raja, Muhammad Asif Zahoor; Khan, Junaid Ali; Ahmad, Siraj-ul-Islam; Qureshi, Ijaz Mansoor

2012-01-01

A methodology for solution of Painlevé equation-I is presented using computational intelligence technique based on neural networks and particle swarm optimization hybridized with active set algorithm. The mathematical model of the equation is developed with the help of linear combination of feed-forward artificial neural networks that define the unsupervised error of the model. This error is minimized subject to the availability of appropriate weights of the networks. The learning of the weights is carried out using particle swarm optimization algorithm used as a tool for viable global search method, hybridized with active set algorithm for rapid local convergence. The accuracy, convergence rate, and computational complexity of the scheme are analyzed based on large number of independents runs and their comprehensive statistical analysis. The comparative studies of the results obtained are made with MATHEMATICA solutions, as well as, with variational iteration method and homotopy perturbation method. PMID:22919371

Probing into the effectiveness of self-isolation policies in epidemic control

NASA Astrophysics Data System (ADS)

Crokidakis, Nuno; Duarte Queirós, Sílvio M.

2012-06-01

In this work, we inspect the reliability of controlling and quelling an epidemic disease mimicked by a susceptible-infected-susceptible (SIS) model defined on a complex network by means of current and implementable quarantine and isolation policies. Specifically, we consider that each individual in the network is originally linked to individuals of two types: members of the same household and acquaintances. The topology of this network evolves, taking into account a probability q that aims at representing the quarantine or isolation process in which the connection with acquaintances is severed according to standard policies of control of epidemics. Within current policies of self-isolation and standard infection rates, our results show that the propagation is either only controllable for hypothetical rates of compliance or not controllable at all.

Vulnerability and cosusceptibility determine the size of network cascades

DOE PAGES

Yang, Yang; Nishikawa, Takashi; Motter, Adilson E.

2017-01-27

In a network, a local disturbance can propagate and eventually cause a substantial part of the system to fail in cascade events that are easy to conceptualize but extraordinarily difficult to predict. Furthermore, we develop a statistical framework that can predict cascade size distributions by incorporating two ingredients only: the vulnerability of individual components and the cosusceptibility of groups of components (i.e., their tendency to fail together). Using cascades in power grids as a representative example, we show that correlations between component failures define structured and often surprisingly large groups of cosusceptible components. Aside from their implications for blackout studies,more » these results provide insights and a new modeling framework for understanding cascades in financial systems, food webs, and complex networks in general.« less

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.

Functional brain networks related to individual differences in human intelligence at rest.

PubMed

Hearne, Luke J; Mattingley, Jason B; Cocchi, Luca

2016-08-26

Intelligence is a fundamental ability that sets humans apart from other animal species. Despite its importance in defining human behaviour, the neural networks responsible for intelligence are not well understood. The dominant view from neuroimaging work suggests that intelligent performance on a range of tasks is underpinned by segregated interactions in a fronto-parietal network of brain regions. Here we asked whether fronto-parietal interactions associated with intelligence are ubiquitous, or emerge from more widespread associations in a task-free context. First we undertook an exploratory mapping of the existing literature on functional connectivity associated with intelligence. Next, to empirically test hypotheses derived from the exploratory mapping, we performed network analyses in a cohort of 317 unrelated participants from the Human Connectome Project. Our results revealed a novel contribution of across-network interactions between default-mode and fronto-parietal networks to individual differences in intelligence at rest. Specifically, we found that greater connectivity in the resting state was associated with higher intelligence scores. Our findings highlight the need to broaden the dominant fronto-parietal conceptualisation of intelligence to encompass more complex and context-specific network dynamics.

OpenFlow arbitrated programmable network channels for managing quantum metadata

DOE PAGES

Dasari, Venkat R.; Humble, Travis S.

2016-10-10

Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution. Demonstrating the integration of these new communication methods with existing network protocols, channels, and data forwarding mechanisms remains an open challenge. Software-defined networking (SDN) offers robust and flexible strategies for managing diverse network devices and uses. We adapt the principles of SDN to the deployment of quantum networks, which are composed from unique devices that operate according to the laws of quantum mechanics. We show how quantum metadata can be managed within a software-definedmore » network using the OpenFlow protocol, and we describe how OpenFlow management of classical optical channels is compatible with emerging quantum communication protocols. We next give an example specification of the metadata needed to manage and control quantum physical layer (QPHY) behavior and we extend the OpenFlow interface to accommodate this quantum metadata. Here, we conclude by discussing near-term experimental efforts that can realize SDN’s principles for quantum communication.« less

OpenFlow arbitrated programmable network channels for managing quantum metadata

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

Dasari, Venkat R.; Humble, Travis S.

Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution. Demonstrating the integration of these new communication methods with existing network protocols, channels, and data forwarding mechanisms remains an open challenge. Software-defined networking (SDN) offers robust and flexible strategies for managing diverse network devices and uses. We adapt the principles of SDN to the deployment of quantum networks, which are composed from unique devices that operate according to the laws of quantum mechanics. We show how quantum metadata can be managed within a software-definedmore » network using the OpenFlow protocol, and we describe how OpenFlow management of classical optical channels is compatible with emerging quantum communication protocols. We next give an example specification of the metadata needed to manage and control quantum physical layer (QPHY) behavior and we extend the OpenFlow interface to accommodate this quantum metadata. Here, we conclude by discussing near-term experimental efforts that can realize SDN’s principles for quantum communication.« less

A Simplified Algorithm for Statistical Investigation of Damage Spreading

NASA Astrophysics Data System (ADS)

Gecow, Andrzej

2009-04-01

On the way to simulating adaptive evolution of complex system describing a living object or human developed project, a fitness should be defined on node states or network external outputs. Feedbacks lead to circular attractors of these states or outputs which make it difficult to define a fitness. The main statistical effects of adaptive condition are the result of small change tendency and to appear, they only need a statistically correct size of damage initiated by evolutionary change of system. This observation allows to cut loops of feedbacks and in effect to obtain a particular statistically correct state instead of a long circular attractor which in the quenched model is expected for chaotic network with feedback. Defining fitness on such states is simple. We calculate only damaged nodes and only once. Such an algorithm is optimal for investigation of damage spreading i.e. statistical connections of structural parameters of initial change with the size of effected damage. It is a reversed-annealed method—function and states (signals) may be randomly substituted but connections are important and are preserved. The small damages important for adaptive evolution are correctly depicted in comparison to Derrida annealed approximation which expects equilibrium levels for large networks. The algorithm indicates these levels correctly. The relevant program in Pascal, which executes the algorithm for a wide range of parameters, can be obtained from the author.

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

Gecow, Andrzej

On the way to simulating adaptive evolution of complex system describing a living object or human developed project, a fitness should be defined on node states or network external outputs. Feedbacks lead to circular attractors of these states or outputs which make it difficult to define a fitness. The main statistical effects of adaptive condition are the result of small change tendency and to appear, they only need a statistically correct size of damage initiated by evolutionary change of system. This observation allows to cut loops of feedbacks and in effect to obtain a particular statistically correct state instead ofmore » a long circular attractor which in the quenched model is expected for chaotic network with feedback. Defining fitness on such states is simple. We calculate only damaged nodes and only once. Such an algorithm is optimal for investigation of damage spreading i.e. statistical connections of structural parameters of initial change with the size of effected damage. It is a reversed-annealed method--function and states (signals) may be randomly substituted but connections are important and are preserved. The small damages important for adaptive evolution are correctly depicted in comparison to Derrida annealed approximation which expects equilibrium levels for large networks. The algorithm indicates these levels correctly. The relevant program in Pascal, which executes the algorithm for a wide range of parameters, can be obtained from the author.« less

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.

Luminance- and Texture-Defined Information Processing in School-Aged Children with Autism

PubMed Central

Rivest, Jessica B.; Jemel, Boutheina; Bertone, Armando; McKerral, Michelle; Mottron, Laurent

2013-01-01

According to the complexity-specific hypothesis, the efficacy with which individuals with autism spectrum disorder (ASD) process visual information varies according to the extensiveness of the neural network required to process stimuli. Specifically, adults with ASD are less sensitive to texture-defined (or second-order) information, which necessitates the implication of several cortical visual areas. Conversely, the sensitivity to simple, luminance-defined (or first-order) information, which mainly relies on primary visual cortex (V1) activity, has been found to be either superior (static material) or intact (dynamic material) in ASD. It is currently unknown if these autistic perceptual alterations are present in childhood. In the present study, behavioural (threshold) and electrophysiological measures were obtained for static luminance- and texture-defined gratings presented to school-aged children with ASD and compared to those of typically developing children. Our behavioural and electrophysiological (P140) results indicate that luminance processing is likely unremarkable in autistic children. With respect to texture processing, there was no significant threshold difference between groups. However, unlike typical children, autistic children did not show reliable enhancements of brain activity (N230 and P340) in response to texture-defined gratings relative to luminance-defined gratings. This suggests reduced efficiency of neuro-integrative mechanisms operating at a perceptual level in autism. These results are in line with the idea that visual atypicalities mediated by intermediate-scale neural networks emerge before or during the school-age period in autism. PMID:24205355

Luminance- and texture-defined information processing in school-aged children with autism.

PubMed

Rivest, Jessica B; Jemel, Boutheina; Bertone, Armando; McKerral, Michelle; Mottron, Laurent

2013-01-01

According to the complexity-specific hypothesis, the efficacy with which individuals with autism spectrum disorder (ASD) process visual information varies according to the extensiveness of the neural network required to process stimuli. Specifically, adults with ASD are less sensitive to texture-defined (or second-order) information, which necessitates the implication of several cortical visual areas. Conversely, the sensitivity to simple, luminance-defined (or first-order) information, which mainly relies on primary visual cortex (V1) activity, has been found to be either superior (static material) or intact (dynamic material) in ASD. It is currently unknown if these autistic perceptual alterations are present in childhood. In the present study, behavioural (threshold) and electrophysiological measures were obtained for static luminance- and texture-defined gratings presented to school-aged children with ASD and compared to those of typically developing children. Our behavioural and electrophysiological (P140) results indicate that luminance processing is likely unremarkable in autistic children. With respect to texture processing, there was no significant threshold difference between groups. However, unlike typical children, autistic children did not show reliable enhancements of brain activity (N230 and P340) in response to texture-defined gratings relative to luminance-defined gratings. This suggests reduced efficiency of neuro-integrative mechanisms operating at a perceptual level in autism. These results are in line with the idea that visual atypicalities mediated by intermediate-scale neural networks emerge before or during the school-age period in autism.

Hierarchical sequencing of online social graphs

NASA Astrophysics Data System (ADS)

Andjelković, Miroslav; Tadić, Bosiljka; Maletić, Slobodan; Rajković, Milan

2015-10-01

In online communications, patterns of conduct of individual actors and use of emotions in the process can lead to a complex social graph exhibiting multilayered structure and mesoscopic communities. Using simplicial complexes representation of graphs, we investigate in-depth topology of the online social network constructed from MySpace dialogs which exhibits original community structure. A simulation of emotion spreading in this network leads to the identification of two emotion-propagating layers. Three topological measures are introduced, referred to as the structure vectors, which quantify graph's architecture at different dimension levels. Notably, structures emerging through shared links, triangles and tetrahedral faces, frequently occur and range from tree-like to maximal 5-cliques and their respective complexes. On the other hand, the structures which spread only negative or only positive emotion messages appear to have much simpler topology consisting of links and triangles. The node's structure vector represents the number of simplices at each topology level in which the node resides and the total number of such simplices determines what we define as the node's topological dimension. The presented results suggest that the node's topological dimension provides a suitable measure of the social capital which measures the actor's ability to act as a broker in compact communities, the so called Simmelian brokerage. We also generalize the results to a wider class of computer-generated networks. Investigating components of the node's vector over network layers reveals that same nodes develop different socio-emotional relations and that the influential nodes build social capital by combining their connections in different layers.

Definitions of Complexity are Notoriously Difficult

NASA Astrophysics Data System (ADS)

Schuster, Peter

Definitions of complexity are notoriously difficult if not impossible at all. A good working hypothesis might be: Everything is complex that is not simple. This is precisely the way in which we define nonlinear behavior. Things appear complex for different reasons: i) Complexity may result from lack of insight, ii) complexity may result from lack of methods, and (iii) complexity may be inherent to the system. The best known example for i) is celestial mechanics: The highly complex Pythagorean epicycles become obsolete by the introduction of Newton's law of universal gravitation. To give an example for ii), pattern formation and deterministic chaos became not really understandable before extensive computer simulations became possible. Cellular metabolism may serve as an example for iii) and is caused by the enormous complexity of biochemical reaction networks with up to one hundred individual reaction fluxes. Nevertheless, only few fluxes are dominant in the sense that using Pareto optimal values for them provides near optimal values for all the others...

An extensive assessment of network alignment algorithms for comparison of brain connectomes.

PubMed

Milano, Marianna; Guzzi, Pietro Hiram; Tymofieva, Olga; Xu, Duan; Hess, Christofer; Veltri, Pierangelo; Cannataro, Mario

2017-06-06

Recently the study of the complex system of connections in neural systems, i.e. the connectome, has gained a central role in neurosciences. The modeling and analysis of connectomes are therefore a growing area. Here we focus on the representation of connectomes by using graph theory formalisms. Macroscopic human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. The atlas-based parcellations present some known limitations in cases of early brain development and abnormal anatomy. Consequently, it has been recently proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space, as a way to deal with the unknown correspondences of the parcels. Such process requires modeling of the brain using graph theory and the subsequent comparison of the structure of graphs. The latter step may be modeled as a network alignment (NA) problem. In this work, we first define the problem formally, then we test six existing state of the art of network aligners on diffusion MRI-derived brain networks. We compare the performances of algorithms by assessing six topological measures. We also evaluated the robustness of algorithms to alterations of the dataset. The results confirm that NA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes. The analysis shows MAGNA++ is the best global alignment algorithm. The paper presented a new analysis methodology that uses network alignment for validating atlas-free parcellation brain connectomes. The methodology has been experimented on several brain datasets.

Prediction of Aerodynamic Coefficient using Genetic Algorithm Optimized Neural Network for Sparse Data

NASA Technical Reports Server (NTRS)

Rajkumar, T.; Bardina, Jorge; Clancy, Daniel (Technical Monitor)

2002-01-01

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic coefficients to an accuracy of 110% . In our problem, we would like to get an optimized neural network architecture and minimum data set. This has been accomplished within 500 training cycles of a neural network. After removing training pairs (outliers), the GA has produced much better results. The neural network constructed is a feed forward neural network with a back propagation learning mechanism. The main goal has been to free the network design process from constraints of human biases, and to discover better forms of neural network architectures. The automation of the network architecture search by genetic algorithms seems to have been the best way to achieve this goal.

A Comparative Analysis of Community Detection Algorithms on Artificial Networks

PubMed Central

Yang, Zhao; Algesheimer, René; Tessone, Claudio J.

2016-01-01

Many community detection algorithms have been developed to uncover the mesoscopic properties of complex networks. However how good an algorithm is, in terms of accuracy and computing time, remains still open. Testing algorithms on real-world network has certain restrictions which made their insights potentially biased: the networks are usually small, and the underlying communities are not defined objectively. In this study, we employ the Lancichinetti-Fortunato-Radicchi benchmark graph to test eight state-of-the-art algorithms. We quantify the accuracy using complementary measures and algorithms’ computing time. Based on simple network properties and the aforementioned results, we provide guidelines that help to choose the most adequate community detection algorithm for a given network. Moreover, these rules allow uncovering limitations in the use of specific algorithms given macroscopic network properties. Our contribution is threefold: firstly, we provide actual techniques to determine which is the most suited algorithm in most circumstances based on observable properties of the network under consideration. Secondly, we use the mixing parameter as an easily measurable indicator of finding the ranges of reliability of the different algorithms. Finally, we study the dependency with network size focusing on both the algorithm’s predicting power and the effective computing time. PMID:27476470

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.

User's Manual for the New England Water-Use Data System (NEWUDS)

USGS Publications Warehouse

Horn, Marilee A.

2003-01-01

Water is used in a variety of ways that need to be understood for effective management of water resources. Water-use activities need to be categorized and included in a database management system to understand current water uses and to provide information to water-resource management policy decisionmakers. The New England Water-Use Data System (NEWUDS) is a complex database developed to store water-use information that allows water to be tracked from a point of water-use activity (called a 'Site'), such as withdrawal from a resource (reservoir or aquifer), to a second Site, such as distribution to a user (business or irrigator). NEWUDS conceptual model consists of 10 core entities: system, owner, address, location, site, data source, resource, conveyance, transaction/rate, and alias, with tables available to store user-defined details. Three components--site (with both a From Site and a To Site), a conveyance that connects them, and a transaction/rate associated with the movement of water over a specific time interval form the core of the basic NEWUDS network model. The most important step in correctly translating real-world water-use activities into a storable format in NEWUDS depends on choosing the appropriate sites and linking them correctly in a network to model the flow of water from the initial From Site to the final To Site. Ten water-use networks representing real-world activities are described--three withdrawal networks, three return networks, two user networks, two complex community-system networks. Ten case studies of water use, one for each network, also are included in this manual to illustrate how to compile, store, and retrieve the appropriate data. The sequence of data entry into tables is critical because there are many foreign keys. The recommended core entity sequence is (1) system, (2) owner, (3) address, (4) location, (5) site, (6) data source, (7) resource, (8) conveyance, (9) transaction, and (10) rate; with (11) alias and (12) user-defined detail subject areas populated as needed. After each step in data entry, quality-assurance queries should be run to ensure the data are correctly entered so that it can be retrieved accurately. The point of data storage is retrieval. Several retrieval queries that focus on retrieving only relevant data to specific questions are presented in this manual as examples for the NEWUDS user.

Meta-path based heterogeneous combat network link prediction

NASA Astrophysics Data System (ADS)

Li, Jichao; Ge, Bingfeng; Yang, Kewei; Chen, Yingwu; Tan, Yuejin

2017-09-01

The combat system-of-systems in high-tech informative warfare, composed of many interconnected combat systems of different types, can be regarded as a type of complex heterogeneous network. Link prediction for heterogeneous combat networks (HCNs) is of significant military value, as it facilitates reconfiguring combat networks to represent the complex real-world network topology as appropriate with observed information. This paper proposes a novel integrated methodology framework called HCNMP (HCN link prediction based on meta-path) to predict multiple types of links simultaneously for an HCN. More specifically, the concept of HCN meta-paths is introduced, through which the HCNMP can accumulate information by extracting different features of HCN links for all the six defined types. Next, an HCN link prediction model, based on meta-path features, is built to predict all types of links of the HCN simultaneously. Then, the solution algorithm for the HCN link prediction model is proposed, in which the prediction results are obtained by iteratively updating with the newly predicted results until the results in the HCN converge or reach a certain maximum iteration number. Finally, numerical experiments on the dataset of a real HCN are conducted to demonstrate the feasibility and effectiveness of the proposed HCNMP, in comparison with 30 baseline methods. The results show that the performance of the HCNMP is superior to those of the baseline methods.

An improved least cost routing approach for WDM optical network without wavelength converters

NASA Astrophysics Data System (ADS)

Bonani, Luiz H.; Forghani-elahabad, Majid

2016-12-01

Routing and wavelength assignment (RWA) problem has been an attractive problem in optical networks, and consequently several algorithms have been proposed in the literature to solve this problem. The most known techniques for the dynamic routing subproblem are fixed routing, fixed-alternate routing, and adaptive routing methods. The first one leads to a high blocking probability (BP) and the last one includes a high computational complexity and requires immense backing from the control and management protocols. The second one suggests a trade-off between performance and complexity, and hence we consider it to improve in our work. In fact, considering the RWA problem in a wavelength routed optical network with no wavelength converter, an improved technique is proposed for the routing subproblem in order to decrease the BP of the network. Based on fixed-alternate approach, the first k shortest paths (SPs) between each node pair is determined. We then rearrange the SPs according to a newly defined cost for the links and paths. Upon arriving a connection request, the sorted paths are consecutively checked for an available wavelength according to the most-used technique. We implement our proposed algorithm and the least-hop fixed-alternate algorithm to show how the rearrangement of SPs contributes to a lower BP in the network. The numerical results demonstrate the efficiency of our proposed algorithm in comparison with the others, considering different number of available wavelengths.

Diffusion Geometry Unravels the Emergence of Functional Clusters in Collective Phenomena.

PubMed

De Domenico, Manlio

2017-04-21

Collective phenomena emerge from the interaction of natural or artificial units with a complex organization. The interplay between structural patterns and dynamics might induce functional clusters that, in general, are different from topological ones. In biological systems, like the human brain, the overall functionality is often favored by the interplay between connectivity and synchronization dynamics, with functional clusters that do not coincide with anatomical modules in most cases. In social, sociotechnical, and engineering systems, the quest for consensus favors the emergence of clusters. Despite the unquestionable evidence for mesoscale organization of many complex systems and the heterogeneity of their interconnectivity, a way to predict and identify the emergence of functional modules in collective phenomena continues to elude us. Here, we propose an approach based on random walk dynamics to define the diffusion distance between any pair of units in a networked system. Such a metric allows us to exploit the underlying diffusion geometry to provide a unifying framework for the intimate relationship between metastable synchronization, consensus, and random search dynamics in complex networks, pinpointing the functional mesoscale organization of synthetic and biological systems.

Impacts of complex behavioral responses on asymmetric interacting spreading dynamics in multiplex networks

PubMed Central

Liu, Quan-Hui; Wang, Wei; Tang, Ming; Zhang, Hai-Feng

2016-01-01

Information diffusion and disease spreading in communication-contact layered network are typically asymmetrically coupled with each other, in which disease spreading can be significantly affected by the way an individual being aware of disease responds to the disease. Many recent studies have demonstrated that human behavioral adoption is a complex and non-Markovian process, where the probability of behavior adoption is dependent on the cumulative times of information received and the social reinforcement effect of the cumulative information. In this paper, the impacts of such a non-Markovian vaccination adoption behavior on the epidemic dynamics and the control effects are explored. It is found that this complex adoption behavior in the communication layer can significantly enhance the epidemic threshold and reduce the final infection rate. By defining the social cost as the total cost of vaccination and treatment, it can be seen that there exists an optimal social reinforcement effect and optimal information transmission rate allowing the minimal social cost. Moreover, a mean-field theory is developed to verify the correctness of simulation results. PMID:27156574

Impacts of complex behavioral responses on asymmetric interacting spreading dynamics in multiplex networks.

PubMed

Liu, Quan-Hui; Wang, Wei; Tang, Ming; Zhang, Hai-Feng

2016-05-09

Information diffusion and disease spreading in communication-contact layered network are typically asymmetrically coupled with each other, in which disease spreading can be significantly affected by the way an individual being aware of disease responds to the disease. Many recent studies have demonstrated that human behavioral adoption is a complex and non-Markovian process, where the probability of behavior adoption is dependent on the cumulative times of information received and the social reinforcement effect of the cumulative information. In this paper, the impacts of such a non-Markovian vaccination adoption behavior on the epidemic dynamics and the control effects are explored. It is found that this complex adoption behavior in the communication layer can significantly enhance the epidemic threshold and reduce the final infection rate. By defining the social cost as the total cost of vaccination and treatment, it can be seen that there exists an optimal social reinforcement effect and optimal information transmission rate allowing the minimal social cost. Moreover, a mean-field theory is developed to verify the correctness of simulation results.

Diffusion Geometry Unravels the Emergence of Functional Clusters in Collective Phenomena

NASA Astrophysics Data System (ADS)

De Domenico, Manlio

2017-04-01

Collective phenomena emerge from the interaction of natural or artificial units with a complex organization. The interplay between structural patterns and dynamics might induce functional clusters that, in general, are different from topological ones. In biological systems, like the human brain, the overall functionality is often favored by the interplay between connectivity and synchronization dynamics, with functional clusters that do not coincide with anatomical modules in most cases. In social, sociotechnical, and engineering systems, the quest for consensus favors the emergence of clusters. Despite the unquestionable evidence for mesoscale organization of many complex systems and the heterogeneity of their interconnectivity, a way to predict and identify the emergence of functional modules in collective phenomena continues to elude us. Here, we propose an approach based on random walk dynamics to define the diffusion distance between any pair of units in a networked system. Such a metric allows us to exploit the underlying diffusion geometry to provide a unifying framework for the intimate relationship between metastable synchronization, consensus, and random search dynamics in complex networks, pinpointing the functional mesoscale organization of synthetic and biological systems.

The geometry of chaotic dynamics — a complex network perspective

NASA Astrophysics Data System (ADS)

Donner, R. V.; Heitzig, J.; Donges, J. F.; Zou, Y.; Marwan, N.; Kurths, J.

2011-12-01

Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques, recurrence-based concepts and prominently ɛ-recurrence networks, most faithfully represent the geometrical fine structure of the attractors underlying chaotic (and less interestingly non-chaotic) time series. In this paper we demonstrate that the well known graph theoretical properties local clustering coefficient and global (network) transitivity can meaningfully be exploited to define two new local and two new global measures of dimension in phase space: local upper and lower clustering dimension as well as global upper and lower transitivity dimension. Rigorous analytical as well as numerical results for self-similar sets and simple chaotic model systems suggest that these measures are well-behaved in most non-pathological situations and that they can be estimated reasonably well using ɛ-recurrence networks constructed from relatively short time series. Moreover, we study the relationship between clustering and transitivity dimensions on the one hand, and traditional measures like pointwise dimension or local Lyapunov dimension on the other hand. We also provide further evidence that the local clustering coefficients, or equivalently the local clustering dimensions, are useful for identifying unstable periodic orbits and other dynamically invariant objects from time series. Our results demonstrate that ɛ-recurrence networks exhibit an important link between dynamical systems and graph theory.

Hub Protein Controversy: Taking a Closer Look at Plant Stress Response Hubs

PubMed Central

Vandereyken, Katy; Van Leene, Jelle; De Coninck, Barbara; Cammue, Bruno P. A.

2018-01-01

Plant stress responses involve numerous changes at the molecular and cellular level and are regulated by highly complex signaling pathways. Studying protein-protein interactions (PPIs) and the resulting networks is therefore becoming increasingly important in understanding these responses. Crucial in PPI networks are the so-called hubs or hub proteins, commonly defined as the most highly connected central proteins in scale-free PPI networks. However, despite their importance, a growing amount of confusion and controversy seems to exist regarding hub protein identification, characterization and classification. In order to highlight these inconsistencies and stimulate further clarification, this review critically analyses the current knowledge on hub proteins in the plant interactome field. We focus on current hub protein definitions, including the properties generally seen as hub-defining, and the challenges and approaches associated with hub protein identification. Furthermore, we give an overview of the most important large-scale plant PPI studies of the last decade that identified hub proteins, pointing out the lack of overlap between different studies. As such, it appears that although major advances are being made in the plant interactome field, defining hub proteins is still heavily dependent on the quality, origin and interpretation of the acquired PPI data. Nevertheless, many hub proteins seem to have a reported role in the plant stress response, including transcription factors, protein kinases and phosphatases, ubiquitin proteasome system related proteins, (co-)chaperones and redox signaling proteins. A significant number of identified plant stress hubs are however still functionally uncharacterized, making them interesting targets for future research. This review clearly shows the ongoing improvements in the plant interactome field but also calls attention to the need for a more comprehensive and precise identification of hub proteins, allowing a more efficient systems biology driven unraveling of complex processes, including those involved in stress responses. PMID:29922309

Evaluating the core microbiota in complex communities: A systematic investigation.

PubMed

Astudillo-García, Carmen; Bell, James J; Webster, Nicole S; Glasl, Bettina; Jompa, Jamaluddin; Montoya, Jose M; Taylor, Michael W

2017-04-01

The study of complex microbial communities poses unique conceptual and analytical challenges, with microbial species potentially numbering in the thousands. With transient or allochthonous microorganisms often adding to this complexity, a 'core' microbiota approach, focusing only on the stable and permanent members of the community, is becoming increasingly popular. Given the various ways of defining a core microbiota, it is prudent to examine whether the definition of the core impacts upon the results obtained. Here we used complex marine sponge microbiotas and undertook a systematic evaluation of the degree to which different factors used to define the core influenced the conclusions. Significant differences in alpha- and beta-diversity were detected using some but not all core definitions. However, findings related to host specificity and environmental quality were largely insensitive to major changes in the core microbiota definition. Furthermore, none of the applied definitions altered our perception of the ecological networks summarising interactions among bacteria within the sponges. These results suggest that, while care should still be taken in interpretation, the core microbiota approach is surprisingly robust, at least for comparing microbiotas of closely related samples. © 2017 Society for Applied Microbiology and John Wiley & Sons Ltd.

Synthesis, Structure, and Physical Properties for a Series of Monomeric Iron(III) Hydroxo Complexes with Varying Hydrogen-Bond Networks

PubMed Central

Mukherjee, Jhumpa; Lucas, Robie L.; Zart, Matthew K.; Powell, Douglas R.; Day, Victor W.; Borovik, A. S.

2013-01-01

Mononuclear iron(III) complexes with terminal hydroxo ligands are proposed to be important species in several metalloproteins, but they have been difficult to isolate in synthetic systems. Using a series of amidate/ureido tripodal ligands, we have prepared and characterized monomeric FeIIIOH complexes with similar trigonal-bipyramidal primary coordination spheres. Three anionic nitrogen donors define the trigonal plane, and the hydroxo oxygen atom is trans to an apical amine nitrogen atom. The complexes have varied secondary coordination spheres that are defined by intramolecular hydrogen bonds between the FeIIIOH unit and the urea NH groups. Structural trends were observed between the number of hydrogen bonds and the Fe–Ohydroxo bond distances: the more intramolecular hydrogen bonds there were, the longer the Fe–O bond became. Spectroscopic trends were also found, including an increase in the energy of the O–H vibrations with a decrease in the number of hydrogen bonds. However, the FeIII/II reduction potentials were constant throughout the series (∼2.0 V vs [Cp2Fe]0/+1), which is ascribed to a balancing of the primary and secondary coordination-sphere effects. PMID:18498155

Efficient Reverse-Engineering of a Developmental Gene Regulatory Network

PubMed Central

Cicin-Sain, Damjan; Ashyraliyev, Maksat; Jaeger, Johannes

2012-01-01

Understanding the complex regulatory networks underlying development and evolution of multi-cellular organisms is a major problem in biology. Computational models can be used as tools to extract the regulatory structure and dynamics of such networks from gene expression data. This approach is called reverse engineering. It has been successfully applied to many gene networks in various biological systems. However, to reconstitute the structure and non-linear dynamics of a developmental gene network in its spatial context remains a considerable challenge. Here, we address this challenge using a case study: the gap gene network involved in segment determination during early development of Drosophila melanogaster. A major problem for reverse-engineering pattern-forming networks is the significant amount of time and effort required to acquire and quantify spatial gene expression data. We have developed a simplified data processing pipeline that considerably increases the throughput of the method, but results in data of reduced accuracy compared to those previously used for gap gene network inference. We demonstrate that we can infer the correct network structure using our reduced data set, and investigate minimal data requirements for successful reverse engineering. Our results show that timing and position of expression domain boundaries are the crucial features for determining regulatory network structure from data, while it is less important to precisely measure expression levels. Based on this, we define minimal data requirements for gap gene network inference. Our results demonstrate the feasibility of reverse-engineering with much reduced experimental effort. This enables more widespread use of the method in different developmental contexts and organisms. Such systematic application of data-driven models to real-world networks has enormous potential. Only the quantitative investigation of a large number of developmental gene regulatory networks will allow us to discover whether there are rules or regularities governing development and evolution of complex multi-cellular organisms. PMID:22807664

Minimal Model of Quantum Kinetic Clusters for the Energy-Transfer Network of a Light-Harvesting Protein Complex.

PubMed

Wu, Jianlan; Tang, Zhoufei; Gong, Zhihao; Cao, Jianshu; Mukamel, Shaul

2015-04-02

The energy absorbed in a light-harvesting protein complex is often transferred collectively through aggregated chromophore clusters. For population evolution of chromophores, the time-integrated effective rate matrix allows us to construct quantum kinetic clusters quantitatively and determine the reduced cluster-cluster transfer rates systematically, thus defining a minimal model of energy-transfer kinetics. For Fenna-Matthews-Olson (FMO) and light-havrvesting complex II (LCHII) monomers, quantum Markovian kinetics of clusters can accurately reproduce the overall energy-transfer process in the long-time scale. The dominant energy-transfer pathways are identified in the picture of aggregated clusters. The chromophores distributed extensively in various clusters can assist a fast and long-range energy transfer.

Genome network medicine: innovation to overcome huge challenges in cancer therapy.

PubMed

Roukos, Dimitrios H

2014-01-01

The post-ENCODE era shapes now a new biomedical research direction for understanding transcriptional and signaling networks driving gene expression and core cellular processes such as cell fate, survival, and apoptosis. Over the past half century, the Francis Crick 'central dogma' of single n gene/protein-phenotype (trait/disease) has defined biology, human physiology, disease, diagnostics, and drugs discovery. However, the ENCODE project and several other genomic studies using high-throughput sequencing technologies, computational strategies, and imaging techniques to visualize regulatory networks, provide evidence that transcriptional process and gene expression are regulated by highly complex dynamic molecular and signaling networks. This Focus article describes the linear experimentation-based limitations of diagnostics and therapeutics to cure advanced cancer and the need to move on from reductionist to network-based approaches. With evident a wide genomic heterogeneity, the power and challenges of next-generation sequencing (NGS) technologies to identify a patient's personal mutational landscape for tailoring the best target drugs in the individual patient are discussed. However, the available drugs are not capable of targeting aberrant signaling networks and research on functional transcriptional heterogeneity and functional genome organization is poorly understood. Therefore, the future clinical genome network medicine aiming at overcoming multiple problems in the new fields of regulatory DNA mapping, noncoding RNA, enhancer RNAs, and dynamic complexity of transcriptional circuitry are also discussed expecting in new innovation technology and strong appreciation of clinical data and evidence-based medicine. The problematic and potential solutions in the discovery of next-generation, molecular, and signaling circuitry-based biomarkers and drugs are explored. © 2013 Wiley Periodicals, Inc.

BrainNet Viewer: a network visualization tool for human brain connectomics.

PubMed

Xia, Mingrui; Wang, Jinhui; He, Yong

2013-01-01

The human brain is a complex system whose topological organization can be represented using connectomics. Recent studies have shown that human connectomes can be constructed using various neuroimaging technologies and further characterized using sophisticated analytic strategies, such as graph theory. These methods reveal the intriguing topological architectures of human brain networks in healthy populations and explore the changes throughout normal development and aging and under various pathological conditions. However, given the huge complexity of this methodology, toolboxes for graph-based network visualization are still lacking. Here, using MATLAB with a graphical user interface (GUI), we developed a graph-theoretical network visualization toolbox, called BrainNet Viewer, to illustrate human connectomes as ball-and-stick models. Within this toolbox, several combinations of defined files with connectome information can be loaded to display different combinations of brain surface, nodes and edges. In addition, display properties, such as the color and size of network elements or the layout of the figure, can be adjusted within a comprehensive but easy-to-use settings panel. Moreover, BrainNet Viewer draws the brain surface, nodes and edges in sequence and displays brain networks in multiple views, as required by the user. The figure can be manipulated with certain interaction functions to display more detailed information. Furthermore, the figures can be exported as commonly used image file formats or demonstration video for further use. BrainNet Viewer helps researchers to visualize brain networks in an easy, flexible and quick manner, and this software is freely available on the NITRC website (www.nitrc.org/projects/bnv/).

Learning about knowledge: A complex network approach

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

Fontoura Costa, Luciano da

2006-08-15

An approach to modeling knowledge acquisition in terms of walks along complex networks is described. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchicalmore » networks--i.e., networks composed of successive interconnected layers--are related to compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks--i.e., unreachable nodes--the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barabasi-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaus of knowledge stagnation in the case of the preferential movement strategy in the presence of conditional edges.« less

Artificial Neural Network approach to develop unique Classification and Raga identification tools for Pattern Recognition in Carnatic Music

NASA Astrophysics Data System (ADS)

Srimani, P. K.; Parimala, Y. G.

2011-12-01

A unique approach has been developed to study patterns in ragas of Carnatic Classical music based on artificial neural networks. Ragas in Carnatic music which have found their roots in the Vedic period, have grown on a Scientific foundation over thousands of years. However owing to its vastness and complexities it has always been a challenge for scientists and musicologists to give an all encompassing perspective both qualitatively and quantitatively. Cognition, comprehension and perception of ragas in Indian classical music have always been the subject of intensive research, highly intriguing and many facets of these are hitherto not unravelled. This paper is an attempt to view the melakartha ragas with a cognitive perspective using artificial neural network based approach which has given raise to very interesting results. The 72 ragas of the melakartha system were defined through the combination of frequencies occurring in each of them. The data sets were trained using several neural networks. 100% accurate pattern recognition and classification was obtained using linear regression, TLRN, MLP and RBF networks. Performance of the different network topologies, by varying various network parameters, were compared. Linear regression was found to be the best performing network.

Multiwavelet packet entropy and its application in transmission line fault recognition and classification.

PubMed

Liu, Zhigang; Han, Zhiwei; Zhang, Yang; Zhang, Qiaoge

2014-11-01

Multiwavelets possess better properties than traditional wavelets. Multiwavelet packet transformation has more high-frequency information. Spectral entropy can be applied as an analysis index to the complexity or uncertainty of a signal. This paper tries to define four multiwavelet packet entropies to extract the features of different transmission line faults, and uses a radial basis function (RBF) neural network to recognize and classify 10 fault types of power transmission lines. First, the preprocessing and postprocessing problems of multiwavelets are presented. Shannon entropy and Tsallis entropy are introduced, and their difference is discussed. Second, multiwavelet packet energy entropy, time entropy, Shannon singular entropy, and Tsallis singular entropy are defined as the feature extraction methods of transmission line fault signals. Third, the plan of transmission line fault recognition using multiwavelet packet entropies and an RBF neural network is proposed. Finally, the experimental results show that the plan with the four multiwavelet packet energy entropies defined in this paper achieves better performance in fault recognition. The performance with SA4 (symmetric antisymmetric) multiwavelet packet Tsallis singular entropy is the best among the combinations of different multiwavelet packets and the four multiwavelet packet entropies.

Networks of energetic and metabolic interactions define dynamics in microbial communities.

PubMed

Embree, Mallory; Liu, Joanne K; Al-Bassam, Mahmoud M; Zengler, Karsten

2015-12-15

Microorganisms form diverse communities that have a profound impact on the environment and human health. Recent technological advances have enabled elucidation of community diversity at high resolution. Investigation of microbial communities has revealed that they often contain multiple members with complementing and seemingly redundant metabolic capabilities. An understanding of the communal impacts of redundant metabolic capabilities is currently lacking; specifically, it is not known whether metabolic redundancy will foster competition or motivate cooperation. By investigating methanogenic populations, we identified the multidimensional interspecies interactions that define composition and dynamics within syntrophic communities that play a key role in the global carbon cycle. Species-specific genomes were extracted from metagenomic data using differential coverage binning. We used metabolic modeling leveraging metatranscriptomic information to reveal and quantify a complex intertwined system of syntrophic relationships. Our results show that amino acid auxotrophies create additional interdependencies that define community composition and control carbon and energy flux through the system while simultaneously contributing to overall community robustness. Strategic use of antimicrobials further reinforces this intricate interspecies network. Collectively, our study reveals the multidimensional interactions in syntrophic communities that promote high species richness and bolster community stability during environmental perturbations.

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

The function of neurocognitive networks. Comment on “Understanding brain networks and brain organization” by Pessoa

NASA Astrophysics Data System (ADS)

Bressler, Steven L.

2014-09-01

Pessoa [5] has performed a valuable service by reviewing the extant literature on brain networks and making a number of interesting proposals about their cognitive function. The term function is at the core of understanding the brain networks of cognition, or neurocognitive networks (NCNs) [1]. The great Russian neuropsychologist, Luria [4], defined brain function as the common task executed by a distributed brain network of complex dynamic structures united by the demands of cognition. Casting Luria in a modern light, we can say that function emerges from the interactions of brain regions in NCNs as they dynamically self-organize according to cognitive demands. Pessoa rightly details the mapping between brain function and structure, emphasizing both its pluripotency (one structure having multiple functions) and degeneracy (many structures having the same function). However, he fails to consider the potential importance of a one-to-one mapping between NCNs and function. If NCNs are uniquely composed of specific collections of brain areas, then each NCN has a unique function determined by that composition.

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 for a network disorder: The emerging role of graph theory in the study of epilepsy.

PubMed

Bernhardt, Boris C; Bonilha, Leonardo; Gross, Donald W

2015-09-01

Recent years have witnessed a paradigm shift in the study and conceptualization of epilepsy, which is increasingly understood as a network-level disorder. An emblematic case is temporal lobe epilepsy (TLE), the most common drug-resistant epilepsy that is electroclinically defined as a focal epilepsy and pathologically associated with hippocampal sclerosis. In this review, we will summarize histopathological, electrophysiological, and neuroimaging evidence supporting the concept that the substrate of TLE is not limited to the hippocampus alone, but rather is broadly distributed across multiple brain regions and interconnecting white matter pathways. We will introduce basic concepts of graph theory, a formalism to quantify topological properties of complex systems that has recently been widely applied to study networks derived from brain imaging and electrophysiology. We will discuss converging graph theoretical evidence indicating that networks in TLE show marked shifts in their overall topology, providing insight into the neurobiology of TLE as a network-level disorder. Our review will conclude by discussing methodological challenges and future clinical applications of this powerful analytical approach. Copyright © 2015 Elsevier Inc. All rights reserved.

Patient-powered research networks aim to improve patient care and health research.

PubMed

Fleurence, Rachael L; Beal, Anne C; Sheridan, Susan E; Johnson, Lorraine B; Selby, Joe V

2014-07-01

The era of big data, loosely defined as the development and analysis of large or complex data sets, brings new opportunities to empower patients and their families to generate, collect, and use their health information for both clinical and research purposes. In 2013 the Patient-Centered Outcomes Research Institute launched a large national research network, PCORnet, that includes both clinical and patient-powered research networks. This article describes these networks, their potential uses, and the challenges they face. The networks are engaging patients, family members, and caregivers in four key ways: contributing data securely, with privacy protected; including diverse and representative groups of patients in research; prioritizing research questions, participating in research, and disseminating results; and participating in the leadership and governance of patient-powered research networks. If technical, regulatory, and organizational challenges can be overcome, PCORnet will allow research to be conducted more efficiently and cost-effectively and results to be disseminated quickly back to patients, clinicians, and delivery systems to improve patient health. Project HOPE—The People-to-People Health Foundation, Inc.

Dynamic social networks based on movement

USGS Publications Warehouse

Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.

2016-01-01

Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.

A Unified Algebraic and Logic-Based Framework Towards Safe Routing Implementations

DTIC Science & Technology

2015-08-13

Software - defined Networks ( SDN ). We developed a declarative platform for implementing SDN protocols using declarative...and debugging several SDN applications. Example-based SDN synthesis. Recent emergence of software - defined networks offers an opportunity to design...domain of Software - defined Networks ( SDN ). We developed a declarative platform for implementing SDN protocols using declarative networking

Interests diffusion in social networks

NASA Astrophysics Data System (ADS)

D'Agostino, Gregorio; D'Antonio, Fulvio; De Nicola, Antonio; Tucci, Salvatore

2015-10-01

We provide a model for diffusion of interests in Social Networks (SNs). We demonstrate that the topology of the SN plays a crucial role in the dynamics of the individual interests. Understanding cultural phenomena on SNs and exploiting the implicit knowledge about their members is attracting the interest of different research communities both from the academic and the business side. The community of complexity science is devoting significant efforts to define laws, models, and theories, which, based on acquired knowledge, are able to predict future observations (e.g. success of a product). In the mean time, the semantic web community aims at engineering a new generation of advanced services by defining constructs, models and methods, adding a semantic layer to SNs. In this context, a leapfrog is expected to come from a hybrid approach merging the disciplines above. Along this line, this work focuses on the propagation of individual interests in social networks. The proposed framework consists of the following main components: a method to gather information about the members of the social networks; methods to perform some semantic analysis of the Domain of Interest; a procedure to infer members' interests; and an interests evolution theory to predict how the interests propagate in the network. As a result, one achieves an analytic tool to measure individual features, such as members' susceptibilities and authorities. Although the approach applies to any type of social network, here it is has been tested against the computer science research community. The DBLP (Digital Bibliography and Library Project) database has been elected as test-case since it provides the most comprehensive list of scientific production in this field.

Target Control in Logical Models Using the Domain of Influence of Nodes.

PubMed

Yang, Gang; Gómez Tejeda Zañudo, Jorge; Albert, Réka

2018-01-01

Dynamical models of biomolecular networks are successfully used to understand the mechanisms underlying complex diseases and to design therapeutic strategies. Network control and its special case of target control, is a promising avenue toward developing disease therapies. In target control it is assumed that a small subset of nodes is most relevant to the system's state and the goal is to drive the target nodes into their desired states. An example of target control would be driving a cell to commit to apoptosis (programmed cell death). From the experimental perspective, gene knockout, pharmacological inhibition of proteins, and providing sustained external signals are among practical intervention techniques. We identify methodologies to use the stabilizing effect of sustained interventions for target control in Boolean network models of biomolecular networks. Specifically, we define the domain of influence (DOI) of a node (in a certain state) to be the nodes (and their corresponding states) that will be ultimately stabilized by the sustained state of this node regardless of the initial state of the system. We also define the related concept of the logical domain of influence (LDOI) of a node, and develop an algorithm for its identification using an auxiliary network that incorporates the regulatory logic. This way a solution to the target control problem is a set of nodes whose DOI can cover the desired target node states. We perform greedy randomized adaptive search in node state space to find such solutions. We apply our strategy to in silico biological network models of real systems to demonstrate its effectiveness.

GARNET--gene set analysis with exploration of annotation relations.

PubMed

Rho, Kyoohyoung; Kim, Bumjin; Jang, Youngjun; Lee, Sanghyun; Bae, Taejeong; Seo, Jihae; Seo, Chaehwa; Lee, Jihyun; Kang, Hyunjung; Yu, Ungsik; Kim, Sunghoon; Lee, Sanghyuk; Kim, Wan Kyu

2011-02-15

Gene set analysis is a powerful method of deducing biological meaning for an a priori defined set of genes. Numerous tools have been developed to test statistical enrichment or depletion in specific pathways or gene ontology (GO) terms. Major difficulties towards biological interpretation are integrating diverse types of annotation categories and exploring the relationships between annotation terms of similar information. GARNET (Gene Annotation Relationship NEtwork Tools) is an integrative platform for gene set analysis with many novel features. It includes tools for retrieval of genes from annotation database, statistical analysis & visualization of annotation relationships, and managing gene sets. In an effort to allow access to a full spectrum of amassed biological knowledge, we have integrated a variety of annotation data that include the GO, domain, disease, drug, chromosomal location, and custom-defined annotations. Diverse types of molecular networks (pathways, transcription and microRNA regulations, protein-protein interaction) are also included. The pair-wise relationship between annotation gene sets was calculated using kappa statistics. GARNET consists of three modules--gene set manager, gene set analysis and gene set retrieval, which are tightly integrated to provide virtually automatic analysis for gene sets. A dedicated viewer for annotation network has been developed to facilitate exploration of the related annotations. GARNET (gene annotation relationship network tools) is an integrative platform for diverse types of gene set analysis, where complex relationships among gene annotations can be easily explored with an intuitive network visualization tool (http://garnet.isysbio.org/ or http://ercsb.ewha.ac.kr/garnet/).

M-Split: A Graphical User Interface to Analyze Multilayered Anisotropy from Shear Wave Splitting

NASA Astrophysics Data System (ADS)

Abgarmi, Bizhan; Ozacar, A. Arda

2017-04-01

Shear wave splitting analysis are commonly used to infer deep anisotropic structure. For simple cases, obtained delay times and fast-axis orientations are averaged from reliable results to define anisotropy beneath recording seismic stations. However, splitting parameters show systematic variations with back azimuth in the presence of complex anisotropy and cannot be represented by average time delay and fast axis orientation. Previous researchers had identified anisotropic complexities at different tectonic settings and applied various approaches to model them. Most commonly, such complexities are modeled by using multiple anisotropic layers with priori constraints from geologic data. In this study, a graphical user interface called M-Split is developed to easily process and model multilayered anisotropy with capabilities to properly address the inherited non-uniqueness. M-Split program runs user defined grid searches through the model parameter space for two-layer anisotropy using formulation of Silver and Savage (1994) and creates sensitivity contour plots to locate local maximas and analyze all possible models with parameter tradeoffs. In order to minimize model ambiguity and identify the robust model parameters, various misfit calculation procedures are also developed and embedded to M-Split which can be used depending on the quality of the observations and their back-azimuthal coverage. Case studies carried out to evaluate the reliability of the program using real noisy data and for this purpose stations from two different networks are utilized. First seismic network is the Kandilli Observatory and Earthquake research institute (KOERI) which includes long term running permanent stations and second network comprises seismic stations deployed temporary as part of the "Continental Dynamics-Central Anatolian Tectonics (CD-CAT)" project funded by NSF. It is also worth to note that M-Split is designed as open source program which can be modified by users for additional capabilities or for other applications.

Detection of core-periphery structure in networks based on 3-tuple motifs

NASA Astrophysics Data System (ADS)

Ma, Chuang; Xiang, Bing-Bing; Chen, Han-Shuang; Small, Michael; Zhang, Hai-Feng

2018-05-01

Detecting mesoscale structure, such as community structure, is of vital importance for analyzing complex networks. Recently, a new mesoscale structure, core-periphery (CP) structure, has been identified in many real-world systems. In this paper, we propose an effective algorithm for detecting CP structure based on a 3-tuple motif. In this algorithm, we first define a 3-tuple motif in terms of the patterns of edges as well as the property of nodes, and then a motif adjacency matrix is constructed based on the 3-tuple motif. Finally, the problem is converted to find a cluster that minimizes the smallest motif conductance. Our algorithm works well in different CP structures: including single or multiple CP structure, and local or global CP structures. Results on the synthetic and the empirical networks validate the high performance of our method.

Protein-protein interaction analysis of Alzheimer`s disease and NAFLD based on systems biology methods unhide common ancestor pathways.

PubMed

Karbalaei, Reza; Allahyari, Marzieh; Rezaei-Tavirani, Mostafa; Asadzadeh-Aghdaei, Hamid; Zali, Mohammad Reza

2018-01-01

Analysis reconstruction networks from two diseases, NAFLD and Alzheimer`s diseases and their relationship based on systems biology methods. NAFLD and Alzheimer`s diseases are two complex diseases, with progressive prevalence and high cost for countries. There are some reports on relation and same spreading pathways of these two diseases. In addition, they have some similar risk factors, exclusively lifestyle such as feeding, exercises and so on. Therefore, systems biology approach can help to discover their relationship. DisGeNET and STRING databases were sources of disease genes and constructing networks. Three plugins of Cytoscape software, including ClusterONE, ClueGO and CluePedia, were used to analyze and cluster networks and enrichment of pathways. An R package used to define best centrality method. Finally, based on degree and Betweenness, hubs and bottleneck nodes were defined. Common genes between NAFLD and Alzheimer`s disease were 190 genes that used construct a network with STRING database. The resulting network contained 182 nodes and 2591 edges and comprises from four clusters. Enrichment of these clusters separately lead to carbohydrate metabolism, long chain fatty acid and regulation of JAK-STAT and IL-17 signaling pathways, respectively. Also seven genes selected as hub-bottleneck include: IL6, AKT1, TP53, TNF, JUN, VEGFA and PPARG. Enrichment of these proteins and their first neighbors in network by OMIM database lead to diabetes and obesity as ancestors of NAFLD and AD. Systems biology methods, specifically PPI networks, can be useful for analyzing complicated related diseases. Finding Hub and bottleneck proteins should be the goal of drug designing and introducing disease markers.

Characterization and Compensation of Network-Level Anomalies in Mixed-Signal Neuromorphic Modeling Platforms

PubMed Central

Petrovici, Mihai A.; Vogginger, Bernhard; Müller, Paul; Breitwieser, Oliver; Lundqvist, Mikael; Muller, Lyle; Ehrlich, Matthias; Destexhe, Alain; Lansner, Anders; Schüffny, René; Schemmel, Johannes; Meier, Karlheinz

2014-01-01

Advancing the size and complexity of neural network models leads to an ever increasing demand for computational resources for their simulation. Neuromorphic devices offer a number of advantages over conventional computing architectures, such as high emulation speed or low power consumption, but this usually comes at the price of reduced configurability and precision. In this article, we investigate the consequences of several such factors that are common to neuromorphic devices, more specifically limited hardware resources, limited parameter configurability and parameter variations due to fixed-pattern noise and trial-to-trial variability. Our final aim is to provide an array of methods for coping with such inevitable distortion mechanisms. As a platform for testing our proposed strategies, we use an executable system specification (ESS) of the BrainScaleS neuromorphic system, which has been designed as a universal emulation back-end for neuroscientific modeling. We address the most essential limitations of this device in detail and study their effects on three prototypical benchmark network models within a well-defined, systematic workflow. For each network model, we start by defining quantifiable functionality measures by which we then assess the effects of typical hardware-specific distortion mechanisms, both in idealized software simulations and on the ESS. For those effects that cause unacceptable deviations from the original network dynamics, we suggest generic compensation mechanisms and demonstrate their effectiveness. Both the suggested workflow and the investigated compensation mechanisms are largely back-end independent and do not require additional hardware configurability beyond the one required to emulate the benchmark networks in the first place. We hereby provide a generic methodological environment for configurable neuromorphic devices that are targeted at emulating large-scale, functional neural networks. PMID:25303102

A Functionally Conserved Gene Regulatory Network Module Governing Olfactory Neuron Diversity.

PubMed

Li, Qingyun; Barish, Scott; Okuwa, Sumie; Maciejewski, Abigail; Brandt, Alicia T; Reinhold, Dominik; Jones, Corbin D; Volkan, Pelin Cayirlioglu

2016-01-01

Sensory neuron diversity is required for organisms to decipher complex environmental cues. In Drosophila, the olfactory environment is detected by 50 different olfactory receptor neuron (ORN) classes that are clustered in combinations within distinct sensilla subtypes. Each sensilla subtype houses stereotypically clustered 1-4 ORN identities that arise through asymmetric divisions from a single multipotent sensory organ precursor (SOP). How each class of SOPs acquires a unique differentiation potential that accounts for ORN diversity is unknown. Previously, we reported a critical component of SOP diversification program, Rotund (Rn), increases ORN diversity by generating novel developmental trajectories from existing precursors within each independent sensilla type lineages. Here, we show that Rn, along with BarH1/H2 (Bar), Bric-à-brac (Bab), Apterous (Ap) and Dachshund (Dac), constitutes a transcription factor (TF) network that patterns the developing olfactory tissue. This network was previously shown to pattern the segmentation of the leg, which suggests that this network is functionally conserved. In antennal imaginal discs, precursors with diverse ORN differentiation potentials are selected from concentric rings defined by unique combinations of these TFs along the proximodistal axis of the developing antennal disc. The combinatorial code that demarcates each precursor field is set up by cross-regulatory interactions among different factors within the network. Modifications of this network lead to predictable changes in the diversity of sensilla subtypes and ORN pools. In light of our data, we propose a molecular map that defines each unique SOP fate. Our results highlight the importance of the early prepatterning gene regulatory network as a modulator of SOP and terminally differentiated ORN diversity. Finally, our model illustrates how conserved developmental strategies are used to generate neuronal diversity.

Characterization and compensation of network-level anomalies in mixed-signal neuromorphic modeling platforms.

PubMed

Petrovici, Mihai A; Vogginger, Bernhard; Müller, Paul; Breitwieser, Oliver; Lundqvist, Mikael; Muller, Lyle; Ehrlich, Matthias; Destexhe, Alain; Lansner, Anders; Schüffny, René; Schemmel, Johannes; Meier, Karlheinz

2014-01-01

Advancing the size and complexity of neural network models leads to an ever increasing demand for computational resources for their simulation. Neuromorphic devices offer a number of advantages over conventional computing architectures, such as high emulation speed or low power consumption, but this usually comes at the price of reduced configurability and precision. In this article, we investigate the consequences of several such factors that are common to neuromorphic devices, more specifically limited hardware resources, limited parameter configurability and parameter variations due to fixed-pattern noise and trial-to-trial variability. Our final aim is to provide an array of methods for coping with such inevitable distortion mechanisms. As a platform for testing our proposed strategies, we use an executable system specification (ESS) of the BrainScaleS neuromorphic system, which has been designed as a universal emulation back-end for neuroscientific modeling. We address the most essential limitations of this device in detail and study their effects on three prototypical benchmark network models within a well-defined, systematic workflow. For each network model, we start by defining quantifiable functionality measures by which we then assess the effects of typical hardware-specific distortion mechanisms, both in idealized software simulations and on the ESS. For those effects that cause unacceptable deviations from the original network dynamics, we suggest generic compensation mechanisms and demonstrate their effectiveness. Both the suggested workflow and the investigated compensation mechanisms are largely back-end independent and do not require additional hardware configurability beyond the one required to emulate the benchmark networks in the first place. We hereby provide a generic methodological environment for configurable neuromorphic devices that are targeted at emulating large-scale, functional neural networks.

A source-controlled data center network model.

PubMed

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS.

A source-controlled data center network model

PubMed Central

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS. PMID:28328925

Proteome-scale human interactomics

PubMed Central

Luck, Katja; Sheynkman, Gloria M.; Zhang, Ivy; Vidal, Marc

2017-01-01

Cellular functions are mediated by complex interactome networks of physical, biochemical, and functional interactions between DNA sequences, RNA molecules, proteins, lipids, and small metabolites. A thorough understanding of cellular organization requires accurate and relatively complete models of interactome networks at proteome-scale. The recent publication of four human protein-protein interaction (PPI) maps represents a technological breakthrough and an unprecedented resource for the scientific community, heralding a new era of proteome-scale human interactomics. Our knowledge gained from these and complementary studies provides fresh insights into the opportunities and challenges when analyzing systematically generated interactome data, defines a clear roadmap towards the generation of a first reference interactome, and reveals new perspectives on the organization of cellular life. PMID:28284537

A Generic Framework of Performance Measurement in Networked Enterprises

NASA Astrophysics Data System (ADS)

Kim, Duk-Hyun; Kim, Cheolhan

Performance measurement (PM) is essential for managing networked enterprises (NEs) because it greatly affects the effectiveness of collaboration among members of NE.PM in NE requires somewhat different approaches from PM in a single enterprise because of heterogeneity, dynamism, and complexity of NE’s. This paper introduces a generic framework of PM in NE (we call it NEPM) based on the Balanced Scorecard (BSC) approach. In NEPM key performance indicators and cause-and-effect relationships among them are defined in a generic strategy map. NEPM could be applied to various types of NEs after specializing KPIs and relationships among them. Effectiveness of NEPM is shown through a case study of some Korean NEs.

Permitted and forbidden sets in symmetric threshold-linear networks.

PubMed

Hahnloser, Richard H R; Seung, H Sebastian; Slotine, Jean-Jacques

2003-03-01

The richness and complexity of recurrent cortical circuits is an inexhaustible source of inspiration for thinking about high-level biological computation. In past theoretical studies, constraints on the synaptic connection patterns of threshold-linear networks were found that guaranteed bounded network dynamics, convergence to attractive fixed points, and multistability, all fundamental aspects of cortical information processing. However, these conditions were only sufficient, and it remained unclear which were the minimal (necessary) conditions for convergence and multistability. We show that symmetric threshold-linear networks converge to a set of attractive fixed points if and only if the network matrix is copositive. Furthermore, the set of attractive fixed points is nonconnected (the network is multiattractive) if and only if the network matrix is not positive semidefinite. There are permitted sets of neurons that can be coactive at a stable steady state and forbidden sets that cannot. Permitted sets are clustered in the sense that subsets of permitted sets are permitted and supersets of forbidden sets are forbidden. By viewing permitted sets as memories stored in the synaptic connections, we provide a formulation of long-term memory that is more general than the traditional perspective of fixed-point attractor networks. There is a close correspondence between threshold-linear networks and networks defined by the generalized Lotka-Volterra equations.

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.

Deep Evolutionary Comparison of Gene Expression Identifies Parallel Recruitment of Trans-Factors in Two Independent Origins of C4 Photosynthesis

PubMed Central

Kümpers, Britta M. C.; Smith-Unna, Richard D.; Hibberd, Julian M.

2014-01-01

With at least 60 independent origins spanning monocotyledons and dicotyledons, the C4 photosynthetic pathway represents one of the most remarkable examples of convergent evolution. The recurrent evolution of this highly complex trait involving alterations to leaf anatomy, cell biology and biochemistry allows an increase in productivity by ∼50% in tropical and subtropical areas. The extent to which separate lineages of C4 plants use the same genetic networks to maintain C4 photosynthesis is unknown. We developed a new informatics framework to enable deep evolutionary comparison of gene expression in species lacking reference genomes. We exploited this to compare gene expression in species representing two independent C4 lineages (Cleome gynandra and Zea mays) whose last common ancestor diverged ∼140 million years ago. We define a cohort of 3,335 genes that represent conserved components of leaf and photosynthetic development in these species. Furthermore, we show that genes encoding proteins of the C4 cycle are recruited into networks defined by photosynthesis-related genes. Despite the wide evolutionary separation and independent origins of the C4 phenotype, we report that these species use homologous transcription factors to both induce C4 photosynthesis and to maintain the cell specific gene expression required for the pathway to operate. We define a core molecular signature associated with leaf and photosynthetic maturation that is likely shared by angiosperm species derived from the last common ancestor of the monocotyledons and dicotyledons. We show that deep evolutionary comparisons of gene expression can reveal novel insight into the molecular convergence of highly complex phenotypes and that parallel evolution of trans-factors underpins the repeated appearance of C4 photosynthesis. Thus, exploitation of extant natural variation associated with complex traits can be used to identify regulators. Moreover, the transcription factors that are shared by independent C4 lineages are key targets for engineering the C4 pathway into C3 crops such as rice. PMID:24901697

The physics of complex systems in information and biology

NASA Astrophysics Data System (ADS)

Walker, Dylan

Citation networks have re-emerged as a topic intense interest in the complex networks community with the recent availability of large-scale data sets. The ranking of citation networks is a necessary practice as a means to improve information navigability and search. Unlike many information networks, the aging characteristics of citation networks require the development of new ranking methods. To account for strong aging characteristics of citation networks, we modify the PageRank algorithm by initially distributing random surfers exponentially with age, in favor of more recent publications. The output of this algorithm, which we call CiteRank, is interpreted as approximate traffic to individual publications in a simple model of how researchers find new information. We optimize parameters of our algorithm to achieve the best performance. The results are compared for two rather different citation networks: all American Physical Society publications between 1893-2003 and the set of high-energy physics theory (hep-th) preprints. Despite major differences between these two networks, we find that their optimal parameters for the CiteRank algorithm are remarkably similar. The advantages and performance of CiteRank over more conventional methods of ranking publications are discussed. Collaborative voting systems have emerged as an abundant form of real-world, complex information systems that exist in a variety of online applications. These systems are comprised of large populations of users that collectively submit and vote on objects. While the specific properties of these systems vary widely, many of them share a core set of features and dynamical behaviors that govern their evolution. We study a subset of these systems that involve material of a time-critical nature as in the popular example of news items. We consider a general model system in which articles are introduced, voted on by a population of users, and subsequently expire after a proscribed period of time. To study the interaction between popularity and quality, we introduce simple stochastic models of user behavior that approximate differing user quality and susceptibility to the common notion of popularity. We define a metric to quantify user reputation in a manner that is self-consistent, adaptable and content-blind and shows good correlation with the probability that a user behaves in an optimal fashion. We further construct a mechanism for ranking documents that take into account user reputation and provides substantial improvement in the time-critical performance of the system. The structure of complex systems have been well studied in the context of both information and biological systems. More recently, dynamics in complex systems that occur over the background of the underlying network has received a great deal of attention. In particular, the study of fluctuations in complex systems has emerged as an issue central to understanding dynamical behavior. We approach the problem of collective effects of the underlying network on dynamical fluctuations by considering the protein-protein interaction networks for the system of the living cell. We consider two types of fluctuations in the mass-action equilibrium in protein binding networks. The first type is driven by relatively slow changes in total concentrations (copy numbers) of interacting proteins. The second type, to which we refer to as spontaneous, is caused by quickly decaying thermodynamic deviations away from the mass-action equilibrium of the system. As such they are amenable to methods of equilibrium statistical mechanics used in our study. We investigate the effects of network connectivity on these fluctuations by comparing them to different scenarios in which the interacting pair is isolated form the rest of the network. Such comparison allows us to analytically derive upper and lower bounds on network fluctuations. The collective effects are shown to sometimes lead to relatively large amplification of spontaneous fluctuations as compared to the expectation for isolated dimers. As a consequence of this, the strength of both types of fluctuations is positively correlated with the overall network connectivity of proteins forming the complex. On the other hand, the relative amplitude of fluctuations is negatively correlated with the equilibrium concentration of the complex. Our general findings are illustrated using a curated network of protein-protein interactions and multi-protein complexes in bakers yeast with experimentally determined protein concentrations.

A Generic Data Harmonization Process for Cross-linked Research and Network Interaction. Construction and Application for the Lung Cancer Phenotype Database of the German Center for Lung Research.

PubMed

Firnkorn, D; Ganzinger, M; Muley, T; Thomas, M; Knaup, P

2015-01-01

Joint data analysis is a key requirement in medical research networks. Data are available in heterogeneous formats at each network partner and their harmonization is often rather complex. The objective of our paper is to provide a generic approach for the harmonization process in research networks. We applied the process when harmonizing data from three sites for the Lung Cancer Phenotype Database within the German Center for Lung Research. We developed a spreadsheet-based solution as tool to support the harmonization process for lung cancer data and a data integration procedure based on Talend Open Studio. The harmonization process consists of eight steps describing a systematic approach for defining and reviewing source data elements and standardizing common data elements. The steps for defining common data elements and harmonizing them with local data definitions are repeated until consensus is reached. Application of this process for building the phenotype database led to a common basic data set on lung cancer with 285 structured parameters. The Lung Cancer Phenotype Database was realized as an i2b2 research data warehouse. Data harmonization is a challenging task requiring informatics skills as well as domain knowledge. Our approach facilitates data harmonization by providing guidance through a uniform process that can be applied in a wide range of projects.

Dynamic landscape of pancreatic carcinogenesis reveals early molecular networks of malignancy.

PubMed

Kong, Bo; Bruns, Philipp; Behler, Nora A; Chang, Ligong; Schlitter, Anna Melissa; Cao, Jing; Gewies, Andreas; Ruland, Jürgen; Fritzsche, Sina; Valkovskaya, Nataliya; Jian, Ziying; Regel, Ivonne; Raulefs, Susanne; Irmler, Martin; Beckers, Johannes; Friess, Helmut; Erkan, Mert; Mueller, Nikola S; Roth, Susanne; Hackert, Thilo; Esposito, Irene; Theis, Fabian J; Kleeff, Jörg; Michalski, Christoph W

2018-01-01

The initial steps of pancreatic regeneration versus carcinogenesis are insufficiently understood. Although a combination of oncogenic Kras and inflammation has been shown to induce malignancy, molecular networks of early carcinogenesis remain poorly defined. We compared early events during inflammation, regeneration and carcinogenesis on histological and transcriptional levels with a high temporal resolution using a well-established mouse model of pancreatitis and of inflammation-accelerated Kras G12D -driven pancreatic ductal adenocarcinoma. Quantitative expression data were analysed and extensively modelled in silico. We defined three distinctive phases-termed inflammation, regeneration and refinement-following induction of moderate acute pancreatitis in wild-type mice. These corresponded to different waves of proliferation of mesenchymal, progenitor-like and acinar cells. Pancreas regeneration required a coordinated transition of proliferation between progenitor-like and acinar cells. In mice harbouring an oncogenic Kras mutation and challenged with pancreatitis, there was an extended inflammatory phase and a parallel, continuous proliferation of mesenchymal, progenitor-like and acinar cells. Analysis of high-resolution transcriptional data from wild-type animals revealed that organ regeneration relied on a complex interaction of a gene network that normally governs acinar cell homeostasis, exocrine specification and intercellular signalling. In mice with oncogenic Kras, a specific carcinogenic signature was found, which was preserved in full-blown mouse pancreas cancer. These data define a transcriptional signature of early pancreatic carcinogenesis and a molecular network driving formation of preneoplastic lesions, which allows for more targeted biomarker development in order to detect cancer earlier in patients with pancreatitis. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

HIA, the next step: Defining models and roles

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

Putters, Kim

If HIA is to be an effective instrument for optimising health interests in the policy making process it has to recognise the different contests in which policy is made and the relevance of both technical rationality and political rationality. Policy making may adopt a rational perspective in which there is a systematic and orderly progression from problem formulation to solution or a network perspective in which there are multiple interdependencies, extensive negotiation and compromise, and the steps from problem to formulation are not followed sequentially or in any particular order. Policy problems may be simple with clear causal pathways andmore » responsibilities or complex with unclear causal pathways and disputed responsibilities. Network analysis is required to show which stakeholders are involved, their support for health issues and the degree of consensus. From this analysis three models of HIA emerge. The first is the phases model which is fitted to simple problems and a rational perspective of policymaking. This model involves following structured steps. The second model is the rounds (Echternach) model that is fitted to complex problems and a network perspective of policymaking. This model is dynamic and concentrates on network solutions taking these steps in no particular order. The final model is the 'garbage can' model fitted to contexts which combine simple and complex problems. In this model HIA functions as a problem solver and signpost keeping all possible solutions and stakeholders in play and allowing solutions to emerge over time. HIA models should be the beginning rather than the conclusion of discussion the worlds of HIA and policymaking.« less

Understanding key factors affecting electronic medical record implementation: a sociotechnical approach.

PubMed

Cucciniello, Maria; Lapsley, Irvine; Nasi, Greta; Pagliari, Claudia

2015-07-17

Recent health care policies have supported the adoption of Information and Communication Technologies (ICT) but examples of failed ICT projects in this sector have highlighted the need for a greater understanding of the processes used to implement such innovations in complex organizations. This study examined the interaction of sociological and technological factors in the implementation of an Electronic Medical Record (EMR) system by a major national hospital. It aimed to obtain insights for managers planning such projects in the future and to examine the usefulness of Actor Network Theory (ANT) as a research tool in this context. Case study using documentary analysis, interviews and observations. Qualitative thematic analysis drawing on ANT. Qualitative analyses revealed a complex network of interactions between organizational stakeholders and technology that helped to shape the system and influence its acceptance and adoption. The EMR clearly emerged as a central 'actor' within this network. The results illustrate how important it is to plan innovative and complex information systems with reference to (i) the expressed needs and involvement of different actors, starting from the initial introductory phase; (ii) promoting commitment to the system and adopting a participative approach; (iii) defining and resourcing new roles within the organization capable of supporting and sustaining the change and (iv) assessing system impacts in order to mobilize the network around a common goal. The paper highlights the organizational, cultural, technological, and financial considerations that should be taken into account when planning strategies for the implementation of EMR systems in hospital settings. It also demonstrates how ANT may be usefully deployed in evaluating such projects.

Operational resilience: concepts, design and analysis

NASA Astrophysics Data System (ADS)

Ganin, Alexander A.; Massaro, Emanuele; Gutfraind, Alexander; Steen, Nicolas; Keisler, Jeffrey M.; Kott, Alexander; Mangoubi, Rami; Linkov, Igor

2016-01-01

Building resilience into today’s complex infrastructures is critical to the daily functioning of society and its ability to withstand and recover from natural disasters, epidemics, and cyber-threats. This study proposes quantitative measures that capture and implement the definition of engineering resilience advanced by the National Academy of Sciences. The approach is applicable across physical, information, and social domains. It evaluates the critical functionality, defined as a performance function of time set by the stakeholders. Critical functionality is a source of valuable information, such as the integrated system resilience over a time interval, and its robustness. The paper demonstrates the formulation on two classes of models: 1) multi-level directed acyclic graphs, and 2) interdependent coupled networks. For both models synthetic case studies are used to explore trends. For the first class, the approach is also applied to the Linux operating system. Results indicate that desired resilience and robustness levels are achievable by trading off different design parameters, such as redundancy, node recovery time, and backup supply available. The nonlinear relationship between network parameters and resilience levels confirms the utility of the proposed approach, which is of benefit to analysts and designers of complex systems and networks.

Attacker-defender game from a network science perspective

NASA Astrophysics Data System (ADS)

Li, Ya-Peng; Tan, Suo-Yi; Deng, Ye; Wu, Jun

2018-05-01

Dealing with the protection of critical infrastructures, many game-theoretic methods have been developed to study the strategic interactions between defenders and attackers. However, most game models ignore the interrelationship between different components within a certain system. In this paper, we propose a simultaneous-move attacker-defender game model, which is a two-player zero-sum static game with complete information. The strategies and payoffs of this game are defined on the basis of the topology structure of the infrastructure system, which is represented by a complex network. Due to the complexity of strategies, the attack and defense strategies are confined by two typical strategies, namely, targeted strategy and random strategy. The simulation results indicate that in a scale-free network, the attacker virtually always attacks randomly in the Nash equilibrium. With a small cost-sensitive parameter, representing the degree to which costs increase with the importance of a target, the defender protects the hub targets with large degrees preferentially. When the cost-sensitive parameter exceeds a threshold, the defender switches to protecting nodes randomly. Our work provides a new theoretical framework to analyze the confrontations between the attacker and the defender on critical infrastructures and deserves further study.

Operational resilience: concepts, design and analysis

PubMed Central

Ganin, Alexander A.; Massaro, Emanuele; Gutfraind, Alexander; Steen, Nicolas; Keisler, Jeffrey M.; Kott, Alexander; Mangoubi, Rami; Linkov, Igor

2016-01-01

Building resilience into today’s complex infrastructures is critical to the daily functioning of society and its ability to withstand and recover from natural disasters, epidemics, and cyber-threats. This study proposes quantitative measures that capture and implement the definition of engineering resilience advanced by the National Academy of Sciences. The approach is applicable across physical, information, and social domains. It evaluates the critical functionality, defined as a performance function of time set by the stakeholders. Critical functionality is a source of valuable information, such as the integrated system resilience over a time interval, and its robustness. The paper demonstrates the formulation on two classes of models: 1) multi-level directed acyclic graphs, and 2) interdependent coupled networks. For both models synthetic case studies are used to explore trends. For the first class, the approach is also applied to the Linux operating system. Results indicate that desired resilience and robustness levels are achievable by trading off different design parameters, such as redundancy, node recovery time, and backup supply available. The nonlinear relationship between network parameters and resilience levels confirms the utility of the proposed approach, which is of benefit to analysts and designers of complex systems and networks. PMID:26782180

Operational resilience: concepts, design and analysis.

PubMed

Ganin, Alexander A; Massaro, Emanuele; Gutfraind, Alexander; Steen, Nicolas; Keisler, Jeffrey M; Kott, Alexander; Mangoubi, Rami; Linkov, Igor

2016-01-19

Building resilience into today's complex infrastructures is critical to the daily functioning of society and its ability to withstand and recover from natural disasters, epidemics, and cyber-threats. This study proposes quantitative measures that capture and implement the definition of engineering resilience advanced by the National Academy of Sciences. The approach is applicable across physical, information, and social domains. It evaluates the critical functionality, defined as a performance function of time set by the stakeholders. Critical functionality is a source of valuable information, such as the integrated system resilience over a time interval, and its robustness. The paper demonstrates the formulation on two classes of models: 1) multi-level directed acyclic graphs, and 2) interdependent coupled networks. For both models synthetic case studies are used to explore trends. For the first class, the approach is also applied to the Linux operating system. Results indicate that desired resilience and robustness levels are achievable by trading off different design parameters, such as redundancy, node recovery time, and backup supply available. The nonlinear relationship between network parameters and resilience levels confirms the utility of the proposed approach, which is of benefit to analysts and designers of complex systems and networks.

Functional brain networks related to individual differences in human intelligence at rest

PubMed Central

Hearne, Luke J.; Mattingley, Jason B.; Cocchi, Luca

2016-01-01

Intelligence is a fundamental ability that sets humans apart from other animal species. Despite its importance in defining human behaviour, the neural networks responsible for intelligence are not well understood. The dominant view from neuroimaging work suggests that intelligent performance on a range of tasks is underpinned by segregated interactions in a fronto-parietal network of brain regions. Here we asked whether fronto-parietal interactions associated with intelligence are ubiquitous, or emerge from more widespread associations in a task-free context. First we undertook an exploratory mapping of the existing literature on functional connectivity associated with intelligence. Next, to empirically test hypotheses derived from the exploratory mapping, we performed network analyses in a cohort of 317 unrelated participants from the Human Connectome Project. Our results revealed a novel contribution of across-network interactions between default-mode and fronto-parietal networks to individual differences in intelligence at rest. Specifically, we found that greater connectivity in the resting state was associated with higher intelligence scores. Our findings highlight the need to broaden the dominant fronto-parietal conceptualisation of intelligence to encompass more complex and context-specific network dynamics. PMID:27561736

Topic segmentation via community detection in complex networks

NASA Astrophysics Data System (ADS)

de Arruda, Henrique F.; Costa, Luciano da F.; Amancio, Diego R.

2016-06-01

Many real systems have been modeled in terms of network concepts, and written texts are a particular example of information networks. In recent years, the use of network methods to analyze language has allowed the discovery of several interesting effects, including the proposition of novel models to explain the emergence of fundamental universal patterns. While syntactical networks, one of the most prevalent networked models of written texts, display both scale-free and small-world properties, such a representation fails in capturing other textual features, such as the organization in topics or subjects. We propose a novel network representation whose main purpose is to capture the semantical relationships of words in a simple way. To do so, we link all words co-occurring in the same semantic context, which is defined in a threefold way. We show that the proposed representations favor the emergence of communities of semantically related words, and this feature may be used to identify relevant topics. The proposed methodology to detect topics was applied to segment selected Wikipedia articles. We found that, in general, our methods outperform traditional bag-of-words representations, which suggests that a high-level textual representation may be useful to study the semantical features of texts.

Cross layer optimization for cloud-based radio over optical fiber networks

NASA Astrophysics Data System (ADS)

Shao, Sujie; Guo, Shaoyong; Qiu, Xuesong; Yang, Hui; Meng, Luoming

2016-07-01

To adapt the 5G communication, the cloud radio access network is a paradigm introduced by operators which aggregates all base stations computational resources into a cloud BBU pool. The interaction between RRH and BBU or resource schedule among BBUs in cloud have become more frequent and complex with the development of system scale and user requirement. It can promote the networking demand among RRHs and BBUs, and force to form elastic optical fiber switching and networking. In such network, multiple stratum resources of radio, optical and BBU processing unit have interweaved with each other. In this paper, we propose a novel multiple stratum optimization (MSO) architecture for cloud-based radio over optical fiber networks (C-RoFN) with software defined networking. Additionally, a global evaluation strategy (GES) is introduced in the proposed architecture. MSO can enhance the responsiveness to end-to-end user demands and globally optimize radio frequency, optical spectrum and BBU processing resources effectively to maximize radio coverage. The feasibility and efficiency of the proposed architecture with GES strategy are experimentally verified on OpenFlow-enabled testbed in terms of resource occupation and path provisioning latency.

Topic segmentation via community detection in complex networks.

PubMed

de Arruda, Henrique F; Costa, Luciano da F; Amancio, Diego R

2016-06-01

Many real systems have been modeled in terms of network concepts, and written texts are a particular example of information networks. In recent years, the use of network methods to analyze language has allowed the discovery of several interesting effects, including the proposition of novel models to explain the emergence of fundamental universal patterns. While syntactical networks, one of the most prevalent networked models of written texts, display both scale-free and small-world properties, such a representation fails in capturing other textual features, such as the organization in topics or subjects. We propose a novel network representation whose main purpose is to capture the semantical relationships of words in a simple way. To do so, we link all words co-occurring in the same semantic context, which is defined in a threefold way. We show that the proposed representations favor the emergence of communities of semantically related words, and this feature may be used to identify relevant topics. The proposed methodology to detect topics was applied to segment selected Wikipedia articles. We found that, in general, our methods outperform traditional bag-of-words representations, which suggests that a high-level textual representation may be useful to study the semantical features of texts.

Landslide Susceptibility Index Determination Using Aritificial Neural Network

NASA Astrophysics Data System (ADS)

Kawabata, D.; Bandibas, J.; Urai, M.

2004-12-01

The occurrence of landslide is the result of the interaction of complex and diverse environmental factors. The geomorphic features, rock types and geologic structure are especially important base factors of the landslide occurrence. Generating landslide susceptibility index by defining the relationship between landslide occurrence and that base factors using conventional mathematical and statistical methods is very difficult and inaccurate. This study focuses on generating landslide susceptibility index using artificial neural networks in Southern Japanese Alps. The training data are geomorphic (e.g. altitude, slope and aspect) and geologic parameters (e.g. rock type, distance from geologic boundary and geologic dip-strike angle) and landslides. Artificial neural network structure and training scheme are formulated to generate the index. Data from areas with and without landslide occurrences are used to train the network. The network is trained to output 1 when the input data are from areas with landslides and 0 when no landslide occurred. The trained network generates an output ranging from 0 to 1 reflecting the possibility of landslide occurrence based on the inputted data. Output values nearer to 1 means higher possibility of landslide occurrence. The artificial neural network model is incorporated into the GIS software to generate a landslide susceptibility map.

How has climate change altered network connectivity in a mountain stream network?

NASA Astrophysics Data System (ADS)

Ward, A. S.; Schmadel, N.; Wondzell, S. M.; Johnson, S.

2017-12-01

Connectivity along river networks is broadly recognized as dynamic, with seasonal and event-based expansion and contraction of the network extent. Intermittently flowing streams are particularly important as they define a crucial threshold for continuously connected waters that enable migration by aquatic species. In the Pacific northwestern U.S., changes in atmospheric circulation have been found to alter rainfall patterns and result in decreased summer low-flows in the region. However, the impact of this climate dynamic on network connectivity is heretofore unstudied. Thus, we ask: How has connectivity in the riparian corridor changed in response to observed changes in climate? In this study we take the well-studied H.J. Andrews Experimental Forest as representative of mountain river networks in the Pacific northwestern U.S. First, we analyze 63 years of stream gauge information from a network of 11 gauges to document observed changes in timing and magnitude of stream discharge. We found declining magnitudes of seasonal low-flows and shifting seasonality of water export from the catchment, both of which we attribute to changes in precipitation timing and storage as snow vs. rainfall. Next, we use these discharge data to drive a reduced-complexity model of the river network to simulate network connectivity over 63 years. Model results show that network contraction (i.e., minimum network extent) has decreased over the past 63 years. Unexpectedly, the increasing winter peak flows did not correspond with increasing network expansion, suggesting a geologic control on maximum flowing network extent. We find dynamic expansion and contraction of the network primarily occurs during period of catchment discharge less than about 1 m3/s at the outlet, whereas the network extent is generally constant for discharges from 1 to 300 m3/s. Results of our study are of interest to scientists focused on connectivity as a control on ecological processes both directly (e.g., fish migration) and indirectly (e.g., stream temperature modeling). Additionally, our results inform management and regulatory needs such as estimating connectivity for entire river networks as a basis for regulation, and identifying the complexity of a shifting baseline in identifying a regulatory basis.

A Complex Systems Approach to Causal Discovery in Psychiatry.

PubMed

Saxe, Glenn N; Statnikov, Alexander; Fenyo, David; Ren, Jiwen; Li, Zhiguo; Prasad, Meera; Wall, Dennis; Bergman, Nora; Briggs, Ernestine C; Aliferis, Constantin

2016-01-01

Conventional research methodologies and data analytic approaches in psychiatric research are unable to reliably infer causal relations without experimental designs, or to make inferences about the functional properties of the complex systems in which psychiatric disorders are embedded. This article describes a series of studies to validate a novel hybrid computational approach--the Complex Systems-Causal Network (CS-CN) method-designed to integrate causal discovery within a complex systems framework for psychiatric research. The CS-CN method was first applied to an existing dataset on psychopathology in 163 children hospitalized with injuries (validation study). Next, it was applied to a much larger dataset of traumatized children (replication study). Finally, the CS-CN method was applied in a controlled experiment using a 'gold standard' dataset for causal discovery and compared with other methods for accurately detecting causal variables (resimulation controlled experiment). The CS-CN method successfully detected a causal network of 111 variables and 167 bivariate relations in the initial validation study. This causal network had well-defined adaptive properties and a set of variables was found that disproportionally contributed to these properties. Modeling the removal of these variables resulted in significant loss of adaptive properties. The CS-CN method was successfully applied in the replication study and performed better than traditional statistical methods, and similarly to state-of-the-art causal discovery algorithms in the causal detection experiment. The CS-CN method was validated, replicated, and yielded both novel and previously validated findings related to risk factors and potential treatments of psychiatric disorders. The novel approach yields both fine-grain (micro) and high-level (macro) insights and thus represents a promising approach for complex systems-oriented research in psychiatry.

Hierarchical auto-configuration addressing in mobile ad hoc networks (HAAM)

NASA Astrophysics Data System (ADS)

Ram Srikumar, P.; Sumathy, S.

2017-11-01

Addressing plays a vital role in networking to identify devices uniquely. A device must be assigned with a unique address in order to participate in the data communication in any network. Different protocols defining different types of addressing are proposed in literature. Address auto-configuration is a key requirement for self organizing networks. Existing auto-configuration based addressing protocols require broadcasting probes to all the nodes in the network before assigning a proper address to a new node. This needs further broadcasts to reflect the status of the acquired address in the network. Such methods incur high communication overheads due to repetitive flooding. To address this overhead, a new partially stateful address allocation scheme, namely Hierarchical Auto-configuration Addressing (HAAM) scheme is extended and proposed. Hierarchical addressing basically reduces latency and overhead caused during address configuration. Partially stateful addressing algorithm assigns addresses without the need for flooding and global state awareness, which in turn reduces the communication overhead and space complexity respectively. Nodes are assigned addresses hierarchically to maintain the graph of the network as a spanning tree which helps in effectively avoiding the broadcast storm problem. Proposed algorithm for HAAM handles network splits and merges efficiently in large scale mobile ad hoc networks incurring low communication overheads.

Improving link prediction in complex networks by adaptively exploiting multiple structural features of networks

NASA Astrophysics Data System (ADS)

Ma, Chuang; Bao, Zhong-Kui; Zhang, Hai-Feng

2017-10-01

So far, many network-structure-based link prediction methods have been proposed. However, these methods only highlight one or two structural features of networks, and then use the methods to predict missing links in different networks. The performances of these existing methods are not always satisfied in all cases since each network has its unique underlying structural features. In this paper, by analyzing different real networks, we find that the structural features of different networks are remarkably different. In particular, even in the same network, their inner structural features are utterly different. Therefore, more structural features should be considered. However, owing to the remarkably different structural features, the contributions of different features are hard to be given in advance. Inspired by these facts, an adaptive fusion model regarding link prediction is proposed to incorporate multiple structural features. In the model, a logistic function combing multiple structural features is defined, then the weight of each feature in the logistic function is adaptively determined by exploiting the known structure information. Last, we use the "learnt" logistic function to predict the connection probabilities of missing links. According to our experimental results, we find that the performance of our adaptive fusion model is better than many similarity indices.

node2vec: Scalable Feature Learning for Networks

PubMed Central

Grover, Aditya; Leskovec, Jure

2016-01-01

Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning approaches are not expressive enough to capture the diversity of connectivity patterns observed in networks. Here we propose node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks. In node2vec, we learn a mapping of nodes to a low-dimensional space of features that maximizes the likelihood of preserving network neighborhoods of nodes. We define a flexible notion of a node’s network neighborhood and design a biased random walk procedure, which efficiently explores diverse neighborhoods. Our algorithm generalizes prior work which is based on rigid notions of network neighborhoods, and we argue that the added flexibility in exploring neighborhoods is the key to learning richer representations. We demonstrate the efficacy of node2vec over existing state-of-the-art techniques on multi-label classification and link prediction in several real-world networks from diverse domains. Taken together, our work represents a new way for efficiently learning state-of-the-art task-independent representations in complex networks. PMID:27853626

Integrating Language and Cognition in Grounded Adaptive Agents

DTIC Science & Technology

2008-11-21

a gents w ill b e able t o communicate amo ng th emselves a nd w ith humans w ith the fl exibility and complexity of h uman language. Leonid...Cangelosi A., Hourdakis E . & Tikhanoff V. (2006). Language acquisition and symbol grounding transfer with neural networks and cognitive robots...Hence it is natural to define the following partial similarity measure between object i and concept k ieO ( ) ( )[∏ = − −−= d e keiekeke OSkil 1

Integrated health care and the advanced practice nurse.

PubMed

Green, A H; Conway-Welch, C

1995-01-01

As state-designed Medicaid reforms are enacted and commercial insurance carriers begin to manage care, advanced practice nurses (APNs) must be ready to aggressively pursue opportunities for clinical participation. Understanding the contractual obligations of becoming a provider, as well as adopting strategies for successful participation in these emerging integrated networks, will be critical for APNs. Successful contracting requires a carefully defined set of practice activities and a willingness to become a team player in a complex organization.

Dynamics of blood flow in a microfluidic ladder network

NASA Astrophysics Data System (ADS)

Maddala, Jeevan; Zilberman-Rudenko, Jevgenia; McCarty, Owen

The dynamics of a complex mixture of cells and proteins, such as blood, in perturbed shear flow remains ill-defined. Microfluidics is a promising technology for improving the understanding of blood flow under complex conditions of shear; as found in stent implants and in tortuous blood vessels. We model the fluid dynamics of blood flow in a microfluidic ladder network with dimensions mimicking venules. Interaction of blood cells was modeled using multiagent framework, where cells of different diameters were treated as spheres. This model served as the basis for predicting transition regions, collision pathways, re-circulation zones and residence times of cells dependent on their diameters and device architecture. Based on these insights from the model, we were able to predict the clot formation configurations at various locations in the device. These predictions were supported by the experiments using whole blood. To facilitate platelet aggregation, the devices were coated with fibrillar collagen and tissue factor. Blood was perfused through the microfluidic device for 9 min at a physiologically relevant venous shear rate of 600 s-1. Using fluorescent microscopy, we observed flow transitions near the channel intersections and at the areas of blood flow obstruction, which promoted larger thrombus formation. This study of integrating model predictions with experimental design, aids in defining the dynamics of blood flow in microvasculature and in development of novel biomedical devices.

Deep learning architecture for iris recognition based on optimal Gabor filters and deep belief network

NASA Astrophysics Data System (ADS)

He, Fei; Han, Ye; Wang, Han; Ji, Jinchao; Liu, Yuanning; Ma, Zhiqiang

2017-03-01

Gabor filters are widely utilized to detect iris texture information in several state-of-the-art iris recognition systems. However, the proper Gabor kernels and the generative pattern of iris Gabor features need to be predetermined in application. The traditional empirical Gabor filters and shallow iris encoding ways are incapable of dealing with such complex variations in iris imaging including illumination, aging, deformation, and device variations. Thereby, an adaptive Gabor filter selection strategy and deep learning architecture are presented. We first employ particle swarm optimization approach and its binary version to define a set of data-driven Gabor kernels for fitting the most informative filtering bands, and then capture complex pattern from the optimal Gabor filtered coefficients by a trained deep belief network. A succession of comparative experiments validate that our optimal Gabor filters may produce more distinctive Gabor coefficients and our iris deep representations be more robust and stable than traditional iris Gabor codes. Furthermore, the depth and scales of the deep learning architecture are also discussed.

Neuron hemilineages provide the functional ground plan for the Drosophila ventral nervous system

PubMed Central

Harris, Robin M; Pfeiffer, Barret D; Rubin, Gerald M; Truman, James W

2015-01-01

Drosophila central neurons arise from neuroblasts that generate neurons in a pair-wise fashion, with the two daughters providing the basis for distinct A and B hemilineage groups. 33 postembryonically-born hemilineages contribute over 90% of the neurons in each thoracic hemisegment. We devised genetic approaches to define the anatomy of most of these hemilineages and to assessed their functional roles using the heat-sensitive channel dTRPA1. The simplest hemilineages contained local interneurons and their activation caused tonic or phasic leg movements lacking interlimb coordination. The next level was hemilineages of similar projection cells that drove intersegmentally coordinated behaviors such as walking. The highest level involved hemilineages whose activation elicited complex behaviors such as takeoff. These activation phenotypes indicate that the hemilineages vary in their behavioral roles with some contributing to local networks for sensorimotor processing and others having higher order functions of coordinating these local networks into complex behavior. DOI: http://dx.doi.org/10.7554/eLife.04493.001 PMID:26193122

Single Sublattice Endotaxial Phase Separation Driven by Charge Frustration in a Complex Oxide

PubMed Central

2013-01-01

Complex transition-metal oxides are important functional materials in areas such as energy and information storage. The cubic ABO3 perovskite is an archetypal example of this class, formed by the occupation of small octahedral B-sites within an AO3 network defined by larger A cations. We show that introduction of chemically mismatched octahedral cations into a cubic perovskite oxide parent phase modifies structure and composition beyond the unit cell length scale on the B sublattice alone. This affords an endotaxial nanocomposite of two cubic perovskite phases with distinct properties. These locally B-site cation-ordered and -disordered phases share a single AO3 network and have enhanced stability against the formation of a competing hexagonal structure over the single-phase parent. Synergic integration of the distinct properties of these phases by the coherent interfaces of the composite produces solid oxide fuel cell cathode performance superior to that expected from the component phases in isolation. PMID:23750709

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.

Plant Phenotyping through the Eyes of Complex Systems: Theoretical Considerations

NASA Astrophysics Data System (ADS)

Kim, J.

2017-12-01

Plant phenotyping is an emerging transdisciplinary research which necessitates not only the communication and collaboration of scientists from different disciplines but also the paradigm shift to a holistic approach. Complex system is defined as a system having a large number of interacting parts (or particles, agents), whose interactions give rise to non-trivial properties like self-organization and emergence. Plant ecosystems are complex systems which are continually morphing dynamical systems, i.e. self-organizing hierarchical open systems. Such systems are composed of many subunits/subsystems with nonlinear interactions and feedback. The throughput such as the flow of energy, matter and information is the key control parameter in complex systems. Information theoretic approaches can be used to understand and identify such interactions, structures and dynamics through reductions in uncertainty (i.e. entropy). The theoretical considerations based on network and thermodynamic thinking and exemplary analyses (e.g. dynamic process network, spectral entropy) of the throughput time series will be presented. These can be used as a framework to develop more discipline-specific fundamental approaches to provide tools for the transferability of traits between measurement scales in plant phenotyping. Acknowledgment: This work was funded by the Weather Information Service Engine Program of the Korea Meteorological Administration under Grant KMIPA-2012-0001.

Exhaustive analysis of the modular structure of the spliceosomal assembly network: a petri net approach.

PubMed

Bortfeldt, Ralf H; Schuster, Stefan; Koch, Ina

2011-01-01

Spliceosomes are macro-complexes involving hundreds of proteins with many functional interactions. Spliceosome assembly belongs to the key processes that enable splicing of mRNA and modulate alternative splicing. A detailed list of factors involved in spliceosomal reactions has been assorted over the past decade, but, their functional interplay is often unknown and most of the present biological models cover only parts of the complete assembly process. It is a challenging task to build a computational model that integrates dispersed knowledge and combines a multitude of reaction schemes proposed earlier. Because for most reactions involved in spliceosome assembly kinetic parameters are not available, we propose a discrete modeling using Petri nets, through which we are enabled to get insights into the system's behavior via computation of structural and dynamic properties. In this paper, we compile and examine reactions from experimental reports that contribute to a functional spliceosome. All these reactions form a network, which describes the inventory and conditions necessary to perform the splicing process. The analysis is mainly based on system invariants. Transition invariants (T-invariants) can be interpreted as signaling routes through the network. Due to the huge number of T-invariants that arise with increasing network size and complexity, maximal common transition sets (MCTS) and T-clusters were used for further analysis. Additionally, we introduce a false color map representation, which allows a quick survey of network modules and the visual detection of single reactions or reaction sequences, which participate in more than one signaling route. We designed a structured model of spliceosome assembly, which combines the demands on a platform that i) can display involved factors and concurrent processes, ii) offers the possibility to run computational methods for knowledge extraction, and iii) is successively extendable as new insights into spliceosome function are reported by experimental reports. The network consists of 161 transitions (reactions) and 140 places (reactants). All reactions are part of at least one of the 71 T-invariants. These T-invariants define pathways, which are in good agreement with the current knowledge and known hypotheses on reaction sequences during spliceosome assembly, hence contributing to a functional spliceosome. We demonstrate that present knowledge, in particular of the initial part of the assembly process, describes parallelism and interaction of signaling routes, which indicate functional redundancy and reflect the dependency of spliceosome assembly initiation on different cellular conditions. The complexity of the network is further increased by two switches, which introduce alternative routes during A-complex formation in early spliceosome assembly and upon transition from the B-complex to the C-complex. By compiling known reactions into a complete network, the combinatorial nature of invariant computation leads to pathways that have previously not been described as connected routes, although their constituents were known. T-clusters divide the network into modules, which we interpret as building blocks in spliceosome maturation. We conclude that Petri net representations of large biological networks and system invariants, are well-suited as a means for validating the integration of experimental knowledge into a consistent model. Based on this network model, the design of further experiments is facilitated.

Exhaustive analysis of the modular structure of the spliceosomal assembly network: a Petri net approach.

PubMed

Bortfeldt, Ralf H; Schuster, Stefan; Koch, Ina

2010-01-01

Spliceosomes are macro-complexes involving hundreds of proteins with many functional interactions. Spliceosome assembly belongs to the key processes that enable splicing of mRNA and modulate alternative splicing. A detailed list of factors involved in spliceosomal reactions has been assorted over the past decade, but, their functional interplay is often unknown and most of the present biological models cover only parts of the complete assembly process. It is a challenging task to build a computational model that integrates dispersed knowledge and combines a multitude of reaction schemes proposed earlier.Because for most reactions involved in spliceosome assembly kinetic parameters are not available, we propose a discrete modeling using Petri nets, through which we are enabled to get insights into the system's behavior via computation of structural and dynamic properties. In this paper, we compile and examine reactions from experimental reports that contribute to a functional spliceosome. All these reactions form a network, which describes the inventory and conditions necessary to perform the splicing process. The analysis is mainly based on system invariants. Transition invariants (T-invariants) can be interpreted as signaling routes through the network. Due to the huge number of T-invariants that arise with increasing network size and complexity, maximal common transition sets (MCTS) and T-clusters were used for further analysis. Additionally, we introduce a false color map representation, which allows a quick survey of network modules and the visual detection of single reactions or reaction sequences, which participate in more than one signaling route. We designed a structured model of spliceosome assembly, which combines the demands on a platform that i) can display involved factors and concurrent processes, ii) offers the possibility to run computational methods for knowledge extraction, and iii) is successively extendable as new insights into spliceosome function are reported by experimental reports. The network consists of 161 transitions (reactions) and 140 places (reactants). All reactions are part of at least one of the 71 T-invariants. These T-invariants define pathways, which are in good agreement with the current knowledge and known hypotheses on reaction sequences during spliceosome assembly, hence contributing to a functional spliceosome. We demonstrate that present knowledge, in particular of the initial part of the assembly process, describes parallelism and interaction of signaling routes, which indicate functional redundancy and reflect the dependency of spliceosome assembly initiation on different cellular conditions. The complexity of the network is further increased by two switches, which introduce alternative routes during A-complex formation in early spliceosome assembly and upon transition from the B-complex to the C-complex. By compiling known reactions into a complete network, the combinatorial nature of invariant computation leads to pathways that have previously not been described as connected routes, although their constituents were known. T-clusters divide the network into modules, which we interpret as building blocks in spliceosome maturation. We conclude that Petri net representations of large biological networks and system invariants, are well-suited as a means for validating the integration of experimental knowledge into a consistent model. Based on this network model, the design of further experiments is facilitated.

Density-based clustering: A 'landscape view' of multi-channel neural data for inference and dynamic complexity analysis.

PubMed

Baglietto, Gabriel; Gigante, Guido; Del Giudice, Paolo

2017-01-01

Two, partially interwoven, hot topics in the analysis and statistical modeling of neural data, are the development of efficient and informative representations of the time series derived from multiple neural recordings, and the extraction of information about the connectivity structure of the underlying neural network from the recorded neural activities. In the present paper we show that state-space clustering can provide an easy and effective option for reducing the dimensionality of multiple neural time series, that it can improve inference of synaptic couplings from neural activities, and that it can also allow the construction of a compact representation of the multi-dimensional dynamics, that easily lends itself to complexity measures. We apply a variant of the 'mean-shift' algorithm to perform state-space clustering, and validate it on an Hopfield network in the glassy phase, in which metastable states are largely uncorrelated from memories embedded in the synaptic matrix. In this context, we show that the neural states identified as clusters' centroids offer a parsimonious parametrization of the synaptic matrix, which allows a significant improvement in inferring the synaptic couplings from the neural activities. Moving to the more realistic case of a multi-modular spiking network, with spike-frequency adaptation inducing history-dependent effects, we propose a procedure inspired by Boltzmann learning, but extending its domain of application, to learn inter-module synaptic couplings so that the spiking network reproduces a prescribed pattern of spatial correlations; we then illustrate, in the spiking network, how clustering is effective in extracting relevant features of the network's state-space landscape. Finally, we show that the knowledge of the cluster structure allows casting the multi-dimensional neural dynamics in the form of a symbolic dynamics of transitions between clusters; as an illustration of the potential of such reduction, we define and analyze a measure of complexity of the neural time series.

Using Equation-Free Computation to Accelerate Network-Free Stochastic Simulation of Chemical Kinetics.

PubMed

Lin, Yen Ting; Chylek, Lily A; Lemons, Nathan W; Hlavacek, William S

2018-06-21

The chemical kinetics of many complex systems can be concisely represented by reaction rules, which can be used to generate reaction events via a kinetic Monte Carlo method that has been termed network-free simulation. Here, we demonstrate accelerated network-free simulation through a novel approach to equation-free computation. In this process, variables are introduced that approximately capture system state. Derivatives of these variables are estimated using short bursts of exact stochastic simulation and finite differencing. The variables are then projected forward in time via a numerical integration scheme, after which a new exact stochastic simulation is initialized and the whole process repeats. The projection step increases efficiency by bypassing the firing of numerous individual reaction events. As we show, the projected variables may be defined as populations of building blocks of chemical species. The maximal number of connected molecules included in these building blocks determines the degree of approximation. Equation-free acceleration of network-free simulation is found to be both accurate and efficient.

In silico evolution of biochemical networks

NASA Astrophysics Data System (ADS)

Francois, Paul

2010-03-01

We use computational evolution to select models of genetic networks that can be built from a predefined set of parts to achieve a certain behavior. Selection is made with the help of a fitness defining biological functions in a quantitative way. This fitness has to be specific to a process, but general enough to find processes common to many species. Computational evolution favors models that can be built by incremental improvements in fitness rather than via multiple neutral steps or transitions through less fit intermediates. With the help of these simulations, we propose a kinetic view of evolution, where networks are rapidly selected along a fitness gradient. This mathematics recapitulates Darwin's original insight that small changes in fitness can rapidly lead to the evolution of complex structures such as the eye, and explain the phenomenon of convergent/parallel evolution of similar structures in independent lineages. We will illustrate these ideas with networks implicated in embryonic development and patterning of vertebrates and primitive insects.

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.

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.

Artificial Neural Networks for differential diagnosis of breast lesions in MR-Mammography: a systematic approach addressing the influence of network architecture on diagnostic performance using a large clinical database.

PubMed

Dietzel, Matthias; Baltzer, Pascal A T; Dietzel, Andreas; Zoubi, Ramy; Gröschel, Tobias; Burmeister, Hartmut P; Bogdan, Martin; Kaiser, Werner A

2012-07-01

Differential diagnosis of lesions in MR-Mammography (MRM) remains a complex task. The aim of this MRM study was to design and to test robustness of Artificial Neural Network architectures to predict malignancy using a large clinical database. For this IRB-approved investigation standardized protocols and study design were applied (T1w-FLASH; 0.1 mmol/kgBW Gd-DTPA; T2w-TSE; histological verification after MRM). All lesions were evaluated by two experienced (>500 MRM) radiologists in consensus. In every lesion, 18 previously published descriptors were assessed and documented in the database. An Artificial Neural Network (ANN) was developed to process this database (The-MathWorks/Inc., feed-forward-architecture/resilient back-propagation-algorithm). All 18 descriptors were set as input variables, whereas histological results (malignant vs. benign) was defined as classification variable. Initially, the ANN was optimized in terms of "Training Epochs" (TE), "Hidden Layers" (HL), "Learning Rate" (LR) and "Neurons" (N). Robustness of the ANN was addressed by repeated evaluation cycles (n: 9) with receiver operating characteristics (ROC) analysis of the results applying 4-fold Cross Validation. The best network architecture was identified comparing the corresponding Area under the ROC curve (AUC). Histopathology revealed 436 benign and 648 malignant lesions. Enhancing the level of complexity could not increase diagnostic accuracy of the network (P: n.s.). The optimized ANN architecture (TE: 20, HL: 1, N: 5, LR: 1.2) was accurate (mean-AUC 0.888; P: <0.001) and robust (CI: 0.885-0.892; range: 0.880-0.898). The optimized neural network showed robust performance and high diagnostic accuracy for prediction of malignancy on unknown data. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

Hybrid Multiscale Simulation of Hydrologic and Biogeochemical Processes in the River-Groundwater Interaction Zone

NASA Astrophysics Data System (ADS)

Yang, X.; Scheibe, T. D.; Chen, X.; Hammond, G. E.; Song, X.

2015-12-01

The zone in which river water and groundwater mix plays an important role in natural ecosystems as it regulates the mixing of nutrients that control biogeochemical transformations. Subsurface heterogeneity leads to local hotspots of microbial activity that are important to system function yet difficult to resolve computationally. To address this challenge, we are testing a hybrid multiscale approach that couples models at two distinct scales, based on field research at the U. S. Department of Energy's Hanford Site. The region of interest is a 400 x 400 x 20 m macroscale domain that intersects the aquifer and the river and contains a contaminant plume. However, biogeochemical activity is high in a thin zone (mud layer, <1 m thick) immediately adjacent to the river. This microscale domain is highly heterogeneous and requires fine spatial resolution to adequately represent the effects of local mixing on reactions. It is not computationally feasible to resolve the full macroscale domain at the fine resolution needed in the mud layer, and the reaction network needed in the mud layer is much more complex than that needed in the rest of the macroscale domain. Hence, a hybrid multiscale approach is used to efficiently and accurately predict flow and reactive transport at both scales. In our simulations, models at both scales are simulated using the PFLOTRAN code. Multiple microscale simulations in dynamically defined sub-domains (fine resolution, complex reaction network) are executed and coupled with a macroscale simulation over the entire domain (coarse resolution, simpler reaction network). The objectives of the research include: 1) comparing accuracy and computing cost of the hybrid multiscale simulation with a single-scale simulation; 2) identifying hot spots of microbial activity; and 3) defining macroscopic quantities such as fluxes, residence times and effective reaction rates.

Networks and games for precision medicine.

PubMed

Biane, Célia; Delaplace, Franck; Klaudel, Hanna

2016-12-01

Recent advances in omics technologies provide the leverage for the emergence of precision medicine that aims at personalizing therapy to patient. In this undertaking, computational methods play a central role for assisting physicians in their clinical decision-making by combining data analysis and systems biology modelling. Complex diseases such as cancer or diabetes arise from the intricate interplay of various biological molecules. Therefore, assessing drug efficiency requires to study the effects of elementary perturbations caused by diseases on relevant biological networks. In this paper, we propose a computational framework called Network-Action Game applied to best drug selection problem combining Game Theory and discrete models of dynamics (Boolean networks). Decision-making is modelled using Game Theory that defines the process of drug selection among alternative possibilities, while Boolean networks are used to model the effects of the interplay between disease and drugs actions on the patient's molecular system. The actions/strategies of disease and drugs are focused on arc alterations of the interactome. The efficiency of this framework has been evaluated for drug prediction on a model of breast cancer signalling. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

The optimal community detection of software based on complex networks

NASA Astrophysics Data System (ADS)

Huang, Guoyan; Zhang, Peng; Zhang, Bing; Yin, Tengteng; Ren, Jiadong

2016-02-01

The community structure is important for software in terms of understanding the design patterns, controlling the development and the maintenance process. In order to detect the optimal community structure in the software network, a method Optimal Partition Software Network (OPSN) is proposed based on the dependency relationship among the software functions. First, by analyzing the information of multiple execution traces of one software, we construct Software Execution Dependency Network (SEDN). Second, based on the relationship among the function nodes in the network, we define Fault Accumulation (FA) to measure the importance of the function node and sort the nodes with measure results. Third, we select the top K(K=1,2,…) nodes as the core of the primal communities (only exist one core node). By comparing the dependency relationships between each node and the K communities, we put the node into the existing community which has the most close relationship. Finally, we calculate the modularity with different initial K to obtain the optimal division. With experiments, the method OPSN is verified to be efficient to detect the optimal community in various softwares.

Architecting Communication Network of Networks for Space System of Systems

NASA Technical Reports Server (NTRS)

Bhasin, Kul B.; Hayden, Jeffrey L.

2008-01-01

The National Aeronautics and Space Administration (NASA) and the Department of Defense (DoD) are planning Space System of Systems (SoS) to address the new challenges of space exploration, defense, communications, navigation, Earth observation, and science. In addition, these complex systems must provide interoperability, enhanced reliability, common interfaces, dynamic operations, and autonomy in system management. Both NASA and the DoD have chosen to meet the new demands with high data rate communication systems and space Internet technologies that bring Internet Protocols (IP), routers, servers, software, and interfaces to space networks to enable as much autonomous operation of those networks as possible. These technologies reduce the cost of operations and, with higher bandwidths, support the expected voice, video, and data needed to coordinate activities at each stage of an exploration mission. In this paper, we discuss, in a generic fashion, how the architectural approaches and processes are being developed and used for defining a hypothetical communication and navigation networks infrastructure to support lunar exploration. Examples are given of the products generated by the architecture development process.

The Role of Caretakers in Disease Dynamics

NASA Astrophysics Data System (ADS)

Noble, Charleston; Bagrow, James P.; Brockmann, Dirk

2013-08-01

One of the key challenges in modeling the dynamics of contagion phenomena is to understand how the structure of social interactions shapes the time course of a disease. Complex network theory has provided significant advances in this context. However, awareness of an epidemic in a population typically yields behavioral changes that correspond to changes in the network structure on which the disease evolves. This feedback mechanism has not been investigated in depth. For example, one would intuitively expect susceptible individuals to avoid other infecteds. However, doctors treating patients or parents tending sick children may also increase the amount of contact made with an infecteds, in an effort to speed up recovery but also exposing themselves to higher risks of infection. We study the role of these caretaker links in an adaptive network models where individuals react to a disease by increasing or decreasing the amount of contact they make with infected individuals. We find that, for both homogeneous networks and networks possessing large topological variability, disease prevalence is decreased for low concentrations of caretakers whereas a high prevalence emerges if caretaker concentration passes a well defined critical value.

Urban occupational structures as information networks: The effect on network density of increasing number of occupations.

PubMed

Shutters, Shade T; Lobo, José; Muneepeerakul, Rachata; Strumsky, Deborah; Mellander, Charlotta; Brachert, Matthias; Farinha, Teresa; Bettencourt, Luis M A

2018-01-01

Urban economies are composed of diverse activities, embodied in labor occupations, which depend on one another to produce goods and services. Yet little is known about how the nature and intensity of these interdependences change as cities increase in population size and economic complexity. Understanding the relationship between occupational interdependencies and the number of occupations defining an urban economy is relevant because interdependence within a networked system has implications for system resilience and for how easily can the structure of the network be modified. Here, we represent the interdependencies among occupations in a city as a non-spatial information network, where the strengths of interdependence between pairs of occupations determine the strengths of the links in the network. Using those quantified link strengths we calculate a single metric of interdependence-or connectedness-which is equivalent to the density of a city's weighted occupational network. We then examine urban systems in six industrialized countries, analyzing how the density of urban occupational networks changes with network size, measured as the number of unique occupations present in an urban workforce. We find that in all six countries, density, or economic interdependence, increases superlinearly with the number of distinct occupations. Because connections among occupations represent flows of information, we provide evidence that connectivity scales superlinearly with network size in information networks.

False Positive and False Negative Effects on Network Attacks

NASA Astrophysics Data System (ADS)

Shang, Yilun

2018-01-01

Robustness against attacks serves as evidence for complex network structures and failure mechanisms that lie behind them. Most often, due to detection capability limitation or good disguises, attacks on networks are subject to false positives and false negatives, meaning that functional nodes may be falsely regarded as compromised by the attacker and vice versa. In this work, we initiate a study of false positive/negative effects on network robustness against three fundamental types of attack strategies, namely, random attacks (RA), localized attacks (LA), and targeted attack (TA). By developing a general mathematical framework based upon the percolation model, we investigate analytically and by numerical simulations of attack robustness with false positive/negative rate (FPR/FNR) on three benchmark models including Erdős-Rényi (ER) networks, random regular (RR) networks, and scale-free (SF) networks. We show that ER networks are equivalently robust against RA and LA only when FPR equals zero or the initial network is intact. We find several interesting crossovers in RR and SF networks when FPR is taken into consideration. By defining the cost of attack, we observe diminishing marginal attack efficiency for RA, LA, and TA. Our finding highlights the potential risk of underestimating or ignoring FPR in understanding attack robustness. The results may provide insights into ways of enhancing robustness of network architecture and improve the level of protection of critical infrastructures.

Urban occupational structures as information networks: The effect on network density of increasing number of occupations

PubMed Central

Lobo, José; Muneepeerakul, Rachata; Strumsky, Deborah; Mellander, Charlotta; Brachert, Matthias; Farinha, Teresa; Bettencourt, Luis M. A.

2018-01-01

Urban economies are composed of diverse activities, embodied in labor occupations, which depend on one another to produce goods and services. Yet little is known about how the nature and intensity of these interdependences change as cities increase in population size and economic complexity. Understanding the relationship between occupational interdependencies and the number of occupations defining an urban economy is relevant because interdependence within a networked system has implications for system resilience and for how easily can the structure of the network be modified. Here, we represent the interdependencies among occupations in a city as a non-spatial information network, where the strengths of interdependence between pairs of occupations determine the strengths of the links in the network. Using those quantified link strengths we calculate a single metric of interdependence–or connectedness–which is equivalent to the density of a city’s weighted occupational network. We then examine urban systems in six industrialized countries, analyzing how the density of urban occupational networks changes with network size, measured as the number of unique occupations present in an urban workforce. We find that in all six countries, density, or economic interdependence, increases superlinearly with the number of distinct occupations. Because connections among occupations represent flows of information, we provide evidence that connectivity scales superlinearly with network size in information networks. PMID:29734354

Modeling of a 3DTV service in the software-defined networking architecture

NASA Astrophysics Data System (ADS)

Wilczewski, Grzegorz

2014-11-01

In this article a newly developed concept towards modeling of a multimedia service offering stereoscopic motion imagery is presented. Proposed model is based on the approach of utilization of Software-defined Networking or Software Defined Networks architecture (SDN). The definition of 3D television service spanning SDN concept is identified, exposing basic characteristic of a 3DTV service in a modern networking organization layout. Furthermore, exemplary functionalities of the proposed 3DTV model are depicted. It is indicated that modeling of a 3DTV service in the Software-defined Networking architecture leads to multiplicity of improvements, especially towards flexibility of a service supporting heterogeneity of end user devices.

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.

Information diffusion, Facebook clusters, and the simplicial model of social aggregation: a computational simulation of simplicial diffusers for community health interventions.

PubMed

Kee, Kerk F; Sparks, Lisa; Struppa, Daniele C; Mannucci, Mirco A; Damiano, Alberto

2016-01-01

By integrating the simplicial model of social aggregation with existing research on opinion leadership and diffusion networks, this article introduces the constructs of simplicial diffusers (mathematically defined as nodes embedded in simplexes; a simplex is a socially bonded cluster) and simplicial diffusing sets (mathematically defined as minimal covers of a simplicial complex; a simplicial complex is a social aggregation in which socially bonded clusters are embedded) to propose a strategic approach for information diffusion of cancer screenings as a health intervention on Facebook for community cancer prevention and control. This approach is novel in its incorporation of interpersonally bonded clusters, culturally distinct subgroups, and different united social entities that coexist within a larger community into a computational simulation to select sets of simplicial diffusers with the highest degree of information diffusion for health intervention dissemination. The unique contributions of the article also include seven propositions and five algorithmic steps for computationally modeling the simplicial model with Facebook data.

Network Model-Assisted Inference from Respondent-Driven Sampling Data

PubMed Central

Gile, Krista J.; Handcock, Mark S.

2015-01-01

Summary Respondent-Driven Sampling is a widely-used method for sampling hard-to-reach human populations by link-tracing over their social networks. Inference from such data requires specialized techniques because the sampling process is both partially beyond the control of the researcher, and partially implicitly defined. Therefore, it is not generally possible to directly compute the sampling weights for traditional design-based inference, and likelihood inference requires modeling the complex sampling process. As an alternative, we introduce a model-assisted approach, resulting in a design-based estimator leveraging a working network model. We derive a new class of estimators for population means and a corresponding bootstrap standard error estimator. We demonstrate improved performance compared to existing estimators, including adjustment for an initial convenience sample. We also apply the method and an extension to the estimation of HIV prevalence in a high-risk population. PMID:26640328

Network Model-Assisted Inference from Respondent-Driven Sampling Data.

PubMed

Gile, Krista J; Handcock, Mark S

2015-06-01

Respondent-Driven Sampling is a widely-used method for sampling hard-to-reach human populations by link-tracing over their social networks. Inference from such data requires specialized techniques because the sampling process is both partially beyond the control of the researcher, and partially implicitly defined. Therefore, it is not generally possible to directly compute the sampling weights for traditional design-based inference, and likelihood inference requires modeling the complex sampling process. As an alternative, we introduce a model-assisted approach, resulting in a design-based estimator leveraging a working network model. We derive a new class of estimators for population means and a corresponding bootstrap standard error estimator. We demonstrate improved performance compared to existing estimators, including adjustment for an initial convenience sample. We also apply the method and an extension to the estimation of HIV prevalence in a high-risk population.

Identifying multiple influential spreaders based on generalized closeness centrality

NASA Astrophysics Data System (ADS)

Liu, Huan-Li; Ma, Chuang; Xiang, Bing-Bing; Tang, Ming; Zhang, Hai-Feng

2018-02-01

To maximize the spreading influence of multiple spreaders in complex networks, one important fact cannot be ignored: the multiple spreaders should be dispersively distributed in networks, which can effectively reduce the redundance of information spreading. For this purpose, we define a generalized closeness centrality (GCC) index by generalizing the closeness centrality index to a set of nodes. The problem converts to how to identify multiple spreaders such that an objective function has the minimal value. By comparing with the K-means clustering algorithm, we find that the optimization problem is very similar to the problem of minimizing the objective function in the K-means method. Therefore, how to find multiple nodes with the highest GCC value can be approximately solved by the K-means method. Two typical transmission dynamics-epidemic spreading process and rumor spreading process are implemented in real networks to verify the good performance of our proposed method.

Reconfigurable origami-inspired acoustic waveguides

PubMed Central

Babaee, Sahab; Overvelde, Johannes T. B.; Chen, Elizabeth R.; Tournat, Vincent; Bertoldi, Katia

2016-01-01

We combine numerical simulations and experiments to design a new class of reconfigurable waveguides based on three-dimensional origami-inspired metamaterials. Our strategy builds on the fact that the rigid plates and hinges forming these structures define networks of tubes that can be easily reconfigured. As such, they provide an ideal platform to actively control and redirect the propagation of sound. We design reconfigurable systems that, depending on the externally applied deformation, can act as networks of waveguides oriented along one, two, or three preferential directions. Moreover, we demonstrate that the capability of the structure to guide and radiate acoustic energy along predefined directions can be easily switched on and off, as the networks of tubes are reversibly formed and disrupted. The proposed designs expand the ability of existing acoustic metamaterials and exploit complex waveguiding to enhance control over propagation and radiation of acoustic energy, opening avenues for the design of a new class of tunable acoustic functional systems. PMID:28138527

More than a meal: integrating non-feeding interactions into food webs

USGS Publications Warehouse

Kéfi, Sonia; Berlow, Eric L.; Wieters, Evie A.; Navarrete, Sergio A.; Petchey, Owen L.; Wood, Spencer A.; Boit, Alice; Joppa, Lucas N.; Lafferty, Kevin D.; Williams, Richard J.; Martinez, Neo D.; Menge, Bruce A.; Blanchette, Carol A.; Iles, Alison C.; Brose, Ulrich

2012-01-01

Organisms eating each other are only one of many types of well documented and important interactions among species. Other such types include habitat modification, predator interference and facilitation. However, ecological network research has been typically limited to either pure food webs or to networks of only a few (<3) interaction types. The great diversity of non-trophic interactions observed in nature has been poorly addressed by ecologists and largely excluded from network theory. Herein, we propose a conceptual framework that organises this diversity into three main functional classes defined by how they modify specific parameters in a dynamic food web model. This approach provides a path forward for incorporating non-trophic interactions in traditional food web models and offers a new perspective on tackling ecological complexity that should stimulate both theoretical and empirical approaches to understanding the patterns and dynamics of diverse species interactions in nature.

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.

Mapping supply chain risk by network analysis of product platforms

DOE PAGES

Nuss, Philip; Graedel, T. E.; Alonso, Elisa; ...

2016-10-15

Modern technology makes use of a variety of materials to allow for its proper functioning. Here, to explore in detail the relationships connecting materials to the products that require them, we map supply chains for five product platforms (a cadmium telluride solar cell, a germanium solar cell, a turbine blade, a lead acid battery, and a hard drive (HD) magnet) using a data ontology that specifies the supply chain actors (nodes) and linkages (e.g., material exchange and contractual relationships) among them. We then propose a set of network indicators (product complexity, producer diversity, supply chain length, and potential bottlenecks) tomore » assess the situation for each platform in the overall supply chain networks. Among the results of interest are the following: (1) the turbine blade displays a high product complexity, defined by the material linkages to the platform; (2) the germanium solar cell is produced by only a few manufacturers globally and requires more physical transformation steps than do the other project platforms; (3) including production quantity and sourcing countries in the assessment shows that a large portion of nodes of the supply chain of the hard-drive magnet are located in potentially unreliable countries. Finally, we conclude by discussing how the network analysis of supply chains could be combined with criticality and scenario analyses of abiotic raw materials to comprise a comprehensive picture of product platform risk.« less

Mapping supply chain risk by network analysis of product platforms

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

Nuss, Philip; Graedel, T. E.; Alonso, Elisa

Modern technology makes use of a variety of materials to allow for its proper functioning. Here, to explore in detail the relationships connecting materials to the products that require them, we map supply chains for five product platforms (a cadmium telluride solar cell, a germanium solar cell, a turbine blade, a lead acid battery, and a hard drive (HD) magnet) using a data ontology that specifies the supply chain actors (nodes) and linkages (e.g., material exchange and contractual relationships) among them. We then propose a set of network indicators (product complexity, producer diversity, supply chain length, and potential bottlenecks) tomore » assess the situation for each platform in the overall supply chain networks. Among the results of interest are the following: (1) the turbine blade displays a high product complexity, defined by the material linkages to the platform; (2) the germanium solar cell is produced by only a few manufacturers globally and requires more physical transformation steps than do the other project platforms; (3) including production quantity and sourcing countries in the assessment shows that a large portion of nodes of the supply chain of the hard-drive magnet are located in potentially unreliable countries. Finally, we conclude by discussing how the network analysis of supply chains could be combined with criticality and scenario analyses of abiotic raw materials to comprise a comprehensive picture of product platform risk.« less

Enhanced and diminished visuo-spatial information processing in autism depends on stimulus complexity.

PubMed

Bertone, Armando; Mottron, Laurent; Jelenic, Patricia; Faubert, Jocelyn

2005-10-01

Visuo-perceptual processing in autism is characterized by intact or enhanced performance on static spatial tasks and inferior performance on dynamic tasks, suggesting a deficit of dorsal visual stream processing in autism. However, previous findings by Bertone et al. indicate that neuro-integrative mechanisms used to detect complex motion, rather than motion perception per se, may be impaired in autism. We present here the first demonstration of concurrent enhanced and decreased performance in autism on the same visuo-spatial static task, wherein the only factor dichotomizing performance was the neural complexity required to discriminate grating orientation. The ability of persons with autism was found to be superior for identifying the orientation of simple, luminance-defined (or first-order) gratings but inferior for complex, texture-defined (or second-order) gratings. Using a flicker contrast sensitivity task, we demonstrated that this finding is probably not due to abnormal information processing at a sub-cortical level (magnocellular and parvocellular functioning). Together, these findings are interpreted as a clear indication of altered low-level perceptual information processing in autism, and confirm that the deficits and assets observed in autistic visual perception are contingent on the complexity of the neural network required to process a given type of visual stimulus. We suggest that atypical neural connectivity, resulting in enhanced lateral inhibition, may account for both enhanced and decreased low-level information processing in autism.

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.

A novel multi-model neuro-fuzzy-based MPPT for three-phase grid-connected photovoltaic system

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

Chaouachi, Aymen; Kamel, Rashad M.; Nagasaka, Ken

This paper presents a novel methodology for Maximum Power Point Tracking (MPPT) of a grid-connected 20 kW photovoltaic (PV) system using neuro-fuzzy network. The proposed method predicts the reference PV voltage guarantying optimal power transfer between the PV generator and the main utility grid. The neuro-fuzzy network is composed of a fuzzy rule-based classifier and three multi-layered feed forwarded Artificial Neural Networks (ANN). Inputs of the network (irradiance and temperature) are classified before they are fed into the appropriated ANN for either training or estimation process while the output is the reference voltage. The main advantage of the proposed methodology,more » comparing to a conventional single neural network-based approach, is the distinct generalization ability regarding to the nonlinear and dynamic behavior of a PV generator. In fact, the neuro-fuzzy network is a neural network based multi-model machine learning that defines a set of local models emulating the complex and nonlinear behavior of a PV generator under a wide range of operating conditions. Simulation results under several rapid irradiance variations proved that the proposed MPPT method fulfilled the highest efficiency comparing to a conventional single neural network and the Perturb and Observe (P and O) algorithm dispositive. (author)« less

Natural learning in NLDA networks.

PubMed

González, Ana; Dorronsoro, José R

2007-07-01

Non Linear Discriminant Analysis (NLDA) networks combine a standard Multilayer Perceptron (MLP) transfer function with the minimization of a Fisher analysis criterion. In this work we will define natural-like gradients for NLDA network training. Instead of a more principled approach, that would require the definition of an appropriate Riemannian structure on the NLDA weight space, we will follow a simpler procedure, based on the observation that the gradient of the NLDA criterion function J can be written as the expectation nablaJ(W)=E[Z(X,W)] of a certain random vector Z and defining then I=E[Z(X,W)Z(X,W)(t)] as the Fisher information matrix in this case. This definition of I formally coincides with that of the information matrix for the MLP or other square error functions; the NLDA J criterion, however, does not have this structure. Although very simple, the proposed approach shows much faster convergence than that of standard gradient descent, even when its costlier complexity is taken into account. While the faster convergence of natural MLP batch training can be also explained in terms of its relationship with the Gauss-Newton minimization method, this is not the case for NLDA training, as we will see analytically and numerically that the hessian and information matrices are different.

Dynamic Control of Plans with Temporal Uncertainty

NASA Technical Reports Server (NTRS)

Morris, Paul; Muscettola, Nicola; Vidal, Thierry

2001-01-01

Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many applications involve processes of uncertain duration whose timing cannot be controlled by the execution agent. These cases require more complex notions of temporal feasibility. In previous work, various "controllability" properties such as Weak, Strong, and Dynamic Controllability have been defined. The most interesting and useful Controllability property, the Dynamic one, has ironically proved to be the most difficult to analyze. In this paper, we resolve the complexity issue for Dynamic Controllability. Unexpectedly, the problem turns out to be tractable. We also show how to efficiently execute networks whose status has been verified.

Proteome-Scale Human Interactomics.

PubMed

Luck, Katja; Sheynkman, Gloria M; Zhang, Ivy; Vidal, Marc

2017-05-01

Cellular functions are mediated by complex interactome networks of physical, biochemical, and functional interactions between DNA sequences, RNA molecules, proteins, lipids, and small metabolites. A thorough understanding of cellular organization requires accurate and relatively complete models of interactome networks at proteome scale. The recent publication of four human protein-protein interaction (PPI) maps represents a technological breakthrough and an unprecedented resource for the scientific community, heralding a new era of proteome-scale human interactomics. Our knowledge gained from these and complementary studies provides fresh insights into the opportunities and challenges when analyzing systematically generated interactome data, defines a clear roadmap towards the generation of a first reference interactome, and reveals new perspectives on the organization of cellular life. Copyright © 2017 Elsevier Ltd. All rights reserved.

Climate change impacts on urban wildfire and flooding policy in Idaho: a comparative policy network perspective

NASA Astrophysics Data System (ADS)

Lindquist, E.; Pierce, J. L.

2013-12-01

Numerous frameworks and models exist for understanding the dynamics of the public policy process. A policy network approach considers how and why stakeholders and interests pay attention to and engage in policy problems, such as flood control or developing resilient and fire resistant landscapes. Variables considered in this approach include what the relationships are between these stakeholders, how they influence the process and outcomes, communication patterns within and between policy networks, and how networks change as a result of new information, science, or public interest and involvement with the problem. This approach is useful in understanding the creation of natural hazards policy as new information or situations, such as projected climate change impacts, influence and disrupt the policy process and networks. Two significant natural hazard policy networks exist in the semi-arid Treasure Valley region of Southwest Idaho, which includes the capitol city of Boise and the surrounding metropolitan area. Boise is situated along the Boise River and adjacent to steep foothills; this physiographic setting makes Boise vulnerable to both wildfires at the wildland-urban interface (WUI) and flooding. Both of these natural hazards have devastated the community in the past and floods and fires are projected to occur with more frequency in the future as a result of projected climate change impacts in the region. While both hazards are fairly well defined problems, there are stark differences lending themselves to comparisons across their respective networks. The WUI wildfire network is large and well developed, includes stakeholders from all levels of government, the private sector and property owner organizations, has well defined objectives, and conducts promotional and educational activities as part of its interaction with the public in order to increase awareness and garner support for its policies. The flood control policy network, however, is less defined, dominated by a few historically strong interests and is constrained (and supported) by the complex legal and management foundations of Western water rights, as well as federal and state regulatory practices for flood control and water provision. Overlap between these networks does occur as many of the stakeholders are the same, adding another dimension to the comparative approach presented here. It is the physical and natural sciences that bind these two networks, however, and create opportunities for convergence as hydrological inputs (snowmelt and rain) and summer drought simultaneously inform and impact efforts to increase resilience and reduce vulnerability and risk from both fire and flood. For example, early spring snowmelt can both increase risks of flooding and contribute to later severe fire conditions, and fires greatly increase the risk of catastrophic floods and debris flows in burned basins. Contributing to both of these potential hazards are changes in the climate in the region. This paper will present findings from a comparative study of these two policy networks and discuss the implications from how climate change is defined, understood, accepted, and integrated in both networks and the policy processes associated with these urban hazards.

Stability of ecological industry chain: an entropy model approach.

PubMed

Wang, Qingsong; Qiu, Shishou; Yuan, Xueliang; Zuo, Jian; Cao, Dayong; Hong, Jinglan; Zhang, Jian; Dong, Yong; Zheng, Ying

2016-07-01

A novel methodology is proposed in this study to examine the stability of ecological industry chain network based on entropy theory. This methodology is developed according to the associated dissipative structure characteristics, i.e., complexity, openness, and nonlinear. As defined in the methodology, network organization is the object while the main focus is the identification of core enterprises and core industry chains. It is proposed that the chain network should be established around the core enterprise while supplementation to the core industry chain helps to improve system stability, which is verified quantitatively. Relational entropy model can be used to identify core enterprise and core eco-industry chain. It could determine the core of the network organization and core eco-industry chain through the link form and direction of node enterprises. Similarly, the conductive mechanism of different node enterprises can be examined quantitatively despite the absence of key data. Structural entropy model can be employed to solve the problem of order degree for network organization. Results showed that the stability of the entire system could be enhanced by the supplemented chain around the core enterprise in eco-industry chain network organization. As a result, the sustainability of the entire system could be further improved.

Warnings and caveats in brain controllability.

PubMed

Tu, Chengyi; Rocha, Rodrigo P; Corbetta, Maurizio; Zampieri, Sandro; Zorzi, Marco; Suweis, S

2018-08-01

A recent article by Gu et al. (Nat. Commun. 6, 2015) proposed to characterize brain networks, quantified using anatomical diffusion imaging, in terms of their "controllability", drawing on concepts and methods of control theory. They reported that brain activity is controllable from a single node, and that the topology of brain networks provides an explanation for the types of control roles that different regions play in the brain. In this work, we first briefly review the framework of control theory applied to complex networks. We then show contrasting results on brain controllability through the analysis of five different datasets and numerical simulations. We find that brain networks are not controllable (in a statistical significant way) by one single region. Additionally, we show that random null models, with no biological resemblance to brain network architecture, produce the same type of relationship observed by Gu et al. between the average/modal controllability and weighted degree. Finally, we find that resting state networks defined with fMRI cannot be attributed specific control roles. In summary, our study highlights some warning and caveats in the brain controllability framework. Copyright © 2018 Elsevier Inc. All rights reserved.

Networks of genetic loci and the scientific literature

NASA Astrophysics Data System (ADS)

Semeiks, J. R.; Grate, L. R.; Mian, I. S.

This work considers biological information graphs, networks in which nodes corre-spond to genetic loci (or "genes") and an (undirected) edge signifies that two genes are discussed in the same article(s) in the scientific literature ("documents"). Operations that utilize the topology of these graphs can assist researchers in the scientific discovery process. For example, a shortest path between two nodes defines an ordered series of genes and documents that can be used to explore the relationship(s) between genes of interest. This work (i) describes how topologies in which edges are likely to reflect genuine relationship(s) can be constructed from human-curated corpora of genes an-notated with documents (or vice versa), and (ii) illustrates the potential of biological information graphs in synthesizing knowledge in order to formulate new hypotheses and generate novel predictions for subsequent experimental study. In particular, the well-known LocusLink corpus is used to construct a biological information graph consisting of 10,297 nodes and 21,910 edges. The large-scale statistical properties of this gene-document network suggest that it is a new example of a power-law network. The segregation of genes on the basis of species and encoded protein molecular function indicate the presence of assortativity, the preference for nodes with similar attributes to be neighbors in a network. The practical utility of a gene-document network is illustrated by using measures such as shortest paths and centrality to analyze a subset of nodes corresponding to genes implicated in aging. Each release of a curated biomedical corpus defines a particular static graph. The topology of a gene-document network changes over time as curators add and/or remove nodes and/or edges. Such a dynamic, evolving corpus provides both the foundation for analyzing the growth and behavior of large complex networks and a substrate for examining trends in biological research.

Biophysically defined and cytocompatible covalently adaptable networks as viscoelastic 3D cell culture systems.

PubMed

McKinnon, Daniel D; Domaille, Dylan W; Cha, Jennifer N; Anseth, Kristi S

2014-02-12

Presented here is a cytocompatible covalently adaptable hydrogel uniquely capable of mimicking the complex biophysical properties of native tissue and enabling natural cell functions without matrix degradation. Demonstrated is both the ability to control elastic modulus and stress relaxation time constants by more than an order of magnitude while predicting these values based on fundamental theoretical understanding and the simulation of muscle tissue and the encapsulation of myoblasts. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Artificial astrocytes improve neural network performance.

PubMed

Porto-Pazos, Ana B; Veiguela, Noha; Mesejo, Pablo; Navarrete, Marta; Alvarellos, Alberto; Ibáñez, Oscar; Pazos, Alejandro; Araque, Alfonso

2011-04-19

Compelling evidence indicates the existence of bidirectional communication between astrocytes and neurons. Astrocytes, a type of glial cells classically considered to be passive supportive cells, have been recently demonstrated to be actively involved in the processing and regulation of synaptic information, suggesting that brain function arises from the activity of neuron-glia networks. However, the actual impact of astrocytes in neural network function is largely unknown and its application in artificial intelligence remains untested. We have investigated the consequences of including artificial astrocytes, which present the biologically defined properties involved in astrocyte-neuron communication, on artificial neural network performance. Using connectionist systems and evolutionary algorithms, we have compared the performance of artificial neural networks (NN) and artificial neuron-glia networks (NGN) to solve classification problems. We show that the degree of success of NGN is superior to NN. Analysis of performances of NN with different number of neurons or different architectures indicate that the effects of NGN cannot be accounted for an increased number of network elements, but rather they are specifically due to astrocytes. Furthermore, the relative efficacy of NGN vs. NN increases as the complexity of the network increases. These results indicate that artificial astrocytes improve neural network performance, and established the concept of Artificial Neuron-Glia Networks, which represents a novel concept in Artificial Intelligence with implications in computational science as well as in the understanding of brain function.

Artificial Astrocytes Improve Neural Network Performance

PubMed Central

Porto-Pazos, Ana B.; Veiguela, Noha; Mesejo, Pablo; Navarrete, Marta; Alvarellos, Alberto; Ibáñez, Oscar; Pazos, Alejandro; Araque, Alfonso

2011-01-01

Compelling evidence indicates the existence of bidirectional communication between astrocytes and neurons. Astrocytes, a type of glial cells classically considered to be passive supportive cells, have been recently demonstrated to be actively involved in the processing and regulation of synaptic information, suggesting that brain function arises from the activity of neuron-glia networks. However, the actual impact of astrocytes in neural network function is largely unknown and its application in artificial intelligence remains untested. We have investigated the consequences of including artificial astrocytes, which present the biologically defined properties involved in astrocyte-neuron communication, on artificial neural network performance. Using connectionist systems and evolutionary algorithms, we have compared the performance of artificial neural networks (NN) and artificial neuron-glia networks (NGN) to solve classification problems. We show that the degree of success of NGN is superior to NN. Analysis of performances of NN with different number of neurons or different architectures indicate that the effects of NGN cannot be accounted for an increased number of network elements, but rather they are specifically due to astrocytes. Furthermore, the relative efficacy of NGN vs. NN increases as the complexity of the network increases. These results indicate that artificial astrocytes improve neural network performance, and established the concept of Artificial Neuron-Glia Networks, which represents a novel concept in Artificial Intelligence with implications in computational science as well as in the understanding of brain function. PMID:21526157

"Newbies" and "Celebrities": Detecting Social Roles in an Online Network of Teachers via Participation Patterns

ERIC Educational Resources Information Center

Smith Risser, H.; Bottoms, SueAnn

2014-01-01

The advent of social networking tools allows teachers to create online networks and share information. While some virtual networks have a formal structure and defined boundaries, many do not. These unstructured virtual networks are difficult to study because they lack defined boundaries and a formal structure governing leadership roles and the…

Neural complexity: A graph theoretic interpretation

NASA Astrophysics Data System (ADS)

Barnett, L.; Buckley, C. L.; Bullock, S.

2011-04-01

One of the central challenges facing modern neuroscience is to explain the ability of the nervous system to coherently integrate information across distinct functional modules in the absence of a central executive. To this end, Tononi [Proc. Natl. Acad. Sci. USA.PNASA60027-842410.1073/pnas.91.11.5033 91, 5033 (1994)] proposed a measure of neural complexity that purports to capture this property based on mutual information between complementary subsets of a system. Neural complexity, so defined, is one of a family of information theoretic metrics developed to measure the balance between the segregation and integration of a system’s dynamics. One key question arising for such measures involves understanding how they are influenced by network topology. Sporns [Cereb. Cortex53OPAV1047-321110.1093/cercor/10.2.127 10, 127 (2000)] employed numerical models in order to determine the dependence of neural complexity on the topological features of a network. However, a complete picture has yet to be established. While De Lucia [Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.71.016114 71, 016114 (2005)] made the first attempts at an analytical account of this relationship, their work utilized a formulation of neural complexity that, we argue, did not reflect the intuitions of the original work. In this paper we start by describing weighted connection matrices formed by applying a random continuous weight distribution to binary adjacency matrices. This allows us to derive an approximation for neural complexity in terms of the moments of the weight distribution and elementary graph motifs. In particular, we explicitly establish a dependency of neural complexity on cyclic graph motifs.

Graphs for information security control in software defined networks

NASA Astrophysics Data System (ADS)

Grusho, Alexander A.; Abaev, Pavel O.; Shorgin, Sergey Ya.; Timonina, Elena E.

2017-07-01

Information security control in software defined networks (SDN) is connected with execution of the security policy rules regulating information accesses and protection against distribution of the malicious code and harmful influences. The paper offers a representation of a security policy in the form of hierarchical structure which in case of distribution of resources for the solution of tasks defines graphs of admissible interactions in a networks. These graphs define commutation tables of switches via the SDN controller.

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.

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.

A technological infrastructure to sustain Internetworked Enterprises

NASA Astrophysics Data System (ADS)

La Mattina, Ernesto; Savarino, Vincenzo; Vicari, Claudia; Storelli, Davide; Bianchini, Devis

In the Web 3.0 scenario, where information and services are connected by means of their semantics, organizations can improve their competitive advantage by publishing their business and service descriptions. In this scenario, Semantic Peer to Peer (P2P) can play a key role in defining dynamic and highly reconfigurable infrastructures. Organizations can share knowledge and services, using this infrastructure to move towards value networks, an emerging organizational model characterized by fluid boundaries and complex relationships. This chapter collects and defines the technological requirements and architecture of a modular and multi-Layer Peer to Peer infrastructure for SOA-based applications. This technological infrastructure, based on the combination of Semantic Web and P2P technologies, is intended to sustain Internetworked Enterprise configurations, defining a distributed registry and enabling more expressive queries and efficient routing mechanisms. The following sections focus on the overall architecture, while describing the layers that form it.

Photocrosslinking approaches to interactome mapping

PubMed Central

Pham, Nam D.; Parker, Randy B.; Kohler, Jennifer J.

2012-01-01

Photocrosslinking approaches can be used to map interactome networks within the context of living cells. Photocrosslinking methods rely on use of metabolic engineering or genetic code expansion to incorporate photocrosslinking analogs of amino acids or sugars into cellular biomolecules. Immunological and mass spectrometry techniques are used to analyze crosslinked complexes, thereby defining specific interactomes. Because photocrosslinking can be conducted in native, cellular settings, it can be used to define context-dependent interactions. Photocrosslinking methods are also ideally suited for determining interactome dynamics, mapping interaction interfaces, and identifying transient interactions in which intrinsically disordered proteins and glycoproteins engage. Here we discuss the application of cell-based photocrosslinking to the study of specific problems in immune cell signaling, transcription, membrane protein dynamics, nucleocytoplasmic transport, and chaperone-assisted protein folding. PMID:23149092

Discovering Preferential Patterns in Sectoral Trade Networks

PubMed Central

Cingolani, Isabella; Piccardi, Carlo; Tajoli, Lucia

2015-01-01

We analyze the patterns of import/export bilateral relations, with the aim of assessing the relevance and shape of “preferentiality” in countries’ trade decisions. Preferentiality here is defined as the tendency to concentrate trade on one or few partners. With this purpose, we adopt a systemic approach through the use of the tools of complex network analysis. In particular, we apply a pattern detection approach based on community and pseudocommunity analysis, in order to highlight the groups of countries within which most of members’ trade occur. The method is applied to two intra-industry trade networks consisting of 221 countries, relative to the low-tech “Textiles and Textile Articles” and the high-tech “Electronics” sectors for the year 2006, to look at the structure of world trade before the start of the international financial crisis. It turns out that the two networks display some similarities and some differences in preferential trade patterns: they both include few significant communities that define narrow sets of countries trading with each other as preferential destinations markets or supply sources, and they are characterized by the presence of similar hierarchical structures, led by the largest economies. But there are also distinctive features due to the characteristics of the industries examined, in which the organization of production and the destination markets are different. Overall, the extent of preferentiality and partner selection at the sector level confirm the relevance of international trade costs still today, inducing countries to seek the highest efficiency in their trade patterns. PMID:26485163

Discovering Preferential Patterns in Sectoral Trade Networks.

PubMed

Cingolani, Isabella; Piccardi, Carlo; Tajoli, Lucia

2015-01-01

We analyze the patterns of import/export bilateral relations, with the aim of assessing the relevance and shape of "preferentiality" in countries' trade decisions. Preferentiality here is defined as the tendency to concentrate trade on one or few partners. With this purpose, we adopt a systemic approach through the use of the tools of complex network analysis. In particular, we apply a pattern detection approach based on community and pseudocommunity analysis, in order to highlight the groups of countries within which most of members' trade occur. The method is applied to two intra-industry trade networks consisting of 221 countries, relative to the low-tech "Textiles and Textile Articles" and the high-tech "Electronics" sectors for the year 2006, to look at the structure of world trade before the start of the international financial crisis. It turns out that the two networks display some similarities and some differences in preferential trade patterns: they both include few significant communities that define narrow sets of countries trading with each other as preferential destinations markets or supply sources, and they are characterized by the presence of similar hierarchical structures, led by the largest economies. But there are also distinctive features due to the characteristics of the industries examined, in which the organization of production and the destination markets are different. Overall, the extent of preferentiality and partner selection at the sector level confirm the relevance of international trade costs still today, inducing countries to seek the highest efficiency in their trade patterns.

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.

Beyond the known functions of the CCR4-NOT complex in gene expression regulatory mechanisms: New structural insights to unravel CCR4-NOT mRNA processing machinery.

PubMed

Ukleja, Marta; Valpuesta, José María; Dziembowski, Andrzej; Cuellar, Jorge

2016-10-01

Large protein assemblies are usually the effectors of major cellular processes. The intricate cell homeostasis network is divided into numerous interconnected pathways, each controlled by a set of protein machines. One of these master regulators is the CCR4-NOT complex, which ultimately controls protein expression levels. This multisubunit complex assembles around a scaffold platform, which enables a wide variety of well-studied functions from mRNA synthesis to transcript decay, as well as other tasks still being identified. Solving the structure of the entire CCR4-NOT complex will help to define the distribution of its functions. The recently published three-dimensional reconstruction of the complex, in combination with the known crystal structures of some of the components, has begun to address this. Methodological improvements in structural biology, especially in cryoelectron microscopy, encourage further structural and protein-protein interaction studies, which will advance our comprehension of the gene expression machinery. © 2016 WILEY Periodicals, Inc.

Complex network theory for the identification and assessment of candidate protein targets.

PubMed

McGarry, Ken; McDonald, Sharon

2018-06-01

In this work we use complex network theory to provide a statistical model of the connectivity patterns of human proteins and their interaction partners. Our intention is to identify important proteins that may be predisposed to be potential candidates as drug targets for therapeutic interventions. Target proteins usually have more interaction partners than non-target proteins, but there are no hard-and-fast rules for defining the actual number of interactions. We devise a statistical measure for identifying hub proteins, we score our target proteins with gene ontology annotations. The important druggable protein targets are likely to have similar biological functions that can be assessed for their potential therapeutic value. Our system provides a statistical analysis of the local and distant neighborhood protein interactions of the potential targets using complex network measures. This approach builds a more accurate model of drug-to-target activity and therefore the likely impact on treating diseases. We integrate high quality protein interaction data from the HINT database and disease associated proteins from the DrugTarget database. Other sources include biological knowledge from Gene Ontology and drug information from DrugBank. The problem is a very challenging one since the data is highly imbalanced between target proteins and the more numerous nontargets. We use undersampling on the training data and build Random Forest classifier models which are used to identify previously unclassified target proteins. We validate and corroborate these findings from the available literature. Copyright © 2018 Elsevier Ltd. All rights reserved.

Service-oriented Software Defined Optical Networks for Cloud Computing

NASA Astrophysics Data System (ADS)

Liu, Yuze; Li, Hui; Ji, Yuefeng

2017-10-01

With the development of big data and cloud computing technology, the traditional software-defined network is facing new challenges (e.g., ubiquitous accessibility, higher bandwidth, more flexible management and greater security). This paper proposes a new service-oriented software defined optical network architecture, including a resource layer, a service abstract layer, a control layer and an application layer. We then dwell on the corresponding service providing method. Different service ID is used to identify the service a device can offer. Finally, we experimentally evaluate that proposed service providing method can be applied to transmit different services based on the service ID in the service-oriented software defined optical network.

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.

Stability of Control Networks in Autonomous Homeostatic Regulation of Stem Cell Lineages.

PubMed

Komarova, Natalia L; van den Driessche, P

2018-05-01

Design principles of biological networks have been studied extensively in the context of protein-protein interaction networks, metabolic networks, and regulatory (transcriptional) networks. Here we consider regulation networks that occur on larger scales, namely the cell-to-cell signaling networks that connect groups of cells in multicellular organisms. These are the feedback loops that orchestrate the complex dynamics of cell fate decisions and are necessary for the maintenance of homeostasis in stem cell lineages. We focus on "minimal" networks that are those that have the smallest possible numbers of controls. For such minimal networks, the number of controls must be equal to the number of compartments, and the reducibility/irreducibility of the network (whether or not it can be split into smaller independent sub-networks) is defined by a matrix comprised of the cell number increments induced by each of the controlled processes in each of the compartments. Using the formalism of digraphs, we show that in two-compartment lineages, reducible systems must contain two 1-cycles, and irreducible systems one 1-cycle and one 2-cycle; stability follows from the signs of the controls and does not require magnitude restrictions. In three-compartment systems, irreducible digraphs have a tree structure or have one 3-cycle and at least two more shorter cycles, at least one of which is a 1-cycle. With further work and proper biological validation, our results may serve as a first step toward an understanding of ways in which these networks become dysregulated in cancer.

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.

Reconstructing Networks from Profit Sequences in Evolutionary Games via a Multiobjective Optimization Approach with Lasso Initialization

PubMed Central

Wu, Kai; Liu, Jing; Wang, Shuai

2016-01-01

Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy. PMID:27886244

The P/N (Positive-to-Negative Links) Ratio in Complex Networks-A Promising In Silico Biomarker for Detecting Changes Occurring in the Human Microbiome.

PubMed

Ma, Zhanshan Sam

2018-05-01

Relatively little progress in the methodology for differentiating between the healthy and diseased microbiomes, beyond comparing microbial community diversities with traditional species richness or Shannon index, has been made. Network analysis has increasingly been called for the task, but most currently available microbiome datasets only allows for the construction of simple species correlation networks (SCNs). The main results from SCN analysis are a series of network properties such as network degree and modularity, but the metrics for these network properties often produce inconsistent evidence. We propose a simple new network property, the P/N ratio, defined as the ratio of positive links to the number of negative links in the microbial SCN. We postulate that the P/N ratio should reflect the balance between facilitative and inhibitive interactions among microbial species, possibly one of the most important changes occurring in diseased microbiome. We tested our hypothesis with five datasets representing five major human microbiome sites and discovered that the P/N ratio exhibits contrasting differences between healthy and diseased microbiomes and may be harnessed as an in silico biomarker for detecting disease-associated changes in the human microbiome, and may play an important role in personalized diagnosis of the human microbiome-associated diseases.

Reconstructing Networks from Profit Sequences in Evolutionary Games via a Multiobjective Optimization Approach with Lasso Initialization

NASA Astrophysics Data System (ADS)

Wu, Kai; Liu, Jing; Wang, Shuai

2016-11-01

Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy.

Network-based landscape of research strengths of universities in Mainland China

NASA Astrophysics Data System (ADS)

Liu, Zihua; Xiao, Qin; Zhan, Qian; Gu, Changgui; Yang, Huijie

2017-07-01

A landscape of a complex system presents a quantitative measure of its global state. The profile of research strength in Mainland China is investigated in detail, by which we illustrate a complex network based framework to extract a landscape from detailed records. First, a measure analogous to the Jaccard similarity is proposed to calculate from the presided funds similarities between the top-ranked universities. The neighbor threshold method is employed to reconstruct the similarity network of the universities. Second, the network is divided into communities. In each community the node with the largest degree and the smallest average shortest path length is taken as the representative of the community, called central node. The node bridging each pair of communities is defined to be a boundary. The central nodes and boundaries cooperatively give us a picture of the research strength landscape. Third, the evolutionary behavior is monitored by the fission and fusion probability matrices, elements of which are the percentage of a community at present time that joins into every community at the next time, and the percentage of a community at next time that comes from every present community, respectively. The landscapes in three successive 4-year durations are identified. It was found that some types of universities, such as the medicine&pharmacy and the finance&economy, conserve in single communities in the more than ten years, respectively. The agriculture&forest universities tend to cluster into one community. Meanwhile the engineering type distributes in different communities and tends to mix with the comprehension type. This framework can be used straightforwardly to analyze temporal networks. It provides also a new network-based method for multivariate time series analysis.

Atmospheric reaction systems as null-models to identify structural traces of evolution in metabolism.

PubMed

Holme, Petter; Huss, Mikael; Lee, Sang Hoon

2011-05-06

The metabolism is the motor behind the biological complexity of an organism. One problem of characterizing its large-scale structure is that it is hard to know what to compare it to. All chemical reaction systems are shaped by the same physics that gives molecules their stability and affinity to react. These fundamental factors cannot be captured by standard null-models based on randomization. The unique property of organismal metabolism is that it is controlled, to some extent, by an enzymatic machinery that is subject to evolution. In this paper, we explore the possibility that reaction systems of planetary atmospheres can serve as a null-model against which we can define metabolic structure and trace the influence of evolution. We find that the two types of data can be distinguished by their respective degree distributions. This is especially clear when looking at the degree distribution of the reaction network (of reaction connected to each other if they involve the same molecular species). For the Earth's atmospheric network and the human metabolic network, we look into more detail for an underlying explanation of this deviation. However, we cannot pinpoint a single cause of the difference, rather there are several concurrent factors. By examining quantities relating to the modular-functional organization of the metabolism, we confirm that metabolic networks have a more complex modular organization than the atmospheric networks, but not much more. We interpret the more variegated modular arrangement of metabolism as a trace of evolved functionality. On the other hand, it is quite remarkable how similar the structures of these two types of networks are, which emphasizes that the constraints from the chemical properties of the molecules has a larger influence in shaping the reaction system than does natural selection.

Phase behavior and structure of stable complexes between a long polyanion and a branched polycation

NASA Astrophysics Data System (ADS)

Mengarelli, Valentina; Zeghal, Mehdi; Auvray, Loïc; Clemens, Daniel

2011-08-01

The association between oppositely charged branched polyethylenimine (BPEI) and polymethacrylic acid (PMA) in the dilute regime is investigated using turbidimetric titration and electrophoretic mobility measurements. The complexation is controlled by tuning continuously the pH-sensitive charge of the polyacid in acidic solution. The formation of soluble and stable positively charged complexes is a cooperative process characterized by the existence of two regimes of weak and strong complexation. In the regime of weak complexation, a long PMA chain overcharged by several BPEI molecules forms a binary complex. As the charge of the polyacid increases, these binary complexes condense at a well defined charge ratio of the mixture to form large positively charged aggregates. The overcharging and the existence of two regimes of complexation are analyzed in the light of recent theories. The structure of the polyelectrolytes is investigated at higher polymer concentration by small angle neutron scattering. Binary complexes of finite size present an open structure where the polyacid chains connecting a small number of BPEI molecules have shrunk slightly. In the condensed complexes, BPEI molecules, wrapped by polyacid chains, form networks of stretched necklaces.

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

Detecting natural occlusion boundaries using local cues

PubMed Central

DiMattina, Christopher; Fox, Sean A.; Lewicki, Michael S.

2012-01-01

Occlusion boundaries and junctions provide important cues for inferring three-dimensional scene organization from two-dimensional images. Although several investigators in machine vision have developed algorithms for detecting occlusions and other edges in natural images, relatively few psychophysics or neurophysiology studies have investigated what features are used by the visual system to detect natural occlusions. In this study, we addressed this question using a psychophysical experiment where subjects discriminated image patches containing occlusions from patches containing surfaces. Image patches were drawn from a novel occlusion database containing labeled occlusion boundaries and textured surfaces in a variety of natural scenes. Consistent with related previous work, we found that relatively large image patches were needed to attain reliable performance, suggesting that human subjects integrate complex information over a large spatial region to detect natural occlusions. By defining machine observers using a set of previously studied features measured from natural occlusions and surfaces, we demonstrate that simple features defined at the spatial scale of the image patch are insufficient to account for human performance in the task. To define machine observers using a more biologically plausible multiscale feature set, we trained standard linear and neural network classifiers on the rectified outputs of a Gabor filter bank applied to the image patches. We found that simple linear classifiers could not match human performance, while a neural network classifier combining filter information across location and spatial scale compared well. These results demonstrate the importance of combining a variety of cues defined at multiple spatial scales for detecting natural occlusions. PMID:23255731

Functional connectivity supporting the selective maintenance of feature-location binding in visual working memory

PubMed Central

Takahama, Sachiko; Saiki, Jun

2014-01-01

Information on an object's features bound to its location is very important for maintaining object representations in visual working memory. Interactions with dynamic multi-dimensional objects in an external environment require complex cognitive control, including the selective maintenance of feature-location binding. Here, we used event-related functional magnetic resonance imaging to investigate brain activity and functional connectivity related to the maintenance of complex feature-location binding. Participants were required to detect task-relevant changes in feature-location binding between objects defined by color, orientation, and location. We compared a complex binding task requiring complex feature-location binding (color-orientation-location) with a simple binding task in which simple feature-location binding, such as color-location, was task-relevant and the other feature was task-irrelevant. Univariate analyses showed that the dorsolateral prefrontal cortex (DLPFC), hippocampus, and frontoparietal network were activated during the maintenance of complex feature-location binding. Functional connectivity analyses indicated cooperation between the inferior precentral sulcus (infPreCS), DLPFC, and hippocampus during the maintenance of complex feature-location binding. In contrast, the connectivity for the spatial updating of simple feature-location binding determined by reanalyzing the data from Takahama et al. (2010) demonstrated that the superior parietal lobule (SPL) cooperated with the DLPFC and hippocampus. These results suggest that the connectivity for complex feature-location binding does not simply reflect general memory load and that the DLPFC and hippocampus flexibly modulate the dorsal frontoparietal network, depending on the task requirements, with the infPreCS involved in the maintenance of complex feature-location binding and the SPL involved in the spatial updating of simple feature-location binding. PMID:24917833

Functional connectivity supporting the selective maintenance of feature-location binding in visual working memory.

PubMed

Takahama, Sachiko; Saiki, Jun

2014-01-01

Information on an object's features bound to its location is very important for maintaining object representations in visual working memory. Interactions with dynamic multi-dimensional objects in an external environment require complex cognitive control, including the selective maintenance of feature-location binding. Here, we used event-related functional magnetic resonance imaging to investigate brain activity and functional connectivity related to the maintenance of complex feature-location binding. Participants were required to detect task-relevant changes in feature-location binding between objects defined by color, orientation, and location. We compared a complex binding task requiring complex feature-location binding (color-orientation-location) with a simple binding task in which simple feature-location binding, such as color-location, was task-relevant and the other feature was task-irrelevant. Univariate analyses showed that the dorsolateral prefrontal cortex (DLPFC), hippocampus, and frontoparietal network were activated during the maintenance of complex feature-location binding. Functional connectivity analyses indicated cooperation between the inferior precentral sulcus (infPreCS), DLPFC, and hippocampus during the maintenance of complex feature-location binding. In contrast, the connectivity for the spatial updating of simple feature-location binding determined by reanalyzing the data from Takahama et al. (2010) demonstrated that the superior parietal lobule (SPL) cooperated with the DLPFC and hippocampus. These results suggest that the connectivity for complex feature-location binding does not simply reflect general memory load and that the DLPFC and hippocampus flexibly modulate the dorsal frontoparietal network, depending on the task requirements, with the infPreCS involved in the maintenance of complex feature-location binding and the SPL involved in the spatial updating of simple feature-location binding.

Ground states of partially connected binary neural networks

NASA Technical Reports Server (NTRS)

Baram, Yoram

1990-01-01

Neural networks defined by outer products of vectors over (-1, 0, 1) are considered. Patterns over (-1, 0, 1) define by their outer products partially connected neural networks consisting of internally strongly connected, externally weakly connected subnetworks. Subpatterns over (-1, 1) define subnetworks, and their combinations that agree in the common bits define permissible words. It is shown that the permissible words are locally stable states of the network, provided that each of the subnetworks stores mutually orthogonal subwords, or, at most, two subwords. It is also shown that when each of the subnetworks stores two mutually orthogonal binary subwords at most, the permissible words, defined as the combinations of the subwords (one corresponding to each subnetwork), that agree in their common bits are the unique ground states of the associated energy function.

Protein-protein interaction networks: unraveling the wiring of molecular machines within the cell.

PubMed

De Las Rivas, Javier; Fontanillo, Celia

2012-11-01

Mapping and understanding of the protein interaction networks with their key modules and hubs can provide deeper insights into the molecular machinery underlying complex phenotypes. In this article, we present the basic characteristics and definitions of protein networks, starting with a distinction of the different types of associations between proteins. We focus the review on protein-protein interactions (PPIs), a subset of associations defined as physical contacts between proteins that occur by selective molecular docking in a particular biological context. We present such definition as opposed to other types of protein associations derived from regulatory, genetic, structural or functional relations. To determine PPIs, a variety of binary and co-complex methods exist; however, not all the technologies provide the same information and data quality. A way of increasing confidence in a given protein interaction is to integrate orthogonal experimental evidences. The use of several complementary methods testing each single interaction assesses the accuracy of PPI data and tries to minimize the occurrence of false interactions. Following this approach there have been important efforts to unify primary databases of experimentally proven PPIs into integrated databases. These meta-databases provide a measure of the confidence of interactions based on the number of experimental proofs that report them. As a conclusion, we can state that integrated information allows the building of more reliable interaction networks. Identification of communities, cliques, modules and hubs by analysing the topological parameters and graph properties of the protein networks allows the discovery of central/critical nodes, which are candidates to regulate cellular flux and dynamics.

LANES 1 Users' Guide

NASA Technical Reports Server (NTRS)

Jordan, J.

1985-01-01

This document is intended for users of the Local Area Network Extensible Simulator, version I. This simulator models the performance of a Fiber Optic network under a variety of loading conditions and network characteristics. The options available to the user for defining the network conditions are described in this document. Computer hardware and software requirements are also defined.

Phase transitions in the quadratic contact process on complex networks

NASA Astrophysics Data System (ADS)

Varghese, Chris; Durrett, Rick

2013-06-01

The quadratic contact process (QCP) is a natural extension of the well-studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate λ and infected individuals recover (10) at rate 1. In the QCP, a combination of two 1's is required to effect a 01 change. We extend the study of the QCP, which so far has been limited to lattices, to complex networks. We define two versions of the QCP: vertex-centered (VQCP) and edge-centered (EQCP) with birth events 1-0-11-1-1 and 1-1-01-1-1, respectively, where “-” represents an edge. We investigate the effects of network topology by considering the QCP on random regular, Erdős-Rényi, and power-law random graphs. We perform mean-field calculations as well as simulations to find the steady-state fraction of occupied vertices as a function of the birth rate. We find that on the random regular and Erdős-Rényi graphs, there is a discontinuous phase transition with a region of bistability, whereas on the heavy-tailed power-law graph, the transition is continuous. The critical birth rate is found to be positive in the former but zero in the latter.

Information-theoretic metamodel of organizational evolution

NASA Astrophysics Data System (ADS)

Sepulveda, Alfredo

2011-12-01

Social organizations are abstractly modeled by holarchies---self-similar connected networks---and intelligent complex adaptive multiagent systems---large networks of autonomous reasoning agents interacting via scaled processes. However, little is known of how information shapes evolution in such organizations, a gap that can lead to misleading analytics. The research problem addressed in this study was the ineffective manner in which classical model-predict-control methods used in business analytics attempt to define organization evolution. The purpose of the study was to construct an effective metamodel for organization evolution based on a proposed complex adaptive structure---the info-holarchy. Theoretical foundations of this study were holarchies, complex adaptive systems, evolutionary theory, and quantum mechanics, among other recently developed physical and information theories. Research questions addressed how information evolution patterns gleamed from the study's inductive metamodel more aptly explained volatility in organization. In this study, a hybrid grounded theory based on abstract inductive extensions of information theories was utilized as the research methodology. An overarching heuristic metamodel was framed from the theoretical analysis of the properties of these extension theories and applied to business, neural, and computational entities. This metamodel resulted in the synthesis of a metaphor for, and generalization of organization evolution, serving as the recommended and appropriate analytical tool to view business dynamics for future applications. This study may manifest positive social change through a fundamental understanding of complexity in business from general information theories, resulting in more effective management.

A comprehensive archaeological map of the world's largest preindustrial settlement complex at Angkor, Cambodia

PubMed Central

Evans, Damian; Pottier, Christophe; Fletcher, Roland; Hensley, Scott; Tapley, Ian; Milne, Anthony; Barbetti, Michael

2007-01-01

The great medieval settlement of Angkor in Cambodia [9th–16th centuries Common Era (CE)] has for many years been understood as a “hydraulic city,” an urban complex defined, sustained, and ultimately overwhelmed by a complex water management network. Since the 1980s that view has been disputed, but the debate has remained unresolved because of insufficient data on the landscape beyond the great temples: the broader context of the monumental remains was only partially understood and had not been adequately mapped. Since the 1990s, French, Australian, and Cambodian teams have sought to address this empirical deficit through archaeological mapping projects by using traditional methods such as ground survey in conjunction with advanced radar remote-sensing applications in partnership with the National Aeronautics and Space Administration (NASA)/Jet Propulsion Laboratory (JPL). Here we present a major outcome of that research: a comprehensive archaeological map of greater Angkor, covering nearly 3,000 km2, prepared by the Greater Angkor Project (GAP). The map reveals a vast, low-density settlement landscape integrated by an elaborate water management network covering >1,000 km2, the most extensive urban complex of the preindustrial world. It is now clear that anthropogenic changes to the landscape were both extensive and substantial enough to have created grave challenges to the long-term viability of the settlement. PMID:17717084

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

Complex network problems in physics, computer science and biology

NASA Astrophysics Data System (ADS)

Cojocaru, Radu Ionut

There is a close relation between physics and mathematics and the exchange of ideas between these two sciences are well established. However until few years ago there was no such a close relation between physics and computer science. Even more, only recently biologists started to use methods and tools from statistical physics in order to study the behavior of complex system. In this thesis we concentrate on applying and analyzing several methods borrowed from computer science to biology and also we use methods from statistical physics in solving hard problems from computer science. In recent years physicists have been interested in studying the behavior of complex networks. Physics is an experimental science in which theoretical predictions are compared to experiments. In this definition, the term prediction plays a very important role: although the system is complex, it is still possible to get predictions for its behavior, but these predictions are of a probabilistic nature. Spin glasses, lattice gases or the Potts model are a few examples of complex systems in physics. Spin glasses and many frustrated antiferromagnets map exactly to computer science problems in the NP-hard class defined in Chapter 1. In Chapter 1 we discuss a common result from artificial intelligence (AI) which shows that there are some problems which are NP-complete, with the implication that these problems are difficult to solve. We introduce a few well known hard problems from computer science (Satisfiability, Coloring, Vertex Cover together with Maximum Independent Set and Number Partitioning) and then discuss their mapping to problems from physics. In Chapter 2 we provide a short review of combinatorial optimization algorithms and their applications to ground state problems in disordered systems. We discuss the cavity method initially developed for studying the Sherrington-Kirkpatrick model of spin glasses. We extend this model to the study of a specific case of spin glass on the Bethe lattice at zero temperature and then we apply this formalism to the K-SAT problem defined in Chapter 1. The phase transition which physicists study often corresponds to a change in the computational complexity of the corresponding computer science problem. Chapter 3 presents phase transitions which are specific to the problems discussed in Chapter 1 and also known results for the K-SAT problem. We discuss the replica method and experimental evidences of replica symmetry breaking. The physics approach to hard problems is based on replica methods which are difficult to understand. In Chapter 4 we develop novel methods for studying hard problems using methods similar to the message passing techniques that were discussed in Chapter 2. Although we concentrated on the symmetric case, cavity methods show promise for generalizing our methods to the un-symmetric case. As has been highlighted by John Hopfield, several key features of biological systems are not shared by physical systems. Although living entities follow the laws of physics and chemistry, the fact that organisms adapt and reproduce introduces an essential ingredient that is missing in the physical sciences. In order to extract information from networks many algorithm have been developed. In Chapter 5 we apply polynomial algorithms like minimum spanning tree in order to study and construct gene regulatory networks from experimental data. As future work we propose the use of algorithms like min-cut/max-flow and Dijkstra for understanding key properties of these networks.

Effect of landslides on the structural characteristics of land-cover based on complex networks

NASA Astrophysics Data System (ADS)

He, Jing; Tang, Chuan; Liu, Gang; Li, Weile

2017-09-01

Landslides have been widely studied by geologists. However, previous studies mainly focused on the formation of landslides and never considered the effect of landslides on the structural characteristics of land-cover. Here we define the modeling of the graph topology for the land-cover, using the satellite images of the earth’s surface before and after the earthquake. We find that the land-cover network satisfies the power-law distribution, whether the land-cover contains landslides or not. However, landslides may change some parameters or measures of the structural characteristics of land-cover. The results show that the linear coefficient, modularity and area distribution are all changed after the occurence of landslides, which means the structural characteristics of the land-cover are changed.

Hopping in the Crowd to Unveil Network Topology.

PubMed

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-13

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

Cellular Organization and Cytoskeletal Regulation of the Hippo Signaling Network

PubMed Central

Sun, Shuguo; Irvine, Kenneth D.

2016-01-01

The Hippo signaling network integrates diverse upstream signals to control cell fate decisions and regulate organ growth. Recent studies have provided new insights into the cellular organization of Hippo signaling, its relationship to cell-cell junctions, and how the cytoskeleton modulates Hippo signaling. Cell-cell junctions serve as platforms for Hippo signaling by localizing scaffolding proteins that interact with core components of the pathway. Interactions of Hippo pathway components with cell-cell junctions and the cytoskeleton also suggest potential mechanisms for the regulation of the pathway by cell contact and cell polarity. As our understanding of the complexity of Hippo signaling increases, a future challenge will be to understand how the diverse inputs into the pathway are integrated, and to define their respective contributions in vivo. PMID:27268910

Modeling of ultrasound transmission through a solid-liquid interface comprising a network of gas pockets

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

Paumel, K.; Baque, F.; Moysan, J.

Ultrasonic inspection of sodium-cooled fast reactor requires a good acoustic coupling between the transducer and the liquid sodium. Ultrasonic transmission through a solid surface in contact with liquid sodium can be complex due to the presence of microscopic gas pockets entrapped by the surface roughness. Experiments are run using substrates with controlled roughness consisting of a network of holes and a modeling approach is then developed. In this model, a gas pocket stiffness at a partially solid-liquid interface is defined. This stiffness is then used to calculate the transmission coefficient of ultrasound at the entire interface. The gas pocket stiffnessmore » has a static, as well as an inertial component, which depends on the ultrasonic frequency and the radiative mass.« less

Hopping in the Crowd to Unveil Network Topology

NASA Astrophysics Data System (ADS)

Asllani, Malbor; Carletti, Timoteo; Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2018-04-01

We introduce a nonlinear operator to model diffusion on a complex undirected network under crowded conditions. We show that the asymptotic distribution of diffusing agents is a nonlinear function of the nodes' degree and saturates to a constant value for sufficiently large connectivities, at variance with standard diffusion in the absence of excluded-volume effects. Building on this observation, we define and solve an inverse problem, aimed at reconstructing the a priori unknown connectivity distribution. The method gathers all the necessary information by repeating a limited number of independent measurements of the asymptotic density at a single node, which can be chosen randomly. The technique is successfully tested against both synthetic and real data and is also shown to estimate with great accuracy the total number of nodes.

Systems engineering for very large systems

NASA Technical Reports Server (NTRS)

Lewkowicz, Paul E.

1993-01-01

Very large integrated systems have always posed special problems for engineers. Whether they are power generation systems, computer networks or space vehicles, whenever there are multiple interfaces, complex technologies or just demanding customers, the challenges are unique. 'Systems engineering' has evolved as a discipline in order to meet these challenges by providing a structured, top-down design and development methodology for the engineer. This paper attempts to define the general class of problems requiring the complete systems engineering treatment and to show how systems engineering can be utilized to improve customer satisfaction and profit ability. Specifically, this work will focus on a design methodology for the largest of systems, not necessarily in terms of physical size, but in terms of complexity and interconnectivity.

Systems engineering for very large systems

NASA Astrophysics Data System (ADS)

Lewkowicz, Paul E.

Very large integrated systems have always posed special problems for engineers. Whether they are power generation systems, computer networks or space vehicles, whenever there are multiple interfaces, complex technologies or just demanding customers, the challenges are unique. 'Systems engineering' has evolved as a discipline in order to meet these challenges by providing a structured, top-down design and development methodology for the engineer. This paper attempts to define the general class of problems requiring the complete systems engineering treatment and to show how systems engineering can be utilized to improve customer satisfaction and profit ability. Specifically, this work will focus on a design methodology for the largest of systems, not necessarily in terms of physical size, but in terms of complexity and interconnectivity.

Solving Immunology?

PubMed Central

Vodovotz, Yoram; Xia, Ashley; Read, Elizabeth L.; Bassaganya-Riera, Josep; Hafler, David A.; Sontag, Eduardo; Wang, Jin; Tsang, John S.; Day, Judy D.; Kleinstein, Steven; Butte, Atul J.; Altman, Matthew C; Hammond, Ross; Sealfon, Stuart C.

2016-01-01

Emergent responses of the immune system result from integration of molecular and cellular networks over time and across multiple organs. High-content and high-throughput analysis technologies, concomitantly with data-driven and mechanistic modeling, hold promise for systematic interrogation of these complex pathways. However, connecting genetic variation and molecular mechanisms to individual phenotypes and health outcomes has proven elusive. Gaps remain in data, and disagreements persist about the value of mechanistic modeling for immunology. Here, we present the perspectives that emerged from the NIAID workshop “Complex Systems Science, Modeling and Immunity” and subsequent discussions regarding the potential synergy of high-throughput data acquisition, data-driven modeling and mechanistic modeling to define new mechanisms of immunological disease and to accelerate the translation of these insights into therapies. PMID:27986392

Using Cognitive Control in Software Defined Networking for Port Scan Detection

DTIC Science & Technology

2017-07-01

ARL-TR-8059 ● July 2017 US Army Research Laboratory Using Cognitive Control in Software-Defined Networking for Port Scan...Cognitive Control in Software-Defined Networking for Port Scan Detection by Vinod K Mishra Computational and Information Sciences Directorate, ARL...currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. 1. REPORT DATE (DD-MM-YYYY) July 2017 2. REPORT TYPE

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.

Optimization of Self-Directed Target Coverage in Wireless Multimedia Sensor Network

PubMed Central

Yang, Yang; Wang, Yufei; Pi, Dechang; Wang, Ruchuan

2014-01-01

Video and image sensors in wireless multimedia sensor networks (WMSNs) have directed view and limited sensing angle. So the methods to solve target coverage problem for traditional sensor networks, which use circle sensing model, are not suitable for WMSNs. Based on the FoV (field of view) sensing model and FoV disk model proposed, how expected multimedia sensor covers the target is defined by the deflection angle between target and the sensor's current orientation and the distance between target and the sensor. Then target coverage optimization algorithms based on expected coverage value are presented for single-sensor single-target, multisensor single-target, and single-sensor multitargets problems distinguishingly. Selecting the orientation that sensor rotated to cover every target falling in the FoV disk of that sensor for candidate orientations and using genetic algorithm to multisensor multitargets problem, which has NP-complete complexity, then result in the approximated minimum subset of sensors which covers all the targets in networks. Simulation results show the algorithm's performance and the effect of number of targets on the resulting subset. PMID:25136667

A Nanotechnology-Ready Computing Scheme based on a Weakly Coupled Oscillator Network

NASA Astrophysics Data System (ADS)

Vodenicarevic, Damir; Locatelli, Nicolas; Abreu Araujo, Flavio; Grollier, Julie; Querlioz, Damien

2017-03-01

With conventional transistor technologies reaching their limits, alternative computing schemes based on novel technologies are currently gaining considerable interest. Notably, promising computing approaches have proposed to leverage the complex dynamics emerging in networks of coupled oscillators based on nanotechnologies. The physical implementation of such architectures remains a true challenge, however, as most proposed ideas are not robust to nanotechnology devices’ non-idealities. In this work, we propose and investigate the implementation of an oscillator-based architecture, which can be used to carry out pattern recognition tasks, and which is tailored to the specificities of nanotechnologies. This scheme relies on a weak coupling between oscillators, and does not require a fine tuning of the coupling values. After evaluating its reliability under the severe constraints associated to nanotechnologies, we explore the scalability of such an architecture, suggesting its potential to realize pattern recognition tasks using limited resources. We show that it is robust to issues like noise, variability and oscillator non-linearity. Defining network optimization design rules, we show that nano-oscillator networks could be used for efficient cognitive processing.

CyREST: Turbocharging Cytoscape Access for External Tools via a RESTful API.

PubMed

Ono, Keiichiro; Muetze, Tanja; Kolishovski, Georgi; Shannon, Paul; Demchak, Barry

2015-01-01

As bioinformatic workflows become increasingly complex and involve multiple specialized tools, so does the difficulty of reliably reproducing those workflows. Cytoscape is a critical workflow component for executing network visualization, analysis, and publishing tasks, but it can be operated only manually via a point-and-click user interface. Consequently, Cytoscape-oriented tasks are laborious and often error prone, especially with multistep protocols involving many networks. In this paper, we present the new cyREST Cytoscape app and accompanying harmonization libraries. Together, they improve workflow reproducibility and researcher productivity by enabling popular languages (e.g., Python and R, JavaScript, and C#) and tools (e.g., IPython/Jupyter Notebook and RStudio) to directly define and query networks, and perform network analysis, layouts and renderings. We describe cyREST's API and overall construction, and present Python- and R-based examples that illustrate how Cytoscape can be integrated into large scale data analysis pipelines. cyREST is available in the Cytoscape app store (http://apps.cytoscape.org) where it has been downloaded over 1900 times since its release in late 2014.

An Embedded Sensor Node Microcontroller with Crypto-Processors.

PubMed

Panić, Goran; Stecklina, Oliver; Stamenković, Zoran

2016-04-27

Wireless sensor network applications range from industrial automation and control, agricultural and environmental protection, to surveillance and medicine. In most applications, data are highly sensitive and must be protected from any type of attack and abuse. Security challenges in wireless sensor networks are mainly defined by the power and computing resources of sensor devices, memory size, quality of radio channels and susceptibility to physical capture. In this article, an embedded sensor node microcontroller designed to support sensor network applications with severe security demands is presented. It features a low power 16-bitprocessor core supported by a number of hardware accelerators designed to perform complex operations required by advanced crypto algorithms. The microcontroller integrates an embedded Flash and an 8-channel 12-bit analog-to-digital converter making it a good solution for low-power sensor nodes. The article discusses the most important security topics in wireless sensor networks and presents the architecture of the proposed hardware solution. Furthermore, it gives details on the chip implementation, verification and hardware evaluation. Finally, the chip power dissipation and performance figures are estimated and analyzed.

A Nanotechnology-Ready Computing Scheme based on a Weakly Coupled Oscillator Network.

PubMed

Vodenicarevic, Damir; Locatelli, Nicolas; Abreu Araujo, Flavio; Grollier, Julie; Querlioz, Damien

2017-03-21

With conventional transistor technologies reaching their limits, alternative computing schemes based on novel technologies are currently gaining considerable interest. Notably, promising computing approaches have proposed to leverage the complex dynamics emerging in networks of coupled oscillators based on nanotechnologies. The physical implementation of such architectures remains a true challenge, however, as most proposed ideas are not robust to nanotechnology devices' non-idealities. In this work, we propose and investigate the implementation of an oscillator-based architecture, which can be used to carry out pattern recognition tasks, and which is tailored to the specificities of nanotechnologies. This scheme relies on a weak coupling between oscillators, and does not require a fine tuning of the coupling values. After evaluating its reliability under the severe constraints associated to nanotechnologies, we explore the scalability of such an architecture, suggesting its potential to realize pattern recognition tasks using limited resources. We show that it is robust to issues like noise, variability and oscillator non-linearity. Defining network optimization design rules, we show that nano-oscillator networks could be used for efficient cognitive processing.

A Nanotechnology-Ready Computing Scheme based on a Weakly Coupled Oscillator Network

PubMed Central

Vodenicarevic, Damir; Locatelli, Nicolas; Abreu Araujo, Flavio; Grollier, Julie; Querlioz, Damien

2017-01-01

With conventional transistor technologies reaching their limits, alternative computing schemes based on novel technologies are currently gaining considerable interest. Notably, promising computing approaches have proposed to leverage the complex dynamics emerging in networks of coupled oscillators based on nanotechnologies. The physical implementation of such architectures remains a true challenge, however, as most proposed ideas are not robust to nanotechnology devices’ non-idealities. In this work, we propose and investigate the implementation of an oscillator-based architecture, which can be used to carry out pattern recognition tasks, and which is tailored to the specificities of nanotechnologies. This scheme relies on a weak coupling between oscillators, and does not require a fine tuning of the coupling values. After evaluating its reliability under the severe constraints associated to nanotechnologies, we explore the scalability of such an architecture, suggesting its potential to realize pattern recognition tasks using limited resources. We show that it is robust to issues like noise, variability and oscillator non-linearity. Defining network optimization design rules, we show that nano-oscillator networks could be used for efficient cognitive processing. PMID:28322262

An Embedded Sensor Node Microcontroller with Crypto-Processors

PubMed Central

Panić, Goran; Stecklina, Oliver; Stamenković, Zoran

2016-01-01

Wireless sensor network applications range from industrial automation and control, agricultural and environmental protection, to surveillance and medicine. In most applications, data are highly sensitive and must be protected from any type of attack and abuse. Security challenges in wireless sensor networks are mainly defined by the power and computing resources of sensor devices, memory size, quality of radio channels and susceptibility to physical capture. In this article, an embedded sensor node microcontroller designed to support sensor network applications with severe security demands is presented. It features a low power 16-bitprocessor core supported by a number of hardware accelerators designed to perform complex operations required by advanced crypto algorithms. The microcontroller integrates an embedded Flash and an 8-channel 12-bit analog-to-digital converter making it a good solution for low-power sensor nodes. The article discusses the most important security topics in wireless sensor networks and presents the architecture of the proposed hardware solution. Furthermore, it gives details on the chip implementation, verification and hardware evaluation. Finally, the chip power dissipation and performance figures are estimated and analyzed. PMID:27128925

STEPP--Search Tool for Exploration of Petri net Paths: a new tool for Petri net-based path analysis in biochemical networks.

PubMed

Koch, Ina; Schueler, Markus; Heiner, Monika

2005-01-01

To understand biochemical processes caused by, e. g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber.

STEPP - Search Tool for Exploration of Petri net Paths: A New Tool for Petri Net-Based Path Analysis in Biochemical Networks.

PubMed

Koch, Ina; Schüler, Markus; Heiner, Monika

2011-01-01

To understand biochemical processes caused by, e.g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber. http://sanaga.tfh-berlin.de/~stepp/

CyREST: Turbocharging Cytoscape Access for External Tools via a RESTful API

PubMed Central

Ono, Keiichiro; Muetze, Tanja; Kolishovski, Georgi; Shannon, Paul; Demchak, Barry

2015-01-01

As bioinformatic workflows become increasingly complex and involve multiple specialized tools, so does the difficulty of reliably reproducing those workflows. Cytoscape is a critical workflow component for executing network visualization, analysis, and publishing tasks, but it can be operated only manually via a point-and-click user interface. Consequently, Cytoscape-oriented tasks are laborious and often error prone, especially with multistep protocols involving many networks. In this paper, we present the new cyREST Cytoscape app and accompanying harmonization libraries. Together, they improve workflow reproducibility and researcher productivity by enabling popular languages (e.g., Python and R, JavaScript, and C#) and tools (e.g., IPython/Jupyter Notebook and RStudio) to directly define and query networks, and perform network analysis, layouts and renderings. We describe cyREST’s API and overall construction, and present Python- and R-based examples that illustrate how Cytoscape can be integrated into large scale data analysis pipelines. cyREST is available in the Cytoscape app store (http://apps.cytoscape.org) where it has been downloaded over 1900 times since its release in late 2014. PMID:26672762

Proteomics and Systems Biology: Current and Future Applications in the Nutritional Sciences1

PubMed Central

Moore, J. Bernadette; Weeks, Mark E.

2011-01-01

In the last decade, advances in genomics, proteomics, and metabolomics have yielded large-scale datasets that have driven an interest in global analyses, with the objective of understanding biological systems as a whole. Systems biology integrates computational modeling and experimental biology to predict and characterize the dynamic properties of biological systems, which are viewed as complex signaling networks. Whereas the systems analysis of disease-perturbed networks holds promise for identification of drug targets for therapy, equally the identified critical network nodes may be targeted through nutritional intervention in either a preventative or therapeutic fashion. As such, in the context of the nutritional sciences, it is envisioned that systems analysis of normal and nutrient-perturbed signaling networks in combination with knowledge of underlying genetic polymorphisms will lead to a future in which the health of individuals will be improved through predictive and preventative nutrition. Although high-throughput transcriptomic microarray data were initially most readily available and amenable to systems analysis, recent technological and methodological advances in MS have contributed to a linear increase in proteomic investigations. It is now commonplace for combined proteomic technologies to generate complex, multi-faceted datasets, and these will be the keystone of future systems biology research. This review will define systems biology, outline current proteomic methodologies, highlight successful applications of proteomics in nutrition research, and discuss the challenges for future applications of systems biology approaches in the nutritional sciences. PMID:22332076

An Integrative Analysis of Preeclampsia Based on the Construction of an Extended Composite Network Featuring Protein-Protein Physical Interactions and Transcriptional Relationships

PubMed Central

Vaiman, Daniel; Miralles, Francisco

2016-01-01

Preeclampsia (PE) is a pregnancy disorder defined by hypertension and proteinuria. This disease remains a major cause of maternal and fetal morbidity and mortality. Defective placentation is generally described as being at the root of the disease. The characterization of the transcriptome signature of the preeclamptic placenta has allowed to identify differentially expressed genes (DEGs). However, we still lack a detailed knowledge on how these DEGs impact the function of the placenta. The tools of network biology offer a methodology to explore complex diseases at a systems level. In this study we performed a cross-platform meta-analysis of seven publically available gene expression datasets comparing non-pathological and preeclamptic placentas. Using the rank product algorithm we identified a total of 369 DEGs consistently modified in PE. The DEGs were used as seeds to build both an extended physical protein-protein interactions network and a transcription factors regulatory network. Topological and clustering analysis was conducted to analyze the connectivity properties of the networks. Finally both networks were merged into a composite network which presents an integrated view of the regulatory pathways involved in preeclampsia and the crosstalk between them. This network is a useful tool to explore the relationship between the DEGs and enable hypothesis generation for functional experimentation. PMID:27802351

Activity of cardiorespiratory networks revealed by transsynaptic virus expressing GFP.

PubMed

Irnaten, M; Neff, R A; Wang, J; Loewy, A D; Mettenleiter, T C; Mendelowitz, D

2001-01-01

A fluorescent transneuronal marker capable of labeling individual neurons in a central network while maintaining their normal physiology would permit functional studies of neurons within entire networks responsible for complex behaviors such as cardiorespiratory reflexes. The Bartha strain of pseudorabies virus (PRV), an attenuated swine alpha herpesvirus, can be used as a transsynaptic marker of neural circuits. Bartha PRV invades neuronal networks in the CNS through peripherally projecting axons, replicates in these parent neurons, and then travels transsynaptically to continue labeling the second- and higher-order neurons in a time-dependent manner. A Bartha PRV mutant that expresses green fluorescent protein (GFP) was used to visualize and record from neurons that determine the vagal motor outflow to the heart. Here we show that Bartha PRV-GFP-labeled neurons retain their normal electrophysiological properties and that the labeled baroreflex pathways that control heart rate are unaltered by the virus. This novel transynaptic virus permits in vitro studies of identified neurons within functionally defined neuronal systems including networks that mediate cardiovascular and respiratory function and interactions. We also demonstrate superior laryngeal motorneurons fire spontaneously and synapse on cardiac vagal neurons in the nucleus ambiguus. This cardiorespiratory pathway provides a neural basis of respiratory sinus arrhythmias.

Non-consensus opinion model with a neutral view on complex networks

NASA Astrophysics Data System (ADS)

Tian, Zihao; Dong, Gaogao; Du, Ruijin; Ma, Jing

2016-05-01

A nonconsensus opinion (NCO) model was introduced recently, which allows the stable coexistence of minority and majority opinions. However, due ​to disparities in the knowledge, experiences, and personality or self-protection of agents, they often remain ​neutral when faced with some opinions in real scenarios. ​To address this issue, we propose a general non-consensus opinion model with neutral view (NCON) ​and we define the dynamic opinion ​change process. We applied the NCON model to different topological networks and studied the formation of opinion clusters. In the case of random graphs, random regular networks, and scale-free (SF) networks, we found that the system moved from a continuous phase transition to a discontinuous phase transition as the connectivity density and exponent of the SF network λ ​decreased and increased in the steady state, respectively. Moreover, the initial proportions of neutral opinions were found to have little effect on the proportional structure of opinions at the steady state. These results suggest that the majority choice between positive and negative opinions depends on the initial proportion of each opinion. The NCON model may have potential applications for decision makers.

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.

Bayesian module identification from multiple noisy networks.

PubMed

Zamani Dadaneh, Siamak; Qian, Xiaoning

2016-12-01

Module identification has been studied extensively in order to gain deeper understanding of complex systems, such as social networks as well as biological networks. Modules are often defined as groups of vertices in these networks that are topologically cohesive with similar interaction patterns with the rest of the vertices. Most of the existing module identification algorithms assume that the given networks are faithfully measured without errors. However, in many real-world applications, for example, when analyzing protein-protein interaction networks from high-throughput profiling techniques, there is significant noise with both false positive and missing links between vertices. In this paper, we propose a new model for more robust module identification by taking advantage of multiple observed networks with significant noise so that signals in multiple networks can be strengthened and help improve the solution quality by combining information from various sources. We adopt a hierarchical Bayesian model to integrate multiple noisy snapshots that capture the underlying modular structure of the networks under study. By introducing a latent root assignment matrix and its relations to instantaneous module assignments in all the observed networks to capture the underlying modular structure and combine information across multiple networks, an efficient variational Bayes algorithm can be derived to accurately and robustly identify the underlying modules from multiple noisy networks. Experiments on synthetic and protein-protein interaction data sets show that our proposed model enhances both the accuracy and resolution in detecting cohesive modules, and it is less vulnerable to noise in the observed data. In addition, it shows higher power in predicting missing edges compared to individual-network methods.

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.

Identification of Conserved Moieties in Metabolic Networks by Graph Theoretical Analysis of Atom Transition Networks

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

Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.

Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moietymore » with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. Finally, we also give examples of new applications made possible by elucidating the atomic structure of conserved moieties.« less

An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm

PubMed Central

Lu, Guangquan; Xiong, Ying; Wang, Yunpeng

2016-01-01

The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem. We fill this research gap by proposing an optimal schedule for urban road network repair with limited repair resources based on the greedy algorithm. Critical links will be given priority in repair according to the basic concept of the greedy algorithm. In this study, the link whose restoration produces the ratio of the system-wide travel time of the current network to the worst network is the minimum. We define such a link as the critical link for the current network. We will re-evaluate the importance of damaged links after each repair process is completed. That is, the critical link ranking will be changed along with the repair process because of the interaction among links. We repair the most critical link for the specific network state based on the greedy algorithm to obtain the optimal schedule. The algorithm can still quickly obtain an optimal schedule even if the scale of the road network is large because the greedy algorithm can reduce computational complexity. We prove that the problem can obtain the optimal solution using the greedy algorithm in theory. The algorithm is also demonstrated in the Sioux Falls network. The problem discussed in this paper is highly significant in dealing with urban road network restoration. PMID:27768732

Identification of Conserved Moieties in Metabolic Networks by Graph Theoretical Analysis of Atom Transition Networks

PubMed Central

Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.

2016-01-01

Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties. PMID:27870845

Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space.

PubMed

Ahnert, S E; Fink, T M A

2016-07-01

Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the 'function' of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature. © 2016 The Authors.

Identification of Conserved Moieties in Metabolic Networks by Graph Theoretical Analysis of Atom Transition Networks

DOE PAGES

Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.

2016-11-21

Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moietymore » with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. Finally, we also give examples of new applications made possible by elucidating the atomic structure of conserved moieties.« less

Identification of Conserved Moieties in Metabolic Networks by Graph Theoretical Analysis of Atom Transition Networks.

PubMed

Haraldsdóttir, Hulda S; Fleming, Ronan M T

2016-11-01

Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties.

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.

The trajectory of life. Decreasing physiological network complexity through changing fractal patterns

PubMed Central

Sturmberg, Joachim P.; Bennett, Jeanette M.; Picard, Martin; Seely, Andrew J. E.

2015-01-01

In this position paper, we submit a synthesis of theoretical models based on physiology, non-equilibrium thermodynamics, and non-linear time-series analysis. Based on an understanding of the human organism as a system of interconnected complex adaptive systems, we seek to examine the relationship between health, complexity, variability, and entropy production, as it might be useful to help understand aging, and improve care for patients. We observe the trajectory of life is characterized by the growth, plateauing and subsequent loss of adaptive function of organ systems, associated with loss of functioning and coordination of systems. Understanding development and aging requires the examination of interdependence among these organ systems. Increasing evidence suggests network interconnectedness and complexity can be captured/measured/associated with the degree and complexity of healthy biologic rhythm variability (e.g., heart and respiratory rate variability). We review physiological mechanisms linking the omics, arousal/stress systems, immune function, and mitochondrial bioenergetics; highlighting their interdependence in normal physiological function and aging. We argue that aging, known to be characterized by a loss of variability, is manifested at multiple scales, within functional units at the small scale, and reflected by diagnostic features at the larger scale. While still controversial and under investigation, it appears conceivable that the integrity of whole body complexity may be, at least partially, reflected in the degree and variability of intrinsic biologic rhythms, which we believe are related to overall system complexity that may be a defining feature of health and it's loss through aging. Harnessing this information for the development of therapeutic and preventative strategies may hold an opportunity to significantly improve the health of our patients across the trajectory of life. PMID:26082722

Complex Conjugated certificateless-based signcryption with differential integrated factor for secured message communication in mobile network

PubMed Central

Rajagopalan, S. P.

2017-01-01

Certificateless-based signcryption overcomes inherent shortcomings in traditional Public Key Infrastructure (PKI) and Key Escrow problem. It imparts efficient methods to design PKIs with public verifiability and cipher text authenticity with minimum dependency. As a classic primitive in public key cryptography, signcryption performs validity of cipher text without decryption by combining authentication, confidentiality, public verifiability and cipher text authenticity much more efficiently than the traditional approach. In this paper, we first define a security model for certificateless-based signcryption called, Complex Conjugate Differential Integrated Factor (CC-DIF) scheme by introducing complex conjugates through introduction of the security parameter and improving secured message distribution rate. However, both partial private key and secret value changes with respect to time. To overcome this weakness, a new certificateless-based signcryption scheme is proposed by setting the private key through Differential (Diff) Equation using an Integration Factor (DiffEIF), minimizing computational cost and communication overhead. The scheme is therefore said to be proven secure (i.e. improving the secured message distributing rate) against certificateless access control and signcryption-based scheme. In addition, compared with the three other existing schemes, the CC-DIF scheme has the least computational cost and communication overhead for secured message communication in mobile network. PMID:29040290

Complex Conjugated certificateless-based signcryption with differential integrated factor for secured message communication in mobile network.

PubMed

Alagarsamy, Sumithra; Rajagopalan, S P

2017-01-01

Certificateless-based signcryption overcomes inherent shortcomings in traditional Public Key Infrastructure (PKI) and Key Escrow problem. It imparts efficient methods to design PKIs with public verifiability and cipher text authenticity with minimum dependency. As a classic primitive in public key cryptography, signcryption performs validity of cipher text without decryption by combining authentication, confidentiality, public verifiability and cipher text authenticity much more efficiently than the traditional approach. In this paper, we first define a security model for certificateless-based signcryption called, Complex Conjugate Differential Integrated Factor (CC-DIF) scheme by introducing complex conjugates through introduction of the security parameter and improving secured message distribution rate. However, both partial private key and secret value changes with respect to time. To overcome this weakness, a new certificateless-based signcryption scheme is proposed by setting the private key through Differential (Diff) Equation using an Integration Factor (DiffEIF), minimizing computational cost and communication overhead. The scheme is therefore said to be proven secure (i.e. improving the secured message distributing rate) against certificateless access control and signcryption-based scheme. In addition, compared with the three other existing schemes, the CC-DIF scheme has the least computational cost and communication overhead for secured message communication in mobile network.