Global exponential periodicity and stability of discrete-time complex-valued recurrent neural networks with time-delays.

PubMed

Hu, Jin; Wang, Jun

2015-06-01

In recent years, complex-valued recurrent neural networks have been developed and analysed in-depth in view of that they have good modelling performance for some applications involving complex-valued elements. In implementing continuous-time dynamical systems for simulation or computational purposes, it is quite necessary to utilize a discrete-time model which is an analogue of the continuous-time system. In this paper, we analyse a discrete-time complex-valued recurrent neural network model and obtain the sufficient conditions on its global exponential periodicity and exponential stability. Simulation results of several numerical examples are delineated to illustrate the theoretical results and an application on associative memory is also given. Copyright © 2015 Elsevier Ltd. All rights reserved.

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.

Prediction of missing links and reconstruction of complex networks

NASA Astrophysics Data System (ADS)

Zhang, Cheng-Jun; Zeng, An

2016-04-01

Predicting missing links in complex networks is of great significance from both theoretical and practical point of view, which not only helps us understand the evolution of real systems but also relates to many applications in social, biological and online systems. In this paper, we study the features of different simple link prediction methods, revealing that they may lead to the distortion of networks’ structural and dynamical properties. Moreover, we find that high prediction accuracy is not definitely corresponding to a high performance in preserving the network properties when using link prediction methods to reconstruct networks. Our work highlights the importance of considering the feedback effect of the link prediction methods on network properties when designing the algorithms.

Complex networks as an emerging property of hierarchical preferential attachment.

PubMed

Hébert-Dufresne, Laurent; Laurence, Edward; Allard, Antoine; Young, Jean-Gabriel; Dubé, Louis J

2015-12-01

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of complex systems can be modeled as an organization of many embedded levels (potentially infinite in number), all of them following the same universal growth principle known as preferential attachment. We give examples of such hierarchy in real systems, for instance, in the pyramid of production entities of the film industry. More importantly, we show how real complex networks can be interpreted as a projection of our model, from which their scale independence, their clustering, their hierarchy, their fractality, and their navigability naturally emerge. Our results suggest that complex networks, viewed as growing systems, can be quite simple, and that the apparent complexity of their structure is largely a reflection of their unobserved hierarchical nature.

Complex networks as an emerging property of hierarchical preferential attachment

NASA Astrophysics Data System (ADS)

Hébert-Dufresne, Laurent; Laurence, Edward; Allard, Antoine; Young, Jean-Gabriel; Dubé, Louis J.

2015-12-01

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of complex systems can be modeled as an organization of many embedded levels (potentially infinite in number), all of them following the same universal growth principle known as preferential attachment. We give examples of such hierarchy in real systems, for instance, in the pyramid of production entities of the film industry. More importantly, we show how real complex networks can be interpreted as a projection of our model, from which their scale independence, their clustering, their hierarchy, their fractality, and their navigability naturally emerge. Our results suggest that complex networks, viewed as growing systems, can be quite simple, and that the apparent complexity of their structure is largely a reflection of their unobserved hierarchical nature.

Game theory and extremal optimization for community detection in complex dynamic networks.

PubMed

Lung, Rodica Ioana; Chira, Camelia; Andreica, Anca

2014-01-01

The detection of evolving communities in dynamic complex networks is a challenging problem that recently received attention from the research community. Dynamics clearly add another complexity dimension to the difficult task of community detection. Methods should be able to detect changes in the network structure and produce a set of community structures corresponding to different timestamps and reflecting the evolution in time of network data. We propose a novel approach based on game theory elements and extremal optimization to address dynamic communities detection. Thus, the problem is formulated as a mathematical game in which nodes take the role of players that seek to choose a community that maximizes their profit viewed as a fitness function. Numerical results obtained for both synthetic and real-world networks illustrate the competitive performance of this game theoretical approach.

Contingency diagrams as teaching tools.

PubMed

Mattaini, M A

1995-01-01

Contingency diagrams are particularly effective teaching tools, because they provide a means for students to view the complexities of contingency networks present in natural and laboratory settings while displaying the elementary processes that constitute those networks. This paper sketches recent developments in this visualization technology and illustrates approaches for using contingency diagrams in teaching.

Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison

NASA Astrophysics Data System (ADS)

De Domenico, Manlio; Biamonte, Jacob

2016-10-01

Any physical system can be viewed from the perspective that information is implicitly represented in its state. However, the quantification of this information when it comes to complex networks has remained largely elusive. In this work, we use techniques inspired by quantum statistical mechanics to define an entropy measure for complex networks and to develop a set of information-theoretic tools, based on network spectral properties, such as Rényi q entropy, generalized Kullback-Leibler and Jensen-Shannon divergences, the latter allowing us to define a natural distance measure between complex networks. First, we show that by minimizing the Kullback-Leibler divergence between an observed network and a parametric network model, inference of model parameter(s) by means of maximum-likelihood estimation can be achieved and model selection can be performed with appropriate information criteria. Second, we show that the information-theoretic metric quantifies the distance between pairs of networks and we can use it, for instance, to cluster the layers of a multilayer system. By applying this framework to networks corresponding to sites of the human microbiome, we perform hierarchical cluster analysis and recover with high accuracy existing community-based associations. Our results imply that spectral-based statistical inference in complex networks results in demonstrably superior performance as well as a conceptual backbone, filling a gap towards a network information theory.

Mimoza: web-based semantic zooming and navigation in metabolic networks.

PubMed

Zhukova, Anna; Sherman, David J

2015-02-26

The complexity of genome-scale metabolic models makes them quite difficult for human users to read, since they contain thousands of reactions that must be included for accurate computer simulation. Interestingly, hidden similarities between groups of reactions can be discovered, and generalized to reveal higher-level patterns. The web-based navigation system Mimoza allows a human expert to explore metabolic network models in a semantically zoomable manner: The most general view represents the compartments of the model; the next view shows the generalized versions of reactions and metabolites in each compartment; and the most detailed view represents the initial network with the generalization-based layout (where similar metabolites and reactions are placed next to each other). It allows a human expert to grasp the general structure of the network and analyze it in a top-down manner Mimoza can be installed standalone, or used on-line at http://mimoza.bordeaux.inria.fr/ , or installed in a Galaxy server for use in workflows. Mimoza views can be embedded in web pages, or downloaded as COMBINE archives.

From CMS to SNS: Educational Networking for Urban Teachers

ERIC Educational Resources Information Center

Chen, Pearl

2011-01-01

A complex view of the socioeconomic digital divide in urban schools requires us to address not only the gaps in access to technology, but also inequities in access to human support, digital content, and "effective pedagogical" approaches to technology integration. This study explored the use of social networking site (SNS) as a platform…

A network dynamics approach to chemical reaction networks

NASA Astrophysics Data System (ADS)

van der Schaft, A. J.; Rao, S.; Jayawardhana, B.

2016-04-01

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.

A study of the Immune Epitope Database for some fungi species using network topological indices.

PubMed

Vázquez-Prieto, Severo; Paniagua, Esperanza; Solana, Hugo; Ubeira, Florencio M; González-Díaz, Humberto

2017-08-01

In the last years, the encryption of system structure information with different network topological indices has been a very active field of research. In the present study, we assembled for the first time a complex network using data obtained from the Immune Epitope Database for fungi species, and we then considered the general topology, the node degree distribution, and the local structure of this network. We also calculated eight node centrality measures for the observed network and compared it with three theoretical models. In view of the results obtained, we may expect that the present approach can become a valuable tool to explore the complexity of this database, as well as for the storage, manipulation, comparison, and retrieval of information contained therein.

Localization and Spreading of Diseases in Complex Networks

NASA Astrophysics Data System (ADS)

Goltsev, A. V.; Dorogovtsev, S. N.; Oliveira, J. G.; Mendes, J. F. F.

2012-09-01

Using the susceptible-infected-susceptible model on unweighted and weighted networks, we consider the disease localization phenomenon. In contrast to the well-recognized point of view that diseases infect a finite fraction of vertices right above the epidemic threshold, we show that diseases can be localized on a finite number of vertices, where hubs and edges with large weights are centers of localization. Our results follow from the analysis of standard models of networks and empirical data for real-world networks.

Varying Tutorial Modality and Interface Restriction to Maximize Transfer in a Complex Simulation Environment

ERIC Educational Resources Information Center

Mayrath, Michael C.; Nihalani, Priya K.; Robinson, Daniel H.

2011-01-01

In 2 experiments, 241 undergraduates with low domain knowledge viewed a tutorial on how to use Packet Tracer (PT), a computer-networking training simulation developed by the Cisco Networking Academy. Participants were then tested on retention of tutorial content and transfer using PT. Tutorial modality (text, narration, or narration plus text) was…

Retinal Connectomics: Towards Complete, Accurate Networks

PubMed Central

Marc, Robert E.; Jones, Bryan W.; Watt, Carl B.; Anderson, James R.; Sigulinsky, Crystal; Lauritzen, Scott

2013-01-01

Connectomics is a strategy for mapping complex neural networks based on high-speed automated electron optical imaging, computational assembly of neural data volumes, web-based navigational tools to explore 1012–1015 byte (terabyte to petabyte) image volumes, and annotation and markup tools to convert images into rich networks with cellular metadata. These collections of network data and associated metadata, analyzed using tools from graph theory and classification theory, can be merged with classical systems theory, giving a more completely parameterized view of how biologic information processing systems are implemented in retina and brain. Networks have two separable features: topology and connection attributes. The first findings from connectomics strongly validate the idea that the topologies complete retinal networks are far more complex than the simple schematics that emerged from classical anatomy. In particular, connectomics has permitted an aggressive refactoring of the retinal inner plexiform layer, demonstrating that network function cannot be simply inferred from stratification; exposing the complex geometric rules for inserting different cells into a shared network; revealing unexpected bidirectional signaling pathways between mammalian rod and cone systems; documenting selective feedforward systems, novel candidate signaling architectures, new coupling motifs, and the highly complex architecture of the mammalian AII amacrine cell. This is but the beginning, as the underlying principles of connectomics are readily transferrable to non-neural cell complexes and provide new contexts for assessing intercellular communication. PMID:24016532

On the interpretation of complex network analysis of language. Comment on "Approaching human language with complex networks" by Jin Cong, Haitao Liu

NASA Astrophysics Data System (ADS)

Čech, Radek

2014-12-01

After a rapid and successful development of the theory of complex networks at the turn of the millennium [1,2], attempts to apply this theory to a language analysis emerged immediately [3,4]. The first results seemed to bring new insights to the functioning of language. Moreover, some authors assumed that this approach can even solve some fundamental problems concerning language evolution [5,6]. However, after a decade of the application of complex network theory to language analysis, the initial expectations have not been fulfilled, in my opinion, and the need for a deeper, linguistically based explanation of observed properties has been still more obvious. Cong and Liu's review [7] can be seen as a successful attempt to clarify the main aspects of this kind of research from the linguistics point of view. However, I see two problematic aspects in their study relating to the nature of the character of explanation.

Developing Visualization Techniques for Semantics-based Information Networks

NASA Technical Reports Server (NTRS)

Keller, Richard M.; Hall, David R.

2003-01-01

Information systems incorporating complex network structured information spaces with a semantic underpinning - such as hypermedia networks, semantic networks, topic maps, and concept maps - are being deployed to solve some of NASA s critical information management problems. This paper describes some of the human interaction and navigation problems associated with complex semantic information spaces and describes a set of new visual interface approaches to address these problems. A key strategy is to leverage semantic knowledge represented within these information spaces to construct abstractions and views that will be meaningful to the human user. Human-computer interaction methodologies will guide the development and evaluation of these approaches, which will benefit deployed NASA systems and also apply to information systems based on the emerging Semantic Web.

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.

Complexity and network dynamics in physiological adaptation: an integrated view.

PubMed

Baffy, György; Loscalzo, Joseph

2014-05-28

Living organisms constantly interact with their surroundings and sustain internal stability against perturbations. This dynamic process follows three fundamental strategies (restore, explore, and abandon) articulated in historical concepts of physiological adaptation such as homeostasis, allostasis, and the general adaptation syndrome. These strategies correspond to elementary forms of behavior (ordered, chaotic, and static) in complex adaptive systems and invite a network-based analysis of the operational characteristics, allowing us to propose an integrated framework of physiological adaptation from a complex network perspective. Applicability of this concept is illustrated by analyzing molecular and cellular mechanisms of adaptation in response to the pervasive challenge of obesity, a chronic condition resulting from sustained nutrient excess that prompts chaotic exploration for system stability associated with tradeoffs and a risk of adverse outcomes such as diabetes, cardiovascular disease, and cancer. Deconstruction of this complexity holds the promise of gaining novel insights into physiological adaptation in health and disease. Published by Elsevier Inc.

Identifying influential spreaders in complex networks based on gravity formula

NASA Astrophysics Data System (ADS)

Ma, Ling-ling; Ma, Chuang; Zhang, Hai-Feng; Wang, Bing-Hong

2016-06-01

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gravity centrality index to identify the influential spreaders in complex networks. The comparison between the gravity centrality index and some well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, and k-shell centrality, and so forth, indicates that our method can effectively identify the influential spreaders in real networks as well as synthetic networks. We also use the classical Susceptible-Infected-Recovered (SIR) epidemic model to verify the good performance of our method.

Emergence of fractal scaling in complex networks

NASA Astrophysics Data System (ADS)

Wei, Zong-Wen; Wang, Bing-Hong

2016-09-01

Some real-world networks are shown to be fractal or self-similar. It is widespread that such a phenomenon originates from the repulsion between hubs or disassortativity. Here we show that this common belief fails to capture the causality. Our key insight to address it is to pinpoint links critical to fractality. Those links with small edge betweenness centrality (BC) constitute a special architecture called fractal reference system, which gives birth to the fractal structure of those reported networks. In contrast, a small amount of links with high BC enable small-world effects, hiding the intrinsic fractality. With enough of such links removed, fractal scaling spontaneously arises from nonfractal networks. Our results provide a multiple-scale view on the structure and dynamics and place fractality as a generic organizing principle of complex networks on a firmer ground.

Contingency diagrams as teaching tools

PubMed Central

Mattaini, Mark A.

1995-01-01

Contingency diagrams are particularly effective teaching tools, because they provide a means for students to view the complexities of contingency networks present in natural and laboratory settings while displaying the elementary processes that constitute those networks. This paper sketches recent developments in this visualization technology and illustrates approaches for using contingency diagrams in teaching. ImagesFigure 2Figure 3Figure 4 PMID:22478208

An integrated GIS-based data model for multimodal urban public transportation analysis and management

NASA Astrophysics Data System (ADS)

Chen, Shaopei; Tan, Jianjun; Ray, C.; Claramunt, C.; Sun, Qinqin

2008-10-01

Diversity is one of the main characteristics of transportation data collected from multiple sources or formats, which can be extremely complex and disparate. Moreover, these multimodal transportation data are usually characterised by spatial and temporal properties. Multimodal transportation network data modelling involves both an engineering and research domain that has attracted the design of a number of spatio-temporal data models in the geographic information system (GIS). However, the application of these specific models to multimodal transportation network is still a challenging task. This research addresses this challenge from both integrated multimodal data organization and object-oriented modelling perspectives, that is, how a complex urban transportation network should be organized, represented and modeled appropriately when considering a multimodal point of view, and using object-oriented modelling method. We proposed an integrated GIS-based data model for multimodal urban transportation network that lays a foundation to enhance the multimodal transportation network analysis and management. This modelling method organizes and integrates multimodal transit network data, and supports multiple representations for spatio-temporal objects and relationship as both visual and graphic views. The data model is expressed by using a spatio-temporal object-oriented modelling method, i.e., the unified modelling language (UML) extended to spatial and temporal plug-in for visual languages (PVLs), which provides an essential support to the spatio-temporal data modelling for transportation GIS.

Robot, computer problem solving system

NASA Technical Reports Server (NTRS)

Becker, J. D.; Merriam, E. W.

1973-01-01

The TENEX computer system, the ARPA network, and computer language design technology was applied to support the complex system programs. By combining the pragmatic and theoretical aspects of robot development, an approach is created which is grounded in realism, but which also has at its disposal the power that comes from looking at complex problems from an abstract analytical point of view.

Social networks and family violence in cross-cultural perspective.

PubMed

Korbin, J E

1995-01-01

The purpose of this chapter was twofold. First, the chapter put forward a brief cross-cultural perspective indicating that multiple types of intrafamilial violence occur cross-culturally. Second, the chapter placed social networks at the core of a complex etiology of intrafamilial violence. The purpose of giving centrality to social networks is not to suggest that social networks are the sole or primary agent contributing to family violence but to broaden the context in which family violence is viewed beyond that of the perpetrator, the victim/survivor, or the violent dyad.

Weighted Networks at the Polish Market

NASA Astrophysics Data System (ADS)

Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.

During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.

Fast Fragmentation of Networks Using Module-Based Attacks

PubMed Central

Requião da Cunha, Bruno; González-Avella, Juan Carlos; Gonçalves, Sebastián

2015-01-01

In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from a practical point of view. In this contribution, we present a module-based method to efficiently fragment complex networks. The procedure firstly identifies topological communities through which the network can be represented using a well established heuristic algorithm of community finding. Then only the nodes that participate of inter-community links are removed in descending order of their betweenness centrality. We illustrate the method by applying it to a variety of examples in the social, infrastructure, and biological fields. It is shown that the module-based approach always outperforms targeted attacks to vertices based on node degree or betweenness centrality rankings, with gains in efficiency strongly related to the modularity of the network. Remarkably, in the US power grid case, by deleting 3% of the nodes, the proposed method breaks the original network in fragments which are twenty times smaller in size than the fragments left by betweenness-based attack. PMID:26569610

Artificial neural network in cosmic landscape

NASA Astrophysics Data System (ADS)

Liu, Junyu

2017-12-01

In this paper we propose that artificial neural network, the basis of machine learning, is useful to generate the inflationary landscape from a cosmological point of view. Traditional numerical simulations of a global cosmic landscape typically need an exponential complexity when the number of fields is large. However, a basic application of artificial neural network could solve the problem based on the universal approximation theorem of the multilayer perceptron. A toy model in inflation with multiple light fields is investigated numerically as an example of such an application.

Discovering urban mobility patterns with PageRank based traffic modeling and prediction

NASA Astrophysics Data System (ADS)

Wang, Minjie; Yang, Su; Sun, Yi; Gao, Jun

2017-11-01

Urban transportation system can be viewed as complex network with time-varying traffic flows as links to connect adjacent regions as networked nodes. By computing urban traffic evolution on such temporal complex network with PageRank, it is found that for most regions, there exists a linear relation between the traffic congestion measure at present time and the PageRank value of the last time. Since the PageRank measure of a region does result from the mutual interactions of the whole network, it implies that the traffic state of a local region does not evolve independently but is affected by the evolution of the whole network. As a result, the PageRank values can act as signatures in predicting upcoming traffic congestions. We observe the aforementioned laws experimentally based on the trajectory data of 12000 taxies in Beijing city for one month.

Free energy surface of the Michaelis complex of lactate dehydrogenase: a network analysis of microsecond simulations.

PubMed

Pan, Xiaoliang; Schwartz, Steven D

2015-04-30

It has long been recognized that the structure of a protein creates a hierarchy of conformations interconverting on multiple time scales. The conformational heterogeneity of the Michaelis complex is of particular interest in the context of enzymatic catalysis in which the reactant is usually represented by a single conformation of the enzyme/substrate complex. Lactate dehydrogenase (LDH) catalyzes the interconversion of pyruvate and lactate with concomitant interconversion of two forms of the cofactor nicotinamide adenine dinucleotide (NADH and NAD(+)). Recent experimental results suggest that multiple substates exist within the Michaelis complex of LDH, and they show a strong variance in their propensity toward the on-enzyme chemical step. In this study, microsecond-scale all-atom molecular dynamics simulations were performed on LDH to explore the free energy landscape of the Michaelis complex, and network analysis was used to characterize the distribution of the conformations. Our results provide a detailed view of the kinetic network of the Michaelis complex and the structures of the substates at atomistic scales. They also shed light on the complete picture of the catalytic mechanism of LDH.

Cellular and synaptic network defects in autism

PubMed Central

Peça, João; Feng, Guoping

2012-01-01

Many candidate genes are now thought to confer susceptibility to autism spectrum disorder (ASD). Here we review four interrelated complexes, each composed of multiple families of genes that functionally coalesce on common cellular pathways. We illustrate a common thread in the organization of glutamatergic synapses and suggest a link between genes involved in Tuberous Sclerosis Complex, Fragile X syndrome, Angelman syndrome and several synaptic ASD candidate genes. When viewed in this context, progress in deciphering the molecular architecture of cellular protein-protein interactions together with the unraveling of synaptic dysfunction in neural networks may prove pivotal to advancing our understanding of ASDs. PMID:22440525

The American Educational Industrial Complex: A Critique of a Concept Submitted to the "Journal of School Choice"

ERIC Educational Resources Information Center

Maranto, Robert; Van Raemdonck, Dirk C.

2011-01-01

Many people view subgovernments such as the "military-industrial complex" as largely self-governing and budget maximizing. Yet, as defense cutbacks in the 1970s and 1990s show, such networks do not maintain their privileged status indefinitely. In similar fashion, some claim public education is too autonomous and too focused on budget…

Student trajectories in physics: the need for analysis through a socio-cultural lens

NASA Astrophysics Data System (ADS)

Zapata, Mara

2010-09-01

An analysis of student connections through time and space relative to the core discipline of physics is attempted, as viewed through the lens of actor-network-theory, by Antonia Candela. Using lenses of cultural realities, networks, and perceived power in the discourse of one specific university in the capital city of Mexico and one undergraduate physics classroom, the trajectories and itineraries of students are analyzed, relative to a physics professor's pedagogical practices. This ethnographic study then yields comparisons between Mexican undergraduate students and students from the United States. Actor network theory recognizes that the symbiotic relationship existing between an actor and a continuum of space and time is defined by the symbiotic yet interdependent relationships and networks of practice (Lemke in Downward causation: Minds, bodies, and matter 2000). As part of this study and in line with actor-network-theory, human actors and non-human participants were viewed in relation to how subjects acted and were acted upon within networks of practice. Through this forum I reflect on this work with particular focus on the issues of situatedness of actors from a sociocultural perspective and how established networks viewed within this perspective frame and subsequently impact student trajectories and itineraries. In essence I argue for a need to look at a myriad of further complexities driving the symbiotic relationships being analyzed.

Recent advances in multiview distributed video coding

NASA Astrophysics Data System (ADS)

Dufaux, Frederic; Ouaret, Mourad; Ebrahimi, Touradj

2007-04-01

We consider dense networks of surveillance cameras capturing overlapped images of the same scene from different viewing directions, such a scenario being referred to as multi-view. Data compression is paramount in such a system due to the large amount of captured data. In this paper, we propose a Multi-view Distributed Video Coding approach. It allows for low complexity / low power consumption at the encoder side, and the exploitation of inter-view correlation without communications among the cameras. We introduce a combination of temporal intra-view side information and homography inter-view side information. Simulation results show both the improvement of the side information, as well as a significant gain in terms of coding efficiency.

Network structure of subway passenger flows

NASA Astrophysics Data System (ADS)

Xu, Q.; Mao, B. H.; Bai, Y.

2016-03-01

The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

Statistics and dynamics of attractor networks with inter-correlated patterns

NASA Astrophysics Data System (ADS)

Kropff, E.

2007-02-01

In an embodied feature representation view, the semantic memory represents concepts in the brain by the associated activation of the features that describe it, each one of them processed in a differentiated region of the cortex. This system has been modeled with a Potts attractor network. Several studies of feature representation show that the correlation between patterns plays a crucial role in semantic memory. The present work focuses on two aspects of the effect of correlations in attractor networks. In first place, it assesses how a Potts network can store a set of patterns with non-trivial correlations between them. This is done through a simple and biologically plausible modification to the classical learning rule. In second place, it studies the complexity of latching transitions between attractor states, and how this complexity can be controlled.

The structure and resilience of financial market networks

NASA Astrophysics Data System (ADS)

Kauê Dal'Maso Peron, Thomas; da Fontoura Costa, Luciano; Rodrigues, Francisco A.

2012-03-01

Financial markets can be viewed as a highly complex evolving system that is very sensitive to economic instabilities. The complex organization of the market can be represented in a suitable fashion in terms of complex networks, which can be constructed from stock prices such that each pair of stocks is connected by a weighted edge that encodes the distance between them. In this work, we propose an approach to analyze the topological and dynamic evolution of financial networks based on the stock correlation matrices. An entropy-related measurement is adopted to quantify the robustness of the evolving financial market organization. It is verified that the network topological organization suffers strong variation during financial instabilities and the networks in such periods become less robust. A statistical robust regression model is proposed to quantity the relationship between the network structure and resilience. The obtained coefficients of such model indicate that the average shortest path length is the measurement most related to network resilience coefficient. This result indicates that a collective behavior is observed between stocks during financial crisis. More specifically, stocks tend to synchronize their price evolution, leading to a high correlation between pair of stock prices, which contributes to the increase in distance between them and, consequently, decrease the network resilience.

High performance network and channel-based storage

NASA Technical Reports Server (NTRS)

Katz, Randy H.

1991-01-01

In the traditional mainframe-centered view of a computer system, storage devices are coupled to the system through complex hardware subsystems called input/output (I/O) channels. With the dramatic shift towards workstation-based computing, and its associated client/server model of computation, storage facilities are now found attached to file servers and distributed throughout the network. We discuss the underlying technology trends that are leading to high performance network-based storage, namely advances in networks, storage devices, and I/O controller and server architectures. We review several commercial systems and research prototypes that are leading to a new approach to high performance computing based on network-attached storage.

Smart Girls, Black Girls, Mean Girls, and Bullies: At the Intersection of Identities and the Mediating Role of Young Girls' Social Network in Mathematical Communities of Practice

ERIC Educational Resources Information Center

Gholson, Maisie; Martin, Danny B.

2014-01-01

By taking an intersectional and emic view to studying a group of African American girls in a third-grade class, we attempted to capture the complexity of mathematics learning for these girls. Traditionally, children's social networks in school are framed as external to mathematics content learning. Our preliminary analyses of student interviews…

A distributed database view of network tracking systems

NASA Astrophysics Data System (ADS)

Yosinski, Jason; Paffenroth, Randy

2008-04-01

In distributed tracking systems, multiple non-collocated trackers cooperate to fuse local sensor data into a global track picture. Generating this global track picture at a central location is fairly straightforward, but the single point of failure and excessive bandwidth requirements introduced by centralized processing motivate the development of decentralized methods. In many decentralized tracking systems, trackers communicate with their peers via a lossy, bandwidth-limited network in which dropped, delayed, and out of order packets are typical. Oftentimes the decentralized tracking problem is viewed as a local tracking problem with a networking twist; we believe this view can underestimate the network complexities to be overcome. Indeed, a subsequent 'oversight' layer is often introduced to detect and handle track inconsistencies arising from a lack of robustness to network conditions. We instead pose the decentralized tracking problem as a distributed database problem, enabling us to draw inspiration from the vast extant literature on distributed databases. Using the two-phase commit algorithm, a well known technique for resolving transactions across a lossy network, we describe several ways in which one may build a distributed multiple hypothesis tracking system from the ground up to be robust to typical network intricacies. We pay particular attention to the dissimilar challenges presented by network track initiation vs. maintenance and suggest a hybrid system that balances speed and robustness by utilizing two-phase commit for only track initiation transactions. Finally, we present simulation results contrasting the performance of such a system with that of more traditional decentralized tracking implementations.

The Rise of China in the International Trade Network: A Community Core Detection Approach

PubMed Central

Zhu, Zhen; Cerina, Federica; Chessa, Alessandro; Caldarelli, Guido; Riccaboni, Massimo

2014-01-01

Theory of complex networks proved successful in the description of a variety of complex systems ranging from biology to computer science and to economics and finance. Here we use network models to describe the evolution of a particular economic system, namely the International Trade Network (ITN). Previous studies often assume that globalization and regionalization in international trade are contradictory to each other. We re-examine the relationship between globalization and regionalization by viewing the international trade system as an interdependent complex network. We use the modularity optimization method to detect communities and community cores in the ITN during the years 1995–2011. We find rich dynamics over time both inter- and intra-communities. In particular, the Asia-Oceania community disappeared and reemerged over time along with a switch in leadership from Japan to China. We provide a multilevel description of the evolution of the network where the global dynamics (i.e., communities disappear or reemerge) and the regional dynamics (i.e., community core changes between community members) are related. Moreover, simulation results show that the global dynamics can be generated by a simple dynamic-edge-weight mechanism. PMID:25136895

The rise of China in the International Trade Network: a community core detection approach.

PubMed

Zhu, Zhen; Cerina, Federica; Chessa, Alessandro; Caldarelli, Guido; Riccaboni, Massimo

2014-01-01

Theory of complex networks proved successful in the description of a variety of complex systems ranging from biology to computer science and to economics and finance. Here we use network models to describe the evolution of a particular economic system, namely the International Trade Network (ITN). Previous studies often assume that globalization and regionalization in international trade are contradictory to each other. We re-examine the relationship between globalization and regionalization by viewing the international trade system as an interdependent complex network. We use the modularity optimization method to detect communities and community cores in the ITN during the years 1995-2011. We find rich dynamics over time both inter- and intra-communities. In particular, the Asia-Oceania community disappeared and reemerged over time along with a switch in leadership from Japan to China. We provide a multilevel description of the evolution of the network where the global dynamics (i.e., communities disappear or reemerge) and the regional dynamics (i.e., community core changes between community members) are related. Moreover, simulation results show that the global dynamics can be generated by a simple dynamic-edge-weight mechanism.

A review on machine learning principles for multi-view biological data integration.

PubMed

Li, Yifeng; Wu, Fang-Xiang; Ngom, Alioune

2018-03-01

Driven by high-throughput sequencing techniques, modern genomic and clinical studies are in a strong need of integrative machine learning models for better use of vast volumes of heterogeneous information in the deep understanding of biological systems and the development of predictive models. How data from multiple sources (called multi-view data) are incorporated in a learning system is a key step for successful analysis. In this article, we provide a comprehensive review on omics and clinical data integration techniques, from a machine learning perspective, for various analyses such as prediction, clustering, dimension reduction and association. We shall show that Bayesian models are able to use prior information and model measurements with various distributions; tree-based methods can either build a tree with all features or collectively make a final decision based on trees learned from each view; kernel methods fuse the similarity matrices learned from individual views together for a final similarity matrix or learning model; network-based fusion methods are capable of inferring direct and indirect associations in a heterogeneous network; matrix factorization models have potential to learn interactions among features from different views; and a range of deep neural networks can be integrated in multi-modal learning for capturing the complex mechanism of biological systems.

Free energy landscape of the Michaelis complex of lactate dehydrogenase: A network analysis of atomistic simulations

NASA Astrophysics Data System (ADS)

Pan, Xiaoliang; Schwartz, Steven

2015-03-01

It has long been recognized that the structure of a protein is a hierarchy of conformations interconverting on multiple time scales. However, the conformational heterogeneity is rarely considered in the context of enzymatic catalysis in which the reactant is usually represented by a single conformation of the enzyme/substrate complex. Lactate dehydrogenase (LDH) catalyzes the interconversion of pyruvate and lactate with concomitant interconversion of two forms of the cofactor nicotinamide adenine dinucleotide (NADH and NAD+). Recent experimental results suggest that multiple substates exist within the Michaelis complex of LDH, and they are catalytic competent at different reaction rates. In this study, millisecond-scale all-atom molecular dynamics simulations were performed on LDH to explore the free energy landscape of the Michaelis complex, and network analysis was used to characterize the distribution of the conformations. Our results provide a detailed view of the kinetic network the Michaelis complex and the structures of the substates at atomistic scale. It also shed some light on understanding the complete picture of the catalytic mechanism of LDH.

Thin client performance for remote 3-D image display.

PubMed

Lai, Albert; Nieh, Jason; Laine, Andrew; Starren, Justin

2003-01-01

Several trends in biomedical computing are converging in a way that will require new approaches to telehealth image display. Image viewing is becoming an "anytime, anywhere" activity. In addition, organizations are beginning to recognize that healthcare providers are highly mobile and optimal care requires providing information wherever the provider and patient are. Thin-client computing is one way to support image viewing this complex environment. However little is known about the behavior of thin client systems in supporting image transfer in modern heterogeneous networks. Our results show that using thin-clients can deliver acceptable performance over conditions commonly seen in wireless networks if newer protocols optimized for these conditions are used.

Reciprocity in directed networks

NASA Astrophysics Data System (ADS)

Yin, Mei; Zhu, Lingjiong

2016-04-01

Reciprocity is an important characteristic of directed networks and has been widely used in the modeling of World Wide Web, email, social, and other complex networks. In this paper, we take a statistical physics point of view and study the limiting entropy and free energy densities from the microcanonical ensemble, the canonical ensemble, and the grand canonical ensemble whose sufficient statistics are given by edge and reciprocal densities. The sparse case is also studied for the grand canonical ensemble. Extensions to more general reciprocal models including reciprocal triangle and star densities will likewise be discussed.

ACTIVIS: Visual Exploration of Industry-Scale Deep Neural Network Models.

PubMed

Kahng, Minsuk; Andrews, Pierre Y; Kalro, Aditya; Polo Chau, Duen Horng

2017-08-30

While deep learning models have achieved state-of-the-art accuracies for many prediction tasks, understanding these models remains a challenge. Despite the recent interest in developing visual tools to help users interpret deep learning models, the complexity and wide variety of models deployed in industry, and the large-scale datasets that they used, pose unique design challenges that are inadequately addressed by existing work. Through participatory design sessions with over 15 researchers and engineers at Facebook, we have developed, deployed, and iteratively improved ACTIVIS, an interactive visualization system for interpreting large-scale deep learning models and results. By tightly integrating multiple coordinated views, such as a computation graph overview of the model architecture, and a neuron activation view for pattern discovery and comparison, users can explore complex deep neural network models at both the instance- and subset-level. ACTIVIS has been deployed on Facebook's machine learning platform. We present case studies with Facebook researchers and engineers, and usage scenarios of how ACTIVIS may work with different models.

Phase transitions in Pareto optimal complex networks

NASA Astrophysics Data System (ADS)

Seoane, Luís F.; Solé, Ricard

2015-09-01

The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their topological structure can be diverse, resulting from different mechanisms including multiplicative processes and optimization. In spatial networks or in graphs where cost constraints are at work, as it occurs in a plethora of situations from power grids to the wiring of neurons in the brain, optimization plays an important part in shaping their organization. In this paper we study network designs resulting from a Pareto optimization process, where different simultaneous constraints are the targets of selection. We analyze three variations on a problem, finding phase transitions of different kinds. Distinct phases are associated with different arrangements of the connections, but the need of drastic topological changes does not determine the presence or the nature of the phase transitions encountered. Instead, the functions under optimization do play a determinant role. This reinforces the view that phase transitions do not arise from intrinsic properties of a system alone, but from the interplay of that system with its external constraints.

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.

Communications among data and science centers

NASA Technical Reports Server (NTRS)

Green, James L.

1990-01-01

The ability to electronically access and query the contents of remote computer archives is of singular importance in space and earth sciences; the present evaluation of such on-line information networks' development status foresees swift expansion of their data capabilities and complexity, in view of the volumes of data that will continue to be generated by NASA missions. The U.S.'s National Space Science Data Center (NSSDC) manages NASA's largest science computer network, the Space Physics Analysis Network; a comprehensive account is given of the structure of NSSDC international access through BITNET, and of connections to the NSSDC available in the Americas via the International X.25 network.

Causal influence in neural systems: Reconciling mechanistic-reductionist and statistical perspectives. Comment on "Foundational perspectives on causality in large-scale brain networks" by M. Mannino & S.L. Bressler

NASA Astrophysics Data System (ADS)

Griffiths, John D.

2015-12-01

The modern understanding of the brain as a large, complex network of interacting elements is a natural consequence of the Neuron Doctrine [1,2] that has been bolstered in recent years by the tools and concepts of connectomics. In this abstracted, network-centric view, the essence of neural and cognitive function derives from the flows between network elements of activity and information - or, more generally, causal influence. The appropriate characterization of causality in neural systems, therefore, is a question at the very heart of systems neuroscience.

Public Transport Systems in Poland: From Bialystok to Zielona Góra by Bus and Tram Using Universal Statistics of Complex Networks

NASA Astrophysics Data System (ADS)

Sienkiewicz, J.; Holyst, J. A.

2005-05-01

We have examined a topology of 21 public transport networks in Poland. Our data exhibit several universal features in considered systems when they are analyzed from the point of view of evolving networks. Depending on the assumed definition of a network topology the degree distribution can follow a power law p(k) ˜ k-γ or can be described by an exponential function p(k) ˜ exp (-α k). In the first case one observes that mean distances between two nodes are a linear function of logarithms of their degrees product.

Performance Impact of Connectivity Restrictions and Increased Vulnerability Presence on Automated Attack Graph Generation

DTIC Science & Technology

2007-03-01

results (Ingols 2005). 2.4.3 Skybox - Skybox view Skybox View is a commercially available tool developed by Skybox Security that can automatically...generate attack graphs through the use of host-based agents, management interfaces, and an analysis server located on the target network ( Skybox 2006... Skybox , an examination of recent patents submitted by Skybox identified the algorithmic complexity of the product as n4, where n represents the number

Stereoscopic depth increases intersubject correlations of brain networks.

PubMed

Gaebler, Michael; Biessmann, Felix; Lamke, Jan-Peter; Müller, Klaus-Robert; Walter, Henrik; Hetzer, Stefan

2014-10-15

Three-dimensional movies presented via stereoscopic displays have become more popular in recent years aiming at a more engaging viewing experience. However, neurocognitive processes associated with the perception of stereoscopic depth in complex and dynamic visual stimuli remain understudied. Here, we investigate the influence of stereoscopic depth on both neurophysiology and subjective experience. Using multivariate statistical learning methods, we compare the brain activity of subjects when freely watching the same movies in 2D and in 3D. Subjective reports indicate that 3D movies are more strongly experienced than 2D movies. On the neural level, we observe significantly higher intersubject correlations of cortical networks when subjects are watching 3D movies relative to the same movies in 2D. We demonstrate that increases in intersubject correlations of brain networks can serve as neurophysiological marker for stereoscopic depth and for the strength of the viewing experience. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.

Trade-offs between lens complexity and real estate utilization in a free-space multichip global interconnection module.

PubMed

Milojkovic, Predrag; Christensen, Marc P; Haney, Michael W

2006-07-01

The FAST-Net (Free-space Accelerator for Switching Terabit Networks) concept uses an array of wide-field-of-view imaging lenses to realize a high-density shuffle interconnect pattern across an array of smart-pixel integrated circuits. To simplify the optics we evaluated the efficiency gained in replacing spherical surfaces with aspherical surfaces by exploiting the large disparity between narrow vertical cavity surface emitting laser (VCSEL) beams and the wide field of view of the imaging optics. We then analyzed trade-offs between lens complexity and chip real estate utilization and determined that there exists an optimal numerical aperture for VCSELs that maximizes their area density. The results provide a general framework for the design of wide-field-of-view free-space interconnection systems that incorporate high-density VCSEL arrays.

Colloquium: Fractional calculus view of complexity: A tutorial

NASA Astrophysics Data System (ADS)

West, Bruce J.

2014-10-01

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

Research on centrality of urban transport network nodes

NASA Astrophysics Data System (ADS)

Wang, Kui; Fu, Xiufen

2017-05-01

Based on the actual data of urban transport in Guangzhou, 19,150 bus stations in Guangzhou (as of 2014) are selected as nodes. Based on the theory of complex network, the network model of Guangzhou urban transport is constructed. By analyzing the degree centrality index, betweenness centrality index and closeness centrality index of nodes in the network, the level of centrality of each node in the network is studied. From a different point of view to determine the hub node of Guangzhou urban transport network, corresponding to the city's key sites and major transfer sites. The reliability of the network is determined by the stability of some key nodes (transport hub station). The research of network node centralization can provide a theoretical basis for the rational allocation of urban transport network sites and public transport system planning.

Networks in Cell Biology

NASA Astrophysics Data System (ADS)

Buchanan, Mark; Caldarelli, Guido; De Los Rios, Paolo; Rao, Francesco; Vendruscolo, Michele

2010-05-01

Introduction; 1. Network views of the cell Paolo De Los Rios and Michele Vendruscolo; 2. Transcriptional regulatory networks Sarath Chandra Janga and M. Madan Babu; 3. Transcription factors and gene regulatory networks Matteo Brilli, Elissa Calistri and Pietro Lió; 4. Experimental methods for protein interaction identification Peter Uetz, Björn Titz, Seesandra V. Rajagopala and Gerard Cagney; 5. Modeling protein interaction networks Francesco Rao; 6. Dynamics and evolution of metabolic networks Daniel Segré; 7. Hierarchical modularity in biological networks: the case of metabolic networks Erzsébet Ravasz Regan; 8. Signalling networks Gian Paolo Rossini; Appendix 1. Complex networks: from local to global properties D. Garlaschelli and G. Caldarelli; Appendix 2. Modelling the local structure of networks D. Garlaschelli and G. Caldarelli; Appendix 3. Higher-order topological properties S. Ahnert, T. Fink and G. Caldarelli; Appendix 4. Elementary mathematical concepts A. Gabrielli and G. Caldarelli; References.

Cerebral cartography and connectomics

PubMed Central

Sporns, Olaf

2015-01-01

Cerebral cartography and connectomics pursue similar goals in attempting to create maps that can inform our understanding of the structural and functional organization of the cortex. Connectome maps explicitly aim at representing the brain as a complex network, a collection of nodes and their interconnecting edges. This article reflects on some of the challenges that currently arise in the intersection of cerebral cartography and connectomics. Principal challenges concern the temporal dynamics of functional brain connectivity, the definition of areal parcellations and their hierarchical organization into large-scale networks, the extension of whole-brain connectivity to cellular-scale networks, and the mapping of structure/function relations in empirical recordings and computational models. Successfully addressing these challenges will require extensions of methods and tools from network science to the mapping and analysis of human brain connectivity data. The emerging view that the brain is more than a collection of areas, but is fundamentally operating as a complex networked system, will continue to drive the creation of ever more detailed and multi-modal network maps as tools for on-going exploration and discovery in human connectomics. PMID:25823870

Brain networks during free viewing of complex erotic movie: new insights on psychogenic erectile dysfunction.

PubMed

Cera, Nicoletta; Di Pierro, Ezio Domenico; Ferretti, Antonio; Tartaro, Armando; Romani, Gian Luca; Perrucci, Mauro Gianni

2014-01-01

Psychogenic erectile dysfunction (ED) is defined as a male sexual dysfunction characterized by a persistent or recurrent inability to attain adequate penile erection due predominantly or exclusively to psychological or interpersonal factors. Previous fMRI studies were based on the common occurrence in the male sexual behaviour represented by the sexual arousal and penile erection related to viewing of erotic movies. However, there is no experimental evidence of altered brain networks in psychogenic ED patients (EDp). Some studies showed that fMRI activity collected during non sexual movie viewing can be analyzed in a reliable manner with independent component analysis (ICA) and that the resulting brain networks are consistent with previous resting state neuroimaging studies. In the present study, we investigated the modification of the brain networks in EDp compared to healthy controls (HC), using whole-brain fMRI during free viewing of an erotic video clip. Sixteen EDp and nineteen HC were recruited after RigiScan evaluation, psychiatric, and general medical evaluations. The performed ICA showed that visual network (VN), default-mode network (DMN), fronto-parietal network (FPN) and salience network (SN) were spatially consistent across EDp and HC. However, between-group differences in functional connectivity were observed in the DMN and in the SN. In the DMN, EDp showed decreased connectivity values in the inferior parietal lobes, posterior cingulate cortex and medial prefrontal cortex, whereas in the SN decreased and increased connectivity was observed in the right insula and in the anterior cingulate cortex respectively. The decreased levels of intrinsic functional connectivity principally involved the subsystem of DMN relevant for the self relevant mental simulation that concerns remembering of past experiences, thinking to the future and conceiving the viewpoint of the other's actions. Moreover, the between group differences in the SN nodes suggested a decreased recognition of autonomical and sexual arousal changes in EDp.

Brain Networks during Free Viewing of Complex Erotic Movie: New Insights on Psychogenic Erectile Dysfunction

PubMed Central

Cera, Nicoletta; Di Pierro, Ezio Domenico; Ferretti, Antonio; Tartaro, Armando; Romani, Gian Luca; Perrucci, Mauro Gianni

2014-01-01

Psychogenic erectile dysfunction (ED) is defined as a male sexual dysfunction characterized by a persistent or recurrent inability to attain adequate penile erection due predominantly or exclusively to psychological or interpersonal factors. Previous fMRI studies were based on the common occurrence in the male sexual behaviour represented by the sexual arousal and penile erection related to viewing of erotic movies. However, there is no experimental evidence of altered brain networks in psychogenic ED patients (EDp). Some studies showed that fMRI activity collected during non sexual movie viewing can be analyzed in a reliable manner with independent component analysis (ICA) and that the resulting brain networks are consistent with previous resting state neuroimaging studies. In the present study, we investigated the modification of the brain networks in EDp compared to healthy controls (HC), using whole-brain fMRI during free viewing of an erotic video clip. Sixteen EDp and nineteen HC were recruited after RigiScan evaluation, psychiatric, and general medical evaluations. The performed ICA showed that visual network (VN), default-mode network (DMN), fronto-parietal network (FPN) and salience network (SN) were spatially consistent across EDp and HC. However, between-group differences in functional connectivity were observed in the DMN and in the SN. In the DMN, EDp showed decreased connectivity values in the inferior parietal lobes, posterior cingulate cortex and medial prefrontal cortex, whereas in the SN decreased and increased connectivity was observed in the right insula and in the anterior cingulate cortex respectively. The decreased levels of intrinsic functional connectivity principally involved the subsystem of DMN relevant for the self relevant mental simulation that concerns remembering of past experiences, thinking to the future and conceiving the viewpoint of the other’s actions. Moreover, the between group differences in the SN nodes suggested a decreased recognition of autonomical and sexual arousal changes in EDp. PMID:25126947

Computational Methods to Predict Protein Interaction Partners

NASA Astrophysics Data System (ADS)

Valencia, Alfonso; Pazos, Florencio

In the new paradigm for studying biological phenomena represented by Systems Biology, cellular components are not considered in isolation but as forming complex networks of relationships. Protein interaction networks are among the first objects studied from this new point of view. Deciphering the interactome (the whole network of interactions for a given proteome) has been shown to be a very complex task. Computational techniques for detecting protein interactions have become standard tools for dealing with this problem, helping and complementing their experimental counterparts. Most of these techniques use genomic or sequence features intuitively related with protein interactions and are based on "first principles" in the sense that they do not involve training with examples. There are also other computational techniques that use other sources of information (i.e. structural information or even experimental data) or are based on training with examples.

A Mathematical Motivation for Complex-Valued Convolutional Networks.

PubMed

Tygert, Mark; Bruna, Joan; Chintala, Soumith; LeCun, Yann; Piantino, Serkan; Szlam, Arthur

2016-05-01

A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors, followed by (2) taking the absolute value of every entry of the resulting vectors, followed by (3) local averaging. For processing real-valued random vectors, complex-valued convnets can be viewed as data-driven multiscale windowed power spectra, data-driven multiscale windowed absolute spectra, data-driven multiwavelet absolute values, or (in their most general configuration) data-driven nonlinear multiwavelet packets. Indeed, complex-valued convnets can calculate multiscale windowed spectra when the convnet filters are windowed complex-valued exponentials. Standard real-valued convnets, using rectified linear units (ReLUs), sigmoidal (e.g., logistic or tanh) nonlinearities, or max pooling, for example, do not obviously exhibit the same exact correspondence with data-driven wavelets (whereas for complex-valued convnets, the correspondence is much more than just a vague analogy). Courtesy of the exact correspondence, the remarkably rich and rigorous body of mathematical analysis for wavelets applies directly to (complex-valued) convnets.

The Internet As a Large-Scale Complex System

NASA Astrophysics Data System (ADS)

Park, Kihong; Willinger, Walter

2005-06-01

The Internet may be viewed as a "complex system" with diverse features and many components that can give rise to unexpected emergent phenomena, revealing much about its own engineering. This book brings together chapter contributions from a workshop held at the Santa Fe Institute in March 2001. This volume captures a snapshot of some features of the Internet that may be fruitfully approached using a complex systems perspective, meaning using interdisciplinary tools and methods to tackle the subject area. The Internet penetrates the socioeconomic fabric of everyday life; a broader and deeper grasp of the Internet may be needed to meet the challenges facing the future. The resulting empirical data have already proven to be invaluable for gaining novel insights into the network's spatio-temporal dynamics, and can be expected to become even more important when tryin to explain the Internet's complex and emergent behavior in terms of elementary networking-based mechanisms. The discoveries of fractal or self-similar network traffic traces, power-law behavior in network topology and World Wide Web connectivity are instances of unsuspected, emergent system traits. Another important factor at the heart of fair, efficient, and stable sharing of network resources is user behavior. Network systems, when habited by selfish or greedy users, take on the traits of a noncooperative multi-party game, and their stability and efficiency are integral to understanding the overall system and its dynamics. Lastly, fault-tolerance and robustness of large-scale network systems can exhibit spatial and temporal correlations whose effective analysis and management may benefit from rescaling techniques applied in certain physical and biological systems. The present book will bring together several of the leading workers involved in the analysis of complex systems with the future development of the Internet.

Micro-Macro Analysis of Complex Networks

PubMed Central

Marchiori, Massimo; Possamai, Lino

2015-01-01

Complex systems have attracted considerable interest because of their wide range of applications, and are often studied via a “classic” approach: study a specific system, find a complex network behind it, and analyze the corresponding properties. This simple methodology has produced a great deal of interesting results, but relies on an often implicit underlying assumption: the level of detail on which the system is observed. However, in many situations, physical or abstract, the level of detail can be one out of many, and might also depend on intrinsic limitations in viewing the data with a different level of abstraction or precision. So, a fundamental question arises: do properties of a network depend on its level of observability, or are they invariant? If there is a dependence, then an apparently correct network modeling could in fact just be a bad approximation of the true behavior of a complex system. In order to answer this question, we propose a novel micro-macro analysis of complex systems that quantitatively describes how the structure of complex networks varies as a function of the detail level. To this extent, we have developed a new telescopic algorithm that abstracts from the local properties of a system and reconstructs the original structure according to a fuzziness level. This way we can study what happens when passing from a fine level of detail (“micro”) to a different scale level (“macro”), and analyze the corresponding behavior in this transition, obtaining a deeper spectrum analysis. The obtained results show that many important properties are not universally invariant with respect to the level of detail, but instead strongly depend on the specific level on which a network is observed. Therefore, caution should be taken in every situation where a complex network is considered, if its context allows for different levels of observability. PMID:25635812

Tutorial on Protein Ontology Resources

PubMed Central

Arighi, Cecilia; Drabkin, Harold; Christie, Karen R.; Ross, Karen; Natale, Darren

2017-01-01

The Protein Ontology (PRO) is the reference ontology for proteins in the Open Biomedical Ontologies (OBO) foundry and consists of three sub-ontologies representing protein classes of homologous genes, proteoforms (e.g., splice isoforms, sequence variants, and post-translationally modified forms), and protein complexes. PRO defines classes of proteins and protein complexes, both species-specific and species non-specific, and indicates their relationships in a hierarchical framework, supporting accurate protein annotation at the appropriate level of granularity, analyses of protein conservation across species, and semantic reasoning. In this first section of this chapter, we describe the PRO framework including categories of PRO terms and the relationship of PRO to other ontologies and protein resources. Next, we provide a tutorial about the PRO website (proconsortium.org) where users can browse and search the PRO hierarchy, view reports on individual PRO terms, and visualize relationships among PRO terms in a hierarchical table view, a multiple sequence alignment view, and a Cytoscape network view. Finally, we describe several examples illustrating the unique and rich information available in PRO. PMID:28150233

Social Insects: A Model System for Network Dynamics

NASA Astrophysics Data System (ADS)

Charbonneau, Daniel; Blonder, Benjamin; Dornhaus, Anna

Social insect colonies (ants, bees, wasps, and termites) show sophisticated collective problem-solving in the face of variable constraints. Individuals exchange information and materials such as food. The resulting network structure and dynamics can inform us about the mechanisms by which the insects achieve particular collective behaviors and these can be transposed to man-made and social networks. We discuss how network analysis can answer important questions about social insects, such as how effective task allocation or information flow is realized. We put forward the idea that network analysis methods are under-utilized in social insect research, and that they can provide novel ways to view the complexity of collective behavior, particularly if network dynamics are taken into account. To illustrate this, we present an example of network tasks performed by ant workers, linked by instances of workers switching from one task to another. We show how temporal network analysis can propose and test new hypotheses on mechanisms of task allocation, and how adding temporal elements to static networks can drastically change results. We discuss the benefits of using social insects as models for complex systems in general. There are multiple opportunities emergent technologies and analysis methods in facilitating research on social insect network. The potential for interdisciplinary work could significantly advance diverse fields such as behavioral ecology, computer sciences, and engineering.

A Network of Networks Perspective on Global Trade.

PubMed

Maluck, Julian; Donner, Reik V

2015-01-01

Mutually intertwined supply chains in contemporary economy result in a complex network of trade relationships with a highly non-trivial topology that varies with time. In order to understand the complex interrelationships among different countries and economic sectors, as well as their dynamics, a holistic view on the underlying structural properties of this network is necessary. This study employs multi-regional input-output data to decompose 186 national economies into 26 industry sectors and utilizes the approach of interdependent networks to analyze the substructure of the resulting international trade network for the years 1990-2011. The partition of the network into national economies is observed to be compatible with the notion of communities in the sense of complex network theory. By studying internal versus cross-subgraph contributions to established complex network metrics, new insights into the architecture of global trade are obtained, which allow to identify key elements of global economy. Specifically, financial services and business activities dominate domestic trade whereas electrical and machinery industries dominate foreign trade. In order to further specify each national sector's role individually, (cross-)clustering coefficients and cross-betweenness are obtained for different pairs of subgraphs. The corresponding analysis reveals that specific industrial sectors tend to favor distinct directionality patterns and that the cross-clustering coefficient for geographically close country pairs is remarkably high, indicating that spatial factors are still of paramount importance for the organization of trade patterns in modern economy. Regarding the evolution of the trade network's substructure, globalization is well-expressed by trends of several structural characteristics (e.g., link density and node strength) in the interacting network framework. Extreme events, such as the financial crisis 2008/2009, are manifested as anomalies superimposed to these trends. The marked reorganization of trade patterns, associated with this economic crisis in comparison to "normal" annual fluctuations in the network structure is traced and quantified by a new widely applicable generalization of the Hamming distance to weighted 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.

Hierarchy Bayesian model based services awareness of high-speed optical access networks

NASA Astrophysics Data System (ADS)

Bai, Hui-feng

2018-03-01

As the speed of optical access networks soars with ever increasing multiple services, the service-supporting ability of optical access networks suffers greatly from the shortage of service awareness. Aiming to solve this problem, a hierarchy Bayesian model based services awareness mechanism is proposed for high-speed optical access networks. This approach builds a so-called hierarchy Bayesian model, according to the structure of typical optical access networks. Moreover, the proposed scheme is able to conduct simple services awareness operation in each optical network unit (ONU) and to perform complex services awareness from the whole view of system in optical line terminal (OLT). Simulation results show that the proposed scheme is able to achieve better quality of services (QoS), in terms of packet loss rate and time delay.

Multi-Timescale Complex Adaptation

DTIC Science & Technology

2006-03-01

Hucka et al., 2001), Cluster/TreeView (Eisen et al., 1998), Pajek ( Batagelj & Mrvar , 1998) and Cytoscape (Ideker et al., 2002). These can be used in the...targets of MCM1 or FKH2 individually or the product of MCM1 and FKH2. STRE is bound by MSN2 and/or MSN4 (Schmitt and McEntee, 1996 ) and for this...Ghosh, Scale based clustering using a radial basis function network. IEEE Transactions on Neural Networks, 2(5):1250-1261, 1996 . Chen, K.C., Csikasz

Actor-Network Theory and its role in understanding the implementation of information technology developments in healthcare.

PubMed

Cresswell, Kathrin M; Worth, Allison; Sheikh, Aziz

2010-11-01

Actor-Network Theory (ANT) is an increasingly influential, but still deeply contested, approach to understand humans and their interactions with inanimate objects. We argue that health services research, and in particular evaluations of complex IT systems in health service organisations, may benefit from being informed by Actor-Network Theory perspectives. Despite some limitations, an Actor-Network Theory-based approach is conceptually useful in helping to appreciate the complexity of reality (including the complexity of organisations) and the active role of technology in this context. This can prove helpful in understanding how social effects are generated as a result of associations between different actors in a network. Of central importance in this respect is that Actor-Network Theory provides a lens through which to view the role of technology in shaping social processes. Attention to this shaping role can contribute to a more holistic appreciation of the complexity of technology introduction in healthcare settings. It can also prove practically useful in providing a theoretically informed approach to sampling (by drawing on informants that are related to the technology in question) and analysis (by providing a conceptual tool and vocabulary that can form the basis for interpretations). We draw on existing empirical work in this area and our ongoing work investigating the integration of electronic health record systems introduced as part of England's National Programme for Information Technology to illustrate salient points. Actor-Network Theory needs to be used pragmatically with an appreciation of its shortcomings. Our experiences suggest it can be helpful in investigating technology implementations in healthcare settings.

Evolution of weighted complex bus transit networks with flow

NASA Astrophysics Data System (ADS)

Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

2016-02-01

Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

The building blocks of economic complexity

PubMed Central

Hidalgo, César A.; Hausmann, Ricardo

2009-01-01

For Adam Smith, wealth was related to the division of labor. As people and firms specialize in different activities, economic efficiency increases, suggesting that development is associated with an increase in the number of individual activities and with the complexity that emerges from the interactions between them. Here we develop a view of economic growth and development that gives a central role to the complexity of a country's economy by interpreting trade data as a bipartite network in which countries are connected to the products they export, and show that it is possible to quantify the complexity of a country's economy by characterizing the structure of this network. Furthermore, we show that the measures of complexity we derive are correlated with a country's level of income, and that deviations from this relationship are predictive of future growth. This suggests that countries tend to converge to the level of income dictated by the complexity of their productive structures, indicating that development efforts should focus on generating the conditions that would allow complexity to emerge to generate sustained growth and prosperity. PMID:19549871

A Network of Networks Perspective on Global Trade

PubMed Central

Maluck, Julian; Donner, Reik V.

2015-01-01

Mutually intertwined supply chains in contemporary economy result in a complex network of trade relationships with a highly non-trivial topology that varies with time. In order to understand the complex interrelationships among different countries and economic sectors, as well as their dynamics, a holistic view on the underlying structural properties of this network is necessary. This study employs multi-regional input-output data to decompose 186 national economies into 26 industry sectors and utilizes the approach of interdependent networks to analyze the substructure of the resulting international trade network for the years 1990–2011. The partition of the network into national economies is observed to be compatible with the notion of communities in the sense of complex network theory. By studying internal versus cross-subgraph contributions to established complex network metrics, new insights into the architecture of global trade are obtained, which allow to identify key elements of global economy. Specifically, financial services and business activities dominate domestic trade whereas electrical and machinery industries dominate foreign trade. In order to further specify each national sector’s role individually, (cross-)clustering coefficients and cross-betweenness are obtained for different pairs of subgraphs. The corresponding analysis reveals that specific industrial sectors tend to favor distinct directionality patterns and that the cross-clustering coefficient for geographically close country pairs is remarkably high, indicating that spatial factors are still of paramount importance for the organization of trade patterns in modern economy. Regarding the evolution of the trade network’s substructure, globalization is well-expressed by trends of several structural characteristics (e.g., link density and node strength) in the interacting network framework. Extreme events, such as the financial crisis 2008/2009, are manifested as anomalies superimposed to these trends. The marked reorganization of trade patterns, associated with this economic crisis in comparison to “normal” annual fluctuations in the network structure is traced and quantified by a new widely applicable generalization of the Hamming distance to weighted networks. PMID:26197439

Advanced Algorithms for Local Routing Strategy on Complex Networks

PubMed Central

Lin, Benchuan; Chen, Bokui; Gao, Yachun; Tse, Chi K.; Dong, Chuanfei; Miao, Lixin; Wang, Binghong

2016-01-01

Despite the significant improvement on network performance provided by global routing strategies, their applications are still limited to small-scale networks, due to the need for acquiring global information of the network which grows and changes rapidly with time. Local routing strategies, however, need much less local information, though their transmission efficiency and network capacity are much lower than that of global routing strategies. In view of this, three algorithms are proposed and a thorough investigation is conducted in this paper. These algorithms include a node duplication avoidance algorithm, a next-nearest-neighbor algorithm and a restrictive queue length algorithm. After applying them to typical local routing strategies, the critical generation rate of information packets Rc increases by over ten-fold and the average transmission time 〈T〉 decreases by 70–90 percent, both of which are key physical quantities to assess the efficiency of routing strategies on complex networks. More importantly, in comparison with global routing strategies, the improved local routing strategies can yield better network performance under certain circumstances. This is a revolutionary leap for communication networks, because local routing strategy enjoys great superiority over global routing strategy not only in terms of the reduction of computational expense, but also in terms of the flexibility of implementation, especially for large-scale networks. PMID:27434502

Antagonistic Phenomena in Network Dynamics

NASA Astrophysics Data System (ADS)

Motter, Adilson E.; Timme, Marc

2018-03-01

Recent research on the network modeling of complex systems has led to a convenient representation of numerous natural, social, and engineered systems that are now recognized as networks of interacting parts. Such systems can exhibit a wealth of phenomena that not only cannot be anticipated from merely examining their parts, as per the textbook definition of complexity, but also challenge intuition even when considered in the context of what is now known in network science. Here, we review the recent literature on two major classes of such phenomena that have far-reaching implications: (a) antagonistic responses to changes of states or parameters and (b) coexistence of seemingly incongruous behaviors or properties - both deriving from the collective and inherently decentralized nature of the dynamics. They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring across transport and supply networks. They also include remote synchronization, chimera states, and the converse of symmetry breaking in brain, power-grid, and oscillator networks as well as remote control in biological and bioinspired systems. By offering a unified view of these various scenarios, we suggest that they are representative of a yet broader class of unprecedented network phenomena that ought to be revealed and explained by future research.

Advanced Algorithms for Local Routing Strategy on Complex Networks.

PubMed

Lin, Benchuan; Chen, Bokui; Gao, Yachun; Tse, Chi K; Dong, Chuanfei; Miao, Lixin; Wang, Binghong

2016-01-01

Despite the significant improvement on network performance provided by global routing strategies, their applications are still limited to small-scale networks, due to the need for acquiring global information of the network which grows and changes rapidly with time. Local routing strategies, however, need much less local information, though their transmission efficiency and network capacity are much lower than that of global routing strategies. In view of this, three algorithms are proposed and a thorough investigation is conducted in this paper. These algorithms include a node duplication avoidance algorithm, a next-nearest-neighbor algorithm and a restrictive queue length algorithm. After applying them to typical local routing strategies, the critical generation rate of information packets Rc increases by over ten-fold and the average transmission time 〈T〉 decreases by 70-90 percent, both of which are key physical quantities to assess the efficiency of routing strategies on complex networks. More importantly, in comparison with global routing strategies, the improved local routing strategies can yield better network performance under certain circumstances. This is a revolutionary leap for communication networks, because local routing strategy enjoys great superiority over global routing strategy not only in terms of the reduction of computational expense, but also in terms of the flexibility of implementation, especially for large-scale networks.

An exploration of alternative visualisations of the basic helix-loop-helix protein interaction network

PubMed Central

Holden, Brian J; Pinney, John W; Lovell, Simon C; Amoutzias, Grigoris D; Robertson, David L

2007-01-01

Background Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this study we present a variety of automated methods for visualisation of a protein-protein interaction network, using the basic helix-loop-helix (bHLH) family of transcription factors as an example. Results Network representations that arrange nodes (proteins) according to either continuous or discrete information are investigated, revealing the existence of protein sub-families and the retention of interactions following gene duplication events. Methods of network visualisation in conjunction with a phylogenetic tree are presented, highlighting the evolutionary relationships between proteins, and clarifying the context of network hubs and interaction clusters. Finally, an optimisation technique is used to create a three-dimensional layout of the phylogenetic tree upon which the protein-protein interactions may be projected. Conclusion We show that by incorporating secondary genomic, functional or phylogenetic information into network visualisation, it is possible to move beyond simple layout algorithms based on network topology towards more biologically meaningful representations. These new visualisations can give structure to complex networks and will greatly help in interpreting their evolutionary origins and functional implications. Three open source software packages (InterView, TVi and OptiMage) implementing our methods are available. PMID:17683601

Local community detection as pattern restoration by attractor dynamics of recurrent neural networks.

PubMed

Okamoto, Hiroshi

2016-08-01

Densely connected parts in networks are referred to as "communities". Community structure is a hallmark of a variety of real-world networks. Individual communities in networks form functional modules of complex systems described by networks. Therefore, finding communities in networks is essential to approaching and understanding complex systems described by networks. In fact, network science has made a great deal of effort to develop effective and efficient methods for detecting communities in networks. Here we put forward a type of community detection, which has been little examined so far but will be practically useful. Suppose that we are given a set of source nodes that includes some (but not all) of "true" members of a particular community; suppose also that the set includes some nodes that are not the members of this community (i.e., "false" members of the community). We propose to detect the community from this "imperfect" and "inaccurate" set of source nodes using attractor dynamics of recurrent neural networks. Community detection by the proposed method can be viewed as restoration of the original pattern from a deteriorated pattern, which is analogous to cue-triggered recall of short-term memory in the brain. We demonstrate the effectiveness of the proposed method using synthetic networks and real social networks for which correct communities are known. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

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

Food supply chain disruption due to natural disaster: Entities, risks and strategies for resilience

USDA-ARS?s Scientific Manuscript database

The resilience of food supply chain (FSC) to disruptions has not kept pace with the extended, globalized and complex network of modern food chain. This chapter presents a holistic view of the FSC, interactions among its components, risks and vulnerabilities of disruption in the context of natural d...

A next generation multiscale view of inborn errors of metabolism

PubMed Central

Argmann, Carmen A.; Houten, Sander M.; Zhu, Jun; Schadt, Eric E.

2015-01-01

Inborn errors of metabolism (IEM) are not unlike common diseases. They often present as a spectrum of disease phenotypes that correlates poorly with the severity of the disease-causing mutations. This greatly impacts patient care and reveals fundamental gaps in our knowledge of disease modifying biology. Systems biology approaches that integrate multi-omics data into molecular networks have significantly improved our understanding of complex diseases. Similar approaches to study IEM are rare despite their complex nature. We highlight that existing common disease-derived datasets and networks can be repurposed to generate novel mechanistic insight in IEM and potentially identify candidate modifiers. While understanding disease pathophysiology will advance the IEM field, the ultimate goal should be to understand per individual how their phenotype emerges given their primary mutation on the background of their whole genome, not unlike personalized medicine. We foresee that panomics and network strategies combined with recent experimental innovations will facilitate this. PMID:26712461

A spread willingness computing-based information dissemination model.

PubMed

Huang, Haojing; Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network.

A Spread Willingness Computing-Based Information Dissemination Model

PubMed Central

Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network. PMID:25110738

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.

Abstraction networks for terminologies: Supporting management of "big knowledge".

PubMed

Halper, Michael; Gu, Huanying; Perl, Yehoshua; Ochs, Christopher

2015-05-01

Terminologies and terminological systems have assumed important roles in many medical information processing environments, giving rise to the "big knowledge" challenge when terminological content comprises tens of thousands to millions of concepts arranged in a tangled web of relationships. Use and maintenance of knowledge structures on that scale can be daunting. The notion of abstraction network is presented as a means of facilitating the usability, comprehensibility, visualization, and quality assurance of terminologies. An abstraction network overlays a terminology's underlying network structure at a higher level of abstraction. In particular, it provides a more compact view of the terminology's content, avoiding the display of minutiae. General abstraction network characteristics are discussed. Moreover, the notion of meta-abstraction network, existing at an even higher level of abstraction than a typical abstraction network, is described for cases where even the abstraction network itself represents a case of "big knowledge." Various features in the design of abstraction networks are demonstrated in a methodological survey of some existing abstraction networks previously developed and deployed for a variety of terminologies. The applicability of the general abstraction-network framework is shown through use-cases of various terminologies, including the Systematized Nomenclature of Medicine - Clinical Terms (SNOMED CT), the Medical Entities Dictionary (MED), and the Unified Medical Language System (UMLS). Important characteristics of the surveyed abstraction networks are provided, e.g., the magnitude of the respective size reduction referred to as the abstraction ratio. Specific benefits of these alternative terminology-network views, particularly their use in terminology quality assurance, are discussed. Examples of meta-abstraction networks are presented. The "big knowledge" challenge constitutes the use and maintenance of terminological structures that comprise tens of thousands to millions of concepts and their attendant complexity. The notion of abstraction network has been introduced as a tool in helping to overcome this challenge, thus enhancing the usefulness of terminologies. Abstraction networks have been shown to be applicable to a variety of existing biomedical terminologies, and these alternative structural views hold promise for future expanded use with additional terminologies. Copyright © 2015 Elsevier B.V. All rights reserved.

Epidemics Modelings: Some New Challenges

NASA Astrophysics Data System (ADS)

Boatto, Stefanella; Khouri, Renata Stella; Solerman, Lucas; Codeço, Claudia; Bonnet, Catherine

2010-09-01

Epidemics modeling has been particularly growing in the past years. In epidemics studies, mathematical modeling is used in particular to reach a better understanding of some neglected diseases (dengue, malaria, …) and of new emerging ones (SARS, influenza A,….) of big agglomerates. Such studies offer new challenges both from the modeling point of view (searching for simple models which capture the main characteristics of the disease spreading), data analysis and mathematical complexity. We are facing often with complex networks especially when modeling the city dynamics. Such networks can be static (in first approximation) and homogeneous, static and not homogeneous and/or not static (when taking into account the city structure, micro-climates, people circulation, etc.). The objective being studying epidemics dynamics and being able to predict its spreading.

Cerebral cartography and connectomics.

PubMed

Sporns, Olaf

2015-05-19

Cerebral cartography and connectomics pursue similar goals in attempting to create maps that can inform our understanding of the structural and functional organization of the cortex. Connectome maps explicitly aim at representing the brain as a complex network, a collection of nodes and their interconnecting edges. This article reflects on some of the challenges that currently arise in the intersection of cerebral cartography and connectomics. Principal challenges concern the temporal dynamics of functional brain connectivity, the definition of areal parcellations and their hierarchical organization into large-scale networks, the extension of whole-brain connectivity to cellular-scale networks, and the mapping of structure/function relations in empirical recordings and computational models. Successfully addressing these challenges will require extensions of methods and tools from network science to the mapping and analysis of human brain connectivity data. The emerging view that the brain is more than a collection of areas, but is fundamentally operating as a complex networked system, will continue to drive the creation of ever more detailed and multi-modal network maps as tools for on-going exploration and discovery in human connectomics. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

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

Decoding the spatial signatures of multi-scale climate variability - a climate network perspective

NASA Astrophysics Data System (ADS)

Donner, R. V.; Jajcay, N.; Wiedermann, M.; Ekhtiari, N.; Palus, M.

2017-12-01

During the last years, the application of complex networks as a versatile tool for analyzing complex spatio-temporal data has gained increasing interest. Establishing this approach as a new paradigm in climatology has already provided valuable insights into key spatio-temporal climate variability patterns across scales, including novel perspectives on the dynamics of the El Nino Southern Oscillation or the emergence of extreme precipitation patterns in monsoonal regions. In this work, we report first attempts to employ network analysis for disentangling multi-scale climate variability. Specifically, we introduce the concept of scale-specific climate networks, which comprises a sequence of networks representing the statistical association structure between variations at distinct time scales. For this purpose, we consider global surface air temperature reanalysis data and subject the corresponding time series at each grid point to a complex-valued continuous wavelet transform. From this time-scale decomposition, we obtain three types of signals per grid point and scale - amplitude, phase and reconstructed signal, the statistical similarity of which is then represented by three complex networks associated with each scale. We provide a detailed analysis of the resulting connectivity patterns reflecting the spatial organization of climate variability at each chosen time-scale. Global network characteristics like transitivity or network entropy are shown to provide a new view on the (global average) relevance of different time scales in climate dynamics. Beyond expected trends originating from the increasing smoothness of fluctuations at longer scales, network-based statistics reveal different degrees of fragmentation of spatial co-variability patterns at different scales and zonal shifts among the key players of climate variability from tropically to extra-tropically dominated patterns when moving from inter-annual to decadal scales and beyond. The obtained results demonstrate the potential usefulness of systematically exploiting scale-specific climate networks, whose general patterns are in line with existing climatological knowledge, but provide vast opportunities for further quantifications at local, regional and global scales that are yet to be explored.

Systems view of adipogenesis via novel omics-driven and tissue-specific activity scoring of network functional modules

NASA Astrophysics Data System (ADS)

Nassiri, Isar; Lombardo, Rosario; Lauria, Mario; Morine, Melissa J.; Moyseos, Petros; Varma, Vijayalakshmi; Nolen, Greg T.; Knox, Bridgett; Sloper, Daniel; Kaput, Jim; Priami, Corrado

2016-07-01

The investigation of the complex processes involved in cellular differentiation must be based on unbiased, high throughput data processing methods to identify relevant biological pathways. A number of bioinformatics tools are available that can generate lists of pathways ranked by statistical significance (i.e. by p-value), while ideally it would be desirable to functionally score the pathways relative to each other or to other interacting parts of the system or process. We describe a new computational method (Network Activity Score Finder - NASFinder) to identify tissue-specific, omics-determined sub-networks and the connections with their upstream regulator receptors to obtain a systems view of the differentiation of human adipocytes. Adipogenesis of human SBGS pre-adipocyte cells in vitro was monitored with a transcriptomic data set comprising six time points (0, 6, 48, 96, 192, 384 hours). To elucidate the mechanisms of adipogenesis, NASFinder was used to perform time-point analysis by comparing each time point against the control (0 h) and time-lapse analysis by comparing each time point with the previous one. NASFinder identified the coordinated activity of seemingly unrelated processes between each comparison, providing the first systems view of adipogenesis in culture. NASFinder has been implemented into a web-based, freely available resource associated with novel, easy to read visualization of omics data sets and network modules.

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.

Stochastic Packet Loss Model to Evaluate QoE Impairments

NASA Astrophysics Data System (ADS)

Hohlfeld, Oliver

With provisioning of broadband access for mass market—even in wireless and mobile networks—multimedia content, especially real-time streaming of high-quality audio and video, is extensively viewed and exchanged over the Internet. Quality of Experience (QoE) aspects, describing the service quality perceived by the user, is a vital factor in ensuring customer satisfaction in today's communication networks. Frameworks for accessing quality degradations in streamed video currently are investigated as a complex multi-layered research topic, involving network traffic load, codec functions and measures of user perception of video quality.

Networked control of microgrid system of systems

NASA Astrophysics Data System (ADS)

Mahmoud, Magdi S.; Rahman, Mohamed Saif Ur; AL-Sunni, Fouad M.

2016-08-01

The microgrid has made its mark in distributed generation and has attracted widespread research. However, microgrid is a complex system which needs to be viewed from an intelligent system of systems perspective. In this paper, a network control system of systems is designed for the islanded microgrid system consisting of three distributed generation units as three subsystems supplying a load. The controller stabilises the microgrid system in the presence of communication infractions such as packet dropouts and delays. Simulation results are included to elucidate the effectiveness of the proposed control strategy.

Can a biologist fix a smartphone?-Just hack it!

PubMed

Kamoun, Sophien

2017-05-08

Biological systems integrate multiscale processes and networks and are, therefore, viewed as difficult to dissect. However, because of the clear-cut separation between the software code (the information encoded in the genome sequence) and hardware (organism), genome editors can operate as software engineers to hack biological systems without any particularly deep understanding of the complexity of the systems.

Perspectives for a better understanding of the metabolic integration of photorespiration within a complex plant primary metabolism network

USDA-ARS?s Scientific Manuscript database

Photorespiration is an important high flux metabolic pathway that is found in all oxygen-producing photosynthetic organisms. It is often viewed as a closed loop that recycles carbon to fuel the Calvin cycle. However, the photorespiratory cycle is known to interact with several primary metabolic path...

Understanding the Online Informal Learning of English as a Complex Dynamic System: An Emic Approach

ERIC Educational Resources Information Center

Sockett, Geoffrey

2013-01-01

Research into the online informal learning of English has already shown it to be a widespread phenomenon involving a range of comprehension and production activities such as viewing original version television series, listening to music on demand and social networking with other English users. Dynamic systems theory provides a suitable framework…

Tracing the Policy Mediation Process in the Implementation of a Change in the Life Sciences Curriculum

ERIC Educational Resources Information Center

Singh-Pillay, Asheena; Alant, Busisiwe

2015-01-01

This paper accounts for the enacted realities of curriculum reform in South Africa, in particular the mediation of curriculum change. Curriculum implementation is viewed as a complex networked process of transforming or mediating policy into classroom practice. The fact that curriculum implementation is seen as problematic requires attention for…

Recognition of neural brain activity patterns correlated with complex motor activity

NASA Astrophysics Data System (ADS)

Kurkin, Semen; Musatov, Vyacheslav Yu.; Runnova, Anastasia E.; Grubov, Vadim V.; Efremova, Tatyana Yu.; Zhuravlev, Maxim O.

2018-04-01

In this paper, based on the apparatus of artificial neural networks, a technique for recognizing and classifying patterns corresponding to imaginary movements on electroencephalograms (EEGs) obtained from a group of untrained subjects was developed. The works on the selection of the optimal type, topology, training algorithms and neural network parameters were carried out from the point of view of the most accurate and fast recognition and classification of patterns on multi-channel EEGs associated with the imagination of movements. The influence of the number and choice of the analyzed channels of a multichannel EEG on the quality of recognition of imaginary movements was also studied, and optimal configurations of electrode arrangements were obtained. The effect of pre-processing of EEG signals is analyzed from the point of view of improving the accuracy of recognition of imaginary movements.

Clustering determines the dynamics of complex contagions in multiplex networks

NASA Astrophysics Data System (ADS)

Zhuang, Yong; Arenas, Alex; Yaǧan, Osman

2017-01-01

We present the mathematical analysis of generalized complex contagions in a class of clustered multiplex networks. The model is intended to understand spread of influence, or any other spreading process implying a threshold dynamics, in setups of interconnected networks with significant clustering. The contagion is assumed to be general enough to account for a content-dependent linear threshold model, where each link type has a different weight (for spreading influence) that may depend on the content (e.g., product, rumor, political view) that is being spread. Using the generating functions formalism, we determine the conditions, probability, and expected size of the emergent global cascades. This analysis provides a generalization of previous approaches and is especially useful in problems related to spreading and percolation. The results present nontrivial dependencies between the clustering coefficient of the networks and its average degree. In particular, several phase transitions are shown to occur depending on these descriptors. Generally speaking, our findings reveal that increasing clustering decreases the probability of having global cascades and their size, however, this tendency changes with the average degree. There exists a certain average degree from which on clustering favors the probability and size of the contagion. By comparing the dynamics of complex contagions over multiplex networks and their monoplex projections, we demonstrate that ignoring link types and aggregating network layers may lead to inaccurate conclusions about contagion dynamics, particularly when the correlation of degrees between layers is high.

Biological network extraction from scientific literature: state of the art and challenges.

PubMed

Li, Chen; Liakata, Maria; Rebholz-Schuhmann, Dietrich

2014-09-01

Networks of molecular interactions explain complex biological processes, and all known information on molecular events is contained in a number of public repositories including the scientific literature. Metabolic and signalling pathways are often viewed separately, even though both types are composed of interactions involving proteins and other chemical entities. It is necessary to be able to combine data from all available resources to judge the functionality, complexity and completeness of any given network overall, but especially the full integration of relevant information from the scientific literature is still an ongoing and complex task. Currently, the text-mining research community is steadily moving towards processing the full body of the scientific literature by making use of rich linguistic features such as full text parsing, to extract biological interactions. The next step will be to combine these with information from scientific databases to support hypothesis generation for the discovery of new knowledge and the extension of biological networks. The generation of comprehensive networks requires technologies such as entity grounding, coordination resolution and co-reference resolution, which are not fully solved and are required to further improve the quality of results. Here, we analyse the state of the art for the extraction of network information from the scientific literature and the evaluation of extraction methods against reference corpora, discuss challenges involved and identify directions for future research. © The Author 2013. Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

A mixed incoherent feed-forward loop contributes to the regulation of bacterial photosynthesis genes.

PubMed

Mank, Nils N; Berghoff, Bork A; Klug, Gabriele

2013-03-01

Living cells use a variety of regulatory network motifs for accurate gene expression in response to changes in their environment or during differentiation processes. In Rhodobacter sphaeroides, a complex regulatory network controls expression of photosynthesis genes to guarantee optimal energy supply on one hand and to avoid photooxidative stress on the other hand. Recently, we identified a mixed incoherent feed-forward loop comprising the transcription factor PrrA, the sRNA PcrZ and photosynthesis target genes as part of this regulatory network. This point-of-view provides a comparison to other described feed-forward loops and discusses the physiological relevance of PcrZ in more detail.

A mixed incoherent feed-forward loop contributes to the regulation of bacterial photosynthesis genes

PubMed Central

Mank, Nils N.; Berghoff, Bork A.; Klug, Gabriele

2013-01-01

Living cells use a variety of regulatory network motifs for accurate gene expression in response to changes in their environment or during differentiation processes. In Rhodobacter sphaeroides, a complex regulatory network controls expression of photosynthesis genes to guarantee optimal energy supply on one hand and to avoid photooxidative stress on the other hand. Recently, we identified a mixed incoherent feed-forward loop comprising the transcription factor PrrA, the sRNA PcrZ and photosynthesis target genes as part of this regulatory network. This point-of-view provides a comparison to other described feed-forward loops and discusses the physiological relevance of PcrZ in more detail. PMID:23392242

Optimized star sensors laboratory calibration method using a regularization neural network.

PubMed

Zhang, Chengfen; Niu, Yanxiong; Zhang, Hao; Lu, Jiazhen

2018-02-10

High-precision ground calibration is essential to ensure the performance of star sensors. However, the complex distortion and multi-error coupling have brought great difficulties to traditional calibration methods, especially for large field of view (FOV) star sensors. Although increasing the complexity of models is an effective way to improve the calibration accuracy, it significantly increases the demand for calibration data. In order to achieve high-precision calibration of star sensors with large FOV, a novel laboratory calibration method based on a regularization neural network is proposed. A multi-layer structure neural network is designed to represent the mapping of the star vector and the corresponding star point coordinate directly. To ensure the generalization performance of the network, regularization strategies are incorporated into the net structure and the training algorithm. Simulation and experiment results demonstrate that the proposed method can achieve high precision with less calibration data and without any other priori information. Compared with traditional methods, the calibration error of the star sensor decreased by about 30%. The proposed method can satisfy the precision requirement for large FOV star sensors.

A Network Based Method for Analysis of lncRNA-Disease Associations and Prediction of lncRNAs Implicated in Diseases

PubMed Central

Yang, Xiaofei; Gao, Lin; Guo, Xingli; Shi, Xinghua; Wu, Hao; Song, Fei; Wang, Bingbo

2014-01-01

Increasing evidence has indicated that long non-coding RNAs (lncRNAs) are implicated in and associated with many complex human diseases. Despite of the accumulation of lncRNA-disease associations, only a few studies had studied the roles of these associations in pathogenesis. In this paper, we investigated lncRNA-disease associations from a network view to understand the contribution of these lncRNAs to complex diseases. Specifically, we studied both the properties of the diseases in which the lncRNAs were implicated, and that of the lncRNAs associated with complex diseases. Regarding the fact that protein coding genes and lncRNAs are involved in human diseases, we constructed a coding-non-coding gene-disease bipartite network based on known associations between diseases and disease-causing genes. We then applied a propagation algorithm to uncover the hidden lncRNA-disease associations in this network. The algorithm was evaluated by leave-one-out cross validation on 103 diseases in which at least two genes were known to be involved, and achieved an AUC of 0.7881. Our algorithm successfully predicted 768 potential lncRNA-disease associations between 66 lncRNAs and 193 diseases. Furthermore, our results for Alzheimer's disease, pancreatic cancer, and gastric cancer were verified by other independent studies. PMID:24498199

Complex network study of Brazilian soccer players

NASA Astrophysics Data System (ADS)

Onody, Roberto N.; de Castro, Paulo A.

2004-09-01

Although being a very popular sport in many countries, soccer has not received much attention from the scientific community. In this paper, we study soccer from a complex network point of view. First, we consider a bipartite network with two kinds of vertices or nodes: the soccer players and the clubs. Real data were gathered from the 32 editions of the Brazilian soccer championship, in a total of 13411 soccer players and 127 clubs. We find a lot of interesting and perhaps unsuspected results. The probability that a Brazilian soccer player has worked at N clubs or played M games shows an exponential decay while the probability that he has scored G goals is power law. Now, if two soccer players who have worked at the same club at the same time are connected by an edge, then a new type of network arises (composed exclusively by soccer player nodes). Our analysis shows that for this network the degree distribution decays exponentially. We determine the exact values of the clustering coefficient, the assortativity coefficient and the average shortest path length and compare them with those of the Erdös-Rényi and configuration model. The time evolution of these quantities are calculated and the corresponding results discussed.

Two Distinct Scene-Processing Networks Connecting Vision and Memory.

PubMed

Baldassano, Christopher; Esteva, Andre; Fei-Fei, Li; Beck, Diane M

2016-01-01

A number of regions in the human brain are known to be involved in processing natural scenes, but the field has lacked a unifying framework for understanding how these different regions are organized and interact. We provide evidence from functional connectivity and meta-analyses for a new organizational principle, in which scene processing relies upon two distinct networks that split the classically defined parahippocampal place area (PPA). The first network of strongly connected regions consists of the occipital place area/transverse occipital sulcus and posterior PPA, which contain retinotopic maps and are not strongly coupled to the hippocampus at rest. The second network consists of the caudal inferior parietal lobule, retrosplenial complex, and anterior PPA, which connect to the hippocampus (especially anterior hippocampus), and are implicated in both visual and nonvisual tasks, including episodic memory and navigation. We propose that these two distinct networks capture the primary functional division among scene-processing regions, between those that process visual features from the current view of a scene and those that connect information from a current scene view with a much broader temporal and spatial context. This new framework for understanding the neural substrates of scene-processing bridges results from many lines of research, and makes specific functional predictions.

A multi-views multi-learners approach towards dysarthric speech recognition using multi-nets artificial neural networks.

PubMed

Shahamiri, Seyed Reza; Salim, Siti Salwah Binti

2014-09-01

Automatic speech recognition (ASR) can be very helpful for speakers who suffer from dysarthria, a neurological disability that damages the control of motor speech articulators. Although a few attempts have been made to apply ASR technologies to sufferers of dysarthria, previous studies show that such ASR systems have not attained an adequate level of performance. In this study, a dysarthric multi-networks speech recognizer (DM-NSR) model is provided using a realization of multi-views multi-learners approach called multi-nets artificial neural networks, which tolerates variability of dysarthric speech. In particular, the DM-NSR model employs several ANNs (as learners) to approximate the likelihood of ASR vocabulary words and to deal with the complexity of dysarthric speech. The proposed DM-NSR approach was presented as both speaker-dependent and speaker-independent paradigms. In order to highlight the performance of the proposed model over legacy models, multi-views single-learner models of the DM-NSRs were also provided and their efficiencies were compared in detail. Moreover, a comparison among the prominent dysarthric ASR methods and the proposed one is provided. The results show that the DM-NSR recorded improved recognition rate by up to 24.67% and the error rate was reduced by up to 8.63% over the reference model.

Adaptive control of structural balance for complex dynamical networks based on dynamic coupling of nodes

NASA Astrophysics Data System (ADS)

Gao, Zilin; Wang, Yinhe; Zhang, Lili

2018-02-01

In the existing research results of the complex dynamical networks controlled, the controllers are mainly used to guarantee the synchronization or stabilization of the nodes’ state, and the terms coupled with connection relationships may affect the behaviors of nodes, this obviously ignores the dynamic common behavior of the connection relationships between the nodes. In fact, from the point of view of large-scale system, a complex dynamical network can be regarded to be composed of two time-varying dynamic subsystems, which can be called the nodes subsystem and the connection relationships subsystem, respectively. Similar to the synchronization or stabilization of the nodes subsystem, some characteristic phenomena can be also emerged in the connection relationships subsystem. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. This paper focuses on the structural balance in dynamic complex networks. Generally speaking, the state of the connection relationships subsystem is difficult to be measured accurately in practical applications, and thus it is not easy to implant the controller directly into the connection relationships subsystem. It is noted that the nodes subsystem and the relationships subsystem are mutually coupled, which implies that the state of the connection relationships subsystem can be affected by the controllable state of nodes subsystem. Inspired by this observation, by using the structural balance theory of triad, the controller with the parameter adaptive law is proposed for the nodes subsystem in this paper, which may ensure the connection relationship matrix to approximate a given structural balance matrix in the sense of the uniformly ultimately bounded (UUB). That is, the structural balance may be obtained by employing the controlling state of the nodes subsystem. Finally, the simulations are used to show the validity of the method in this paper.

The Complex Construction of Professional Identities: Female EFL Educators in Japan Speak Out

ERIC Educational Resources Information Center

Simon-Maeda, Andrea

2004-01-01

This article reports on the life history narratives of nine female EFL teachers working in higher education in Japan. An interpretive qualitative analysis of the stories suggested that gender cannot be viewed as a free-floating attribute of individual subjectivities but rather must be seen as one of many components in an ever-evolving network of…

Diversified Control Paths: A Significant Way Disease Genes Perturb the Human Regulatory Network

PubMed Central

Wang, Bingbo; Gao, Lin; Zhang, Qingfang; Li, Aimin; Deng, Yue; Guo, Xingli

2015-01-01

Background The complexity of biological systems motivates us to use the underlying networks to provide deep understanding of disease etiology and the human diseases are viewed as perturbations of dynamic properties of networks. Control theory that deals with dynamic systems has been successfully used to capture systems-level knowledge in large amount of quantitative biological interactions. But from the perspective of system control, the ways by which multiple genetic factors jointly perturb a disease phenotype still remain. Results In this work, we combine tools from control theory and network science to address the diversified control paths in complex networks. Then the ways by which the disease genes perturb biological systems are identified and quantified by the control paths in a human regulatory network. Furthermore, as an application, prioritization of candidate genes is presented by use of control path analysis and gene ontology annotation for definition of similarities. We use leave-one-out cross-validation to evaluate the ability of finding the gene-disease relationship. Results have shown compatible performance with previous sophisticated works, especially in directed systems. Conclusions Our results inspire a deeper understanding of molecular mechanisms that drive pathological processes. Diversified control paths offer a basis for integrated intervention techniques which will ultimately lead to the development of novel therapeutic strategies. PMID:26284649

A programming environment for distributed complex computing. An overview of the Framework for Interdisciplinary Design Optimization (FIDO) project. NASA Langley TOPS exhibit H120b

NASA Technical Reports Server (NTRS)

Townsend, James C.; Weston, Robert P.; Eidson, Thomas M.

1993-01-01

The Framework for Interdisciplinary Design Optimization (FIDO) is a general programming environment for automating the distribution of complex computing tasks over a networked system of heterogeneous computers. For example, instead of manually passing a complex design problem between its diverse specialty disciplines, the FIDO system provides for automatic interactions between the discipline tasks and facilitates their communications. The FIDO system networks all the computers involved into a distributed heterogeneous computing system, so they have access to centralized data and can work on their parts of the total computation simultaneously in parallel whenever possible. Thus, each computational task can be done by the most appropriate computer. Results can be viewed as they are produced and variables changed manually for steering the process. The software is modular in order to ease migration to new problems: different codes can be substituted for each of the current code modules with little or no effect on the others. The potential for commercial use of FIDO rests in the capability it provides for automatically coordinating diverse computations on a networked system of workstations and computers. For example, FIDO could provide the coordination required for the design of vehicles or electronics or for modeling complex systems.

Social network approaches to leadership: an integrative conceptual review.

PubMed

Carter, Dorothy R; DeChurch, Leslie A; Braun, Michael T; Contractor, Noshir S

2015-05-01

Contemporary definitions of leadership advance a view of the phenomenon as relational, situated in specific social contexts, involving patterned emergent processes, and encompassing both formal and informal influence. Paralleling these views is a growing interest in leveraging social network approaches to study leadership. Social network approaches provide a set of theories and methods with which to articulate and investigate, with greater precision and rigor, the wide variety of relational perspectives implied by contemporary leadership theories. Our goal is to advance this domain through an integrative conceptual review. We begin by answering the question of why-Why adopt a network approach to study leadership? Then, we offer a framework for organizing prior research. Our review reveals 3 areas of research, which we term: (a) leadership in networks, (b) leadership as networks, and (c) leadership in and as networks. By clarifying the conceptual underpinnings, key findings, and themes within each area, this review serves as a foundation for future inquiry that capitalizes on, and programmatically builds upon, the insights of prior work. Our final contribution is to advance an agenda for future research that harnesses the confluent ideas at the intersection of leadership in and as networks. Leadership in and as networks represents a paradigm shift in leadership research-from an emphasis on the static traits and behaviors of formal leaders whose actions are contingent upon situational constraints, toward an emphasis on the complex and patterned relational processes that interact with the embedding social context to jointly constitute leadership emergence and effectiveness. (c) 2015 APA, all rights reserved.

Dynamic Defensive Posture for Computer Network Defence

DTIC Science & Technology

2006-12-01

12 4.1.1 Skybox View . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.1.2 CycSecure...Commercial projects 4.1.1 Skybox View Skybox View is a commercial product that aims to evaluate network risk by iden- tifying network resources that are...changes before implementing them on the live network. In these respects, it is a tool for identifying exposed resources. Skybox View also permits some

Coexpression landscape in ATTED-II: usage of gene list and gene network for various types of pathways.

PubMed

Obayashi, Takeshi; Kinoshita, Kengo

2010-05-01

Gene coexpression analyses are a powerful method to predict the function of genes and/or to identify genes that are functionally related to query genes. The basic idea of gene coexpression analyses is that genes with similar functions should have similar expression patterns under many different conditions. This approach is now widely used by many experimental researchers, especially in the field of plant biology. In this review, we will summarize recent successful examples obtained by using our gene coexpression database, ATTED-II. Specifically, the examples will describe the identification of new genes, such as the subunits of a complex protein, the enzymes in a metabolic pathway and transporters. In addition, we will discuss the discovery of a new intercellular signaling factor and new regulatory relationships between transcription factors and their target genes. In ATTED-II, we provide two basic views of gene coexpression, a gene list view and a gene network view, which can be used as guide gene approach and narrow-down approach, respectively. In addition, we will discuss the coexpression effectiveness for various types of gene sets.

ShapeShop: Towards Understanding Deep Learning Representations via Interactive Experimentation.

PubMed

Hohman, Fred; Hodas, Nathan; Chau, Duen Horng

2017-05-01

Deep learning is the driving force behind many recent technologies; however, deep neural networks are often viewed as "black-boxes" due to their internal complexity that is hard to understand. Little research focuses on helping people explore and understand the relationship between a user's data and the learned representations in deep learning models. We present our ongoing work, ShapeShop, an interactive system for visualizing and understanding what semantics a neural network model has learned. Built using standard web technologies, ShapeShop allows users to experiment with and compare deep learning models to help explore the robustness of image classifiers.

Genetic networking of the Bemisia tabaci cryptic species complex reveals pattern of biological invasions.

PubMed

De Barro, Paul; Ahmed, Muhammad Z

2011-01-01

A challenge within the context of cryptic species is the delimitation of individual species within the complex. Statistical parsimony network analytics offers the opportunity to explore limits in situations where there are insufficient species-specific morphological characters to separate taxa. The results also enable us to explore the spread in taxa that have invaded globally. Using a 657 bp portion of mitochondrial cytochrome oxidase 1 from 352 unique haplotypes belonging to the Bemisia tabaci cryptic species complex, the analysis revealed 28 networks plus 7 unconnected individual haplotypes. Of the networks, 24 corresponded to the putative species identified using the rule set devised by Dinsdale et al. (2010). Only two species proposed in Dinsdale et al. (2010) departed substantially from the structure suggested by the analysis. The analysis of the two invasive members of the complex, Mediterranean (MED) and Middle East - Asia Minor 1 (MEAM1), showed that in both cases only a small number of haplotypes represent the majority that have spread beyond the home range; one MEAM1 and three MED haplotypes account for >80% of the GenBank records. Israel is a possible source of the globally invasive MEAM1 whereas MED has two possible sources. The first is the eastern Mediterranean which has invaded only the USA, primarily Florida and to a lesser extent California. The second are western Mediterranean haplotypes that have spread to the USA, Asia and South America. The structure for MED supports two home range distributions, a Sub-Saharan range and a Mediterranean range. The MEAM1 network supports the Middle East - Asia Minor region. The network analyses show a high level of congruence with the species identified in a previous phylogenetic analysis. The analysis of the two globally invasive members of the complex support the view that global invasion often involve very small portions of the available genetic diversity.

Applying graphs and complex networks to football metric interpretation.

PubMed

Arriaza-Ardiles, E; Martín-González, J M; Zuniga, M D; Sánchez-Flores, J; de Saa, Y; García-Manso, J M

2018-02-01

This work presents a methodology for analysing the interactions between players in a football team, from the point of view of graph theory and complex networks. We model the complex network of passing interactions between players of a same team in 32 official matches of the Liga de Fútbol Profesional (Spain), using a passing/reception graph. This methodology allows us to understand the play structure of the team, by analysing the offensive phases of game-play. We utilise two different strategies for characterising the contribution of the players to the team: the clustering coefficient, and centrality metrics (closeness and betweenness). We show the application of this methodology by analyzing the performance of a professional Spanish team according to these metrics and the distribution of passing/reception in the field. Keeping in mind the dynamic nature of collective sports, in the future we will incorporate metrics which allows us to analyse the performance of the team also according to the circumstances of game-play and to different contextual variables such as, the utilisation of the field space, the time, and the ball, according to specific tactical situations. Copyright © 2017 Elsevier B.V. All rights reserved.

Power-law behavior in complex organizational communication networks during crisis

NASA Astrophysics Data System (ADS)

Uddin, Shahadat; Murshed, Shahriar Tanvir Hasan; Hossain, Liaquat

2011-08-01

Communication networks can be described as patterns of contacts which are created due to the flow of messages and information shared among participating actors. Contemporary organizations are now commonly viewed as dynamic systems of adaptation and evolution containing several parts, which interact with one another both in internal and in external environment. Although there is limited consensus among researchers on the precise definition of organizational crisis, there is evidence of shared meaning: crisis produces individual crisis, crisis can be associated with positive or negative conditions, crises can be situations having been precipitated quickly or suddenly or situations that have developed over time and are predictable etc. In this research, we study the power-law behavior of an organizational email communication network during crisis from complexity perspective. Power law simply describes that, the probability that a randomly selected node has k links (i.e. degree k) follows P(k)∼k, where γ is the degree exponent. We used social network analysis tools and techniques to analyze the email communication dataset. We tested two propositions: (1) as organization goes through crisis, a few actors, who are prominent or more active, will become central, and (2) the daily communication network as well as the actors in the communication network exhibit power-law behavior. Our preliminary results support these two propositions. The outcome of this study may provide significant advancement in exploring organizational communication network behavior during crisis.

A global distributed storage architecture

NASA Technical Reports Server (NTRS)

Lionikis, Nemo M.; Shields, Michael F.

1996-01-01

NSA architects and planners have come to realize that to gain the maximum benefit from, and keep pace with, emerging technologies, we must move to a radically different computing architecture. The compute complex of the future will be a distributed heterogeneous environment, where, to a much greater extent than today, network-based services are invoked to obtain resources. Among the rewards of implementing the services-based view are that it insulates the user from much of the complexity of our multi-platform, networked, computer and storage environment and hides its diverse underlying implementation details. In this paper, we will describe one of the fundamental services being built in our envisioned infrastructure; a global, distributed archive with near-real-time access characteristics. Our approach for adapting mass storage services to this infrastructure will become clear as the service is discussed.

Detection of Significant Pneumococcal Meningitis Biomarkers by Ego Network.

PubMed

Wang, Qian; Lou, Zhifeng; Zhai, Liansuo; Zhao, Haibin

2017-06-01

To identify significant biomarkers for detection of pneumococcal meningitis based on ego network. Based on the gene expression data of pneumococcal meningitis and global protein-protein interactions (PPIs) data recruited from open access databases, the authors constructed a differential co-expression network (DCN) to identify pneumococcal meningitis biomarkers in a network view. Here EgoNet algorithm was employed to screen the significant ego networks that could accurately distinguish pneumococcal meningitis from healthy controls, by sequentially seeking ego genes, searching candidate ego networks, refinement of candidate ego networks and significance analysis to identify ego networks. Finally, the functional inference of the ego networks was performed to identify significant pathways for pneumococcal meningitis. By differential co-expression analysis, the authors constructed the DCN that covered 1809 genes and 3689 interactions. From the DCN, a total of 90 ego genes were identified. Starting from these ego genes, three significant ego networks (Module 19, Module 70 and Module 71) that could predict clinical outcomes for pneumococcal meningitis were identified by EgoNet algorithm, and the corresponding ego genes were GMNN, MAD2L1 and TPX2, respectively. Pathway analysis showed that these three ego networks were related to CDT1 association with the CDC6:ORC:origin complex, inactivation of APC/C via direct inhibition of the APC/C complex pathway, and DNA strand elongation, respectively. The authors successfully screened three significant ego modules which could accurately predict the clinical outcomes for pneumococcal meningitis and might play important roles in host response to pathogen infection in pneumococcal meningitis.

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

PubMed Central

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

2014-01-01

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

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.

3D multi-view convolutional neural networks for lung nodule classification

PubMed Central

Kang, Guixia; Hou, Beibei; Zhang, Ningbo

2017-01-01

The 3D convolutional neural network (CNN) is able to make full use of the spatial 3D context information of lung nodules, and the multi-view strategy has been shown to be useful for improving the performance of 2D CNN in classifying lung nodules. In this paper, we explore the classification of lung nodules using the 3D multi-view convolutional neural networks (MV-CNN) with both chain architecture and directed acyclic graph architecture, including 3D Inception and 3D Inception-ResNet. All networks employ the multi-view-one-network strategy. We conduct a binary classification (benign and malignant) and a ternary classification (benign, primary malignant and metastatic malignant) on Computed Tomography (CT) images from Lung Image Database Consortium and Image Database Resource Initiative database (LIDC-IDRI). All results are obtained via 10-fold cross validation. As regards the MV-CNN with chain architecture, results show that the performance of 3D MV-CNN surpasses that of 2D MV-CNN by a significant margin. Finally, a 3D Inception network achieved an error rate of 4.59% for the binary classification and 7.70% for the ternary classification, both of which represent superior results for the corresponding task. We compare the multi-view-one-network strategy with the one-view-one-network strategy. The results reveal that the multi-view-one-network strategy can achieve a lower error rate than the one-view-one-network strategy. PMID:29145492

Semi-Supervised Multi-View Learning for Gene Network Reconstruction

PubMed Central

Ceci, Michelangelo; Pio, Gianvito; Kuzmanovski, Vladimir; Džeroski, Sašo

2015-01-01

The task of gene regulatory network reconstruction from high-throughput data is receiving increasing attention in recent years. As a consequence, many inference methods for solving this task have been proposed in the literature. It has been recently observed, however, that no single inference method performs optimally across all datasets. It has also been shown that the integration of predictions from multiple inference methods is more robust and shows high performance across diverse datasets. Inspired by this research, in this paper, we propose a machine learning solution which learns to combine predictions from multiple inference methods. While this approach adds additional complexity to the inference process, we expect it would also carry substantial benefits. These would come from the automatic adaptation to patterns on the outputs of individual inference methods, so that it is possible to identify regulatory interactions more reliably when these patterns occur. This article demonstrates the benefits (in terms of accuracy of the reconstructed networks) of the proposed method, which exploits an iterative, semi-supervised ensemble-based algorithm. The algorithm learns to combine the interactions predicted by many different inference methods in the multi-view learning setting. The empirical evaluation of the proposed algorithm on a prokaryotic model organism (E. coli) and on a eukaryotic model organism (S. cerevisiae) clearly shows improved performance over the state of the art methods. The results indicate that gene regulatory network reconstruction for the real datasets is more difficult for S. cerevisiae than for E. coli. The software, all the datasets used in the experiments and all the results are available for download at the following link: http://figshare.com/articles/Semi_supervised_Multi_View_Learning_for_Gene_Network_Reconstruction/1604827. PMID:26641091

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

Do governance choices matter in health care networks?: an exploratory configuration study of health care networks.

PubMed

Willem, Annick; Gemmel, Paul

2013-06-24

Health care networks are widely used and accepted as an organizational form that enables integrated care as well as dealing with complex matters in health care. However, research on the governance of health care networks lags behind. The research aim of our study is to explore the type and importance of governance structure and governance mechanisms for network effectiveness. The study has a multiple case study design and covers 22 health care networks. Using a configuration view, combinations of network governance and other network characteristics were studied on the level of the network. Based on interview and questionnaire data, network characteristics were identified and patterns in the data looked for. Neither a dominant (or optimal) governance structure or mechanism nor a perfect fit among governance and other characteristics were revealed, but a number of characteristics that need further study might be related to effective networks such as the role of governmental agencies, legitimacy, and relational, hierarchical, and contractual governance mechanisms as complementary factors. Although the results emphasize the situational character of network governance and effectiveness, they give practitioners in the health care sector indications of which factors might be more or less crucial for network effectiveness.

MiRNA-miRNA synergistic network: construction via co-regulating functional modules and disease miRNA topological features.

PubMed

Xu, Juan; Li, Chuan-Xing; Li, Yong-Sheng; Lv, Jun-Ying; Ma, Ye; Shao, Ting-Ting; Xu, Liang-De; Wang, Ying-Ying; Du, Lei; Zhang, Yun-Peng; Jiang, Wei; Li, Chun-Quan; Xiao, Yun; Li, Xia

2011-02-01

Synergistic regulations among multiple microRNAs (miRNAs) are important to understand the mechanisms of complex post-transcriptional regulations in humans. Complex diseases are affected by several miRNAs rather than a single miRNA. So, it is a challenge to identify miRNA synergism and thereby further determine miRNA functions at a system-wide level and investigate disease miRNA features in the miRNA-miRNA synergistic network from a new view. Here, we constructed a miRNA-miRNA functional synergistic network (MFSN) via co-regulating functional modules that have three features: common targets of corresponding miRNA pairs, enriched in the same gene ontology category and close proximity in the protein interaction network. Predicted miRNA synergism is validated by significantly high co-expression of functional modules and significantly negative regulation to functional modules. We found that the MFSN exhibits a scale free, small world and modular architecture. Furthermore, the topological features of disease miRNAs in the MFSN are distinct from non-disease miRNAs. They have more synergism, indicating their higher complexity of functions and are the global central cores of the MFSN. In addition, miRNAs associated with the same disease are close to each other. The structure of the MFSN and the features of disease miRNAs are validated to be robust using different miRNA target data sets.

Stochastic opinion formation in scale-free networks

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

M. Bartolozzi; D. B. Leinweber; A. W. Thomas

2005-10-01

The dynamics of opinion formation in large groups of people is a complex nonlinear phenomenon whose investigation is just beginning. Both collective behavior and personal views play an important role in this mechanism. In the present work we mimic the dynamics of opinion formation of a group of agents, represented by two states 1, as a stochastic response of each agent to the opinion of his/her neighbors in the social network and to feedback from the average opinion of the whole. In the light of recent studies, a scale-free Barabsi-Albert network has been selected to simulate the topology of themore » interactions. A turbulent-like dynamics, characterized by an intermittent behavior, is observed for a certain range of the model parameters. The problem of uncertainty in decision taking is also addressed both from a topological point of view, using random and targeted removal of agents from the network, and by implementing a three-state model, where the third state, zero, is related to the information available to each agent. Finally, the results of the model are tested against the best known network of social interactions: the stock market. A time series of daily closures of the Dow-Jones index has been used as an indicator of the possible applicability of our model in the financial context. Good qualitative agreement is found.« less

Seismic Hazard Analysis on a Complex, Interconnected Fault Network

NASA Astrophysics Data System (ADS)

Page, M. T.; Field, E. H.; Milner, K. R.

2017-12-01

In California, seismic hazard models have evolved from simple, segmented prescriptive models to much more complex representations of multi-fault and multi-segment earthquakes on an interconnected fault network. During the development of the 3rd Uniform California Earthquake Rupture Forecast (UCERF3), the prevalence of multi-fault ruptures in the modeling was controversial. Yet recent earthquakes, for example, the Kaikora earthquake - as well as new research on the potential of multi-fault ruptures (e.g., Nissen et al., 2016; Sahakian et al. 2017) - have validated this approach. For large crustal earthquakes, multi-fault ruptures may be the norm rather than the exception. As datasets improve and we can view the rupture process at a finer scale, the interconnected, fractal nature of faults is revealed even by individual earthquakes. What is the proper way to model earthquakes on a fractal fault network? We show multiple lines of evidence that connectivity even in modern models such as UCERF3 may be underestimated, although clustering in UCERF3 mitigates some modeling simplifications. We need a methodology that can be applied equally well where the fault network is well-mapped and where it is not - an extendable methodology that allows us to "fill in" gaps in the fault network and in our knowledge.

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

The Life-Changing Magic of Nonlinearity in Network Control

NASA Astrophysics Data System (ADS)

Cornelius, Sean

The proper functioning and reliability of many man-made and natural systems is fundamentally tied to our ability to control them. Indeed, applications as diverse as ecosystem management, emergency response and cell reprogramming all, at their heart, require us to drive a system to--or keep it in--a desired state. This process is complicated by the nonlinear dynamics inherent to most real systems, which has traditionally been viewed as the principle obstacle to their control. In this talk, I will discuss two ways in which nonlinearity turns this view on its head, in fact representing an asset to the control of complex systems. First, I will show how nonlinearity in the form of multistability allows one to systematically design control interventions that can deliberately induce ``reverse cascading failures'', in which a network spontaneously evolves to a desirable (rather than a failed) state. Second, I will show that nonlinearity in the form of time-varying dynamics unexpectedly makes temporal networks easier to control than their static counterparts, with the former enjoying dramatic and simultaneous reductions in all costs of control. This is true despite the fact that temporality tends to fragment a network's structure, disrupting the paths that allow the directly-controlled or ``driver'' nodes to communicate with the rest of the network. Taken together, these studies shed new light on the crucial role of nonlinearity in network control, and provide support to the idea we can control nonlinearity, rather than letting nonlinearity control us.

Graph coarse-graining reveals differences in the module-level structure of functional brain networks.

PubMed

Kujala, Rainer; Glerean, Enrico; Pan, Raj Kumar; Jääskeläinen, Iiro P; Sams, Mikko; Saramäki, Jari

2016-11-01

Networks have become a standard tool for analyzing functional magnetic resonance imaging (fMRI) data. In this approach, brain areas and their functional connections are mapped to the nodes and links of a network. Even though this mapping reduces the complexity of the underlying data, it remains challenging to understand the structure of the resulting networks due to the large number of nodes and links. One solution is to partition networks into modules and then investigate the modules' composition and relationship with brain functioning. While this approach works well for single networks, understanding differences between two networks by comparing their partitions is difficult and alternative approaches are thus necessary. To this end, we present a coarse-graining framework that uses a single set of data-driven modules as a frame of reference, enabling one to zoom out from the node- and link-level details. As a result, differences in the module-level connectivity can be understood in a transparent, statistically verifiable manner. We demonstrate the feasibility of the method by applying it to networks constructed from fMRI data recorded from 13 healthy subjects during rest and movie viewing. While independently partitioning the rest and movie networks is shown to yield little insight, the coarse-graining framework enables one to pinpoint differences in the module-level structure, such as the increased number of intra-module links within the visual cortex during movie viewing. In addition to quantifying differences due to external stimuli, the approach could also be applied in clinical settings, such as comparing patients with healthy controls. © 2016 Federation of European Neuroscience Societies and John Wiley & Sons Ltd.

Systems genetics approaches to understand complex traits

PubMed Central

Civelek, Mete; Lusis, Aldons J.

2014-01-01

Systems genetics is an approach to understand the flow of biological information that underlies complex traits. It uses a range of experimental and statistical methods to quantitate and integrate intermediate phenotypes, such as transcript, protein or metabolite levels, in populations that vary for traits of interest. Systems genetics studies have provided the first global view of the molecular architecture of complex traits and are useful for the identification of genes, pathways and networks that underlie common human diseases. Given the urgent need to understand how the thousands of loci that have been identified in genome-wide association studies contribute to disease susceptibility, systems genetics is likely to become an increasingly important approach to understanding both biology and disease. PMID:24296534

CORUM: the comprehensive resource of mammalian protein complexes

PubMed Central

Ruepp, Andreas; Brauner, Barbara; Dunger-Kaltenbach, Irmtraud; Frishman, Goar; Montrone, Corinna; Stransky, Michael; Waegele, Brigitte; Schmidt, Thorsten; Doudieu, Octave Noubibou; Stümpflen, Volker; Mewes, H. Werner

2008-01-01

Protein complexes are key molecular entities that integrate multiple gene products to perform cellular functions. The CORUM (http://mips.gsf.de/genre/proj/corum/index.html) database is a collection of experimentally verified mammalian protein complexes. Information is manually derived by critical reading of the scientific literature from expert annotators. Information about protein complexes includes protein complex names, subunits, literature references as well as the function of the complexes. For functional annotation, we use the FunCat catalogue that enables to organize the protein complex space into biologically meaningful subsets. The database contains more than 1750 protein complexes that are built from 2400 different genes, thus representing 12% of the protein-coding genes in human. A web-based system is available to query, view and download the data. CORUM provides a comprehensive dataset of protein complexes for discoveries in systems biology, analyses of protein networks and protein complex-associated diseases. Comparable to the MIPS reference dataset of protein complexes from yeast, CORUM intends to serve as a reference for mammalian protein complexes. PMID:17965090

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.

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-offs on Phenotype Robustness in Biological Networks. Part III: Synthetic Gene Networks in Synthetic Biology

PubMed Central

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties that are observed in biological systems at many different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be large enough to confer: intrinsic robustness for tolerating intrinsic parameter fluctuations; genetic robustness for buffering genetic variations; and environmental robustness for resisting environmental disturbances. Network robustness is needed so phenotype stability of biological network can be maintained, guaranteeing phenotype robustness. Synthetic biology is foreseen to have important applications in biotechnology and medicine; it is expected to contribute significantly to a better understanding of functioning of complex biological systems. This paper presents a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation for synthetic gene networks in synthetic biology. Further, from the unifying mathematical framework, we found that the phenotype robustness criterion for synthetic gene networks is the following: if intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness, then the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in synthetic biology can also be investigated through corresponding phenotype robustness criteria from the systematic point of view. Finally, a robust synthetic design that involves network evolution algorithms with desired behavior under intrinsic parameter fluctuations, genetic variations, and environmental disturbances, is also proposed, together with a simulation example. PMID:23515190

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-offs on Phenotype Robustness in Biological Networks. Part III: Synthetic Gene Networks in Synthetic Biology.

PubMed

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties that are observed in biological systems at many different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be large enough to confer: intrinsic robustness for tolerating intrinsic parameter fluctuations; genetic robustness for buffering genetic variations; and environmental robustness for resisting environmental disturbances. Network robustness is needed so phenotype stability of biological network can be maintained, guaranteeing phenotype robustness. Synthetic biology is foreseen to have important applications in biotechnology and medicine; it is expected to contribute significantly to a better understanding of functioning of complex biological systems. This paper presents a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation for synthetic gene networks in synthetic biology. Further, from the unifying mathematical framework, we found that the phenotype robustness criterion for synthetic gene networks is the following: if intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness, then the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in synthetic biology can also be investigated through corresponding phenotype robustness criteria from the systematic point of view. Finally, a robust synthetic design that involves network evolution algorithms with desired behavior under intrinsic parameter fluctuations, genetic variations, and environmental disturbances, is also proposed, together with a simulation example.

ICPP: Approach for Understanding Complexity of Plasma

NASA Astrophysics Data System (ADS)

Sato, Tetsuya

2000-10-01

In this talk I wish to present an IT system that could promote Science of Complexity. In order to deal with a seemingly `complex' phenomenon, which means `beyond analytical manipulation', computer simulation is a viable powerful tool. However, complexity implies a concept beyond the horizon of reductionism. Therefore, rather than simply solving a complex phenomenon for a given boundary condition, one must establish an intelligent way of attacking mutual evolution of a system and its environment. NIFS-TCSC has been developing a prototype system that consists of supercomputers, virtual reality devices and high-speed network system. Let us explain this by picking up a global atmospheric circulation group, global oceanic circulation group and local weather prediction group. Local weather prediction group predicts the local change of the weather such as the creation of cloud and rain in the near future under the global conditions obtained by the global atmospheric and ocean groups. The global groups run simulations by modifying the local heat source/sink evaluated by the local weather prediction and then obtain the global conditions in the next time step. By repeating such a feedback performance one can predict the mutual evolution of the local system and its environment. Mutual information exchanges among multiple groups are carried out instantaneously by the networked common virtual reality space in which 3-D global and local images of the atmospheric and oceanic circulation and the cloud and rain maps are arbitrarily manipulated by any of the groups and commonly viewed. The present networking system has a great advantage that any simulation groups can freely and arbitrarily change their alignment, so that mutual evolution of any stratum system can become tractable by utilizing this network system.

A conceptual model for the development process of confirmatory adaptive clinical trials within an emergency research network.

PubMed

Mawocha, Samkeliso C; Fetters, Michael D; Legocki, Laurie J; Guetterman, Timothy C; Frederiksen, Shirley; Barsan, William G; Lewis, Roger J; Berry, Donald A; Meurer, William J

2017-06-01

Adaptive clinical trials use accumulating data from enrolled subjects to alter trial conduct in pre-specified ways based on quantitative decision rules. In this research, we sought to characterize the perspectives of key stakeholders during the development process of confirmatory-phase adaptive clinical trials within an emergency clinical trials network and to build a model to guide future development of adaptive clinical trials. We used an ethnographic, qualitative approach to evaluate key stakeholders' views about the adaptive clinical trial development process. Stakeholders participated in a series of multidisciplinary meetings during the development of five adaptive clinical trials and completed a Strengths-Weaknesses-Opportunities-Threats questionnaire. In the analysis, we elucidated overarching themes across the stakeholders' responses to develop a conceptual model. Four major overarching themes emerged during the analysis of stakeholders' responses to questioning: the perceived statistical complexity of adaptive clinical trials and the roles of collaboration, communication, and time during the development process. Frequent and open communication and collaboration were viewed by stakeholders as critical during the development process, as were the careful management of time and logistical issues related to the complexity of planning adaptive clinical trials. The Adaptive Design Development Model illustrates how statistical complexity, time, communication, and collaboration are moderating factors in the adaptive design development process. The intensity and iterative nature of this process underscores the need for funding mechanisms for the development of novel trial proposals in academic settings.

Targeted interactomics reveals a complex core cell cycle machinery in Arabidopsis thaliana.

PubMed

Van Leene, Jelle; Hollunder, Jens; Eeckhout, Dominique; Persiau, Geert; Van De Slijke, Eveline; Stals, Hilde; Van Isterdael, Gert; Verkest, Aurine; Neirynck, Sandy; Buffel, Yelle; De Bodt, Stefanie; Maere, Steven; Laukens, Kris; Pharazyn, Anne; Ferreira, Paulo C G; Eloy, Nubia; Renne, Charlotte; Meyer, Christian; Faure, Jean-Denis; Steinbrenner, Jens; Beynon, Jim; Larkin, John C; Van de Peer, Yves; Hilson, Pierre; Kuiper, Martin; De Veylder, Lieven; Van Onckelen, Harry; Inzé, Dirk; Witters, Erwin; De Jaeger, Geert

2010-08-10

Cell proliferation is the main driving force for plant growth. Although genome sequence analysis revealed a high number of cell cycle genes in plants, little is known about the molecular complexes steering cell division. In a targeted proteomics approach, we mapped the core complex machinery at the heart of the Arabidopsis thaliana cell cycle control. Besides a central regulatory network of core complexes, we distinguished a peripheral network that links the core machinery to up- and downstream pathways. Over 100 new candidate cell cycle proteins were predicted and an in-depth biological interpretation demonstrated the hypothesis-generating power of the interaction data. The data set provided a comprehensive view on heterodimeric cyclin-dependent kinase (CDK)-cyclin complexes in plants. For the first time, inhibitory proteins of plant-specific B-type CDKs were discovered and the anaphase-promoting complex was characterized and extended. Important conclusions were that mitotic A- and B-type cyclins form complexes with the plant-specific B-type CDKs and not with CDKA;1, and that D-type cyclins and S-phase-specific A-type cyclins seem to be associated exclusively with CDKA;1. Furthermore, we could show that plants have evolved a combinatorial toolkit consisting of at least 92 different CDK-cyclin complex variants, which strongly underscores the functional diversification among the large family of cyclins and reflects the pivotal role of cell cycle regulation in the developmental plasticity of plants.

Contrasting Views of Complexity and Their Implications For Network-Centric Infrastructures

DTIC Science & Technology

2010-07-04

problem) can be undecidable. While two gravitationally interacting bodies yield simple orbits, Poincare showed that the motion of even three...statistical me- chanics are valid only when the [billiard] balls are distributed, in their positions and motions , in a helter-skelter, i.e., a disorga- nized...Rube Goldberg, whose famous cartoons depict “ comically involved complicated invention[s], laboriously contrived to perform a simple operation” [68

Efficient Feature Extraction and Likelihood Fusion for Vehicle Tracking in Low Frame Rate Airborne Video

DTIC Science & Technology

2010-07-01

imagery, persistent sensor array I. Introduction New device fabrication technologies and heterogeneous embedded processors have led to the emergence of a...geometric occlusions between target and sensor , motion blur, urban scene complexity, and high data volumes. In practical terms the targets are small...distributed airborne narrow-field-of-view video sensor networks. Airborne camera arrays combined with com- putational photography techniques enable the

Epidemic spreading and global stability of an SIS model with an infective vector on complex networks

NASA Astrophysics Data System (ADS)

Kang, Huiyan; Fu, Xinchu

2015-10-01

In this paper, we present a new SIS model with delay on scale-free networks. The model is suitable to describe some epidemics which are not only transmitted by a vector but also spread between individuals by direct contacts. In view of the biological relevance and real spreading process, we introduce a delay to denote average incubation period of disease in a vector. By mathematical analysis, we obtain the epidemic threshold and prove the global stability of equilibria. The simulation shows the delay will effect the epidemic spreading. Finally, we investigate and compare two major immunization strategies, uniform immunization and targeted immunization.

ShapeShop: Towards Understanding Deep Learning Representations via Interactive Experimentation

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

Hohman, Frederick M.; Hodas, Nathan O.; Chau, Duen Horng

Deep learning is the driving force behind many recent technologies; however, deep neural networks are often viewed as “black-boxes” due to their internal complexity that is hard to understand. Little research focuses on helping people explore and understand the relationship between a user’s data and the learned representations in deep learning models. We present our ongoing work, ShapeShop, an interactive system for visualizing and understanding what semantics a neural network model has learned. Built using standard web technologies, ShapeShop allows users to experiment with and compare deep learning models to help explore the robustness of image classifiers.

Complex networks in confined comminution

NASA Astrophysics Data System (ADS)

Walker, David M.; Tordesillas, Antoinette; Einav, Itai; Small, Michael

2011-08-01

The physical process of confined comminution is investigated within the framework of complex networks. We first characterize the topology of the unweighted contact networks as generated by the confined comminution process. We find this process gives rise to an ultimate contact network which exhibits a scale-free degree distribution and small world properties. In particular, if viewed in the context of networks through which information travels along shortest paths, we find that the global average of the node vulnerability decreases as the comminution process continues, with individual node vulnerability correlating with grain size. A possible application to the design of synthetic networks (e.g., sensor networks) is highlighted. Next we turn our attention to the physics of the granular comminution process and examine force transmission with respect to the weighted contact networks, where each link is weighted by the inverse magnitude of the normal force acting at the associated contact. We find that the strong forces (i.e., force chains) are transmitted along pathways in the network which are mainly following shortest-path routing protocols, as typically found, for example, in communication systems. Motivated by our earlier studies of the building blocks for self-organization in dense granular systems, we also explore the properties of the minimal contact cycles. The distribution of the contact strain energy intensity of 4-cycle motifs in the ultimate state of the confined comminution process is shown to be consistent with a scale-free distribution with infinite variance, thereby suggesting that 4-cycle arrangements of grains are capable of storing vast amounts of energy in their contacts without breaking.

Expected antenna utilization and overload

NASA Technical Reports Server (NTRS)

Posner, Edward C.

1991-01-01

The trade-offs between the number of antennas at Deep Space Network (DSN) Deep-Space Communications Complex and the fraction of continuous coverage provided to a set of hypothetical spacecraft, assuming random placement of the space craft passes during the day. The trade-offs are fairly robust with respect to the randomness assumption. A sample result is that a three-antenna complex provides an average of 82.6 percent utilization of facilities and coverage of nine spacecraft that each have 8-hour passes, whereas perfect phasing of the passes would yield 100 percent utilization and coverage. One key point is that sometimes fewer than three spacecraft are visible, so an antenna is idle, while at other times, there aren't enough antennas, and some spacecraft do without service. This point of view may be useful in helping to size the network or to develop a normalization for a figure of merit of DSN coverage.

Spectral-spatial classification of hyperspectral image using three-dimensional convolution network

NASA Astrophysics Data System (ADS)

Liu, Bing; Yu, Xuchu; Zhang, Pengqiang; Tan, Xiong; Wang, Ruirui; Zhi, Lu

2018-01-01

Recently, hyperspectral image (HSI) classification has become a focus of research. However, the complex structure of an HSI makes feature extraction difficult to achieve. Most current methods build classifiers based on complex handcrafted features computed from the raw inputs. The design of an improved 3-D convolutional neural network (3D-CNN) model for HSI classification is described. This model extracts features from both the spectral and spatial dimensions through the application of 3-D convolutions, thereby capturing the important discrimination information encoded in multiple adjacent bands. The designed model views the HSI cube data altogether without relying on any pre- or postprocessing. In addition, the model is trained in an end-to-end fashion without any handcrafted features. The designed model was applied to three widely used HSI datasets. The experimental results demonstrate that the 3D-CNN-based method outperforms conventional methods even with limited labeled training samples.

What Can Quantum Optics Say about Computational Complexity Theory?

NASA Astrophysics Data System (ADS)

Rahimi-Keshari, Saleh; Lund, Austin P.; Ralph, Timothy C.

2015-02-01

Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for calculating the output probabilities, and by considering input thermal states, we show that the output probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. It is believed that approximating permanents of complex matrices in general is a #P-hard problem. However, we show that these permanents can be approximated with an algorithm in the BPPNP complexity class, as there exists an efficient classical algorithm for sampling from the output probability distribution. We further consider input squeezed-vacuum states and discuss the complexity of sampling from the probability distribution at the output.

A mathematical analysis of the effects of Hebbian learning rules on the dynamics and structure of discrete-time random recurrent neural networks.

PubMed

Siri, Benoît; Berry, Hugues; Cessac, Bruno; Delord, Bruno; Quoy, Mathias

2008-12-01

We present a mathematical analysis of the effects of Hebbian learning in random recurrent neural networks, with a generic Hebbian learning rule, including passive forgetting and different timescales, for neuronal activity and learning dynamics. Previous numerical work has reported that Hebbian learning drives the system from chaos to a steady state through a sequence of bifurcations. Here, we interpret these results mathematically and show that these effects, involving a complex coupling between neuronal dynamics and synaptic graph structure, can be analyzed using Jacobian matrices, which introduce both a structural and a dynamical point of view on neural network evolution. Furthermore, we show that sensitivity to a learned pattern is maximal when the largest Lyapunov exponent is close to 0. We discuss how neural networks may take advantage of this regime of high functional interest.

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

NASA Astrophysics Data System (ADS)

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

2004-08-01

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

Understanding interfirm relationships in business ecosystems with interactive visualization.

PubMed

Basole, Rahul C; Clear, Trustin; Hu, Mengdie; Mehrotra, Harshit; Stasko, John

2013-12-01

Business ecosystems are characterized by large, complex, and global networks of firms, often from many different market segments, all collaborating, partnering, and competing to create and deliver new products and services. Given the rapidly increasing scale, complexity, and rate of change of business ecosystems, as well as economic and competitive pressures, analysts are faced with the formidable task of quickly understanding the fundamental characteristics of these interfirm networks. Existing tools, however, are predominantly query- or list-centric with limited interactive, exploratory capabilities. Guided by a field study of corporate analysts, we have designed and implemented dotlink360, an interactive visualization system that provides capabilities to gain systemic insight into the compositional, temporal, and connective characteristics of business ecosystems. dotlink360 consists of novel, multiple connected views enabling the analyst to explore, discover, and understand interfirm networks for a focal firm, specific market segments or countries, and the entire business ecosystem. System evaluation by a small group of prototypical users shows supporting evidence of the benefits of our approach. This design study contributes to the relatively unexplored, but promising area of exploratory information visualization in market research and business strategy.

MicroRNA-mediated regulatory circuits: outlook and perspectives

NASA Astrophysics Data System (ADS)

Cora', Davide; Re, Angela; Caselle, Michele; Bussolino, Federico

2017-08-01

MicroRNAs have been found to be necessary for regulating genes implicated in almost all signaling pathways, and consequently their dysfunction influences many diseases, including cancer. Understanding of the complexity of the microRNA-mediated regulatory network has grown in terms of size, connectivity and dynamics with the development of computational and, more recently, experimental high-throughput approaches for microRNA target identification. Newly developed studies on recurrent microRNA-mediated circuits in regulatory networks, also known as network motifs, have substantially contributed to addressing this complexity, and therefore to helping understand the ways by which microRNAs achieve their regulatory role. This review provides a summarizing view of the state-of-the-art, and perspectives of research efforts on microRNA-mediated regulatory motifs. In this review, we discuss the topological properties characterizing different types of circuits, and the regulatory features theoretically enabled by such properties, with a special emphasis on examples of circuits typifying their biological significance in experimentally validated contexts. Finally, we will consider possible future developments, in particular regarding microRNA-mediated circuits involving long non-coding RNAs and epigenetic regulators.

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.

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.

Assured communications and combat resiliency: the relationship between effective national communications and combat efficiency

NASA Astrophysics Data System (ADS)

Allgood, Glenn O.; Kuruganti, Phani Teja; Nutaro, James; Saffold, Jay

2009-05-01

Combat resiliency is the ability of a commander to prosecute, control, and consolidate his/her's sphere of influence in adverse and changing conditions. To support this, an infrastructure must exist that allows the commander to view the world in varying degrees of granularity with sufficient levels of detail to permit confidence estimates to be levied against decisions and course of actions. An infrastructure such as this will include the ability to effectively communicate context and relevance within and across the battle space. To achieve this will require careful thought, planning, and understanding of a network and its capacity limitations in post-event command and control. Relevance and impact on any existing infrastructure must be fully understood prior to deployment to exploit the system's full capacity and capabilities. In this view, the combat communication network is considered an integral part of or National communication network and infrastructure. This paper will describe an analytical tool set developed at ORNL and RNI incorporating complexity theory, advanced communications modeling, simulation, and visualization technologies that could be used as a pre-planning tool or post event reasoning application to support response and containment.

Atmospheric processes over complex terrain

NASA Astrophysics Data System (ADS)

Banta, Robert M.; Berri, G.; Blumen, William; Carruthers, David J.; Dalu, G. A.; Durran, Dale R.; Egger, Joseph; Garratt, J. R.; Hanna, Steven R.; Hunt, J. C. R.

1990-06-01

A workshop on atmospheric processes over complex terrain, sponsored by the American Meteorological Society, was convened in Park City, Utah from 24 vto 28 October 1988. The overall objective of the workshop was one of interaction and synthesis--interaction among atmospheric scientists carrying out research on a variety of orographic flow problems, and a synthesis of their results and points of view into an assessment of the current status of topical research problems. The final day of the workshop was devoted to an open discussion on the research directions that could be anticipated in the next decade because of new and planned instrumentation and observational networks, the recent emphasis on development of mesoscale numerical models, and continual theoretical investigations of thermally forced flows, orographic waves, and stratified turbulence. This monograph represents an outgrowth of the Park City Workshop. The authors have contributed chapters based on their lecture material. Workshop discussions indicated interest in both the remote sensing and predictability of orographic flows. These chapters were solicited following the workshop in order to provide a more balanced view of current progress and future directions in research on atmospheric processes over complex terrain.

Multi-image CAD employing features derived from ipsilateral mammographic views

NASA Astrophysics Data System (ADS)

Good, Walter F.; Zheng, Bin; Chang, Yuan-Hsiang; Wang, Xiao Hui; Maitz, Glenn S.; Gur, David

1999-05-01

On mammograms, certain kinds of features related to masses (e.g., location, texture, degree of spiculation, and integrated density difference) tend to be relatively invariant, or at last predictable, with respect to breast compression. Thus, ipsilateral pairs of mammograms may contain information not available from analyzing single views separately. To demonstrate the feasibility of incorporating multi-view features into CAD algorithm, `single-image' CAD was applied to each individual image in a set of 60 ipsilateral studies, after which all possible pairs of suspicious regions, consisting of one from each view, were formed. For these 402 pairs we defined and evaluated `multi-view' features such as: (1) relative position of centers of regions; (2) ratio of lengths of region projections parallel to nipple axis lines; (3) ratio of integrated contrast difference; (4) ratio of the sizes of the suspicious regions; and (5) measure of relative complexity of region boundaries. Each pair was identified as either a `true positive/true positive' (T) pair (i.e., two regions which are projections of the same actual mass), or as a falsely associated pair (F). Distributions for each feature were calculated. A Bayesian network was trained and tested to classify pairs of suspicious regions based exclusively on the multi-view features described above. Distributions for all features were significantly difference for T versus F pairs as indicated by likelihood ratios. Performance of the Bayesian network, which was measured by ROC analysis, indicates a significant ability to distinguish between T pairs and F pairs (Az equals 0.82 +/- 0.03), using information that is attributed to the multi-view content. This study is the first demonstration that there is a significant amount of spatial information that can be derived from ipsilateral pairs of mammograms.

Do governance choices matter in health care networks?: an exploratory configuration study of health care networks

PubMed Central

2013-01-01

Background Health care networks are widely used and accepted as an organizational form that enables integrated care as well as dealing with complex matters in health care. However, research on the governance of health care networks lags behind. The research aim of our study is to explore the type and importance of governance structure and governance mechanisms for network effectiveness. Methods The study has a multiple case study design and covers 22 health care networks. Using a configuration view, combinations of network governance and other network characteristics were studied on the level of the network. Based on interview and questionnaire data, network characteristics were identified and patterns in the data looked for. Results Neither a dominant (or optimal) governance structure or mechanism nor a perfect fit among governance and other characteristics were revealed, but a number of characteristics that need further study might be related to effective networks such as the role of governmental agencies, legitimacy, and relational, hierarchical, and contractual governance mechanisms as complementary factors. Conclusions Although the results emphasize the situational character of network governance and effectiveness, they give practitioners in the health care sector indications of which factors might be more or less crucial for network effectiveness. PMID:23800334

Propagation, cascades, and agreement dynamics in complex communication and social networks

NASA Astrophysics Data System (ADS)

Lu, Qiming

Many modern and important technological, social, information and infrastructure systems can be viewed as complex systems with a large number of interacting components. Models of complex networks and dynamical interactions, as well as their applications are of fundamental interests in many aspects. Here, several stylized models of multiplex propagation and opinion dynamics are investigated on complex and empirical social networks. We first investigate cascade dynamics in threshold-controlled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network's response, while keeping energy consumption at a manageable level. We also investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case. When applying the model of Naming Game on empirical social networks, this stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus.

Spatio-temporal networks: reachability, centrality and robustness.

PubMed

Williams, Matthew J; Musolesi, Mirco

2016-06-01

Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded. Through numerical experiments on three real-world urban transport systems, we study the effect of node failure on a network's topological, temporal and spatial structure. We also demonstrate the broader applicability of this framework to three other classes of network. To identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network. This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks.

Periodic Hydraulic Testing for Discerning Fracture Network Connections

NASA Astrophysics Data System (ADS)

Becker, M.; Le Borgne, T.; Bour, O.; Guihéneuf, N.; Cole, M.

2015-12-01

Discrete fracture network (DFN) models often predict highly variable hydraulic connections between injection and pumping wells used for enhanced oil recovery, geothermal energy extraction, and groundwater remediation. Such connections can be difficult to verify in fractured rock systems because standard pumping or pulse interference tests interrogate too large a volume to pinpoint specific connections. Three field examples are presented in which periodic hydraulic tests were used to obtain information about hydraulic connectivity in fractured bedrock. The first site, a sandstone in New York State, involves only a single fracture at a scale of about 10 m. The second site, a granite in Brittany, France, involves a fracture network at about the same scale. The third site, a granite/schist in the U.S. State of New Hampshire, involves a complex network at scale of 30-60 m. In each case periodic testing provided an enhanced view of hydraulic connectivity over previous constant rate tests. Periodic testing is particularly adept at measuring hydraulic diffusivity, which is a more effective parameter than permeability for identify the complexity of flow pathways between measurement locations. Periodic tests were also conducted at multiple frequencies which provides a range in the radius of hydraulic penetration away from the oscillating well. By varying the radius of penetration, we attempt to interrogate the structure of the fracture network. Periodic tests, therefore, may be uniquely suited for verifying and/or calibrating DFN models.

A complex systems approach to constructing better models for managing financial markets and the economy

NASA Astrophysics Data System (ADS)

Farmer, J. Doyne; Gallegati, M.; Hommes, C.; Kirman, A.; Ormerod, P.; Cincotti, S.; Sanchez, A.; Helbing, D.

2012-11-01

We outline a vision for an ambitious program to understand the economy and financial markets as a complex evolving system of coupled networks of interacting agents. This is a completely different vision from that currently used in most economic models. This view implies new challenges and opportunities for policy and managing economic crises. The dynamics of such models inherently involve sudden and sometimes dramatic changes of state. Further, the tools and approaches we use emphasize the analysis of crises rather than of calm periods. In this they respond directly to the calls of Governors Bernanke and Trichet for new approaches to macroeconomic modelling.

Cloud Classification in Polar and Desert Regions and Smoke Classification from Biomass Burning Using a Hierarchical Neural Network

NASA Technical Reports Server (NTRS)

Alexander, June; Corwin, Edward; Lloyd, David; Logar, Antonette; Welch, Ronald

1996-01-01

This research focuses on a new neural network scene classification technique. The task is to identify scene elements in Advanced Very High Resolution Radiometry (AVHRR) data from three scene types: polar, desert and smoke from biomass burning in South America (smoke). The ultimate goal of this research is to design and implement a computer system which will identify the clouds present on a whole-Earth satellite view as a means of tracking global climate changes. Previous research has reported results for rule-based systems (Tovinkere et at 1992, 1993) for standard back propagation (Watters et at. 1993) and for a hierarchical approach (Corwin et al 1994) for polar data. This research uses a hierarchical neural network with don't care conditions and applies this technique to complex scenes. A hierarchical neural network consists of a switching network and a collection of leaf networks. The idea of the hierarchical neural network is that it is a simpler task to classify a certain pattern from a subset of patterns than it is to classify a pattern from the entire set. Therefore, the first task is to cluster the classes into groups. The switching, or decision network, performs an initial classification by selecting a leaf network. The leaf networks contain a reduced set of similar classes, and it is in the various leaf networks that the actual classification takes place. The grouping of classes in the various leaf networks is determined by applying an iterative clustering algorithm. Several clustering algorithms were investigated, but due to the size of the data sets, the exhaustive search algorithms were eliminated. A heuristic approach using a confusion matrix from a lightly trained neural network provided the basis for the clustering algorithm. Once the clusters have been identified, the hierarchical network can be trained. The approach of using don't care nodes results from the difficulty in generating extremely complex surfaces in order to separate one class from all of the others. This approach finds pairwise separating surfaces and forms the more complex separating surface from combinations of simpler surfaces. This technique both reduces training time and improves accuracy over the previously reported results. Accuracies of 97.47%, 95.70%, and 99.05% were achieved for the polar, desert and smoke data sets.

Targeted interactomics reveals a complex core cell cycle machinery in Arabidopsis thaliana

PubMed Central

Van Leene, Jelle; Hollunder, Jens; Eeckhout, Dominique; Persiau, Geert; Van De Slijke, Eveline; Stals, Hilde; Van Isterdael, Gert; Verkest, Aurine; Neirynck, Sandy; Buffel, Yelle; De Bodt, Stefanie; Maere, Steven; Laukens, Kris; Pharazyn, Anne; Ferreira, Paulo C G; Eloy, Nubia; Renne, Charlotte; Meyer, Christian; Faure, Jean-Denis; Steinbrenner, Jens; Beynon, Jim; Larkin, John C; Van de Peer, Yves; Hilson, Pierre; Kuiper, Martin; De Veylder, Lieven; Van Onckelen, Harry; Inzé, Dirk; Witters, Erwin; De Jaeger, Geert

2010-01-01

Cell proliferation is the main driving force for plant growth. Although genome sequence analysis revealed a high number of cell cycle genes in plants, little is known about the molecular complexes steering cell division. In a targeted proteomics approach, we mapped the core complex machinery at the heart of the Arabidopsis thaliana cell cycle control. Besides a central regulatory network of core complexes, we distinguished a peripheral network that links the core machinery to up- and downstream pathways. Over 100 new candidate cell cycle proteins were predicted and an in-depth biological interpretation demonstrated the hypothesis-generating power of the interaction data. The data set provided a comprehensive view on heterodimeric cyclin-dependent kinase (CDK)–cyclin complexes in plants. For the first time, inhibitory proteins of plant-specific B-type CDKs were discovered and the anaphase-promoting complex was characterized and extended. Important conclusions were that mitotic A- and B-type cyclins form complexes with the plant-specific B-type CDKs and not with CDKA;1, and that D-type cyclins and S-phase-specific A-type cyclins seem to be associated exclusively with CDKA;1. Furthermore, we could show that plants have evolved a combinatorial toolkit consisting of at least 92 different CDK–cyclin complex variants, which strongly underscores the functional diversification among the large family of cyclins and reflects the pivotal role of cell cycle regulation in the developmental plasticity of plants. PMID:20706207

Observability of Boolean multiplex control networks

NASA Astrophysics Data System (ADS)

Wu, Yuhu; Xu, Jingxue; Sun, Xi-Ming; Wang, Wei

2017-04-01

Boolean multiplex (multilevel) networks (BMNs) are currently receiving considerable attention as theoretical arguments for modeling of biological systems and system level analysis. Studying control-related problems in BMNs may not only provide new views into the intrinsic control in complex biological systems, but also enable us to develop a method for manipulating biological systems using exogenous inputs. In this article, the observability of the Boolean multiplex control networks (BMCNs) are studied. First, the dynamical model and structure of BMCNs with control inputs and outputs are constructed. By using of Semi-Tensor Product (STP) approach, the logical dynamics of BMCNs is converted into an equivalent algebraic representation. Then, the observability of the BMCNs with two different kinds of control inputs is investigated by giving necessary and sufficient conditions. Finally, examples are given to illustrate the efficiency of the obtained theoretical results.

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.

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

Aberrant Global and Regional Topological Organization of the Fractional Anisotropy-weighted Brain Structural Networks in Major Depressive Disorder

PubMed Central

Chen, Jian-Huai; Yao, Zhi-Jian; Qin, Jiao-Long; Yan, Rui; Hua, Ling-Ling; Lu, Qing

2016-01-01

Background: Most previous neuroimaging studies have focused on the structural and functional abnormalities of local brain regions in major depressive disorder (MDD). Moreover, the exactly topological organization of networks underlying MDD remains unclear. This study examined the aberrant global and regional topological patterns of the brain white matter networks in MDD patients. Methods: The diffusion tensor imaging data were obtained from 27 patients with MDD and 40 healthy controls. The brain fractional anisotropy-weighted structural networks were constructed, and the global network and regional nodal metrics of the networks were explored by the complex network theory. Results: Compared with the healthy controls, the brain structural network of MDD patients showed an intact small-world topology, but significantly abnormal global network topological organization and regional nodal characteristic of the network in MDD were found. Our findings also indicated that the brain structural networks in MDD patients become a less strongly integrated network with a reduced central role of some key brain regions. Conclusions: All these resulted in a less optimal topological organization of networks underlying MDD patients, including an impaired capability of local information processing, reduced centrality of some brain regions and limited capacity to integrate information across different regions. Thus, these global network and regional node-level aberrations might contribute to understanding the pathogenesis of MDD from the view of the brain network. PMID:26960371

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.

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

Spontaneous Action Representation in Smokers when Watching Movie Characters Smoke

PubMed Central

Wagner, Dylan D.; Cin, Sonya Dal; Sargent, James D.; Kelley, William M.; Heatherton, Todd F.

2013-01-01

Do smokers simulate smoking when they see someone else smoke? For regular smokers, smoking is such a highly practiced motor skill that it often occurs automatically, without conscious awareness. Research on the brain basis of action observation has delineated a frontopareital network that is commonly recruited when people observe, plan or imitate actions. Here, we investigated whether this action observation network would be preferentially recruited in smokers when viewing complex smoking cues, such as those occurring in motion pictures. Seventeen right-handed smokers and seventeen non-smokers watched a popular movie while undergoing functional magnetic resonance imaging. Using a natural stimulus, such as a movie, allowd us to keep both smoking and non-smoking participants naïve to the goals of the experiment. Brain activity evoked by scenes of movie smoking was contrasted with non-smoking control scenes which were matched for frequency and duration. Compared to non-smokers, smokers showed greater activity in left anterior intraparietal sulcus and inferior frontal gyrus, both regions involved in the simulation of contralateral hand-based gestures, when viewing smoking vs. control scenes. These results demonstrate that smokers spontaneously represent the action of smoking when viewing others smoke, the consequence of which may make it more difficult to abstain from smoking. PMID:21248113

Digital map and situation surface: a team-oriented multidisplay workspace for network enabled situation analysis

NASA Astrophysics Data System (ADS)

Peinsipp-Byma, E.; Geisler, Jürgen; Bader, Thomas

2009-05-01

System concepts for network enabled image-based ISR (intelligence, surveillance, reconnaissance) is the major mission of Fraunhofer IITB's applied research in the area of defence and security solutions. For the TechDemo08 as part of the NATO CNAD POW Defence against terrorism Fraunhofer IITB advanced a new multi display concept to handle the shear amount and high complexity of ISR data acquired by networked, distributed surveillance systems with the objective to support the generation of a common situation picture. Amount and Complexity of ISR data demands an innovative man-machine interface concept for humans to deal with it. The IITB's concept is the Digital Map & Situation Surface. This concept offers to the user a coherent multi display environment combining a horizontal surface for the situation overview from the bird's eye view, an attached vertical display for collateral information and so-called foveatablets as personalized magic lenses in order to obtain high resolved and role-specific information about a focused areaof- interest and to interact with it. In the context of TechDemo08 the Digital Map & Situation Surface served as workspace for team-based situation visualization and analysis. Multiple sea- and landside surveillance components were connected to the system.

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

Attacking a Nexus of the Oncogenic Circuitry by Reversing Aberrant eIF4F-Mediated Translation

PubMed Central

Bitterman, Peter B.; Polunovsky, Vitaly A.

2012-01-01

Notwithstanding their genetic complexity, different cancers share a core group of perturbed pathways converging upon a few regulatory nodes that link the intracellular signaling network with the basic metabolic machinery. The clear implication of this view for cancer therapy is that instead of targeting individual genetic alterations one-by-one, the next generation of cancer therapeutics will target critical hubs in the cancer network. One such hub is the translation initiation complex eIF4F, which integrates several cancer-related pathways into a self-amplifying signaling system. When hyperactivated by apical oncogenic signals, the eIF4F-driven translational apparatus selectively switches the translational repertoire of a cell towards malignancy. This central integrative role of pathologically activated eIF4F has motivated the development of small molecule inhibitors to correct its function. A genome-wide, systems-level means to objectively evaluate the pharmacological response to therapeutics targeting eIF4F remains an unmet challenge. PMID:22572598

The parametric modified limited penetrable visibility graph for constructing complex networks from time series

NASA Astrophysics Data System (ADS)

Li, Xiuming; Sun, Mei; Gao, Cuixia; Han, Dun; Wang, Minggang

2018-02-01

This paper presents the parametric modified limited penetrable visibility graph (PMLPVG) algorithm for constructing complex networks from time series. We modify the penetrable visibility criterion of limited penetrable visibility graph (LPVG) in order to improve the rationality of the original penetrable visibility and preserve the dynamic characteristics of the time series. The addition of view angle provides a new approach to characterize the dynamic structure of the time series that is invisible in the previous algorithm. The reliability of the PMLPVG algorithm is verified by applying it to three types of artificial data as well as the actual data of natural gas prices in different regions. The empirical results indicate that PMLPVG algorithm can distinguish the different time series from each other. Meanwhile, the analysis results of natural gas prices data using PMLPVG are consistent with the detrended fluctuation analysis (DFA). The results imply that the PMLPVG algorithm may be a reasonable and significant tool for identifying various time series in different fields.

Predicting Human Preferences Using the Block Structure of Complex Social Networks

PubMed Central

Guimerà, Roger; Llorente, Alejandro; Moro, Esteban; Sales-Pardo, Marta

2012-01-01

With ever-increasing available data, predicting individuals' preferences and helping them locate the most relevant information has become a pressing need. Understanding and predicting preferences is also important from a fundamental point of view, as part of what has been called a “new” computational social science. Here, we propose a novel approach based on stochastic block models, which have been developed by sociologists as plausible models of complex networks of social interactions. Our model is in the spirit of predicting individuals' preferences based on the preferences of others but, rather than fitting a particular model, we rely on a Bayesian approach that samples over the ensemble of all possible models. We show that our approach is considerably more accurate than leading recommender algorithms, with major relative improvements between 38% and 99% over industry-level algorithms. Besides, our approach sheds light on decision-making processes by identifying groups of individuals that have consistently similar preferences, and enabling the analysis of the characteristics of those groups. PMID:22984533

Component Neural Systems for the Creation of Emotional Memories during Free Viewing of a Complex, Real-World Event

PubMed Central

Botzung, Anne; LaBar, Kevin S.; Kragel, Philip; Miles, Amanda; Rubin, David C.

2010-01-01

To investigate the neural systems that contribute to the formation of complex, self-relevant emotional memories, dedicated fans of rival college basketball teams watched a competitive game while undergoing functional magnetic resonance imaging (fMRI). During a subsequent recognition memory task, participants were shown video clips depicting plays of the game, stemming either from previously-viewed game segments (targets) or from non-viewed portions of the same game (foils). After an old–new judgment, participants provided emotional valence and intensity ratings of the clips. A data driven approach was first used to decompose the fMRI signal acquired during free viewing of the game into spatially independent components. Correlations were then calculated between the identified components and post-scanning emotion ratings for successfully encoded targets. Two components were correlated with intensity ratings, including temporal lobe regions implicated in memory and emotional functions, such as the hippocampus and amygdala, as well as a midline fronto-cingulo-parietal network implicated in social cognition and self-relevant processing. These data were supported by a general linear model analysis, which revealed additional valence effects in fronto-striatal-insular regions when plays were divided into positive and negative events according to the fan's perspective. Overall, these findings contribute to our understanding of how emotional factors impact distributed neural systems to successfully encode dynamic, personally-relevant event sequences. PMID:20508750

Integrating a local database into the StarView distributed user interface

NASA Technical Reports Server (NTRS)

Silberberg, D. P.

1992-01-01

A distributed user interface to the Space Telescope Data Archive and Distribution Service (DADS) known as StarView is being developed. The DADS architecture consists of the data archive as well as a relational database catalog describing the archive. StarView is a client/server system in which the user interface is the front-end client to the DADS catalog and archive servers. Users query the DADS catalog from the StarView interface. Query commands are transmitted via a network and evaluated by the database. The results are returned via the network and are displayed on StarView forms. Based on the results, users decide which data sets to retrieve from the DADS archive. Archive requests are packaged by StarView and sent to DADS, which returns the requested data sets to the users. The advantages of distributed client/server user interfaces over traditional one-machine systems are well known. Since users run software on machines separate from the database, the overall client response time is much faster. Also, since the server is free to process only database requests, the database response time is much faster. Disadvantages inherent in this architecture are slow overall database access time due to the network delays, lack of a 'get previous row' command, and that refinements of a previously issued query must be submitted to the database server, even though the domain of values have already been returned by the previous query. This architecture also does not allow users to cross correlate DADS catalog data with other catalogs. Clearly, a distributed user interface would be more powerful if it overcame these disadvantages. A local database is being integrated into StarView to overcome these disadvantages. When a query is made through a StarView form, which is often composed of fields from multiple tables, it is translated to an SQL query and issued to the DADS catalog. At the same time, a local database table is created to contain the resulting rows of the query. The returned rows are displayed on the form as well as inserted into the local database table. Identical results are produced by reissuing the query to either the DADS catalog or to the local table. Relational databases do not provide a 'get previous row' function because of the inherent complexity of retrieving previous rows of multiple-table joins. However, since this function is easily implemented on a single table, StarView uses the local table to retrieve the previous row. Also, StarView issues subsequent query refinements to the local table instead of the DADS catalog, eliminating the network transmission overhead. Finally, other catalogs can be imported into the local database for cross correlation with local tables. Overall, it is believe that this is a more powerful architecture for distributed, database user interfaces.

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.

Topology and Control of the Cell-Cycle-Regulated Transcriptional Circuitry

PubMed Central

Haase, Steven B.; Wittenberg, Curt

2014-01-01

Nearly 20% of the budding yeast genome is transcribed periodically during the cell division cycle. The precise temporal execution of this large transcriptional program is controlled by a large interacting network of transcriptional regulators, kinases, and ubiquitin ligases. Historically, this network has been viewed as a collection of four coregulated gene clusters that are associated with each phase of the cell cycle. Although the broad outlines of these gene clusters were described nearly 20 years ago, new technologies have enabled major advances in our understanding of the genes comprising those clusters, their regulation, and the complex regulatory interplay between clusters. More recently, advances are being made in understanding the roles of chromatin in the control of the transcriptional program. We are also beginning to discover important regulatory interactions between the cell-cycle transcriptional program and other cell-cycle regulatory mechanisms such as checkpoints and metabolic networks. Here we review recent advances and contemporary models of the transcriptional network and consider these models in the context of eukaryotic cell-cycle controls. PMID:24395825

Remote consultation and diagnosis in medical imaging using a global PACS backbone network

NASA Astrophysics Data System (ADS)

Martinez, Ralph; Sutaria, Bijal N.; Kim, Jinman; Nam, Jiseung

1993-10-01

A Global PACS is a national network which interconnects several PACS networks at medical and hospital complexes using a national backbone network. A Global PACS environment enables new and beneficial operations between radiologists and physicians, when they are located in different geographical locations. One operation allows the radiologist to view the same image folder at both Local and Remote sites so that a diagnosis can be performed. The paper describes the user interface, database management, and network communication software which has been developed in the Computer Engineering Research Laboratory and Radiology Research Laboratory. Specifically, a design for a file management system in a distributed environment is presented. In the remote consultation and diagnosis operation, a set of images is requested from the database archive system and sent to the Local and Remote workstation sites on the Global PACS network. Viewing the same images, the radiologists use pointing overlay commands, or frames to point out features on the images. Each workstation transfers these frames, to the other workstation, so that an interactive session for diagnosis takes place. In this phase, we use fixed frames and variable size frames, used to outline an object. The data pockets for these frames traverses the national backbone in real-time. We accomplish this feature by using TCP/IP protocol sockets for communications. The remote consultation and diagnosis operation has been tested in real-time between the University Medical Center and the Bowman Gray School of Medicine at Wake Forest University, over the Internet. In this paper, we show the feasibility of the operation in a Global PACS environment. Future improvements to the system will include real-time voice and interactive compressed video scenarios.

Stable isotope views on ecosystem function: challenging or challenged?

PubMed

Resco, Víctor; Querejeta, José I; Ogle, Kiona; Voltas, Jordi; Sebastià, Maria-Teresa; Serrano-Ortiz, Penélope; Linares, Juan C; Moreno-Gutiérrez, Cristina; Herrero, Asier; Carreira, José A; Torres-Cañabate, Patricia; Valladares, Fernando

2010-06-23

Stable isotopes and their potential for detecting various and complex ecosystem processes are attracting an increasing number of scientists. Progress is challenging, particularly under global change scenarios, but some established views have been challenged. The IX meeting of the Spanish Association of Terrestrial Ecology (AAET, Ubeda, 18-22 October 2009) hosted a symposium on the ecology of stable isotopes where the linear mixing model approach of partitioning sinks and sources of carbon and water fluxes within an ecosystem was challenged, and new applications of stable isotopes for the study of plant interactions were evaluated. Discussion was also centred on the need for networks that monitor ecological processes using stable isotopes and key ideas for fostering future research with isotopes.

Stable isotope views on ecosystem function: challenging or challenged?

PubMed Central

Resco, Víctor; Querejeta, José I.; Ogle, Kiona; Voltas, Jordi; Sebastià, Maria-Teresa; Serrano-Ortiz, Penélope; Linares, Juan C.; Moreno-Gutiérrez, Cristina; Herrero, Asier; Carreira, José A.; Torres-Cañabate, Patricia; Valladares, Fernando

2010-01-01

Stable isotopes and their potential for detecting various and complex ecosystem processes are attracting an increasing number of scientists. Progress is challenging, particularly under global change scenarios, but some established views have been challenged. The IX meeting of the Spanish Association of Terrestrial Ecology (AAET, Úbeda, 18–22 October 2009) hosted a symposium on the ecology of stable isotopes where the linear mixing model approach of partitioning sinks and sources of carbon and water fluxes within an ecosystem was challenged, and new applications of stable isotopes for the study of plant interactions were evaluated. Discussion was also centred on the need for networks that monitor ecological processes using stable isotopes and key ideas for fostering future research with isotopes. PMID:20015858

Gene Coexpression Network Alignment and Conservation of Gene Modules between Two Grass Species: Maize and Rice[C][W][OA

PubMed Central

Ficklin, Stephen P.; Feltus, F. Alex

2011-01-01

One major objective for plant biology is the discovery of molecular subsystems underlying complex traits. The use of genetic and genomic resources combined in a systems genetics approach offers a means for approaching this goal. This study describes a maize (Zea mays) gene coexpression network built from publicly available expression arrays. The maize network consisted of 2,071 loci that were divided into 34 distinct modules that contained 1,928 enriched functional annotation terms and 35 cofunctional gene clusters. Of note, 391 maize genes of unknown function were found to be coexpressed within modules along with genes of known function. A global network alignment was made between this maize network and a previously described rice (Oryza sativa) coexpression network. The IsoRankN tool was used, which incorporates both gene homology and network topology for the alignment. A total of 1,173 aligned loci were detected between the two grass networks, which condensed into 154 conserved subgraphs that preserved 4,758 coexpression edges in rice and 6,105 coexpression edges in maize. This study provides an early view into maize coexpression space and provides an initial network-based framework for the translation of functional genomic and genetic information between these two vital agricultural species. PMID:21606319

Gene coexpression network alignment and conservation of gene modules between two grass species: maize and rice.

PubMed

Ficklin, Stephen P; Feltus, F Alex

2011-07-01

One major objective for plant biology is the discovery of molecular subsystems underlying complex traits. The use of genetic and genomic resources combined in a systems genetics approach offers a means for approaching this goal. This study describes a maize (Zea mays) gene coexpression network built from publicly available expression arrays. The maize network consisted of 2,071 loci that were divided into 34 distinct modules that contained 1,928 enriched functional annotation terms and 35 cofunctional gene clusters. Of note, 391 maize genes of unknown function were found to be coexpressed within modules along with genes of known function. A global network alignment was made between this maize network and a previously described rice (Oryza sativa) coexpression network. The IsoRankN tool was used, which incorporates both gene homology and network topology for the alignment. A total of 1,173 aligned loci were detected between the two grass networks, which condensed into 154 conserved subgraphs that preserved 4,758 coexpression edges in rice and 6,105 coexpression edges in maize. This study provides an early view into maize coexpression space and provides an initial network-based framework for the translation of functional genomic and genetic information between these two vital agricultural species.

Object-oriented Approach to High-level Network Monitoring and Management

NASA Technical Reports Server (NTRS)

Mukkamala, Ravi

2000-01-01

An absolute prerequisite for the management of large investigating methods to build high-level monitoring computer networks is the ability to measure their systems that are built on top of existing monitoring performance. Unless we monitor a system, we cannot tools. Due to the heterogeneous nature of the hope to manage and control its performance. In this underlying systems at NASA Langley Research Center, paper, we describe a network monitoring system that we use an object-oriented approach for the design, we are currently designing and implementing. Keeping, first, we use UML (Unified Modeling Language) to in mind the complexity of the task and the required model users' requirements. Second, we identify the flexibility for future changes, we use an object-oriented existing capabilities of the underlying monitoring design methodology. The system is built using the system. Third, we try to map the former with the latter. APIs offered by the HP OpenView system.

Development and evaluation of packet video schemes

NASA Technical Reports Server (NTRS)

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

1990-01-01

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

Membership nominations in international scientific assessments

NASA Astrophysics Data System (ADS)

Leifeld, Philip; Fisher, Dana R.

2017-10-01

International scientific assessments are transnational knowledge-based expert networks with a mandate to advise policymakers. A well-known example is the Millennium Ecosystem Assessment (MA), which synthesized research on ecosystem services between 2001 and 2005, utilizing the knowledge of 1,360 expert members. Little, however, is known about the membership composition and the driving forces behind membership nominations in the MA and similar organizations. Here we introduce a survey data set on recruitment in the MA and analyse nomination patterns among experts as a complex network. The results indicate that membership recruitment was governed by prior contacts in other transnational elite organizations and a range of other factors related to personal affinity. Network analysis demonstrates how some core individuals were particularly influential in shaping the overall membership composition of the group. These findings add to recently noted concerns about the lack of diversity of views represented in international scientific assessments.

Coordination of cell death and the cell cycle: linking proliferation to death through private and communal couplers.

PubMed

Abrams, John M; White, Michael A

2004-12-01

In development and in the adult, complex signaling pathways operate within and between cells to coordinate proliferation and cell death. These networks can be viewed as coupling devices that link engines driving the cell cycle and the initiation of apoptosis. We propose three simple frameworks for modeling the effects of proliferative drive on apoptotic propensity. This perspective offers a potentially useful foundation for predicting group behaviors of cells in normal and pathological settings.

A negotiation methodology and its application to cogeneration planning

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

Wang, S.M.; Liu, C.C.; Luu, S.

Power system planning has become a complex process in utilities today. This paper presents a methodology for integrated planning with multiple objectives. The methodology uses a graphical representation (Goal-Decision Network) to capture the planning knowledge. The planning process is viewed as a negotiation process that applies three negotiation operators to search for beneficial decisions in a GDN. Also, the negotiation framework is applied to the problem of planning for cogeneration interconnection. The simulation results are presented to illustrate the cogeneration planning process.

Traffic engineering and regenerator placement in GMPLS networks with restoration

NASA Astrophysics Data System (ADS)

Yetginer, Emre; Karasan, Ezhan

2002-07-01

In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.

Design of fuzzy systems using neurofuzzy networks.

PubMed

Figueiredo, M; Gomide, F

1999-01-01

This paper introduces a systematic approach for fuzzy system design based on a class of neural fuzzy networks built upon a general neuron model. The network structure is such that it encodes the knowledge learned in the form of if-then fuzzy rules and processes data following fuzzy reasoning principles. The technique provides a mechanism to obtain rules covering the whole input/output space as well as the membership functions (including their shapes) for each input variable. Such characteristics are of utmost importance in fuzzy systems design and application. In addition, after learning, it is very simple to extract fuzzy rules in the linguistic form. The network has universal approximation capability, a property very useful in, e.g., modeling and control applications. Here we focus on function approximation problems as a vehicle to illustrate its usefulness and to evaluate its performance. Comparisons with alternative approaches are also included. Both, nonnoisy and noisy data have been studied and considered in the computational experiments. The neural fuzzy network developed here and, consequently, the underlying approach, has shown to provide good results from the accuracy, complexity, and system design points of view.

Structure and evolution of a European Parliament via a network and correlation analysis

NASA Astrophysics Data System (ADS)

Puccio, Elena; Pajala, Antti; Piilo, Jyrki; Tumminello, Michele

2016-11-01

We present a study of the network of relationships among elected members of the Finnish parliament, based on a quantitative analysis of initiative co-signatures, and its evolution over 16 years. To understand the structure of the parliament, we constructed a statistically validated network of members, based on the similarity between the patterns of initiatives they signed. We looked for communities within the network and characterized them in terms of members' attributes, such as electoral district and party. To gain insight on the nested structure of communities, we constructed a hierarchical tree of members from the correlation matrix. Afterwards, we studied parliament dynamics yearly, with a focus on correlations within and between parties, by also distinguishing between government and opposition. Finally, we investigated the role played by specific individuals, at a local level. In particular, whether they act as proponents who gather consensus, or as signers. Our results provide a quantitative background to current theories in political science. From a methodological point of view, our network approach has proven able to highlight both local and global features of a complex social system.

Neural-Network Object-Recognition Program

NASA Technical Reports Server (NTRS)

Spirkovska, L.; Reid, M. B.

1993-01-01

HONTIOR computer program implements third-order neural network exhibiting invariance under translation, change of scale, and in-plane rotation. Invariance incorporated directly into architecture of network. Only one view of each object needed to train network for two-dimensional-translation-invariant recognition of object. Also used for three-dimensional-transformation-invariant recognition by training network on only set of out-of-plane rotated views. Written in C language.

Temporal Information Partitioning Networks (TIPNets): A process network approach to infer ecohydrologic shifts

NASA Astrophysics Data System (ADS)

Goodwell, Allison E.; Kumar, Praveen

2017-07-01

In an ecohydrologic system, components of atmospheric, vegetation, and root-soil subsystems participate in forcing and feedback interactions at varying time scales and intensities. The structure of this network of complex interactions varies in terms of connectivity, strength, and time scale due to perturbations or changing conditions such as rainfall, drought, or land use. However, characterization of these interactions is difficult due to multivariate and weak dependencies in the presence of noise, nonlinearities, and limited data. We introduce a framework for Temporal Information Partitioning Networks (TIPNets), in which time-series variables are viewed as nodes, and lagged multivariate mutual information measures are links. These links are partitioned into synergistic, unique, and redundant information components, where synergy is information provided only jointly, unique information is only provided by a single source, and redundancy is overlapping information. We construct TIPNets from 1 min weather station data over several hour time windows. From a comparison of dry, wet, and rainy conditions, we find that information strengths increase when solar radiation and surface moisture are present, and surface moisture and wind variability are redundant and synergistic influences, respectively. Over a growing season, network trends reveal patterns that vary with vegetation and rainfall patterns. The framework presented here enables us to interpret process connectivity in a multivariate context, which can lead to better inference of behavioral shifts due to perturbations in ecohydrologic systems. This work contributes to more holistic characterizations of system behavior, and can benefit a wide variety of studies of complex systems.

The Modular Organization of Protein Interactions in Escherichia coli

PubMed Central

Peregrín-Alvarez, José M.; Xiong, Xuejian; Su, Chong; Parkinson, John

2009-01-01

Escherichia coli serves as an excellent model for the study of fundamental cellular processes such as metabolism, signalling and gene expression. Understanding the function and organization of proteins within these processes is an important step towards a ‘systems’ view of E. coli. Integrating experimental and computational interaction data, we present a reliable network of 3,989 functional interactions between 1,941 E. coli proteins (∼45% of its proteome). These were combined with a recently generated set of 3,888 high-quality physical interactions between 918 proteins and clustered to reveal 316 discrete modules. In addition to known protein complexes (e.g., RNA and DNA polymerases), we identified modules that represent biochemical pathways (e.g., nitrate regulation and cell wall biosynthesis) as well as batteries of functionally and evolutionarily related processes. To aid the interpretation of modular relationships, several case examples are presented, including both well characterized and novel biochemical systems. Together these data provide a global view of the modular organization of the E. coli proteome and yield unique insights into structural and evolutionary relationships in bacterial networks. PMID:19798435

Thoughts on the development of active regional public health systems.

PubMed

Reis, Ademar Arthur Chioro Dos; Sóter, Ana Paula Menezes; Furtado, Lumena Almeida Castro; Pereira, Silvana Souza da Silva

2017-04-01

Decentralization and regionalization are strategic themes for reforms in the health system. This paper analyzes the complex process of health regionalization being developed in Brazil. This paper identifies that the normative framework from the Brazilian National Health System, SUS has made advances with respect to its institutionalization and overcoming the initial centrality involved in municipalization. This has strengthened the development of regionalization and the intergovernmental agreement on health but the evidence points to the need to promote a revision. Based on document analysis, literature review and the views given by the authors involved in management in SUS as well as generating radically different views, the challenges for the construction of a regionalization that is active, is debated. We also discuss: its relations with planning and the dimensioning of service networks, the production of active care networks and shared management spaces, the inter-federative agreements and regional regulations, the capacity to coordinate regional systems and financing and the impact of the political dimension and electoral cycles. Regionalization (and SUS itself) is an open book, therefore ways and possibilities on how to maintain an active form of regionalization can be recommended.

Performance Analysis of Automated Attack Graph Generation Software

DTIC Science & Technology

2006-12-01

MIT Lincoln Laboratory – NetSPA .................................................13 3. Skybox - Skybox View...Lip05*) 3. Skybox - Skybox View Skybox View is a commercially available tool developed by Skybox Security that can automatically generate...each host. It differs from CAULDRON because it requires that Skybox View probe live networks and must be connected to live networks during its

Electron tomography reveals the fibril structure and lipid interactions in amyloid deposits

PubMed Central

Kollmer, Marius; Meinhardt, Katrin; Haupt, Christian; Liberta, Falk; Wulff, Melanie; Linder, Julia; Handl, Lisa; Heinrich, Liesa; Loos, Cornelia; Schmidt, Matthias; Syrovets, Tatiana; Simmet, Thomas; Westermark, Per; Westermark, Gunilla T.; Horn, Uwe; Schmidt, Volker; Walther, Paul; Fändrich, Marcus

2016-01-01

Electron tomography is an increasingly powerful method to study the detailed architecture of macromolecular complexes or cellular structures. Applied to amyloid deposits formed in a cell culture model of systemic amyloid A amyloidosis, we could determine the structural morphology of the fibrils directly in the deposit. The deposited fibrils are arranged in different networks, and depending on the relative fibril orientation, we can distinguish between fibril meshworks, fibril bundles, and amyloid stars. These networks are frequently infiltrated by vesicular lipid inclusions that may originate from the death of the amyloid-forming cells. Our data support the role of nonfibril components for constructing fibril deposits and provide structural views of different types of lipid–fibril interactions. PMID:27140609

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.

Task modulates functional connectivity networks in free viewing behavior.

PubMed

Seidkhani, Hossein; Nikolaev, Andrey R; Meghanathan, Radha Nila; Pezeshk, Hamid; Masoudi-Nejad, Ali; van Leeuwen, Cees

2017-10-01

In free visual exploration, eye-movement is immediately followed by dynamic reconfiguration of brain functional connectivity. We studied the task-dependency of this process in a combined visual search-change detection experiment. Participants viewed two (nearly) same displays in succession. First time they had to find and remember multiple targets among distractors, so the ongoing task involved memory encoding. Second time they had to determine if a target had changed in orientation, so the ongoing task involved memory retrieval. From multichannel EEG recorded during 200 ms intervals time-locked to fixation onsets, we estimated the functional connectivity using a weighted phase lag index at the frequencies of theta, alpha, and beta bands, and derived global and local measures of the functional connectivity graphs. We found differences between both memory task conditions for several network measures, such as mean path length, radius, diameter, closeness and eccentricity, mainly in the alpha band. Both the local and the global measures indicated that encoding involved a more segregated mode of operation than retrieval. These differences arose immediately after fixation onset and persisted for the entire duration of the lambda complex, an evoked potential commonly associated with early visual perception. We concluded that encoding and retrieval differentially shape network configurations involved in early visual perception, affecting the way the visual input is processed at each fixation. These findings demonstrate that task requirements dynamically control the functional connectivity networks involved in early visual perception. Copyright © 2017 Elsevier Inc. All rights reserved.

Domain-averaged snow depth over complex terrain from flat field measurements

NASA Astrophysics Data System (ADS)

Helbig, Nora; van Herwijnen, Alec

2017-04-01

Snow depth is an important parameter for a variety of coarse-scale models and applications, such as hydrological forecasting. Since high-resolution snow cover models are computational expensive, simplified snow models are often used. Ground measured snow depth at single stations provide a chance for snow depth data assimilation to improve coarse-scale model forecasts. Snow depth is however commonly recorded at so-called flat fields, often in large measurement networks. While these ground measurement networks provide a wealth of information, various studies questioned the representativity of such flat field snow depth measurements for the surrounding topography. We developed two parameterizations to compute domain-averaged snow depth for coarse model grid cells over complex topography using easy to derive topographic parameters. To derive the two parameterizations we performed a scale dependent analysis for domain sizes ranging from 50m to 3km using highly-resolved snow depth maps at the peak of winter from two distinct climatic regions in Switzerland and in the Spanish Pyrenees. The first, simpler parameterization uses a commonly applied linear lapse rate. For the second parameterization, we first removed the obvious elevation gradient in mean snow depth, which revealed an additional correlation with the subgrid sky view factor. We evaluated domain-averaged snow depth derived with both parameterizations using flat field measurements nearby with the domain-averaged highly-resolved snow depth. This revealed an overall improved performance for the parameterization combining a power law elevation trend scaled with the subgrid parameterized sky view factor. We therefore suggest the parameterization could be used to assimilate flat field snow depth into coarse-scale snow model frameworks in order to improve coarse-scale snow depth estimates over complex topography.

Efficient large-scale graph data optimization for intelligent video surveillance

NASA Astrophysics Data System (ADS)

Shang, Quanhong; Zhang, Shujun; Wang, Yanbo; Sun, Chen; Wang, Zepeng; Zhang, Luming

2017-08-01

Society is rapidly accepting the use of a wide variety of cameras Location and applications: site traffic monitoring, parking Lot surveillance, car and smart space. These ones here the camera provides data every day in an analysis Effective way. Recent advances in sensor technology Manufacturing, communications and computing are stimulating.The development of new applications that can change the traditional Vision system incorporating universal smart camera network. This Analysis of visual cues in multi camera networks makes wide Applications ranging from smart home and office automation to large area surveillance and traffic surveillance. In addition, dense Camera networks, most of which have large overlapping areas of cameras. In the view of good research, we focus on sparse camera networks. One Sparse camera network using large area surveillance. As few cameras as possible, most cameras do not overlap Each other’s field of vision. This task is challenging Lack of knowledge of topology Network, the specific changes in appearance and movement Track different opinions of the target, as well as difficulties Understanding complex events in a network. In this review in this paper, we present a comprehensive survey of recent studies Results to solve the problem of topology learning, Object appearance modeling and global activity understanding sparse camera network. In addition, some of the current open Research issues are discussed.

Navigating future uncertainty in marine protected area governance: Lessons from the Scottish MPA network

NASA Astrophysics Data System (ADS)

Hopkins, Charlotte Rachael; Bailey, David Mark; Potts, Tavis

2018-07-01

As international pressure for marine protection has increased, Scotland has increased spatial protection through the development of a Marine Protected Area (MPA) network. Few MPA networks to date have included specific considerations of climate change in the design, monitoring or management of the network. The Scottish MPA network followed a feature-led approach to identify a series of MPAs across the Scottish marine area and incorporated the diverse views of many different stakeholders. This feature led approach has led to wide ranging opinions and understandings regarding the success of the MPA network. Translating ideas of success into a policy approach whilst also considering how climate change may affect these ideas of success is a complex challenge. This paper presents the results of a Delphi process that aimed to facilitate clear communication between academics, policy makers and stakeholders in order to identify specific climate change considerations applicable to the Scottish MPA network. This study engaged a group of academic and non-academic stakeholders to discuss potential options that could be translated into an operational process for management of the MPA network. The results of Delphi process discussion are presented with the output of a management matrix tool, which could aid in future decisions for MPA management under scenarios of climate change.

Membership generation using multilayer neural network

NASA Technical Reports Server (NTRS)

Kim, Jaeseok

1992-01-01

There has been intensive research in neural network applications to pattern recognition problems. Particularly, the back-propagation network has attracted many researchers because of its outstanding performance in pattern recognition applications. In this section, we describe a new method to generate membership functions from training data using a multilayer neural network. The basic idea behind the approach is as follows. The output values of a sigmoid activation function of a neuron bear remarkable resemblance to membership values. Therefore, we can regard the sigmoid activation values as the membership values in fuzzy set theory. Thus, in order to generate class membership values, we first train a suitable multilayer network using a training algorithm such as the back-propagation algorithm. After the training procedure converges, the resulting network can be treated as a membership generation network, where the inputs are feature values and the outputs are membership values in the different classes. This method allows fairly complex membership functions to be generated because the network is highly nonlinear in general. Also, it is to be noted that the membership functions are generated from a classification point of view. For pattern recognition applications, this is highly desirable, although the membership values may not be indicative of the degree of typicality of a feature value in a particular class.

Musical Imagery Involves Wernicke's Area in Bilateral and Anti-Correlated Network Interactions in Musicians.

PubMed

Zhang, Yizhen; Chen, Gang; Wen, Haiguang; Lu, Kun-Han; Liu, Zhongming

2017-12-06

Musical imagery is the human experience of imagining music without actually hearing it. The neural basis of this mental ability is unclear, especially for musicians capable of engaging in accurate and vivid musical imagery. Here, we created a visualization of an 8-minute symphony as a silent movie and used it as real-time cue for musicians to continuously imagine the music for repeated and synchronized sessions during functional magnetic resonance imaging (fMRI). The activations and networks evoked by musical imagery were compared with those elicited by the subjects directly listening to the same music. Musical imagery and musical perception resulted in overlapping activations at the anterolateral belt and Wernicke's area, where the responses were correlated with the auditory features of the music. Whereas Wernicke's area interacted within the intrinsic auditory network during musical perception, it was involved in much more complex networks during musical imagery, showing positive correlations with the dorsal attention network and the motor-control network and negative correlations with the default-mode network. Our results highlight the important role of Wernicke's area in forming vivid musical imagery through bilateral and anti-correlated network interactions, challenging the conventional view of segregated and lateralized processing of music versus language.

A complex network description on traditional Chinese medicine system

NASA Astrophysics Data System (ADS)

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

2004-03-01

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

LATENT SPACE MODELS FOR MULTIVIEW NETWORK DATA

PubMed Central

Salter-Townshend, Michael; McCormick, Tyler H.

2018-01-01

Social relationships consist of interactions along multiple dimensions. In social networks, this means that individuals form multiple types of relationships with the same person (e.g., an individual will not trust all of his/her acquaintances). Statistical models for these data require understanding two related types of dependence structure: (i) structure within each relationship type, or network view, and (ii) the association between views. In this paper, we propose a statistical framework that parsimoniously represents dependence between relationship types while also maintaining enough flexibility to allow individuals to serve different roles in different relationship types. Our approach builds on work on latent space models for networks [see, e.g., J. Amer. Statist. Assoc. 97 (2002) 1090–1098]. These models represent the propensity for two individuals to form edges as conditionally independent given the distance between the individuals in an unobserved social space. Our work departs from previous work in this area by representing dependence structure between network views through a multivariate Bernoulli likelihood, providing a representation of between-view association. This approach infers correlations between views not explained by the latent space model. Using our method, we explore 6 multiview network structures across 75 villages in rural southern Karnataka, India [Banerjee et al. (2013)]. PMID:29721127

LATENT SPACE MODELS FOR MULTIVIEW NETWORK DATA.

PubMed

Salter-Townshend, Michael; McCormick, Tyler H

2017-09-01

Social relationships consist of interactions along multiple dimensions. In social networks, this means that individuals form multiple types of relationships with the same person (e.g., an individual will not trust all of his/her acquaintances). Statistical models for these data require understanding two related types of dependence structure: (i) structure within each relationship type, or network view, and (ii) the association between views. In this paper, we propose a statistical framework that parsimoniously represents dependence between relationship types while also maintaining enough flexibility to allow individuals to serve different roles in different relationship types. Our approach builds on work on latent space models for networks [see, e.g., J. Amer. Statist. Assoc. 97 (2002) 1090-1098]. These models represent the propensity for two individuals to form edges as conditionally independent given the distance between the individuals in an unobserved social space. Our work departs from previous work in this area by representing dependence structure between network views through a multivariate Bernoulli likelihood, providing a representation of between-view association. This approach infers correlations between views not explained by the latent space model. Using our method, we explore 6 multiview network structures across 75 villages in rural southern Karnataka, India [Banerjee et al. (2013)].

Functional subdivision of group-ICA results of fMRI data collected during cinema viewing.

PubMed

Pamilo, Siina; Malinen, Sanna; Hlushchuk, Yevhen; Seppä, Mika; Tikka, Pia; Hari, Riitta

2012-01-01

Independent component analysis (ICA) can unravel functional brain networks from functional magnetic resonance imaging (fMRI) data. The number of the estimated components affects both the spatial pattern of the identified networks and their time-course estimates. Here group-ICA was applied at four dimensionalities (10, 20, 40, and 58 components) to fMRI data collected from 15 subjects who viewed a 15-min silent film ("At land" by Maya Deren). We focused on the dorsal attention network, the default-mode network, and the sensorimotor network. The lowest dimensionalities demonstrated most prominent activity within the dorsal attention network, combined with the visual areas, and in the default-mode network; the sensorimotor network only appeared with ICA comprising at least 20 components. The results suggest that even very low-dimensional ICA can unravel the most prominent functionally-connected brain networks. However, increasing the number of components gives a more detailed picture and functionally feasible subdivision of the major networks. These results improve our understanding of the hierarchical subdivision of brain networks during viewing of a movie that provides continuous stimulation embedded in an attention-directing narrative.

TOPOGRAPHIC VIEW THE STATE FORESTER'S COMPLEX, VIEW LOOKING SOUTH FROM ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

TOPOGRAPHIC VIEW THE STATE FORESTER'S COMPLEX, VIEW LOOKING SOUTH FROM STATE STREET, WITH THE NATIONAL REGISTER-LISTED OREGON STATE FORESTER'S OFFICE BUILDING TO THE LEFT OF VIEW. - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

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.

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

PubMed

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

2012-03-21

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

Impact of the topology of global macroeconomic network on the spreading of economic crises.

PubMed

Lee, Kyu-Min; Yang, Jae-Suk; Kim, Gunn; Lee, Jaesung; Goh, Kwang-Il; Kim, In-mook

2011-03-31

Throughout economic history, the global economy has experienced recurring crises. The persistent recurrence of such economic crises calls for an understanding of their generic features rather than treating them as singular events. The global economic system is a highly complex system and can best be viewed in terms of a network of interacting macroeconomic agents. In this regard, from the perspective of collective network dynamics, here we explore how the topology of the global macroeconomic network affects the patterns of spreading of economic crises. Using a simple toy model of crisis spreading, we demonstrate that an individual country's role in crisis spreading is not only dependent on its gross macroeconomic capacities, but also on its local and global connectivity profile in the context of the world economic network. We find that on one hand clustering of weak links at the regional scale can significantly aggravate the spread of crises, but on the other hand the current network structure at the global scale harbors higher tolerance of extreme crises compared to more "globalized" random networks. These results suggest that there can be a potential hidden cost in the ongoing globalization movement towards establishing less-constrained, trans-regional economic links between countries, by increasing vulnerability of the global economic system to extreme crises.

Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources

PubMed Central

Leeson, Mark S.

2014-01-01

The minimization of network coding resources, such as coding nodes and links, is a challenging task, not only because it is a NP-hard problem, but also because the problem scale is huge; for example, networks in real world may have thousands or even millions of nodes and links. Genetic algorithms (GAs) have a good potential of resolving NP-hard problems like the network coding problem (NCP), but as a population-based algorithm, serious scalability and applicability problems are often confronted when GAs are applied to large- or huge-scale systems. Inspired by the temporal receding horizon control in control engineering, this paper proposes a novel spatial receding horizon control (SRHC) strategy as a network partitioning technology, and then designs an efficient GA to tackle the NCP. Traditional network partitioning methods can be viewed as a special case of the proposed SRHC, that is, one-step-wide SRHC, whilst the method in this paper is a generalized N-step-wide SRHC, which can make a better use of global information of network topologies. Besides the SRHC strategy, some useful designs are also reported in this paper. The advantages of the proposed SRHC and GA for the NCP are illustrated by extensive experiments, and they have a good potential of being extended to other large-scale complex problems. PMID:24883371

Impact of the Topology of Global Macroeconomic Network on the Spreading of Economic Crises

PubMed Central

Lee, Kyu-Min; Yang, Jae-Suk; Kim, Gunn; Lee, Jaesung; Goh, Kwang-Il; Kim, In-mook

2011-01-01

Throughout economic history, the global economy has experienced recurring crises. The persistent recurrence of such economic crises calls for an understanding of their generic features rather than treating them as singular events. The global economic system is a highly complex system and can best be viewed in terms of a network of interacting macroeconomic agents. In this regard, from the perspective of collective network dynamics, here we explore how the topology of the global macroeconomic network affects the patterns of spreading of economic crises. Using a simple toy model of crisis spreading, we demonstrate that an individual country's role in crisis spreading is not only dependent on its gross macroeconomic capacities, but also on its local and global connectivity profile in the context of the world economic network. We find that on one hand clustering of weak links at the regional scale can significantly aggravate the spread of crises, but on the other hand the current network structure at the global scale harbors higher tolerance of extreme crises compared to more “globalized” random networks. These results suggest that there can be a potential hidden cost in the ongoing globalization movement towards establishing less-constrained, trans-regional economic links between countries, by increasing vulnerability of the global economic system to extreme crises. PMID:21483794

Integrated situational awareness for cyber attack detection, analysis, and mitigation

NASA Astrophysics Data System (ADS)

Cheng, Yi; Sagduyu, Yalin; Deng, Julia; Li, Jason; Liu, Peng

2012-06-01

Real-time cyberspace situational awareness is critical for securing and protecting today's enterprise networks from various cyber threats. When a security incident occurs, network administrators and security analysts need to know what exactly has happened in the network, why it happened, and what actions or countermeasures should be taken to quickly mitigate the potential impacts. In this paper, we propose an integrated cyberspace situational awareness system for efficient cyber attack detection, analysis and mitigation in large-scale enterprise networks. Essentially, a cyberspace common operational picture will be developed, which is a multi-layer graphical model and can efficiently capture and represent the statuses, relationships, and interdependencies of various entities and elements within and among different levels of a network. Once shared among authorized users, this cyberspace common operational picture can provide an integrated view of the logical, physical, and cyber domains, and a unique visualization of disparate data sets to support decision makers. In addition, advanced analyses, such as Bayesian Network analysis, will be explored to address the information uncertainty, dynamic and complex cyber attack detection, and optimal impact mitigation issues. All the developed technologies will be further integrated into an automatic software toolkit to achieve near real-time cyberspace situational awareness and impact mitigation in large-scale computer networks.

Temporal neural networks and transient analysis of complex engineering systems

NASA Astrophysics Data System (ADS)

Uluyol, Onder

A theory is introduced for a multi-layered Local Output Gamma Feedback (LOGF) neural network within the paradigm of Locally-Recurrent Globally-Feedforward neural networks. It is developed for the identification, prediction, and control tasks of spatio-temporal systems and allows for the presentation of different time scales through incorporation of a gamma memory. It is initially applied to the tasks of sunspot and Mackey-Glass series prediction as benchmarks, then it is extended to the task of power level control of a nuclear reactor at different fuel cycle conditions. The developed LOGF neuron model can also be viewed as a Transformed Input and State (TIS) Gamma memory for neural network architectures for temporal processing. The novel LOGF neuron model extends the static neuron model by incorporating into it a short-term memory structure in the form of a digital gamma filter. A feedforward neural network made up of LOGF neurons can thus be used to model dynamic systems. A learning algorithm based upon the Backpropagation-Through-Time (BTT) approach is derived. It is applicable for training a general L-layer LOGF neural network. The spatial and temporal weights and parameters of the network are iteratively optimized for a given problem using the derived learning algorithm.

The relations between network-operation and topological-property in a scale-free and small-world network with community structure

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2017-10-01

It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

Visualizing Mobility of Public Transportation System.

PubMed

Zeng, Wei; Fu, Chi-Wing; Arisona, Stefan Müller; Erath, Alexander; Qu, Huamin

2014-12-01

Public transportation systems (PTSs) play an important role in modern cities, providing shared/massive transportation services that are essential for the general public. However, due to their increasing complexity, designing effective methods to visualize and explore PTS is highly challenging. Most existing techniques employ network visualization methods and focus on showing the network topology across stops while ignoring various mobility-related factors such as riding time, transfer time, waiting time, and round-the-clock patterns. This work aims to visualize and explore passenger mobility in a PTS with a family of analytical tasks based on inputs from transportation researchers. After exploring different design alternatives, we come up with an integrated solution with three visualization modules: isochrone map view for geographical information, isotime flow map view for effective temporal information comparison and manipulation, and OD-pair journey view for detailed visual analysis of mobility factors along routes between specific origin-destination pairs. The isotime flow map linearizes a flow map into a parallel isoline representation, maximizing the visualization of mobility information along the horizontal time axis while presenting clear and smooth pathways from origin to destinations. Moreover, we devise several interactive visual query methods for users to easily explore the dynamics of PTS mobility over space and time. Lastly, we also construct a PTS mobility model from millions of real passenger trajectories, and evaluate our visualization techniques with assorted case studies with the transportation researchers.

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-off on Phenotype Robustness in Biological Networks Part I: Gene Regulatory Networks in Systems and Evolutionary Biology

PubMed Central

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties observed in biological systems at different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be enough to confer intrinsic robustness in order to tolerate intrinsic parameter fluctuations, genetic robustness for buffering genetic variations, and environmental robustness for resisting environmental disturbances. With this, the phenotypic stability of biological network can be maintained, thus guaranteeing phenotype robustness. This paper presents a survey on biological systems and then develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation in systems and evolutionary biology. Further, from the unifying mathematical framework, it was discovered that the phenotype robustness criterion for biological networks at different levels relies upon intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness. When this is true, the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in systems and evolutionary biology can also be investigated through their corresponding phenotype robustness criterion from the systematic point of view. PMID:23515240

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-off on Phenotype Robustness in Biological Networks Part I: Gene Regulatory Networks in Systems and Evolutionary Biology.

PubMed

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties observed in biological systems at different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be enough to confer intrinsic robustness in order to tolerate intrinsic parameter fluctuations, genetic robustness for buffering genetic variations, and environmental robustness for resisting environmental disturbances. With this, the phenotypic stability of biological network can be maintained, thus guaranteeing phenotype robustness. This paper presents a survey on biological systems and then develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation in systems and evolutionary biology. Further, from the unifying mathematical framework, it was discovered that the phenotype robustness criterion for biological networks at different levels relies upon intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness. When this is true, the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in systems and evolutionary biology can also be investigated through their corresponding phenotype robustness criterion from the systematic point of view.

Enhanced pain and autonomic responses to ambiguous visual stimuli in chronic Complex Regional Pain Syndrome (CRPS) type I.

PubMed

Cohen, H E; Hall, J; Harris, N; McCabe, C S; Blake, D R; Jänig, W

2012-02-01

Cortical reorganisation of sensory, motor and autonomic systems can lead to dysfunctional central integrative control. This may contribute to signs and symptoms of Complex Regional Pain Syndrome (CRPS), including pain. It has been hypothesised that central neuroplastic changes may cause afferent sensory feedback conflicts and produce pain. We investigated autonomic responses produced by ambiguous visual stimuli (AVS) in CRPS, and their relationship to pain. Thirty CRPS patients with upper limb involvement and 30 age and sex matched healthy controls had sympathetic autonomic function assessed using laser Doppler flowmetry of the finger pulp at baseline and while viewing a control figure or AVS. Compared to controls, there were diminished vasoconstrictor responses and a significant difference in the ratio of response between affected and unaffected limbs (symmetry ratio) to a deep breath and viewing AVS. While viewing visual stimuli, 33.5% of patients had asymmetric vasomotor responses and all healthy controls had a homologous symmetric pattern of response. Nineteen (61%) CRPS patients had enhanced pain within seconds of viewing the AVS. All the asymmetric vasomotor responses were in this group, and were not predictable from baseline autonomic function. Ten patients had accompanying dystonic reactions in their affected limb: 50% were in the asymmetric sub-group. In conclusion, there is a group of CRPS patients that demonstrate abnormal pain networks interacting with central somatomotor and autonomic integrational pathways. © 2011 European Federation of International Association for the Study of Pain Chapters.

RNA silencing in plant symbiotic bacteria: Insights from a protein-centric view.

PubMed

Jiménez-Zurdo, José I; Robledo, Marta

2017-12-02

Extensive work in model enterobacteria has evidenced that the RNA chaperone Hfq and several endoribonucleases, such as RNase E or RNase III, serve pivotal roles in small RNA-mediated post-transcriptional silencing of gene expression. Characterization of these protein hubs commonly provide global functional and mechanistic insights into complex sRNA regulatory networks. The legume endosymbiont Sinorhizobium meliloti is a non-classical model bacterium with a very complex lifestyle in which riboregulation is expected to play important adaptive functions. Here, we discuss current knowledge about RNA silencing in S. meliloti from the perspective of the activity of Hfq and a recently discovered endoribonuclease (YbeY) exhibiting unprecedented catalytic versatility for the cleavage of single- and double-stranded RNA molecules.

Hydrothermal growth of cross-linked hyperbranched copper dendrites using copper oxalate complex

NASA Astrophysics Data System (ADS)

Truong, Quang Duc; Kakihana, Masato

2012-06-01

A facile and surfactant-free approach has been developed for the synthesis of cross-linked hyperbranched copper dendrites using copper oxalate complex as a precursor and oxalic acid as a reducing and structure-directing agent. The synthesized particles are composed of highly branched nanostructures with unusual cross-linked hierarchical networks. The formation of copper dendrites can be explained in view of both diffusion control and aggregation-based growth model accompanied by the chelation-assisted assembly. Oxalic acid was found to play dual roles as reducing and structure-directing agent based on the investigation results. The understanding on the crystal growth and the roles of oxalic acid provides clear insight into the formation mechanism of hyperbranched metal dendrites.

Inferring the background traffic arrival process in the Internet.

PubMed

Hága, Péter; Csabai, István; Vattay, Gábor

2009-12-01

Phase transition has been found in many complex interactivity systems. Complex networks are not exception either but there are quite few real systems where we can directly understand the emergence of this nontrivial behavior from the microscopic view. In this paper, we present the emergence of the phase transition between the congested and uncongested phases of a network link. We demonstrate a method to infer the background traffic arrival process, which is one of the key state parameters of the Internet traffic. The traffic arrival process in the Internet has been investigated in several studies, since the recognition of its self-similar nature. The statistical properties of the traffic arrival process are very important since they are fundamental in modeling the dynamical behavior. Here, we demonstrate how the widely used packet train technique can be used to determine the main properties of the traffic arrival process. We show that the packet train dispersion is sensitive to the congestion on the network path. We introduce the packet train stretch as an order parameter to describe the phase transition between the congested and uncongested phases of the bottleneck link in the path. We find that the distribution of the background traffic arrival process can be determined from the average packet train dispersion at the critical point of the system.

Taming Prebiotic Chemistry: The Role of Heterogeneous and Interfacial Catalysis in the Emergence of a Prebiotic Catalytic/Information Polymer System

PubMed Central

Monnard, Pierre-Alain

2016-01-01

Cellular life is based on interacting polymer networks that serve as catalysts, genetic information and structural molecules. The complexity of the DNA, RNA and protein biochemistry suggests that it must have been preceded by simpler systems. The RNA world hypothesis proposes RNA as the prime candidate for such a primal system. Even though this proposition has gained currency, its investigations have highlighted several challenges with respect to bulk aqueous media: (1) the synthesis of RNA monomers is difficult; (2) efficient pathways for monomer polymerization into functional RNAs and their subsequent, sequence-specific replication remain elusive; and (3) the evolution of the RNA function towards cellular metabolism in isolation is questionable in view of the chemical mixtures expected on the early Earth. This review will address the question of the possible roles of heterogeneous media and catalysis as drivers for the emergence of RNA-based polymer networks. We will show that this approach to non-enzymatic polymerizations of RNA from monomers and RNA evolution cannot only solve some issues encountered during reactions in bulk aqueous solutions, but may also explain the co-emergence of the various polymers indispensable for life in complex mixtures and their organization into primitive networks. PMID:27827919

Computational Models and Emergent Properties of Respiratory Neural Networks

PubMed Central

Lindsey, Bruce G.; Rybak, Ilya A.; Smith, Jeffrey C.

2012-01-01

Computational models of the neural control system for breathing in mammals provide a theoretical and computational framework bringing together experimental data obtained from different animal preparations under various experimental conditions. Many of these models were developed in parallel and iteratively with experimental studies and provided predictions guiding new experiments. This data-driven modeling approach has advanced our understanding of respiratory network architecture and neural mechanisms underlying generation of the respiratory rhythm and pattern, including their functional reorganization under different physiological conditions. Models reviewed here vary in neurobiological details and computational complexity and span multiple spatiotemporal scales of respiratory control mechanisms. Recent models describe interacting populations of respiratory neurons spatially distributed within the Bötzinger and pre-Bötzinger complexes and rostral ventrolateral medulla that contain core circuits of the respiratory central pattern generator (CPG). Network interactions within these circuits along with intrinsic rhythmogenic properties of neurons form a hierarchy of multiple rhythm generation mechanisms. The functional expression of these mechanisms is controlled by input drives from other brainstem components, including the retrotrapezoid nucleus and pons, which regulate the dynamic behavior of the core circuitry. The emerging view is that the brainstem respiratory network has rhythmogenic capabilities at multiple levels of circuit organization. This allows flexible, state-dependent expression of different neural pattern-generation mechanisms under various physiological conditions, enabling a wide repertoire of respiratory behaviors. Some models consider control of the respiratory CPG by pulmonary feedback and network reconfiguration during defensive behaviors such as cough. Future directions in modeling of the respiratory CPG are considered. PMID:23687564

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

Lightweight UDP Pervasive Protocol in Smart Home Environment Based on Labview

NASA Astrophysics Data System (ADS)

Kurniawan, Wijaya; Hannats Hanafi Ichsan, Mochammad; Rizqika Akbar, Sabriansyah; Arwani, Issa

2017-04-01

TCP (Transmission Control Protocol) technology in a reliable environment was not a problem, but not in an environment where the entire Smart Home network connected locally. Currently employing pervasive protocols using TCP technology, when data transmission is sent, it would be slower because they have to perform handshaking process in advance and could not broadcast the data. On smart home environment, it does not need large size and complex data transmission between monitoring site and monitoring center required in Smart home strain monitoring system. UDP (User Datagram Protocol) technology is quick and simple on data transmission process. UDP can broadcast messages because the UDP did not require handshaking and with more efficient memory usage. LabVIEW is a programming language software for processing and visualization of data in the field of data acquisition. This paper proposes to examine Pervasive UDP protocol implementations in smart home environment based on LabVIEW. UDP coded in LabVIEW and experiments were performed on a PC and can work properly.

Analysis of Eocene depositional environments - Preliminary TM and TIMS results, Wind River Basin, Wyoming

NASA Technical Reports Server (NTRS)

Stucky, Richard K.; Krishtalka, Leonard; Redline, Andrew D.; Lang, Harold R.

1987-01-01

Both Landsat TM and aircraft Thermal IR Multispectral Scanner (TIMS) data have been used to map the lithofacies of the Wind River Basin's Eocene physical and biological environments. Preliminary analyses of these data have furnished maps of a fault contact boundary and a complex network of fluvial ribbon channel sandstones. The synoptic view thereby emerging for Eocene fluvial facies clarifies the relationships of ribbon channel sandstones to fossil-bearing overbank/floodplain facies and certain peleosols. The utility of TM and TIMS data is thereby demonstrated.

Model-Based 3-D recognition System Using Gabor Features and Neural Networks

DTIC Science & Technology

1990-12-01

Hubel , David H. and Torsten N. Wiesel . "Brain Mechanisms of Vision," Sinific...different perspective views. (31) 6 SCENE TEMPLATE (x, y ) i t(x, y ) I (f.,) ILFOURIE TO I)1 TRN POLAR T 8( f) TRANS l~e s~f..,OI RADIAL T on,""f J SNVERS FT...x, y ) - exp(- n[(x-x )da’ + ( y - y )P]) (1) x exp(-2zi[uo(x-x.) + vo( y - y .)]) This function describes a complex exponential windowed by a

GENERAL PERSPECTIVE VIEW OF THE COMPLEX, VIEW LOOKING NORTHWEST AT ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

GENERAL PERSPECTIVE VIEW OF THE COMPLEX, VIEW LOOKING NORTHWEST AT THE OREGON FORESTER'S OFFICE BUILDING, WITH MILL CREEK IN THE FOREGROUND. - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

GENERAL PERSPECTIVE VIEW OF THE COMPLEX, VIEW LOOKING WEST AT ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

GENERAL PERSPECTIVE VIEW OF THE COMPLEX, VIEW LOOKING WEST AT THE MOTORPOOL, AUTOMOTIVE SHOP AND FOREST PROTECTION BUILDING (FROM LEFT TO RIGHT). - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

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

NASA Astrophysics Data System (ADS)

Guo, Long; Cai, XU

2009-08-01

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

Complex systems: physics beyond physics

NASA Astrophysics Data System (ADS)

Holovatch, Yurij; Kenna, Ralph; Thurner, Stefan

2017-03-01

Complex systems are characterised by specific time-dependent interactions among their many constituents. As a consequence they often manifest rich, non-trivial and unexpected behaviour. Examples arise both in the physical and non-physical worlds. The study of complex systems forms a new interdisciplinary research area that cuts across physics, biology, ecology, economics, sociology, and the humanities. In this paper we review the essence of complex systems from a physicists' point of view, and try to clarify what makes them conceptually different from systems that are traditionally studied in physics. Our goal is to demonstrate how the dynamics of such systems may be conceptualised in quantitative and predictive terms by extending notions from statistical physics and how they can often be captured in a framework of co-evolving multiplex network structures. We mention three areas of complex-systems science that are currently studied extensively, the science of cities, dynamics of societies, and the representation of texts as evolutionary objects. We discuss why these areas form complex systems in the above sense. We argue that there exists plenty of new ground for physicists to explore and that methodical and conceptual progress is needed most.

Geometry Genetics and Evolution

NASA Astrophysics Data System (ADS)

Siggia, Eric

2011-03-01

Darwin argued that highly perfected organs such as the vertebrate eye could evolve by a series of small changes, each of which conferred a selective advantage. In the context of gene networks, this idea can be recast into a predictive algorithm, namely find networks that can be built by incremental adaptation (gradient search) to perform some task. It embodies a ``kinetic'' view of evolution where a solution that is quick to evolve is preferred over a global optimum. Examples of biochemical kinetic networks were evolved for temporal adaptation, temperature compensated entrainable clocks, explore-exploit trade off in signal discrimination, will be presented as well as networks that model the spatially periodic somites (vertebrae) and HOX gene expression in the vertebrate embryo. These models appear complex by the criterion of 19th century applied mathematics since there is no separation of time or spatial scales, yet they are all derivable by gradient optimization of simple functions (several in the Pareto evolution) often based on the Shannon entropy of the time or spatial response. Joint work with P. Francois, Physics Dept. McGill University. With P. Francois, Physics Dept. McGill University

Pharmacological Tools to Study the Role of Astrocytes in Neural Network Functions.

PubMed

Peña-Ortega, Fernando; Rivera-Angulo, Ana Julia; Lorea-Hernández, Jonathan Julio

2016-01-01

Despite that astrocytes and microglia do not communicate by electrical impulses, they can efficiently communicate among them, with each other and with neurons, to participate in complex neural functions requiring broad cell-communication and long-lasting regulation of brain function. Glial cells express many receptors in common with neurons; secrete gliotransmitters as well as neurotrophic and neuroinflammatory factors, which allow them to modulate synaptic transmission and neural excitability. All these properties allow glial cells to influence the activity of neuronal networks. Thus, the incorporation of glial cell function into the understanding of nervous system dynamics will provide a more accurate view of brain function. Our current knowledge of glial cell biology is providing us with experimental tools to explore their participation in neural network modulation. In this chapter, we review some of the classical, as well as some recent, pharmacological tools developed for the study of astrocyte's influence in neural function. We also provide some examples of the use of these pharmacological agents to understand the role of astrocytes in neural network function and dysfunction.

Multi-target Detection, Tracking, and Data Association on Road Networks Using Unmanned Aerial Vehicles

NASA Astrophysics Data System (ADS)

Barkley, Brett E.

A cooperative detection and tracking algorithm for multiple targets constrained to a road network is presented for fixed-wing Unmanned Air Vehicles (UAVs) with a finite field of view. Road networks of interest are formed into graphs with nodes that indicate the target likelihood ratio (before detection) and position probability (after detection). A Bayesian likelihood ratio tracker recursively assimilates target observations until the cumulative observations at a particular location pass a detection criterion. At this point, a target is considered detected and a position probability is generated for the target on the graph. Data association is subsequently used to route future measurements to update the likelihood ratio tracker (for undetected target) or to update a position probability (a previously detected target). Three strategies for motion planning of UAVs are proposed to balance searching for new targets with tracking known targets for a variety of scenarios. Performance was tested in Monte Carlo simulations for a variety of mission parameters, including tracking on road networks with varying complexity and using UAVs at various altitudes.

Visualization techniques for computer network defense

NASA Astrophysics Data System (ADS)

Beaver, Justin M.; Steed, Chad A.; Patton, Robert M.; Cui, Xiaohui; Schultz, Matthew

2011-06-01

Effective visual analysis of computer network defense (CND) information is challenging due to the volume and complexity of both the raw and analyzed network data. A typical CND is comprised of multiple niche intrusion detection tools, each of which performs network data analysis and produces a unique alerting output. The state-of-the-practice in the situational awareness of CND data is the prevalent use of custom-developed scripts by Information Technology (IT) professionals to retrieve, organize, and understand potential threat events. We propose a new visual analytics framework, called the Oak Ridge Cyber Analytics (ORCA) system, for CND data that allows an operator to interact with all detection tool outputs simultaneously. Aggregated alert events are presented in multiple coordinated views with timeline, cluster, and swarm model analysis displays. These displays are complemented with both supervised and semi-supervised machine learning classifiers. The intent of the visual analytics framework is to improve CND situational awareness, to enable an analyst to quickly navigate and analyze thousands of detected events, and to combine sophisticated data analysis techniques with interactive visualization such that patterns of anomalous activities may be more easily identified and investigated.

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.

Tensegrity II. How structural networks influence cellular information processing networks

NASA Technical Reports Server (NTRS)

Ingber, Donald E.

2003-01-01

The major challenge in biology today is biocomplexity: the need to explain how cell and tissue behaviors emerge from collective interactions within complex molecular networks. Part I of this two-part article, described a mechanical model of cell structure based on tensegrity architecture that explains how the mechanical behavior of the cell emerges from physical interactions among the different molecular filament systems that form the cytoskeleton. Recent work shows that the cytoskeleton also orients much of the cell's metabolic and signal transduction machinery and that mechanical distortion of cells and the cytoskeleton through cell surface integrin receptors can profoundly affect cell behavior. In particular, gradual variations in this single physical control parameter (cell shape distortion) can switch cells between distinct gene programs (e.g. growth, differentiation and apoptosis), and this process can be viewed as a biological phase transition. Part II of this article covers how combined use of tensegrity and solid-state mechanochemistry by cells may mediate mechanotransduction and facilitate integration of chemical and physical signals that are responsible for control of cell behavior. In addition, it examines how cell structural networks affect gene and protein signaling networks to produce characteristic phenotypes and cell fate transitions during tissue development.

GENERAL PERSPECTIVE VIEW OF THE COMPLEX, VIEW LOOKING EAST AT ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

GENERAL PERSPECTIVE VIEW OF THE COMPLEX, VIEW LOOKING EAST AT THE FOREST PROTECTION BUILDING, THE MOTORPOOL, AND THE AUTOMOTIVE SHOP (FROM LEFT TO RIGHT). - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

Structural identifiability of cyclic graphical models of biological networks with latent variables.

PubMed

Wang, Yulin; Lu, Na; Miao, Hongyu

2016-06-13

Graphical models have long been used to describe biological networks for a variety of important tasks such as the determination of key biological parameters, and the structure of graphical model ultimately determines whether such unknown parameters can be unambiguously obtained from experimental observations (i.e., the identifiability problem). Limited by resources or technical capacities, complex biological networks are usually partially observed in experiment, which thus introduces latent variables into the corresponding graphical models. A number of previous studies have tackled the parameter identifiability problem for graphical models such as linear structural equation models (SEMs) with or without latent variables. However, the limited resolution and efficiency of existing approaches necessarily calls for further development of novel structural identifiability analysis algorithms. An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of benchmark models are used to verify the validity of the proposed approach. Finally, the network module for influenza A virus replication is employed as a real example to illustrate the application of the proposed approach in practice. The proposed approach can deal with cyclic networks with latent variables. The key advantage is that it intentionally avoids symbolic computation and is thus highly efficient. Also, this method is capable of determining the identifiability of each single parameter and is thus of higher resolution in comparison with many existing approaches. Overall, this study provides a basis for systematic examination and refinement of graphical models of biological networks from the identifiability point of view, and it has a significant potential to be extended to more complex network structures or high-dimensional systems.

Functional Subdivision of Group-ICA Results of fMRI Data Collected during Cinema Viewing

PubMed Central

Pamilo, Siina; Malinen, Sanna; Hlushchuk, Yevhen; Seppä, Mika; Tikka, Pia; Hari, Riitta

2012-01-01

Independent component analysis (ICA) can unravel functional brain networks from functional magnetic resonance imaging (fMRI) data. The number of the estimated components affects both the spatial pattern of the identified networks and their time-course estimates. Here group-ICA was applied at four dimensionalities (10, 20, 40, and 58 components) to fMRI data collected from 15 subjects who viewed a 15-min silent film (“At land” by Maya Deren). We focused on the dorsal attention network, the default-mode network, and the sensorimotor network. The lowest dimensionalities demonstrated most prominent activity within the dorsal attention network, combined with the visual areas, and in the default-mode network; the sensorimotor network only appeared with ICA comprising at least 20 components. The results suggest that even very low-dimensional ICA can unravel the most prominent functionally-connected brain networks. However, increasing the number of components gives a more detailed picture and functionally feasible subdivision of the major networks. These results improve our understanding of the hierarchical subdivision of brain networks during viewing of a movie that provides continuous stimulation embedded in an attention-directing narrative. PMID:22860044

MotifNet: a web-server for network motif analysis.

PubMed

Smoly, Ilan Y; Lerman, Eugene; Ziv-Ukelson, Michal; Yeger-Lotem, Esti

2017-06-15

Network motifs are small topological patterns that recur in a network significantly more often than expected by chance. Their identification emerged as a powerful approach for uncovering the design principles underlying complex networks. However, available tools for network motif analysis typically require download and execution of computationally intensive software on a local computer. We present MotifNet, the first open-access web-server for network motif analysis. MotifNet allows researchers to analyze integrated networks, where nodes and edges may be labeled, and to search for motifs of up to eight nodes. The output motifs are presented graphically and the user can interactively filter them by their significance, number of instances, node and edge labels, and node identities, and view their instances. MotifNet also allows the user to distinguish between motifs that are centered on specific nodes and motifs that recur in distinct parts of the network. MotifNet is freely available at http://netbio.bgu.ac.il/motifnet . The website was implemented using ReactJs and supports all major browsers. The server interface was implemented in Python with data stored on a MySQL database. estiyl@bgu.ac.il or michaluz@cs.bgu.ac.il. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Disrupting the Networks of Cancer

PubMed Central

Camacho, Daniel F.; Pienta, Kenneth J.

2014-01-01

Ecosystems are interactive systems involving communities of species and their abiotic environment. Tumors are ecosystems in which cancer cells act as invasive species interacting with native host cell species in an established microenvironment within the larger host biosphere. At its heart, to study ecology is to study interconnectedness. In ecologic science, an ecologic network is a representation of the biotic interactions in an ecosystem in which species (nodes) are connected by pairwise interactions (links). Ecologic networks and signaling network models have been used to describe and compare the structures of ecosystems. It has been shown that disruption of ecologic networks through the loss of species or disruption of interactions between them can lead to the destruction of the ecosystem. Often, the destruction of a single node or link is not enough to disrupt the entire ecosystem. The more complex the network and its interactions, the more difficult it is to cause the extinction of a species, especially without leveraging other aspects of the ecosystem. Similarly, successful treatment of cancer with a single agent is rarely enough to cure a patient without strategically modifying the support systems conducive to survival of cancer. Cancer cells and the ecologic systems they reside in can be viewed as a series of nested networks. The most effective new paradigms for treatment will be developed through application of scaled network disruption. PMID:22442061

Disrupting the networks of cancer.

PubMed

Camacho, Daniel F; Pienta, Kenneth J

2012-05-15

Ecosystems are interactive systems involving communities of species and their abiotic environment. Tumors are ecosystems in which cancer cells act as invasive species interacting with native host cell species in an established microenvironment within the larger host biosphere. At its heart, to study ecology is to study interconnectedness. In ecologic science, an ecologic network is a representation of the biotic interactions in an ecosystem in which species (nodes) are connected by pairwise interactions (links). Ecologic networks and signaling network models have been used to describe and compare the structures of ecosystems. It has been shown that disruption of ecologic networks through the loss of species or disruption of interactions between them can lead to the destruction of the ecosystem. Often, the destruction of a single node or link is not enough to disrupt the entire ecosystem. The more complex the network and its interactions, the more difficult it is to cause the extinction of a species, especially without leveraging other aspects of the ecosystem. Similarly, successful treatment of cancer with a single agent is rarely enough to cure a patient without strategically modifying the support systems conducive to survival of cancer. Cancer cells and the ecologic systems they reside in can be viewed as a series of nested networks. The most effective new paradigms for treatment will be developed through application of scaled network disruption. ©2012 AACR.

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

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.

Oblique view to south OvertheHorizon Backscatter Radar Network, Mountain ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

Oblique view to south - Over-the-Horizon Backscatter Radar Network, Mountain Home Air Force Operations Building, On Desert Street at 9th Avenue Mountain Home Air Force Base, Mountain Home, Elmore County, ID

Analysis hierarchical model for discrete event systems

NASA Astrophysics Data System (ADS)

Ciortea, E. M.

2015-11-01

The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.

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

Mapping Cellular Polarity Networks Using Mass Spectrometry-based Strategies.

PubMed

Daulat, Avais M; Puvirajesinghe, Tania M; Camoin, Luc; Borg, Jean-Paul

2018-05-18

Cell polarity is a vital biological process involved in the building, maintenance and normal functioning of tissues in invertebrates and vertebrates. Unsurprisingly, molecular defects affecting polarity organization and functions have a strong impact on tissue homeostasis, embryonic development and adult life, and may directly or indirectly lead to diseases. Genetic studies have demonstrated the causative effect of several polarity genes in diseases; however, much remains to be clarified before a comprehensive view of the molecular organization and regulation of the protein networks associated with polarity proteins is obtained. This challenge can be approached head-on using proteomics to identify protein complexes involved in cell polarity and their modifications in a spatio-temporal manner. We review the fundamental basics of mass spectrometry techniques and provide an in-depth analysis of how mass spectrometry has been instrumental in understanding the complex and dynamic nature of some cell polarity networks at the tissue (apico-basal and planar cell polarities) and cellular (cell migration, ciliogenesis) levels, with the fine dissection of the interconnections between prototypic cell polarity proteins and signal transduction cascades in normal and pathological situations. This review primarily focuses on epithelial structures which are the fundamental building blocks for most metazoan tissues, used as the archetypal model to study cellular polarity. This field offers broad perspectives thanks to the ever-increasing sensitivity of mass spectrometry and its use in combination with recently developed molecular strategies able to probe in situ proteomic networks. Copyright © 2018 Elsevier Ltd. All rights reserved.

Analysis of the transmission characteristics of China's carbon market transaction price volatility from the perspective of a complex network.

PubMed

Jia, Jingjing; Li, Huajiao; Zhou, Jinsheng; Jiang, Meihui; Dong, Di

2018-03-01

Research on the price fluctuation transmission of the carbon trading pilot market is of great significance for the establishment of China's unified carbon market and its development in the future. In this paper, the carbon market transaction prices of Beijing, Shanghai, Tianjin, Shenzhen, and Guangdong were selected from December 29, 2013 to March 26, 2016, as sample data. Based on the view of the complex network theory, we construct a price fluctuation transmission network model of five pilot carbon markets in China, with the purposes of analyzing the topological features of this network, including point intensity, weighted clustering coefficient, betweenness centrality, and community structure, and elucidating the characteristics and transmission mechanism of price fluctuation in China's five pilot cities. The results of point intensity and weighted clustering coefficient show that the carbon prices in the five markets remained unchanged and transmitted smoothly in general, and price fragmentation is serious; however, at some point, the price fluctuates with mass phenomena. The result of betweenness centrality reflects that a small number of price fluctuations can control the whole market carbon price transmission and price fluctuation evolves in an alternate manner. The study provides direction for the scientific management of the carbon price. Policy makers should take a positive role in promoting market activity, preventing the risks that may arise from mass trade and scientifically forecasting the volatility of trading prices, which will provide experience for the establishment of a unified carbon market in China.

Language Views on Social Networking Sites for Language Learning: The Case of Busuu

ERIC Educational Resources Information Center

Álvarez Valencia, José Aldemar

2016-01-01

Social networking has compelled the area of computer-assisted language learning (CALL) to expand its research palette and account for new virtual ecologies that afford language learning and socialization. This study focuses on Busuu, a social networking site for language learning (SNSLL), and analyzes the views of language that are enacted through…

Knitted Patterns or Contagious Hotspots?: Linking Views on Knowledge and Organizational Networked Learning

ERIC Educational Resources Information Center

Cornelissen, Frank; de Jong, Tjip; Kessels, Joseph

2012-01-01

Purpose: This paper aims to propose a framework which connects perspectives on knowledge and learning to various approaches of social networks studies. The purpose is twofold: providing input for the discourse in organizational studies about the way different views on knowledge and networks drive design choices and activities of researchers,…

Information Diffusion in Facebook-Like Social Networks Under Information Overload

NASA Astrophysics Data System (ADS)

Li, Pei; Xing, Kai; Wang, Dapeng; Zhang, Xin; Wang, Hui

2013-07-01

Research on social networks has received remarkable attention, since many people use social networks to broadcast information and stay connected with their friends. However, due to the information overload in social networks, it becomes increasingly difficult for users to find useful information. This paper takes Facebook-like social networks into account, and models the process of information diffusion under information overload. The term view scope is introduced to model the user information-processing capability under information overload, and the average number of times a message appears in view scopes after it is generated is proposed to characterize the information diffusion efficiency. Through theoretical analysis, we find that factors such as network structure and view scope number have no impact on the information diffusion efficiency, which is a surprising result. To verify the results, we conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly.

TOPOGRAPHIC VIEW OF THE STATE FORESTER'S COMPLEX, VIEW LOOKING SOUTHWEST ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

TOPOGRAPHIC VIEW OF THE STATE FORESTER'S COMPLEX, VIEW LOOKING SOUTHWEST FROM STATE STREET, WITH THE K.O.G BUILDING (KEEP OREGON GREEN) IN THE FOREGROUND. - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

Information spreading dynamics in hypernetworks

NASA Astrophysics Data System (ADS)

Suo, Qi; Guo, Jin-Li; Shen, Ai-Zhong

2018-04-01

Contact pattern and spreading strategy fundamentally influence the spread of information. Current mathematical methods largely assume that contacts between individuals are fixed by networks. In fact, individuals are affected by all his/her neighbors in different social relationships. Here, we develop a mathematical approach to depict the information spreading process in hypernetworks. Each individual is viewed as a node, and each social relationship containing the individual is viewed as a hyperedge. Based on SIS epidemic model, we construct two spreading models. One model is based on global transmission, corresponding to RP strategy. The other is based on local transmission, corresponding to CP strategy. These models can degenerate into complex network models with a special parameter. Thus hypernetwork models extend the traditional models and are more realistic. Further, we discuss the impact of parameters including structure parameters of hypernetwork, spreading rate, recovering rate as well as information seed on the models. Propagation time and density of informed nodes can reveal the overall trend of information dissemination. Comparing these two models, we find out that there is no spreading threshold in RP, while there exists a spreading threshold in CP. The RP strategy induces a broader and faster information spreading process under the same parameters.

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.

Short-Range Temporal Interactions in Sleep; Hippocampal Spike Avalanches Support a Large Milieu of Sequential Activity Including Replay

PubMed Central

Mahoney, J. Matthew; Titiz, Ali S.; Hernan, Amanda E.; Scott, Rod C.

2016-01-01

Hippocampal neural systems consolidate multiple complex behaviors into memory. However, the temporal structure of neural firing supporting complex memory consolidation is unknown. Replay of hippocampal place cells during sleep supports the view that a simple repetitive behavior modifies sleep firing dynamics, but does not explain how multiple episodes could be integrated into associative networks for recollection during future cognition. Here we decode sequential firing structure within spike avalanches of all pyramidal cells recorded in sleeping rats after running in a circular track. We find that short sequences that combine into multiple long sequences capture the majority of the sequential structure during sleep, including replay of hippocampal place cells. The ensemble, however, is not optimized for maximally producing the behavior-enriched episode. Thus behavioral programming of sequential correlations occurs at the level of short-range interactions, not whole behavioral sequences and these short sequences are assembled into a large and complex milieu that could support complex memory consolidation. PMID:26866597

BIRD'S EYE VIEW OF THE COMPLEX, VIEW LOOKING NORTHWEST, WITH ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

BIRD'S EYE VIEW OF THE COMPLEX, VIEW LOOKING NORTHWEST, WITH THE FOREST PRACTICES BUILDING IN THE FOREGROUND, THE K.O.G. BUILDING TO THE RIGHT OF VIEW, AND THE BRIDGE AND THE OREGON STATE FORESTER'S OFFICE BUILDING IN THE BACKGROUND. - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

Microfilament distribution in protonemata of the moss Ceratodon

NASA Technical Reports Server (NTRS)

Walker, L. M.; Sack, F. D.

1995-01-01

Microfilaments were visualized in dark-grown protonemata of the moss Ceratodon to assess their possible role in tip growth and gravitropism. The relative effectiveness of rhodamine phalloidin (with or without m-maleimidobenzoyl-N-hydroxysuccinimide ester (MBS)) and of immunofluorescence (using the C4 antibody) was evaluated for actin localization in the same cell type. Using immunofluorescence, microfilaments were primarily in an axial orientation within the apical cell. However, a more complex network of microfilaments was observed using rhodamine phalloidin after MBS pretreatment, especially when viewed by confocal laser scanning microscopy. This method revealed a rich three dimensional network of fine microfilaments throughout the apical cell, including the extreme apex. Although there were numerous internal microfilaments, peripheral microfilaments were more abundant. No major redistribution of microfilaments was detected after gravistimulation. The combination of MBS, rhodamine phalloidin, and confocal laser scanning microscopy preserves and reveals microfilaments remarkably well and documents perhaps the most extensive F-actin network visualized to date in any tip-growing cell.

On the Relevancy of Efficient, Integrated Computer and Network Monitoring in HEP Distributed Online Environment

NASA Astrophysics Data System (ADS)

Carvalho, D.; Gavillet, Ph.; Delgado, V.; Albert, J. N.; Bellas, N.; Javello, J.; Miere, Y.; Ruffinoni, D.; Smith, G.

Large Scientific Equipments are controlled by Computer Systems whose complexity is growing driven, on the one hand by the volume and variety of the information, its distributed nature, the sophistication of its treatment and, on the other hand by the fast evolution of the computer and network market. Some people call them genetically Large-Scale Distributed Data Intensive Information Systems or Distributed Computer Control Systems (DCCS) for those systems dealing more with real time control. Taking advantage of (or forced by) the distributed architecture, the tasks are more and more often implemented as Client-Server applications. In this framework the monitoring of the computer nodes, the communications network and the applications becomes of primary importance for ensuring the safe running and guaranteed performance of the system. With the future generation of HEP experiments, such as those at the LHC in view, it is proposed to integrate the various functions of DCCS monitoring into one general purpose Multi-layer System.

Information dynamics algorithm for detecting communities in networks

NASA Astrophysics Data System (ADS)

Massaro, Emanuele; Bagnoli, Franco; Guazzini, Andrea; Lió, Pietro

2012-11-01

The problem of community detection is relevant in many scientific disciplines, from social science to statistical physics. Given the impact of community detection in many areas, such as psychology and social sciences, we have addressed the issue of modifying existing well performing algorithms by incorporating elements of the domain application fields, i.e. domain-inspired. We have focused on a psychology and social network-inspired approach which may be useful for further strengthening the link between social network studies and mathematics of community detection. Here we introduce a community-detection algorithm derived from the van Dongen's Markov Cluster algorithm (MCL) method [4] by considering networks' nodes as agents capable to take decisions. In this framework we have introduced a memory factor to mimic a typical human behavior such as the oblivion effect. The method is based on information diffusion and it includes a non-linear processing phase. We test our method on two classical community benchmark and on computer generated networks with known community structure. Our approach has three important features: the capacity of detecting overlapping communities, the capability of identifying communities from an individual point of view and the fine tuning the community detectability with respect to prior knowledge of the data. Finally we discuss how to use a Shannon entropy measure for parameter estimation in complex networks.

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.

Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit

PubMed Central

Schaub, Michael T.; Delvenne, Jean-Charles; Yaliraki, Sophia N.; Barahona, Mauricio

2012-01-01

In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the ‘right’ split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be evaluated. However, popular community detection methods and benchmarks normally assume an implicit notion of community based on clique-like subgraphs, a form of community structure that is not always characteristic of real networks. Specifically, networks that emerge from geometric constraints can have natural non clique-like substructures with large effective diameters, which can be interpreted as long-range communities. In this work, we show that long-range communities escape detection by popular methods, which are blinded by a restricted ‘field-of-view’ limit, an intrinsic upper scale on the communities they can detect. The field-of-view limit means that long-range communities tend to be overpartitioned. We show how by adopting a dynamical perspective towards community detection [1], [2], in which the evolution of a Markov process on the graph is used as a zooming lens over the structure of the network at all scales, one can detect both clique- or non clique-like communities without imposing an upper scale to the detection. Consequently, the performance of algorithms on inherently low-diameter, clique-like benchmarks may not always be indicative of equally good results in real networks with local, sparser connectivity. We illustrate our ideas with constructive examples and through the analysis of real-world networks from imaging, protein structures and the power grid, where a multiscale structure of non clique-like communities is revealed. PMID:22384178

Influence of social networks on congresses of urological societies and associations: Results of the 81th National Congress of the Spanish Urological Association.

PubMed

Gómez-Rivas, J; Rodríguez-Socarrás, M E; Tortolero-Blanco, L; Garcia-Sanz, M; Alvarez-Maestro, M; Ribal, M J; Cózar-Olmo, M

2017-04-01

To measure social network activity during the 81th National Congress of the Spanish Urological Association (AEU) and to compare it with the activity during other congresses of national and international urological associations. We designed and registered the official hashtag #AEU16 for the 81 th National Congress of the AEU on the Symplur website. The following measurements were recorded: number of participants, number of tweets, tweets by participant, tweets per hour and views. The number of participants in the social network activity during the congress was 207. The measurements of activity in Twitter consisted of a total of 1866 tweets, a mean rate of 16 tweets/h, 9 tweets per participant and 1,511,142 views. The activity during the international congresses is as follows: 2016 American Urological Association annual congress (views: 28,052,558), 2016 European Association of Urology annual congress (views: 13,915,994), 2016 Urological Society of Australia and New Zealand (views: 4,757,453), 2015 Société Internationale d'Urologie annual congress (views: 1,023,038). The activity during the national congresses was recorded as follows: 2016 Annual Conference of The British Association of Urological Surgeons (views: 2,518,880), 81th National Congress of the AEU (views: 1,511,142), 109th Congress of l'Association Française d'Urologie (views: 662,828), 67th German Congress of Urology (views: 167,347). We found 10 posts in Facebook and 2 communications via Periscope TV related to #AEU16. The social network activity during the 81 th National Congress of the AEU was notable given the results of this study. The use of social networks has expanded among urological associations, congresses and meetings, giving them a global character. Copyright © 2016 AEU. Publicado por Elsevier España, S.L.U. All rights reserved.

Networks of Interacting Processes: Relationships Between Drivers and Deltaic Variables to Understand Water and Sediment Transport in Wax Lake Delta, Coastal Louisiana

NASA Astrophysics Data System (ADS)

Sendrowski, A.; Passalacqua, P.; Wagner, W.; Mohrig, D. C.; Meselhe, E. A.; Sadid, K. M.; Castañeda-Moya, E.; Twilley, R.

2017-12-01

Studying distributary channel networks in river deltaic systems provides important insight into deltaic functioning and evolution. This view of networks highlights the physical connection along channels and can also encompass the structural link between channels and deltaic islands (termed structural connectivity). An alternate view of the deltaic network is one composed of interacting processes, such as relationships between external drivers (e.g., river discharge, tides, and wind) and internal deltaic response variables (e.g., water level and sediment concentration). This network, also referred to as process connectivity, is dynamic across space and time, often comprises nonlinear relationships, and contributes to the development of complex channel networks and ecologically rich island platforms. The importance of process connectivity has been acknowledged, however, few studies have directly quantified these network interactions. In this work, we quantify process connections in Wax Lake Delta (WLD), coastal Louisiana. WLD is a naturally prograding delta that serves as an analogue for river diversion projects, thus it provides an excellent setting for understanding the influence of river discharge, tides, and wind on water and sediment in a delta. Time series of water level and sediment concentration were collected in three channels from November 2013 to February 2014, while water level and turbidity were collected on an island from April 2014 to August 2015. Additionally, a model run on WLD bathymetry generated two years of sediment concentration time series in multiple channels. River discharge, tide, and wind measurements were collected from the USGS and NOAA, respectively. We analyze this data with information theory (IT), a set of statistics that measure uncertainty in signals and communication between signals. Using IT, the timescale, strength, and direction of network links are quantified by measuring the synchronization and direct influence from one variable to another. We compare channel and island process connections, which show distinct differences. Our study captures the temporal evolution of variable transport at multiple locations. While WLD is river dominated, tides and wind show unique transport signatures related to tidal spring and neap transitions and wind events.

Topology of molecular interaction networks.

PubMed

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

2013-09-16

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

Topology of molecular interaction networks

PubMed Central

2013-01-01

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

The effects of different types of text and individual differences on view complexity about genetically modified organisms

NASA Astrophysics Data System (ADS)

Dinsmore, Daniel L.; Zoellner, Brian P.; Parkinson, Meghan M.; Rossi, Anthony M.; Monk, Mary J.; Vinnachi, Jenelle

2017-05-01

View change about socio-scientific issues has been well studied in the literature, but the change in the complexity of those views has not. In the current study, the change in the complexity of views about a specific scientific topic (i.e. genetically modified organisms; GMOs) and use of evidence in explaining those views was examined in relation to individual factors and type of text (informational, persuasive, or narrative). Undergraduate students completed measures of their prior views about GMOs their epistemic beliefs about the nature of science, and activities related to food consumption. Participants then read either an informational, persuasive, or narrative passage about GMOs and again answered a question related to their views about GMOs. Participants who read the persuasive passage decreased in the complexity of their views, while those who read the narrative and expository passage increased in the complexity of their views. Additionally, while cultural activities related to the complexity of individuals' views during the pretest, these significant differences were not evident at posttest after the text intervention. These findings can be used to help scientists and teachers better understand how to communicate information critical to understanding complex science and environmental issues to the public and their students.

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

NASA Technical Reports Server (NTRS)

Schenker, Paul S. (Editor)

1992-01-01

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

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

PubMed

Waelbers, Katinka; Dorstewitz, Philipp

2014-03-01

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

Cytokines and the immune-neuroendocrine network: What did we learn from infection and autoimmunity?

PubMed

Correa, Silvia G; Maccioni, Mariana; Rivero, Virginia E; Iribarren, Pablo; Sotomayor, Claudia E; Riera, Clelia M

2007-01-01

The initial view of the neuroendocrine-immune communication as the brake of immune activation is changing. Recent evidence suggests that the optimization of the body's overall response to infection could be actually the role of the immune-endocrine network. In gradually more complex organisms, the multiplicity of host-pathogen interfaces forced the development of efficient and protective responses. Molecules such as cytokines and Toll-like receptors (TLRs) are distributed both in the periphery and in the brain to participate in a coordinated adaptive function. When sustained release of inflammatory mediators occurs, as in autoimmune diseases, undesirable pathological consequences become evident with different manifestations and outcomes. Clearly, organisms are not well adapted to that disregulated condition yet, suggesting that additional partners within neuroendocrine-immune interactions might emerge from the evolutionary road.

Complex quantum network geometries: Evolution and phase transitions

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

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

Complex quantum network geometries: Evolution and phase transitions.

PubMed

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

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

Network-wide BGP route prediction for traffic engineering

NASA Astrophysics Data System (ADS)

Feamster, Nick; Rexford, Jennifer

2002-07-01

The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering.

Safety models incorporating graph theory based transit indicators.

PubMed

Quintero, Liliana; Sayed, Tarek; Wahba, Mohamed M

2013-01-01

There is a considerable need for tools to enable the evaluation of the safety of transit networks at the planning stage. One interesting approach for the planning of public transportation systems is the study of networks. Network techniques involve the analysis of systems by viewing them as a graph composed of a set of vertices (nodes) and edges (links). Once the transport system is visualized as a graph, various network properties can be evaluated based on the relationships between the network elements. Several indicators can be calculated including connectivity, coverage, directness and complexity, among others. The main objective of this study is to investigate the relationship between network-based transit indicators and safety. The study develops macro-level collision prediction models that explicitly incorporate transit physical and operational elements and transit network indicators as explanatory variables. Several macro-level (zonal) collision prediction models were developed using a generalized linear regression technique, assuming a negative binomial error structure. The models were grouped into four main themes: transit infrastructure, transit network topology, transit route design, and transit performance and operations. The safety models showed that collisions were significantly associated with transit network properties such as: connectivity, coverage, overlapping degree and the Local Index of Transit Availability. As well, the models showed a significant relationship between collisions and some transit physical and operational attributes such as the number of routes, frequency of routes, bus density, length of bus and 3+ priority lanes. Copyright © 2012 Elsevier Ltd. All rights reserved.

View-invariant gait recognition method by three-dimensional convolutional neural network

NASA Astrophysics Data System (ADS)

Xing, Weiwei; Li, Ying; Zhang, Shunli

2018-01-01

Gait as an important biometric feature can identify a human at a long distance. View change is one of the most challenging factors for gait recognition. To address the cross view issues in gait recognition, we propose a view-invariant gait recognition method by three-dimensional (3-D) convolutional neural network. First, 3-D convolutional neural network (3DCNN) is introduced to learn view-invariant feature, which can capture the spatial information and temporal information simultaneously on normalized silhouette sequences. Second, a network training method based on cross-domain transfer learning is proposed to solve the problem of the limited gait training samples. We choose the C3D as the basic model, which is pretrained on the Sports-1M and then fine-tune C3D model to adapt gait recognition. In the recognition stage, we use the fine-tuned model to extract gait features and use Euclidean distance to measure the similarity of gait sequences. Sufficient experiments are carried out on the CASIA-B dataset and the experimental results demonstrate that our method outperforms many other methods.

3D Bioprinting of Artificial Tissues: Construction of Biomimetic Microstructures.

PubMed

Luo, Yongxiang; Lin, Xin; Huang, Peng

2018-04-24

It is promising that artificial tissues/organs for clinical application can be produced via 3D bioprinting of living cells and biomaterials. The construction of microstructures biomimicking native tissues is crucially important to create artificial tissues with biological functions. For instance, the fabrication of vessel-like networks to supply cells with initial nutrient and oxygen, and the arrangement of multiple types of cells for creating lamellar/complex tissues through 3D bioprinting are widely reported. The current advances in 3D bioprinting of artificial tissues from the view of construction of biomimetic microstructures, especially the fabrication of lamellar, vascular, and complex structures are summarized. In the end, the conclusion and perspective of 3D bioprinting for clinical applications are elaborated. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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 stochastic and dynamical view of pluripotency in mouse embryonic stem cells

PubMed Central

Lee, Esther J.

2018-01-01

Pluripotent embryonic stem cells are of paramount importance for biomedical sciences because of their innate ability for self-renewal and differentiation into all major cell lines. The fateful decision to exit or remain in the pluripotent state is regulated by complex genetic regulatory networks. The rapid growth of single-cell sequencing data has greatly stimulated applications of statistical and machine learning methods for inferring topologies of pluripotency regulating genetic networks. The inferred network topologies, however, often only encode Boolean information while remaining silent about the roles of dynamics and molecular stochasticity inherent in gene expression. Herein we develop a framework for systematically extending Boolean-level network topologies into higher resolution models of networks which explicitly account for the promoter architectures and gene state switching dynamics. We show the framework to be useful for disentangling the various contributions that gene switching, external signaling, and network topology make to the global heterogeneity and dynamics of transcription factor populations. We find the pluripotent state of the network to be a steady state which is robust to global variations of gene switching rates which we argue are a good proxy for epigenetic states of individual promoters. The temporal dynamics of exiting the pluripotent state, on the other hand, is significantly influenced by the rates of genetic switching which makes cells more responsive to changes in extracellular signals. PMID:29451874

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.

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.

Television food advertising viewed by preschoolers, children and adolescents: contributors to differences in exposure for black and white youth in the United States.

PubMed

Fleming-Milici, F; Harris, J L

2018-02-01

Public health experts raise concerns about adolescents' and black youth's greater exposure to TV advertising for unhealthy foods and beverages compared with children and white youth. Examine how television-viewing patterns and rates of advertising during targeted programming contribute to this greater exposure. Nielsen panel data provided viewing times and amount of food advertising viewed on U.S. television in 2008 and 2012. Researchers compared results by network type (black-, child- and youth-targeted), age group (preschoolers, children and adolescents) and race (black and white youth). Food advertising exposure increased with age for both black and white youth, but black youth viewed approximately 50% or more ads than did white youth of the same age. Higher rates of food advertising on youth-targeted networks explained greater adolescent exposure. However, greater television viewing and higher rates of advertising on youth- and black-targeted networks both contributed to black youth's greater exposure. From 2008 to 2012, increases in food-ads-per-hour increased exposure for all youth. Food advertisers and networks, especially those targeting adolescents and black youth, must do more to reduce advertising that negatively impacts young people's health. Furthermore, reducing commercial-television viewing by black youth may help reduce health disparities affecting their communities. © 2016 World Obesity Federation.

The Effects of Different Types of Text and Individual Differences on View Complexity about Genetically Modified Organisms

ERIC Educational Resources Information Center

Dinsmore, Daniel L.; Zoellner, Brian P.; Parkinson, Meghan M.; Rossi, Anthony M.; Monk, Mary J.; Vinnachi, Jenelle

2017-01-01

View change about socio-scientific issues has been well studied in the literature, but the change in the complexity of those views has not. In the current study, the change in the complexity of views about a specific scientific topic (i.e. genetically modified organisms; GMOs) and use of evidence in explaining those views was examined in relation…

Dynamic multiprotein assemblies shape the spatial structure of cell signaling.

PubMed

Nussinov, Ruth; Jang, Hyunbum

2014-01-01

Cell signaling underlies critical cellular decisions. Coordination, efficiency as well as fail-safe mechanisms are key elements. How the cell ensures that these hallmarks are at play are important questions. Cell signaling is often viewed as taking place through discrete and cross-talking pathways; oftentimes these are modularized to emphasize distinct functions. While simple, convenient and clear, such models largely neglect the spatial structure of cell signaling; they also convey inter-modular (or inter-protein) spatial separation that may not exist. Here our thesis is that cell signaling is shaped by a network of multiprotein assemblies. While pre-organized, the assemblies and network are loose and dynamic. They contain transiently-associated multiprotein complexes which are often mediated by scaffolding proteins. They are also typically anchored in the membrane, and their continuum may span the cell. IQGAP1 scaffolding protein which binds proteins including Raf, calmodulin, Mek, Erk, actin, and tens more, with actin shaping B-cell (and likely other) membrane-anchored nanoclusters and allosterically polymerizing in dynamic cytoskeleton formation, and Raf anchoring in the membrane along with Ras, provides a striking example. The multivalent network of dynamic proteins and lipids, with specific interactions forming and breaking, can be viewed as endowing gel-like properties. Collectively, this reasons that efficient, productive and reliable cell signaling takes place primarily through transient, preorganized and cooperative protein-protein interactions spanning the cell rather than stochastic, diffusion-controlled processes. Copyright © 2014 Elsevier Ltd. All rights reserved.

Variable disparity estimation based intermediate view reconstruction in dynamic flow allocation over EPON-based access networks

NASA Astrophysics Data System (ADS)

Bae, Kyung-Hoon; Lee, Jungjoon; Kim, Eun-Soo

2008-06-01

In this paper, a variable disparity estimation (VDE)-based intermediate view reconstruction (IVR) in dynamic flow allocation (DFA) over an Ethernet passive optical network (EPON)-based access network is proposed. In the proposed system, the stereoscopic images are estimated by a variable block-matching algorithm (VBMA), and they are transmitted to the receiver through DFA over EPON. This scheme improves a priority-based access network by converting it to a flow-based access network with a new access mechanism and scheduling algorithm, and then 16-view images are synthesized by the IVR using VDE. Some experimental results indicate that the proposed system improves the peak-signal-to-noise ratio (PSNR) to as high as 4.86 dB and reduces the processing time to 3.52 s. Additionally, the network service provider can provide upper limits of transmission delays by the flow. The modeling and simulation results, including mathematical analyses, from this scheme are also provided.

Lost in transportation: Information measures and cognitive limits in multilayer navigation.

PubMed

Gallotti, Riccardo; Porter, Mason A; Barthelemy, Marc

2016-02-01

Cities and their transportation systems become increasingly complex and multimodal as they grow, and it is natural to wonder whether it is possible to quantitatively characterize our difficulty navigating in them and whether such navigation exceeds our cognitive limits. A transition between different search strategies for navigating in metropolitan maps has been observed for large, complex metropolitan networks. This evidence suggests the existence of a limit associated with cognitive overload and caused by a large amount of information that needs to be processed. In this light, we analyzed the world's 15 largest metropolitan networks and estimated the information limit for determining a trip in a transportation system to be on the order of 8 bits. Similar to the "Dunbar number," which represents a limit to the size of an individual's friendship circle, our cognitive limit suggests that maps should not consist of more than 250 connection points to be easily readable. We also show that including connections with other transportation modes dramatically increases the information needed to navigate in multilayer transportation networks. In large cities such as New York, Paris, and Tokyo, more than 80% of the trips are above the 8-bit limit. Multimodal transportation systems in large cities have thus already exceeded human cognitive limits and, consequently, the traditional view of navigation in cities has to be revised substantially.

Lost in transportation: Information measures and cognitive limits in multilayer navigation

PubMed Central

Gallotti, Riccardo; Porter, Mason A.; Barthelemy, Marc

2016-01-01

Cities and their transportation systems become increasingly complex and multimodal as they grow, and it is natural to wonder whether it is possible to quantitatively characterize our difficulty navigating in them and whether such navigation exceeds our cognitive limits. A transition between different search strategies for navigating in metropolitan maps has been observed for large, complex metropolitan networks. This evidence suggests the existence of a limit associated with cognitive overload and caused by a large amount of information that needs to be processed. In this light, we analyzed the world’s 15 largest metropolitan networks and estimated the information limit for determining a trip in a transportation system to be on the order of 8 bits. Similar to the “Dunbar number,” which represents a limit to the size of an individual’s friendship circle, our cognitive limit suggests that maps should not consist of more than 250 connection points to be easily readable. We also show that including connections with other transportation modes dramatically increases the information needed to navigate in multilayer transportation networks. In large cities such as New York, Paris, and Tokyo, more than 80% of the trips are above the 8-bit limit. Multimodal transportation systems in large cities have thus already exceeded human cognitive limits and, consequently, the traditional view of navigation in cities has to be revised substantially. PMID:26989769

An integrative approach to inferring biologically meaningful gene modules.

PubMed

Cho, Ji-Hoon; Wang, Kai; Galas, David J

2011-07-26

The ability to construct biologically meaningful gene networks and modules is critical for contemporary systems biology. Though recent studies have demonstrated the power of using gene modules to shed light on the functioning of complex biological systems, most modules in these networks have shown little association with meaningful biological function. We have devised a method which directly incorporates gene ontology (GO) annotation in construction of gene modules in order to gain better functional association. We have devised a method, Semantic Similarity-Integrated approach for Modularization (SSIM) that integrates various gene-gene pairwise similarity values, including information obtained from gene expression, protein-protein interactions and GO annotations, in the construction of modules using affinity propagation clustering. We demonstrated the performance of the proposed method using data from two complex biological responses: 1. the osmotic shock response in Saccharomyces cerevisiae, and 2. the prion-induced pathogenic mouse model. In comparison with two previously reported algorithms, modules identified by SSIM showed significantly stronger association with biological functions. The incorporation of semantic similarity based on GO annotation with gene expression and protein-protein interaction data can greatly enhance the functional relevance of inferred gene modules. In addition, the SSIM approach can also reveal the hierarchical structure of gene modules to gain a broader functional view of the biological system. Hence, the proposed method can facilitate comprehensive and in-depth analysis of high throughput experimental data at the gene network level.

Machine learning and social network analysis applied to Alzheimer's disease biomarkers.

PubMed

Di Deco, Javier; González, Ana M; Díaz, Julia; Mato, Virginia; García-Frank, Daniel; Álvarez-Linera, Juan; Frank, Ana; Hernández-Tamames, Juan A

2013-01-01

Due to the fact that the number of deaths due Alzheimer is increasing, the scientists have a strong interest in early stage diagnostic of this disease. Alzheimer's patients show different kind of brain alterations, such as morphological, biochemical, functional, etc. Currently, using magnetic resonance imaging techniques is possible to obtain a huge amount of biomarkers; being difficult to appraise which of them can explain more properly how the pathology evolves instead of the normal ageing. Machine Learning methods facilitate an efficient analysis of complex data and can be used to discover which biomarkers are more informative. Moreover, automatic models can learn from historical data to suggest the diagnostic of new patients. Social Network Analysis (SNA) views social relationships in terms of network theory consisting of nodes and connections. The resulting graph-based structures are often very complex; there can be many kinds of connections between the nodes. SNA has emerged as a key technique in modern sociology. It has also gained a significant following in medicine, anthropology, biology, information science, etc., and has become a popular topic of speculation and study. This paper presents a review of machine learning and SNA techniques and then, a new approach to analyze the magnetic resonance imaging biomarkers with these techniques, obtaining relevant relationships that can explain the different phenotypes in dementia, in particular, different stages of Alzheimer's disease.

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

E3Net: a system for exploring E3-mediated regulatory networks of cellular functions.

PubMed

Han, Youngwoong; Lee, Hodong; Park, Jong C; Yi, Gwan-Su

2012-04-01

Ubiquitin-protein ligase (E3) is a key enzyme targeting specific substrates in diverse cellular processes for ubiquitination and degradation. The existing findings of substrate specificity of E3 are, however, scattered over a number of resources, making it difficult to study them together with an integrative view. Here we present E3Net, a web-based system that provides a comprehensive collection of available E3-substrate specificities and a systematic framework for the analysis of E3-mediated regulatory networks of diverse cellular functions. Currently, E3Net contains 2201 E3s and 4896 substrates in 427 organisms and 1671 E3-substrate specific relations between 493 E3s and 1277 substrates in 42 organisms, extracted mainly from MEDLINE abstracts and UniProt comments with an automatic text mining method and additional manual inspection and partly from high throughput experiment data and public ubiquitination databases. The significant functions and pathways of the extracted E3-specific substrate groups were identified from a functional enrichment analysis with 12 functional category resources for molecular functions, protein families, protein complexes, pathways, cellular processes, cellular localization, and diseases. E3Net includes interactive analysis and navigation tools that make it possible to build an integrative view of E3-substrate networks and their correlated functions with graphical illustrations and summarized descriptions. As a result, E3Net provides a comprehensive resource of E3s, substrates, and their functional implications summarized from the regulatory network structures of E3-specific substrate groups and their correlated functions. This resource will facilitate further in-depth investigation of ubiquitination-dependent regulatory mechanisms. E3Net is freely available online at http://pnet.kaist.ac.kr/e3net.

Neural network computer simulation of medical aerosols.

PubMed

Richardson, C J; Barlow, D J

1996-06-01

Preliminary investigations have been conducted to assess the potential for using artificial neural networks to simulate aerosol behaviour, with a view to employing this type of methodology in the evaluation and design of pulmonary drug-delivery systems. Details are presented of the general purpose software developed for these tasks; it implements a feed-forward back-propagation algorithm with weight decay and connection pruning, the user having complete run-time control of the network architecture and mode of training. A series of exploratory investigations is then reported in which different network structures and training strategies are assessed in terms of their ability to simulate known patterns of fluid flow in simple model systems. The first of these involves simulations of cellular automata-generated data for fluid flow through a partially obstructed two-dimensional pipe. The artificial neural networks are shown to be highly successful in simulating the behaviour of this simple linear system, but with important provisos relating to the information content of the training data and the criteria used to judge when the network is properly trained. A second set of investigations is then reported in which similar networks are used to simulate patterns of fluid flow through aerosol generation devices, using training data furnished through rigorous computational fluid dynamics modelling. These more complex three-dimensional systems are modelled with equal success. It is concluded that carefully tailored, well trained networks could provide valuable tools not just for predicting but also for analysing the spatial dynamics of pharmaceutical aerosols.

Applications of neural networks in training science.

PubMed

Pfeiffer, Mark; Hohmann, Andreas

2012-04-01

Training science views itself as an integrated and applied science, developing practical measures founded on scientific method. Therefore, it demands consideration of a wide spectrum of approaches and methods. Especially in the field of competitive sports, research questions are usually located in complex environments, so that mainly field studies are drawn upon to obtain broad external validity. Here, the interrelations between different variables or variable sets are mostly of a nonlinear character. In these cases, methods like neural networks, e.g., the pattern recognizing methods of Self-Organizing Kohonen Feature Maps or similar instruments to identify interactions might be successfully applied to analyze data. Following on from a classification of data analysis methods in training-science research, the aim of the contribution is to give examples of varied sports in which network approaches can be effectually used in training science. First, two examples are given in which neural networks are employed for pattern recognition. While one investigation deals with the detection of sporting talent in swimming, the other is located in game sports research, identifying tactical patterns in team handball. The third and last example shows how an artificial neural network can be used to predict competitive performance in swimming. Copyright © 2011 Elsevier B.V. All rights reserved.

Ionospheric effects during severe space weather events seen in ionospheric service data products

NASA Astrophysics Data System (ADS)

Jakowski, Norbert; Danielides, Michael; Mayer, Christoph; Borries, Claudia

Space weather effects are closely related to complex perturbation processes in the magnetosphere-ionosphere-thermosphere systems, initiated by enhanced solar energy input. To understand and model complex space weather processes, different views on the same subject are helpful. One of the ionosphere key parameters is the Total Electron Content (TEC) which provides a first or-der approximation of the ionospheric range error in Global Navigation Satellite System (GNSS) applications. Additionally, horizontal gradients and time rate of change of TEC are important for estimating the perturbation degree of the ionosphere. TEC maps can effectively be gener-ated using ground based GNSS measurements from global receiver networks. Whereas ground based GNSS measurements provide good horizontal resolution, space based radio occultation measurements can complete the view by providing information on the vertical plasma density distribution. The combination of ground based TEC and vertical sounding measurements pro-vide essential information on the shape of the vertical electron density profile by computing the equivalent slab thickness at the ionosonde station site. Since radio beacon measurements at 150/400 MHz are well suited to trace the horizontal structure of Travelling Ionospheric Dis-turbances (TIDs), these data products essentially complete GNSS based TEC mapping results. Radio scintillation data products, characterising small scale irregularities in the ionosphere, are useful to estimate the continuity and availability of transionospheric radio signals. The different data products are addressed while discussing severe space weather events in the ionosphere e.g. events in October/November 2003. The complementary view of different near real time service data products is helpful to better understand the complex dynamics of ionospheric perturbation processes and to forecast the development of parameters customers are interested in.

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

Visualization Techniques for Computer Network Defense

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

Beaver, Justin M; Steed, Chad A; Patton, Robert M

2011-01-01

Effective visual analysis of computer network defense (CND) information is challenging due to the volume and complexity of both the raw and analyzed network data. A typical CND is comprised of multiple niche intrusion detection tools, each of which performs network data analysis and produces a unique alerting output. The state-of-the-practice in the situational awareness of CND data is the prevalent use of custom-developed scripts by Information Technology (IT) professionals to retrieve, organize, and understand potential threat events. We propose a new visual analytics framework, called the Oak Ridge Cyber Analytics (ORCA) system, for CND data that allows an operatormore » to interact with all detection tool outputs simultaneously. Aggregated alert events are presented in multiple coordinated views with timeline, cluster, and swarm model analysis displays. These displays are complemented with both supervised and semi-supervised machine learning classifiers. The intent of the visual analytics framework is to improve CND situational awareness, to enable an analyst to quickly navigate and analyze thousands of detected events, and to combine sophisticated data analysis techniques with interactive visualization such that patterns of anomalous activities may be more easily identified and investigated.« less

Indian-Ink Perfusion Based Method for Reconstructing Continuous Vascular Networks in Whole Mouse Brain

PubMed Central

Xue, Songchao; Gong, Hui; Jiang, Tao; Luo, Weihua; Meng, Yuanzheng; Liu, Qian; Chen, Shangbin; Li, Anan

2014-01-01

The topology of the cerebral vasculature, which is the energy transport corridor of the brain, can be used to study cerebral circulatory pathways. Limited by the restrictions of the vascular markers and imaging methods, studies on cerebral vascular structure now mainly focus on either observation of the macro vessels in a whole brain or imaging of the micro vessels in a small region. Simultaneous vascular studies of arteries, veins and capillaries have not been achieved in the whole brain of mammals. Here, we have combined the improved gelatin-Indian ink vessel perfusion process with Micro-Optical Sectioning Tomography for imaging the vessel network of an entire mouse brain. With 17 days of work, an integral dataset for the entire cerebral vessels was acquired. The voxel resolution is 0.35×0.4×2.0 µm3 for the whole brain. Besides the observations of fine and complex vascular networks in the reconstructed slices and entire brain views, a representative continuous vascular tracking has been demonstrated in the deep thalamus. This study provided an effective method for studying the entire macro and micro vascular networks of mouse brain simultaneously. PMID:24498247

Recurrence networks from multivariate signals for uncovering dynamic transitions of horizontal oil-water stratified flows

NASA Astrophysics Data System (ADS)

Gao, Zhong-Ke; Zhang, Xin-Wang; Jin, Ning-De; Donner, Reik V.; Marwan, Norbert; Kurths, Jürgen

2013-09-01

Characterizing the mechanism of drop formation at the interface of horizontal oil-water stratified flows is a fundamental problem eliciting a great deal of attention from different disciplines. We experimentally and theoretically investigate the formation and transition of horizontal oil-water stratified flows. We design a new multi-sector conductance sensor and measure multivariate signals from two different stratified flow patterns. Using the Adaptive Optimal Kernel Time-Frequency Representation (AOK TFR) we first characterize the flow behavior from an energy and frequency point of view. Then, we infer multivariate recurrence networks from the experimental data and investigate the cross-transitivity for each constructed network. We find that the cross-transitivity allows quantitatively uncovering the flow behavior when the stratified flow evolves from a stable state to an unstable one and recovers deeper insights into the mechanism governing the formation of droplets at the interface of stratified flows, a task that existing methods based on AOK TFR fail to work. These findings present a first step towards an improved understanding of the dynamic mechanism leading to the transition of horizontal oil-water stratified flows from a complex-network perspective.

Learning-based computing techniques in geoid modeling for precise height transformation

NASA Astrophysics Data System (ADS)

Erol, B.; Erol, S.

2013-03-01

Precise determination of local geoid is of particular importance for establishing height control in geodetic GNSS applications, since the classical leveling technique is too laborious. A geoid model can be accurately obtained employing properly distributed benchmarks having GNSS and leveling observations using an appropriate computing algorithm. Besides the classical multivariable polynomial regression equations (MPRE), this study attempts an evaluation of learning based computing algorithms: artificial neural networks (ANNs), adaptive network-based fuzzy inference system (ANFIS) and especially the wavelet neural networks (WNNs) approach in geoid surface approximation. These algorithms were developed parallel to advances in computer technologies and recently have been used for solving complex nonlinear problems of many applications. However, they are rather new in dealing with precise modeling problem of the Earth gravity field. In the scope of the study, these methods were applied to Istanbul GPS Triangulation Network data. The performances of the methods were assessed considering the validation results of the geoid models at the observation points. In conclusion the ANFIS and WNN revealed higher prediction accuracies compared to ANN and MPRE methods. Beside the prediction capabilities, these methods were also compared and discussed from the practical point of view in conclusions.

Multidimensional Convergence in Future 5G Networks

NASA Astrophysics Data System (ADS)

Ruffini, Marco

2017-02-01

Future 5G services are characterised by unprecedented need for high rate, ubiquitous availability, ultra-low latency and high reliability. The fragmented network view that is widespread in current networks will not stand the challenge posed by next generations of users. A new vision is required, and this paper provides an insight on how network convergence and application-centric approaches will play a leading role towards enabling the 5G vision. The paper, after expressing the view on the need for an end-to-end approach to network design, brings the reader into a journey on the expected 5G network requirements and outlines some of the work currently carried out by main standardisation bodies. It then proposes the use of the concept of network convergence for providing the overall architectural framework to bring together all the different technologies within a unifying and coherent network ecosystem. The novel interpretation of multi-dimensional convergence we introduce leads us to the exploration of aspects of node consolidation and converged network architectures, delving into details of optical-wireless integration and future convergence of optical data centre and access-metro networks. We then discuss how ownership models enabling network sharing will be instrumental in realising the 5G vision. The paper concludes with final remarks on the role SDN will play in 5G and on the need for new business models that reflect the application-centric view of the network. Finally, we provide some insight on growing research areas in 5G networking.

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.

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.

Identifying common pressure pathways from a complex network of human activities to support ecosystem-based management.

PubMed

Knights, Antony M; Koss, Rebecca S; Robinson, Leonie A

2013-06-01

The marine environment is heavily exploited, but unintentional consequences cause wide-ranging negative effects to its characteristics. Linkage frameworks (e.g., DPSIR [driver-pressure-state-impact-response]) are commonly used to describe an interaction between human activities and ecological characteristics of the ecosystem, but as each linkage is viewed independently, the diversity of pressures that affect those characteristics may not be identified or managed effectively. Here we demonstrate an approach for using linkages to build a simple network to capture the complex relationships arising from multiple sectors and their activities. Using data-analysis tools common to ecology, we show how linkages can be placed into mechanistically similar groups. Management measures can be combined into fewer and more simplified measures that target groups of pressures rather than individual pressures, which is likely to increase compliance and the success of the measure while reducing the cost of enforcement. Given that conservation objectives (regional priorities) can vary, we also demonstrate by way of a case study example from the Marine Strategy Framework Directive, how management priorities might change, and illustrate how the approach can be used to identify sectors for control that best support the conservation objectives.

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.

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.

Modelling Peri-Perceptual Brain Processes in a Deep Learning Spiking Neural Network Architecture.

PubMed

Gholami Doborjeh, Zohreh; Kasabov, Nikola; Gholami Doborjeh, Maryam; Sumich, Alexander

2018-06-11

Familiarity of marketing stimuli may affect consumer behaviour at a peri-perceptual processing level. The current study introduces a method for deep learning of electroencephalogram (EEG) data using a spiking neural network (SNN) approach that reveals the complexity of peri-perceptual processes of familiarity. The method is applied to data from 20 participants viewing familiar and unfamiliar logos. The results support the potential of SNN models as novel tools in the exploration of peri-perceptual mechanisms that respond differentially to familiar and unfamiliar stimuli. Specifically, the activation pattern of the time-locked response identified by the proposed SNN model at approximately 200 milliseconds post-stimulus suggests greater connectivity and more widespread dynamic spatio-temporal patterns for familiar than unfamiliar logos. The proposed SNN approach can be applied to study other peri-perceptual or perceptual brain processes in cognitive and computational neuroscience.

Comparison of deep neural networks to spatio-temporal cortical dynamics of human visual object recognition reveals hierarchical correspondence

PubMed Central

Cichy, Radoslaw Martin; Khosla, Aditya; Pantazis, Dimitrios; Torralba, Antonio; Oliva, Aude

2016-01-01

The complex multi-stage architecture of cortical visual pathways provides the neural basis for efficient visual object recognition in humans. However, the stage-wise computations therein remain poorly understood. Here, we compared temporal (magnetoencephalography) and spatial (functional MRI) visual brain representations with representations in an artificial deep neural network (DNN) tuned to the statistics of real-world visual recognition. We showed that the DNN captured the stages of human visual processing in both time and space from early visual areas towards the dorsal and ventral streams. Further investigation of crucial DNN parameters revealed that while model architecture was important, training on real-world categorization was necessary to enforce spatio-temporal hierarchical relationships with the brain. Together our results provide an algorithmically informed view on the spatio-temporal dynamics of visual object recognition in the human visual brain. PMID:27282108

Comparison of deep neural networks to spatio-temporal cortical dynamics of human visual object recognition reveals hierarchical correspondence.

PubMed

Cichy, Radoslaw Martin; Khosla, Aditya; Pantazis, Dimitrios; Torralba, Antonio; Oliva, Aude

2016-06-10

The complex multi-stage architecture of cortical visual pathways provides the neural basis for efficient visual object recognition in humans. However, the stage-wise computations therein remain poorly understood. Here, we compared temporal (magnetoencephalography) and spatial (functional MRI) visual brain representations with representations in an artificial deep neural network (DNN) tuned to the statistics of real-world visual recognition. We showed that the DNN captured the stages of human visual processing in both time and space from early visual areas towards the dorsal and ventral streams. Further investigation of crucial DNN parameters revealed that while model architecture was important, training on real-world categorization was necessary to enforce spatio-temporal hierarchical relationships with the brain. Together our results provide an algorithmically informed view on the spatio-temporal dynamics of visual object recognition in the human visual brain.

Social interaction in synthetic and natural microbial communities.

PubMed

Xavier, Joao B

2011-04-12

Social interaction among cells is essential for multicellular complexity. But how do molecular networks within individual cells confer the ability to interact? And how do those same networks evolve from the evolutionary conflict between individual- and population-level interests? Recent studies have dissected social interaction at the molecular level by analyzing both synthetic and natural microbial populations. These studies shed new light on the role of population structure for the evolution of cooperative interactions and revealed novel molecular mechanisms that stabilize cooperation among cells. New understanding of populations is changing our view of microbial processes, such as pathogenesis and antibiotic resistance, and suggests new ways to fight infection by exploiting social interaction. The study of social interaction is also challenging established paradigms in cancer evolution and immune system dynamics. Finding similar patterns in such diverse systems suggests that the same 'social interaction motifs' may be general to many cell populations.

The Virtual Pelvic Floor, a tele-immersive educational environment.

PubMed Central

Pearl, R. K.; Evenhouse, R.; Rasmussen, M.; Dech, F.; Silverstein, J. C.; Prokasy, S.; Panko, W. B.

1999-01-01

This paper describes the development of the Virtual Pelvic Floor, a new method of teaching the complex anatomy of the pelvic region utilizing virtual reality and advanced networking technology. Virtual reality technology allows improved visualization of three-dimensional structures over conventional media because it supports stereo vision, viewer-centered perspective, large angles of view, and interactivity. Two or more ImmersaDesk systems, drafting table format virtual reality displays, are networked together providing an environment where teacher and students share a high quality three-dimensional anatomical model, and are able to converse, see each other, and to point in three dimensions to indicate areas of interest. This project was realized by the teamwork of surgeons, medical artists and sculptors, computer scientists, and computer visualization experts. It demonstrates the future of virtual reality for surgical education and applications for the Next Generation Internet. Images Figure 1 Figure 2 Figure 3 PMID:10566378

A Suboptimal Power-Saving Transmission Scheme in Multiple Component Carrier Networks

NASA Astrophysics Data System (ADS)

Chung, Yao-Liang; Tsai, Zsehong

Power consumption due to transmissions in base stations (BSs) has been a major contributor to communication-related CO2 emissions. A power optimization model is developed in this study with respect to radio resource allocation and activation in a multiple Component Carrier (CC) environment. We formulate and solve the power-minimization problem of the BS transceivers for multiple-CC networks with carrier aggregation, while maintaining the overall system and respective users' utilities above minimum levels. The optimized power consumption based on this model can be viewed as a lower bound of that of other algorithms employed in practice. A suboptimal scheme with low computation complexity is proposed. Numerical results show that the power consumption of our scheme is much better than that of the conventional one in which all CCs are always active, if both schemes maintain the same required utilities.

A unified view on weakly correlated recurrent networks

PubMed Central

Grytskyy, Dmytro; Tetzlaff, Tom; Diesmann, Markus; Helias, Moritz

2013-01-01

The diversity of neuron models used in contemporary theoretical neuroscience to investigate specific properties of covariances in the spiking activity raises the question how these models relate to each other. In particular it is hard to distinguish between generic properties of covariances and peculiarities due to the abstracted model. Here we present a unified view on pairwise covariances in recurrent networks in the irregular regime. We consider the binary neuron model, the leaky integrate-and-fire (LIF) model, and the Hawkes process. We show that linear approximation maps each of these models to either of two classes of linear rate models (LRM), including the Ornstein–Uhlenbeck process (OUP) as a special case. The distinction between both classes is the location of additive noise in the rate dynamics, which is located on the output side for spiking models and on the input side for the binary model. Both classes allow closed form solutions for the covariance. For output noise it separates into an echo term and a term due to correlated input. The unified framework enables us to transfer results between models. For example, we generalize the binary model and the Hawkes process to the situation with synaptic conduction delays and simplify derivations for established results. Our approach is applicable to general network structures and suitable for the calculation of population averages. The derived averages are exact for fixed out-degree network architectures and approximate for fixed in-degree. We demonstrate how taking into account fluctuations in the linearization procedure increases the accuracy of the effective theory and we explain the class dependent differences between covariances in the time and the frequency domain. Finally we show that the oscillatory instability emerging in networks of LIF models with delayed inhibitory feedback is a model-invariant feature: the same structure of poles in the complex frequency plane determines the population power spectra. PMID:24151463

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.

Surgical model-view-controller simulation software framework for local and collaborative applications

PubMed Central

Sankaranarayanan, Ganesh; Halic, Tansel; Arikatla, Venkata Sreekanth; Lu, Zhonghua; De, Suvranu

2010-01-01

Purpose Surgical simulations require haptic interactions and collaboration in a shared virtual environment. A software framework for decoupled surgical simulation based on a multi-controller and multi-viewer model-view-controller (MVC) pattern was developed and tested. Methods A software framework for multimodal virtual environments was designed, supporting both visual interactions and haptic feedback while providing developers with an integration tool for heterogeneous architectures maintaining high performance, simplicity of implementation, and straightforward extension. The framework uses decoupled simulation with updates of over 1,000 Hz for haptics and accommodates networked simulation with delays of over 1,000 ms without performance penalty. Results The simulation software framework was implemented and was used to support the design of virtual reality-based surgery simulation systems. The framework supports the high level of complexity of such applications and the fast response required for interaction with haptics. The efficacy of the framework was tested by implementation of a minimally invasive surgery simulator. Conclusion A decoupled simulation approach can be implemented as a framework to handle simultaneous processes of the system at the various frame rates each process requires. The framework was successfully used to develop collaborative virtual environments (VEs) involving geographically distributed users connected through a network, with the results comparable to VEs for local users. PMID:20714933

Surgical model-view-controller simulation software framework for local and collaborative applications.

PubMed

Maciel, Anderson; Sankaranarayanan, Ganesh; Halic, Tansel; Arikatla, Venkata Sreekanth; Lu, Zhonghua; De, Suvranu

2011-07-01

Surgical simulations require haptic interactions and collaboration in a shared virtual environment. A software framework for decoupled surgical simulation based on a multi-controller and multi-viewer model-view-controller (MVC) pattern was developed and tested. A software framework for multimodal virtual environments was designed, supporting both visual interactions and haptic feedback while providing developers with an integration tool for heterogeneous architectures maintaining high performance, simplicity of implementation, and straightforward extension. The framework uses decoupled simulation with updates of over 1,000 Hz for haptics and accommodates networked simulation with delays of over 1,000 ms without performance penalty. The simulation software framework was implemented and was used to support the design of virtual reality-based surgery simulation systems. The framework supports the high level of complexity of such applications and the fast response required for interaction with haptics. The efficacy of the framework was tested by implementation of a minimally invasive surgery simulator. A decoupled simulation approach can be implemented as a framework to handle simultaneous processes of the system at the various frame rates each process requires. The framework was successfully used to develop collaborative virtual environments (VEs) involving geographically distributed users connected through a network, with the results comparable to VEs for local users.

New neural-networks-based 3D object recognition system

NASA Astrophysics Data System (ADS)

Abolmaesumi, Purang; Jahed, M.

1997-09-01

Three-dimensional object recognition has always been one of the challenging fields in computer vision. In recent years, Ulman and Basri (1991) have proposed that this task can be done by using a database of 2-D views of the objects. The main problem in their proposed system is that the correspondent points should be known to interpolate the views. On the other hand, their system should have a supervisor to decide which class does the represented view belong to. In this paper, we propose a new momentum-Fourier descriptor that is invariant to scale, translation, and rotation. This descriptor provides the input feature vectors to our proposed system. By using the Dystal network, we show that the objects can be classified with over 95% precision. We have used this system to classify the objects like cube, cone, sphere, torus, and cylinder. Because of the nature of the Dystal network, this system reaches to its stable point by a single representation of the view to the system. This system can also classify the similar views to a single class (e.g., for the cube, the system generated 9 different classes for 50 different input views), which can be used to select an optimum database of training views. The system is also very flexible to the noise and deformed views.

Test-retest reliability of functional connectivity networks during naturalistic fMRI paradigms.

PubMed

Wang, Jiahui; Ren, Yudan; Hu, Xintao; Nguyen, Vinh Thai; Guo, Lei; Han, Junwei; Guo, Christine Cong

2017-04-01

Functional connectivity analysis has become a powerful tool for probing the human brain function and its breakdown in neuropsychiatry disorders. So far, most studies adopted resting-state paradigm to examine functional connectivity networks in the brain, thanks to its low demand and high tolerance that are essential for clinical studies. However, the test-retest reliability of resting-state connectivity measures is moderate, potentially due to its low behavioral constraint. On the other hand, naturalistic neuroimaging paradigms, an emerging approach for cognitive neuroscience with high ecological validity, could potentially improve the reliability of functional connectivity measures. To test this hypothesis, we characterized the test-retest reliability of functional connectivity measures during a natural viewing condition, and benchmarked it against resting-state connectivity measures acquired within the same functional magnetic resonance imaging (fMRI) session. We found that the reliability of connectivity and graph theoretical measures of brain networks is significantly improved during natural viewing conditions over resting-state conditions, with an average increase of almost 50% across various connectivity measures. Not only sensory networks for audio-visual processing become more reliable, higher order brain networks, such as default mode and attention networks, but also appear to show higher reliability during natural viewing. Our results support the use of natural viewing paradigms in estimating functional connectivity of brain networks, and have important implications for clinical application of fMRI. Hum Brain Mapp 38:2226-2241, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Empirical confirmation of creative destruction from world trade data.

PubMed

Klimek, Peter; Hausmann, Ricardo; Thurner, Stefan

2012-01-01

We show that world trade network datasets contain empirical evidence that the dynamics of innovation in the world economy indeed follows the concept of creative destruction, as proposed by J.A. Schumpeter more than half a century ago. National economies can be viewed as complex, evolving systems, driven by a stream of appearance and disappearance of goods and services. Products appear in bursts of creative cascades. We find that products systematically tend to co-appear, and that product appearances lead to massive disappearance events of existing products in the following years. The opposite-disappearances followed by periods of appearances-is not observed. This is an empirical validation of the dominance of cascading competitive replacement events on the scale of national economies, i.e., creative destruction. We find a tendency that more complex products drive out less complex ones, i.e., progress has a direction. Finally we show that the growth trajectory of a country's product output diversity can be understood by a recently proposed evolutionary model of Schumpeterian economic dynamics.

Empirical Confirmation of Creative Destruction from World Trade Data

PubMed Central

Klimek, Peter; Hausmann, Ricardo; Thurner, Stefan

2012-01-01

We show that world trade network datasets contain empirical evidence that the dynamics of innovation in the world economy indeed follows the concept of creative destruction, as proposed by J.A. Schumpeter more than half a century ago. National economies can be viewed as complex, evolving systems, driven by a stream of appearance and disappearance of goods and services. Products appear in bursts of creative cascades. We find that products systematically tend to co-appear, and that product appearances lead to massive disappearance events of existing products in the following years. The opposite–disappearances followed by periods of appearances–is not observed. This is an empirical validation of the dominance of cascading competitive replacement events on the scale of national economies, i.e., creative destruction. We find a tendency that more complex products drive out less complex ones, i.e., progress has a direction. Finally we show that the growth trajectory of a country’s product output diversity can be understood by a recently proposed evolutionary model of Schumpeterian economic dynamics. PMID:22719989

Cybersecurity vulnerabilities in medical devices: a complex environment and multifaceted problem

PubMed Central

Williams, Patricia AH; Woodward, Andrew J

2015-01-01

The increased connectivity to existing computer networks has exposed medical devices to cybersecurity vulnerabilities from which they were previously shielded. For the prevention of cybersecurity incidents, it is important to recognize the complexity of the operational environment as well as to catalog the technical vulnerabilities. Cybersecurity protection is not just a technical issue; it is a richer and more intricate problem to solve. A review of the factors that contribute to such a potentially insecure environment, together with the identification of the vulnerabilities, is important for understanding why these vulnerabilities persist and what the solution space should look like. This multifaceted problem must be viewed from a systemic perspective if adequate protection is to be put in place and patient safety concerns addressed. This requires technical controls, governance, resilience measures, consolidated reporting, context expertise, regulation, and standards. It is evident that a coordinated, proactive approach to address this complex challenge is essential. In the interim, patient safety is under threat. PMID:26229513

Cybersecurity vulnerabilities in medical devices: a complex environment and multifaceted problem.

PubMed

Williams, Patricia Ah; Woodward, Andrew J

2015-01-01

The increased connectivity to existing computer networks has exposed medical devices to cybersecurity vulnerabilities from which they were previously shielded. For the prevention of cybersecurity incidents, it is important to recognize the complexity of the operational environment as well as to catalog the technical vulnerabilities. Cybersecurity protection is not just a technical issue; it is a richer and more intricate problem to solve. A review of the factors that contribute to such a potentially insecure environment, together with the identification of the vulnerabilities, is important for understanding why these vulnerabilities persist and what the solution space should look like. This multifaceted problem must be viewed from a systemic perspective if adequate protection is to be put in place and patient safety concerns addressed. This requires technical controls, governance, resilience measures, consolidated reporting, context expertise, regulation, and standards. It is evident that a coordinated, proactive approach to address this complex challenge is essential. In the interim, patient safety is under threat.

The ground truth about metadata and community detection in networks.

PubMed

Peel, Leto; Larremore, Daniel B; Clauset, Aaron

2017-05-01

Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate the performance of community detection algorithms by their ability to find so-called ground truth communities. This works well in synthetic networks with planted communities because these networks' links are formed explicitly based on those known communities. However, there are no planted communities in real-world networks. Instead, it is standard practice to treat some observed discrete-valued node attributes, or metadata, as ground truth. We show that metadata are not the same as ground truth and that treating them as such induces severe theoretical and practical problems. We prove that no algorithm can uniquely solve community detection, and we prove a general No Free Lunch theorem for community detection, which implies that there can be no algorithm that is optimal for all possible community detection tasks. However, community detection remains a powerful tool and node metadata still have value, so a careful exploration of their relationship with network structure can yield insights of genuine worth. We illustrate this point by introducing two statistical techniques that can quantify the relationship between metadata and community structure for a broad class of models. We demonstrate these techniques using both synthetic and real-world networks, and for multiple types of metadata and community structures.

Goal-seeking neural net for recall and recognition

NASA Astrophysics Data System (ADS)

Omidvar, Omid M.

1990-07-01

Neural networks have been used to mimic cognitive processes which take place in animal brains. The learning capability inherent in neural networks makes them suitable candidates for adaptive tasks such as recall and recognition. The synaptic reinforcements create a proper condition for adaptation, which results in memorization, formation of perception, and higher order information processing activities. In this research a model of a goal seeking neural network is studied and the operation of the network with regard to recall and recognition is analyzed. In these analyses recall is defined as retrieval of stored information where little or no matching is involved. On the other hand recognition is recall with matching; therefore it involves memorizing a piece of information with complete presentation. This research takes the generalized view of reinforcement in which all the signals are potential reinforcers. The neuronal response is considered to be the source of the reinforcement. This local approach to adaptation leads to the goal seeking nature of the neurons as network components. In the proposed model all the synaptic strengths are reinforced in parallel while the reinforcement among the layers is done in a distributed fashion and pipeline mode from the last layer inward. A model of complex neuron with varying threshold is developed to account for inhibitory and excitatory behavior of real neuron. A goal seeking model of a neural network is presented. This network is utilized to perform recall and recognition tasks. The performance of the model with regard to the assigned tasks is presented.

Visualizing blood vessel trees in three dimensions: clinical applications

NASA Astrophysics Data System (ADS)

Bullitt, Elizabeth; Aylward, Stephen

2005-04-01

A connected network of blood vessels surrounds and permeates almost every organ of the human body. The ability to define detailed blood vessel trees enables a variety of clinical applications. This paper discusses four such applications and some of the visualization challenges inherent to each. Guidance of endovascular surgery: 3D vessel trees offer important information unavailable by traditional x-ray projection views. How best to combine the 2- and 3D image information is unknown. Planning/guidance of tumor surgery: During tumor resection it is critical to know which blood vessels can be interrupted safely and which cannot. Providing efficient, clear information to the surgeon together with measures of uncertainty in both segmentation and registration can be a complex problem. Vessel-based registration: Vessel-based registration allows pre-and intraoperative images to be registered rapidly. The approach both provides a potential solution to a difficult clinical dilemma and offers a variety of visualization opportunities. Diagnosis/staging of disease: Almost every disease affects blood vessel morphology. The statistical analysis of vessel shape may thus prove to be an important tool in the noninvasive analysis of disease. A plethora of information is available that must be presented meaningfully to the clinician. As medical image analysis methods increase in sophistication, an increasing amount of useful information of varying types will become available to the clinician. New methods must be developed to present a potentially bewildering amount of complex data to individuals who are often accustomed to viewing only tissue slices or flat projection views.

A framework for cross-observatory volcanological database management

NASA Astrophysics Data System (ADS)

Aliotta, Marco Antonio; Amore, Mauro; Cannavò, Flavio; Cassisi, Carmelo; D'Agostino, Marcello; Dolce, Mario; Mastrolia, Andrea; Mangiagli, Salvatore; Messina, Giuseppe; Montalto, Placido; Fabio Pisciotta, Antonino; Prestifilippo, Michele; Rossi, Massimo; Scarpato, Giovanni; Torrisi, Orazio

2017-04-01

In the last years, it has been clearly shown how the multiparametric approach is the winning strategy to investigate the complex dynamics of the volcanic systems. This involves the use of different sensor networks, each one dedicated to the acquisition of particular data useful for research and monitoring. The increasing interest devoted to the study of volcanological phenomena led the constitution of different research organizations or observatories, also relative to the same volcanoes, which acquire large amounts of data from sensor networks for the multiparametric monitoring. At INGV we developed a framework, hereinafter called TSDSystem (Time Series Database System), which allows to acquire data streams from several geophysical and geochemical permanent sensor networks (also represented by different data sources such as ASCII, ODBC, URL etc.), located on the main volcanic areas of Southern Italy, and relate them within a relational database management system. Furthermore, spatial data related to different dataset are managed using a GIS module for sharing and visualization purpose. The standardization provides the ability to perform operations, such as query and visualization, of many measures synchronizing them using a common space and time scale. In order to share data between INGV observatories, and also with Civil Protection, whose activity is related on the same volcanic districts, we designed a "Master View" system that, starting from the implementation of a number of instances of the TSDSystem framework (one for each observatory), makes possible the joint interrogation of data, both temporal and spatial, on instances located in different observatories, through the use of web services technology (RESTful, SOAP). Similarly, it provides metadata for equipment using standard schemas (such as FDSN StationXML). The "Master View" is also responsible for managing the data policy through a "who owns what" system, which allows you to associate viewing/download of spatial or time intervals to particular users or groups.

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

PubMed

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

2018-04-24

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

A main path domain map as digital library interface

NASA Astrophysics Data System (ADS)

Demaine, Jeffrey

2009-01-01

The shift to electronic publishing of scientific journals is an opportunity for the digital library to provide non-traditional ways of accessing the literature. One method is to use citation metadata drawn from a collection of electronic journals to generate maps of science. These maps visualize the communication patterns in the collection, giving the user an easy-tograsp view of the semantic structure underlying the scientific literature. For this visualization to be understandable the complexity of the citation network must be reduced through an algorithm. This paper describes the Citation Pathfinder application and its integration into a prototype digital library. This application generates small-scale citation networks that expand upon the search results of the digital library. These domain maps are linked to the collection, creating an interface that is based on the communication patterns in science. The Main Path Analysis technique is employed to simplify these networks into linear, sequential structures. By identifying patterns that characterize the evolution of the research field, Citation Pathfinder uses citations to give users a deeper understanding of the scientific literature.

Modeling cancer metabolism on a genome scale

PubMed Central

Yizhak, Keren; Chaneton, Barbara; Gottlieb, Eyal; Ruppin, Eytan

2015-01-01

Cancer cells have fundamentally altered cellular metabolism that is associated with their tumorigenicity and malignancy. In addition to the widely studied Warburg effect, several new key metabolic alterations in cancer have been established over the last decade, leading to the recognition that altered tumor metabolism is one of the hallmarks of cancer. Deciphering the full scope and functional implications of the dysregulated metabolism in cancer requires both the advancement of a variety of omics measurements and the advancement of computational approaches for the analysis and contextualization of the accumulated data. Encouragingly, while the metabolic network is highly interconnected and complex, it is at the same time probably the best characterized cellular network. Following, this review discusses the challenges that genome-scale modeling of cancer metabolism has been facing. We survey several recent studies demonstrating the first strides that have been done, testifying to the value of this approach in portraying a network-level view of the cancer metabolism and in identifying novel drug targets and biomarkers. Finally, we outline a few new steps that may further advance this field. PMID:26130389

Functional modules of sigma factor regulons guarantee adaptability and evolvability

PubMed Central

Binder, Sebastian C.; Eckweiler, Denitsa; Schulz, Sebastian; Bielecka, Agata; Nicolai, Tanja; Franke, Raimo; Häussler, Susanne; Meyer-Hermann, Michael

2016-01-01

The focus of modern molecular biology turns from assigning functions to individual genes towards understanding the expression and regulation of complex sets of molecules. Here, we provide evidence that alternative sigma factor regulons in the pathogen Pseudomonas aeruginosa largely represent insulated functional modules which provide a critical level of biological organization involved in general adaptation and survival processes. Analysis of the operational state of the sigma factor network revealed that transcription factors functionally couple the sigma factor regulons and significantly modulate the transcription levels in the face of challenging environments. The threshold quality of newly evolved transcription factors was reached faster and more robustly in in silico testing when the structural organization of sigma factor networks was taken into account. These results indicate that the modular structures of alternative sigma factor regulons provide P. aeruginosa with a robust framework to function adequately in its environment and at the same time facilitate evolutionary change. Our data support the view that widespread modularity guarantees robustness of biological networks and is a key driver of evolvability. PMID:26915971

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

NASA Astrophysics Data System (ADS)

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

2015-11-01

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

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

PubMed

Gao, Zhongke; Jin, Ningde

2009-06-01

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

A Novel BA Complex Network Model on Color Template Matching

PubMed Central

Han, Risheng; Yue, Guangxue; Ding, Hui

2014-01-01

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

A novel BA complex network model on color template matching.

PubMed

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

2014-01-01

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

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

PubMed Central

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

2013-01-01

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

Systems Biology Perspectives on Minimal and Simpler Cells

PubMed Central

Xavier, Joana C.; Patil, Kiran Raosaheb

2014-01-01

SUMMARY The concept of the minimal cell has fascinated scientists for a long time, from both fundamental and applied points of view. This broad concept encompasses extreme reductions of genomes, the last universal common ancestor (LUCA), the creation of semiartificial cells, and the design of protocells and chassis cells. Here we review these different areas of research and identify common and complementary aspects of each one. We focus on systems biology, a discipline that is greatly facilitating the classical top-down and bottom-up approaches toward minimal cells. In addition, we also review the so-called middle-out approach and its contributions to the field with mathematical and computational models. Owing to the advances in genomics technologies, much of the work in this area has been centered on minimal genomes, or rather minimal gene sets, required to sustain life. Nevertheless, a fundamental expansion has been taking place in the last few years wherein the minimal gene set is viewed as a backbone of a more complex system. Complementing genomics, progress is being made in understanding the system-wide properties at the levels of the transcriptome, proteome, and metabolome. Network modeling approaches are enabling the integration of these different omics data sets toward an understanding of the complex molecular pathways connecting genotype to phenotype. We review key concepts central to the mapping and modeling of this complexity, which is at the heart of research on minimal cells. Finally, we discuss the distinction between minimizing the number of cellular components and minimizing cellular complexity, toward an improved understanding and utilization of minimal and simpler cells. PMID:25184563

Divide and conquer: intermediate levels of population fragmentation maximize cultural accumulation.

PubMed

Derex, Maxime; Perreault, Charles; Boyd, Robert

2018-04-05

Identifying the determinants of cumulative cultural evolution is a key issue in the interdisciplinary field of cultural evolution. A widely held view is that large and well-connected social networks facilitate cumulative cultural evolution because they promote the spread of useful cultural traits and prevent the loss of cultural knowledge through factors such as drift. This view stems from models that focus on the transmission of cultural information, without considering how new cultural traits actually arise. In this paper, we review the literature from various fields that suggest that, under some circumstances, increased connectedness can decrease cultural diversity and reduce innovation rates. Incorporating this idea into an agent-based model, we explore the effect of population fragmentation on cumulative culture and show that, for a given population size, there exists an intermediate level of population fragmentation that maximizes the rate of cumulative cultural evolution. This result is explained by the fact that fully connected, non-fragmented populations are able to maintain complex cultural traits but produce insufficient variation and so lack the cultural diversity required to produce highly complex cultural traits. Conversely, highly fragmented populations produce a variety of cultural traits but cannot maintain complex ones. In populations with intermediate levels of fragmentation, cultural loss and cultural diversity are balanced in a way that maximizes cultural complexity. Our results suggest that population structure needs to be taken into account when investigating the relationship between demography and cumulative culture.This article is part of the theme issue 'Bridging cultural gaps: interdisciplinary studies in human cultural evolution'. © 2018 The Author(s).

Minimal perceptrons for memorizing complex patterns

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

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

PubMed

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

2012-06-21

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

Western and Eastern Views on Social Networks

ERIC Educational Resources Information Center

Ordonez de Pablos, Patricia

2005-01-01

Purpose: The aim of this paper is to examine social networks from a Western and Eastern view. Design/methodology/approach: The paper uses case study methodology to gather evidence of how world pioneering firms from Asia and Europe measure and report their social connections from a Western perspective. Findings: It examined the basic indicators…

Barrier Coverage for 3D Camera Sensor Networks

PubMed Central

Wu, Chengdong; Zhang, Yunzhou; Jia, Zixi; Ji, Peng; Chu, Hao

2017-01-01

Barrier coverage, an important research area with respect to camera sensor networks, consists of a number of camera sensors to detect intruders that pass through the barrier area. Existing works on barrier coverage such as local face-view barrier coverage and full-view barrier coverage typically assume that each intruder is considered as a point. However, the crucial feature (e.g., size) of the intruder should be taken into account in the real-world applications. In this paper, we propose a realistic resolution criterion based on a three-dimensional (3D) sensing model of a camera sensor for capturing the intruder’s face. Based on the new resolution criterion, we study the barrier coverage of a feasible deployment strategy in camera sensor networks. Performance results demonstrate that our barrier coverage with more practical considerations is capable of providing a desirable surveillance level. Moreover, compared with local face-view barrier coverage and full-view barrier coverage, our barrier coverage is more reasonable and closer to reality. To the best of our knowledge, our work is the first to propose barrier coverage for 3D camera sensor networks. PMID:28771167

Barrier Coverage for 3D Camera Sensor Networks.

PubMed

Si, Pengju; Wu, Chengdong; Zhang, Yunzhou; Jia, Zixi; Ji, Peng; Chu, Hao

2017-08-03

Barrier coverage, an important research area with respect to camera sensor networks, consists of a number of camera sensors to detect intruders that pass through the barrier area. Existing works on barrier coverage such as local face-view barrier coverage and full-view barrier coverage typically assume that each intruder is considered as a point. However, the crucial feature (e.g., size) of the intruder should be taken into account in the real-world applications. In this paper, we propose a realistic resolution criterion based on a three-dimensional (3D) sensing model of a camera sensor for capturing the intruder's face. Based on the new resolution criterion, we study the barrier coverage of a feasible deployment strategy in camera sensor networks. Performance results demonstrate that our barrier coverage with more practical considerations is capable of providing a desirable surveillance level. Moreover, compared with local face-view barrier coverage and full-view barrier coverage, our barrier coverage is more reasonable and closer to reality. To the best of our knowledge, our work is the first to propose barrier coverage for 3D camera sensor networks.

Context view looking north from shoulder of railroad tracks. View ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

Context view looking north from shoulder of railroad tracks. View includes railroad tracks on right. Farmhouse complex on left, and barn complex in distance. - Kosai Farm, B Street north of Northwest Twenty-ninth Street, Auburn, King County, WA

Advances in the Theory of Complex Networks

NASA Astrophysics Data System (ADS)

Peruani, Fernando

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

Complex network construction based on user group attention sequence

NASA Astrophysics Data System (ADS)

Zhang, Gaowei; Xu, Lingyu; Wang, Lei

2018-04-01

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

Identification of hybrid node and link communities in complex networks

PubMed Central

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

2015-01-01

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

Identification of hybrid node and link communities in complex networks.

PubMed

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

2015-03-02

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

Identification of hybrid node and link communities in complex networks

NASA Astrophysics Data System (ADS)

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

2015-03-01

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

Online Community Detection for Large Complex Networks

PubMed Central

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

2014-01-01

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

Pruning artificial neural networks using neural complexity measures.

PubMed

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

2008-10-01

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

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

PubMed

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

2016-05-01

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

Using complex networks to characterize international business cycles.

PubMed

Caraiani, Petre

2013-01-01

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

Charting epilepsy by searching for intelligence in network space with the help of evolving autonomous agents.

PubMed

Ohayon, Elan L; Kalitzin, Stiliyan; Suffczynski, Piotr; Jin, Frank Y; Tsang, Paul W; Borrett, Donald S; Burnham, W McIntyre; Kwan, Hon C

2004-01-01

The problem of demarcating neural network space is formidable. A simple fully connected recurrent network of five units (binary activations, synaptic weight resolution of 10) has 3.2 *10(26) possible initial states. The problem increases drastically with scaling. Here we consider three complementary approaches to help direct the exploration to distinguish epileptic from healthy networks. [1] First, we perform a gross mapping of the space of five-unit continuous recurrent networks using randomized weights and initial activations. The majority of weight patterns (>70%) were found to result in neural assemblies exhibiting periodic limit-cycle oscillatory behavior. [2] Next we examine the activation space of non-periodic networks demonstrating that the emergence of paroxysmal activity does not require changes in connectivity. [3] The next challenge is to focus the search of network space to identify networks with more complex dynamics. Here we rely on a major available indicator critical to clinical assessment but largely ignored by epilepsy modelers, namely: behavioral states. To this end, we connected the above network layout to an external robot in which interactive states were evolved. The first random generation showed a distribution in line with approach [1]. That is, the predominate phenotypes were fixed-point or oscillatory with seizure-like motor output. As evolution progressed the profile changed markedly. Within 20 generations the entire population was able to navigate a simple environment with all individuals exhibiting multiply-stable behaviors with no cases of default locked limit-cycle oscillatory motor behavior. The resultant population may thus afford us a view of the architectural principles demarcating healthy biological networks from the pathological. The approach has an advantage over other epilepsy modeling techniques in providing a way to clarify whether observed dynamics or suggested therapies are pointing to computational viability or dead space.

Will you accept the government's friend request? Social networks and privacy concerns.

PubMed

Siegel, David A

2013-01-01

Participating in social network websites entails voluntarily sharing private information, and the explosive growth of social network websites over the last decade suggests shifting views on privacy. Concurrently, new anti-terrorism laws, such as the USA Patriot Act, ask citizens to surrender substantial claim to privacy in the name of greater security. I address two important questions regarding individuals' views on privacy raised by these trends. First, how does prompting individuals to consider security concerns affect their views on government actions that jeopardize privacy? Second, does the use of social network websites alter the effect of prompted security concerns? I posit that prompting individuals to consider security concerns does lead to an increased willingness to accept government actions that jeopardize privacy, but that frequent users of websites like Facebook are less likely to be swayed by prompted security concerns. An embedded survey experiment provides support for both parts of my claim.

Will You Accept the Government's Friend Request? Social Networks and Privacy Concerns

PubMed Central

Siegel, David A.

2013-01-01

Participating in social network websites entails voluntarily sharing private information, and the explosive growth of social network websites over the last decade suggests shifting views on privacy. Concurrently, new anti-terrorism laws, such as the USA Patriot Act, ask citizens to surrender substantial claim to privacy in the name of greater security. I address two important questions regarding individuals' views on privacy raised by these trends. First, how does prompting individuals to consider security concerns affect their views on government actions that jeopardize privacy? Second, does the use of social network websites alter the effect of prompted security concerns? I posit that prompting individuals to consider security concerns does lead to an increased willingness to accept government actions that jeopardize privacy, but that frequent users of websites like Facebook are less likely to be swayed by prompted security concerns. An embedded survey experiment provides support for both parts of my claim. PMID:24312236

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

PubMed

Le, Duc-Hau

2015-01-01

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

Gamma oscillations in a nonlinear regime: a minimal model approach using heterogeneous integrate-and-fire networks.

PubMed

Bathellier, Brice; Carleton, Alan; Gerstner, Wulfram

2008-12-01

Fast oscillations and in particular gamma-band oscillation (20-80 Hz) are commonly observed during brain function and are at the center of several neural processing theories. In many cases, mathematical analysis of fast oscillations in neural networks has been focused on the transition between irregular and oscillatory firing viewed as an instability of the asynchronous activity. But in fact, brain slice experiments as well as detailed simulations of biological neural networks have produced a large corpus of results concerning the properties of fully developed oscillations that are far from this transition point. We propose here a mathematical approach to deal with nonlinear oscillations in a network of heterogeneous or noisy integrate-and-fire neurons connected by strong inhibition. This approach involves limited mathematical complexity and gives a good sense of the oscillation mechanism, making it an interesting tool to understand fast rhythmic activity in simulated or biological neural networks. A surprising result of our approach is that under some conditions, a change of the strength of inhibition only weakly influences the period of the oscillation. This is in contrast to standard theoretical and experimental models of interneuron network gamma oscillations (ING), where frequency tightly depends on inhibition strength, but it is similar to observations made in some in vitro preparations in the hippocampus and the olfactory bulb and in some detailed network models. This result is explained by the phenomenon of suppression that is known to occur in strongly coupled oscillating inhibitory networks but had not yet been related to the behavior of oscillation frequency.

Local and global responses in complex gene regulation networks

NASA Astrophysics Data System (ADS)

Tsuchiya, Masa; Selvarajoo, Kumar; Piras, Vincent; Tomita, Masaru; Giuliani, Alessandro

2009-04-01

An exacerbated sensitivity to apparently minor stimuli and a general resilience of the entire system stay together side-by-side in biological systems. This apparent paradox can be explained by the consideration of biological systems as very strongly interconnected network systems. Some nodes of these networks, thanks to their peculiar location in the network architecture, are responsible for the sensitivity aspects, while the large degree of interconnection is at the basis of the resilience properties of the system. One relevant feature of the high degree of connectivity of gene regulation networks is the emergence of collective ordered phenomena influencing the entire genome and not only a specific portion of transcripts. The great majority of existing gene regulation models give the impression of purely local ‘hard-wired’ mechanisms disregarding the emergence of global ordered behavior encompassing thousands of genes while the general, genome wide, aspects are less known. Here we address, on a data analysis perspective, the discrimination between local and global scale regulations, this goal was achieved by means of the examination of two biological systems: innate immune response in macrophages and oscillating growth dynamics in yeast. Our aim was to reconcile the ‘hard-wired’ local view of gene regulation with a global continuous and scalable one borrowed from statistical physics. This reconciliation is based on the network paradigm in which the local ‘hard-wired’ activities correspond to the activation of specific crucial nodes in the regulation network, while the scalable continuous responses can be equated to the collective oscillations of the network after a perturbation.

The Influence of Social Networking Photos on Social Norms and Sexual Health Behaviors

PubMed Central

Jordan, Alexander H.

2013-01-01

Abstract Two studies tested whether online social networking technologies influence health behavioral social norms, and in turn, personal health behavioral intentions. In Study 1, experimental participants browsed peers' Facebook photos on a college network with a low prevalence of sexually suggestive content. Participants estimated the percentage of their peers who have sex without condoms, and rated their own future intentions to use condoms. Experimental participants, compared to controls who did not view photos, estimated that a larger percentage of their peers use condoms, and indicated a greater intention to use condoms themselves in the future. In Study 2, participants were randomly assigned to view sexually suggestive or nonsexually suggestive Facebook photos, and responded to sexual risk behavioral questions. Compared to participants viewing nonsuggestive photos, those who viewed sexually suggestive Facebook photos estimated that a larger percentage of their peers have unprotected sexual intercourse and sex with strangers and were more likely to report that they themselves would engage in these behaviors. Thus, online social networks can influence perceptions of the peer prevalence of sexual risk behaviors, and can influence users' own intentions with regard to such behaviors. These studies suggest the potential power of social networks to affect health behaviors by altering perceptions of peer norms. PMID:23438268

Bridging the Host-Network Divide: Survey, Taxonomy, and Solution

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

Fink, Glenn A.; Duggirala, Vedavyas; Correa, Ricardo

2007-04-17

Abstract: "This paper presents a new direction in security awareness tools for system administration--the Host-Network (HoNe) Visualizer. Our requirements for the HoNe Visualizer come from needs system administrators expressed in interviews, from reviewing the literature, and from conducting usability studies with prototypes. We present a tool taxonomy that serves as a framework for our literature review, and we use the taxonomy to show what is missing in the administrator's arsenal. Then we unveil our tool and its supporting infrastructure that we believe will fill the empty niche. We found that most security tools provide either an internal view of amore » host or an external view of traffic on a network. Our interviewees revealed how they must construct a mental end-to-end view from separate tools that individually give an incomplete view, expending valuable time and mental effort. Because of limitations designed into TCP/IP [RFC-791, RFC-793], no tool can effectively correlate host and network data into an end-to-end view without kernel modifications. Currently, no other visualization exists to support end-to-end analysis. But HoNe's infrastructure overcomes TCP/IP's limitations bridging the network and transport layers in the network stack and making end-to-end correlation possible. The capstone is the HoNe Visualizer that amplifies the users' cognitive power and reduces their mental workload by illustrating the correlated data graphically. Users said HoNe would be particularly good for discovering day-zero exploits. Our usability study revealed that users performed better on intrusion detection tasks using our visualization than with tools they were accustomed to using regardless of their experience level."« less

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

PubMed Central

McDonough, Ian M.; Nashiro, Kaoru

2014-01-01

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

Investigation of a protein complex network

NASA Astrophysics Data System (ADS)

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

2004-09-01

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

An integrative approach to inferring biologically meaningful gene modules

PubMed Central

2011-01-01

Background The ability to construct biologically meaningful gene networks and modules is critical for contemporary systems biology. Though recent studies have demonstrated the power of using gene modules to shed light on the functioning of complex biological systems, most modules in these networks have shown little association with meaningful biological function. We have devised a method which directly incorporates gene ontology (GO) annotation in construction of gene modules in order to gain better functional association. Results We have devised a method, Semantic Similarity-Integrated approach for Modularization (SSIM) that integrates various gene-gene pairwise similarity values, including information obtained from gene expression, protein-protein interactions and GO annotations, in the construction of modules using affinity propagation clustering. We demonstrated the performance of the proposed method using data from two complex biological responses: 1. the osmotic shock response in Saccharomyces cerevisiae, and 2. the prion-induced pathogenic mouse model. In comparison with two previously reported algorithms, modules identified by SSIM showed significantly stronger association with biological functions. Conclusions The incorporation of semantic similarity based on GO annotation with gene expression and protein-protein interaction data can greatly enhance the functional relevance of inferred gene modules. In addition, the SSIM approach can also reveal the hierarchical structure of gene modules to gain a broader functional view of the biological system. Hence, the proposed method can facilitate comprehensive and in-depth analysis of high throughput experimental data at the gene network level. PMID:21791051

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

NASA Astrophysics Data System (ADS)

Amancio, Diego Raphael

2014-12-01

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

KSC-98pc1045

NASA Image and Video Library

1998-08-06

In this aerial view, The News Center sits beyond a large parking lot, on a hill at the northeastern end of the Launch Complex 39 Area , next to the turn basin (at left). From left, the grandstand faces the launch pads several miles away on the Atlantic seashore; behind it, the television studio is the site of media conferences; next, the large white-roofed building is the hub of information and activity for press representatives. Lined up on the right of the Press Site are various buildings and trailers, home to major news networks. The parking lot can accommodate the hundreds of media personnel who attend Space Shuttle launches

Neuroimmunology of disordered sleep in depression and alcoholism.

PubMed

Irwin, M

2001-11-01

The specific functions of sleep are not known, although sleep is commonly considered a restorative process that is important for the proper functioning of the immune system. Severity of disordered sleep in depressed and alcoholic subjects correlates with declines in natural and cellular immunity and is associated with alterations in the complex cytokine network. Despite evidence that sleep and sleep loss have effects on immune processes and nocturnal secretion of cytokines, the physiological significance of these immune changes is not known. Moreover, in view of basic evidence of a reciprocal interaction between sleep and cytokines, further research is needed to understand whether alterations in cytokines contribute to disordered sleep.

Earth Science System of the Future: Observing, Processing, and Delivering Data Products Directly to Users

NASA Technical Reports Server (NTRS)

Crisp, David; Komar, George (Technical Monitor)

2001-01-01

Advancement of our predictive capabilities will require new scientific knowledge, improvement of our modeling capabilities, and new observation strategies to generate the complex data sets needed by coupled modeling networks. New observation strategies must support remote sensing from a variety of vantage points and will include "sensorwebs" of small satellites in low Earth orbit, large aperture sensors in Geostationary orbits, and sentinel satellites at L1 and L2 to provide day/night views of the entire globe. Onboard data processing and high speed computing and communications will enable near real-time tailoring and delivery of information products (i.e., predictions) directly to users.

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

USGS Publications Warehouse

Campbell Grant, Evan H.

2011-01-01

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

Integration Of An MR Image Network Into A Clinical PACS

NASA Astrophysics Data System (ADS)

Ratib, Osman M.; Mankovich, Nicholas J.; Taira, Ricky K.; Cho, Paul S.; Huang, H. K.

1988-06-01

A direct link between a clinical pediatric PACS module and a FONAR MRI image network was implemented. The original MR network combines together the MR scanner, a remote viewing station and a central archiving station. The pediatric PACS directly connects to the archiving unit through an Ethernet TCP-IP network adhering to FONAR's protocol. The PACS communication software developed supports the transfer of patient studies and the patient information directly from the MR archive database to the pediatric PACS. In the first phase of our project we developed a package to transfer data between a VAX-111750 and the IBM PC I AT-based MR archive database through the Ethernet network. This system served as a model for PACS-to-modality network communication. Once testing was complete on this research network, the software and network hardware was moved to the clinical pediatric VAX for full PACS integration. In parallel to the direct transmission of digital images to the Pediatric PACS, a broadband communication system in video format was developed for real-time broadcasting of images originating from the MR console to 8 remote viewing stations distributed in the radiology department. These analog viewing stations allow the radiologists to directly monitor patient positioning and to select the scan levels during a patient examination from remote locations in the radiology department. This paper reports (1) the technical details of this implementation, (2) the merits of this network development scheme, and (3) the performance statistics of the network-to-PACS interface.

Methods and utility of EEG-fMRI in epilepsy

PubMed Central

Lemieux, Louis; Chaudhary, Umair Javaid

2015-01-01

Brain activity data in general and more specifically in epilepsy can be represented as a matrix that includes measures of electrophysiology, anatomy and behaviour. Each of these sub-matrices has a complex interaction depending upon the brain state i.e., rest, cognition, seizures and interictal periods. This interaction presents significant challenges for interpretation but also potential for developing further insights into individual event types. Successful treatments in epilepsy hinge on unravelling these complexities, and also on the sensitivity and specificity of methods that characterize the nature and localization of underlying physiological and pathological networks. Limitations of pharmacological and surgical treatments call for refinement and elaboration of methods to improve our capability to localise the generators of seizure activity and our understanding of the neurobiology of epilepsy. Simultaneous electroencephalography and functional magnetic resonance imaging (EEG-fMRI), by potentially circumventing some of the limitations of EEG in terms of sensitivity, can allow the mapping of haemodynamic networks over the entire brain related to specific spontaneous and triggered epileptic events in humans, and thereby provide new localising information. In this work we review the published literature, and discuss the methods and utility of EEG-fMRI in localising the generators of epileptic activity. We draw on our experience and that of other groups, to summarise the spectrum of information provided by an increasing number of EEG-fMRI case-series, case studies and group studies in patients with epilepsy, for its potential role to elucidate epileptic generators and networks. We conclude that EEG-fMRI provides a multidimensional view that contributes valuable clinical information to localize the epileptic focus with potential important implications for the surgical treatment of some patients with drug-resistant epilepsy, and insights into the resting state and cognitive network dynamics. PMID:25853087

GENERAL PERSPECTIVE VIEW OF THE EAST SIDE OF THE COMPLEX, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

GENERAL PERSPECTIVE VIEW OF THE EAST SIDE OF THE COMPLEX, VIEW LOOKING SOUTH WITH THE FIRE CACHE BUILDING, COMMUNICATIONS BUILDING, GRAPHICS BUILDING, FOREST PRACTICES BUILDING, AND THE K.O.G. (KEEP OREGON GREEN) BUILDING VISIBLE FROM LEFT TO RIGHT. - Oregon State Forester's Office Complex, 2600 State Street, Salem, Marion, OR

Learners' Views Regarding the Use of Social Networking Sites in Distance Learning

ERIC Educational Resources Information Center

Özmen, Büsra; Atici, Bünyamin

2014-01-01

In this study, it was aimed to examine the use of learning management systems supported by social networking sites in distance education and to determine the views of learners regarding these platforms. The study group of this study, which uses a qualitative research approach, consists of 15 undergraduate students who resumed their education in…

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

NASA Astrophysics Data System (ADS)

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

2012-03-01

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

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

NASA Astrophysics Data System (ADS)

Zhao, Xiang; Li, Yantao; Qu, Zehui

2018-04-01

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

Autoscoring Essays Based on Complex Networks

ERIC Educational Resources Information Center

Ke, Xiaohua; Zeng, Yongqiang; Luo, Haijiao

2016-01-01

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

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

PubMed

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

2013-01-01

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

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

PubMed

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

2015-02-04

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

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

PubMed

Maulik, Ujjwal; Basu, Srinka; Ray, Sumanta

2017-08-21

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

View-interpolation of sparsely sampled sinogram using convolutional neural network

NASA Astrophysics Data System (ADS)

Lee, Hoyeon; Lee, Jongha; Cho, Suengryong

2017-02-01

Spare-view sampling and its associated iterative image reconstruction in computed tomography have actively investigated. Sparse-view CT technique is a viable option to low-dose CT, particularly in cone-beam CT (CBCT) applications, with advanced iterative image reconstructions with varying degrees of image artifacts. One of the artifacts that may occur in sparse-view CT is the streak artifact in the reconstructed images. Another approach has been investigated for sparse-view CT imaging by use of the interpolation methods to fill in the missing view data and that reconstructs the image by an analytic reconstruction algorithm. In this study, we developed an interpolation method using convolutional neural network (CNN), which is one of the widely used deep-learning methods, to find missing projection data and compared its performances with the other interpolation techniques.

Advanced and secure architectural EHR approaches.

PubMed

Blobel, Bernd

2006-01-01

Electronic Health Records (EHRs) provided as a lifelong patient record advance towards core applications of distributed and co-operating health information systems and health networks. For meeting the challenge of scalable, flexible, portable, secure EHR systems, the underlying EHR architecture must be based on the component paradigm and model driven, separating platform-independent and platform-specific models. Allowing manageable models, real systems must be decomposed and simplified. The resulting modelling approach has to follow the ISO Reference Model - Open Distributing Processing (RM-ODP). The ISO RM-ODP describes any system component from different perspectives. Platform-independent perspectives contain the enterprise view (business process, policies, scenarios, use cases), the information view (classes and associations) and the computational view (composition and decomposition), whereas platform-specific perspectives concern the engineering view (physical distribution and realisation) and the technology view (implementation details from protocols up to education and training) on system components. Those views have to be established for components reflecting aspects of all domains involved in healthcare environments including administrative, legal, medical, technical, etc. Thus, security-related component models reflecting all view mentioned have to be established for enabling both application and communication security services as integral part of the system's architecture. Beside decomposition and simplification of system regarding the different viewpoint on their components, different levels of systems' granularity can be defined hiding internals or focusing on properties of basic components to form a more complex structure. The resulting models describe both structure and behaviour of component-based systems. The described approach has been deployed in different projects defining EHR systems and their underlying architectural principles. In that context, the Australian GEHR project, the openEHR initiative, the revision of CEN ENV 13606 "Electronic Health Record communication", all based on Archetypes, but also the HL7 version 3 activities are discussed in some detail. The latter include the HL7 RIM, the HL7 Development Framework, the HL7's clinical document architecture (CDA) as well as the set of models from use cases, activity diagrams, sequence diagrams up to Domain Information Models (DMIMs) and their building blocks Common Message Element Types (CMET) Constraining Models to their underlying concepts. The future-proof EHR architecture as open, user-centric, user-friendly, flexible, scalable, portable core application in health information systems and health networks has to follow advanced architectural paradigms.

A simple model clarifies the complicated relationships of complex networks

PubMed Central

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

2014-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-04-01

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

Evaluating nodes importance in complex network based on PageRank algorithm

NASA Astrophysics Data System (ADS)

Li, Kai; He, Yongfeng

2018-04-01

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

Social significance of community structure: Statistical view

NASA Astrophysics Data System (ADS)

Li, Hui-Jia; Daniels, Jasmine J.

2015-01-01

Community structure analysis is a powerful tool for social networks that can simplify their topological and functional analysis considerably. However, since community detection methods have random factors and real social networks obtained from complex systems always contain error edges, evaluating the significance of a partitioned community structure is an urgent and important question. In this paper, integrating the specific characteristics of real society, we present a framework to analyze the significance of a social community. The dynamics of social interactions are modeled by identifying social leaders and corresponding hierarchical structures. Instead of a direct comparison with the average outcome of a random model, we compute the similarity of a given node with the leader by the number of common neighbors. To determine the membership vector, an efficient community detection algorithm is proposed based on the position of the nodes and their corresponding leaders. Then, using a log-likelihood score, the tightness of the community can be derived. Based on the distribution of community tightness, we establish a connection between p -value theory and network analysis, and then we obtain a significance measure of statistical form . Finally, the framework is applied to both benchmark networks and real social networks. Experimental results show that our work can be used in many fields, such as determining the optimal number of communities, analyzing the social significance of a given community, comparing the performance among various algorithms, etc.

Foreign currency exchange network topology across the 2008 credit crisis

NASA Astrophysics Data System (ADS)

Sharif, Shamshuritawati; Ap, Nuraisah Che; Ruslan, Nuraimi

2017-05-01

A stable world currency exchange rate is a very important aspect to be considered for a developed country, i.e Malaysia. A better understanding about the currencies itself is needed nowadays. This project is about to understanding the fluctuation and to identify the most influential world currencies in the three different cases; before credit crisis, during credit crisis and after credit crisis. A network topology approach is use to examine the interrelationship between currencies based on correlation analysis. With this point of view, those relationships can be measured by a correlation structure among the currencies. The network can be analyse by filtering the important information using minimum spanning tree (MST) and interpret it using degree centrality as the centrality measure. This topology will give a useful guide to understand the behaviour and determine the most influential currency in the network as a part of a complex system. All currencies are compared among the three different cases; before credit crisis, during credit crisis and after credit crisis period. The result of this project shows that Unites State Dollar (USD), Brazilian Real (BRL), United Kingdom Pound (EUR) and Danish Krone (DKK) are the most influential currencies before the credit crisis period. With respect to during the credit crisis, New Zealand Dollar (NZD) dominates the network and it is followed by Singapore Dollar (SGD) for after the credit crisis period.

Dense power-law networks and simplicial complexes

NASA Astrophysics Data System (ADS)

Courtney, Owen T.; Bianconi, Ginestra

2018-05-01

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

A comparative study of manhole hydraulics using stereoscopic PIV and different RANS models.

PubMed

Beg, Md Nazmul Azim; Carvalho, Rita F; Tait, Simon; Brevis, Wernher; Rubinato, Matteo; Schellart, Alma; Leandro, Jorge

2017-04-01

Flows in manholes are complex and may include swirling and recirculation flow with significant turbulence and vorticity. However, how these complex 3D flow patterns could generate different energy losses and so affect flow quantity in the wider sewer network is unknown. In this work, 2D3C stereo Particle Image Velocimetry measurements are made in a surcharged scaled circular manhole. A computational fluid dynamics (CFD) model in OpenFOAM ® with four different Reynolds Averaged Navier Stokes (RANS) turbulence model is constructed using a volume of fluid model, to represent flows in this manhole. Velocity profiles and pressure distributions from the models are compared with the experimental data in view of finding the best modelling approach. It was found among four different RANS models that the re-normalization group (RNG) k-ɛ and k-ω shear stress transport (SST) gave a better approximation for velocity and pressure.

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

NASA Astrophysics Data System (ADS)

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

2015-04-01

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

Oscillations in interconnected complex networks under intentional attack

NASA Astrophysics Data System (ADS)

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

2016-01-01

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

The Correlation Fractal Dimension of Complex Networks

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Liu, Zhenzhen; Wang, Mogei

2013-05-01

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

Multistage Security Mechanism For Hybrid, Large-Scale Wireless Sensor Networks

DTIC Science & Technology

2007-06-01

sensor network . Building on research in the areas of the wireless sensor networks (WSN) and the mobile ad hoc networks (MANET), this thesis proposes an...A wide area network consisting of ballistic missile defense satellites and terrestrial nodes can be viewed as a hybrid, large-scale mobile wireless

Using Complex Networks to Characterize International Business Cycles

PubMed Central

Caraiani, Petre

2013-01-01

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

Patient informed governance of distributed research networks: results and discussion from six patient focus groups.

PubMed

Mamo, Laura A; Browe, Dennis K; Logan, Holly C; Kim, Katherine K

2013-01-01

Understanding how to govern emerging distributed research networks is essential to their success. Distributed research networks aggregate patient medical data from many institutions leaving data within the local provider security system. While much is known about patients' views on secondary medical research, little is known about their views on governance of research networks. We conducted six focus groups with patients from three medical centers across the U.S. to understand their perspectives on privacy, consent, and ethical concerns of sharing their data as part of research networks. Participants positively endorsed sharing their health data with these networks believing that doing so could advance healthcare knowledge. However, patients expressed several concerns regarding security and broader ethical issues such as commercialism, public benefit, and social responsibility. We suggest that network governance guidelines move beyond strict technical requirements and address wider socio-ethical concerns by fully including patients in governance processes.

Patient Informed Governance of Distributed Research Networks: Results and Discussion from Six Patient Focus Groups

PubMed Central

Mamo, Laura A.; Browe, Dennis K.; Logan, Holly C.; Kim, Katherine K.

2013-01-01

Understanding how to govern emerging distributed research networks is essential to their success. Distributed research networks aggregate patient medical data from many institutions leaving data within the local provider security system. While much is known about patients’ views on secondary medical research, little is known about their views on governance of research networks. We conducted six focus groups with patients from three medical centers across the U.S. to understand their perspectives on privacy, consent, and ethical concerns of sharing their data as part of research networks. Participants positively endorsed sharing their health data with these networks believing that doing so could advance healthcare knowledge. However, patients expressed several concerns regarding security and broader ethical issues such as commercialism, public benefit, and social responsibility. We suggest that network governance guidelines move beyond strict technical requirements and address wider socio-ethical concerns by fully including patients in governance processes. PMID:24551383

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

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

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

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

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

A scientific theory of Ars Memoriae: Spatial view cells in a continuous attractor network with linked items.

PubMed

Rolls, Edmund T

2017-05-01

The art of memory (ars memoriae) used since classical times includes using a well-known scene to associate each view or part of the scene with a different item in a speech. This memory technique is also known as the "method of loci." The new theory is proposed that this type of memory is implemented in the CA3 region of the hippocampus where there are spatial view cells in primates that allow a particular view to be associated with a particular object in an event or episodic memory. Given that the CA3 cells with their extensive recurrent collateral system connecting different CA3 cells, and associative synaptic modifiability, form an autoassociation or attractor network, the spatial view cells with their approximately Gaussian view fields become linked in a continuous attractor network. As the view space is traversed continuously (e.g., by self-motion or imagined self-motion across the scene), the views are therefore successively recalled in the correct order, with no view missing, and with low interference between the items to be recalled. Given that each spatial view has been associated with a different discrete item, the items are recalled in the correct order, with none missing. This is the first neuroscience theory of ars memoriae. The theory provides a foundation for understanding how a key feature of ars memoriae, the ability to use a spatial scene to encode a sequence of items to be remembered, is implemented. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

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

PubMed

Ponzi, Adam; Wickens, Jeff

2010-04-28

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

A Comparative View of Face Perception

PubMed Central

Leopold, David A.; Rhodes, Gillian

2010-01-01

Face perception serves as the basis for much of human social exchange. Diverse information can be extracted about an individual from a single glance at their face, including their identity, emotional state, and direction of attention. Neuropsychological and fMRI experiments reveal a complex network of specialized areas in the human brain supporting these face-reading skills. Here we consider the evolutionary roots of human face perception by exploring the manner in which different animal species view and respond to faces. We focus on behavioral experiments collected from both primates and non-primates, assessing the types of information that animals are able to extract from the faces of their conspecifics, human experimenters, and natural predators. These experiments reveal that faces are an important category of visual stimuli for animals in all major vertebrate taxa, possibly reflecting the early emergence of neural specialization for faces in vertebrate evolution. At the same time, some aspects of facial perception are only evident in primates and a few other social mammals, and may therefore have evolved to suit the needs of complex social communication. Since the human brain likely utilizes both primitive and recently evolved neural specializations for the processing of faces, comparative studies may hold the key to understanding how these parallel circuits emerged during human evolution. PMID:20695655

A comparative view of face perception.

PubMed

Leopold, David A; Rhodes, Gillian

2010-08-01

Face perception serves as the basis for much of human social exchange. Diverse information can be extracted about an individual from a single glance at their face, including their identity, emotional state, and direction of attention. Neuropsychological and functional magnetic resonance imaging (fMRI) experiments reveal a complex network of specialized areas in the human brain supporting these face-reading skills. Here we consider the evolutionary roots of human face perception by exploring the manner in which different animal species view and respond to faces. We focus on behavioral experiments collected from both primates and nonprimates, assessing the types of information that animals are able to extract from the faces of their conspecifics, human experimenters, and natural predators. These experiments reveal that faces are an important category of visual stimuli for animals in all major vertebrate taxa, possibly reflecting the early emergence of neural specialization for faces in vertebrate evolution. At the same time, some aspects of facial perception are only evident in primates and a few other social mammals, and may therefore have evolved to suit the needs of complex social communication. Because the human brain likely utilizes both primitive and recently evolved neural specializations for the processing of faces, comparative studies may hold the key to understanding how these parallel circuits emerged during human evolution. 2010 APA, all rights reserved

Locating Structural Centers: A Density-Based Clustering Method for Community Detection

PubMed Central

Liu, Gongshen; Li, Jianhua; Nees, Jan P.

2017-01-01

Uncovering underlying community structures in complex networks has received considerable attention because of its importance in understanding structural attributes and group characteristics of networks. The algorithmic identification of such structures is a significant challenge. Local expanding methods have proven to be efficient and effective in community detection, but most methods are sensitive to initial seeds and built-in parameters. In this paper, we present a local expansion method by density-based clustering, which aims to uncover the intrinsic network communities by locating the structural centers of communities based on a proposed structural centrality. The structural centrality takes into account local density of nodes and relative distance between nodes. The proposed algorithm expands a community from the structural center to the border with a single local search procedure. The local expanding procedure follows a heuristic strategy as allowing it to find complete community structures. Moreover, it can identify different node roles (cores and outliers) in communities by defining a border region. The experiments involve both on real-world and artificial networks, and give a comparison view to evaluate the proposed method. The result of these experiments shows that the proposed method performs more efficiently with a comparative clustering performance than current state of the art methods. PMID:28046030

Quantum-Like Bayesian Networks for Modeling Decision Making

PubMed Central

Moreira, Catarina; Wichert, Andreas

2016-01-01

In this work, we explore an alternative quantum structure to perform quantum probabilistic inferences to accommodate the paradoxical findings of the Sure Thing Principle. We propose a Quantum-Like Bayesian Network, which consists in replacing classical probabilities by quantum probability amplitudes. However, since this approach suffers from the problem of exponential growth of quantum parameters, we also propose a similarity heuristic that automatically fits quantum parameters through vector similarities. This makes the proposed model general and predictive in contrast to the current state of the art models, which cannot be generalized for more complex decision scenarios and that only provide an explanatory nature for the observed paradoxes. In the end, the model that we propose consists in a nonparametric method for estimating inference effects from a statistical point of view. It is a statistical model that is simpler than the previous quantum dynamic and quantum-like models proposed in the literature. We tested the proposed network with several empirical data from the literature, mainly from the Prisoner's Dilemma game and the Two Stage Gambling game. The results obtained show that the proposed quantum Bayesian Network is a general method that can accommodate violations of the laws of classical probability theory and make accurate predictions regarding human decision-making in these scenarios. PMID:26858669

A Complex Network Perspective on Clinical Science

PubMed Central

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

2016-01-01

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

Cluster Size Optimization in Sensor Networks with Decentralized Cluster-Based Protocols

PubMed Central

Amini, Navid; Vahdatpour, Alireza; Xu, Wenyao; Gerla, Mario; Sarrafzadeh, Majid

2011-01-01

Network lifetime and energy-efficiency are viewed as the dominating considerations in designing cluster-based communication protocols for wireless sensor networks. This paper analytically provides the optimal cluster size that minimizes the total energy expenditure in such networks, where all sensors communicate data through their elected cluster heads to the base station in a decentralized fashion. LEACH, LEACH-Coverage, and DBS comprise three cluster-based protocols investigated in this paper that do not require any centralized support from a certain node. The analytical outcomes are given in the form of closed-form expressions for various widely-used network configurations. Extensive simulations on different networks are used to confirm the expectations based on the analytical results. To obtain a thorough understanding of the results, cluster number variability problem is identified and inspected from the energy consumption point of view. PMID:22267882

Rethinking Networks in Education: Case Studies of Organisational Development Networks in Neoliberal Contexts

ERIC Educational Resources Information Center

Townsend, Andrew

2013-01-01

In 2002 the National College for School Leadership in England launched what they claimed to be the biggest school networking initiative of its kind. The networks which were members of this programme involved schools working together to achieve shared priorities and can be viewed as examples of organisational development networks. These networks,…

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

PubMed

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

2018-01-01

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

Integrated Network Architecture for NASA's Orion Missions

NASA Technical Reports Server (NTRS)

Bhasin, Kul B.; Hayden, Jeffrey L.; Sartwell, Thomas; Miller, Ronald A.; Hudiburg, John J.

2008-01-01

NASA is planning a series of short and long duration human and robotic missions to explore the Moon and then Mars. The series of missions will begin with a new crew exploration vehicle (called Orion) that will initially provide crew exchange and cargo supply support to the International Space Station (ISS) and then become a human conveyance for travel to the Moon. The Orion vehicle will be mounted atop the Ares I launch vehicle for a series of pre-launch tests and then launched and inserted into low Earth orbit (LEO) for crew exchange missions to the ISS. The Orion and Ares I comprise the initial vehicles in the Constellation system of systems that later includes Ares V, Earth departure stage, lunar lander, and other lunar surface systems for the lunar exploration missions. These key systems will enable the lunar surface exploration missions to be initiated in 2018. The complexity of the Constellation system of systems and missions will require a communication and navigation infrastructure to provide low and high rate forward and return communication services, tracking services, and ground network services. The infrastructure must provide robust, reliable, safe, sustainable, and autonomous operations at minimum cost while maximizing the exploration capabilities and science return. The infrastructure will be based on a network of networks architecture that will integrate NASA legacy communication, modified elements, and navigation systems. New networks will be added to extend communication, navigation, and timing services for the Moon missions. Internet protocol (IP) and network management systems within the networks will enable interoperability throughout the Constellation system of systems. An integrated network architecture has developed based on the emerging Constellation requirements for Orion missions. The architecture, as presented in this paper, addresses the early Orion missions to the ISS with communication, navigation, and network services over five phases of a mission: pre-launch, launch from T0 to T+6.5 min, launch from T+6.5 min to 12 min, in LEO for rendezvous and docking with ISS, and return to Earth. The network of networks that supports the mission during each of these phases and the concepts of operations during those phases are developed as a high level operational concepts graphic called OV-1, an architecture diagram type described in the Department of Defense Architecture Framework (DoDAF). Additional operational views on organizational relationships (OV-4), operational activities (OV-5), and operational node connectivity (OV-2) are also discussed. The system interfaces view (SV-1) that provides the communication and navigation services to Orion is also included and described. The challenges of architecting integrated network architecture for the NASA Orion missions are highlighted.

Graph theoretical analysis of complex networks in the brain

PubMed Central

Stam, Cornelis J; Reijneveld, Jaap C

2007-01-01

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

Static and dynamic views of visual cortical organization.

PubMed

Casagrande, Vivien A; Xu, Xiangmin; Sáry, Gyula

2002-01-01

Without the aid of modern techniques Cajal speculated that cells in the visual cortex were connected in circuits. From Cajal's time until fairly recently, the flow of information within the cells and circuits of visual cortex has been described as progressing from input to output, from sensation to action. In this chapter we argue that a paradigm shift in our concept of the visual cortical neuron is under way. The most important change in our view concerns the neuron's functional role. Visual cortical neurons do not have static functional signatures but instead function dynamically depending on the ongoing activity of the networks to which they belong. These networks are not merely top-down or bottom-up unidirectional transmission lines, but rather represent machinery that uses recurrent information and is dynamic and highly adaptable. With the advancement of technology for analyzing the conversations of multiple neurons at many levels in the visual system and higher resolution imaging, we predict that the paradigm shift will progress to the point where neurons are no longer viewed as independent processing units but as members of subsets of networks where their role is mapped in space-time coordinates in relationship to the other neuronal members. This view moves us far from Cajal's original views of the neuron. Nevertheless, we believe that understanding the basic morphology and wiring of networks will continue to contribute to our overall understanding of the visual cortex.

Mathematical Model of a Telomerase Transcriptional Regulatory Network Developed by Cell-Based Screening: Analysis of Inhibitor Effects and Telomerase Expression Mechanisms

PubMed Central

Bilsland, Alan E.; Stevenson, Katrina; Liu, Yu; Hoare, Stacey; Cairney, Claire J.; Roffey, Jon; Keith, W. Nicol

2014-01-01

Cancer cells depend on transcription of telomerase reverse transcriptase (TERT). Many transcription factors affect TERT, though regulation occurs in context of a broader network. Network effects on telomerase regulation have not been investigated, though deeper understanding of TERT transcription requires a systems view. However, control over individual interactions in complex networks is not easily achievable. Mathematical modelling provides an attractive approach for analysis of complex systems and some models may prove useful in systems pharmacology approaches to drug discovery. In this report, we used transfection screening to test interactions among 14 TERT regulatory transcription factors and their respective promoters in ovarian cancer cells. The results were used to generate a network model of TERT transcription and to implement a dynamic Boolean model whose steady states were analysed. Modelled effects of signal transduction inhibitors successfully predicted TERT repression by Src-family inhibitor SU6656 and lack of repression by ERK inhibitor FR180204, results confirmed by RT-QPCR analysis of endogenous TERT expression in treated cells. Modelled effects of GSK3 inhibitor 6-bromoindirubin-3′-oxime (BIO) predicted unstable TERT repression dependent on noise and expression of JUN, corresponding with observations from a previous study. MYC expression is critical in TERT activation in the model, consistent with its well known function in endogenous TERT regulation. Loss of MYC caused complete TERT suppression in our model, substantially rescued only by co-suppression of AR. Interestingly expression was easily rescued under modelled Ets-factor gain of function, as occurs in TERT promoter mutation. RNAi targeting AR, JUN, MXD1, SP3, or TP53, showed that AR suppression does rescue endogenous TERT expression following MYC knockdown in these cells and SP3 or TP53 siRNA also cause partial recovery. The model therefore successfully predicted several aspects of TERT regulation including previously unknown mechanisms. An extrapolation suggests that a dominant stimulatory system may programme TERT for transcriptional stability. PMID:24550717

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

PubMed

Tanaka, Gouhei; Aihara, Kazuyuki

2009-09-01

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

Behavior-based network management: a unique model-based approach to implementing cyber superiority

NASA Astrophysics Data System (ADS)

Seng, Jocelyn M.

2016-05-01

Behavior-Based Network Management (BBNM) is a technological and strategic approach to mastering the identification and assessment of network behavior, whether human-driven or machine-generated. Recognizing that all five U.S. Air Force (USAF) mission areas rely on the cyber domain to support, enhance and execute their tasks, BBNM is designed to elevate awareness and improve the ability to better understand the degree of reliance placed upon a digital capability and the operational risk.2 Thus, the objective of BBNM is to provide a holistic view of the digital battle space to better assess the effects of security, monitoring, provisioning, utilization management, allocation to support mission sustainment and change control. Leveraging advances in conceptual modeling made possible by a novel advancement in software design and implementation known as Vector Relational Data Modeling (VRDM™), the BBNM approach entails creating a network simulation in which meaning can be inferred and used to manage network behavior according to policy, such as quickly detecting and countering malicious behavior. Initial research configurations have yielded executable BBNM models as combinations of conceptualized behavior within a network management simulation that includes only concepts of threats and definitions of "good" behavior. A proof of concept assessment called "Lab Rat," was designed to demonstrate the simplicity of network modeling and the ability to perform adaptation. The model was tested on real world threat data and demonstrated adaptive and inferential learning behavior. Preliminary results indicate this is a viable approach towards achieving cyber superiority in today's volatile, uncertain, complex and ambiguous (VUCA) environment.

Identification and Analyses of AUX-IAA target genes controlling multiple pathways in developing fiber cells of Gossypium hirsutum L

PubMed Central

Nigam, Deepti; Sawant, Samir V

2013-01-01

Technological development led to an increased interest in systems biological approaches in plants to characterize developmental mechanism and candidate genes relevant to specific tissue or cell morphology. AUX-IAA proteins are important plant-specific putative transcription factors. There are several reports on physiological response of this family in Arabidopsis but in cotton fiber the transcriptional network through which AUX-IAA regulated its target genes is still unknown. in-silico modelling of cotton fiber development specific gene expression data (108 microarrays and 22,737 genes) using Algorithm for the Reconstruction of Accurate Cellular Networks (ARACNe) reveals 3690 putative AUX-IAA target genes of which 139 genes were known to be AUX-IAA co-regulated within Arabidopsis. Further AUX-IAA targeted gene regulatory network (GRN) had substantial impact on the transcriptional dynamics of cotton fiber, as showed by, altered TF networks, and Gene Ontology (GO) biological processes and metabolic pathway associated with its target genes. Analysis of the AUX-IAA-correlated gene network reveals multiple functions for AUX-IAA target genes such as unidimensional cell growth, cellular nitrogen compound metabolic process, nucleosome organization, DNA-protein complex and process related to cell wall. These candidate networks/pathways have a variety of profound impacts on such cellular functions as stress response, cell proliferation, and cell differentiation. While these functions are fairly broad, their underlying TF networks may provide a global view of AUX-IAA regulated gene expression and a GRN that guides future studies in understanding role of AUX-IAA box protein and its targets regulating fiber development. PMID:24497725

Optimizing Nutrient Uptake in Biological Transport Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

2013-03-01

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

1. GENERAL VIEW OF COMPLEX, SHOWING FACTORY BUILDING IN LEFT ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. GENERAL VIEW OF COMPLEX, SHOWING FACTORY BUILDING IN LEFT FOREGROUND, GRINDING PLATFORM AT REAR OF FACTORY, AND STABLE AREA AND OVERSEER'S HOUSE TO RIGHT - Caneel Bay Plantation, General Views, Cruz Bay, St. John, VI

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

PubMed

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

2017-11-08

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

Coevolution of metabolic networks and membranes: the scenario of progressive sequestration.

PubMed

Szathmáry, Eörs

2007-10-29

Many regard metabolism as one of the central phenomena (or criteria) of life. Yet, the earliest infrabiological systems may have been devoid of metabolism: such systems would have been extreme heterotrophs. We do not know what level of complexity is attainable for chemical systems without enzymatic aid. Lack of template-instructed enzymatic catalysis may put a ceiling on complexity owing to inevitable spontaneous decay and wear and tear of chemodynamical machines. Views on the origin of metabolism critically depend on the assumptions concerning the sites of synthesis and consumption of organic compounds. If these sites are different, non-enzymatic origin of autotrophy is excluded. Whether autotrophy is secondary or not, it seems that protocell boundaries may have become more selective with time, concurrent with the enzymatization of the metabolic network. Primary heterotrophy and autotrophy imply pathway innovation and retention, respectively. The idea of metabolism-membrane coevolution leads to a scenario of progressive sequestration of the emerging living system from its exterior milieu. Comparative data on current protein enzymes may shed some light on such a primeval process by analogy, since two main ideas about enzymatization (the retroevolution and the patchwork scenarios) may not necessarily be mutually exclusive and the earliest enzymatic system may have used ribozymes rather than proteins.

Fluctuations in Wikipedia access-rate and edit-event data

NASA Astrophysics Data System (ADS)

Kämpf, Mirko; Tismer, Sebastian; Kantelhardt, Jan W.; Muchnik, Lev

2012-12-01

Internet-based social networks often reflect extreme events in nature and society by drastic increases in user activity. We study and compare the dynamics of the two major complex processes necessary for information spread via the online encyclopedia ‘Wikipedia’, i.e., article editing (information upload) and article access (information viewing) based on article edit-event time series and (hourly) user access-rate time series for all articles. Daily and weekly activity patterns occur in addition to fluctuations and bursting activity. The bursts (i.e., significant increases in activity for an extended period of time) are characterized by a power-law distribution of durations of increases and decreases. For describing the recurrence and clustering of bursts we investigate the statistics of the return intervals between them. We find stretched exponential distributions of return intervals in access-rate time series, while edit-event time series yield simple exponential distributions. To characterize the fluctuation behavior we apply detrended fluctuation analysis (DFA), finding that most article access-rate time series are characterized by strong long-term correlations with fluctuation exponents α≈0.9. The results indicate significant differences in the dynamics of information upload and access and help in understanding the complex process of collecting, processing, validating, and distributing information in self-organized social networks.

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

PubMed

Lewis, Brian A

2010-01-15

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

Intrinsic network connectivity and own body perception in gender dysphoria.

PubMed

Feusner, Jamie D; Lidström, Andreas; Moody, Teena D; Dhejne, Cecilia; Bookheimer, Susan Y; Savic, Ivanka

2017-08-01

Gender dysphoria (GD) is characterized by incongruence between one's identity and gender assigned at birth. The biological mechanisms of GD are unclear. We investigated brain network connectivity patterns involved in own body perception in the context of self in GD. Twenty-seven female-to-male (FtM) individuals with GD, 27 male controls, and 27 female controls underwent resting state fMRI. We compared functional connections within intrinsic connectivity networks involved in self-referential processes and own body perception -default mode network (DMN) and salience network - and visual networks, using independent components analyses. Behavioral correlates of network connectivity were also tested using self-perception ratings while viewing own body images morphed to their sex assigned at birth, and to the sex of their gender identity. FtM exhibited decreased connectivity of anterior and posterior cingulate and precuneus within the DMN compared with controls. In FtM, higher "self" ratings for bodies morphed towards the sex of their gender identity were associated with greater connectivity of the anterior cingulate within the DMN, during long viewing times. In controls, higher ratings for bodies morphed towards their gender assigned at birth were associated with right insula connectivity within the salience network, during short viewing times. Within visual networks FtM showed weaker connectivity in occipital and temporal regions. Results suggest disconnectivity within networks involved in own body perception in the context of self in GD. Moreover, perception of bodies in relation to self may be reflective rather than reflexive, as a function of mesial prefrontal processes. These may represent neurobiological correlates to the subjective disconnection between perception of body and self-identification.

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

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2018-05-01

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

Reconfigurable optical implementation of quantum complex networks

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Deconvolution using a neural network

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

Lehman, S.K.

1990-11-15

Viewing one dimensional deconvolution as a matrix inversion problem, we compare a neural network backpropagation matrix inverse with LMS, and pseudo-inverse. This is a largely an exercise in understanding how our neural network code works. 1 ref.

Java-based cryptosystem for PACS and tele-imaging

NASA Astrophysics Data System (ADS)

Tjandra, Donny; Wong, Stephen T. C.; Yu, Yuan-Pin

1998-07-01

Traditional PACS systems are based on two-tier client server architectures, and require the use of costly, high-end client workstations for image viewing. Consequently, PACS systems using the two-tier architecture do not scale well as data increases in size and complexity. Furthermore, use of dedicated viewing workstations incurs costs in deployment and maintenance. To address these issues, the use of digital library technologies, such as the World Wide Web, Java, and CORBA, is being explored to distribute PACS data to serve a broader range of healthcare providers in an economic and efficient manner. Integration of PACS systems with digital library technologies allows access to medical information through open networks such as the Internet. However, use of open networks to transmit medical data introduces problems with maintaining privacy and integrity of patient information. Cryptography and digital timestamping is used to protect sensitive information from unauthorized access or tampering. A major concern when using cryptography and digital timestamping is the performance degradation associated with the mathematical calculations needed to encrypt/decrypt an image dataset, or to calculate the hash value of an image. The performance issue is compounded by the extra layer associated with the CORBA middleware, and the use of programming languages interpreted at the client side, such as Java. This paper study the extent to which Java-based cryptography and digital timestamping affects performance in a PACS system integrated with digital library technologies.

Perceptions of childhood immunization in a minority community: qualitative study.

PubMed

Henderson, Lesley; Millett, Christopher; Thorogood, Nicki

2008-05-01

To assess reasons for low uptake of immunization amongst orthodox Jewish families. Qualitative interviews with 25 orthodox Jewish mothers and 10 local health care workers. The orthodox Jewish community in North East London. Identification of views on immunization in the orthodox Jewish community. In a community assumed to be relatively insulated from direct media influence, word of mouth is nevertheless a potent source of rumours about vaccination dangers. The origins of these may lie in media scares that contribute to anxieties about MMR. At the same time, close community cohesion leads to a sense of relative safety in relation to tuberculosis, with consequent low rates of BCG uptake. Thus low uptake of different immunizations arises from enhanced feelings of both safety and danger. Low uptake was not found to be due to the practical difficulties associated with large families, or to perceived insensitive cultural practices of health care providers. The views and practices of members of this community are not homogeneous and may change over time. It is important that assumptions concerning the role of religious beliefs do not act as an obstacle for providing clear messages concerning immunization, and community norms may be challenged by explicitly using its social networks to communicate more positive messages about immunization. The study provides a useful example of how social networks may reinforce or challenge misinformation about health and risk and the complex nature of decision making about children's health.

Systems biology perspectives on minimal and simpler cells.

PubMed

Xavier, Joana C; Patil, Kiran Raosaheb; Rocha, Isabel

2014-09-01

The concept of the minimal cell has fascinated scientists for a long time, from both fundamental and applied points of view. This broad concept encompasses extreme reductions of genomes, the last universal common ancestor (LUCA), the creation of semiartificial cells, and the design of protocells and chassis cells. Here we review these different areas of research and identify common and complementary aspects of each one. We focus on systems biology, a discipline that is greatly facilitating the classical top-down and bottom-up approaches toward minimal cells. In addition, we also review the so-called middle-out approach and its contributions to the field with mathematical and computational models. Owing to the advances in genomics technologies, much of the work in this area has been centered on minimal genomes, or rather minimal gene sets, required to sustain life. Nevertheless, a fundamental expansion has been taking place in the last few years wherein the minimal gene set is viewed as a backbone of a more complex system. Complementing genomics, progress is being made in understanding the system-wide properties at the levels of the transcriptome, proteome, and metabolome. Network modeling approaches are enabling the integration of these different omics data sets toward an understanding of the complex molecular pathways connecting genotype to phenotype. We review key concepts central to the mapping and modeling of this complexity, which is at the heart of research on minimal cells. Finally, we discuss the distinction between minimizing the number of cellular components and minimizing cellular complexity, toward an improved understanding and utilization of minimal and simpler cells. Copyright © 2014, American Society for Microbiology. All Rights Reserved.

Hydroxypropyl-β-CD vs. its α-homologue for a 3D modified polyrotaxane network formation and properties: the relationship between modified CD and polymer revealed through comparison.

PubMed

Li, Zhao; Zheng, Zhen; Su, Shan; Yu, Lin; Wang, Xinling

2016-09-14

The threading mechanism of the hydroxypropyl-cyclodextrin (Hy-CD)/tetrahedron-like poly(ethylene glycol) (tetra-PEG) based host-guest complex and the relationship between Hy-CD and poly(ethylene oxide) (PEO) in the three-dimensional modified polyrotaxane (PR) formed by the complex were revealed through the comparison between Hy-β-CD/tetra-PEG and Hy-α-CD/tetra-PEG based systems from the macroscopic material view to the microscopic molecular view. The complexation between Hy-CD and tetra-PEG in water experiences a threading-dethreading-rethreading process which is controlled by the intermolecular interaction intensity or molecular hindrance depending on the feed ratio of Hy-CD to tetra-PEG. In the 3D modified PR, the methyl group of the Hy part on one Hy-CD can insert into the cavity of the adjacent Hy-CD and interacts with both the interior surface of the cavity and the PEO segment within the cavity if the cavity of Hy-CD is large enough. The threaded Hy-CD in the PR straightens the chain of PEO and suppresses the segment motion of the PEO. With the decrease of the cavity size of Hy-CD, the degree of suppression on the segment motion of PEO increases. Hy-CD threaded on the PEO chain can also deform when the 3D modified PR is compressed, and the degree of deformation increases with the increase of the cavity size of Hy-CD. These results of the modified CD/PEG based complex system set it apart from the unmodified CD/PEG based one, and reveal the structure-property relationship of this new type of Hy-CD/tetra-PEG based 3D modified PR material.

Quadtree of TIN: a new algorithm of dynamic LOD

NASA Astrophysics Data System (ADS)

Zhang, Junfeng; Fei, Lifan; Chen, Zhen

2009-10-01

Currently, Real-time visualization of large-scale digital elevation model mainly employs the regular structure of GRID based on quadtree and triangle simplification methods based on irregular triangulated network (TIN). TIN is a refined means to express the terrain surface in the computer science, compared with GRID. However, the data structure of TIN model is complex, and is difficult to realize view-dependence representation of level of detail (LOD) quickly. GRID is a simple method to realize the LOD of terrain, but contains more triangle count. A new algorithm, which takes full advantage of the two methods' merit, is presented in this paper. This algorithm combines TIN with quadtree structure to realize the view-dependence LOD controlling over the irregular sampling point sets, and holds the details through the distance of viewpoint and the geometric error of terrain. Experiments indicate that this approach can generate an efficient quadtree triangulation hierarchy over any irregular sampling point sets and achieve dynamic and visual multi-resolution performance of large-scale terrain at real-time.

Phase transition in the parametric natural visibility graph.

PubMed

Snarskii, A A; Bezsudnov, I V

2016-10-01

We investigate time series by mapping them to the complex networks using a parametric natural visibility graph (PNVG) algorithm that generates graphs depending on arbitrary continuous parameter-the angle of view. We study the behavior of the relative number of clusters in PNVG near the critical value of the angle of view. Artificial and experimental time series of different nature are used for numerical PNVG investigations to find critical exponents above and below the critical point as well as the exponent in the finite size scaling regime. Altogether, they allow us to find the critical exponent of the correlation length for PNVG. The set of calculated critical exponents satisfies the basic Widom relation. The PNVG is found to demonstrate scaling behavior. Our results reveal the similarity between the behavior of the relative number of clusters in PNVG and the order parameter in the second-order phase transitions theory. We show that the PNVG is another example of a system (in addition to magnetic, percolation, superconductivity, etc.) with observed second-order phase transition.

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

PubMed

Kobayashi, Masaki

2017-01-01

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

18. A southeastward aerial view of entire complex. Area east ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

18. A southeastward aerial view of entire complex. Area east of Cherles Street (behind water tower in view) is not part of this project. - American Chain & Cable Company, East Princess Street (400 Block), York, York County, PA

Community detection in complex networks by using membrane algorithm

NASA Astrophysics Data System (ADS)

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

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

Evolutionary versatility of eukaryotic protein domains revealed by their bigram networks

PubMed Central

2011-01-01

Background Protein domains are globular structures of independently folded polypeptides that exert catalytic or binding activities. Their sequences are recognized as evolutionary units that, through genome recombination, constitute protein repertoires of linkage patterns. Via mutations, domains acquire modified functions that contribute to the fitness of cells and organisms. Recent studies have addressed the evolutionary selection that may have shaped the functions of individual domains and the emergence of particular domain combinations, which led to new cellular functions in multi-cellular animals. This study focuses on modeling domain linkage globally and investigates evolutionary implications that may be revealed by novel computational analysis. Results A survey of 77 completely sequenced eukaryotic genomes implies a potential hierarchical and modular organization of biological functions in most living organisms. Domains in a genome or multiple genomes are modeled as a network of hetero-duplex covalent linkages, termed bigrams. A novel computational technique is introduced to decompose such networks, whereby the notion of domain "networking versatility" is derived and measured. The most and least "versatile" domains (termed "core domains" and "peripheral domains" respectively) are examined both computationally via sequence conservation measures and experimentally using selected domains. Our study suggests that such a versatility measure extracted from the bigram networks correlates with the adaptivity of domains during evolution, where the network core domains are highly adaptive, significantly contrasting the network peripheral domains. Conclusions Domain recombination has played a major part in the evolution of eukaryotes attributing to genome complexity. From a system point of view, as the results of selection and constant refinement, networks of domain linkage are structured in a hierarchical modular fashion. Domains with high degree of networking versatility appear to be evolutionary adaptive, potentially through functional innovations. Domain bigram networks are informative as a model of biological functions. The networking versatility indices extracted from such networks for individual domains reflect the strength of evolutionary selection that the domains have experienced. PMID:21849086

Evolutionary versatility of eukaryotic protein domains revealed by their bigram networks.

PubMed

Xie, Xueying; Jin, Jing; Mao, Yongyi

2011-08-18

Protein domains are globular structures of independently folded polypeptides that exert catalytic or binding activities. Their sequences are recognized as evolutionary units that, through genome recombination, constitute protein repertoires of linkage patterns. Via mutations, domains acquire modified functions that contribute to the fitness of cells and organisms. Recent studies have addressed the evolutionary selection that may have shaped the functions of individual domains and the emergence of particular domain combinations, which led to new cellular functions in multi-cellular animals. This study focuses on modeling domain linkage globally and investigates evolutionary implications that may be revealed by novel computational analysis. A survey of 77 completely sequenced eukaryotic genomes implies a potential hierarchical and modular organization of biological functions in most living organisms. Domains in a genome or multiple genomes are modeled as a network of hetero-duplex covalent linkages, termed bigrams. A novel computational technique is introduced to decompose such networks, whereby the notion of domain "networking versatility" is derived and measured. The most and least "versatile" domains (termed "core domains" and "peripheral domains" respectively) are examined both computationally via sequence conservation measures and experimentally using selected domains. Our study suggests that such a versatility measure extracted from the bigram networks correlates with the adaptivity of domains during evolution, where the network core domains are highly adaptive, significantly contrasting the network peripheral domains. Domain recombination has played a major part in the evolution of eukaryotes attributing to genome complexity. From a system point of view, as the results of selection and constant refinement, networks of domain linkage are structured in a hierarchical modular fashion. Domains with high degree of networking versatility appear to be evolutionary adaptive, potentially through functional innovations. Domain bigram networks are informative as a model of biological functions. The networking versatility indices extracted from such networks for individual domains reflect the strength of evolutionary selection that the domains have experienced.

The use of nodes attributes in social network analysis with an application to an international trade network

NASA Astrophysics Data System (ADS)

de Andrade, Ricardo Lopes; Rêgo, Leandro Chaves

2018-02-01

The social network analysis (SNA) studies the interactions among actors in a network formed through some relationship (friendship, cooperation, trade, among others). The SNA is constantly approached from a binary point of view, i.e., it is only observed if a link between two actors is present or not regardless of the strength of this link. It is known that different information can be obtained in weighted and unweighted networks and that the information extracted from weighted networks is more accurate and detailed. Another rarely discussed approach in the SNA is related to the individual attributes of the actors (nodes), because such analysis is usually focused on the topological structure of networks. Features of the nodes are not incorporated in the SNA what implies that there is some loss or misperception of information in those analyze. This paper aims at exploring more precisely the complexities of a social network, initially developing a method that inserts the individual attributes in the topological structure of the network and then analyzing the network in four different ways: unweighted, edge-weighted and two methods for using both edge-weights and nodes' attributes. The international trade network was chosen in the application of this approach, where the nodes represent the countries, the links represent the cash flow in the trade transactions and countries' GDP were chosen as nodes' attributes. As a result, it is possible to observe which countries are most connected in the world economy and with higher cash flows, to point out the countries that are central to the intermediation of the wealth flow and those that are most benefited from being included in this network. We also made a principal component analysis to study which metrics are more influential in describing the data variability, which turn out to be mostly the weighted metrics which include the nodes' attributes.

Neural bases of a specific strategy for visuospatial processing in rugby players.

PubMed

Sekiguchi, Atsushi; Yokoyama, Satoru; Kasahara, Satoshi; Yomogida, Yukihito; Takeuchi, Hikaru; Ogawa, Takeshi; Taki, Yasuyuki; Niwa, Shin-Ichi; Kawashima, Ryuta

2011-10-01

Rugby is one of the most tactically complex sports. Rugby coaching theory suggests that rugby players need to possess various cognitive abilities. A previous study claimed that rugby players have high visuospatial awareness, which is induced by a strategy described as taking a "bird's eye view." To examine if there were differential cortical networks related to visuospatial processing tasks among top-level rugby players and control novices, we compared brain activities during a visuospatial processing task between 20 male top-level rugby players (Top) and 20 control novice males (Novice) using functional magnetic resonance imaging (fMRI). To avoid the effect of differential behavioral performances on brain activation, we recruited novices whose visuospatial ability was expected to match that of the rugby players. We adopted a 3-D mental rotation task during fMRI scanning as a visuospatial processing task. Significantly greater activations from baseline were observed for the Top group than for the Novice group in the right superior parietal lobe and lateral occipital cortex. Significantly greater deactivations from baseline were observed for the Top group than for the Novice group in the right medial prefrontal cortex. The discrepancy between psychobehavioral outputs and the fMRI results suggested the existence of a cognitive strategy among top-level rugby players that differs from that among control novices. The greater activation of the right superior parietal lobe and lateral occipital cortex in top-level rugby players suggested a strategy involving visuospatial cognitive processing with respect to the bird's eye view. In addition, the right medial prefrontal cortex is known to be a part of the default mode networks, suggesting an additional cognitive load for the Top group when using the bird's-eye-view strategy. This further supported the existence of a specific cognitive strategy among top-level rugby players.

Metacommunity theory as a multispecies, multiscale framework for studying the influence of river network structure on riverine communities and ecosystems

USGS Publications Warehouse

Brown, B.L.; Swan, C.M.; Auerbach, D.A.; Campbell, Grant E.H.; Hitt, N.P.; Maloney, K.O.; Patrick, C.

2011-01-01

Explaining the mechanisms underlying patterns of species diversity and composition in riverine networks is challenging. Historically, community ecologists have conceived of communities as largely isolated entities and have focused on local environmental factors and interspecific interactions as the major forces determining species composition. However, stream ecologists have long embraced a multiscale approach to studying riverine ecosystems and have studied both local factors and larger-scale regional factors, such as dispersal and disturbance. River networks exhibit a dendritic spatial structure that can constrain aquatic organisms when their dispersal is influenced by or confined to the river network. We contend that the principles of metacommunity theory would help stream ecologists to understand how the complex spatial structure of river networks mediates the relative influences of local and regional control on species composition. From a basic ecological perspective, the concept is attractive because new evidence suggests that the importance of regional processes (dispersal) depends on spatial structure of habitat and on connection to the regional species pool. The role of local factors relative to regional factors will vary with spatial position in a river network. From an applied perspective, the long-standing view in ecology that local community composition is an indicator of habitat quality may not be uniformly applicable across a river network, but the strength of such bioassessment approaches probably will depend on spatial position in the network. The principles of metacommunity theory are broadly applicable across taxa and systems but seem of particular consequence to stream ecology given the unique spatial structure of riverine systems. By explicitly embracing processes at multiple spatial scales, metacommunity theory provides a foundation on which to build a richer understanding of stream communities.

A unifying view of synchronization for data assimilation in complex nonlinear networks

NASA Astrophysics Data System (ADS)

Abarbanel, Henry D. I.; Shirman, Sasha; Breen, Daniel; Kadakia, Nirag; Rey, Daniel; Armstrong, Eve; Margoliash, Daniel

2017-12-01

Networks of nonlinear systems contain unknown parameters and dynamical degrees of freedom that may not be observable with existing instruments. From observable state variables, we want to estimate the connectivity of a model of such a network and determine the full state of the model at the termination of a temporal observation window during which measurements transfer information to a model of the network. The model state at the termination of a measurement window acts as an initial condition for predicting the future behavior of the network. This allows the validation (or invalidation) of the model as a representation of the dynamical processes producing the observations. Once the model has been tested against new data, it may be utilized as a predictor of responses to innovative stimuli or forcing. We describe a general framework for the tasks involved in the "inverse" problem of determining properties of a model built to represent measured output from physical, biological, or other processes when the measurements are noisy, the model has errors, and the state of the model is unknown when measurements begin. This framework is called statistical data assimilation and is the best one can do in estimating model properties through the use of the conditional probability distributions of the model state variables, conditioned on observations. There is a very broad arena of applications of the methods described. These include numerical weather prediction, properties of nonlinear electrical circuitry, and determining the biophysical properties of functional networks of neurons. Illustrative examples will be given of (1) estimating the connectivity among neurons with known dynamics in a network of unknown connectivity, and (2) estimating the biophysical properties of individual neurons in vitro taken from a functional network underlying vocalization in songbirds.

Characterization of complex networks by higher order neighborhood properties

NASA Astrophysics Data System (ADS)

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

2008-01-01

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

Conceptual Architecture for Obtaining Cyber Situational Awareness

DTIC Science & Technology

2014-06-01

1-893723-17-8. [10] SKYBOX SECURITY. Developer´s Guide. Skybox View. Manual.Version 11. 2010. [11] SCALABLE Network. EXata communications...E. Understanding command and control. Washington, D.C.: CCRP Publication Series, 2006. 255 p. ISBN 1-893723-17-8. • [10] SKYBOX SECURITY. Developer...s Guide. Skybox View. Manual.Version 11. 2010. • [11] SCALABLE Network. EXata communications simulation platform. Available: <http://www.scalable

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

PubMed

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

2018-06-01

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

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

NASA Astrophysics Data System (ADS)

Zeng, Fang; Li, Xiang; Li, Ke

2017-02-01

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

Realizing actual feedback control of complex network

NASA Astrophysics Data System (ADS)

Tu, Chengyi; Cheng, Yuhua

2014-06-01

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

Toward a systems-level view of dynamic phosphorylation networks

PubMed Central

Newman, Robert H.; Zhang, Jin; Zhu, Heng

2014-01-01

To better understand how cells sense and respond to their environment, it is important to understand the organization and regulation of the phosphorylation networks that underlie most cellular signal transduction pathways. These networks, which are composed of protein kinases, protein phosphatases and their respective cellular targets, are highly dynamic. Importantly, to achieve signaling specificity, phosphorylation networks must be regulated at several levels, including at the level of protein expression, substrate recognition, and spatiotemporal modulation of enzymatic activity. Here, we briefly summarize some of the traditional methods used to study the phosphorylation status of cellular proteins before focusing our attention on several recent technological advances, such as protein microarrays, quantitative mass spectrometry, and genetically-targetable fluorescent biosensors, that are offering new insights into the organization and regulation of cellular phosphorylation networks. Together, these approaches promise to lead to a systems-level view of dynamic phosphorylation networks. PMID:25177341

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

NASA Astrophysics Data System (ADS)

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

2013-08-01

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

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

NASA Astrophysics Data System (ADS)

Yang, Bin

2017-07-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Individual nodeʼs contribution to the mesoscale of complex networks

NASA Astrophysics Data System (ADS)

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

2014-12-01

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

Artificial intelligence for analyzing orthopedic trauma radiographs.

PubMed

Olczak, Jakub; Fahlberg, Niklas; Maki, Atsuto; Razavian, Ali Sharif; Jilert, Anthony; Stark, André; Sköldenberg, Olof; Gordon, Max

2017-12-01

Background and purpose - Recent advances in artificial intelligence (deep learning) have shown remarkable performance in classifying non-medical images, and the technology is believed to be the next technological revolution. So far it has never been applied in an orthopedic setting, and in this study we sought to determine the feasibility of using deep learning for skeletal radiographs. Methods - We extracted 256,000 wrist, hand, and ankle radiographs from Danderyd's Hospital and identified 4 classes: fracture, laterality, body part, and exam view. We then selected 5 openly available deep learning networks that were adapted for these images. The most accurate network was benchmarked against a gold standard for fractures. We furthermore compared the network's performance with 2 senior orthopedic surgeons who reviewed images at the same resolution as the network. Results - All networks exhibited an accuracy of at least 90% when identifying laterality, body part, and exam view. The final accuracy for fractures was estimated at 83% for the best performing network. The network performed similarly to senior orthopedic surgeons when presented with images at the same resolution as the network. The 2 reviewer Cohen's kappa under these conditions was 0.76. Interpretation - This study supports the use for orthopedic radiographs of artificial intelligence, which can perform at a human level. While current implementation lacks important features that surgeons require, e.g. risk of dislocation, classifications, measurements, and combining multiple exam views, these problems have technical solutions that are waiting to be implemented for orthopedics.

Audio Classification in Speech and Music: A Comparison between a Statistical and a Neural Approach

NASA Astrophysics Data System (ADS)

Bugatti, Alessandro; Flammini, Alessandra; Migliorati, Pierangelo

2002-12-01

We focus the attention on the problem of audio classification in speech and music for multimedia applications. In particular, we present a comparison between two different techniques for speech/music discrimination. The first method is based on Zero crossing rate and Bayesian classification. It is very simple from a computational point of view, and gives good results in case of pure music or speech. The simulation results show that some performance degradation arises when the music segment contains also some speech superimposed on music, or strong rhythmic components. To overcome these problems, we propose a second method, that uses more features, and is based on neural networks (specifically a multi-layer Perceptron). In this case we obtain better performance, at the expense of a limited growth in the computational complexity. In practice, the proposed neural network is simple to be implemented if a suitable polynomial is used as the activation function, and a real-time implementation is possible even if low-cost embedded systems are used.

Local area networks in an imaging environment.

PubMed

Noz, M E; Maguire, G Q; Erdman, W A

1986-01-01

There is great interest at present in incorporating image-management systems popularly referred to as picture archiving and communication systems (PACS) into imaging departments. This paper will describe various aspects of local area networks (LANs) for medical images and will give a definition of terms and classification of devices by describing a possible system which links various digital image sources through a high-speed data link and a common image format, allows for viewing and processing of all images produced within the complex, and eliminates the transport of films. The status of standards governing LAN and particularly PACS systems along with a proposed image exchange format will be given. Prototype systems, particularly a system for nuclear medicine images, will be presented, as well as the prospects for the immediate future in terms of installations started and commercial products available. A survey of the many questions that arise in the development of a PACS for medical images and also a survey of the presently suggested/adopted answers will be given.

Using Neural Networks to Improve the Performance of Radiative Transfer Modeling Used for Geometry Dependent Surface Lambertian-Equivalent Reflectivity Calculations

NASA Technical Reports Server (NTRS)

Fasnacht, Zachary; Qin, Wenhan; Haffner, David P.; Loyola, Diego; Joiner, Joanna; Krotkov, Nickolay; Vasilkov, Alexander; Spurr, Robert

2017-01-01

Surface Lambertian-equivalent reflectivity (LER) is important for trace gas retrievals in the direct calculation of cloud fractions and indirect calculation of the air mass factor. Current trace gas retrievals use climatological surface LER's. Surface properties that impact the bidirectional reflectance distribution function (BRDF) as well as varying satellite viewing geometry can be important for retrieval of trace gases. Geometry Dependent LER (GLER) captures these effects with its calculation of sun normalized radiances (I/F) and can be used in current LER algorithms (Vasilkov et al. 2016). Pixel by pixel radiative transfer calculations are computationally expensive for large datasets. Modern satellite missions such as the Tropospheric Monitoring Instrument (TROPOMI) produce very large datasets as they take measurements at much higher spatial and spectral resolutions. Look up table (LUT) interpolation improves the speed of radiative transfer calculations but complexity increases for non-linear functions. Neural networks perform fast calculations and can accurately predict both non-linear and linear functions with little effort.

Investigating a holobiont: Microbiota perturbations and transkingdom networks.

PubMed

Greer, Renee; Dong, Xiaoxi; Morgun, Andrey; Shulzhenko, Natalia

2016-01-01

The scientific community has recently come to appreciate that, rather than existing as independent organisms, multicellular hosts and their microbiota comprise a complex evolving superorganism or metaorganism, termed a holobiont. This point of view leads to a re-evaluation of our understanding of different physiological processes and diseases. In this paper we focus on experimental and computational approaches which, when combined in one study, allowed us to dissect mechanisms (traditionally named host-microbiota interactions) regulating holobiont physiology. Specifically, we discuss several approaches for microbiota perturbation, such as use of antibiotics and germ-free animals, including advantages and potential caveats of their usage. We briefly review computational approaches to characterize the microbiota and, more importantly, methods to infer specific components of microbiota (such as microbes or their genes) affecting host functions. One such approach called transkingdom network analysis has been recently developed and applied in our study. (1) Finally, we also discuss common methods used to validate the computational predictions of host-microbiota interactions using in vitro and in vivo experimental systems.

Ethylene Control of Fruit Ripening: Revisiting the Complex Network of Transcriptional Regulation1

PubMed Central

Chervin, Christian; Bouzayen, Mondher

2015-01-01

The plant hormone ethylene plays a key role in climacteric fruit ripening. Studies on components of ethylene signaling have revealed a linear transduction pathway leading to the activation of ethylene response factors. However, the means by which ethylene selects the ripening-related genes and interacts with other signaling pathways to regulate the ripening process are still to be elucidated. Using tomato (Solanum lycopersicum) as a reference species, the present review aims to revisit the mechanisms by which ethylene regulates fruit ripening by taking advantage of new tools available to perform in silico studies at the genome-wide scale, leading to a global view on the expression pattern of ethylene biosynthesis and response genes throughout ripening. Overall, it provides new insights on the transcriptional network by which this hormone coordinates the ripening process and emphasizes the interplay between ethylene and ripening-associated developmental factors and the link between epigenetic regulation and ethylene during fruit ripening. PMID:26511917

SIGNALS AND REGULATORS THAT GOVERN STREPTOMYCES DEVELOPMENT

PubMed Central

McCormick, Joseph R.; Flärdh, Klas

2012-01-01

Streptomyces coelicolor is the genetically best characterized species of a populous genus belonging to the Gram-positive Actinobacteria. Streptomycetes are filamentous soil organisms, well known for the production of a plethora of biologically active secondary metabolic compounds. The Streptomyces developmental life cycle is uniquely complex, and involves coordinated multicellular development with both physiological and morphological differentiation of several cell types, culminating in production of secondary metabolites and dispersal of mature spores. This review presents a current appreciation of the signaling mechanisms used to orchestrate the decision to undergo morphological differentiation, and the regulators and regulatory networks that direct the intriguing development of multigenomic hyphae, first to form specialized aerial hyphae, and then to convert them into chains of dormant spores. This current view of S. coelicolor development is destined for rapid evolution as data from “-omics” studies shed light on gene regulatory networks, new genetic screens identify hitherto unknown players, and the resolution of our insights into the underlying cell biological processes steadily improve. PMID:22092088

Human activities recognition by head movement using partial recurrent neural network

NASA Astrophysics Data System (ADS)

Tan, Henry C. C.; Jia, Kui; De Silva, Liyanage C.

2003-06-01

Traditionally, human activities recognition has been achieved mainly by the statistical pattern recognition methods or the Hidden Markov Model (HMM). In this paper, we propose a novel use of the connectionist approach for the recognition of ten simple human activities: walking, sitting down, getting up, squatting down and standing up, in both lateral and frontal views, in an office environment. By means of tracking the head movement of the subjects over consecutive frames from a database of different color image sequences, and incorporating the Elman model of the partial recurrent neural network (RNN) that learns the sequential patterns of relative change of the head location in the images, the proposed system is able to robustly classify all the ten activities performed by unseen subjects from both sexes, of different race and physique, with a recognition rate as high as 92.5%. This demonstrates the potential of employing partial RNN to recognize complex activities in the increasingly popular human-activities-based applications.

In vivo genome-wide analysis of multiple tissues identifies gene regulatory networks, novel functions and downstream regulatory genes for Bapx1 and its co-regulation with Sox9 in the mammalian vertebral column.

PubMed

Chatterjee, Sumantra; Sivakamasundari, V; Yap, Sook Peng; Kraus, Petra; Kumar, Vibhor; Xing, Xing; Lim, Siew Lan; Sng, Joel; Prabhakar, Shyam; Lufkin, Thomas

2014-12-05

Vertebrate organogenesis is a highly complex process involving sequential cascades of transcription factor activation or repression. Interestingly a single developmental control gene can occasionally be essential for the morphogenesis and differentiation of tissues and organs arising from vastly disparate embryological lineages. Here we elucidated the role of the mammalian homeobox gene Bapx1 during the embryogenesis of five distinct organs at E12.5 - vertebral column, spleen, gut, forelimb and hindlimb - using expression profiling of sorted wildtype and mutant cells combined with genome wide binding site analysis. Furthermore we analyzed the development of the vertebral column at the molecular level by combining transcriptional profiling and genome wide binding data for Bapx1 with similarly generated data sets for Sox9 to assemble a detailed gene regulatory network revealing genes previously not reported to be controlled by either of these two transcription factors. The gene regulatory network appears to control cell fate decisions and morphogenesis in the vertebral column along with the prevention of premature chondrocyte differentiation thus providing a detailed molecular view of vertebral column development.

Comprehensive Reconstruction and Visualization of Non-Coding Regulatory Networks in Human

PubMed Central

Bonnici, Vincenzo; Russo, Francesco; Bombieri, Nicola; Pulvirenti, Alfredo; Giugno, Rosalba

2014-01-01

Research attention has been powered to understand the functional roles of non-coding RNAs (ncRNAs). Many studies have demonstrated their deregulation in cancer and other human disorders. ncRNAs are also present in extracellular human body fluids such as serum and plasma, giving them a great potential as non-invasive biomarkers. However, non-coding RNAs have been relatively recently discovered and a comprehensive database including all of them is still missing. Reconstructing and visualizing the network of ncRNAs interactions are important steps to understand their regulatory mechanism in complex systems. This work presents ncRNA-DB, a NoSQL database that integrates ncRNAs data interactions from a large number of well established on-line repositories. The interactions involve RNA, DNA, proteins, and diseases. ncRNA-DB is available at http://ncrnadb.scienze.univr.it/ncrnadb/. It is equipped with three interfaces: web based, command-line, and a Cytoscape app called ncINetView. By accessing only one resource, users can search for ncRNAs and their interactions, build a network annotated with all known ncRNAs and associated diseases, and use all visual and mining features available in Cytoscape. PMID:25540777

Towards Socially-Responsible Management of Personal Information in Social Networks

NASA Astrophysics Data System (ADS)

Morin, Jean-Henry

Considering the increasing number of Personal Information (PI) used and shared in our now common social networked interactions, privacy issues, retention and how such information are manages have become important. Most approaches rely on one-way disclaimers and policies, often complex, hard to find and lacking ease of understanding for ordinary users of such common networks. Thus leaving little room for users to actually retain any control how the released information is actually used and managed once it has been put online. Additionally, personal information (PI) may include digital artifacts and contributions for which people would legitimately like to retain some rights over their use and their lifetime. Of particular interest in this category is the notion of the "right to forget" we no longer have control over, given the persistent nature of the Internet and its ability to retain information forever. This paper examines this issue from the point of view of the user and social responsibility, arguing for the need to augment information with an additional set of metadata about its usage and management. We discuss the use of DRM technologies in this context as a possible direction.

Comprehensive reconstruction and visualization of non-coding regulatory networks in human.

PubMed

Bonnici, Vincenzo; Russo, Francesco; Bombieri, Nicola; Pulvirenti, Alfredo; Giugno, Rosalba

2014-01-01

Research attention has been powered to understand the functional roles of non-coding RNAs (ncRNAs). Many studies have demonstrated their deregulation in cancer and other human disorders. ncRNAs are also present in extracellular human body fluids such as serum and plasma, giving them a great potential as non-invasive biomarkers. However, non-coding RNAs have been relatively recently discovered and a comprehensive database including all of them is still missing. Reconstructing and visualizing the network of ncRNAs interactions are important steps to understand their regulatory mechanism in complex systems. This work presents ncRNA-DB, a NoSQL database that integrates ncRNAs data interactions from a large number of well established on-line repositories. The interactions involve RNA, DNA, proteins, and diseases. ncRNA-DB is available at http://ncrnadb.scienze.univr.it/ncrnadb/. It is equipped with three interfaces: web based, command-line, and a Cytoscape app called ncINetView. By accessing only one resource, users can search for ncRNAs and their interactions, build a network annotated with all known ncRNAs and associated diseases, and use all visual and mining features available in Cytoscape.

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

NASA Astrophysics Data System (ADS)

Yasami, Yasser; Safaei, Farshad

2018-02-01

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

Limited-path-length entanglement percolation in quantum complex networks

NASA Astrophysics Data System (ADS)

Cuquet, Martí; Calsamiglia, John

2011-03-01

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

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

NASA Astrophysics Data System (ADS)

Pasten, D.

2017-12-01

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

Security Shift in Future Network Architectures

DTIC Science & Technology

2010-11-01

RTO-MP-IST-091 2 - 1 Security Shift in Future Network Architectures Tim Hartog, M.Sc Information Security Dept. TNO Information and...current practice military communication infrastructures are deployed as stand-alone networked information systems. Network -Enabled Capabilities (NEC) and...information architects and security specialists about the separation of network and information security, the consequences of this shift and our view

Management Strategies for Complex Adaptive Systems: Sensemaking, Learning, and Improvisation

ERIC Educational Resources Information Center

McDaniel, Reuben R., Jr.

2007-01-01

Misspecification of the nature of organizations may be a major reason for difficulty in achieving performance improvement. Organizations are often viewed as machine-like, but complexity science suggests that organizations should be viewed as complex adaptive systems. I identify the characteristics of complex adaptive systems and give examples of…

Complex signal-based optical coherence tomography angiography enables in vivo visualization of choriocapillaris in human choroid

NASA Astrophysics Data System (ADS)

Chu, Zhongdi; Chen, Chieh-Li; Zhang, Qinqin; Pepple, Kathryn; Durbin, Mary; Gregori, Giovanni; Wang, Ruikang K.

2017-12-01

The choriocapillaris (CC) plays an essential role in maintaining the normal functions of the human eye. There is increasing interest in the community to develop an imaging technique for visualizing the CC, yet this remains underexplored due to technical limitations. We propose an approach for the visualization of the CC in humans via a complex signal-based optical microangiography (OMAG) algorithm, based on commercially available spectral domain optical coherence tomography (SD-OCT). We show that the complex signal-based OMAG was superior to both the phase and amplitude signal-based approaches in detailing the vascular lobules previously seen with histological analysis. With this improved ability to visualize the lobular vascular networks, it is possible to identify the feeding arterioles and draining venules around the lobules, which is important in understanding the role of the CC in the pathogenesis of ocular diseases. With built-in FastTrac™ and montage scanning capabilities, we also demonstrate wide-field SD-OCT angiograms of the CC with a field of view at 9×11 mm2.