WorldWideScience

Sample records for networks largely overlapped

  1. Overlapping community detection in weighted networks via a Bayesian approach

    Science.gov (United States)

    Chen, Yi; Wang, Xiaolong; Xiang, Xin; Tang, Buzhou; Chen, Qingcai; Fan, Shixi; Bu, Junzhao

    2017-02-01

    Complex networks as a powerful way to represent complex systems have been widely studied during the past several years. One of the most important tasks of complex network analysis is to detect communities embedded in networks. In the real world, weighted networks are very common and may contain overlapping communities where a node is allowed to belong to multiple communities. In this paper, we propose a novel Bayesian approach, called the Bayesian mixture network (BMN) model, to detect overlapping communities in weighted networks. The advantages of our method are (i) providing soft-partition solutions in weighted networks; (ii) providing soft memberships, which quantify 'how strongly' a node belongs to a community. Experiments on a large number of real and synthetic networks show that our model has the ability in detecting overlapping communities in weighted networks and is competitive with other state-of-the-art models at shedding light on community partition.

  2. Link overlap, viability, and mutual percolation in multiplex networks

    International Nuclear Information System (INIS)

    Min, Byungjoon; Lee, Sangchul; Lee, Kyu-Min; Goh, K.-I.

    2015-01-01

    Many real-world complex systems are best modeled by multiplex networks. The multiplexity has proved to have broad impact on the system’s structure and function. Most theoretical studies on multiplex networks to date, however, have largely ignored the effect of the link overlap across layers despite strong empirical evidences for its significance. In this article, we investigate the effect of the link overlap in the viability of multiplex networks, both analytically and numerically. After a short recap of the original multiplex viability study, the distinctive role of overlapping links in viability and mutual connectivity is emphasized and exploited for setting up a proper analytic framework. A rich phase diagram for viability is obtained and greatly diversified patterns of hysteretic behavior in viability are observed in the presence of link overlap. Mutual percolation with link overlap is revisited as a limit of multiplex viability problem, and the controversy between existing results is clarified. The distinctive role of overlapping links is further demonstrated by the different responses of networks under random removals of overlapping and non-overlapping links, respectively, as well as under several link-removal strategies. Our results show that the link overlap facilitates the viability and mutual percolation; at the same time, the presence of link overlap poses a challenge in analytical approaches to the problem

  3. Finding overlapping communities in multilayer networks.

    Science.gov (United States)

    Liu, Weiyi; Suzumura, Toyotaro; Ji, Hongyu; Hu, Guangmin

    2018-01-01

    Finding communities in multilayer networks is a vital step in understanding the structure and dynamics of these layers, where each layer represents a particular type of relationship between nodes in the natural world. However, most community discovery methods for multilayer networks may ignore the interplay between layers or the unique topological structure in a layer. Moreover, most of them can only detect non-overlapping communities. In this paper, we propose a new community discovery method for multilayer networks, which leverages the interplay between layers and the unique topology in a layer to reveal overlapping communities. Through a comprehensive analysis of edge behaviors within and across layers, we first calculate the similarities for edges from the same layer and the cross layers. Then, by leveraging these similarities, we can construct a dendrogram for the multilayer networks that takes both the unique topological structure and the important interplay into consideration. Finally, by introducing a new community density metric for multilayer networks, we can cut the dendrogram to get the overlapping communities for these layers. By applying our method on both synthetic and real-world datasets, we demonstrate that our method has an accurate performance in discovering overlapping communities in multilayer networks.

  4. Epidemics in partially overlapped multiplex networks.

    Directory of Open Access Journals (Sweden)

    Camila Buono

    Full Text Available Many real networks exhibit a layered structure in which links in each layer reflect the function of nodes on different environments. These multiple types of links are usually represented by a multiplex network in which each layer has a different topology. In real-world networks, however, not all nodes are present on every layer. To generate a more realistic scenario, we use a generalized multiplex network and assume that only a fraction [Formula: see text] of the nodes are shared by the layers. We develop a theoretical framework for a branching process to describe the spread of an epidemic on these partially overlapped multiplex networks. This allows us to obtain the fraction of infected individuals as a function of the effective probability that the disease will be transmitted [Formula: see text]. We also theoretically determine the dependence of the epidemic threshold on the fraction [Formula: see text] of shared nodes in a system composed of two layers. We find that in the limit of [Formula: see text] the threshold is dominated by the layer with the smaller isolated threshold. Although a system of two completely isolated networks is nearly indistinguishable from a system of two networks that share just a few nodes, we find that the presence of these few shared nodes causes the epidemic threshold of the isolated network with the lower propagating capacity to change discontinuously and to acquire the threshold of the other network.

  5. Epidemic spreading on complex networks with overlapping and non-overlapping community structure

    Science.gov (United States)

    Shang, Jiaxing; Liu, Lianchen; Li, Xin; Xie, Feng; Wu, Cheng

    2015-02-01

    Many real-world networks exhibit community structure where vertices belong to one or more communities. Recent studies show that community structure plays an import role in epidemic spreading. In this paper, we investigate how the extent of overlap among communities affects epidemics. In order to experiment on the characteristic of overlapping communities, we propose a rewiring algorithm that can change the community structure from overlapping to non-overlapping while maintaining the degree distribution of the network. We simulate the Susceptible-Infected-Susceptible (SIS) epidemic process on synthetic scale-free networks and real-world networks by applying our rewiring algorithm. Experiments show that epidemics spread faster on networks with higher level of overlapping communities. Furthermore, overlapping communities' effect interacts with the average degree's effect. Our work further illustrates the important role of overlapping communities in the process of epidemic spreading.

  6. A model for evolution of overlapping community networks

    Science.gov (United States)

    Karan, Rituraj; Biswal, Bibhu

    2017-05-01

    A model is proposed for the evolution of network topology in social networks with overlapping community structure. Starting from an initial community structure that is defined in terms of group affiliations, the model postulates that the subsequent growth and loss of connections is similar to the Hebbian learning and unlearning in the brain and is governed by two dominant factors: the strength and frequency of interaction between the members, and the degree of overlap between different communities. The temporal evolution from an initial community structure to the current network topology can be described based on these two parameters. It is possible to quantify the growth occurred so far and predict the final stationary state to which the network is likely to evolve. Applications in epidemiology or the spread of email virus in a computer network as well as finding specific target nodes to control it are envisaged. While facing the challenge of collecting and analyzing large-scale time-resolved data on social groups and communities one faces the most basic questions: how do communities evolve in time? This work aims to address this issue by developing a mathematical model for the evolution of community networks and studying it through computer simulation.

  7. The overlapping community structure of structural brain network in young healthy individuals.

    Directory of Open Access Journals (Sweden)

    Kai Wu

    2011-05-01

    Full Text Available Community structure is a universal and significant feature of many complex networks in biology, society, and economics. Community structure has also been revealed in human brain structural and functional networks in previous studies. However, communities overlap and share many edges and nodes. Uncovering the overlapping community structure of complex networks remains largely unknown in human brain networks. Here, using regional gray matter volume, we investigated the structural brain network among 90 brain regions (according to a predefined anatomical atlas in 462 young, healthy individuals. Overlapped nodes between communities were defined by assuming that nodes (brain regions can belong to more than one community. We demonstrated that 90 brain regions were organized into 5 overlapping communities associated with several well-known brain systems, such as the auditory/language, visuospatial, emotion, decision-making, social, control of action, memory/learning, and visual systems. The overlapped nodes were mostly involved in an inferior-posterior pattern and were primarily related to auditory and visual perception. The overlapped nodes were mainly attributed to brain regions with higher node degrees and nodal efficiency and played a pivotal role in the flow of information through the structural brain network. Our results revealed fuzzy boundaries between communities by identifying overlapped nodes and provided new insights into the understanding of the relationship between the structure and function of the human brain. This study provides the first report of the overlapping community structure of the structural network of the human brain.

  8. Overlapping community detection in networks with positive and negative links

    International Nuclear Information System (INIS)

    Chen, Y; Wang, X L; Yuan, B; Tang, B Z

    2014-01-01

    Complex networks considering both positive and negative links have gained considerable attention during the past several years. Community detection is one of the main challenges for complex network analysis. Most of the existing algorithms for community detection in a signed network aim at providing a hard-partition of the network where any node should belong to a community or not. However, they cannot detect overlapping communities where a node is allowed to belong to multiple communities. The overlapping communities widely exist in many real-world networks. In this paper, we propose a signed probabilistic mixture (SPM) model for overlapping community detection in signed networks. Compared with the existing models, the advantages of our methodology are (i) providing soft-partition solutions for signed networks; (ii) providing soft memberships of nodes. Experiments on a number of signed networks show that our SPM model: (i) can identify assortative structures or disassortative structures as the same as other state-of-the-art models; (ii) can detect overlapping communities; (iii) outperforms other state-of-the-art models at shedding light on the community detection in synthetic signed networks. (paper)

  9. Overlapping coalition formation games in wireless communication networks

    CERN Document Server

    Wang, Tianyu; Saad, Walid; Han, Zhu

    2017-01-01

    This brief introduces overlapping coalition formation games (OCF games), a novel mathematical framework from cooperative game theory that can be used to model, design and analyze cooperative scenarios in future wireless communication networks. The concepts of OCF games are explained, and several algorithmic aspects are studied. In addition, several major application scenarios are discussed. These applications are drawn from a variety of fields that include radio resource allocation in dense wireless networks, cooperative spectrum sensing for cognitive radio networks, and resource management for crowd sourcing. For each application, the use of OCF games is discussed in detail in order to show how this framework can be used to solve relevant wireless networking problems. Overlapping Coalition Formation Games in Wireless Communication Networks provides researchers, students and practitioners with a concise overview of existing works in this emerging area, exploring the relevant fundamental theories, key techniqu...

  10. Architecture and dynamics of overlapped RNA regulatory networks.

    Science.gov (United States)

    Lapointe, Christopher P; Preston, Melanie A; Wilinski, Daniel; Saunders, Harriet A J; Campbell, Zachary T; Wickens, Marvin

    2017-11-01

    A single protein can bind and regulate many mRNAs. Multiple proteins with similar specificities often bind and control overlapping sets of mRNAs. Yet little is known about the architecture or dynamics of overlapped networks. We focused on three proteins with similar structures and related RNA-binding specificities-Puf3p, Puf4p, and Puf5p of S. cerevisiae Using RNA Tagging, we identified a "super-network" comprised of four subnetworks: Puf3p, Puf4p, and Puf5p subnetworks, and one controlled by both Puf4p and Puf5p. The architecture of individual subnetworks, and thus the super-network, is determined by competition among particular PUF proteins to bind mRNAs, their affinities for binding elements, and the abundances of the proteins. The super-network responds dramatically: The remaining network can either expand or contract. These strikingly opposite outcomes are determined by an interplay between the relative abundance of the RNAs and proteins, and their affinities for one another. The diverse interplay between overlapping RNA-protein networks provides versatile opportunities for regulation and evolution. © 2017 Lapointe et al.; Published by Cold Spring Harbor Laboratory Press for the RNA Society.

  11. Detecting the overlapping and hierarchical community structure in complex networks

    International Nuclear Information System (INIS)

    Lancichinetti, Andrea; Fortunato, Santo; Kertesz, Janos

    2009-01-01

    Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other. Uncovering this community structure is one of the most important problems in the field of complex networks. Networks often show a hierarchical organization, with communities embedded within other communities; moreover, nodes can be shared between different communities. Here, we present the first algorithm that finds both overlapping communities and the hierarchical structure. The method is based on the local optimization of a fitness function. Community structure is revealed by peaks in the fitness histogram. The resolution can be tuned by a parameter enabling different hierarchical levels of organization to be investigated. Tests on real and artificial networks give excellent results.

  12. Statistically validated network of portfolio overlaps and systemic risk.

    Science.gov (United States)

    Gualdi, Stanislao; Cimini, Giulio; Primicerio, Kevin; Di Clemente, Riccardo; Challet, Damien

    2016-12-21

    Common asset holding by financial institutions (portfolio overlap) is nowadays regarded as an important channel for financial contagion with the potential to trigger fire sales and severe losses at the systemic level. We propose a method to assess the statistical significance of the overlap between heterogeneously diversified portfolios, which we use to build a validated network of financial institutions where links indicate potential contagion channels. The method is implemented on a historical database of institutional holdings ranging from 1999 to the end of 2013, but can be applied to any bipartite network. We find that the proportion of validated links (i.e. of significant overlaps) increased steadily before the 2007-2008 financial crisis and reached a maximum when the crisis occurred. We argue that the nature of this measure implies that systemic risk from fire sales liquidation was maximal at that time. After a sharp drop in 2008, systemic risk resumed its growth in 2009, with a notable acceleration in 2013. We finally show that market trends tend to be amplified in the portfolios identified by the algorithm, such that it is possible to have an informative signal about institutions that are about to suffer (enjoy) the most significant losses (gains).

  13. Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics.

    Directory of Open Access Journals (Sweden)

    István A Kovács

    Full Text Available BACKGROUND: Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. METHODOLOGY/PRINCIPAL FINDINGS: Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1 determine persvasively overlapping modules with high resolution; (2 uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3 allow the determination of key network nodes and (4 help to predict network dynamics. CONCLUSIONS/SIGNIFICANCE: The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction.

  14. Partially Overlapping Ownership and Contagion in Financial Networks

    Directory of Open Access Journals (Sweden)

    Micah Pollak

    2017-01-01

    Full Text Available Using historical banking data for the United States from the years 2000 to 2015 we characterize the probability and extent of a financial contagion using a calibrated network model of heterogeneous interbank exposures. Both the probability and the average extent of a contagion begin to rise in 2007 prior to the US financial crisis. Including a common asset in the model increases both the probability and extent of contagion, especially during the years of the financial crisis. Based on rising institutional ownership in the banking industry, we introduce a partially overlapping ownership asset that devalues endogenously. The addition of this asset increases the extent of a financial contagion. Our results show that trends in capital buffers and the distribution and type of assets have a significant effect on the predictions of financial network contagion models and that the rising trend in ownership of banks by banks amplifies shocks to the financial system.

  15. Partially Overlapping Brain Networks for Singing and Cello Playing

    Directory of Open Access Journals (Sweden)

    Melanie Segado

    2018-05-01

    Full Text Available This research uses an MR-Compatible cello to compare functional brain activation during singing and cello playing within the same individuals to determine the extent to which arbitrary auditory-motor associations, like those required to play the cello, co-opt functional brain networks that evolved for singing. Musical instrument playing and singing both require highly specific associations between sounds and movements. Because these are both used to produce musical sounds, it is often assumed in the literature that their neural underpinnings are highly similar. However, singing is an evolutionarily old human trait, and the auditory-motor associations used for singing are also used for speech and non-speech vocalizations. This sets it apart from the arbitrary auditory-motor associations required to play musical instruments. The pitch range of the cello is similar to that of the human voice, but cello playing is completely independent of the vocal apparatus, and can therefore be used to dissociate the auditory-vocal network from that of the auditory-motor network. While in the MR-Scanner, 11 expert cellists listened to and subsequently produced individual tones either by singing or cello playing. All participants were able to sing and play the target tones in tune (<50C deviation from target. We found that brain activity during cello playing directly overlaps with brain activity during singing in many areas within the auditory-vocal network. These include primary motor, dorsal pre-motor, and supplementary motor cortices (M1, dPMC, SMA,the primary and periprimary auditory cortices within the superior temporal gyrus (STG including Heschl's gyrus, anterior insula (aINS, anterior cingulate cortex (ACC, and intraparietal sulcus (IPS, and Cerebellum but, notably, exclude the periaqueductal gray (PAG and basal ganglia (Putamen. Second, we found that activity within the overlapping areas is positively correlated with, and therefore likely contributing to

  16. Partially Overlapping Brain Networks for Singing and Cello Playing.

    Science.gov (United States)

    Segado, Melanie; Hollinger, Avrum; Thibodeau, Joseph; Penhune, Virginia; Zatorre, Robert J

    2018-01-01

    This research uses an MR-Compatible cello to compare functional brain activation during singing and cello playing within the same individuals to determine the extent to which arbitrary auditory-motor associations, like those required to play the cello, co-opt functional brain networks that evolved for singing. Musical instrument playing and singing both require highly specific associations between sounds and movements. Because these are both used to produce musical sounds, it is often assumed in the literature that their neural underpinnings are highly similar. However, singing is an evolutionarily old human trait, and the auditory-motor associations used for singing are also used for speech and non-speech vocalizations. This sets it apart from the arbitrary auditory-motor associations required to play musical instruments. The pitch range of the cello is similar to that of the human voice, but cello playing is completely independent of the vocal apparatus, and can therefore be used to dissociate the auditory-vocal network from that of the auditory-motor network. While in the MR-Scanner, 11 expert cellists listened to and subsequently produced individual tones either by singing or cello playing. All participants were able to sing and play the target tones in tune (singing in many areas within the auditory-vocal network. These include primary motor, dorsal pre-motor, and supplementary motor cortices (M1, dPMC, SMA),the primary and periprimary auditory cortices within the superior temporal gyrus (STG) including Heschl's gyrus, anterior insula (aINS), anterior cingulate cortex (ACC), and intraparietal sulcus (IPS), and Cerebellum but, notably, exclude the periaqueductal gray (PAG) and basal ganglia (Putamen). Second, we found that activity within the overlapping areas is positively correlated with, and therefore likely contributing to, both singing and playing in tune determined with performance measures. Third, we found that activity in auditory areas is functionally

  17. Efficient inference of overlapping communities in complex networks

    DEFF Research Database (Denmark)

    Fruergaard, Bjarne Ørum; Herlau, Tue

    2014-01-01

    We discuss two views on extending existing methods for complex network modeling which we dub the communities first and the networks first view, respectively. Inspired by the networks first view that we attribute to White, Boorman, and Breiger (1976)[1], we formulate the multiple-networks stochastic...

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

    International Nuclear Information System (INIS)

    Yang Xuhua; Sun Youxian; Wang Bo; Wang Wanliang

    2008-01-01

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

  19. An Overlapping Communities Detection Algorithm via Maxing Modularity in Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Gao Zhi-Peng

    2016-01-01

    Full Text Available Community detection in opportunistic networks has been a significant and hot issue, which is used to understand characteristics of networks through analyzing structure of it. Community is used to represent a group of nodes in a network where nodes inside the community have more internal connections than external connections. However, most of the existing community detection algorithms focus on binary networks or disjoint community detection. In this paper, we propose a novel algorithm via maxing modularity of communities (MMCto find overlapping community structure in opportunistic networks. It utilizes contact history of nodes to calculate the relation intensity between nodes. It finds nodes with high relation intensity as the initial community and extend the community with nodes of higher belong degree. The algorithm achieves a rapid and efficient overlapping community detection method by maxing the modularity of community continuously. The experiments prove that MMC is effective for uncovering overlapping communities and it achieves better performance than COPRA and Conductance.

  20. Detecting overlapping community structure of networks based on vertex–vertex correlations

    International Nuclear Information System (INIS)

    Zarei, Mina; Izadi, Dena; Samani, Keivan Aghababaei

    2009-01-01

    Using the NMF (non-negative matrix factorization) method, the structure of overlapping communities in complex networks is investigated. For the feature matrix of the NMF method we introduce a vertex–vertex correlation matrix. The method is applied to some computer-generated and real-world networks. Simulations show that this feature matrix gives more reasonable results

  1. Querying Large Biological Network Datasets

    Science.gov (United States)

    Gulsoy, Gunhan

    2013-01-01

    New experimental methods has resulted in increasing amount of genetic interaction data to be generated every day. Biological networks are used to store genetic interaction data gathered. Increasing amount of data available requires fast large scale analysis methods. Therefore, we address the problem of querying large biological network datasets.…

  2. Eigenspaces of networks reveal the overlapping and hierarchical community structure more precisely

    International Nuclear Information System (INIS)

    Ma, Xiaoke; Gao, Lin; Yong, Xuerong

    2010-01-01

    Identifying community structure is fundamental for revealing the structure–functionality relationship in complex networks, and spectral algorithms have been shown to be powerful for this purpose. In a traditional spectral algorithm, each vertex of a network is embedded into a spectral space by making use of the eigenvectors of the adjacency matrix or Laplacian matrix of the graph. In this paper, a novel spectral approach for revealing the overlapping and hierarchical community structure of complex networks is proposed by not only using the eigenvalues and eigenvectors but also the properties of eigenspaces of the networks involved. This gives us a better characterization of community. We first show that the communicability between a pair of vertices can be rewritten in term of eigenspaces of a network. An agglomerative clustering algorithm is then presented to discover the hierarchical communities using the communicability matrix. Finally, these overlapping vertices are discovered with the corresponding eigenspaces, based on the fact that the vertices more densely connected amongst one another are more likely to be linked through short cycles. Compared with the traditional spectral algorithms, our algorithm can identify both the overlapping and hierarchical community without increasing the time complexity O(n 3 ), where n is the size of the network. Furthermore, our algorithm can also distinguish the overlapping vertices from bridges. The method is tested by applying it to some computer-generated and real-world networks. The experimental results indicate that our algorithm can reveal community structure more precisely than the traditional spectral approaches

  3. Exploring hierarchical and overlapping modular structure in the yeast protein interaction network

    Directory of Open Access Journals (Sweden)

    Zhao Yi

    2010-12-01

    Full Text Available Abstract Background Developing effective strategies to reveal modular structures in protein interaction networks is crucial for better understanding of molecular mechanisms of underlying biological processes. In this paper, we propose a new density-based algorithm (ADHOC for clustering vertices of a protein interaction network using a novel subgraph density measurement. Results By statistically evaluating several independent criteria, we found that ADHOC could significantly improve the outcome as compared with five previously reported density-dependent methods. We further applied ADHOC to investigate the hierarchical and overlapping modular structure in the yeast PPI network. Our method could effectively detect both protein modules and the overlaps between them, and thus greatly promote the precise prediction of protein functions. Moreover, by further assaying the intermodule layer of the yeast PPI network, we classified hubs into two types, module hubs and inter-module hubs. Each type presents distinct characteristics both in network topology and biological functions, which could conduce to the better understanding of relationship between network architecture and biological implications. Conclusions Our proposed algorithm based on the novel subgraph density measurement makes it possible to more precisely detect hierarchical and overlapping modular structures in protein interaction networks. In addition, our method also shows a strong robustness against the noise in network, which is quite critical for analyzing such a high noise network.

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

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  5. CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks

    Science.gov (United States)

    Franke, R.

    2016-11-01

    In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.

  6. Exploring overlapping functional units with various structure in protein interaction networks.

    Directory of Open Access Journals (Sweden)

    Xiao-Fei Zhang

    Full Text Available Revealing functional units in protein-protein interaction (PPI networks are important for understanding cellular functional organization. Current algorithms for identifying functional units mainly focus on cohesive protein complexes which have more internal interactions than external interactions. Most of these approaches do not handle overlaps among complexes since they usually allow a protein to belong to only one complex. Moreover, recent studies have shown that other non-cohesive structural functional units beyond complexes also exist in PPI networks. Thus previous algorithms that just focus on non-overlapping cohesive complexes are not able to present the biological reality fully. Here, we develop a new regularized sparse random graph model (RSRGM to explore overlapping and various structural functional units in PPI networks. RSRGM is principally dominated by two model parameters. One is used to define the functional units as groups of proteins that have similar patterns of connections to others, which allows RSRGM to detect non-cohesive structural functional units. The other one is used to represent the degree of proteins belonging to the units, which supports a protein belonging to more than one revealed unit. We also propose a regularizer to control the smoothness between the estimators of these two parameters. Experimental results on four S. cerevisiae PPI networks show that the performance of RSRGM on detecting cohesive complexes and overlapping complexes is superior to that of previous competing algorithms. Moreover, RSRGM has the ability to discover biological significant functional units besides complexes.

  7. Relative camera localisation in non-overlapping camera networks using multiple trajectories

    NARCIS (Netherlands)

    John, V.; Englebienne, G.; Kröse, B.J.A.

    2012-01-01

    In this article we present an automatic camera calibration algorithm using multiple trajectories in a multiple camera network with non-overlapping field-of-views (FOV). Visible trajectories within a camera FOV are assumed to be measured with respect to the camera local co-ordinate system.

  8. Network module detection: Affinity search technique with the multi-node topological overlap measure.

    Science.gov (United States)

    Li, Ai; Horvath, Steve

    2009-07-20

    Many clustering procedures only allow the user to input a pairwise dissimilarity or distance measure between objects. We propose a clustering method that can input a multi-point dissimilarity measure d(i1, i2, ..., iP) where the number of points P can be larger than 2. The work is motivated by gene network analysis where clusters correspond to modules of highly interconnected nodes. Here, we define modules as clusters of network nodes with high multi-node topological overlap. The topological overlap measure is a robust measure of interconnectedness which is based on shared network neighbors. In previous work, we have shown that the multi-node topological overlap measure yields biologically meaningful results when used as input of network neighborhood analysis. We adapt network neighborhood analysis for the use of module detection. We propose the Module Affinity Search Technique (MAST), which is a generalized version of the Cluster Affinity Search Technique (CAST). MAST can accommodate a multi-node dissimilarity measure. Clusters grow around user-defined or automatically chosen seeds (e.g. hub nodes). We propose both local and global cluster growth stopping rules. We use several simulations and a gene co-expression network application to argue that the MAST approach leads to biologically meaningful results. We compare MAST with hierarchical clustering and partitioning around medoid clustering. Our flexible module detection method is implemented in the MTOM software which can be downloaded from the following webpage: http://www.genetics.ucla.edu/labs/horvath/MTOM/

  9. A game theoretic algorithm to detect overlapping community structure in networks

    Science.gov (United States)

    Zhou, Xu; Zhao, Xiaohui; Liu, Yanheng; Sun, Geng

    2018-04-01

    Community detection can be used as an important technique for product and personalized service recommendation. A game theory based approach to detect overlapping community structure is introduced in this paper. The process of the community formation is converted into a game, when all agents (nodes) cannot improve their own utility, the game process will be terminated. The utility function is composed of a gain and a loss function and we present a new gain function in this paper. In addition, different from choosing action randomly among join, quit and switch for each agent to get new label, two new strategies for each agent to update its label are designed during the game, and the strategies are also evaluated and compared for each agent in order to find its best result. The overlapping community structure is naturally presented when the stop criterion is satisfied. The experimental results demonstrate that the proposed algorithm outperforms other similar algorithms for detecting overlapping communities in networks.

  10. A cooperative game framework for detecting overlapping communities in social networks

    Science.gov (United States)

    Jonnalagadda, Annapurna; Kuppusamy, Lakshmanan

    2018-02-01

    Community detection in social networks is a challenging and complex task, which received much attention from researchers of multiple domains in recent years. The evolution of communities in social networks happens merely due to the self-interest of the nodes. The interesting feature of community structure in social networks is the multi membership of the nodes resulting in overlapping communities. Assuming the nodes of the social network as self-interested players, the dynamics of community formation can be captured in the form of a game. In this paper, we propose a greedy algorithm, namely, Weighted Graph Community Game (WGCG), in order to model the interactions among the self-interested nodes of the social network. The proposed algorithm employs the Shapley value mechanism to discover the inherent communities of the underlying social network. The experimental evaluation on the real-world and synthetic benchmark networks demonstrates that the performance of the proposed algorithm is superior to the state-of-the-art overlapping community detection algorithms.

  11. Network neighborhood analysis with the multi-node topological overlap measure.

    Science.gov (United States)

    Li, Ai; Horvath, Steve

    2007-01-15

    The goal of neighborhood analysis is to find a set of genes (the neighborhood) that is similar to an initial 'seed' set of genes. Neighborhood analysis methods for network data are important in systems biology. If individual network connections are susceptible to noise, it can be advantageous to define neighborhoods on the basis of a robust interconnectedness measure, e.g. the topological overlap measure. Since the use of multiple nodes in the seed set may lead to more informative neighborhoods, it can be advantageous to define multi-node similarity measures. The pairwise topological overlap measure is generalized to multiple network nodes and subsequently used in a recursive neighborhood construction method. A local permutation scheme is used to determine the neighborhood size. Using four network applications and a simulated example, we provide empirical evidence that the resulting neighborhoods are biologically meaningful, e.g. we use neighborhood analysis to identify brain cancer related genes. An executable Windows program and tutorial for multi-node topological overlap measure (MTOM) based analysis can be downloaded from the webpage (http://www.genetics.ucla.edu/labs/horvath/MTOM/).

  12. In-Band Full-Duplex Communications for Cellular Networks with Partial Uplink/Downlink Overlap

    KAUST Repository

    AlAmmouri, Ahmad

    2015-12-06

    In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization in cellular networks. However, the explicit impact of spatial interference, imposed by FD communications, on uplink and downlink transmissions has been overlooked in the literature. This paper presents an extensive study of the explicit effect of FD communications on the uplink and downlink performances. For the sake of rigorous analysis, we develop a tractable framework based on stochastic geometry toolset. The developed model accounts for uplink truncated channel inversion power control in FD cellular networks. The study shows that FD communications improve the downlink throughput at the expense of significant degradation in the uplink throughput. Therefore, we propose a novel fine-grained duplexing scheme, denoted as α-duplex scheme, which allows a partial overlap between uplink and downlink frequency bands. To this end, we show that the amount of the overlap can be optimized via adjusting α to achieve a certain design objective.

  13. In-Band Full-Duplex Communications for Cellular Networks with Partial Uplink/Downlink Overlap

    KAUST Repository

    Alammouri, Ahmad; Elsawy, Hesham; Amin, Osama; Alouini, Mohamed-Slim

    2015-01-01

    In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization in cellular networks. However, the explicit impact of spatial interference, imposed by FD communications, on uplink and downlink transmissions has been overlooked in the literature. This paper presents an extensive study of the explicit effect of FD communications on the uplink and downlink performances. For the sake of rigorous analysis, we develop a tractable framework based on stochastic geometry toolset. The developed model accounts for uplink truncated channel inversion power control in FD cellular networks. The study shows that FD communications improve the downlink throughput at the expense of significant degradation in the uplink throughput. Therefore, we propose a novel fine-grained duplexing scheme, denoted as α-duplex scheme, which allows a partial overlap between uplink and downlink frequency bands. To this end, we show that the amount of the overlap can be optimized via adjusting α to achieve a certain design objective.

  14. Semantic integration to identify overlapping functional modules in protein interaction networks

    Directory of Open Access Journals (Sweden)

    Ramanathan Murali

    2007-07-01

    Full Text Available Abstract Background The systematic analysis of protein-protein interactions can enable a better understanding of cellular organization, processes and functions. Functional modules can be identified from the protein interaction networks derived from experimental data sets. However, these analyses are challenging because of the presence of unreliable interactions and the complex connectivity of the network. The integration of protein-protein interactions with the data from other sources can be leveraged for improving the effectiveness of functional module detection algorithms. Results We have developed novel metrics, called semantic similarity and semantic interactivity, which use Gene Ontology (GO annotations to measure the reliability of protein-protein interactions. The protein interaction networks can be converted into a weighted graph representation by assigning the reliability values to each interaction as a weight. We presented a flow-based modularization algorithm to efficiently identify overlapping modules in the weighted interaction networks. The experimental results show that the semantic similarity and semantic interactivity of interacting pairs were positively correlated with functional co-occurrence. The effectiveness of the algorithm for identifying modules was evaluated using functional categories from the MIPS database. We demonstrated that our algorithm had higher accuracy compared to other competing approaches. Conclusion The integration of protein interaction networks with GO annotation data and the capability of detecting overlapping modules substantially improve the accuracy of module identification.

  15. Data on overlapping brain disorders and emerging drug targets in human Dopamine Receptors Interaction Network

    Directory of Open Access Journals (Sweden)

    Avijit Podder

    2017-06-01

    Full Text Available Intercommunication of Dopamine Receptors (DRs with their associate protein partners is crucial to maintain regular brain function in human. Majority of the brain disorders arise due to malfunctioning of such communication process. Hence, contributions of genetic factors, as well as phenotypic indications for various neurological and psychiatric disorders are often attributed as sharing in nature. In our earlier research article entitled “Human Dopamine Receptors Interaction Network (DRIN: a systems biology perspective on topology, stability and functionality of the network” (Podder et al., 2014 [1], we had depicted a holistic interaction map of human Dopamine Receptors. Given emphasis on the topological parameters, we had characterized the functionality along with the vulnerable properties of the network. In support of this, we hereby provide an additional data highlighting the genetic overlapping of various brain disorders in the network. The data indicates the sharing nature of disease genes for various neurological and psychiatric disorders in dopamine receptors connecting protein-protein interactions network. The data also indicates toward an alternative approach to prioritize proteins for overlapping brain disorders as valuable drug targets in the network.

  16. Mapping change in large networks.

    Directory of Open Access Journals (Sweden)

    Martin Rosvall

    2010-01-01

    Full Text Available Change is a fundamental ingredient of interaction patterns in biology, technology, the economy, and science itself: Interactions within and between organisms change; transportation patterns by air, land, and sea all change; the global financial flow changes; and the frontiers of scientific research change. Networks and clustering methods have become important tools to comprehend instances of these large-scale structures, but without methods to distinguish between real trends and noisy data, these approaches are not useful for studying how networks change. Only if we can assign significance to the partitioning of single networks can we distinguish meaningful structural changes from random fluctuations. Here we show that bootstrap resampling accompanied by significance clustering provides a solution to this problem. To connect changing structures with the changing function of networks, we highlight and summarize the significant structural changes with alluvial diagrams and realize de Solla Price's vision of mapping change in science: studying the citation pattern between about 7000 scientific journals over the past decade, we find that neuroscience has transformed from an interdisciplinary specialty to a mature and stand-alone discipline.

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

    International Nuclear Information System (INIS)

    Yang Xuhua; Sun Bao; Wang Bo; Sun Youxian

    2010-01-01

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

  18. Largely overlapping neuronal substrates of reactivity to drug, gambling, food and sexual cues: A comprehensive meta-analysis.

    Science.gov (United States)

    Noori, Hamid R; Cosa Linan, Alejandro; Spanagel, Rainer

    2016-09-01

    Cue reactivity to natural and social rewards is essential for motivational behavior. However, cue reactivity to drug rewards can also elicit craving in addicted subjects. The degree to which drug and natural rewards share neural substrates is not known. The objective of this study is to conduct a comprehensive meta-analysis of neuroimaging studies on drug, gambling and natural stimuli (food and sex) to identify the common and distinct neural substrates of cue reactivity to drug and natural rewards. Neural cue reactivity studies were selected for the meta-analysis by means of activation likelihood estimations, followed by sensitivity and clustering analyses of averaged neuronal response patterns. Data from 176 studies (5573 individuals) suggests largely overlapping neural response patterns towards all tested reward modalities. Common cue reactivity to natural and drug rewards was expressed by bilateral neural responses within anterior cingulate gyrus, insula, caudate head, inferior frontal gyrus, middle frontal gyrus and cerebellum. However, drug cues also generated distinct activation patterns in medial frontal gyrus, middle temporal gyrus, posterior cingulate gyrus, caudate body and putamen. Natural (sexual) reward cues induced unique activation of the pulvinar in thalamus. Neural substrates of cue reactivity to alcohol, drugs of abuse, food, sex and gambling are largely overlapping and comprise a network that processes reward, emotional responses and habit formation. This suggests that cue-mediated craving involves mechanisms that are not exclusive for addictive disorders but rather resemble the intersection of information pathways for processing reward, emotional responses, non-declarative memory and obsessive-compulsive behavior. Copyright © 2016 Elsevier B.V. and ECNP. All rights reserved.

  19. Word and face processing engage overlapping distributed networks: Evidence from RSVP and EEG investigations.

    Science.gov (United States)

    Robinson, Amanda K; Plaut, David C; Behrmann, Marlene

    2017-07-01

    Words and faces have vastly different visual properties, but increasing evidence suggests that word and face processing engage overlapping distributed networks. For instance, fMRI studies have shown overlapping activity for face and word processing in the fusiform gyrus despite well-characterized lateralization of these objects to the left and right hemispheres, respectively. To investigate whether face and word perception influences perception of the other stimulus class and elucidate the mechanisms underlying such interactions, we presented images using rapid serial visual presentations. Across 3 experiments, participants discriminated 2 face, word, and glasses targets (T1 and T2) embedded in a stream of images. As expected, T2 discrimination was impaired when it followed T1 by 200 to 300 ms relative to longer intertarget lags, the so-called attentional blink. Interestingly, T2 discrimination accuracy was significantly reduced at short intertarget lags when a face was followed by a word (face-word) compared with glasses-word and word-word combinations, indicating that face processing interfered with word perception. The reverse effect was not observed; that is, word-face performance was no different than the other object combinations. EEG results indicated the left N170 to T1 was correlated with the word decrement for face-word trials, but not for other object combinations. Taken together, the results suggest face processing interferes with word processing, providing evidence for overlapping neural mechanisms of these 2 object types. Furthermore, asymmetrical face-word interference points to greater overlap of face and word representations in the left than the right hemisphere. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

  20. Large area crystallization of amorphous Si with overlapping high repetition rate laser pulses

    KAUST Repository

    Ryu, Sang-Gil

    2012-09-01

    This paper presents a pulsed laser crystallization technique, enabling large area crystallization of amorphous Si to produce grains having well-defined size and orientation. The method is developed by first determining the parameters influencing crystallization induced by single laser pulses of circular cross-sectional profile. In a second step, crystallization by overlapping round spots is examined. The experiments reveal three zones characterized by distinctly different crystallized morphologies following the laser irradiation. One of these zones corresponds to the regime of lateral crystal growth, wherein grains are driven towards the center of the spot by the radial temperature gradient. These findings are then applied to processing via line beam profiles that facilitate large area crystallization upon rapid translation of the specimen. Crystallization of extended areas hinges on the determination of the crystal growth length for a single spot. The pitch between successive pulses is then set on the basis of this information. It is shown that the pulse energy has only a weak effect on the crystal growth length. © 2012 Elsevier B.V.

  1. Large gene overlaps in prokaryotic genomes: result of functional constraints or mispredictions?

    Directory of Open Access Journals (Sweden)

    Harrington Eoghan D

    2008-07-01

    Full Text Available Abstract Background Across the fully sequenced microbial genomes there are thousands of examples of overlapping genes. Many of these are only a few nucleotides long and are thought to function by permitting the coordinated regulation of gene expression. However, there should also be selective pressure against long overlaps, as the existence of overlapping reading frames increases the risk of deleterious mutations. Here we examine the longest overlaps and assess whether they are the product of special functional constraints or of erroneous annotation. Results We analysed the genes that overlap by 60 bps or more among 338 fully-sequenced prokaryotic genomes. The likely functional significance of an overlap was determined by comparing each of the genes to its respective orthologs. If a gene showed a significantly different length from its orthologs it was considered unlikely to be functional and therefore the result of an error either in sequencing or gene prediction. Focusing on 715 co-directional overlaps longer than 60 bps, we classified the erroneous ones into five categories: i 5'-end extension of the downstream gene due to either a mispredicted start codon or a frameshift at 5'-end of the gene (409 overlaps, ii fragmentation of a gene caused by a frameshift (163, iii 3'-end extension of the upstream gene due to either a frameshift at 3'-end of a gene or point mutation at the stop codon (68, iv Redundant gene predictions (4, v 5' & 3'-end extension which is a combination of i and iii (71. We also studied 75 divergent overlaps that could be classified as misannotations of group i. Nevertheless we found some convergent long overlaps (54 that might be true overlaps, although an important part of convergent overlaps could be classified as group iii (124. Conclusion Among the 968 overlaps larger than 60 bps which we analysed, we did not find a single real one among the co-directional and divergent orientations and concluded that there had been an

  2. Interference Management in Full-Duplex Cellular Networks with Partial Spectrum Overlap

    KAUST Repository

    Randrianantenaina, Itsikiantsoa

    2017-03-31

    Full-duplex (FD) communication is promoted to double the spectral efficiency when compared to the halfduplex (HD) counterpart. In the context of cellular networks, however, FD communication exacerbates the aggregate uplink and downlink interference, which diminishes the foreseen FD gains. This paper considers a flexible duplex system, denoted by -duplex (-D) system, wherein a fine-grained bandwidth control for each uplink/downlink channel pair in each base station (BS) is allowed, which also leads to partial spectrum overlap between the uplink and downlink channels. The paper addresses the resulting interference management problem by maximizing a network-wide rate-based utility function subject to uplink/downlink power constraints, so as to determine userto- BS association, user-to-channel scheduling, the UL and DL transmit powers, and the fraction of spectrum overlap between UL and DL for every user, under the assumption that the number of available channels and users are equal. The paper solves such a non-convex mixed-integer optimization problem in an iterative way by decoupling the problem into several subproblems. Particularly, the user-to-BS association problem is solved using a matching algorithm that is a generalization of the stable marriage problem. The scheduling problem is solved by iterative Hungarian algorithm. The power and spectrum overlap problem is solved by successive convex approximation. The proposed iterative strategy guarantees an efficient one-toone user to BS and channel assignment. It further provides optimized flexible duplexing and power allocation schemes for all transceivers. Simulations results show appreciable gains when comparing the proposed solution to different schemes from the literature.

  3. Interference Management in Full-Duplex Cellular Networks with Partial Spectrum Overlap

    KAUST Repository

    Randrianantenaina, Itsikiantsoa; Dahrouj, Hayssam; Elsawy, Hesham; Alouini, Mohamed-Slim

    2017-01-01

    Full-duplex (FD) communication is promoted to double the spectral efficiency when compared to the halfduplex (HD) counterpart. In the context of cellular networks, however, FD communication exacerbates the aggregate uplink and downlink interference, which diminishes the foreseen FD gains. This paper considers a flexible duplex system, denoted by -duplex (-D) system, wherein a fine-grained bandwidth control for each uplink/downlink channel pair in each base station (BS) is allowed, which also leads to partial spectrum overlap between the uplink and downlink channels. The paper addresses the resulting interference management problem by maximizing a network-wide rate-based utility function subject to uplink/downlink power constraints, so as to determine userto- BS association, user-to-channel scheduling, the UL and DL transmit powers, and the fraction of spectrum overlap between UL and DL for every user, under the assumption that the number of available channels and users are equal. The paper solves such a non-convex mixed-integer optimization problem in an iterative way by decoupling the problem into several subproblems. Particularly, the user-to-BS association problem is solved using a matching algorithm that is a generalization of the stable marriage problem. The scheduling problem is solved by iterative Hungarian algorithm. The power and spectrum overlap problem is solved by successive convex approximation. The proposed iterative strategy guarantees an efficient one-toone user to BS and channel assignment. It further provides optimized flexible duplexing and power allocation schemes for all transceivers. Simulations results show appreciable gains when comparing the proposed solution to different schemes from the literature.

  4. Estimates of segregation and overlap of functional connectivity networks in the human cerebral cortex.

    Science.gov (United States)

    Yeo, B T Thomas; Krienen, Fenna M; Chee, Michael W L; Buckner, Randy L

    2014-03-01

    The organization of the human cerebral cortex has recently been explored using techniques for parcellating the cortex into distinct functionally coupled networks. The divergent and convergent nature of cortico-cortical anatomic connections suggests the need to consider the possibility of regions belonging to multiple networks and hierarchies among networks. Here we applied the Latent Dirichlet Allocation (LDA) model and spatial independent component analysis (ICA) to solve for functionally coupled cerebral networks without assuming that cortical regions belong to a single network. Data analyzed included 1000 subjects from the Brain Genomics Superstruct Project (GSP) and 12 high quality individual subjects from the Human Connectome Project (HCP). The organization of the cerebral cortex was similar regardless of whether a winner-take-all approach or the more relaxed constraints of LDA (or ICA) were imposed. This suggests that large-scale networks may function as partially isolated modules. Several notable interactions among networks were uncovered by the LDA analysis. Many association regions belong to at least two networks, while somatomotor and early visual cortices are especially isolated. As examples of interaction, the precuneus, lateral temporal cortex, medial prefrontal cortex and posterior parietal cortex participate in multiple paralimbic networks that together comprise subsystems of the default network. In addition, regions at or near the frontal eye field and human lateral intraparietal area homologue participate in multiple hierarchically organized networks. These observations were replicated in both datasets and could be detected (and replicated) in individual subjects from the HCP. © 2013.

  5. Large area crystallization of amorphous Si with overlapping high repetition rate laser pulses

    KAUST Repository

    Ryu, Sang-Gil; Gruber, Ivan; Grigoropoulos, Costas P.; Poulikakos, Dimos; Moon, Seung-Jae

    2012-01-01

    crystallization induced by single laser pulses of circular cross-sectional profile. In a second step, crystallization by overlapping round spots is examined. The experiments reveal three zones characterized by distinctly different crystallized morphologies

  6. Large scale network-centric distributed systems

    CERN Document Server

    Sarbazi-Azad, Hamid

    2014-01-01

    A highly accessible reference offering a broad range of topics and insights on large scale network-centric distributed systems Evolving from the fields of high-performance computing and networking, large scale network-centric distributed systems continues to grow as one of the most important topics in computing and communication and many interdisciplinary areas. Dealing with both wired and wireless networks, this book focuses on the design and performance issues of such systems. Large Scale Network-Centric Distributed Systems provides in-depth coverage ranging from ground-level hardware issu

  7. Genetic overlap between impulsivity and alcohol dependence: a large-scale national twin study.

    Science.gov (United States)

    Khemiri, L; Kuja-Halkola, R; Larsson, H; Jayaram-Lindström, N

    2016-04-01

    Alcohol dependence is associated with increased levels of impulsivity, but the genetic and environmental underpinnings of this overlap remain unclear. The purpose of the current study was to investigate the degree to which genetic and environmental factors contribute to the overlap between alcohol dependence and impulsivity. Univariate and bivariate twin model fitting was conducted for alcohol dependence and impulsivity in a national sample of 16 819 twins born in Sweden from 1959 to 1985. The heritability estimate for alcohol dependence was 44% [95% confidence interval (CI) 31-57%] for males and 62% (95% CI 52-72%) for females. For impulsivity, the heritability was 33% (95% CI 30-36%) in males and females. The bivariate twin analysis indicated a statistically significant genetic correlation between alcohol dependence and impulsivity of 0.40 (95% CI 0.23-0.58) in males and 0.20 (95% CI 0.07-0.33) in females. The phenotypic correlation between alcohol dependence and impulsivity was 0.20 and 0.17 for males and females, respectively, and the bivariate heritability was 80% (95% CI 47-117%) for males and 53% (95% CI 19-86%) for females. The remaining variance in all models was accounted for by non-shared environmental factors. The association between alcohol dependence and impulsivity can be partially accounted for by shared genetic factors. The genetic correlation was greater in men compared with women, which may indicate different pathways to the development of alcohol dependence between sexes. The observed genetic overlap has clinical implications regarding treatment and prevention, and partially explains the substantial co-morbidity between alcohol dependence and psychiatric disorders characterized by impulsive behaviour.

  8. Growth Limits in Large Scale Networks

    DEFF Research Database (Denmark)

    Knudsen, Thomas Phillip

    limitations. The rising complexity of network management with the convergence of communications platforms is shown as problematic for both automatic management feasibility and for manpower resource management. In the fourth step the scope is extended to include the present society with the DDN project as its......The Subject of large scale networks is approached from the perspective of the network planner. An analysis of the long term planning problems is presented with the main focus on the changing requirements for large scale networks and the potential problems in meeting these requirements. The problems...... the fundamental technological resources in network technologies are analysed for scalability. Here several technological limits to continued growth are presented. The third step involves a survey of major problems in managing large scale networks given the growth of user requirements and the technological...

  9. A network approach to the comorbidity between posttraumatic stress disorder and major depressive disorder: The role of overlapping symptoms.

    Science.gov (United States)

    Afzali, Mohammad H; Sunderland, Matthew; Teesson, Maree; Carragher, Natacha; Mills, Katherine; Slade, Tim

    2017-01-15

    The role of symptom overlap between major depressive disorder and posttraumatic stress disorder in comorbidity between two disorders is unclear. The current study applied network analysis to map the structure of symptom associations between these disorders. Data comes from a sample of 909 Australian adults with a lifetime history of trauma and depressive symptoms. Data analysis consisted of the construction of two comorbidity networks of PTSD/MDD with and without overlapping symptoms, identification of the bridging symptoms, and computation of the centrality measures. The prominent bridging role of four overlapping symptoms (i.e., sleep problems, irritability, concentration problems, and loss of interest) and five non-overlapping symptoms (i.e., feeling sad, feelings of guilt, psychomotor retardation, foreshortened future, and experiencing flashbacks) is highlighted. The current study uses DSM-IV criteria for PTSD and does not take into consideration significant changes made to PTSD criteria in DSM-5. Moreover, due to cross-sectional nature of the data, network estimates do not provide information on whether a symptom actively triggers other symptoms or whether a symptom mostly is triggered by other symptoms. The results support the role of dysphoria-related symptoms in PTSD/MDD comorbidity. Moreover, Identification of central symptoms and bridge symptoms will provide useful targets for interventions that seek to intervene early in the development of comorbidity. Copyright © 2016 Elsevier B.V. All rights reserved.

  10. Hadron spectrum, quark masses and decay constants from light overlap fermions on large lattices

    International Nuclear Information System (INIS)

    Galletly, D.; Horsley, R.; Streuer, T.; Freie Univ. Berlin

    2006-07-01

    We present results from a simulation of quenched overlap fermions with Luescher-Weisz gauge field action on lattices up to 24 3 48 and for pion masses down to ∼250 MeV. Among the quantities we study are the pion, rho and nucleon masses, the light and strange quark masses, and the pion decay constant. The renormalization of the scalar and axial vector currents is done nonperturbatively in the RI-MOM scheme. The simulations are performed at two different lattice spacings, a ∼0.1 fm and ∼0.15 fm, and on two different physical volumes, to test the scaling properties of our action and to study finite volume effects. We compare our results with the predictions of chiral perturbation theory and compute several of its low-energy constants. The pion mass is computed in sectors of fixed topology as well. (orig.)

  11. Hadron spectrum, quark masses and decay constants from light overlap fermions on large lattices

    Energy Technology Data Exchange (ETDEWEB)

    Galletly, D.; Horsley, R. [Edinburgh Univ. (United Kingdom). School of Physics; Guertler, M. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Perlt, H.; Schiller, A. [Leipzig Univ. (Germany). Inst. fuer Theoretische Physik; Rakow, P.E.L. [Liverpool Univ. (United Kingdom). Theoretical Physics Division, Dept. of Mathematical Sciences; Schierholz, G. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC]|[Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Streuer, T. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC]|[Freie Univ. Berlin (Germany). Inst. fuer Theoretische Physik

    2006-07-15

    We present results from a simulation of quenched overlap fermions with Luescher-Weisz gauge field action on lattices up to 24{sup 3} 48 and for pion masses down to {approx}250 MeV. Among the quantities we study are the pion, rho and nucleon masses, the light and strange quark masses, and the pion decay constant. The renormalization of the scalar and axial vector currents is done nonperturbatively in the RI-MOM scheme. The simulations are performed at two different lattice spacings, a {approx}0.1 fm and {approx}0.15 fm, and on two different physical volumes, to test the scaling properties of our action and to study finite volume effects. We compare our results with the predictions of chiral perturbation theory and compute several of its low-energy constants. The pion mass is computed in sectors of fixed topology as well. (orig.)

  12. The Use of Large Valve Overlap in Scavenging a Supercharged Spark-ignition Engine Using Fuel Injection

    Science.gov (United States)

    Schey, Oscar W; Young, Alfred W

    1932-01-01

    This investigation was conducted to determine the effect of more complete scavenging on the full throttle power and the fuel consumption of a four-stroke-cycle engine. The NACA single-cylinder universal test engine equipped with both a fuel-injection system and a carburetor was used. The engine was scavenged by using a large valve overlap and maintaining a pressure in the inlet manifold of 2 inches of mercury above atmospheric. The maximum valve overlap used was 112 degrees. Tests were conducted for a range of compression ratios from 5.5 to 8.5. Except for variable speed tests, all tests were conducted at an engine speed of 1,500 r.p.m. The results of the tests show that the clearance volume of an engine can be scavenged by using a large valve overlap and about 2 to 5 inches of mercury pressure difference between the inlet and exhaust valve. With a fuel-injection system when the clearance volume was scavenged, a b.m.e.p. of over 185 pounds per square inch and a fuel consumption of 9.45 pound per brake horsepower per hour were obtained with a 6.5 compression ratio. An increase of approximately 10 pounds per square inch b.m.e.p. was obtained with a fuel-injection system over that with a carburetor.

  13. Evolution of a large online social network

    International Nuclear Information System (INIS)

    Hu Haibo; Wang Xiaofan

    2009-01-01

    Although recently there are extensive research on the collaborative networks and online communities, there is very limited knowledge about the actual evolution of the online social networks (OSN). In the Letter, we study the structural evolution of a large online virtual community. We find that the scale growth of the OSN shows non-trivial S shape which may provide a proper exemplification for Bass diffusion model. We reveal that the evolutions of many network properties, such as density, clustering, heterogeneity and modularity, show non-monotone feature, and shrink phenomenon occurs for the path length and diameter of the network. Furthermore, the OSN underwent a transition from degree assortativity characteristic of collaborative networks to degree disassortativity characteristic of many OSNs. Our study has revealed the evolutionary pattern of interpersonal interactions in a specific population and provided a valuable platform for theoretical modeling and further analysis

  14. Fast unfolding of communities in large networks

    International Nuclear Information System (INIS)

    Blondel, Vincent D; Guillaume, Jean-Loup; Lambiotte, Renaud; Lefebvre, Etienne

    2008-01-01

    We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks

  15. Networks and landscapes: a framework for setting goals and evaluating performance at the large landscape scale

    Science.gov (United States)

    R Patrick Bixler; Shawn Johnson; Kirk Emerson; Tina Nabatchi; Melly Reuling; Charles Curtin; Michele Romolini; Morgan Grove

    2016-01-01

    The objective of large landscape conser vation is to mitigate complex ecological problems through interventions at multiple and overlapping scales. Implementation requires coordination among a diverse network of individuals and organizations to integrate local-scale conservation activities with broad-scale goals. This requires an understanding of the governance options...

  16. Fluctuations of nuclear cross sections in the region of strong overlapping resonances and at large number of open channels

    International Nuclear Information System (INIS)

    Kun, S.Yu.

    1985-01-01

    On the basis of the symmetrized Simonius representation of the S matrix statistical properties of its fluctuating component in the presence of direct reactions are investigated. The case is considered where the resonance levels are strongly overlapping and there is a lot of open channels, assuming that compound-nucleus cross sections which couple different channels are equal. It is shown that using the averaged unitarity condition on the real energy axis one can eliminate both resonance-resonance and channel-channel correlations from partial r transition amplitudes. As a result, we derive the basic points of the Epicson fluctuation theory of nuclear cross sections, independently of the relation between the resonance overlapping and the number of open channels, and the validity of the Hauser-Feshbach model is established. If the number of open channels is large, the time of uniform population of compound-nucleus configurations, for an open excited nuclear system, is much smaller than the Poincare time. The life time of compound nucleus is discussed

  17. Large deformation behavior of fat crystal networks

    NARCIS (Netherlands)

    Kloek, W.; Vliet, van T.; Walstra, P.

    2005-01-01

    Compression and wire-cutting experiments on dispersions of fully hydrogenated palm oil in sunflower oil with varying fraction solid fat were carried out to establish which parameters are important for the large deformation behavior of fat crystal networks. Compression experiments showed that the

  18. Friending, IMing, and hanging out face-to-face: overlap in adolescents' online and offline social networks.

    Science.gov (United States)

    Reich, Stephanie M; Subrahmanyam, Kaveri; Espinoza, Guadalupe

    2012-03-01

    Many new and important developmental issues are encountered during adolescence, which is also a time when Internet use becomes increasingly popular. Studies have shown that adolescents are using these online spaces to address developmental issues, especially needs for intimacy and connection to others. Online communication with its potential for interacting with unknown others, may put teens at increased risk. Two hundred and fifty-one high school students completed an in-person survey, and 126 of these completed an additional online questionnaire about how and why they use the Internet, their activities on social networking sites (e.g., Facebook, MySpace) and their reasons for participation, and how they perceive these online spaces to impact their friendships. To examine the extent of overlap between online and offline friends, participants were asked to list the names of their top interaction partners offline and online (Facebook and instant messaging). Results reveal that adolescents mainly use social networking sites to connect with others, in particular with people known from offline contexts. While adolescents report little monitoring by their parents, there was no evidence that teens are putting themselves at risk by interacting with unknown others. Instead, adolescents seem to use the Internet, especially social networking sites, to connect with known others. While the study found moderate overlap between teens' closest online and offline friends, the patterns suggest that adolescents use online contexts to strengthen offline relationships. PsycINFO Database Record (c) 2012 APA, all rights reserved.

  19. The Influence of Sex and Season on Conspecific Spatial Overlap in a Large, Actively-Foraging Colubrid Snake.

    Directory of Open Access Journals (Sweden)

    Javan M Bauder

    Full Text Available Understanding the factors influencing the degree of spatial overlap among conspecifics is important for understanding multiple ecological processes. Compared to terrestrial carnivores, relatively little is known about the factors influencing conspecific spatial overlap in snakes, although across snake taxa there appears to be substantial variation in conspecific spatial overlap. In this study, we described conspecific spatial overlap of eastern indigo snakes (Drymarchon couperi in peninsular Florida and examined how conspecific spatial overlap varied by sex and season (breeding season vs. non-breeding season. We calculated multiple indices of spatial overlap using 6- and 3-month utilization distributions (UD of dyads of simultaneously adjacent telemetered snakes. We also measured conspecific UD density values at each telemetry fix and modeled the distribution of those values as a function of overlap type, sex, and season using generalized Pareto distributions. Home range overlap between males and females was significantly greater than overlap between individuals of the same sex and male home ranges often completely contained female home ranges. Male home ranges overlapped little during both seasons, whereas females had higher levels of overlap during the non-breeding season. The spatial patterns observed in our study are consistent with those seen in many mammalian carnivores, in which low male-male overlap and high inter-sexual overlap provides males with greater access to females. We encourage additional research on the influence of prey availability on conspecific spatial overlap in snakes as well as the behavioral mechanisms responsible for maintaining the low levels of overlap we observed.

  20. SPARK: Sparsity-based analysis of reliable k-hubness and overlapping network structure in brain functional connectivity.

    Science.gov (United States)

    Lee, Kangjoo; Lina, Jean-Marc; Gotman, Jean; Grova, Christophe

    2016-07-01

    Functional hubs are defined as the specific brain regions with dense connections to other regions in a functional brain network. Among them, connector hubs are of great interests, as they are assumed to promote global and hierarchical communications between functionally specialized networks. Damage to connector hubs may have a more crucial effect on the system than does damage to other hubs. Hubs in graph theory are often identified from a correlation matrix, and classified as connector hubs when the hubs are more connected to regions in other networks than within the networks to which they belong. However, the identification of hubs from functional data is more complex than that from structural data, notably because of the inherent problem of multicollinearity between temporal dynamics within a functional network. In this context, we developed and validated a method to reliably identify connectors and corresponding overlapping network structure from resting-state fMRI. This new method is actually handling the multicollinearity issue, since it does not rely on counting the number of connections from a thresholded correlation matrix. The novelty of the proposed method is that besides counting the number of networks involved in each voxel, it allows us to identify which networks are actually involved in each voxel, using a data-driven sparse general linear model in order to identify brain regions involved in more than one network. Moreover, we added a bootstrap resampling strategy to assess statistically the reproducibility of our results at the single subject level. The unified framework is called SPARK, i.e. SParsity-based Analysis of Reliable k-hubness, where k-hubness denotes the number of networks overlapping in each voxel. The accuracy and robustness of SPARK were evaluated using two dimensional box simulations and realistic simulations that examined detection of artificial hubs generated on real data. Then, test/retest reliability of the method was assessed

  1. Safety evaluation of large ventilation networks

    International Nuclear Information System (INIS)

    Barrocas, M.; Pruchon, P.; Robin, J.P.; Rouyer, J.L.; Salmon, P.

    1981-01-01

    For large ventilation networks, it is necessary to make a safety evaluation of their responses to perturbations such as blower failure, unexpected transfers, local pressurization. This evaluation is not easy to perform because of the many interrelationships between the different parts of the networks, interrelationships coming from the circulations of workers and matetials between cells and rooms and from the usefulness of air transfers through zones of different classifications. This evaluation is all the more necessary since new imperatives in energy savings push for minimizing the air flows, which tends to render the network more sensitive to perturbations. A program to evaluate safety has been developed by the Service de Protection Technique in cooperation with operators and designers of big nuclear facilities and the first applications presented here show the weak points of the installation studied from the safety view point

  2. Single-shot T2 mapping using overlapping-echo detachment planar imaging and a deep convolutional neural network.

    Science.gov (United States)

    Cai, Congbo; Wang, Chao; Zeng, Yiqing; Cai, Shuhui; Liang, Dong; Wu, Yawen; Chen, Zhong; Ding, Xinghao; Zhong, Jianhui

    2018-04-24

    An end-to-end deep convolutional neural network (CNN) based on deep residual network (ResNet) was proposed to efficiently reconstruct reliable T 2 mapping from single-shot overlapping-echo detachment (OLED) planar imaging. The training dataset was obtained from simulations that were carried out on SPROM (Simulation with PRoduct Operator Matrix) software developed by our group. The relationship between the original OLED image containing two echo signals and the corresponding T 2 mapping was learned by ResNet training. After the ResNet was trained, it was applied to reconstruct the T 2 mapping from simulation and in vivo human brain data. Although the ResNet was trained entirely on simulated data, the trained network was generalized well to real human brain data. The results from simulation and in vivo human brain experiments show that the proposed method significantly outperforms the echo-detachment-based method. Reliable T 2 mapping with higher accuracy is achieved within 30 ms after the network has been trained, while the echo-detachment-based OLED reconstruction method took approximately 2 min. The proposed method will facilitate real-time dynamic and quantitative MR imaging via OLED sequence, and deep convolutional neural network has the potential to reconstruct maps from complex MRI sequences efficiently. © 2018 International Society for Magnetic Resonance in Medicine.

  3. Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

    DEFF Research Database (Denmark)

    Jørgensen, Philip H.; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2016-01-01

    Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization...... by the notion of community structure such that the edge density within groups is higher than between groups. Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks...... feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction....

  4. Leveraging disjoint communities for detecting overlapping community structure

    International Nuclear Information System (INIS)

    Chakraborty, Tanmoy

    2015-01-01

    Network communities represent mesoscopic structure for understanding the organization of real-world networks, where nodes often belong to multiple communities and form overlapping community structure in the network. Due to non-triviality in finding the exact boundary of such overlapping communities, this problem has become challenging, and therefore huge effort has been devoted to detect overlapping communities from the network.In this paper, we present PVOC (Permanence based Vertex-replication algorithm for Overlapping Community detection), a two-stage framework to detect overlapping community structure. We build on a novel observation that non-overlapping community structure detected by a standard disjoint community detection algorithm from a network has high resemblance with its actual overlapping community structure, except the overlapping part. Based on this observation, we posit that there is perhaps no need of building yet another overlapping community finding algorithm; but one can efficiently manipulate the output of any existing disjoint community finding algorithm to obtain the required overlapping structure. We propose a new post-processing technique that by combining with any existing disjoint community detection algorithm, can suitably process each vertex using a new vertex-based metric, called permanence, and thereby finds out overlapping candidates with their community memberships. Experimental results on both synthetic and large real-world networks show that PVOC significantly outperforms six state-of-the-art overlapping community detection algorithms in terms of high similarity of the output with the ground-truth structure. Thus our framework not only finds meaningful overlapping communities from the network, but also allows us to put an end to the constant effort of building yet another overlapping community detection algorithm. (paper)

  5. People identification for domestic non-overlapping RGB-D camera networks

    NARCIS (Netherlands)

    Takac, B.; Rauterberg, G.W.M.; Català, A.; Chen, W.

    2015-01-01

    The ability to identify the specific person in a home camera network is very relevant for healthcare applications where humans need to be observed daily in their living environment. The appearance based people identification in a domestic environment has many similarities with the problem of

  6. Potato leafroll virus structural proteins manipulate overlapping, yet distinct protein interaction networks during infection.

    Science.gov (United States)

    DeBlasio, Stacy L; Johnson, Richard; Sweeney, Michelle M; Karasev, Alexander; Gray, Stewart M; MacCoss, Michael J; Cilia, Michelle

    2015-06-01

    Potato leafroll virus (PLRV) produces a readthrough protein (RTP) via translational readthrough of the coat protein amber stop codon. The RTP functions as a structural component of the virion and as a nonincorporated protein in concert with numerous insect and plant proteins to regulate virus movement/transmission and tissue tropism. Affinity purification coupled to quantitative MS was used to generate protein interaction networks for a PLRV mutant that is unable to produce the read through domain (RTD) and compared to the known wild-type PLRV protein interaction network. By quantifying differences in the protein interaction networks, we identified four distinct classes of PLRV-plant interactions: those plant and nonstructural viral proteins interacting with assembled coat protein (category I); plant proteins in complex with both coat protein and RTD (category II); plant proteins in complex with the RTD (category III); and plant proteins that had higher affinity for virions lacking the RTD (category IV). Proteins identified as interacting with the RTD are potential candidates for regulating viral processes that are mediated by the RTP such as phloem retention and systemic movement and can potentially be useful targets for the development of strategies to prevent infection and/or viral transmission of Luteoviridae species that infect important crop species. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  7. Limited overlap between phylogenetic HIV and hepatitis C virus clusters illustrates the dynamic sexual network structure of Dutch HIV-infected MSM.

    Science.gov (United States)

    Vanhommerig, Joost W; Bezemer, Daniela; Molenkamp, Richard; Van Sighem, Ard I; Smit, Colette; Arends, Joop E; Lauw, Fanny N; Brinkman, Kees; Rijnders, Bart J; Newsum, Astrid M; Bruisten, Sylvia M; Prins, Maria; Van Der Meer, Jan T; Van De Laar, Thijs J; Schinkel, Janke

    2017-09-24

    MSM are at increased risk for infection with HIV-1 and hepatitis C virus (HCV). Is HIV/HCV coinfection confined to specific HIV transmission networks? A HIV phylogenetic tree was constructed for 5038 HIV-1 subtype B polymerase (pol) sequences obtained from MSM in the AIDS therapy evaluation in the Netherlands cohort. We investigated the existence of HIV clusters with increased HCV prevalence, the HIV phylogenetic density (i.e. the number of potential HIV transmission partners) of HIV/HCV-coinfected MSM compared with HIV-infected MSM without HCV, and the overlap in HIV and HCV phylogenies using HCV nonstructural protein 5B sequences from 183 HIV-infected MSM with acute HCV infection. Five hundred and sixty-three of 5038 (11.2%) HIV-infected MSM tested HCV positive. Phylogenetic analysis revealed 93 large HIV clusters (≥10 MSM), 370 small HIV clusters (2-9 MSM), and 867 singletons with a median HCV prevalence of 11.5, 11.6, and 9.3%, respectively. We identified six large HIV clusters with elevated HCV prevalence (range 23.5-46.2%). Median HIV phylogenetic densities for MSM with HCV (3, interquartile range 1-7) and without HCV (3, interquartile range 1-8) were similar. HCV phylogeny showed 12 MSM-specific HCV clusters (clustersize: 2-39 HCV sequences); 12.7% of HCV infections were part of the same HIV and HCV cluster. We observed few HIV clusters with elevated HCV prevalence, no increase in the HIV phylogenetic density of HIV/HCV-coinfected MSM compared to HIV-infected MSM without HCV, and limited overlap between HIV and HCV phylogenies among HIV/HCV-coinfected MSM. Our data do not support the existence of MSM-specific sexual networks that fuel both the HIV and HCV epidemic.

  8. Communities in Large Networks: Identification and Ranking

    DEFF Research Database (Denmark)

    Olsen, Martin

    2008-01-01

    We study the problem of identifying and ranking the members of a community in a very large network with link analysis only, given a set of representatives of the community. We define the concept of a community justified by a formal analysis of a simple model of the evolution of a directed graph. ...... and its immediate surroundings. The members are ranked with a “local” variant of the PageRank algorithm. Results are reported from successful experiments on identifying and ranking Danish Computer Science sites and Danish Chess pages using only a few representatives....

  9. Oscillation-Driven Spike-Timing Dependent Plasticity Allows Multiple Overlapping Pattern Recognition in Inhibitory Interneuron Networks

    DEFF Research Database (Denmark)

    Garrido, Jesús A.; Luque, Niceto R.; Tolu, Silvia

    2016-01-01

    The majority of operations carried out by the brain require learning complex signal patterns for future recognition, retrieval and reuse. Although learning is thought to depend on multiple forms of long-term synaptic plasticity, the way this latter contributes to pattern recognition is still poorly...... and at the inhibitory interneuron-interneuron synapses, the interneurons rapidly learned complex input patterns. Interestingly, induction of plasticity required that the network be entrained into theta-frequency band oscillations, setting the internal phase-reference required to drive STDP. Inhibitory plasticity...... effectively distributed multiple patterns among available interneurons, thus allowing the simultaneous detection of multiple overlapping patterns. The addition of plasticity in intrinsic excitability made the system more robust allowing self-adjustment and rescaling in response to a broad range of input...

  10. Spectral Methods for Immunization of Large Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Ahmad

    2017-11-01

    Full Text Available Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a node which in turn infects its neighbour nodes and this may trigger an epidemic in the whole graph. The goal thus is to select the best k nodes (budget constraint that are immunized (vaccinated, screened, filtered so as the remaining graph is less prone to the epidemic. It is known that the problem is, in all practical models, computationally intractable even for moderate sized graphs. In this paper we employ ideas from spectral graph theory to define relevance and importance of nodes. Using novel graph theoretic techniques, we then design an efficient approximation algorithm to immunize the graph. Theoretical guarantees on the running time of our algorithm show that it is more efficient than any other known solution in the literature. We test the performance of our algorithm on several real world graphs. Experiments show that our algorithm scales well for large graphs and outperforms state of the art algorithms both in quality (containment of epidemic and efficiency (runtime and space complexity.

  11. Dog and human inflammatory bowel disease rely on overlapping yet distinct dysbiosis networks.

    Science.gov (United States)

    Vázquez-Baeza, Yoshiki; Hyde, Embriette R; Suchodolski, Jan S; Knight, Rob

    2016-10-03

    Inflammatory bowel disease (IBD) is an autoimmune condition that is difficult to diagnose, and animal models of this disease have questionable human relevance 1 . Here, we show that the dysbiosis network underlying IBD in dogs differs from that in humans, with some bacteria such as Fusobacterium switching roles between the two species (as Bacteroides fragilis switches roles between humans and mice) 2 . For example, a dysbiosis index trained on humans fails when applied to dogs, but a dog-specific dysbiosis index achieves high correlations with the overall dog microbial community diversity patterns. In addition, a random forest classifier trained on dog-specific samples achieves high discriminatory power, even when using stool samples rather than the mucosal biopsies required for high discriminatory power in humans 2 . These relationships were not detected in previously published dog IBD data sets due to their limited sample size and statistical power 3 . Taken together, these results reveal the need to train host-specific dysbiosis networks and point the way towards a generalized understanding of IBD across different mammalian models.

  12. Analysis of a large-scale weighted network of one-to-one human communication

    International Nuclear Information System (INIS)

    Onnela, Jukka-Pekka; Saramaeki, Jari; Hyvoenen, Joerkki; Szabo, Gabor; Menezes, M Argollo de; Kaski, Kimmo; Barabasi, Albert-Laszlo; Kertesz, Janos

    2007-01-01

    We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks

  13. Analysis of a large-scale weighted network of one-to-one human communication

    Science.gov (United States)

    Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

    2007-06-01

    We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

  14. Analysis of a large-scale weighted network of one-to-one human communication

    Energy Technology Data Exchange (ETDEWEB)

    Onnela, Jukka-Pekka [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Saramaeki, Jari [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Hyvoenen, Joerkki [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Szabo, Gabor [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Menezes, M Argollo de [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kaski, Kimmo [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Barabasi, Albert-Laszlo [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kertesz, Janos [Laboratory of Computational Engineering, Helsinki University of Technology (Finland)

    2007-06-15

    We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

  15. Overlap functions

    Czech Academy of Sciences Publication Activity Database

    Bustince, H.; Fernández, J.; Mesiar, Radko; Montero, J.; Orduna, R.

    2010-01-01

    Roč. 72, 3-4 (2010), s. 1488-1499 ISSN 0362-546X R&D Projects: GA ČR GA402/08/0618 Institutional research plan: CEZ:AV0Z10750506 Keywords : t-norm * Migrative property * Homogeneity property * Overlap function Subject RIV: BA - General Mathematics Impact factor: 1.279, year: 2010 http://library.utia.cas.cz/separaty/2009/E/mesiar-overlap functions.pdf

  16. Overlap between the neural correlates of cued recall and source memory: evidence for a generic recollection network?

    Science.gov (United States)

    Hayama, Hiroki R; Vilberg, Kaia L; Rugg, Michael D

    2012-05-01

    Recall of a studied item and retrieval of its encoding context (source memory) both depend on recollection of qualitative information about the study episode. This study investigated whether recall and source memory engage overlapping neural regions. Participants (n = 18) studied a series of words, which were presented either to the left or right of fixation. fMRI data were collected during a subsequent test phase in which three-letter word-stems were presented, two thirds of which could be completed by a study item. Instructions were to use each stem as a cue to recall a studied word and, when recall was successful, to indicate the word's study location. When recall failed, the stem was to be completed with the first word to come to mind. Relative to stems for which recall failed, word-stems eliciting successful recall were associated with enhanced activity in a variety of cortical regions, including bilateral parietal, posterior midline, and parahippocampal cortex. Activity in these regions was enhanced when recall was accompanied by successful rather than unsuccessful source retrieval. It is proposed that the regions form part of a "recollection network" in which activity is graded according to the amount of information retrieved about a study episode.

  17. Multirelational organization of large-scale social networks in an online world.

    Science.gov (United States)

    Szell, Michael; Lambiotte, Renaud; Thurner, Stefan

    2010-08-03

    The capacity to collect fingerprints of individuals in online media has revolutionized the way researchers explore human society. Social systems can be seen as a nonlinear superposition of a multitude of complex social networks, where nodes represent individuals and links capture a variety of different social relations. Much emphasis has been put on the network topology of social interactions, however, the multidimensional nature of these interactions has largely been ignored, mostly because of lack of data. Here, for the first time, we analyze a complete, multirelational, large social network of a society consisting of the 300,000 odd players of a massive multiplayer online game. We extract networks of six different types of one-to-one interactions between the players. Three of them carry a positive connotation (friendship, communication, trade), three a negative (enmity, armed aggression, punishment). We first analyze these types of networks as separate entities and find that negative interactions differ from positive interactions by their lower reciprocity, weaker clustering, and fatter-tail degree distribution. We then explore how the interdependence of different network types determines the organization of the social system. In particular, we study correlations and overlap between different types of links and demonstrate the tendency of individuals to play different roles in different networks. As a demonstration of the power of the approach, we present the first empirical large-scale verification of the long-standing structural balance theory, by focusing on the specific multiplex network of friendship and enmity relations.

  18. Pythoscape: A framework for generation of large protein similarity networks

    OpenAIRE

    Babbitt, Patricia; Barber, AE; Babbitt, PC

    2012-01-01

    Pythoscape is a framework implemented in Python for processing large protein similarity networks for visualization in other software packages. Protein similarity networks are graphical representations of sequence, structural and other similarities among pr

  19. Signaling in large-scale neural networks

    DEFF Research Database (Denmark)

    Berg, Rune W; Hounsgaard, Jørn

    2009-01-01

    We examine the recent finding that neurons in spinal motor circuits enter a high conductance state during functional network activity. The underlying concomitant increase in random inhibitory and excitatory synaptic activity leads to stochastic signal processing. The possible advantages of this m......We examine the recent finding that neurons in spinal motor circuits enter a high conductance state during functional network activity. The underlying concomitant increase in random inhibitory and excitatory synaptic activity leads to stochastic signal processing. The possible advantages...... of this metabolically costly organization are analyzed by comparing with synaptically less intense networks driven by the intrinsic response properties of the network neurons....

  20. Comparative Analysis of Different Protocols to Manage Large Scale Networks

    OpenAIRE

    Anil Rao Pimplapure; Dr Jayant Dubey; Prashant Sen

    2013-01-01

    In recent year the numbers, complexity and size is increased in Large Scale Network. The best example of Large Scale Network is Internet, and recently once are Data-centers in Cloud Environment. In this process, involvement of several management tasks such as traffic monitoring, security and performance optimization is big task for Network Administrator. This research reports study the different protocols i.e. conventional protocols like Simple Network Management Protocol and newly Gossip bas...

  1. Mixed Th2 and non-Th2 inflammatory pattern in the asthma–COPD overlap: a network approach

    Directory of Open Access Journals (Sweden)

    Pérez de Llano L

    2018-02-01

    the nature of inflammation in patients with ACO. Objectives: We aimed at investigating the role and interaction of common markers of systemic inflammation (IL-6, IL-8, and tumor necrosis factor-α, Th2-related markers (periostin, IL-5, and IL-13, and IL-17 in asthma, COPD, and ACO. Methods: This is a cross-sectional study of patients aged ≥40 years with a post-bronchodilator forced expiratory volume in the first second/forced vital capacity <0.70 recruited from outpatient clinics in tertiary hospitals with a clinical diagnosis of asthma, COPD, or ACO. ACO was defined by a history of smoking >10 pack-years in a patient with a previous diagnosis of asthma or by the presence of eosinophilia in a patient with a previous diagnosis of COPD. Clinical, functional, and inflammatory parameters were compared between categories using discriminant and network analysis. Results: In total, 109 ACO, 89 COPD, and 94 asthma patients were included. Serum levels (median [interquartile range] of IL-5 were higher in asthma patients than in COPD patients (2.09 [0.61–3.57] vs 1.11 [0.12–2.42] pg/mL, respectively; p=0.03, and IL-8 levels (median [interquartile range] were higher in COPD patients than in asthma patients (9.45 [6.61–13.12] vs 7.03 [4.69–10.44] pg/mL, respectively; p<0.001. Their values in ACO were intermediate between those in asthma and in COPD. Principal component and network analysis showed a mixed inflammatory pattern in ACO in between asthma and COPD. IL-13 was the most connected node in the network, with different weights among the three conditions. Conclusion: Asthma and COPD are two different inflammatory conditions that may overlap in some patients, leading to a mixed inflammatory pattern. IL-13 could be central to the regulation of inflammation in these conditions. Keywords: asthma mechanisms, COPD mechanisms, inflammatory cytokines, overlap, network analysis, IL-13

  2. Group Centric Networking: Large Scale Over the Air Testing of Group Centric Networking

    Science.gov (United States)

    2016-11-01

    Large Scale Over-the-Air Testing of Group Centric Networking Logan Mercer, Greg Kuperman, Andrew Hunter, Brian Proulx MIT Lincoln Laboratory...performance of Group Centric Networking (GCN), a networking protocol developed for robust and scalable communications in lossy networks where users are...devices, and the ad-hoc nature of the network . Group Centric Networking (GCN) is a proposed networking protocol that addresses challenges specific to

  3. Displacement and deformation measurement for large structures by camera network

    Science.gov (United States)

    Shang, Yang; Yu, Qifeng; Yang, Zhen; Xu, Zhiqiang; Zhang, Xiaohu

    2014-03-01

    A displacement and deformation measurement method for large structures by a series-parallel connection camera network is presented. By taking the dynamic monitoring of a large-scale crane in lifting operation as an example, a series-parallel connection camera network is designed, and the displacement and deformation measurement method by using this series-parallel connection camera network is studied. The movement range of the crane body is small, and that of the crane arm is large. The displacement of the crane body, the displacement of the crane arm relative to the body and the deformation of the arm are measured. Compared with a pure series or parallel connection camera network, the designed series-parallel connection camera network can be used to measure not only the movement and displacement of a large structure but also the relative movement and deformation of some interesting parts of the large structure by a relatively simple optical measurement system.

  4. Distributed Emulation in Support of Large Networks

    Science.gov (United States)

    2016-06-01

    Provider LTE Long Term Evolution MB Megabyte MIPS Microprocessor without Interlocked Pipeline Stages MRT Multi-Threaded Routing Toolkit NPS Naval...environment, modifications to a network, protocol, or model can be executed – and the effects measured – without affecting real-world users or services...produce their results when analyzing performance of Long Term Evolution ( LTE ) gateways [3]. Many research scenarios allow problems to be represented

  5. Measuring structural similarity in large online networks.

    Science.gov (United States)

    Shi, Yongren; Macy, Michael

    2016-09-01

    Structural similarity based on bipartite graphs can be used to detect meaningful communities, but the networks have been tiny compared to massive online networks. Scalability is important in applications involving tens of millions of individuals with highly skewed degree distributions. Simulation analysis holding underlying similarity constant shows that two widely used measures - Jaccard index and cosine similarity - are biased by the distribution of out-degree in web-scale networks. However, an alternative measure, the Standardized Co-incident Ratio (SCR), is unbiased. We apply SCR to members of Congress, musical artists, and professional sports teams to show how massive co-following on Twitter can be used to map meaningful affiliations among cultural entities, even in the absence of direct connections to one another. Our results show how structural similarity can be used to map cultural alignments and demonstrate the potential usefulness of social media data in the study of culture, politics, and organizations across the social and behavioral sciences. Copyright © 2016 Elsevier Inc. All rights reserved.

  6. An Efficient Method to Evaluate Intermolecular Interaction Energies in Large Systems Using Overlapping Multicenter ONIOM and the Fragment Molecular Orbital Method

    Science.gov (United States)

    Asada, Naoya; Fedorov, Dmitri G.; Kitaura, Kazuo; Nakanishi, Isao; Merz, Kenneth M.

    2012-01-01

    We propose an approach based on the overlapping multicenter ONIOM to evaluate intermolecular interaction energies in large systems and demonstrate its accuracy on several representative systems in the complete basis set limit at the MP2 and CCSD(T) level of theory. In the application to the intermolecular interaction energy between insulin dimer and 4′-hydroxyacetanilide at the MP2/CBS level, we use the fragment molecular orbital method for the calculation of the entire complex assigned to the lowest layer in three-layer ONIOM. The developed method is shown to be efficient and accurate in the evaluation of the protein-ligand interaction energies. PMID:23050059

  7. LARGE-SCALE TOPOLOGICAL PROPERTIES OF MOLECULAR NETWORKS.

    Energy Technology Data Exchange (ETDEWEB)

    MASLOV,S.SNEPPEN,K.

    2003-11-17

    Bio-molecular networks lack the top-down design. Instead, selective forces of biological evolution shape them from raw material provided by random events such as gene duplications and single gene mutations. As a result individual connections in these networks are characterized by a large degree of randomness. One may wonder which connectivity patterns are indeed random, while which arose due to the network growth, evolution, and/or its fundamental design principles and limitations? Here we introduce a general method allowing one to construct a random null-model version of a given network while preserving the desired set of its low-level topological features, such as, e.g., the number of neighbors of individual nodes, the average level of modularity, preferential connections between particular groups of nodes, etc. Such a null-model network can then be used to detect and quantify the non-random topological patterns present in large networks. In particular, we measured correlations between degrees of interacting nodes in protein interaction and regulatory networks in yeast. It was found that in both these networks, links between highly connected proteins are systematically suppressed. This effect decreases the likelihood of cross-talk between different functional modules of the cell, and increases the overall robustness of a network by localizing effects of deleterious perturbations. It also teaches us about the overall computational architecture of such networks and points at the origin of large differences in the number of neighbors of individual nodes.

  8. Natural hybridization and asymmetric introgression at the distribution margin of two Buddleja species with a large overlap.

    Science.gov (United States)

    Liao, Rong-Li; Ma, Yong-Peng; Gong, Wei-Chang; Chen, Gao; Sun, Wei-Bang; Zhou, Ren-Chao; Marczewski, Tobias

    2015-06-18

    Natural hybridization in plants is universal and plays an important role in evolution. Based on morphology it has been presumed that hybridization occurred in the genus Buddleja, though genetic studies confirming this assumption have not been conducted to date. The two species B. crispa and B. officinalis overlap in their distributions over a wide range in South-West China, and we aimed to provide genetic evidence for ongoing hybridization in this study. We investigated the occurrence of hybrids between the two species at the southern-most edge of the distribution of B. crispa using five nuclear loci and pollination experiments. The genetic data suggest substantial differentiation between the two species as species-specific alleles are separated by at least 7-28 mutations. The natural hybrids found were nearly all F1s (21 of 23), but backcrosses were detected, and some individuals, morphologically indistinguishable from the parental species, showed introgression. Pollen viability test shows that the percentage of viable pollen grains was 50 ± 4% for B. crispa, and 81 ± 2% for B. officinalis. This difference is highly significant (t = 7.382, p < 0.0001). Hand cross-pollination experiments showed that B. crispa is not successful as pollen-parent, but B. officinalis is able to pollinate B. crispa to produce viable hybrid seed. Inter-specific seed-set is low (8 seeds per fruit, as opposed to about 65 for intra-specific pollinations), suggesting post-zygotic reproductive barriers. In addition, one of the reference populations also suggests a history of introgression at other localities. The occurrence of morphologically intermediate individuals between B. crispa and B. officinalis at Xishan Mountain is unequivocally linked to hybridization and almost all examined individuals of the putative hybrids were likely F1s. Despite pollination experiments indicating higher chances for introgression into B. officinalis (hybrids only produced viable seed when

  9. Throughput Analysis of Large Wireless Networks with Regular Topologies

    Directory of Open Access Journals (Sweden)

    Hong Kezhu

    2007-01-01

    Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.

  10. Throughput Analysis of Large Wireless Networks with Regular Topologies

    Directory of Open Access Journals (Sweden)

    Kezhu Hong

    2007-04-01

    Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.

  11. Multisector Health Policy Networks in 15 Large US Cities

    Science.gov (United States)

    Leider, J. P.; Carothers, Bobbi J.; Castrucci, Brian C.; Hearne, Shelley

    2016-01-01

    Context: Local health departments (LHDs) have historically not prioritized policy development, although it is one of the 3 core areas they address. One strategy that may influence policy in LHD jurisdictions is the formation of partnerships across sectors to work together on local public health policy. Design: We used a network approach to examine LHD local health policy partnerships across 15 large cities from the Big Cities Health Coalition. Setting/Participants: We surveyed the health departments and their partners about their working relationships in 5 policy areas: core local funding, tobacco control, obesity and chronic disease, violence and injury prevention, and infant mortality. Outcome Measures: Drawing on prior literature linking network structures with performance, we examined network density, transitivity, centralization and centrality, member diversity, and assortativity of ties. Results: Networks included an average of 21.8 organizations. Nonprofits and government agencies made up the largest proportions of the networks, with 28.8% and 21.7% of network members, whereas for-profits and foundations made up the smallest proportions in all of the networks, with just 1.2% and 2.4% on average. Mean values of density, transitivity, diversity, assortativity, centralization, and centrality showed similarity across policy areas and most LHDs. The tobacco control and obesity/chronic disease networks were densest and most diverse, whereas the infant mortality policy networks were the most centralized and had the highest assortativity. Core local funding policy networks had lower scores than other policy area networks by most network measures. Conclusion: Urban LHDs partner with organizations from diverse sectors to conduct local public health policy work. Network structures are similar across policy areas jurisdictions. Obesity and chronic disease, tobacco control, and infant mortality networks had structures consistent with higher performing networks, whereas

  12. Learning Local Components to Understand Large Bayesian Networks

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Xiang, Yanping; Cordero, Jorge

    2009-01-01

    (domain experts) to extract accurate information from a large Bayesian network due to dimensional difficulty. We define a formulation of local components and propose a clustering algorithm to learn such local components given complete data. The algorithm groups together most inter-relevant attributes......Bayesian networks are known for providing an intuitive and compact representation of probabilistic information and allowing the creation of models over a large and complex domain. Bayesian learning and reasoning are nontrivial for a large Bayesian network. In parallel, it is a tough job for users...... in a domain. We evaluate its performance on three benchmark Bayesian networks and provide results in support. We further show that the learned components may represent local knowledge more precisely in comparison to the full Bayesian networks when working with a small amount of data....

  13. On-demand Overlay Networks for Large Scientific Data Transfers

    Energy Technology Data Exchange (ETDEWEB)

    Ramakrishnan, Lavanya [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Guok, Chin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Jackson, Keith [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Kissel, Ezra [Univ. of Delaware, Newark, DE (United States); Swany, D. Martin [Univ. of Delaware, Newark, DE (United States); Agarwal, Deborah [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

    2009-10-12

    Large scale scientific data transfers are central to scientific processes. Data from large experimental facilities have to be moved to local institutions for analysis or often data needs to be moved between local clusters and large supercomputing centers. In this paper, we propose and evaluate a network overlay architecture to enable highthroughput, on-demand, coordinated data transfers over wide-area networks. Our work leverages Phoebus and On-demand Secure Circuits and AdvanceReservation System (OSCARS) to provide high performance wide-area network connections. OSCARS enables dynamic provisioning of network paths with guaranteed bandwidth and Phoebus enables the coordination and effective utilization of the OSCARS network paths. Our evaluation shows that this approach leads to improved end-to-end data transfer throughput with minimal overheads. The achievedthroughput using our overlay was limited only by the ability of the end hosts to sink the data.

  14. Film excerpts shown to specifically elicit various affects lead to overlapping activation foci in a large set of symmetrical brain regions in males.

    Science.gov (United States)

    Karama, Sherif; Armony, Jorge; Beauregard, Mario

    2011-01-01

    While the limbic system theory continues to be part of common scientific parlance, its validity has been questioned on multiple grounds. Nonetheless, the issue of whether or not there exists a set of brain areas preferentially dedicated to emotional processing remains central within affective neuroscience. Recently, a widespread neural reference space for emotion which includes limbic as well as other regions was characterized in a large meta-analysis. As methodologically heterogeneous studies go into such meta-analyses, showing in an individual study in which all parameters are kept constant, the involvement of overlapping areas for various emotion conditions in keeping with the neural reference space for emotion, would serve as valuable confirmatory evidence. Here, using fMRI, 20 young adult men were scanned while viewing validated neutral and effective emotion-eliciting short film excerpts shown to quickly and specifically elicit disgust, amusement, or sexual arousal. Each emotion-specific run included, in random order, multiple neutral and emotion condition blocks. A stringent conjunction analysis revealed a large overlap across emotion conditions that fit remarkably well with the neural reference space for emotion. This overlap included symmetrical bilateral activation of the medial prefrontal cortex, the anterior cingulate, the temporo-occipital junction, the basal ganglia, the brainstem, the amygdala, the hippocampus, the thalamus, the subthalamic nucleus, the posterior hypothalamus, the cerebellum, as well as the frontal operculum extending towards the anterior insula. This study clearly confirms for the visual modality, that processing emotional stimuli leads to widespread increases in activation that cluster within relatively confined areas, regardless of valence.

  15. Film excerpts shown to specifically elicit various affects lead to overlapping activation foci in a large set of symmetrical brain regions in males.

    Directory of Open Access Journals (Sweden)

    Sherif Karama

    Full Text Available While the limbic system theory continues to be part of common scientific parlance, its validity has been questioned on multiple grounds. Nonetheless, the issue of whether or not there exists a set of brain areas preferentially dedicated to emotional processing remains central within affective neuroscience. Recently, a widespread neural reference space for emotion which includes limbic as well as other regions was characterized in a large meta-analysis. As methodologically heterogeneous studies go into such meta-analyses, showing in an individual study in which all parameters are kept constant, the involvement of overlapping areas for various emotion conditions in keeping with the neural reference space for emotion, would serve as valuable confirmatory evidence. Here, using fMRI, 20 young adult men were scanned while viewing validated neutral and effective emotion-eliciting short film excerpts shown to quickly and specifically elicit disgust, amusement, or sexual arousal. Each emotion-specific run included, in random order, multiple neutral and emotion condition blocks. A stringent conjunction analysis revealed a large overlap across emotion conditions that fit remarkably well with the neural reference space for emotion. This overlap included symmetrical bilateral activation of the medial prefrontal cortex, the anterior cingulate, the temporo-occipital junction, the basal ganglia, the brainstem, the amygdala, the hippocampus, the thalamus, the subthalamic nucleus, the posterior hypothalamus, the cerebellum, as well as the frontal operculum extending towards the anterior insula. This study clearly confirms for the visual modality, that processing emotional stimuli leads to widespread increases in activation that cluster within relatively confined areas, regardless of valence.

  16. New Visions for Large Scale Networks: Research and Applications

    Data.gov (United States)

    Networking and Information Technology Research and Development, Executive Office of the President — This paper documents the findings of the March 12-14, 2001 Workshop on New Visions for Large-Scale Networks: Research and Applications. The workshops objectives were...

  17. Large-scale networks in engineering and life sciences

    CERN Document Server

    Findeisen, Rolf; Flockerzi, Dietrich; Reichl, Udo; Sundmacher, Kai

    2014-01-01

    This edited volume provides insights into and tools for the modeling, analysis, optimization, and control of large-scale networks in the life sciences and in engineering. Large-scale systems are often the result of networked interactions between a large number of subsystems, and their analysis and control are becoming increasingly important. The chapters of this book present the basic concepts and theoretical foundations of network theory and discuss its applications in different scientific areas such as biochemical reactions, chemical production processes, systems biology, electrical circuits, and mobile agents. The aim is to identify common concepts, to understand the underlying mathematical ideas, and to inspire discussions across the borders of the various disciplines.  The book originates from the interdisciplinary summer school “Large Scale Networks in Engineering and Life Sciences” hosted by the International Max Planck Research School Magdeburg, September 26-30, 2011, and will therefore be of int...

  18. A large deformation viscoelastic model for double-network hydrogels

    Science.gov (United States)

    Mao, Yunwei; Lin, Shaoting; Zhao, Xuanhe; Anand, Lallit

    2017-03-01

    We present a large deformation viscoelasticity model for recently synthesized double network hydrogels which consist of a covalently-crosslinked polyacrylamide network with long chains, and an ionically-crosslinked alginate network with short chains. Such double-network gels are highly stretchable and at the same time tough, because when stretched the crosslinks in the ionically-crosslinked alginate network rupture which results in distributed internal microdamage which dissipates a substantial amount of energy, while the configurational entropy of the covalently-crosslinked polyacrylamide network allows the gel to return to its original configuration after deformation. In addition to the large hysteresis during loading and unloading, these double network hydrogels also exhibit a substantial rate-sensitive response during loading, but exhibit almost no rate-sensitivity during unloading. These features of large hysteresis and asymmetric rate-sensitivity are quite different from the response of conventional hydrogels. We limit our attention to modeling the complex viscoelastic response of such hydrogels under isothermal conditions. Our model is restricted in the sense that we have limited our attention to conditions under which one might neglect any diffusion of the water in the hydrogel - as might occur when the gel has a uniform initial value of the concentration of water, and the mobility of the water molecules in the gel is low relative to the time scale of the mechanical deformation. We also do not attempt to model the final fracture of such double-network hydrogels.

  19. PKI security in large-scale healthcare networks.

    Science.gov (United States)

    Mantas, Georgios; Lymberopoulos, Dimitrios; Komninos, Nikos

    2012-06-01

    During the past few years a lot of PKI (Public Key Infrastructures) infrastructures have been proposed for healthcare networks in order to ensure secure communication services and exchange of data among healthcare professionals. However, there is a plethora of challenges in these healthcare PKI infrastructures. Especially, there are a lot of challenges for PKI infrastructures deployed over large-scale healthcare networks. In this paper, we propose a PKI infrastructure to ensure security in a large-scale Internet-based healthcare network connecting a wide spectrum of healthcare units geographically distributed within a wide region. Furthermore, the proposed PKI infrastructure facilitates the trust issues that arise in a large-scale healthcare network including multi-domain PKI infrastructures.

  20. A cluster-based strategy for assessing the overlap between large chemical libraries and its application to a recent acquisition.

    Science.gov (United States)

    Engels, Michael F M; Gibbs, Alan C; Jaeger, Edward P; Verbinnen, Danny; Lobanov, Victor S; Agrafiotis, Dimitris K

    2006-01-01

    We report on the structural comparison of the corporate collections of Johnson & Johnson Pharmaceutical Research & Development (JNJPRD) and 3-Dimensional Pharmaceuticals (3DP), performed in the context of the recent acquisition of 3DP by JNJPRD. The main objective of the study was to assess the druglikeness of the 3DP library and the extent to which it enriched the chemical diversity of the JNJPRD corporate collection. The two databases, at the time of acquisition, collectively contained more than 1.1 million compounds with a clearly defined structural description. The analysis was based on a clustering approach and aimed at providing an intuitive quantitative estimate and visual representation of this enrichment. A novel hierarchical clustering algorithm called divisive k-means was employed in combination with Kelley's cluster-level selection method to partition the combined data set into clusters, and the diversity contribution of each library was evaluated as a function of the relative occupancy of these clusters. Typical 3DP chemotypes enriching the diversity of the JNJPRD collection were catalogued and visualized using a modified maximum common substructure algorithm. The joint collection of JNJPRD and 3DP compounds was also compared to other databases of known medicinally active or druglike compounds. The potential of the methodology for the analysis of very large chemical databases is discussed.

  1. Episodic memory in aspects of large-scale brain networks

    Science.gov (United States)

    Jeong, Woorim; Chung, Chun Kee; Kim, June Sic

    2015-01-01

    Understanding human episodic memory in aspects of large-scale brain networks has become one of the central themes in neuroscience over the last decade. Traditionally, episodic memory was regarded as mostly relying on medial temporal lobe (MTL) structures. However, recent studies have suggested involvement of more widely distributed cortical network and the importance of its interactive roles in the memory process. Both direct and indirect neuro-modulations of the memory network have been tried in experimental treatments of memory disorders. In this review, we focus on the functional organization of the MTL and other neocortical areas in episodic memory. Task-related neuroimaging studies together with lesion studies suggested that specific sub-regions of the MTL are responsible for specific components of memory. However, recent studies have emphasized that connectivity within MTL structures and even their network dynamics with other cortical areas are essential in the memory process. Resting-state functional network studies also have revealed that memory function is subserved by not only the MTL system but also a distributed network, particularly the default-mode network (DMN). Furthermore, researchers have begun to investigate memory networks throughout the entire brain not restricted to the specific resting-state network (RSN). Altered patterns of functional connectivity (FC) among distributed brain regions were observed in patients with memory impairments. Recently, studies have shown that brain stimulation may impact memory through modulating functional networks, carrying future implications of a novel interventional therapy for memory impairment. PMID:26321939

  2. Episodic memory in aspects of large-scale brain networks

    Directory of Open Access Journals (Sweden)

    Woorim eJeong

    2015-08-01

    Full Text Available Understanding human episodic memory in aspects of large-scale brain networks has become one of the central themes in neuroscience over the last decade. Traditionally, episodic memory was regarded as mostly relying on medial temporal lobe (MTL structures. However, recent studies have suggested involvement of more widely distributed cortical network and the importance of its interactive roles in the memory process. Both direct and indirect neuro-modulations of the memory network have been tried in experimental treatments of memory disorders. In this review, we focus on the functional organization of the MTL and other neocortical areas in episodic memory. Task-related neuroimaging studies together with lesion studies suggested that specific sub-regions of the MTL are responsible for specific components of memory. However, recent studies have emphasized that connectivity within MTL structures and even their network dynamics with other cortical areas are essential in the memory process. Resting-state functional network studies also have revealed that memory function is subserved by not only the MTL system but also a distributed network, particularly the default-mode network. Furthermore, researchers have begun to investigate memory networks throughout the entire brain not restricted to the specific resting-state network. Altered patterns of functional connectivity among distributed brain regions were observed in patients with memory impairments. Recently, studies have shown that brain stimulation may impact memory through modulating functional networks, carrying future implications of a novel interventional therapy for memory impairment.

  3. A Gossip-based Churn Estimator for Large Dynamic Networks

    NARCIS (Netherlands)

    Giuffrida, C.; Ortolani, S.

    2010-01-01

    Gossip-based aggregation is an emerging paradigm to perform distributed computations and measurements in a large-scale setting. In this paper we explore the possibility of using gossip-based aggregation to estimate churn in arbitrarily large networks. To this end, we introduce a new model to compute

  4. Software Defined Optics and Networking for Large Scale Data Centers

    DEFF Research Database (Denmark)

    Mehmeri, Victor; Andrus, Bogdan-Mihai; Tafur Monroy, Idelfonso

    Big data imposes correlations of large amounts of information between numerous systems and databases. This leads to large dynamically changing flows and traffic patterns between clusters and server racks that result in a decrease of the quality of transmission and degraded application performance....... Highly interconnected topologies combined with flexible, on demand network configuration can become a solution to the ever-increasing dynamic traffic...

  5. Practical characterization of large networks using neighborhood information

    KAUST Repository

    Wang, Pinghui

    2018-02-14

    Characterizing large complex networks such as online social networks through node querying is a challenging task. Network service providers often impose severe constraints on the query rate, hence limiting the sample size to a small fraction of the total network of interest. Various ad hoc subgraph sampling methods have been proposed, but many of them give biased estimates and no theoretical basis on the accuracy. In this work, we focus on developing sampling methods for large networks where querying a node also reveals partial structural information about its neighbors. Our methods are optimized for NoSQL graph databases (if the database can be accessed directly), or utilize Web APIs available on most major large networks for graph sampling. We show that our sampling method has provable convergence guarantees on being an unbiased estimator, and it is more accurate than state-of-the-art methods. We also explore methods to uncover shortest paths between a subset of nodes and detect high degree nodes by sampling only a small fraction of the network of interest. Our results demonstrate that utilizing neighborhood information yields methods that are two orders of magnitude faster than state-of-the-art methods.

  6. Impact of heuristics in clustering large biological networks.

    Science.gov (United States)

    Shafin, Md Kishwar; Kabir, Kazi Lutful; Ridwan, Iffatur; Anannya, Tasmiah Tamzid; Karim, Rashid Saadman; Hoque, Mohammad Mozammel; Rahman, M Sohel

    2015-12-01

    Traditional clustering algorithms often exhibit poor performance for large networks. On the contrary, greedy algorithms are found to be relatively efficient while uncovering functional modules from large biological networks. The quality of the clusters produced by these greedy techniques largely depends on the underlying heuristics employed. Different heuristics based on different attributes and properties perform differently in terms of the quality of the clusters produced. This motivates us to design new heuristics for clustering large networks. In this paper, we have proposed two new heuristics and analyzed the performance thereof after incorporating those with three different combinations in a recently celebrated greedy clustering algorithm named SPICi. We have extensively analyzed the effectiveness of these new variants. The results are found to be promising. Copyright © 2015 Elsevier Ltd. All rights reserved.

  7. Pythoscape: a framework for generation of large protein similarity networks.

    Science.gov (United States)

    Barber, Alan E; Babbitt, Patricia C

    2012-11-01

    Pythoscape is a framework implemented in Python for processing large protein similarity networks for visualization in other software packages. Protein similarity networks are graphical representations of sequence, structural and other similarities among proteins for which pairwise all-by-all similarity connections have been calculated. Mapping of biological and other information to network nodes or edges enables hypothesis creation about sequence-structure-function relationships across sets of related proteins. Pythoscape provides several options to calculate pairwise similarities for input sequences or structures, applies filters to network edges and defines sets of similar nodes and their associated data as single nodes (termed representative nodes) for compression of network information and output data or formatted files for visualization.

  8. Country-overlapping radiation protection education and training by the CHERNE network; Laenderuebergreifende Strahlenschutzausbildung im Rahmen des CHERNE-Netzwerks

    Energy Technology Data Exchange (ETDEWEB)

    Hoyler, Frieder [Fachhochschule Aachen, Juelich (Germany). Strahlenschutzkursstaette

    2013-09-01

    The CHERNE network is promoting the cooperation between colleges and research facilities at the training of students. The article describes particular study courses in the field of radiation protection. (orig.)

  9. Partially Overlapping Sensorimotor Networks Underlie Speech Praxis and Verbal Short-Term Memory: Evidence from Apraxia of Speech Following Acute Stroke

    Directory of Open Access Journals (Sweden)

    Gregory eHickok

    2014-08-01

    Full Text Available We tested the hypothesis that motor planning and programming of speech articulation and verbal short-term memory (vSTM depend on partially overlapping networks of neural regions. We evaluated this proposal by testing 76 individuals with acute ischemic stroke for impairment in motor planning of speech articulation (apraxia of speech; AOS and vSTM in the first day of stroke, before the opportunity for recovery or reorganization of structure-function relationships. We also evaluate areas of both infarct and low blood flow that might have contributed to AOS or impaired vSTM in each person. We found that AOS was associated with tissue dysfunction in motor-related areas (posterior primary motor cortex, pars opercularis; premotor cortex, insula and sensory-related areas (primary somatosensory cortex, secondary somatosensory cortex, parietal operculum/auditory cortex; while impaired vSTM was associated with primarily motor-related areas (pars opercularis and pars triangularis, premotor cortex, and primary motor cortex. These results are consistent with the hypothesis, also supported by functional imaging data, that both speech praxis and vSTM rely on partially overlapping networks of brain regions.

  10. Partially overlapping sensorimotor networks underlie speech praxis and verbal short-term memory: evidence from apraxia of speech following acute stroke.

    Science.gov (United States)

    Hickok, Gregory; Rogalsky, Corianne; Chen, Rong; Herskovits, Edward H; Townsley, Sarah; Hillis, Argye E

    2014-01-01

    We tested the hypothesis that motor planning and programming of speech articulation and verbal short-term memory (vSTM) depend on partially overlapping networks of neural regions. We evaluated this proposal by testing 76 individuals with acute ischemic stroke for impairment in motor planning of speech articulation (apraxia of speech, AOS) and vSTM in the first day of stroke, before the opportunity for recovery or reorganization of structure-function relationships. We also evaluated areas of both infarct and low blood flow that might have contributed to AOS or impaired vSTM in each person. We found that AOS was associated with tissue dysfunction in motor-related areas (posterior primary motor cortex, pars opercularis; premotor cortex, insula) and sensory-related areas (primary somatosensory cortex, secondary somatosensory cortex, parietal operculum/auditory cortex); while impaired vSTM was associated with primarily motor-related areas (pars opercularis and pars triangularis, premotor cortex, and primary motor cortex). These results are consistent with the hypothesis, also supported by functional imaging data, that both speech praxis and vSTM rely on partially overlapping networks of brain regions.

  11. PKI security in large-scale healthcare networks

    OpenAIRE

    Mantas, G.; Lymberopoulos, D.; Komninos, N.

    2012-01-01

    During the past few years a lot of PKI (Public Key Infrastructures) infrastructures have been proposed for healthcare networks in order to ensure secure communication services and exchange of data among healthcare professionals. However, there is a plethora of challenges in these healthcare PKI infrastructures. Especially, there are a lot of challenges for PKI infrastructures deployed over large-scale healthcare networks. In this paper, we propose a PKI infrastructure to ensure security in a ...

  12. Full-Duplex Communications in Large-Scale Cellular Networks

    KAUST Repository

    AlAmmouri, Ahmad

    2016-04-01

    In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization and efficiency. However, the penetration of FD communications to the cellular networks domain is challenging due to the imposed uplink/downlink interference. This thesis presents a tractable framework, based on stochastic geometry, to study FD communications in multi-tier cellular networks. Particularly, we assess the FD communications effect on the network performance and quantify the associated gains. The study proves the vulnerability of the uplink to the downlink interference and shows that the improved FD rate gains harvested in the downlink (up to 97%) comes at the expense of a significant degradation in the uplink rate (up to 94%). Therefore, we propose a novel fine-grained duplexing scheme, denoted as α-duplex scheme, which allows a partial overlap between the uplink and the downlink frequency bands. We derive the required conditions to harvest rate gains from the α-duplex scheme and show its superiority to both the FD and half-duplex (HD) schemes. In particular, we show that the α-duplex scheme provides a simultaneous improvement of 28% for the downlink rate and 56% for the uplink rate. We also show that the amount of the overlap can be optimized based on the network design objective. Moreover, backward compatibility is an essential ingredient for the success of new technologies. In the context of in-band FD communication, FD base stations (BSs) should support HD users\\' equipment (UEs) without sacrificing the foreseen FD gains. The results show that FD-UEs are not necessarily required to harvest rate gains from FD-BSs. In particular, the results show that adding FD-UEs to FD-BSs offers a maximum of 5% rate gain over FD-BSs and HD-UEs case, which is a marginal gain compared to the burden required to implement FD transceivers at the UEs\\' side. To this end, we shed light on practical scenarios where HD-UEs operation with FD-BSs outperforms the

  13. Predicting Positive and Negative Relationships in Large Social Networks.

    Directory of Open Access Journals (Sweden)

    Guan-Nan Wang

    Full Text Available In a social network, users hold and express positive and negative attitudes (e.g. support/opposition towards other users. Those attitudes exhibit some kind of binary relationships among the users, which play an important role in social network analysis. However, some of those binary relationships are likely to be latent as the scale of social network increases. The essence of predicting latent binary relationships have recently began to draw researchers' attention. In this paper, we propose a machine learning algorithm for predicting positive and negative relationships in social networks inspired by structural balance theory and social status theory. More specifically, we show that when two users in the network have fewer common neighbors, the prediction accuracy of the relationship between them deteriorates. Accordingly, in the training phase, we propose a segment-based training framework to divide the training data into two subsets according to the number of common neighbors between users, and build a prediction model for each subset based on support vector machine (SVM. Moreover, to deal with large-scale social network data, we employ a sampling strategy that selects small amount of training data while maintaining high accuracy of prediction. We compare our algorithm with traditional algorithms and adaptive boosting of them. Experimental results of typical data sets show that our algorithm can deal with large social networks and consistently outperforms other methods.

  14. Predicting Positive and Negative Relationships in Large Social Networks.

    Science.gov (United States)

    Wang, Guan-Nan; Gao, Hui; Chen, Lian; Mensah, Dennis N A; Fu, Yan

    2015-01-01

    In a social network, users hold and express positive and negative attitudes (e.g. support/opposition) towards other users. Those attitudes exhibit some kind of binary relationships among the users, which play an important role in social network analysis. However, some of those binary relationships are likely to be latent as the scale of social network increases. The essence of predicting latent binary relationships have recently began to draw researchers' attention. In this paper, we propose a machine learning algorithm for predicting positive and negative relationships in social networks inspired by structural balance theory and social status theory. More specifically, we show that when two users in the network have fewer common neighbors, the prediction accuracy of the relationship between them deteriorates. Accordingly, in the training phase, we propose a segment-based training framework to divide the training data into two subsets according to the number of common neighbors between users, and build a prediction model for each subset based on support vector machine (SVM). Moreover, to deal with large-scale social network data, we employ a sampling strategy that selects small amount of training data while maintaining high accuracy of prediction. We compare our algorithm with traditional algorithms and adaptive boosting of them. Experimental results of typical data sets show that our algorithm can deal with large social networks and consistently outperforms other methods.

  15. Experimental performance evaluation of software defined networking (SDN) based data communication networks for large scale flexi-grid optical networks.

    Science.gov (United States)

    Zhao, Yongli; He, Ruiying; Chen, Haoran; Zhang, Jie; Ji, Yuefeng; Zheng, Haomian; Lin, Yi; Wang, Xinbo

    2014-04-21

    Software defined networking (SDN) has become the focus in the current information and communication technology area because of its flexibility and programmability. It has been introduced into various network scenarios, such as datacenter networks, carrier networks, and wireless networks. Optical transport network is also regarded as an important application scenario for SDN, which is adopted as the enabling technology of data communication networks (DCN) instead of general multi-protocol label switching (GMPLS). However, the practical performance of SDN based DCN for large scale optical networks, which is very important for the technology selection in the future optical network deployment, has not been evaluated up to now. In this paper we have built a large scale flexi-grid optical network testbed with 1000 virtual optical transport nodes to evaluate the performance of SDN based DCN, including network scalability, DCN bandwidth limitation, and restoration time. A series of network performance parameters including blocking probability, bandwidth utilization, average lightpath provisioning time, and failure restoration time have been demonstrated under various network environments, such as with different traffic loads and different DCN bandwidths. The demonstration in this work can be taken as a proof for the future network deployment.

  16. Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

    Science.gov (United States)

    Cheung, Kar-Ming; Jennings, Esther H.; Sergui, John S.

    2013-01-01

    A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of

  17. Structural Quality of Service in Large-Scale Networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup

    , telephony and data. To meet the requirements of the different applications, and to handle the increased vulnerability to failures, the ability to design robust networks providing good Quality of Service is crucial. However, most planning of large-scale networks today is ad-hoc based, leading to highly...... complex networks lacking predictability and global structural properties. The thesis applies the concept of Structural Quality of Service to formulate desirable global properties, and it shows how regular graph structures can be used to obtain such properties.......Digitalization has created the base for co-existence and convergence in communications, leading to an increasing use of multi service networks. This is for example seen in the Fiber To The Home implementations, where a single fiber is used for virtually all means of communication, including TV...

  18. Practical characterization of large networks using neighborhood information

    KAUST Repository

    Wang, Pinghui; Zhao, Junzhou; Ribeiro, Bruno; Lui, John C. S.; Towsley, Don; Guan, Xiaohong

    2018-01-01

    querying a node also reveals partial structural information about its neighbors. Our methods are optimized for NoSQL graph databases (if the database can be accessed directly), or utilize Web APIs available on most major large networks for graph sampling

  19. Large Amplitude Oscillatory Extension of Soft Polymeric Networks

    DEFF Research Database (Denmark)

    Bejenariu, Anca Gabriela; Rasmussen, Henrik K.; Skov, Anne Ladegaard

    2010-01-01

    sing a filament stretching rheometer (FSR) surrounded by a thermostatic chamber and equipped with a micrometric laser it is possible to measure large amplitude oscillatory elongation (LAOE) on elastomeric based networks with no base flow as in the LAOE method for polymer melts. Poly(dimethylsilox...

  20. On-the-fly Overlapping of Sparse Generations

    DEFF Research Database (Denmark)

    Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2014-01-01

    Traditionally, the idea of overlapping generations in network coding research has focused on reducing the complexity of decoding large data files while maintaining the delay performance expected of a system that combines all data packets. However, the effort for encoding and decoding individual g...

  1. Algoritmo incremental de agrupamiento con traslape para el procesamiento de grandes colecciones de datos (Overlapping clustering incremental algorithm for large data collections processing

    Directory of Open Access Journals (Sweden)

    Lázaro Janier González-Soler

    2015-12-01

    Full Text Available Spanish abstract Existen diversos problemas en el Reconocimiento de Patrones y en la Minería de Datos que, por su naturaleza, consideran que los objetos pueden pertenecer a más de una clase o grupo. DClustR es un algoritmo dinámico de agrupamiento con traslape que ha mostrado, en tareas de agrupamiento de documentos, el mejor balance entre calidad de los grupos y eficiencia entre los algoritmos dinámicos de agrupamiento con traslape reportados en la literatura. A pesar de obtener buenos resultados, DClustR puede ser poco útil en aplicaciones que trabajen con grandes colecciones de documentos, debido a que tiene una complejidad computacional y a la cantidad de memoria que utiliza para el procesamiento de las colecciones. En este trabajo se presenta una versión paralela basada en GPU del algoritmo DClustR, llamada CUDA-DClus, para mejorar la eficiencia de DClustR en aplicaciones que lidien con largas colecciones de documentos. Los experimentos fueron realizados sobre varias colecciones estándares de documentos y en ellos se muestra el buen rendimiento de CUDA-DClus en términos de eficiencia y consumo de memoria. English abstract There are several problems in Pattern Recognition and Data Mining that, by its inherent nature, consider that the objects can belong to more than a class or cluster. DClustR is a dynamic overlapping clustering algorithm that has shown, in document clustering tasks, the best trade-off between cluster’s quality and efficiency among existing dynamic overlapping clustering algorithms. However, DClustR could be less useful when working in applications that deal with large data collections, due to its computational complexity and memory demanded for processing them. In this paper, a GPU-based parallel algorithm of DClustR, named CUDA-DClus is suggested to enhance DClustR efficiency in applications dealing with large data collections. The experimental phase conducted over various standard data collections showed that

  2. Development of large-scale functional brain networks in children.

    Directory of Open Access Journals (Sweden)

    Kaustubh Supekar

    2009-07-01

    Full Text Available The ontogeny of large-scale functional organization of the human brain is not well understood. Here we use network analysis of intrinsic functional connectivity to characterize the organization of brain networks in 23 children (ages 7-9 y and 22 young-adults (ages 19-22 y. Comparison of network properties, including path-length, clustering-coefficient, hierarchy, and regional connectivity, revealed that although children and young-adults' brains have similar "small-world" organization at the global level, they differ significantly in hierarchical organization and interregional connectivity. We found that subcortical areas were more strongly connected with primary sensory, association, and paralimbic areas in children, whereas young-adults showed stronger cortico-cortical connectivity between paralimbic, limbic, and association areas. Further, combined analysis of functional connectivity with wiring distance measures derived from white-matter fiber tracking revealed that the development of large-scale brain networks is characterized by weakening of short-range functional connectivity and strengthening of long-range functional connectivity. Importantly, our findings show that the dynamic process of over-connectivity followed by pruning, which rewires connectivity at the neuronal level, also operates at the systems level, helping to reconfigure and rebalance subcortical and paralimbic connectivity in the developing brain. Our study demonstrates the usefulness of network analysis of brain connectivity to elucidate key principles underlying functional brain maturation, paving the way for novel studies of disrupted brain connectivity in neurodevelopmental disorders such as autism.

  3. Development of large-scale functional brain networks in children.

    Science.gov (United States)

    Supekar, Kaustubh; Musen, Mark; Menon, Vinod

    2009-07-01

    The ontogeny of large-scale functional organization of the human brain is not well understood. Here we use network analysis of intrinsic functional connectivity to characterize the organization of brain networks in 23 children (ages 7-9 y) and 22 young-adults (ages 19-22 y). Comparison of network properties, including path-length, clustering-coefficient, hierarchy, and regional connectivity, revealed that although children and young-adults' brains have similar "small-world" organization at the global level, they differ significantly in hierarchical organization and interregional connectivity. We found that subcortical areas were more strongly connected with primary sensory, association, and paralimbic areas in children, whereas young-adults showed stronger cortico-cortical connectivity between paralimbic, limbic, and association areas. Further, combined analysis of functional connectivity with wiring distance measures derived from white-matter fiber tracking revealed that the development of large-scale brain networks is characterized by weakening of short-range functional connectivity and strengthening of long-range functional connectivity. Importantly, our findings show that the dynamic process of over-connectivity followed by pruning, which rewires connectivity at the neuronal level, also operates at the systems level, helping to reconfigure and rebalance subcortical and paralimbic connectivity in the developing brain. Our study demonstrates the usefulness of network analysis of brain connectivity to elucidate key principles underlying functional brain maturation, paving the way for novel studies of disrupted brain connectivity in neurodevelopmental disorders such as autism.

  4. Enhancement of large fluctuations to extinction in adaptive networks

    Science.gov (United States)

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

    2018-01-01

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

  5. Using Agent Base Models to Optimize Large Scale Network for Large System Inventories

    Science.gov (United States)

    Shameldin, Ramez Ahmed; Bowling, Shannon R.

    2010-01-01

    The aim of this paper is to use Agent Base Models (ABM) to optimize large scale network handling capabilities for large system inventories and to implement strategies for the purpose of reducing capital expenses. The models used in this paper either use computational algorithms or procedure implementations developed by Matlab to simulate agent based models in a principal programming language and mathematical theory using clusters, these clusters work as a high performance computational performance to run the program in parallel computational. In both cases, a model is defined as compilation of a set of structures and processes assumed to underlie the behavior of a network system.

  6. Overlapping clusters for distributed computation.

    Energy Technology Data Exchange (ETDEWEB)

    Mirrokni, Vahab (Google Research, New York, NY); Andersen, Reid (Microsoft Corporation, Redmond, WA); Gleich, David F.

    2010-11-01

    Scalable, distributed algorithms must address communication problems. We investigate overlapping clusters, or vertex partitions that intersect, for graph computations. This setup stores more of the graph than required but then affords the ease of implementation of vertex partitioned algorithms. Our hope is that this technique allows us to reduce communication in a computation on a distributed graph. The motivation above draws on recent work in communication avoiding algorithms. Mohiyuddin et al. (SC09) design a matrix-powers kernel that gives rise to an overlapping partition. Fritzsche et al. (CSC2009) develop an overlapping clustering for a Schwarz method. Both techniques extend an initial partitioning with overlap. Our procedure generates overlap directly. Indeed, Schwarz methods are commonly used to capitalize on overlap. Elsewhere, overlapping communities (Ahn et al, Nature 2009; Mishra et al. WAW2007) are now a popular model of structure in social networks. These have long been studied in statistics (Cole and Wishart, CompJ 1970). We present two types of results: (i) an estimated swapping probability {rho}{infinity}; and (ii) the communication volume of a parallel PageRank solution (link-following {alpha} = 0.85) using an additive Schwarz method. The volume ratio is the amount of extra storage for the overlap (2 means we store the graph twice). Below, as the ratio increases, the swapping probability and PageRank communication volume decreases.

  7. Efficient network monitoring for large data acquisition systems

    International Nuclear Information System (INIS)

    Savu, D.O.; Martin, B.; Al-Shabibi, A.; Sjoen, R.; Batraneanu, S.M.; Stancu, S.N.

    2012-01-01

    Though constantly evolving and improving, the available network monitoring solutions have limitations when applied to the infrastructure of a high speed realtime data acquisition (DAQ) system. DAQ networks are particular computer networks where experts have to pay attention to both individual subsections as well as system wide traffic flows while monitoring the network. The ATLAS Network at the Large Hadron Collider (LHC) has more than 200 switches interconnecting 3500 hosts and totaling 8500 high speed links. The use of heterogeneous tools for monitoring various infrastructure parameters, in order to assure optimal DAQ system performance, proved to be a tedious and time consuming task for experts. To alleviate this problem we used our networking and DAQ expertise to build a flexible and scalable monitoring system providing an intuitive user interface with the same look and feel irrespective of the data provider that is used. Our system uses custom developed components for critical performance monitoring and seamlessly integrates complementary data from auxiliary tools, such as NAGIOS, information services or custom databases. A number of techniques (e.g. normalization, aggregation and data caching) were used in order to improve the user interface response time. The end result is a unified monitoring interface, for fast and uniform access to system statistics, which significantly reduced the time spent by experts for ad-hoc and post-mortem analysis. (authors)

  8. Reorganizing Complex Network to Improve Large-Scale Multiagent Teamwork

    Directory of Open Access Journals (Sweden)

    Yang Xu

    2014-01-01

    Full Text Available Large-scale multiagent teamwork has been popular in various domains. Similar to human society infrastructure, agents only coordinate with some of the others, with a peer-to-peer complex network structure. Their organization has been proven as a key factor to influence their performance. To expedite team performance, we have analyzed that there are three key factors. First, complex network effects may be able to promote team performance. Second, coordination interactions coming from their sources are always trying to be routed to capable agents. Although they could be transferred across the network via different paths, their sources and sinks depend on the intrinsic nature of the team which is irrelevant to the network connections. In addition, the agents involved in the same plan often form a subteam and communicate with each other more frequently. Therefore, if the interactions between agents can be statistically recorded, we are able to set up an integrated network adjustment algorithm by combining the three key factors. Based on our abstracted teamwork simulations and the coordination statistics, we implemented the adaptive reorganization algorithm. The experimental results briefly support our design that the reorganized network is more capable of coordinating heterogeneous agents.

  9. Large-Scale Analysis of Network Bistability for Human Cancers

    Science.gov (United States)

    Shiraishi, Tetsuya; Matsuyama, Shinako; Kitano, Hiroaki

    2010-01-01

    Protein–protein interaction and gene regulatory networks are likely to be locked in a state corresponding to a disease by the behavior of one or more bistable circuits exhibiting switch-like behavior. Sets of genes could be over-expressed or repressed when anomalies due to disease appear, and the circuits responsible for this over- or under-expression might persist for as long as the disease state continues. This paper shows how a large-scale analysis of network bistability for various human cancers can identify genes that can potentially serve as drug targets or diagnosis biomarkers. PMID:20628618

  10. Aggregated Representation of Distribution Networks for Large-Scale Transmission Network Simulations

    DEFF Research Database (Denmark)

    Göksu, Ömer; Altin, Müfit; Sørensen, Poul Ejnar

    2014-01-01

    As a common practice of large-scale transmission network analysis the distribution networks have been represented as aggregated loads. However, with increasing share of distributed generation, especially wind and solar power, in the distribution networks, it became necessary to include...... the distributed generation within those analysis. In this paper a practical methodology to obtain aggregated behaviour of the distributed generation is proposed. The methodology, which is based on the use of the IEC standard wind turbine models, is applied on a benchmark distribution network via simulations....

  11. Multiscale analysis of spreading in a large communication network

    International Nuclear Information System (INIS)

    Kivelä, Mikko; Pan, Raj Kumar; Kaski, Kimmo; Kertész, János; Saramäki, Jari; Karsai, Márton

    2012-01-01

    In temporal networks, both the topology of the underlying network and the timings of interaction events can be crucial in determining how a dynamic process mediated by the network unfolds. We have explored the limiting case of the speed of spreading in the SI model, set up such that an event between an infectious and a susceptible individual always transmits the infection. The speed of this process sets an upper bound for the speed of any dynamic process that is mediated through the interaction events of the network. With the help of temporal networks derived from large-scale time-stamped data on mobile phone calls, we extend earlier results that indicate the slowing-down effects of burstiness and temporal inhomogeneities. In such networks, links are not permanently active, but dynamic processes are mediated by recurrent events taking place on the links at specific points in time. We perform a multiscale analysis and pinpoint the importance of the timings of event sequences on individual links, their correlations with neighboring sequences, and the temporal pathways taken by the network-scale spreading process. This is achieved by studying empirically and analytically different characteristic relay times of links, relevant to the respective scales, and a set of temporal reference models that allow for removing selected time-domain correlations one by one. Our analysis shows that for the spreading velocity, time-domain inhomogeneities are as important as the network topology, which indicates the need to take time-domain information into account when studying spreading dynamics. In particular, results for the different characteristic relay times underline the importance of the burstiness of individual links

  12. MELAS and Kearns–Sayre overlap syndrome due to the mtDNA m. A3243G mutation and large-scale mtDNA deletions

    Directory of Open Access Journals (Sweden)

    Nian Yu

    2016-09-01

    Full Text Available This paper reported an unusual manifestation of a 19-year-old Chinese male patient presented with a complex phenotype of mitochondrial encephalomyopathy, lactic acidosis and stroke-like episodes (MELAS syndrome and Kearns–Sayre syndrome (KSS. He was admitted to our hospital with the chief complaint of “acute fever, headache and slow reaction for 21 days”. He was initially misdiagnosed as “viral encephalitis”. This Chinese man with significant past medical history of intolerating fatigue presented paroxysmal neurobehavioral attacks that started about 10 years ago. During this span, 3 or 4 attack clusters were described during which several attacks occurred over a few days. The further examination found that the hallmark signs of this patient included progressive myoclonus epilepsy, cerebellar ataxia, hearing loss, myopathic weakness, ophthalmoparesis, pigmentary retinopathy and bifascicular heart block (Wolff–Parkinson–White syndrome. By young age the disease progression is characterized by the addition of migraine, vomiting, and stroke-like episodes, symptoms of MELAS expression, which indicated completion of the MELAS/KSS overlap syndrome. The m. A3243G mitochondrial DNA mutation and single large-scale mtDNA deletions were found in this patient. This mutation has been reported with MELAS, KSS, myopathy, deafness and mental disorder with cognitive impairment. This is the first description with a MELAS/KSS syndrome in Chinese.

  13. Overlapping community detection using weighted consensus ...

    Indian Academy of Sciences (India)

    2016-09-21

    Sep 21, 2016 ... Complex networks; overlapping community; consensus clustering. PACS Nos 89.75 ... networks, a person may be in several social groups like family, friends ..... the social interactions between individuals in a karate club in an.

  14. Exploring difference and overlap between schizophrenia, schizoaffective and bipolar disorders using resting-state brain functional networks.

    Science.gov (United States)

    Du, Yuhui; Liu, Jingyu; Sui, Jing; He, Hao; Pearlson, Godfrey D; Calhoun, Vince D

    2014-01-01

    Schizophrenia, schizoaffective and bipolar disorders share some common symptoms. However, the biomarkers underlying those disorders remain unclear. In fact, there is still controversy about the schizoaffective disorder with respect to its validity of independent category and its relationship with schizophrenia and bipolar disorders. In this paper, based on brain functional networks extracted from resting-state fMRI using a recently proposed group information guided ICA (GIG-ICA) method, we explore the biomarkers for discriminating healthy controls, schizophrenia patients, bipolar patients, and patients with two symptom defined subsets of schizoaffective disorder, and then investigate the relationship between different groups. The results demonstrate that the discriminating regions mainly including frontal, parietal, precuneus, cingulate, supplementary motor, cerebellar, insular and supramarginal cortices perform well in distinguishing the different diagnostic groups. The results also suggest that schizoaffective disorder may be an independent disorder, although its subtype characterized by depressive episodes shares more similarity with schizophrenia.

  15. Complex modular structure of large-scale brain networks

    Science.gov (United States)

    Valencia, M.; Pastor, M. A.; Fernández-Seara, M. A.; Artieda, J.; Martinerie, J.; Chavez, M.

    2009-06-01

    Modular structure is ubiquitous among real-world networks from related proteins to social groups. Here we analyze the modular organization of brain networks at a large scale (voxel level) extracted from functional magnetic resonance imaging signals. By using a random-walk-based method, we unveil the modularity of brain webs and show modules with a spatial distribution that matches anatomical structures with functional significance. The functional role of each node in the network is studied by analyzing its patterns of inter- and intramodular connections. Results suggest that the modular architecture constitutes the structural basis for the coexistence of functional integration of distant and specialized brain areas during normal brain activities at rest.

  16. Information-Theoretic Inference of Large Transcriptional Regulatory Networks

    Directory of Open Access Journals (Sweden)

    Meyer Patrick

    2007-01-01

    Full Text Available The paper presents MRNET, an original method for inferring genetic networks from microarray data. The method is based on maximum relevance/minimum redundancy (MRMR, an effective information-theoretic technique for feature selection in supervised learning. The MRMR principle consists in selecting among the least redundant variables the ones that have the highest mutual information with the target. MRNET extends this feature selection principle to networks in order to infer gene-dependence relationships from microarray data. The paper assesses MRNET by benchmarking it against RELNET, CLR, and ARACNE, three state-of-the-art information-theoretic methods for large (up to several thousands of genes network inference. Experimental results on thirty synthetically generated microarray datasets show that MRNET is competitive with these methods.

  17. Information-Theoretic Inference of Large Transcriptional Regulatory Networks

    Directory of Open Access Journals (Sweden)

    Patrick E. Meyer

    2007-06-01

    Full Text Available The paper presents MRNET, an original method for inferring genetic networks from microarray data. The method is based on maximum relevance/minimum redundancy (MRMR, an effective information-theoretic technique for feature selection in supervised learning. The MRMR principle consists in selecting among the least redundant variables the ones that have the highest mutual information with the target. MRNET extends this feature selection principle to networks in order to infer gene-dependence relationships from microarray data. The paper assesses MRNET by benchmarking it against RELNET, CLR, and ARACNE, three state-of-the-art information-theoretic methods for large (up to several thousands of genes network inference. Experimental results on thirty synthetically generated microarray datasets show that MRNET is competitive with these methods.

  18. How long do satellites need to overlap? Evaluation of climate data stability from overlapping satellite records

    Science.gov (United States)

    Weatherhead, Elizabeth C.; Harder, Jerald; Araujo-Pradere, Eduardo A.; Bodeker, Greg; English, Jason M.; Flynn, Lawrence E.; Frith, Stacey M.; Lazo, Jeffrey K.; Pilewskie, Peter; Weber, Mark; Woods, Thomas N.

    2017-12-01

    Sensors on satellites provide unprecedented understanding of the Earth's climate system by measuring incoming solar radiation, as well as both passive and active observations of the entire Earth with outstanding spatial and temporal coverage. A common challenge with satellite observations is to quantify their ability to provide well-calibrated, long-term, stable records of the parameters they measure. Ground-based intercomparisons offer some insight, while reference observations and internal calibrations give further assistance for understanding long-term stability. A valuable tool for evaluating and developing long-term records from satellites is the examination of data from overlapping satellite missions. This paper addresses how the length of overlap affects the ability to identify an offset or a drift in the overlap of data between two sensors. Ozone and temperature data sets are used as examples showing that overlap data can differ by latitude and can change over time. New results are presented for the general case of sensor overlap by using Solar Radiation and Climate Experiment (SORCE) Spectral Irradiance Monitor (SIM) and Solar Stellar Irradiance Comparison Experiment (SOLSTICE) solar irradiance data as an example. To achieve a 1 % uncertainty in estimating the offset for these two instruments' measurement of the Mg II core (280 nm) requires approximately 5 months of overlap. For relative drift to be identified within 0.1 % yr-1 uncertainty (0.00008 W m-2 nm-1 yr-1), the overlap for these two satellites would need to be 2.5 years. Additional overlap of satellite measurements is needed if, as is the case for solar monitoring, unexpected jumps occur adding uncertainty to both offsets and drifts; the additional length of time needed to account for a single jump in the overlap data may be as large as 50 % of the original overlap period in order to achieve the same desired confidence in the stability of the merged data set. Results presented here are directly

  19. A large fiber sensor network for an acoustic neutrino telescope

    Directory of Open Access Journals (Sweden)

    Buis Ernst-Jan

    2017-01-01

    Full Text Available The scientific prospects of detecting neutrinos with an energy close or even higher than the GKZ cut-off energy has been discussed extensively in literature. It is clear that due to their expected low flux, the detection of these ultra-high energy neutrinos (Ev > 1018 eV requires a telescope larger than 100 km3. Acoustic detection may provide a way to observe these ultra-high energy cosmic neutrinos, as sound that they induce in the deep sea when neutrinos lose their energy travels undisturbed for many kilometers. To realize a large scale acoustic neutrino telescope, dedicated technology must be developed that allows for a deep sea sensor network. Fiber optic hydrophone technology provides a promising means to establish a large scale sensor network [1] with the proper sensitivity to detect the small signals from the neutrino interactions.

  20. Locating inefficient links in a large-scale transportation network

    Science.gov (United States)

    Sun, Li; Liu, Like; Xu, Zhongzhi; Jie, Yang; Wei, Dong; Wang, Pu

    2015-02-01

    Based on data from geographical information system (GIS) and daily commuting origin destination (OD) matrices, we estimated the distribution of traffic flow in the San Francisco road network and studied Braess's paradox in a large-scale transportation network with realistic travel demand. We measured the variation of total travel time Δ T when a road segment is closed, and found that | Δ T | follows a power-law distribution if Δ T 0. This implies that most roads have a negligible effect on the efficiency of the road network, while the failure of a few crucial links would result in severe travel delays, and closure of a few inefficient links would counter-intuitively reduce travel costs considerably. Generating three theoretical networks, we discovered that the heterogeneously distributed travel demand may be the origin of the observed power-law distributions of | Δ T | . Finally, a genetic algorithm was used to pinpoint inefficient link clusters in the road network. We found that closing specific road clusters would further improve the transportation efficiency.

  1. Working memory training mostly engages general-purpose large-scale networks for learning.

    Science.gov (United States)

    Salmi, Juha; Nyberg, Lars; Laine, Matti

    2018-03-21

    The present meta-analytic study examined brain activation changes following working memory (WM) training, a form of cognitive training that has attracted considerable interest. Comparisons with perceptual-motor (PM) learning revealed that WM training engages domain-general large-scale networks for learning encompassing the dorsal attention and salience networks, sensory areas, and striatum. Also the dynamics of the training-induced brain activation changes within these networks showed a high overlap between WM and PM training. The distinguishing feature for WM training was the consistent modulation of the dorso- and ventrolateral prefrontal cortex (DLPFC/VLPFC) activity. The strongest candidate for mediating transfer to similar untrained WM tasks was the frontostriatal system, showing higher striatal and VLPFC activations, and lower DLPFC activations after training. Modulation of transfer-related areas occurred mostly with longer training periods. Overall, our findings place WM training effects into a general perception-action cycle, where some modulations may depend on the specific cognitive demands of a training task. Copyright © 2018 Elsevier Ltd. All rights reserved.

  2. A large number of stepping motor network construction by PLC

    Science.gov (United States)

    Mei, Lin; Zhang, Kai; Hongqiang, Guo

    2017-11-01

    In the flexible automatic line, the equipment is complex, the control mode is flexible, how to realize the large number of step and servo motor information interaction, the orderly control become a difficult control. Based on the existing flexible production line, this paper makes a comparative study of its network strategy. After research, an Ethernet + PROFIBUSE communication configuration based on PROFINET IO and profibus was proposed, which can effectively improve the data interaction efficiency of the equipment and stable data interaction information.

  3. Empirical Models of Social Learning in a Large, Evolving Network.

    Directory of Open Access Journals (Sweden)

    Ayşe Başar Bener

    Full Text Available This paper advances theories of social learning through an empirical examination of how social networks change over time. Social networks are important for learning because they constrain individuals' access to information about the behaviors and cognitions of other people. Using data on a large social network of mobile device users over a one-month time period, we test three hypotheses: 1 attraction homophily causes individuals to form ties on the basis of attribute similarity, 2 aversion homophily causes individuals to delete existing ties on the basis of attribute dissimilarity, and 3 social influence causes individuals to adopt the attributes of others they share direct ties with. Statistical models offer varied degrees of support for all three hypotheses and show that these mechanisms are more complex than assumed in prior work. Although homophily is normally thought of as a process of attraction, people also avoid relationships with others who are different. These mechanisms have distinct effects on network structure. While social influence does help explain behavior, people tend to follow global trends more than they follow their friends.

  4. IR wireless cluster synapses of HYDRA very large neural networks

    Science.gov (United States)

    Jannson, Tomasz; Forrester, Thomas

    2008-04-01

    RF/IR wireless (virtual) synapses are critical components of HYDRA (Hyper-Distributed Robotic Autonomy) neural networks, already discussed in two earlier papers. The HYDRA network has the potential to be very large, up to 10 11-neurons and 10 18-synapses, based on already established technologies (cellular RF telephony and IR-wireless LANs). It is organized into almost fully connected IR-wireless clusters. The HYDRA neurons and synapses are very flexible, simple, and low-cost. They can be modified into a broad variety of biologically-inspired brain-like computing capabilities. In this third paper, we focus on neural hardware in general, and on IR-wireless synapses in particular. Such synapses, based on LED/LD-connections, dominate the HYDRA neural cluster.

  5. Measuring large-scale social networks with high resolution.

    Directory of Open Access Journals (Sweden)

    Arkadiusz Stopczynski

    Full Text Available This paper describes the deployment of a large-scale study designed to measure human interactions across a variety of communication channels, with high temporal resolution and spanning multiple years-the Copenhagen Networks Study. Specifically, we collect data on face-to-face interactions, telecommunication, social networks, location, and background information (personality, demographics, health, politics for a densely connected population of 1000 individuals, using state-of-the-art smartphones as social sensors. Here we provide an overview of the related work and describe the motivation and research agenda driving the study. Additionally, the paper details the data-types measured, and the technical infrastructure in terms of both backend and phone software, as well as an outline of the deployment procedures. We document the participant privacy procedures and their underlying principles. The paper is concluded with early results from data analysis, illustrating the importance of multi-channel high-resolution approach to data collection.

  6. Coordinated SLNR based Precoding in Large-Scale Heterogeneous Networks

    KAUST Repository

    Boukhedimi, Ikram; Kammoun, Abla; Alouini, Mohamed-Slim

    2017-01-01

    This work focuses on the downlink of large-scale two-tier heterogeneous networks composed of a macro-cell overlaid by micro-cell networks. Our interest is on the design of coordinated beamforming techniques that allow to mitigate the inter-cell interference. Particularly, we consider the case in which the coordinating base stations (BSs) have imperfect knowledge of the channel state information. Under this setting, we propose a regularized SLNR based precoding design in which the regularization factor is used to allow better resilience with respect to the channel estimation errors. Based on tools from random matrix theory, we provide an analytical analysis of the SINR and SLNR performances. These results are then exploited to propose a proper setting of the regularization factor. Simulation results are finally provided in order to validate our findings and to confirm the performance of the proposed precoding scheme.

  7. Coordinated SLNR based Precoding in Large-Scale Heterogeneous Networks

    KAUST Repository

    Boukhedimi, Ikram

    2017-03-06

    This work focuses on the downlink of large-scale two-tier heterogeneous networks composed of a macro-cell overlaid by micro-cell networks. Our interest is on the design of coordinated beamforming techniques that allow to mitigate the inter-cell interference. Particularly, we consider the case in which the coordinating base stations (BSs) have imperfect knowledge of the channel state information. Under this setting, we propose a regularized SLNR based precoding design in which the regularization factor is used to allow better resilience with respect to the channel estimation errors. Based on tools from random matrix theory, we provide an analytical analysis of the SINR and SLNR performances. These results are then exploited to propose a proper setting of the regularization factor. Simulation results are finally provided in order to validate our findings and to confirm the performance of the proposed precoding scheme.

  8. Foundational perspectives on causality in large-scale brain networks

    Science.gov (United States)

    Mannino, Michael; Bressler, Steven L.

    2015-12-01

    A profusion of recent work in cognitive neuroscience has been concerned with the endeavor to uncover causal influences in large-scale brain networks. However, despite the fact that many papers give a nod to the important theoretical challenges posed by the concept of causality, this explosion of research has generally not been accompanied by a rigorous conceptual analysis of the nature of causality in the brain. This review provides both a descriptive and prescriptive account of the nature of causality as found within and between large-scale brain networks. In short, it seeks to clarify the concept of causality in large-scale brain networks both philosophically and scientifically. This is accomplished by briefly reviewing the rich philosophical history of work on causality, especially focusing on contributions by David Hume, Immanuel Kant, Bertrand Russell, and Christopher Hitchcock. We go on to discuss the impact that various interpretations of modern physics have had on our understanding of causality. Throughout all this, a central focus is the distinction between theories of deterministic causality (DC), whereby causes uniquely determine their effects, and probabilistic causality (PC), whereby causes change the probability of occurrence of their effects. We argue that, given the topological complexity of its large-scale connectivity, the brain should be considered as a complex system and its causal influences treated as probabilistic in nature. We conclude that PC is well suited for explaining causality in the brain for three reasons: (1) brain causality is often mutual; (2) connectional convergence dictates that only rarely is the activity of one neuronal population uniquely determined by another one; and (3) the causal influences exerted between neuronal populations may not have observable effects. A number of different techniques are currently available to characterize causal influence in the brain. Typically, these techniques quantify the statistical

  9. Large scale network management. Condition indicators for network stations, high voltage power conductions and cables

    International Nuclear Information System (INIS)

    Eggen, Arnt Ove; Rolfseng, Lars; Langdal, Bjoern Inge

    2006-02-01

    In the Strategic Institute Programme (SIP) 'Electricity Business enters e-business (eBee)' SINTEF Energy research has developed competency that can help the energy business employ ICT systems and computer technology in an improved way. Large scale network management is now a reality, and it is characterized by large entities with increasing demands on efficiency and quality. These are goals that can only be reached by using ICT systems and computer technology in a more clever way than what is the case today. At the same time it is important that knowledge held by experienced co-workers is consulted when formal rules for evaluations and decisions in ICT systems are developed. In this project an analytical concept for evaluation of networks based information in different ICT systems has been developed. The method estimating the indicators to describe different conditions in a network is general, and indicators can be made to fit different levels of decision and network levels, for example network station, transformer circuit, distribution network and regional network. Moreover, the indicators can contain information about technical aspects, economy and HSE. An indicator consists of an indicator name, an indicator value, and an indicator colour based on a traffic-light analogy to indicate a condition or a quality for the indicator. Values on one or more indicators give an impression of important conditions in the network, and make up the basis for knowing where more detailed evaluations have to be conducted before a final decision on for example maintenance or renewal is made. A prototype has been developed for testing the new method. The prototype has been developed in Excel, and especially designed for analysing transformer circuits in a distribution network. However, the method is a general one, and well suited for implementation in a commercial computer system (ml)

  10. A document preparation system in a large network environment

    Energy Technology Data Exchange (ETDEWEB)

    Vigil, M.; Bouchier, S.; Sanders, C.; Sydoriak, S.; Wheeler, K.

    1988-01-01

    At Los Alamos National Laboratory, we have developed an integrated document preparation system that produces publication-quality documents. This system combines text formatters and computer graphics capabilities that have been adapted to meet the needs of users in a large scientific research laboratory. This paper describes the integration of document processing technology to develop a system architecture, based on a page description language, to provide network-wide capabilities in a distributed computing environment. We describe the Laboratory requirements, the integration and implementation issues, and the challenges we faced developing this system.

  11. Developing A Large-Scale, Collaborative, Productive Geoscience Education Network

    Science.gov (United States)

    Manduca, C. A.; Bralower, T. J.; Egger, A. E.; Fox, S.; Ledley, T. S.; Macdonald, H.; Mcconnell, D. A.; Mogk, D. W.; Tewksbury, B. J.

    2012-12-01

    Over the past 15 years, the geoscience education community has grown substantially and developed broad and deep capacity for collaboration and dissemination of ideas. While this community is best viewed as emergent from complex interactions among changing educational needs and opportunities, we highlight the role of several large projects in the development of a network within this community. In the 1990s, three NSF projects came together to build a robust web infrastructure to support the production and dissemination of on-line resources: On The Cutting Edge (OTCE), Earth Exploration Toolbook, and Starting Point: Teaching Introductory Geoscience. Along with the contemporaneous Digital Library for Earth System Education, these projects engaged geoscience educators nationwide in exploring professional development experiences that produced lasting on-line resources, collaborative authoring of resources, and models for web-based support for geoscience teaching. As a result, a culture developed in the 2000s in which geoscience educators anticipated that resources for geoscience teaching would be shared broadly and that collaborative authoring would be productive and engaging. By this time, a diverse set of examples demonstrated the power of the web infrastructure in supporting collaboration, dissemination and professional development . Building on this foundation, more recent work has expanded both the size of the network and the scope of its work. Many large research projects initiated collaborations to disseminate resources supporting educational use of their data. Research results from the rapidly expanding geoscience education research community were integrated into the Pedagogies in Action website and OTCE. Projects engaged faculty across the nation in large-scale data collection and educational research. The Climate Literacy and Energy Awareness Network and OTCE engaged community members in reviewing the expanding body of on-line resources. Building Strong

  12. Large deep neural networks for MS lesion segmentation

    Science.gov (United States)

    Prieto, Juan C.; Cavallari, Michele; Palotai, Miklos; Morales Pinzon, Alfredo; Egorova, Svetlana; Styner, Martin; Guttmann, Charles R. G.

    2017-02-01

    Multiple sclerosis (MS) is a multi-factorial autoimmune disorder, characterized by spatial and temporal dissemination of brain lesions that are visible in T2-weighted and Proton Density (PD) MRI. Assessment of lesion burden and is useful for monitoring the course of the disease, and assessing correlates of clinical outcomes. Although there are established semi-automated methods to measure lesion volume, most of them require human interaction and editing, which are time consuming and limits the ability to analyze large sets of data with high accuracy. The primary objective of this work is to improve existing segmentation algorithms and accelerate the time consuming operation of identifying and validating MS lesions. In this paper, a Deep Neural Network for MS Lesion Segmentation is implemented. The MS lesion samples are extracted from the Partners Comprehensive Longitudinal Investigation of Multiple Sclerosis (CLIMB) study. A set of 900 subjects with T2, PD and a manually corrected label map images were used to train a Deep Neural Network and identify MS lesions. Initial tests using this network achieved a 90% accuracy rate. A secondary goal was to enable this data repository for big data analysis by using this algorithm to segment the remaining cases available in the CLIMB repository.

  13. Computational study of noise in a large signal transduction network

    Directory of Open Access Journals (Sweden)

    Ruohonen Keijo

    2011-06-01

    Full Text Available Abstract Background Biochemical systems are inherently noisy due to the discrete reaction events that occur in a random manner. Although noise is often perceived as a disturbing factor, the system might actually benefit from it. In order to understand the role of noise better, its quality must be studied in a quantitative manner. Computational analysis and modeling play an essential role in this demanding endeavor. Results We implemented a large nonlinear signal transduction network combining protein kinase C, mitogen-activated protein kinase, phospholipase A2, and β isoform of phospholipase C networks. We simulated the network in 300 different cellular volumes using the exact Gillespie stochastic simulation algorithm and analyzed the results in both the time and frequency domain. In order to perform simulations in a reasonable time, we used modern parallel computing techniques. The analysis revealed that time and frequency domain characteristics depend on the system volume. The simulation results also indicated that there are several kinds of noise processes in the network, all of them representing different kinds of low-frequency fluctuations. In the simulations, the power of noise decreased on all frequencies when the system volume was increased. Conclusions We concluded that basic frequency domain techniques can be applied to the analysis of simulation results produced by the Gillespie stochastic simulation algorithm. This approach is suited not only to the study of fluctuations but also to the study of pure noise processes. Noise seems to have an important role in biochemical systems and its properties can be numerically studied by simulating the reacting system in different cellular volumes. Parallel computing techniques make it possible to run massive simulations in hundreds of volumes and, as a result, accurate statistics can be obtained from computational studies.

  14. Large Scale Experiments of Multihop Networks in Mobile Scenarios

    Directory of Open Access Journals (Sweden)

    Yacine Benchaïb

    2016-03-01

    Full Text Available This paper presents the latest advances in our research work focused on VIRMANEL and SILUMOD, a couple of tools developed for research in wireless mobile multihop networks. SILUMOD is a domain specific language dedicated to the definition of mobility models. This language contains key- words and special operators that make it easy to define a mobility model and calculate the positions of a trajectory. These positions are sent to VIRMANEL, a tool that man- ages virtual machines corresponding to mobile nodes, emu- lates their movements and the resulting connections and dis- connections, and displays the network evolution to the user, thanks to its graphical user interface. The virtualization ap- proach we take here allows to run real code and to test real protocol implementations without deploying an important experimental platform. For the experimentation of a large number of virtual mobile nodes, we defined and implemented a new algorithm for the nearest neighbor search to find the nodes that are within communication range. We then car- ried out a considerable measurement campaign in order to evaluate the performance of this algorithm. The results show that even with an experiment using a large number of mobile nodes, our algorithm make it possible to evaluate the state of connectivity between mobile nodes within a reasonable time and number of operations.

  15. A Technical Approach on Large Data Distributed Over a Network

    Directory of Open Access Journals (Sweden)

    Suhasini G

    2011-12-01

    Full Text Available Data mining is nontrivial extraction of implicit, previously unknown and potential useful information from the data. For a database with number of records and for a set of classes such that each record belongs to one of the given classes, the problem of classification is to decide the class to which the given record belongs. The classification problem is also to generate a model for each class from given data set. We are going to make use of supervised classification in which we have training dataset of record, and for each record the class to which it belongs is known. There are many approaches to supervised classification. Decision tree is attractive in data mining environment as they represent rules. Rules can readily expressed in natural languages and they can be even mapped o database access languages. Now a days classification based on decision trees is one of the important problems in data mining   which has applications in many areas.  Now a days database system have become highly distributed, and we are using many paradigms. we consider the problem of inducing decision trees in a large distributed network of highly distributed databases. The classification based on decision tree can be done on the existence of distributed databases in healthcare and in bioinformatics, human computer interaction and by the view that these databases are soon to contain large amounts of data, characterized by its high dimensionality. Current decision tree algorithms would require high communication bandwidth, memory, and they are less efficient and scalability reduces when executed on such large volume of data. So there are some approaches being developed to improve the scalability and even approaches to analyse the data distributed over a network.[keywords: Data mining, Decision tree, decision tree induction, distributed data, classification

  16. OVERLAPPING VIRTUAL CADASTRAL DOCUMENTATION

    Directory of Open Access Journals (Sweden)

    Madalina - Cristina Marian

    2013-12-01

    Full Text Available Two cadastrale plans of buildings, can overlap virtual. Overlap is highlighted when digital reception. According to Law no. 7/1996 as amended and supplemented, to solve these problems is by updating the database graphs, the repositioning. This paper addresses the issue of overlapping virtual cadastre in the history of the period 1999-2012.

  17. Natural language acquisition in large scale neural semantic networks

    Science.gov (United States)

    Ealey, Douglas

    This thesis puts forward the view that a purely signal- based approach to natural language processing is both plausible and desirable. By questioning the veracity of symbolic representations of meaning, it argues for a unified, non-symbolic model of knowledge representation that is both biologically plausible and, potentially, highly efficient. Processes to generate a grounded, neural form of this model-dubbed the semantic filter-are discussed. The combined effects of local neural organisation, coincident with perceptual maturation, are used to hypothesise its nature. This theoretical model is then validated in light of a number of fundamental neurological constraints and milestones. The mechanisms of semantic and episodic development that the model predicts are then used to explain linguistic properties, such as propositions and verbs, syntax and scripting. To mimic the growth of locally densely connected structures upon an unbounded neural substrate, a system is developed that can grow arbitrarily large, data- dependant structures composed of individual self- organising neural networks. The maturational nature of the data used results in a structure in which the perception of concepts is refined by the networks, but demarcated by subsequent structure. As a consequence, the overall structure shows significant memory and computational benefits, as predicted by the cognitive and neural models. Furthermore, the localised nature of the neural architecture also avoids the increasing error sensitivity and redundancy of traditional systems as the training domain grows. The semantic and episodic filters have been demonstrated to perform as well, or better, than more specialist networks, whilst using significantly larger vocabularies, more complex sentence forms and more natural corpora.

  18. Just-in-time connectivity for large spiking networks.

    Science.gov (United States)

    Lytton, William W; Omurtag, Ahmet; Neymotin, Samuel A; Hines, Michael L

    2008-11-01

    The scale of large neuronal network simulations is memory limited due to the need to store connectivity information: connectivity storage grows as the square of neuron number up to anatomically relevant limits. Using the NEURON simulator as a discrete-event simulator (no integration), we explored the consequences of avoiding the space costs of connectivity through regenerating connectivity parameters when needed: just in time after a presynaptic cell fires. We explored various strategies for automated generation of one or more of the basic static connectivity parameters: delays, postsynaptic cell identities, and weights, as well as run-time connectivity state: the event queue. Comparison of the JitCon implementation to NEURON's standard NetCon connectivity method showed substantial space savings, with associated run-time penalty. Although JitCon saved space by eliminating connectivity parameters, larger simulations were still memory limited due to growth of the synaptic event queue. We therefore designed a JitEvent algorithm that added items to the queue only when required: instead of alerting multiple postsynaptic cells, a spiking presynaptic cell posted a callback event at the shortest synaptic delay time. At the time of the callback, this same presynaptic cell directly notified the first postsynaptic cell and generated another self-callback for the next delay time. The JitEvent implementation yielded substantial additional time and space savings. We conclude that just-in-time strategies are necessary for very large network simulations but that a variety of alternative strategies should be considered whose optimality will depend on the characteristics of the simulation to be run.

  19. Modeling of chromosome intermingling by partially overlapping uniform random polygons.

    Science.gov (United States)

    Blackstone, T; Scharein, R; Borgo, B; Varela, R; Diao, Y; Arsuaga, J

    2011-03-01

    During the early phase of the cell cycle the eukaryotic genome is organized into chromosome territories. The geometry of the interface between any two chromosomes remains a matter of debate and may have important functional consequences. The Interchromosomal Network model (introduced by Branco and Pombo) proposes that territories intermingle along their periphery. In order to partially quantify this concept we here investigate the probability that two chromosomes form an unsplittable link. We use the uniform random polygon as a crude model for chromosome territories and we model the interchromosomal network as the common spatial region of two overlapping uniform random polygons. This simple model allows us to derive some rigorous mathematical results as well as to perform computer simulations easily. We find that the probability that one uniform random polygon of length n that partially overlaps a fixed polygon is bounded below by 1 − O(1/√n). We use numerical simulations to estimate the dependence of the linking probability of two uniform random polygons (of lengths n and m, respectively) on the amount of overlapping. The degree of overlapping is parametrized by a parameter [Formula: see text] such that [Formula: see text] indicates no overlapping and [Formula: see text] indicates total overlapping. We propose that this dependence relation may be modeled as f (ε, m, n) = [Formula: see text]. Numerical evidence shows that this model works well when [Formula: see text] is relatively large (ε ≥ 0.5). We then use these results to model the data published by Branco and Pombo and observe that for the amount of overlapping observed experimentally the URPs have a non-zero probability of forming an unsplittable link.

  20. Full-Duplex Communications in Large-Scale Cellular Networks

    KAUST Repository

    Alammouri, Ahmad

    2016-01-01

    /downlink interference. This thesis presents a tractable framework, based on stochastic geometry, to study FD communications in multi-tier cellular networks. Particularly, we assess the FD communications effect on the network performance and quantify the associated gains

  1. ASH : Tackling node mobility in large-scale networks

    NARCIS (Netherlands)

    Pruteanu, A.; Dulman, S.

    2012-01-01

    With the increased adoption of technologies likewireless sensor networks by real-world applications, dynamic network topologies are becoming the rule rather than the exception. Node mobility, however, introduces a range of problems (communication interference, path uncertainty, low quality of

  2. Large deviations for Gaussian queues modelling communication networks

    CERN Document Server

    Mandjes, Michel

    2007-01-01

    Michel Mandjes, Centre for Mathematics and Computer Science (CWI) Amsterdam, The Netherlands, and Professor, Faculty of Engineering, University of Twente. At CWI Mandjes is a senior researcher and Director of the Advanced Communications Network group.  He has published for 60 papers on queuing theory, networks, scheduling, and pricing of networks.

  3. Multilevel method for modeling large-scale networks.

    Energy Technology Data Exchange (ETDEWEB)

    Safro, I. M. (Mathematics and Computer Science)

    2012-02-24

    Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from

  4. Enabling parallel simulation of large-scale HPC network systems

    International Nuclear Information System (INIS)

    Mubarak, Misbah; Carothers, Christopher D.; Ross, Robert B.; Carns, Philip

    2016-01-01

    Here, with the increasing complexity of today’s high-performance computing (HPC) architectures, simulation has become an indispensable tool for exploring the design space of HPC systems—in particular, networks. In order to make effective design decisions, simulations of these systems must possess the following properties: (1) have high accuracy and fidelity, (2) produce results in a timely manner, and (3) be able to analyze a broad range of network workloads. Most state-of-the-art HPC network simulation frameworks, however, are constrained in one or more of these areas. In this work, we present a simulation framework for modeling two important classes of networks used in today’s IBM and Cray supercomputers: torus and dragonfly networks. We use the Co-Design of Multi-layer Exascale Storage Architecture (CODES) simulation framework to simulate these network topologies at a flit-level detail using the Rensselaer Optimistic Simulation System (ROSS) for parallel discrete-event simulation. Our simulation framework meets all the requirements of a practical network simulation and can assist network designers in design space exploration. First, it uses validated and detailed flit-level network models to provide an accurate and high-fidelity network simulation. Second, instead of relying on serial time-stepped or traditional conservative discrete-event simulations that limit simulation scalability and efficiency, we use the optimistic event-scheduling capability of ROSS to achieve efficient and scalable HPC network simulations on today’s high-performance cluster systems. Third, our models give network designers a choice in simulating a broad range of network workloads, including HPC application workloads using detailed network traces, an ability that is rarely offered in parallel with high-fidelity network simulations

  5. Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes

    Science.gov (United States)

    Yang, Hui; Tang, Ming; Gross, Thilo

    2015-08-01

    One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

  6. Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes.

    Science.gov (United States)

    Yang, Hui; Tang, Ming; Gross, Thilo

    2015-08-21

    One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

  7. Modeling a Large Data Acquisition Network in a Simulation Framework

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00337030; The ATLAS collaboration; Froening, Holger; Garcia, Pedro Javier; Vandelli, Wainer

    2015-01-01

    The ATLAS detector at CERN records particle collision “events” delivered by the Large Hadron Collider. Its data-acquisition system is a distributed software system that identifies, selects, and stores interesting events in near real-time, with an aggregate throughput of several 10 GB/s. It is a distributed software system executed on a farm of roughly 2000 commodity worker nodes communicating via TCP/IP on an Ethernet network. Event data fragments are received from the many detector readout channels and are buffered, collected together, analyzed and either stored permanently or discarded. This system, and data-acquisition systems in general, are sensitive to the latency of the data transfer from the readout buffers to the worker nodes. Challenges affecting this transfer include the many-to-one communication pattern and the inherently bursty nature of the traffic. In this paper we introduce the main performance issues brought about by this workload, focusing in particular on the so-called TCP incast pathol...

  8. Composition and structure of a large online social network in The Netherlands.

    Directory of Open Access Journals (Sweden)

    Rense Corten

    Full Text Available Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization. The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  9. Composition and structure of a large online social network in The Netherlands.

    Science.gov (United States)

    Corten, Rense

    2012-01-01

    Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  10. A Holistic Management Architecture for Large-Scale Adaptive Networks

    National Research Council Canada - National Science Library

    Clement, Michael R

    2007-01-01

    This thesis extends the traditional notion of network management as an indicator of resource availability and utilization into a systemic model of resource requirements, capabilities, and adaptable...

  11. Hierarchical and Matrix Structures in a Large Organizational Email Network: Visualization and Modeling Approaches

    OpenAIRE

    Sims, Benjamin H.; Sinitsyn, Nikolai; Eidenbenz, Stephan J.

    2014-01-01

    This paper presents findings from a study of the email network of a large scientific research organization, focusing on methods for visualizing and modeling organizational hierarchies within large, complex network datasets. In the first part of the paper, we find that visualization and interpretation of complex organizational network data is facilitated by integration of network data with information on formal organizational divisions and levels. By aggregating and visualizing email traffic b...

  12. Wireless multi-hop networks with stealing : large buffer asymptotics

    NARCIS (Netherlands)

    Guillemin, F.; Knessl, C.; Leeuwaarden, van J.S.H.

    2010-01-01

    Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multi-hop networks is the hidden node problem that causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability p.

  13. Network Partitioning Domain Knowledge Multiobjective Application Mapping for Large-Scale Network-on-Chip

    Directory of Open Access Journals (Sweden)

    Yin Zhen Tei

    2014-01-01

    Full Text Available This paper proposes a multiobjective application mapping technique targeted for large-scale network-on-chip (NoC. As the number of intellectual property (IP cores in multiprocessor system-on-chip (MPSoC increases, NoC application mapping to find optimum core-to-topology mapping becomes more challenging. Besides, the conflicting cost and performance trade-off makes multiobjective application mapping techniques even more complex. This paper proposes an application mapping technique that incorporates domain knowledge into genetic algorithm (GA. The initial population of GA is initialized with network partitioning (NP while the crossover operator is guided with knowledge on communication demands. NP reduces the large-scale application mapping complexity and provides GA with a potential mapping search space. The proposed genetic operator is compared with state-of-the-art genetic operators in terms of solution quality. In this work, multiobjective optimization of energy and thermal-balance is considered. Through simulation, knowledge-based initial mapping shows significant improvement in Pareto front compared to random initial mapping that is widely used. The proposed knowledge-based crossover also shows better Pareto front compared to state-of-the-art knowledge-based crossover.

  14. Approximating spectral impact of structural perturbations in large networks

    CERN Document Server

    Milanese, A; Nishikawa, Takashi; Sun, Jie

    2010-01-01

    Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as synchronization and cascading processes on networks. Here we develop a theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network. We demonstrate the effectiveness of our approximation schemes using both real and artificial networks, showing in particular that we can accurately obtain the spectral ranking of small subgraphs. We also propose a local iterative scheme which computes the relative ranking of a subgraph using only the connectivity information of its neighbors within a few links. Our results may not only contribute to our theoretical understanding of dynamical processes on networks, but also lead to practical applications in ran...

  15. Explicit integration with GPU acceleration for large kinetic networks

    International Nuclear Information System (INIS)

    Brock, Benjamin; Belt, Andrew; Billings, Jay Jay; Guidry, Mike

    2015-01-01

    We demonstrate the first implementation of recently-developed fast explicit kinetic integration algorithms on modern graphics processing unit (GPU) accelerators. Taking as a generic test case a Type Ia supernova explosion with an extremely stiff thermonuclear network having 150 isotopic species and 1604 reactions coupled to hydrodynamics using operator splitting, we demonstrate the capability to solve of order 100 realistic kinetic networks in parallel in the same time that standard implicit methods can solve a single such network on a CPU. This orders-of-magnitude decrease in computation time for solving systems of realistic kinetic networks implies that important coupled, multiphysics problems in various scientific and technical fields that were intractable, or could be simulated only with highly schematic kinetic networks, are now computationally feasible.

  16. Clustering in large networks does not promote upstream reciprocity.

    Directory of Open Access Journals (Sweden)

    Naoki Masuda

    Full Text Available Upstream reciprocity (also called generalized reciprocity is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.

  17. Clustering in large networks does not promote upstream reciprocity.

    Science.gov (United States)

    Masuda, Naoki

    2011-01-01

    Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.

  18. Selective vulnerability related to aging in large-scale resting brain networks.

    Science.gov (United States)

    Zhang, Hong-Ying; Chen, Wen-Xin; Jiao, Yun; Xu, Yao; Zhang, Xiang-Rong; Wu, Jing-Tao

    2014-01-01

    Normal aging is associated with cognitive decline. Evidence indicates that large-scale brain networks are affected by aging; however, it has not been established whether aging has equivalent effects on specific large-scale networks. In the present study, 40 healthy subjects including 22 older (aged 60-80 years) and 18 younger (aged 22-33 years) adults underwent resting-state functional MRI scanning. Four canonical resting-state networks, including the default mode network (DMN), executive control network (ECN), dorsal attention network (DAN) and salience network, were extracted, and the functional connectivities in these canonical networks were compared between the younger and older groups. We found distinct, disruptive alterations present in the large-scale aging-related resting brain networks: the ECN was affected the most, followed by the DAN. However, the DMN and salience networks showed limited functional connectivity disruption. The visual network served as a control and was similarly preserved in both groups. Our findings suggest that the aged brain is characterized by selective vulnerability in large-scale brain networks. These results could help improve our understanding of the mechanism of degeneration in the aging brain. Additional work is warranted to determine whether selective alterations in the intrinsic networks are related to impairments in behavioral performance.

  19. Sleep overlap syndrome

    Directory of Open Access Journals (Sweden)

    Fariba Rezaeetalab

    2016-12-01

    Full Text Available Overlap syndrome, which is known as the coexistence of chronic obstructive pulmonary disease (COPD and obstructive sleep apnea (OSA, was first defined by Flenley. Although it can refer to concomitant occurrence of any of the pulmonary diseases and OSA, overlap syndrome is commonly considered as the coexistence of OSA and COPD. This disease has unique adverse health consequences distinct from either condition alone. Given the high prevalence of each solitary disease, overlap syndrome is also likely to be common and clinically relevant. Despite the fact that overlap syndrome has been described in the literature for nearly 30 years, paucity of evaluations and studies limited the discussion on diagnosis, prevalence, pathophysiology, treatment, and outcomes of this disease. This review article addresses these issues by reviewing several recent studies conducted in Iran or other countries. This review suggests that overlap syndrome has worse outcomes than either disease alone. Our findings accentuated the urgent need for further studies on overlap syndrome and all overlaps between OSA and chronic pulmonary disease to provide a deeper insight into diagnosis and non-invasive treatments of this disease.

  20. Range-Free Localization Schemes for Large Scale Sensor Networks

    National Research Council Canada - National Science Library

    He, Tian; Huang, Chengdu; Blum, Brain M; Stankovic, John A; Abdelzaher, Tarek

    2003-01-01

    .... Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches...

  1. Managing Virtual Networks on Large-Scale Projects

    National Research Council Canada - National Science Library

    Noll, David

    2006-01-01

    The complexity of Boeing's 787 Program is too great for the formal planned information and communication network structure to fully meet the needs of companies, managers, and employees located throughout the world...

  2. Environmental versatility promotes modularity in large scale metabolic networks

    OpenAIRE

    Samal A.; Wagner Andreas; Martin O.C.

    2011-01-01

    Abstract Background The ubiquity of modules in biological networks may result from an evolutionary benefit of a modular organization. For instance, modularity may increase the rate of adaptive evolution, because modules can be easily combined into new arrangements that may benefit their carrier. Conversely, modularity may emerge as a by-product of some trait. We here ask whether this last scenario may play a role in genome-scale metabolic networks that need to sustain life in one or more chem...

  3. Flash flood prediction in large dams using neural networks

    Science.gov (United States)

    Múnera Estrada, J. C.; García Bartual, R.

    2009-04-01

    A flow forecasting methodology is presented as a support tool for flood management in large dams. The practical and efficient use of hydrological real-time measurements is necessary to operate early warning systems for flood disasters prevention, either in natural catchments or in those regulated with reservoirs. In this latter case, the optimal dam operation during flood scenarios should reduce the downstream risks, and at the same time achieve a compromise between different goals: structural security, minimize predictions uncertainty and water resources system management objectives. Downstream constraints depend basically on the geomorphology of the valley, the critical flow thresholds for flooding, the land use and vulnerability associated with human settlements and their economic activities. A dam operation during a flood event thus requires appropriate strategies depending on the flood magnitude and the initial freeboard at the reservoir. The most important difficulty arises from the inherently stochastic character of peak rainfall intensities, their strong spatial and temporal variability, and the highly nonlinear response of semiarid catchments resulting from initial soil moisture condition and the dominant flow mechanisms. The practical integration of a flow prediction model in a real-time system should include combined techniques of pre-processing, data verification and completion, assimilation of information and implementation of real time filters depending on the system characteristics. This work explores the behaviour of real-time flood forecast algorithms based on artificial neural networks (ANN) techniques, in the River Meca catchment (Huelva, Spain), regulated by El Sancho dam. The dam is equipped with three Taintor gates of 12x6 meters. The hydrological data network includes five high-resolution automatic pluviometers (dt=10 min) and three high precision water level sensors in the reservoir. A cross correlation analysis between precipitation data

  4. Spatial dependencies between large-scale brain networks.

    Directory of Open Access Journals (Sweden)

    Robert Leech

    Full Text Available Functional neuroimaging reveals both increases (task-positive and decreases (task-negative in neural activation with many tasks. Many studies show a temporal relationship between task positive and task negative networks that is important for efficient cognitive functioning. Here we provide evidence for a spatial relationship between task positive and negative networks. There are strong spatial similarities between many reported task negative brain networks, termed the default mode network, which is typically assumed to be a spatially fixed network. However, this is not the case. The spatial structure of the DMN varies depending on what specific task is being performed. We test whether there is a fundamental spatial relationship between task positive and negative networks. Specifically, we hypothesize that the distance between task positive and negative voxels is consistent despite different spatial patterns of activation and deactivation evoked by different cognitive tasks. We show significantly reduced variability in the distance between within-condition task positive and task negative voxels than across-condition distances for four different sensory, motor and cognitive tasks--implying that deactivation patterns are spatially dependent on activation patterns (and vice versa, and that both are modulated by specific task demands. We also show a similar relationship between positively and negatively correlated networks from a third 'rest' dataset, in the absence of a specific task. We propose that this spatial relationship may be the macroscopic analogue of microscopic neuronal organization reported in sensory cortical systems, and that this organization may reflect homeostatic plasticity necessary for efficient brain function.

  5. Large-Scale Functional Brain Network Reorganization During Taoist Meditation.

    Science.gov (United States)

    Jao, Tun; Li, Chia-Wei; Vértes, Petra E; Wu, Changwei Wesley; Achard, Sophie; Hsieh, Chao-Hsien; Liou, Chien-Hui; Chen, Jyh-Horng; Bullmore, Edward T

    2016-02-01

    Meditation induces a distinct and reversible mental state that provides insights into brain correlates of consciousness. We explored brain network changes related to meditation by graph theoretical analysis of resting-state functional magnetic resonance imaging data. Eighteen Taoist meditators with varying levels of expertise were scanned using a within-subjects counterbalanced design during resting and meditation states. State-related differences in network topology were measured globally and at the level of individual nodes and edges. Although measures of global network topology, such as small-worldness, were unchanged, meditation was characterized by an extensive and expertise-dependent reorganization of the hubs (highly connected nodes) and edges (functional connections). Areas of sensory cortex, especially the bilateral primary visual and auditory cortices, and the bilateral temporopolar areas, which had the highest degree (or connectivity) during the resting state, showed the biggest decrease during meditation. Conversely, bilateral thalamus and components of the default mode network, mainly the bilateral precuneus and posterior cingulate cortex, had low degree in the resting state but increased degree during meditation. Additionally, these changes in nodal degree were accompanied by reorganization of anatomical orientation of the edges. During meditation, long-distance longitudinal (antero-posterior) edges increased proportionally, whereas orthogonal long-distance transverse (right-left) edges connecting bilaterally homologous cortices decreased. Our findings suggest that transient changes in consciousness associated with meditation introduce convergent changes in the topological and spatial properties of brain functional networks, and the anatomical pattern of integration might be as important as the global level of integration when considering the network basis for human consciousness.

  6. Spatial fingerprints of community structure in human interaction network for an extensive set of large-scale regions.

    Directory of Open Access Journals (Sweden)

    Zsófia Kallus

    Full Text Available Human interaction networks inferred from country-wide telephone activity recordings were recently used to redraw political maps by projecting their topological partitions into geographical space. The results showed remarkable spatial cohesiveness of the network communities and a significant overlap between the redrawn and the administrative borders. Here we present a similar analysis based on one of the most popular online social networks represented by the ties between more than 5.8 million of its geo-located users. The worldwide coverage of their measured activity allowed us to analyze the large-scale regional subgraphs of entire continents and an extensive set of examples for single countries. We present results for North and South America, Europe and Asia. In our analysis we used the well-established method of modularity clustering after an aggregation of the individual links into a weighted graph connecting equal-area geographical pixels. Our results show fingerprints of both of the opposing forces of dividing local conflicts and of uniting cross-cultural trends of globalization.

  7. Spatial fingerprints of community structure in human interaction network for an extensive set of large-scale regions.

    Science.gov (United States)

    Kallus, Zsófia; Barankai, Norbert; Szüle, János; Vattay, Gábor

    2015-01-01

    Human interaction networks inferred from country-wide telephone activity recordings were recently used to redraw political maps by projecting their topological partitions into geographical space. The results showed remarkable spatial cohesiveness of the network communities and a significant overlap between the redrawn and the administrative borders. Here we present a similar analysis based on one of the most popular online social networks represented by the ties between more than 5.8 million of its geo-located users. The worldwide coverage of their measured activity allowed us to analyze the large-scale regional subgraphs of entire continents and an extensive set of examples for single countries. We present results for North and South America, Europe and Asia. In our analysis we used the well-established method of modularity clustering after an aggregation of the individual links into a weighted graph connecting equal-area geographical pixels. Our results show fingerprints of both of the opposing forces of dividing local conflicts and of uniting cross-cultural trends of globalization.

  8. Multi-year expansion planning of large transmission networks

    Energy Technology Data Exchange (ETDEWEB)

    Binato, S; Oliveira, G C [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil)

    1994-12-31

    This paper describes a model for multi-year transmission network expansion to be used in long-term system planning. The network is represented by a linearized (DC) power flow and, for each year, operation costs are evaluated by a linear programming (LP) based algorithm that provides sensitivity indices for circuit reinforcements. A Backward/Forward approaches is proposed to devise an expansion plan over the study period. A case study with the southeastern Brazilian system is presented and discussed. (author) 18 refs., 5 figs., 1 tab.

  9. Default network modulation and large-scale network interactivity in healthy young and old adults.

    Science.gov (United States)

    Spreng, R Nathan; Schacter, Daniel L

    2012-11-01

    We investigated age-related changes in default, attention, and control network activity and their interactions in young and old adults. Brain activity during autobiographical and visuospatial planning was assessed using multivariate analysis and with intrinsic connectivity networks as regions of interest. In both groups, autobiographical planning engaged the default network while visuospatial planning engaged the attention network, consistent with a competition between the domains of internalized and externalized cognition. The control network was engaged for both planning tasks. In young subjects, the control network coupled with the default network during autobiographical planning and with the attention network during visuospatial planning. In old subjects, default-to-control network coupling was observed during both planning tasks, and old adults failed to deactivate the default network during visuospatial planning. This failure is not indicative of default network dysfunction per se, evidenced by default network engagement during autobiographical planning. Rather, a failure to modulate the default network in old adults is indicative of a lower degree of flexible network interactivity and reduced dynamic range of network modulation to changing task demands.

  10. Error rate degradation due to switch crosstalk in large modular switched optical networks

    DEFF Research Database (Denmark)

    Saxtoft, Christian; Chidgey, P.

    1993-01-01

    A theoretical model of an optical network incorporating wavelength selective elements, amplifiers, couplers and switches is presented. The model is used to evaluate a large modular switch optical network that provides the capability of adapting easily to changes in network traffic requirements. T....... The network dimensions are shown to be limited by the optical crosstalk in the switch matrices and by the polarization dependent loss in the optical components...

  11. The Design of a Large Scale Airline Network

    NARCIS (Netherlands)

    Carmona Benitez, R.B.

    2012-01-01

    Airlines invest a lot of money before opening new pax transportation services, for this reason, airlines have to analyze if their profits will overcome the amount of money they have to invest to open new services. The design and analysis of the feasibility of airlines networks can be done by using

  12. Reverse engineering large-scale genetic networks: synthetic versus

    Indian Academy of Sciences (India)

    Development of microarray technology has resulted in an exponential rise in gene expression data. Linear computational methods are of great assistance in identifying molecular interactions, and elucidating the functional properties of gene networks. It overcomes the weaknesses of in vivo experiments including high cost, ...

  13. Overlapping communities from dense disjoint and high total degree clusters

    Science.gov (United States)

    Zhang, Hongli; Gao, Yang; Zhang, Yue

    2018-04-01

    Community plays an important role in the field of sociology, biology and especially in domains of computer science, where systems are often represented as networks. And community detection is of great importance in the domains. A community is a dense subgraph of the whole graph with more links between its members than between its members to the outside nodes, and nodes in the same community probably share common properties or play similar roles in the graph. Communities overlap when nodes in a graph belong to multiple communities. A vast variety of overlapping community detection methods have been proposed in the literature, and the local expansion method is one of the most successful techniques dealing with large networks. The paper presents a density-based seeding method, in which dense disjoint local clusters are searched and selected as seeds. The proposed method selects a seed by the total degree and density of local clusters utilizing merely local structures of the network. Furthermore, this paper proposes a novel community refining phase via minimizing the conductance of each community, through which the quality of identified communities is largely improved in linear time. Experimental results in synthetic networks show that the proposed seeding method outperforms other seeding methods in the state of the art and the proposed refining method largely enhances the quality of the identified communities. Experimental results in real graphs with ground-truth communities show that the proposed approach outperforms other state of the art overlapping community detection algorithms, in particular, it is more than two orders of magnitude faster than the existing global algorithms with higher quality, and it obtains much more accurate community structure than the current local algorithms without any priori information.

  14. Illusion induced overlapped optics.

    Science.gov (United States)

    Zang, XiaoFei; Shi, Cheng; Li, Zhou; Chen, Lin; Cai, Bin; Zhu, YiMing; Zhu, HaiBin

    2014-01-13

    The traditional transformation-based cloak seems like it can only hide objects by bending the incident electromagnetic waves around the hidden region. In this paper, we prove that invisible cloaks can be applied to realize the overlapped optics. No matter how many in-phase point sources are located in the hidden region, all of them can overlap each other (this can be considered as illusion effect), leading to the perfect optical interference effect. In addition, a singular parameter-independent cloak is also designed to obtain quasi-overlapped optics. Even more amazing of overlapped optics is that if N identical separated in-phase point sources covered with the illusion media, the total power outside the transformation region is N2I0 (not NI0) (I0 is the power of just one point source, and N is the number point sources), which seems violating the law of conservation of energy. A theoretical model based on interference effect is proposed to interpret the total power of these two kinds of overlapped optics effects. Our investigation may have wide applications in high power coherent laser beams, and multiple laser diodes, and so on.

  15. Learning Traffic as Images: A Deep Convolutional Neural Network for Large-Scale Transportation Network Speed Prediction.

    Science.gov (United States)

    Ma, Xiaolei; Dai, Zhuang; He, Zhengbing; Ma, Jihui; Wang, Yong; Wang, Yunpeng

    2017-04-10

    This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks.

  16. Large-Scale Recurrent Neural Network Based Modelling of Gene Regulatory Network Using Cuckoo Search-Flower Pollination Algorithm.

    Science.gov (United States)

    Mandal, Sudip; Khan, Abhinandan; Saha, Goutam; Pal, Rajat K

    2016-01-01

    The accurate prediction of genetic networks using computational tools is one of the greatest challenges in the postgenomic era. Recurrent Neural Network is one of the most popular but simple approaches to model the network dynamics from time-series microarray data. To date, it has been successfully applied to computationally derive small-scale artificial and real-world genetic networks with high accuracy. However, they underperformed for large-scale genetic networks. Here, a new methodology has been proposed where a hybrid Cuckoo Search-Flower Pollination Algorithm has been implemented with Recurrent Neural Network. Cuckoo Search is used to search the best combination of regulators. Moreover, Flower Pollination Algorithm is applied to optimize the model parameters of the Recurrent Neural Network formalism. Initially, the proposed method is tested on a benchmark large-scale artificial network for both noiseless and noisy data. The results obtained show that the proposed methodology is capable of increasing the inference of correct regulations and decreasing false regulations to a high degree. Secondly, the proposed methodology has been validated against the real-world dataset of the DNA SOS repair network of Escherichia coli. However, the proposed method sacrifices computational time complexity in both cases due to the hybrid optimization process.

  17. Information Extraction from Large-Multi-Layer Social Networks

    Science.gov (United States)

    2015-08-06

    mization [4]. Methods that fall into this category include spec- tral algorithms, modularity methods, and methods that rely on statistical inference...Snijders and Chris Baerveldt, “A multilevel network study of the effects of delinquent behavior on friendship evolution,” Journal of mathematical sociol- ogy...1970. [10] Ulrike Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, no. 4, pp. 395–416, Dec. 2007. [11] R. A. Fisher, “On

  18. A wireless sensor network design and evaluation for large structural strain field monitoring

    International Nuclear Information System (INIS)

    Qiu, Zixue; Wu, Jian; Yuan, Shenfang

    2011-01-01

    Structural strain changes under external environmental or mechanical loads are the main monitoring parameters in structural health monitoring or mechanical property tests. This paper presents a wireless sensor network designed for monitoring large structural strain field variation. First of all, a precision strain sensor node is designed for multi-channel strain gauge signal conditioning and wireless monitoring. In order to establish a synchronous strain data acquisition network, the cluster-star network synchronization method is designed in detail. To verify the functionality of the designed wireless network for strain field monitoring capability, a multi-point network evaluation system is developed for an experimental aluminum plate structure for load variation monitoring. Based on the precision wireless strain nodes, the wireless data acquisition network is deployed to synchronously gather, process and transmit strain gauge signals and monitor results under concentrated loads. This paper shows the efficiency of the wireless sensor network for large structural strain field monitoring

  19. Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

    Energy Technology Data Exchange (ETDEWEB)

    Cree, Johnathan Vee [Washington State Univ., Pullman, WA (United States); Delgado-Frias, Jose [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

    2016-03-01

    Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.

  20. A Topology Visualization Early Warning Distribution Algorithm for Large-Scale Network Security Incidents

    Directory of Open Access Journals (Sweden)

    Hui He

    2013-01-01

    Full Text Available It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system’s emergency response capabilities, alleviate the cyber attacks’ damage, and strengthen the system’s counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system’s plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks’ topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.

  1. Evolution of the large Deep Space Network antennas

    Science.gov (United States)

    Imbriale, William A.

    1991-12-01

    The evolution of the largest antenna of the US NASA Deep Space Network (DSN) is described. The design, performance analysis, and measurement techniques, beginning with its initial 64-m operation at S-band (2295 MHz) in 1966 and continuing through the present ka-band (32-GHz) operation at 70 m, is described. Although their diameters and mountings differ, these parabolic antennas all employ a Cassegrainian feed system, and each antenna dish surface is constructed of precision-shaped perforated-aluminum panels that are secured to an open steel framework

  2. Genomic profiling of plasmablastic lymphoma using array comparative genomic hybridization (aCGH: revealing significant overlapping genomic lesions with diffuse large B-cell lymphoma

    Directory of Open Access Journals (Sweden)

    Lu Xin-Yan

    2009-11-01

    Full Text Available Abstract Background Plasmablastic lymphoma (PL is a subtype of diffuse large B-cell lymphoma (DLBCL. Studies have suggested that tumors with PL morphology represent a group of neoplasms with clinopathologic characteristics corresponding to different entities including extramedullary plasmablastic tumors associated with plasma cell myeloma (PCM. The goal of the current study was to evaluate the genetic similarities and differences among PL, DLBCL (AIDS-related and non AIDS-related and PCM using array-based comparative genomic hybridization. Results Examination of genomic data in PL revealed that the most frequent segmental gain (> 40% include: 1p36.11-1p36.33, 1p34.1-1p36.13, 1q21.1-1q23.1, 7q11.2-7q11.23, 11q12-11q13.2 and 22q12.2-22q13.3. This correlated with segmental gains occurring in high frequency in DLBCL (AIDS-related and non AIDS-related cases. There were some segmental gains and some segmental loss that occurred in PL but not in the other types of lymphoma suggesting that these foci may contain genes responsible for the differentiation of this lymphoma. Additionally, some segmental gains and some segmental loss occurred only in PL and AIDS associated DLBCL suggesting that these foci may be associated with HIV infection. Furthermore, some segmental gains and some segmental loss occurred only in PL and PCM suggesting that these lesions may be related to plasmacytic differentiation. Conclusion To the best of our knowledge, the current study represents the first genomic exploration of PL. The genomic aberration pattern of PL appears to be more similar to that of DLBCL (AIDS-related or non AIDS-related than to PCM. Our findings suggest that PL may remain best classified as a subtype of DLBCL at least at the genome level.

  3. Thermodynamically based constraints for rate coefficients of large biochemical networks.

    Science.gov (United States)

    Vlad, Marcel O; Ross, John

    2009-01-01

    Wegscheider cyclicity conditions are relationships among the rate coefficients of a complex reaction network, which ensure the compatibility of kinetic equations with the conditions for thermodynamic equilibrium. The detailed balance at equilibrium, that is the equilibration of forward and backward rates for each elementary reaction, leads to compatibility between the conditions of kinetic and thermodynamic equilibrium. Therefore, Wegscheider cyclicity conditions can be derived by eliminating the equilibrium concentrations from the conditions of detailed balance. We develop matrix algebra tools needed to carry out this elimination, reexamine an old derivation of the general form of Wegscheider cyclicity condition, and develop new derivations which lead to more compact and easier-to-use formulas. We derive scaling laws for the nonequilibrium rates of a complex reaction network, which include Wegscheider conditions as a particular case. The scaling laws for the rates are used for clarifying the kinetic and thermodynamic meaning of Wegscheider cyclicity conditions. Finally, we discuss different ways of using Wegscheider cyclicity conditions for kinetic computations in systems biology.

  4. Auditing Complex Concepts in Overlapping Subsets of SNOMED

    Science.gov (United States)

    Wang, Yue; Wei, Duo; Xu, Junchuan; Elhanan, Gai; Perl, Yehoshua; Halper, Michael; Chen, Yan; Spackman, Kent A.; Hripcsak, George

    2008-01-01

    Limited resources and the sheer volume of concepts make auditing a large terminology, such as SNOMED CT, a daunting task. It is essential to devise techniques that can aid an auditor by automatically identifying concepts that deserve attention. A methodology for this purpose based on a previously introduced abstraction network (called the p-area taxonomy) for a SNOMED CT hierarchy is presented. The methodology algorithmically gathers concepts appearing in certain overlapping subsets, defined exclusively with respect to the p-area taxonomy, for review. The results of applying the methodology to SNOMED’s Specimen hierarchy are presented. These results are compared against a control sample composed of concepts residing in subsets without the overlaps. With the use of the double bootstrap, the concept group produced by our methodology is shown to yield a statistically significant higher proportion of error discoveries. PMID:18998838

  5. Identifying demand effects in a large network of product categories

    NARCIS (Netherlands)

    Gelper, S.E.C.; Wilms, I.; Croux, C.

    2016-01-01

    Planning marketing mix strategies requires retailers to understand within- as well as cross-category demand effects. Most retailers carry products in a large variety of categories, leading to a high number of such demand effects to be estimated. At the same time, we do not expect cross-category

  6. Risk-based optimization of pipe inspections in large underground networks with imprecise information

    International Nuclear Information System (INIS)

    Mancuso, A.; Compare, M.; Salo, A.; Zio, E.; Laakso, T.

    2016-01-01

    In this paper, we present a novel risk-based methodology for optimizing the inspections of large underground infrastructure networks in the presence of incomplete information about the network features and parameters. The methodology employs Multi Attribute Value Theory to assess the risk of each pipe in the network, whereafter the optimal inspection campaign is built with Portfolio Decision Analysis (PDA). Specifically, Robust Portfolio Modeling (RPM) is employed to identify Pareto-optimal portfolios of pipe inspections. The proposed methodology is illustrated by reporting a real case study on the large-scale maintenance optimization of the sewerage network in Espoo, Finland. - Highlights: • Risk-based approach to optimize pipe inspections on large underground networks. • Reasonable computational effort to select efficient inspection portfolios. • Possibility to accommodate imprecise expert information. • Feasibility of the approach shown by Espoo water system case study.

  7. Integrating large-scale functional genomics data to dissect metabolic networks for hydrogen production

    Energy Technology Data Exchange (ETDEWEB)

    Harwood, Caroline S

    2012-12-17

    The goal of this project is to identify gene networks that are critical for efficient biohydrogen production by leveraging variation in gene content and gene expression in independently isolated Rhodopseudomonas palustris strains. Coexpression methods were applied to large data sets that we have collected to define probabilistic causal gene networks. To our knowledge this a first systems level approach that takes advantage of strain-to strain variability to computationally define networks critical for a particular bacterial phenotypic trait.

  8. Unified Tractable Model for Large-Scale Networks Using Stochastic Geometry: Analysis and Design

    KAUST Repository

    Afify, Laila H.

    2016-12-01

    The ever-growing demands for wireless technologies necessitate the evolution of next generation wireless networks that fulfill the diverse wireless users requirements. However, upscaling existing wireless networks implies upscaling an intrinsic component in the wireless domain; the aggregate network interference. Being the main performance limiting factor, it becomes crucial to develop a rigorous analytical framework to accurately characterize the out-of-cell interference, to reap the benefits of emerging networks. Due to the different network setups and key performance indicators, it is essential to conduct a comprehensive study that unifies the various network configurations together with the different tangible performance metrics. In that regard, the focus of this thesis is to present a unified mathematical paradigm, based on Stochastic Geometry, for large-scale networks with different antenna/network configurations. By exploiting such a unified study, we propose an efficient automated network design strategy to satisfy the desired network objectives. First, this thesis studies the exact aggregate network interference characterization, by accounting for each of the interferers signals in the large-scale network. Second, we show that the information about the interferers symbols can be approximated via the Gaussian signaling approach. The developed mathematical model presents twofold analysis unification for uplink and downlink cellular networks literature. It aligns the tangible decoding error probability analysis with the abstract outage probability and ergodic rate analysis. Furthermore, it unifies the analysis for different antenna configurations, i.e., various multiple-input multiple-output (MIMO) systems. Accordingly, we propose a novel reliable network design strategy that is capable of appropriately adjusting the network parameters to meet desired design criteria. In addition, we discuss the diversity-multiplexing tradeoffs imposed by differently favored

  9. Integration and segregation of large-scale brain networks during short-term task automatization.

    Science.gov (United States)

    Mohr, Holger; Wolfensteller, Uta; Betzel, Richard F; Mišić, Bratislav; Sporns, Olaf; Richiardi, Jonas; Ruge, Hannes

    2016-11-03

    The human brain is organized into large-scale functional networks that can flexibly reconfigure their connectivity patterns, supporting both rapid adaptive control and long-term learning processes. However, it has remained unclear how short-term network dynamics support the rapid transformation of instructions into fluent behaviour. Comparing fMRI data of a learning sample (N=70) with a control sample (N=67), we find that increasingly efficient task processing during short-term practice is associated with a reorganization of large-scale network interactions. Practice-related efficiency gains are facilitated by enhanced coupling between the cingulo-opercular network and the dorsal attention network. Simultaneously, short-term task automatization is accompanied by decreasing activation of the fronto-parietal network, indicating a release of high-level cognitive control, and a segregation of the default mode network from task-related networks. These findings suggest that short-term task automatization is enabled by the brain's ability to rapidly reconfigure its large-scale network organization involving complementary integration and segregation processes.

  10. A comparative analysis of the statistical properties of large mobile phone calling networks.

    Science.gov (United States)

    Li, Ming-Xia; Jiang, Zhi-Qiang; Xie, Wen-Jie; Miccichè, Salvatore; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N

    2014-05-30

    Mobile phone calling is one of the most widely used communication methods in modern society. The records of calls among mobile phone users provide us a valuable proxy for the understanding of human communication patterns embedded in social networks. Mobile phone users call each other forming a directed calling network. If only reciprocal calls are considered, we obtain an undirected mutual calling network. The preferential communication behavior between two connected users can be statistically tested and it results in two Bonferroni networks with statistically validated edges. We perform a comparative analysis of the statistical properties of these four networks, which are constructed from the calling records of more than nine million individuals in Shanghai over a period of 110 days. We find that these networks share many common structural properties and also exhibit idiosyncratic features when compared with previously studied large mobile calling networks. The empirical findings provide us an intriguing picture of a representative large social network that might shed new lights on the modelling of large social networks.

  11. Output regulation of large-scale hydraulic networks with minimal steady state power consumption

    NARCIS (Netherlands)

    Jensen, Tom Nørgaard; Wisniewski, Rafał; De Persis, Claudio; Kallesøe, Carsten Skovmose

    2014-01-01

    An industrial case study involving a large-scale hydraulic network is examined. The hydraulic network underlies a district heating system, with an arbitrary number of end-users. The problem of output regulation is addressed along with a optimization criterion for the control. The fact that the

  12. 77 FR 58416 - Large Scale Networking (LSN); Middleware and Grid Interagency Coordination (MAGIC) Team

    Science.gov (United States)

    2012-09-20

    ..., Grid, and cloud projects. The MAGIC Team reports to the Large Scale Networking (LSN) Coordinating Group... Coordination (MAGIC) Team AGENCY: The Networking and Information Technology Research and Development (NITRD.... Dates/Location: The MAGIC Team meetings are held on the first Wednesday of each month, 2:00-4:00pm, at...

  13. 78 FR 70076 - Large Scale Networking (LSN)-Middleware and Grid Interagency Coordination (MAGIC) Team

    Science.gov (United States)

    2013-11-22

    ... projects. The MAGIC Team reports to the Large Scale Networking (LSN) Coordinating Group (CG). Public... Coordination (MAGIC) Team AGENCY: The Networking and Information Technology Research and Development (NITRD... MAGIC Team meetings are held on the first Wednesday of each month, 2:00-4:00 p.m., at the National...

  14. A Logically Centralized Approach for Control and Management of Large Computer Networks

    Science.gov (United States)

    Iqbal, Hammad A.

    2012-01-01

    Management of large enterprise and Internet service provider networks is a complex, error-prone, and costly challenge. It is widely accepted that the key contributors to this complexity are the bundling of control and data forwarding in traditional routers and the use of fully distributed protocols for network control. To address these…

  15. Direction of information flow in large-scale resting-state networks is frequency-dependent

    NARCIS (Netherlands)

    Hillebrand, Arjan; Tewarie, Prejaas; Van Dellen, Edwin; Yu, Meichen; Carbo, Ellen W S; Douw, Linda; Gouw, Alida A.; Van Straaten, Elisabeth C W; Stam, Cornelis J.

    2016-01-01

    Normal brain function requires interactions between spatially separated, and functionally specialized, macroscopic regions, yet the directionality of these interactions in large-scale functional networks is unknown. Magnetoencephalography was used to determine the directionality of these

  16. Large photonic band gaps and strong attenuations of two-segment-connected Peano derivative networks

    International Nuclear Information System (INIS)

    Lu, Jian; Yang, Xiangbo; Zhang, Guogang; Cai, Lianzhang

    2011-01-01

    In this Letter, based on ancient Peano curves we construct four kinds of interesting Peano derivative networks composed of one-dimensional (1D) waveguides and investigate the optical transmission spectra and photonic attenuation behavior of electromagnetic (EM) waves in one- and two-segment-connected networks. It is found that for some two-segment-connected networks large photonic band gaps (PBGs) can be created and the widths of large PBGs can be controlled by adjusting the matching ratio of waveguide length and are insensitive to generation number. Diamond- and hexagon-Peano networks are good selectable structures for the designing of optical devices with large PBG(s) and strong attenuation(s). -- Highlights: → Peano and Peano derivative networks composed of 1D waveguides are designed. → Large PBGs with strong attenuations have been created by these fractal networks. → New approach for designing optical devices with large PBGs is proposed. → Diamond- and hexagon-Peano networks with d2:d1=2:1 are good selectable structures.

  17. Density Estimation and Anomaly Detection in Large Social Networks

    Science.gov (United States)

    2014-07-15

    Time of Single Trial DMD MD (a) Loss curves for proposed dynamic mirror de - scent (DMD) method and mirror descent (MD) against time for a single...curves for DMD and MD against time over 100 trials. Figure 2.2: Simulation results for the experiment in Section 2.4.1. The vertical dashed lines indicate ...landscape, 2012. http: //strata.oreilly.com/2012/01/what-is-big-data.html. [24] A. Gyorgy, T. Linder , and G. Lugosi. Efficient tracking of large classes

  18. Research on Fault Prediction of Distribution Network Based on Large Data

    Directory of Open Access Journals (Sweden)

    Jinglong Zhou

    2017-01-01

    Full Text Available With the continuous development of information technology and the improvement of distribution automation level. Especially, the amount of on-line monitoring and statistical data is increasing, and large data is used data distribution system, describes the technology to collect, data analysis and data processing of the data distribution system. The artificial neural network mining algorithm and the large data are researched in the fault diagnosis and prediction of the distribution network.

  19. The key network communication technology in large radiation image cooperative process system

    International Nuclear Information System (INIS)

    Li Zheng; Kang Kejun; Gao Wenhuan; Wang Jingjin

    1998-01-01

    Large container inspection system (LCIS) based on radiation imaging technology is a powerful tool for the customs to check the contents inside a large container without opening it. An image distributed network system is composed of operation manager station, image acquisition station, environment control station, inspection processing station, check-in station, check-out station, database station by using advanced network technology. Mass data, such as container image data, container general information, manifest scanning data, commands and status, must be on-line transferred between different stations. Advanced network communication technology is presented

  20. Application and study of advanced network technology in large container inspection system

    International Nuclear Information System (INIS)

    Li Zheng; Kang Kejun; Gao Wenhuan; Wang Jingjin

    1996-01-01

    Large Container Inspection System (LCIS) based on radiation imaging technology is a powerful tool for the customs to check the contents inside a large container without opening it. An image distributed network system is composed of center manager station, image acquisition station, environment control station, inspection processing station, check-in station, check-out station, database station by using advanced network technology. Mass data, such as container image data, container general information, manifest scanning data, commands and status, must be on-line transferred between different stations. Advanced network technology and software programming technique are presented

  1. A Unified Network Security Architecture for Large, Distributed Networks, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — In typical, multi-organizational networking environments, it is difficult to define and maintain a uniform authentication scheme that provides users with easy access...

  2. Networking for large-scale science: infrastructure, provisioning, transport and application mapping

    International Nuclear Information System (INIS)

    Rao, Nageswara S; Carter, Steven M; Wu Qishi; Wing, William R; Zhu Mengxia; Mezzacappa, Anthony; Veeraraghavan, Malathi; Blondin, John M

    2005-01-01

    Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts

  3. Networking for large-scale science: infrastructure, provisioning, transport and application mapping

    Energy Technology Data Exchange (ETDEWEB)

    Rao, Nageswara S [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Carter, Steven M [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Wu Qishi [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Wing, William R [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Zhu Mengxia [Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803 (United States); Mezzacappa, Anthony [Physics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Veeraraghavan, Malathi [Department of Computer Science, University of Virginia, Charlottesville, VA 22904 (United States); Blondin, John M [Department of Physics, North Carolina State University, Raleigh, NC 27695 (United States)

    2005-01-01

    Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts.

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

    Directory of Open Access Journals (Sweden)

    Martin Rosvall

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

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

    Science.gov (United States)

    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.

  6. Maximal planar networks with large clustering coefficient and power-law degree distribution

    International Nuclear Information System (INIS)

    Zhou Tao; Yan Gang; Wang Binghong

    2005-01-01

    In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called random Apollonian networks (RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic results of power-law exponent γ=3 and clustering coefficient C=(46/3)-36 ln (3/2)≅0.74, which agree with the simulation results very well. We prove that the increasing tendency of average distance of RANs is a little slower than the logarithm of the number of nodes in RANs. Since most real-life networks are both scale-free and small-world networks, RANs may perform well in mimicking the reality. The RANs possess hierarchical structure as C(k)∼k -1 that are in accord with the observations of many real-life networks. In addition, we prove that RANs are maximal planar networks, which are of particular practicability for layout of printed circuits and so on. The percolation and epidemic spreading process are also studied and the comparisons between RANs and Barabasi-Albert (BA) as well as Newman-Watts (NW) networks are shown. We find that, when the network order N (the total number of nodes) is relatively small (as N∼10 4 ), the performance of RANs under intentional attack is not sensitive to N, while that of BA networks is much affected by N. And the diseases spread slower in RANs than BA networks in the early stage of the suseptible-infected process, indicating that the large clustering coefficient may slow the spreading velocity, especially in the outbreaks

  7. A visual analytics system for optimizing the performance of large-scale networks in supercomputing systems

    Directory of Open Access Journals (Sweden)

    Takanori Fujiwara

    2018-03-01

    Full Text Available The overall efficiency of an extreme-scale supercomputer largely relies on the performance of its network interconnects. Several of the state of the art supercomputers use networks based on the increasingly popular Dragonfly topology. It is crucial to study the behavior and performance of different parallel applications running on Dragonfly networks in order to make optimal system configurations and design choices, such as job scheduling and routing strategies. However, in order to study these temporal network behavior, we would need a tool to analyze and correlate numerous sets of multivariate time-series data collected from the Dragonfly’s multi-level hierarchies. This paper presents such a tool–a visual analytics system–that uses the Dragonfly network to investigate the temporal behavior and optimize the communication performance of a supercomputer. We coupled interactive visualization with time-series analysis methods to help reveal hidden patterns in the network behavior with respect to different parallel applications and system configurations. Our system also provides multiple coordinated views for connecting behaviors observed at different levels of the network hierarchies, which effectively helps visual analysis tasks. We demonstrate the effectiveness of the system with a set of case studies. Our system and findings can not only help improve the communication performance of supercomputing applications, but also the network performance of next-generation supercomputers. Keywords: Supercomputing, Parallel communication network, Dragonfly networks, Time-series data, Performance analysis, Visual analytics

  8. Prediction of peak overlap in NMR spectra

    International Nuclear Information System (INIS)

    Hefke, Frederik; Schmucki, Roland; Güntert, Peter

    2013-01-01

    Peak overlap is one of the major factors complicating the analysis of biomolecular NMR spectra. We present a general method for predicting the extent of peak overlap in multidimensional NMR spectra and its validation using both, experimental data sets and Monte Carlo simulation. The method is based on knowledge of the magnetization transfer pathways of the NMR experiments and chemical shift statistics from the Biological Magnetic Resonance Data Bank. Assuming a normal distribution with characteristic mean value and standard deviation for the chemical shift of each observable atom, an analytic expression was derived for the expected overlap probability of the cross peaks. The analytical approach was verified to agree with the average peak overlap in a large number of individual peak lists simulated using the same chemical shift statistics. The method was applied to eight proteins, including an intrinsically disordered one, for which the prediction results could be compared with the actual overlap based on the experimentally measured chemical shifts. The extent of overlap predicted using only statistical chemical shift information was in good agreement with the overlap that was observed when the measured shifts were used in the virtual spectrum, except for the intrinsically disordered protein. Since the spectral complexity of a protein NMR spectrum is a crucial factor for protein structure determination, analytical overlap prediction can be used to identify potentially difficult proteins before conducting NMR experiments. Overlap predictions can be tailored to particular classes of proteins by preparing statistics from corresponding protein databases. The method is also suitable for optimizing recording parameters and labeling schemes for NMR experiments and improving the reliability of automated spectra analysis and protein structure determination.

  9. Generation of non-overlapping fiber architecture

    DEFF Research Database (Denmark)

    Chapelle, Lucie; Lévesque, M.; Brøndsted, Povl

    2015-01-01

    and polymer networks. The model takes into account the complex geometry of the fiber arrangement in which a fiber can be modeled with a certain degree of bending while keeping a main fiber orientation. The model is built in two steps. First, fibers are generated as a chain of overlapping spheres or as a chain......: a repulsion force to suppress the overlap between two fibers and a bending and stretching force to ensure that the fiber structure is kept unchanged. The model can be used as the geometrical basis for further finite-element modelling....

  10. Large-Scale Brain Networks Supporting Divided Attention across Spatial Locations and Sensory Modalities.

    Science.gov (United States)

    Santangelo, Valerio

    2018-01-01

    Higher-order cognitive processes were shown to rely on the interplay between large-scale neural networks. However, brain networks involved with the capability to split attentional resource over multiple spatial locations and multiple stimuli or sensory modalities have been largely unexplored to date. Here I re-analyzed data from Santangelo et al. (2010) to explore the causal interactions between large-scale brain networks during divided attention. During fMRI scanning, participants monitored streams of visual and/or auditory stimuli in one or two spatial locations for detection of occasional targets. This design allowed comparing a condition in which participants monitored one stimulus/modality (either visual or auditory) in two spatial locations vs. a condition in which participants monitored two stimuli/modalities (both visual and auditory) in one spatial location. The analysis of the independent components (ICs) revealed that dividing attentional resources across two spatial locations necessitated a brain network involving the left ventro- and dorso-lateral prefrontal cortex plus the posterior parietal cortex, including the intraparietal sulcus (IPS) and the angular gyrus, bilaterally. The analysis of Granger causality highlighted that the activity of lateral prefrontal regions were predictive of the activity of all of the posteriors parietal nodes. By contrast, dividing attention across two sensory modalities necessitated a brain network including nodes belonging to the dorsal frontoparietal network, i.e., the bilateral frontal eye-fields (FEF) and IPS, plus nodes belonging to the salience network, i.e., the anterior cingulated cortex and the left and right anterior insular cortex (aIC). The analysis of Granger causality highlights a tight interdependence between the dorsal frontoparietal and salience nodes in trials requiring divided attention between different sensory modalities. The current findings therefore highlighted a dissociation among brain networks

  11. Large-Scale Brain Networks Supporting Divided Attention across Spatial Locations and Sensory Modalities

    Directory of Open Access Journals (Sweden)

    Valerio Santangelo

    2018-02-01

    Full Text Available Higher-order cognitive processes were shown to rely on the interplay between large-scale neural networks. However, brain networks involved with the capability to split attentional resource over multiple spatial locations and multiple stimuli or sensory modalities have been largely unexplored to date. Here I re-analyzed data from Santangelo et al. (2010 to explore the causal interactions between large-scale brain networks during divided attention. During fMRI scanning, participants monitored streams of visual and/or auditory stimuli in one or two spatial locations for detection of occasional targets. This design allowed comparing a condition in which participants monitored one stimulus/modality (either visual or auditory in two spatial locations vs. a condition in which participants monitored two stimuli/modalities (both visual and auditory in one spatial location. The analysis of the independent components (ICs revealed that dividing attentional resources across two spatial locations necessitated a brain network involving the left ventro- and dorso-lateral prefrontal cortex plus the posterior parietal cortex, including the intraparietal sulcus (IPS and the angular gyrus, bilaterally. The analysis of Granger causality highlighted that the activity of lateral prefrontal regions were predictive of the activity of all of the posteriors parietal nodes. By contrast, dividing attention across two sensory modalities necessitated a brain network including nodes belonging to the dorsal frontoparietal network, i.e., the bilateral frontal eye-fields (FEF and IPS, plus nodes belonging to the salience network, i.e., the anterior cingulated cortex and the left and right anterior insular cortex (aIC. The analysis of Granger causality highlights a tight interdependence between the dorsal frontoparietal and salience nodes in trials requiring divided attention between different sensory modalities. The current findings therefore highlighted a dissociation among

  12. Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks.

    Science.gov (United States)

    Lee, Seungseob; Lee, SuKyoung; Kim, Kyungsoo; Kim, Yoon Hyuk

    2015-01-01

    Data traffic demands in cellular networks today are increasing at an exponential rate, giving rise to the development of heterogeneous networks (HetNets), in which small cells complement traditional macro cells by extending coverage to indoor areas. However, the deployment of small cells as parts of HetNets creates a key challenge for operators' careful network planning. In particular, massive and unplanned deployment of base stations can cause high interference, resulting in highly degrading network performance. Although different mathematical modeling and optimization methods have been used to approach various problems related to this issue, most traditional network planning models are ill-equipped to deal with HetNet-specific characteristics due to their focus on classical cellular network designs. Furthermore, increased wireless data demands have driven mobile operators to roll out large-scale networks of small long term evolution (LTE) cells. Therefore, in this paper, we aim to derive an optimum network planning algorithm for large-scale LTE HetNets. Recently, attempts have been made to apply evolutionary algorithms (EAs) to the field of radio network planning, since they are characterized as global optimization methods. Yet, EA performance often deteriorates rapidly with the growth of search space dimensionality. To overcome this limitation when designing optimum network deployments for large-scale LTE HetNets, we attempt to decompose the problem and tackle its subcomponents individually. Particularly noting that some HetNet cells have strong correlations due to inter-cell interference, we propose a correlation grouping approach in which cells are grouped together according to their mutual interference. Both the simulation and analytical results indicate that the proposed solution outperforms the random-grouping based EA as well as an EA that detects interacting variables by monitoring the changes in the objective function algorithm in terms of system

  13. Large-scale functional networks connect differently for processing words and symbol strings.

    Science.gov (United States)

    Liljeström, Mia; Vartiainen, Johanna; Kujala, Jan; Salmelin, Riitta

    2018-01-01

    Reconfigurations of synchronized large-scale networks are thought to be central neural mechanisms that support cognition and behavior in the human brain. Magnetoencephalography (MEG) recordings together with recent advances in network analysis now allow for sub-second snapshots of such networks. In the present study, we compared frequency-resolved functional connectivity patterns underlying reading of single words and visual recognition of symbol strings. Word reading emphasized coherence in a left-lateralized network with nodes in classical perisylvian language regions, whereas symbol processing recruited a bilateral network, including connections between frontal and parietal regions previously associated with spatial attention and visual working memory. Our results illustrate the flexible nature of functional networks, whereby processing of different form categories, written words vs. symbol strings, leads to the formation of large-scale functional networks that operate at distinct oscillatory frequencies and incorporate task-relevant regions. These results suggest that category-specific processing should be viewed not so much as a local process but as a distributed neural process implemented in signature networks. For words, increased coherence was detected particularly in the alpha (8-13 Hz) and high gamma (60-90 Hz) frequency bands, whereas increased coherence for symbol strings was observed in the high beta (21-29 Hz) and low gamma (30-45 Hz) frequency range. These findings attest to the role of coherence in specific frequency bands as a general mechanism for integrating stimulus-dependent information across brain regions.

  14. Expectation propagation for large scale Bayesian inference of non-linear molecular networks from perturbation data.

    Science.gov (United States)

    Narimani, Zahra; Beigy, Hamid; Ahmad, Ashar; Masoudi-Nejad, Ali; Fröhlich, Holger

    2017-01-01

    Inferring the structure of molecular networks from time series protein or gene expression data provides valuable information about the complex biological processes of the cell. Causal network structure inference has been approached using different methods in the past. Most causal network inference techniques, such as Dynamic Bayesian Networks and ordinary differential equations, are limited by their computational complexity and thus make large scale inference infeasible. This is specifically true if a Bayesian framework is applied in order to deal with the unavoidable uncertainty about the correct model. We devise a novel Bayesian network reverse engineering approach using ordinary differential equations with the ability to include non-linearity. Besides modeling arbitrary, possibly combinatorial and time dependent perturbations with unknown targets, one of our main contributions is the use of Expectation Propagation, an algorithm for approximate Bayesian inference over large scale network structures in short computation time. We further explore the possibility of integrating prior knowledge into network inference. We evaluate the proposed model on DREAM4 and DREAM8 data and find it competitive against several state-of-the-art existing network inference methods.

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

    Science.gov (United States)

    Diwadkar, Amit; Vaidya, Umesh

    2016-01-01

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

  16. Localization Algorithm Based on a Spring Model (LASM for Large Scale Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shuai Li

    2008-03-01

    Full Text Available A navigation method for a lunar rover based on large scale wireless sensornetworks is proposed. To obtain high navigation accuracy and large exploration area, highnode localization accuracy and large network scale are required. However, thecomputational and communication complexity and time consumption are greatly increasedwith the increase of the network scales. A localization algorithm based on a spring model(LASM method is proposed to reduce the computational complexity, while maintainingthe localization accuracy in large scale sensor networks. The algorithm simulates thedynamics of physical spring system to estimate the positions of nodes. The sensor nodesare set as particles with masses and connected with neighbor nodes by virtual springs. Thevirtual springs will force the particles move to the original positions, the node positionscorrespondingly, from the randomly set positions. Therefore, a blind node position can bedetermined from the LASM algorithm by calculating the related forces with the neighbornodes. The computational and communication complexity are O(1 for each node, since thenumber of the neighbor nodes does not increase proportionally with the network scale size.Three patches are proposed to avoid local optimization, kick out bad nodes and deal withnode variation. Simulation results show that the computational and communicationcomplexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps arealmost unrelated with the network scale size.

  17. Network Dynamics: Modeling And Generation Of Very Large Heterogeneous Social Networks

    Science.gov (United States)

    2015-11-23

    P11035 (2014). [19] P. L. Krapivsky and S. Redner, Phys. Rev. E. 71, 036118 (2005). [20] M. O. Jackson and B. W. Rogers, Amer. Econ . Rev. 97, 890...P06004 (2010). [24] M. E. J. Newman, Networks: An Introduction (Oxford Univ. Press, Oxford, 2010). [25] P. J. Flory, Principles of Polymer Chemistry

  18. Detecting highly overlapping community structure by greedy clique expansion

    OpenAIRE

    Lee, Conrad; Reid, Fergal; McDaid, Aaron; Hurley, Neil

    2010-01-01

    In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure. Recent advances in benchmarking indicate that existing community assignment algorithms that are capable of detecting overlapping communities perform well only when the extent of community overlap is kept to modest levels. To overcome this limitation, we introduce a new community assignment algorithm called Greedy Clique Expansion (GCE). The algorithm identifies d...

  19. Complexity analysis on public transport networks of 97 large- and medium-sized cities in China

    Science.gov (United States)

    Tian, Zhanwei; Zhang, Zhuo; Wang, Hongfei; Ma, Li

    2018-04-01

    The traffic situation in Chinese urban areas is continuing to deteriorate. To make a better planning and designing of the public transport system, it is necessary to make profound research on the structure of urban public transport networks (PTNs). We investigate 97 large- and medium-sized cities’ PTNs in China, construct three types of network models — bus stop network, bus transit network and bus line network, then analyze the structural characteristics of them. It is revealed that bus stop network is small-world and scale-free, bus transit network and bus line network are both small-world. Betweenness centrality of each city’s PTN shows similar distribution pattern, although these networks’ size is various. When classifying cities according to the characteristics of PTNs or economic development level, the results are similar. It means that the development of cities’ economy and transport network has a strong correlation, PTN expands in a certain model with the development of economy.

  20. An energy-efficient data gathering protocol in large wireless sensor network

    Science.gov (United States)

    Wang, Yamin; Zhang, Ruihua; Tao, Shizhong

    2006-11-01

    Wireless sensor network consisting of a large number of small sensors with low-power transceiver can be an effective tool for gathering data in a variety of environment. The collected data must be transmitted to the base station for further processing. Since a network consists of sensors with limited battery energy, the method for data gathering and routing must be energy efficient in order to prolong the lifetime of the network. In this paper, we presented an energy-efficient data gathering protocol in wireless sensor network. The new protocol used data fusion technology clusters nodes into groups and builds a chain among the cluster heads according to a hybrid of the residual energy and distance to the base station. Results in stochastic geometry are used to derive the optimum parameter of our algorithm that minimizes the total energy spent in the network. Simulation results show performance superiority of the new protocol.

  1. Scalable and Fully Distributed Localization in Large-Scale Sensor Networks

    Directory of Open Access Journals (Sweden)

    Miao Jin

    2017-06-01

    Full Text Available This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and a non-uniform nodal distribution. In contrast to current state-of-the-art connectivity-based localization methods, the proposed algorithm is highly scalable with linear computation and communication costs with respect to the size of the network; and fully distributed where each node only needs the information of its neighbors without cumbersome partitioning and merging process. The algorithm is theoretically guaranteed and numerically stable. Moreover, the algorithm can be readily extended to the localization of networks with a one-hop transmission range distance measurement, and the propagation of the measurement error at one sensor node is limited within a small area of the network around the node. Extensive simulations and comparison with other methods under various representative network settings are carried out, showing the superior performance of the proposed algorithm.

  2. Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

    Directory of Open Access Journals (Sweden)

    De-Xin Yu

    2013-01-01

    Full Text Available Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

  3. Emergence of switch-like behavior in a large family of simple biochemical networks.

    Directory of Open Access Journals (Sweden)

    Dan Siegal-Gaskins

    2011-05-01

    Full Text Available Bistability plays a central role in the gene regulatory networks (GRNs controlling many essential biological functions, including cellular differentiation and cell cycle control. However, establishing the network topologies that can exhibit bistability remains a challenge, in part due to the exceedingly large variety of GRNs that exist for even a small number of components. We begin to address this problem by employing chemical reaction network theory in a comprehensive in silico survey to determine the capacity for bistability of more than 40,000 simple networks that can be formed by two transcription factor-coding genes and their associated proteins (assuming only the most elementary biochemical processes. We find that there exist reaction rate constants leading to bistability in ∼90% of these GRN models, including several circuits that do not contain any of the TF cooperativity commonly associated with bistable systems, and the majority of which could only be identified as bistable through an original subnetwork-based analysis. A topological sorting of the two-gene family of networks based on the presence or absence of biochemical reactions reveals eleven minimal bistable networks (i.e., bistable networks that do not contain within them a smaller bistable subnetwork. The large number of previously unknown bistable network topologies suggests that the capacity for switch-like behavior in GRNs arises with relative ease and is not easily lost through network evolution. To highlight the relevance of the systematic application of CRNT to bistable network identification in real biological systems, we integrated publicly available protein-protein interaction, protein-DNA interaction, and gene expression data from Saccharomyces cerevisiae, and identified several GRNs predicted to behave in a bistable fashion.

  4. Patterns of interactions of a large fish-parasite network in a tropical floodplain.

    Science.gov (United States)

    Lima, Dilermando P; Giacomini, Henrique C; Takemoto, Ricardo M; Agostinho, Angelo A; Bini, Luis M

    2012-07-01

    1. Describing and explaining the structure of species interaction networks is of paramount importance for community ecology. Yet much has to be learned about the mechanisms responsible for major patterns, such as nestedness and modularity in different kinds of systems, of which large and diverse networks are a still underrepresented and scarcely studied fraction. 2. We assembled information on fishes and their parasites living in a large floodplain of key ecological importance for freshwater ecosystems in the Paraná River basin in South America. The resulting fish-parasite network containing 72 and 324 species of fishes and parasites, respectively, was analysed to investigate the patterns of nestedness and modularity as related to fish and parasite features. 3. Nestedness was found in the entire network and among endoparasites, multiple-host life cycle parasites and native hosts, but not in networks of ectoparasites, single-host life cycle parasites and non-native fishes. All networks were significantly modular. Taxonomy was the major host's attribute influencing both nestedness and modularity: more closely related host species tended to be associated with more nested parasite compositions and had greater chance of belonging to the same network module. Nevertheless, host abundance had a positive relationship with nestedness when only native host species pairs of the same network module were considered for analysis. 4. These results highlight the importance of evolutionary history of hosts in linking patterns of nestedness and formation of modules in the network. They also show that functional attributes of parasites (i.e. parasitism mode and life cycle) and origin of host populations (i.e. natives versus non-natives) are crucial to define the relative contribution of these two network properties and their dependence on other ecological factors (e.g. host abundance), with potential implications for community dynamics and stability. © 2012 The Authors

  5. Major technological innovations introduced in the large antennas of the Deep Space Network

    Science.gov (United States)

    Imbriale, W. A.

    2002-01-01

    The NASA Deep Space Network (DSN) is the largest and most sensitive scientific, telecommunications and radio navigation network in the world. Its principal responsibilities are to provide communications, tracking, and science services to most of the world's spacecraft that travel beyond low Earth orbit. The network consists of three Deep Space Communications Complexes. Each of the three complexes consists of multiple large antennas equipped with ultra sensitive receiving systems. A centralized Signal Processing Center (SPC) remotely controls the antennas, generates and transmits spacecraft commands, and receives and processes the spacecraft telemetry.

  6. Large-scale network dynamics of beta-band oscillations underlie auditory perceptual decision-making

    Directory of Open Access Journals (Sweden)

    Mohsen Alavash

    2017-06-01

    Full Text Available Perceptual decisions vary in the speed at which we make them. Evidence suggests that translating sensory information into perceptual decisions relies on distributed interacting neural populations, with decision speed hinging on power modulations of the neural oscillations. Yet the dependence of perceptual decisions on the large-scale network organization of coupled neural oscillations has remained elusive. We measured magnetoencephalographic signals in human listeners who judged acoustic stimuli composed of carefully titrated clouds of tone sweeps. These stimuli were used in two task contexts, in which the participants judged the overall pitch or direction of the tone sweeps. We traced the large-scale network dynamics of the source-projected neural oscillations on a trial-by-trial basis using power-envelope correlations and graph-theoretical network discovery. In both tasks, faster decisions were predicted by higher segregation and lower integration of coupled beta-band (∼16–28 Hz oscillations. We also uncovered the brain network states that promoted faster decisions in either lower-order auditory or higher-order control brain areas. Specifically, decision speed in judging the tone sweep direction critically relied on the nodal network configurations of anterior temporal, cingulate, and middle frontal cortices. Our findings suggest that global network communication during perceptual decision-making is implemented in the human brain by large-scale couplings between beta-band neural oscillations. The speed at which we make perceptual decisions varies. This translation of sensory information into perceptual decisions hinges on dynamic changes in neural oscillatory activity. However, the large-scale neural-network embodiment supporting perceptual decision-making is unclear. We addressed this question by experimenting two auditory perceptual decision-making situations. Using graph-theoretical network discovery, we traced the large-scale network

  7. A new type of intelligent wireless sensing network for health monitoring of large-size structures

    Science.gov (United States)

    Lei, Ying; Liu, Ch.; Wu, D. T.; Tang, Y. L.; Wang, J. X.; Wu, L. J.; Jiang, X. D.

    2009-07-01

    In recent years, some innovative wireless sensing systems have been proposed. However, more exploration and research on wireless sensing systems are required before wireless systems can substitute for the traditional wire-based systems. In this paper, a new type of intelligent wireless sensing network is proposed for the heath monitoring of large-size structures. Hardware design of the new wireless sensing units is first studied. The wireless sensing unit mainly consists of functional modules of: sensing interface, signal conditioning, signal digitization, computational core, wireless communication and battery management. Then, software architecture of the unit is introduced. The sensing network has a two-level cluster-tree architecture with Zigbee communication protocol. Important issues such as power saving and fault tolerance are considered in the designs of the new wireless sensing units and sensing network. Each cluster head in the network is characterized by its computational capabilities that can be used to implement the computational methodologies of structural health monitoring; making the wireless sensing units and sensing network have "intelligent" characteristics. Primary tests on the measurement data collected by the wireless system are performed. The distributed computational capacity of the intelligent sensing network is also demonstrated. It is shown that the new type of intelligent wireless sensing network provides an efficient tool for structural health monitoring of large-size structures.

  8. A Matrix-Based Proactive Data Relay Algorithm for Large Distributed Sensor Networks.

    Science.gov (United States)

    Xu, Yang; Hu, Xuemei; Hu, Haixiao; Liu, Ming

    2016-08-16

    In large-scale distributed sensor networks, sensed data is required to be relayed around the network so that one or few sensors can gather adequate relative data to produce high quality information for decision-making. In regards to very high energy-constraint sensor nodes, data transmission should be extremely economical. However, traditional data delivery protocols are potentially inefficient relaying unpredictable sensor readings for data fusion in large distributed networks for either overwhelming query transmissions or unnecessary data coverage. By building sensors' local model from their previously transmitted data in three matrixes, we have developed a novel energy-saving data relay algorithm, which allows sensors to proactively make broadcast decisions by using a neat matrix computation to provide balance between transmission and energy-saving. In addition, we designed a heuristic maintenance algorithm to efficiently update these three matrices. This can easily be deployed to large-scale mobile networks in which decisions of sensors are based on their local matrix models no matter how large the network is, and the local models of these sensors are updated constantly. Compared with some traditional approaches based on our simulations, the efficiency of this approach is manifested in uncertain environment. The results show that our approach is scalable and can effectively balance aggregating data with minimizing energy consumption.

  9. A Matrix-Based Proactive Data Relay Algorithm for Large Distributed Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yang Xu

    2016-08-01

    Full Text Available In large-scale distributed sensor networks, sensed data is required to be relayed around the network so that one or few sensors can gather adequate relative data to produce high quality information for decision-making. In regards to very high energy-constraint sensor nodes, data transmission should be extremely economical. However, traditional data delivery protocols are potentially inefficient relaying unpredictable sensor readings for data fusion in large distributed networks for either overwhelming query transmissions or unnecessary data coverage. By building sensors’ local model from their previously transmitted data in three matrixes, we have developed a novel energy-saving data relay algorithm, which allows sensors to proactively make broadcast decisions by using a neat matrix computation to provide balance between transmission and energy-saving. In addition, we designed a heuristic maintenance algorithm to efficiently update these three matrices. This can easily be deployed to large-scale mobile networks in which decisions of sensors are based on their local matrix models no matter how large the network is, and the local models of these sensors are updated constantly. Compared with some traditional approaches based on our simulations, the efficiency of this approach is manifested in uncertain environment. The results show that our approach is scalable and can effectively balance aggregating data with minimizing energy consumption.

  10. Non-parametric co-clustering of large scale sparse bipartite networks on the GPU

    DEFF Research Database (Denmark)

    Hansen, Toke Jansen; Mørup, Morten; Hansen, Lars Kai

    2011-01-01

    of row and column clusters from a hypothesis space of an infinite number of clusters. To reach large scale applications of co-clustering we exploit that parameter inference for co-clustering is well suited for parallel computing. We develop a generic GPU framework for efficient inference on large scale...... sparse bipartite networks and achieve a speedup of two orders of magnitude compared to estimation based on conventional CPUs. In terms of scalability we find for networks with more than 100 million links that reliable inference can be achieved in less than an hour on a single GPU. To efficiently manage...

  11. Role of Delays in Shaping Spatiotemporal Dynamics of Neuronal Activity in Large Networks

    International Nuclear Information System (INIS)

    Roxin, Alex; Brunel, Nicolas; Hansel, David

    2005-01-01

    We study the effect of delays on the dynamics of large networks of neurons. We show that delays give rise to a wealth of bifurcations and to a rich phase diagram, which includes oscillatory bumps, traveling waves, lurching waves, standing waves arising via a period-doubling bifurcation, aperiodic regimes, and regimes of multistability. We study the existence and the stability of the various dynamical patterns analytically and numerically in a simplified rate model as a function of the interaction parameters. The results derived in that framework allow us to understand the origin of the diversity of dynamical states observed in large networks of spiking neurons

  12. How Did the Information Flow in the #AlphaGo Hashtag Network? A Social Network Analysis of the Large-Scale Information Network on Twitter.

    Science.gov (United States)

    Kim, Jinyoung

    2017-12-01

    As it becomes common for Internet users to use hashtags when posting and searching information on social media, it is important to understand who builds a hashtag network and how information is circulated within the network. This article focused on unlocking the potential of the #AlphaGo hashtag network by addressing the following questions. First, the current study examined whether traditional opinion leadership (i.e., the influentials hypothesis) or grassroot participation by the public (i.e., the interpersonal hypothesis) drove dissemination of information in the hashtag network. Second, several unique patterns of information distribution by key users were identified. Finally, the association between attributes of key users who exerted great influence on information distribution (i.e., the number of followers and follows) and their central status in the network was tested. To answer the proffered research questions, a social network analysis was conducted using a large-scale hashtag network data set from Twitter (n = 21,870). The results showed that the leading actors in the network were actively receiving information from their followers rather than serving as intermediaries between the original information sources and the public. Moreover, the leading actors played several roles (i.e., conversation starters, influencers, and active engagers) in the network. Furthermore, the number of their follows and followers were significantly associated with their central status in the hashtag network. Based on the results, the current research explained how the information was exchanged in the hashtag network by proposing the reciprocal model of information flow.

  13. Automatic Generation of Connectivity for Large-Scale Neuronal Network Models through Structural Plasticity.

    Science.gov (United States)

    Diaz-Pier, Sandra; Naveau, Mikaël; Butz-Ostendorf, Markus; Morrison, Abigail

    2016-01-01

    With the emergence of new high performance computation technology in the last decade, the simulation of large scale neural networks which are able to reproduce the behavior and structure of the brain has finally become an achievable target of neuroscience. Due to the number of synaptic connections between neurons and the complexity of biological networks, most contemporary models have manually defined or static connectivity. However, it is expected that modeling the dynamic generation and deletion of the links among neurons, locally and between different regions of the brain, is crucial to unravel important mechanisms associated with learning, memory and healing. Moreover, for many neural circuits that could potentially be modeled, activity data is more readily and reliably available than connectivity data. Thus, a framework that enables networks to wire themselves on the basis of specified activity targets can be of great value in specifying network models where connectivity data is incomplete or has large error margins. To address these issues, in the present work we present an implementation of a model of structural plasticity in the neural network simulator NEST. In this model, synapses consist of two parts, a pre- and a post-synaptic element. Synapses are created and deleted during the execution of the simulation following local homeostatic rules until a mean level of electrical activity is reached in the network. We assess the scalability of the implementation in order to evaluate its potential usage in the self generation of connectivity of large scale networks. We show and discuss the results of simulations on simple two population networks and more complex models of the cortical microcircuit involving 8 populations and 4 layers using the new framework.

  14. Rapid Modeling of and Response to Large Earthquakes Using Real-Time GPS Networks (Invited)

    Science.gov (United States)

    Crowell, B. W.; Bock, Y.; Squibb, M. B.

    2010-12-01

    Real-time GPS networks have the advantage of capturing motions throughout the entire earthquake cycle (interseismic, seismic, coseismic, postseismic), and because of this, are ideal for real-time monitoring of fault slip in the region. Real-time GPS networks provide the perfect supplement to seismic networks, which operate with lower noise and higher sampling rates than GPS networks, but only measure accelerations or velocities, putting them at a supreme disadvantage for ascertaining the full extent of slip during a large earthquake in real-time. Here we report on two examples of rapid modeling of recent large earthquakes near large regional real-time GPS networks. The first utilizes Japan’s GEONET consisting of about 1200 stations during the 2003 Mw 8.3 Tokachi-Oki earthquake about 100 km offshore Hokkaido Island and the second investigates the 2010 Mw 7.2 El Mayor-Cucapah earthquake recorded by more than 100 stations in the California Real Time Network. The principal components of strain were computed throughout the networks and utilized as a trigger to initiate earthquake modeling. Total displacement waveforms were then computed in a simulated real-time fashion using a real-time network adjustment algorithm that fixes a station far away from the rupture to obtain a stable reference frame. Initial peak ground displacement measurements can then be used to obtain an initial size through scaling relationships. Finally, a full coseismic model of the event can be run minutes after the event, given predefined fault geometries, allowing emergency first responders and researchers to pinpoint the regions of highest damage. Furthermore, we are also investigating using total displacement waveforms for real-time moment tensor inversions to look at spatiotemporal variations in slip.

  15. Large-scale brain network coupling predicts acute nicotine abstinence effects on craving and cognitive function.

    Science.gov (United States)

    Lerman, Caryn; Gu, Hong; Loughead, James; Ruparel, Kosha; Yang, Yihong; Stein, Elliot A

    2014-05-01

    Interactions of large-scale brain networks may underlie cognitive dysfunctions in psychiatric and addictive disorders. To test the hypothesis that the strength of coupling among 3 large-scale brain networks--salience, executive control, and default mode--will reflect the state of nicotine withdrawal (vs smoking satiety) and will predict abstinence-induced craving and cognitive deficits and to develop a resource allocation index (RAI) that reflects the combined strength of interactions among the 3 large-scale networks. A within-subject functional magnetic resonance imaging study in an academic medical center compared resting-state functional connectivity coherence strength after 24 hours of abstinence and after smoking satiety. We examined the relationship of abstinence-induced changes in the RAI with alterations in subjective, behavioral, and neural functions. We included 37 healthy smoking volunteers, aged 19 to 61 years, for analyses. Twenty-four hours of abstinence vs smoking satiety. Inter-network connectivity strength (primary) and the relationship with subjective, behavioral, and neural measures of nicotine withdrawal during abstinence vs smoking satiety states (secondary). The RAI was significantly lower in the abstinent compared with the smoking satiety states (left RAI, P = .002; right RAI, P = .04), suggesting weaker inhibition between the default mode and salience networks. Weaker inter-network connectivity (reduced RAI) predicted abstinence-induced cravings to smoke (r = -0.59; P = .007) and less suppression of default mode activity during performance of a subsequent working memory task (ventromedial prefrontal cortex, r = -0.66, P = .003; posterior cingulate cortex, r = -0.65, P = .001). Alterations in coupling of the salience and default mode networks and the inability to disengage from the default mode network may be critical in cognitive/affective alterations that underlie nicotine dependence.

  16. Limits to the development of feed-forward structures in large recurrent neuronal networks

    Directory of Open Access Journals (Sweden)

    Susanne Kunkel

    2011-02-01

    Full Text Available Spike-timing dependent plasticity (STDP has traditionally been of great interest to theoreticians, as it seems to provide an answer to the question of how the brain can develop functional structure in response to repeated stimuli. However, despite this high level of interest, convincing demonstrations of this capacity in large, initially random networks have not been forthcoming. Such demonstrations as there are typically rely on constraining the problem artificially. Techniques include employing additional pruning mechanisms or STDP rules that enhance symmetry breaking, simulating networks with low connectivity that magnify competition between synapses, or combinations of the above. In this paper we first review modeling choices that carry particularly high risks of producing non-generalizable results in the context of STDP in recurrent networks. We then develop a theory for the development of feed-forward structure in random networks and conclude that an unstable fixed point in the dynamics prevents the stable propagation of structure in recurrent networks with weight-dependent STDP. We demonstrate that the key predictions of the theory hold in large-scale simulations. The theory provides insight into the reasons why such development does not take place in unconstrained systems and enables us to identify candidate biologically motivated adaptations to the balanced random network model that might enable it.

  17. Large scale silver nanowires network fabricated by MeV hydrogen (H+) ion beam irradiation

    International Nuclear Information System (INIS)

    S, Honey; S, Naseem; A, Ishaq; M, Maaza; M T, Bhatti; D, Wan

    2016-01-01

    A random two-dimensional large scale nano-network of silver nanowires (Ag-NWs) is fabricated by MeV hydrogen (H + ) ion beam irradiation. Ag-NWs are irradiated under H +  ion beam at different ion fluences at room temperature. The Ag-NW network is fabricated by H + ion beam-induced welding of Ag-NWs at intersecting positions. H +  ion beam induced welding is confirmed by transmission electron microscopy (TEM) and scanning electron microscopy (SEM). Moreover, the structure of Ag NWs remains stable under H +  ion beam, and networks are optically transparent. Morphology also remains stable under H +  ion beam irradiation. No slicings or cuttings of Ag-NWs are observed under MeV H +  ion beam irradiation. The results exhibit that the formation of Ag-NW network proceeds through three steps: ion beam induced thermal spikes lead to the local heating of Ag-NWs, the formation of simple junctions on small scale, and the formation of a large scale network. This observation is useful for using Ag-NWs based devices in upper space where protons are abandoned in an energy range from MeV to GeV. This high-quality Ag-NW network can also be used as a transparent electrode for optoelectronics devices. (paper)

  18. Directed partial correlation: inferring large-scale gene regulatory network through induced topology disruptions.

    Directory of Open Access Journals (Sweden)

    Yinyin Yuan

    Full Text Available Inferring regulatory relationships among many genes based on their temporal variation in transcript abundance has been a popular research topic. Due to the nature of microarray experiments, classical tools for time series analysis lose power since the number of variables far exceeds the number of the samples. In this paper, we describe some of the existing multivariate inference techniques that are applicable to hundreds of variables and show the potential challenges for small-sample, large-scale data. We propose a directed partial correlation (DPC method as an efficient and effective solution to regulatory network inference using these data. Specifically for genomic data, the proposed method is designed to deal with large-scale datasets. It combines the efficiency of partial correlation for setting up network topology by testing conditional independence, and the concept of Granger causality to assess topology change with induced interruptions. The idea is that when a transcription factor is induced artificially within a gene network, the disruption of the network by the induction signifies a genes role in transcriptional regulation. The benchmarking results using GeneNetWeaver, the simulator for the DREAM challenges, provide strong evidence of the outstanding performance of the proposed DPC method. When applied to real biological data, the inferred starch metabolism network in Arabidopsis reveals many biologically meaningful network modules worthy of further investigation. These results collectively suggest DPC is a versatile tool for genomics research. The R package DPC is available for download (http://code.google.com/p/dpcnet/.

  19. Maturation of Cortico-Subcortical Structural Networks-Segregation and Overlap of Medial Temporal and Fronto-Striatal Systems in Development.

    Science.gov (United States)

    Walhovd, Kristine B; Tamnes, Christian K; Bjørnerud, Atle; Due-Tønnessen, Paulina; Holland, Dominic; Dale, Anders M; Fjell, Anders M

    2015-07-01

    The brain consists of partly segregated neural circuits within which structural convergence and functional integration occurs during development. The relationship of structural cortical and subcortical maturation is largely unknown. We aimed to study volumetric development of the hippocampus and basal ganglia (caudate, putamen, pallidum, accumbens) in relation to volume changes throughout the cortex. Longitudinal MRI data were obtained across a mean interval of 2.6 years in 85 participants with an age range of 8-19 years at study start. Left and right subcortical changes were related to cortical change vertex-wise in the ipsilateral hemisphere with general linear models with age, sex, interval between scans, and mean cortical volume change as covariates. Hippocampal-cortical change relationships centered on parts of the Papez circuit, including entorhinal, parahippocampal, and isthmus cingulate areas, and lateral temporal, insular, and orbitofrontal cortices in the left hemisphere. Basal ganglia-cortical change relationships were observed in mostly nonoverlapping and more anterior cortical areas, all including the anterior cingulate. Other patterns were unique to specific basal ganglia structures, including pre-, post-, and paracentral patterns relating to putamen change. In conclusion, patterns of cortico-subcortical development as assessed by morphometric analyses in part map out segregated neural circuits at the macrostructural level. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  20. Active self-testing noise measurement sensors for large-scale environmental sensor networks.

    Science.gov (United States)

    Domínguez, Federico; Cuong, Nguyen The; Reinoso, Felipe; Touhafi, Abdellah; Steenhaut, Kris

    2013-12-13

    Large-scale noise pollution sensor networks consist of hundreds of spatially distributed microphones that measure environmental noise. These networks provide historical and real-time environmental data to citizens and decision makers and are therefore a key technology to steer environmental policy. However, the high cost of certified environmental microphone sensors render large-scale environmental networks prohibitively expensive. Several environmental network projects have started using off-the-shelf low-cost microphone sensors to reduce their costs, but these sensors have higher failure rates and produce lower quality data. To offset this disadvantage, we developed a low-cost noise sensor that actively checks its condition and indirectly the integrity of the data it produces. The main design concept is to embed a 13 mm speaker in the noise sensor casing and, by regularly scheduling a frequency sweep, estimate the evolution of the microphone's frequency response over time. This paper presents our noise sensor's hardware and software design together with the results of a test deployment in a large-scale environmental network in Belgium. Our middle-range-value sensor (around €50) effectively detected all experienced malfunctions, in laboratory tests and outdoor deployments, with a few false positives. Future improvements could further lower the cost of our sensor below €10.

  1. Large-Scale Cooperative Task Distribution on Peer-to-Peer Networks

    Science.gov (United States)

    2012-01-01

    SUBTITLE Large-scale cooperative task distribution on peer-to-peer networks 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...disadvantages of ML- Chord are its fixed size (two layers), and limited scala - bility for large-scale systems. RC-Chord extends ML- D. Karrels et al...configurable before runtime. This can be improved by incorporating a distributed learning algorithm to tune the number and range of the DLoE tracking

  2. A model-based eco-routing strategy for electric vehicles in large urban networks

    OpenAIRE

    De Nunzio , Giovanni; Thibault , Laurent; Sciarretta , Antonio

    2016-01-01

    International audience; A novel eco-routing navigation strategy and energy consumption modeling approach for electric vehicles are presented in this work. Speed fluctuations and road network infrastructure have a large impact on vehicular energy consumption. Neglecting these effects may lead to large errors in eco-routing navigation, which could trivially select the route with the lowest average speed. We propose an energy consumption model that considers both accelerations and impact of the ...

  3. On a digital wireless impact-monitoring network for large-scale composite structures

    International Nuclear Information System (INIS)

    Yuan, Shenfang; Mei, Hanfei; Qiu, Lei; Ren, Yuanqiang

    2014-01-01

    Impact, which may occur during manufacture, service or maintenance, is one of the major concerns to be monitored throughout the lifetime of aircraft composite structures. Aiming at monitoring impacts online while minimizing the weight added to the aircraft to meet the strict limitations of aerospace engineering, this paper puts forward a new digital wireless network based on miniaturized wireless digital impact-monitoring nodes developed for large-scale composite structures. In addition to investigations on the design methods of the network architecture, time synchronization and implementation method, a conflict resolution method based on the feature parameters of digital sequences is first presented to address impact localization conflicts when several nodes are arranged close together. To verify the feasibility and stability of the wireless network, experiments are performed on a complex aircraft composite wing box and an unmanned aerial vehicle (UAV) composite wing. Experimental results show the successful design of the presented network. (paper)

  4. MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning

    Directory of Open Access Journals (Sweden)

    Yang Liu

    2015-01-01

    Full Text Available Artificial neural networks (ANNs have been widely used in pattern recognition and classification applications. However, ANNs are notably slow in computation especially when the size of data is large. Nowadays, big data has received a momentum from both industry and academia. To fulfill the potentials of ANNs for big data applications, the computation process must be speeded up. For this purpose, this paper parallelizes neural networks based on MapReduce, which has become a major computing model to facilitate data intensive applications. Three data intensive scenarios are considered in the parallelization process in terms of the volume of classification data, the size of the training data, and the number of neurons in the neural network. The performance of the parallelized neural networks is evaluated in an experimental MapReduce computer cluster from the aspects of accuracy in classification and efficiency in computation.

  5. MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning.

    Science.gov (United States)

    Liu, Yang; Yang, Jie; Huang, Yuan; Xu, Lixiong; Li, Siguang; Qi, Man

    2015-01-01

    Artificial neural networks (ANNs) have been widely used in pattern recognition and classification applications. However, ANNs are notably slow in computation especially when the size of data is large. Nowadays, big data has received a momentum from both industry and academia. To fulfill the potentials of ANNs for big data applications, the computation process must be speeded up. For this purpose, this paper parallelizes neural networks based on MapReduce, which has become a major computing model to facilitate data intensive applications. Three data intensive scenarios are considered in the parallelization process in terms of the volume of classification data, the size of the training data, and the number of neurons in the neural network. The performance of the parallelized neural networks is evaluated in an experimental MapReduce computer cluster from the aspects of accuracy in classification and efficiency in computation.

  6. Fast and accurate detection of spread source in large complex networks.

    Science.gov (United States)

    Paluch, Robert; Lu, Xiaoyan; Suchecki, Krzysztof; Szymański, Bolesław K; Hołyst, Janusz A

    2018-02-06

    Spread over complex networks is a ubiquitous process with increasingly wide applications. Locating spread sources is often important, e.g. finding the patient one in epidemics, or source of rumor spreading in social network. Pinto, Thiran and Vetterli introduced an algorithm (PTVA) to solve the important case of this problem in which a limited set of nodes act as observers and report times at which the spread reached them. PTVA uses all observers to find a solution. Here we propose a new approach in which observers with low quality information (i.e. with large spread encounter times) are ignored and potential sources are selected based on the likelihood gradient from high quality observers. The original complexity of PTVA is O(N α ), where α ∈ (3,4) depends on the network topology and number of observers (N denotes the number of nodes in the network). Our Gradient Maximum Likelihood Algorithm (GMLA) reduces this complexity to O (N 2 log (N)). Extensive numerical tests performed on synthetic networks and real Gnutella network with limitation that id's of spreaders are unknown to observers demonstrate that for scale-free networks with such limitation GMLA yields higher quality localization results than PTVA does.

  7. Congenital blindness is associated with large-scale reorganization of anatomical networks.

    Science.gov (United States)

    Hasson, Uri; Andric, Michael; Atilgan, Hicret; Collignon, Olivier

    2016-03-01

    Blindness is a unique model for understanding the role of experience in the development of the brain's functional and anatomical architecture. Documenting changes in the structure of anatomical networks for this population would substantiate the notion that the brain's core network-level organization may undergo neuroplasticity as a result of life-long experience. To examine this issue, we compared whole-brain networks of regional cortical-thickness covariance in early blind and matched sighted individuals. This covariance is thought to reflect signatures of integration between systems involved in similar perceptual/cognitive functions. Using graph-theoretic metrics, we identified a unique mode of anatomical reorganization in the blind that differed from that found for sighted. This was seen in that network partition structures derived from subgroups of blind were more similar to each other than they were to partitions derived from sighted. Notably, after deriving network partitions, we found that language and visual regions tended to reside within separate modules in sighted but showed a pattern of merging into shared modules in the blind. Our study demonstrates that early visual deprivation triggers a systematic large-scale reorganization of whole-brain cortical-thickness networks, suggesting changes in how occipital regions interface with other functional networks in the congenitally blind. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

  8. High-Dimensional Function Approximation With Neural Networks for Large Volumes of Data.

    Science.gov (United States)

    Andras, Peter

    2018-02-01

    Approximation of high-dimensional functions is a challenge for neural networks due to the curse of dimensionality. Often the data for which the approximated function is defined resides on a low-dimensional manifold and in principle the approximation of the function over this manifold should improve the approximation performance. It has been show that projecting the data manifold into a lower dimensional space, followed by the neural network approximation of the function over this space, provides a more precise approximation of the function than the approximation of the function with neural networks in the original data space. However, if the data volume is very large, the projection into the low-dimensional space has to be based on a limited sample of the data. Here, we investigate the nature of the approximation error of neural networks trained over the projection space. We show that such neural networks should have better approximation performance than neural networks trained on high-dimensional data even if the projection is based on a relatively sparse sample of the data manifold. We also find that it is preferable to use a uniformly distributed sparse sample of the data for the purpose of the generation of the low-dimensional projection. We illustrate these results considering the practical neural network approximation of a set of functions defined on high-dimensional data including real world data as well.

  9. A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks

    Directory of Open Access Journals (Sweden)

    Rui Fan

    2017-12-01

    Full Text Available Betweenness, a widely employed centrality measure in network science, is a decent proxy for investigating network loads and rankings. However, its extremely high computational cost greatly hinders its applicability in large networks. Although several parallel algorithms have been presented to reduce its calculation cost for unweighted networks, a fast solution for weighted networks, which are commonly encountered in many realistic applications, is still lacking. In this study, we develop an efficient parallel GPU-based approach to boost the calculation of the betweenness centrality (BC for large weighted networks. We parallelize the traditional Dijkstra algorithm by selecting more than one frontier vertex each time and then inspecting the frontier vertices simultaneously. By combining the parallel SSSP algorithm with the parallel BC framework, our GPU-based betweenness algorithm achieves much better performance than its CPU counterparts. Moreover, to further improve performance, we integrate the work-efficient strategy, and to address the load-imbalance problem, we introduce a warp-centric technique, which assigns many threads rather than one to a single frontier vertex. Experiments on both realistic and synthetic networks demonstrate the efficiency of our solution, which achieves 2.9× to 8.44× speedups over the parallel CPU implementation. Our algorithm is open-source and free to the community; it is publicly available through https://dx.doi.org/10.6084/m9.figshare.4542405. Considering the pervasive deployment and declining price of GPUs in personal computers and servers, our solution will offer unprecedented opportunities for exploring betweenness-related problems and will motivate follow-up efforts in network science.

  10. Towards a Versatile Problem Diagnosis Infrastructure for LargeWireless Sensor Networks

    NARCIS (Netherlands)

    Iwanicki, Konrad; Steen, van Maarten

    2007-01-01

    In this position paper, we address the issue of durable maintenance of a wireless sensor network, which will be crucial if the vision of large, long-lived sensornets is to become reality. Durable maintenance requires tools for diagnosing and fixing occurring problems, which can range from

  11. Extraction of drainage networks from large terrain datasets using high throughput computing

    Science.gov (United States)

    Gong, Jianya; Xie, Jibo

    2009-02-01

    Advanced digital photogrammetry and remote sensing technology produces large terrain datasets (LTD). How to process and use these LTD has become a big challenge for GIS users. Extracting drainage networks, which are basic for hydrological applications, from LTD is one of the typical applications of digital terrain analysis (DTA) in geographical information applications. Existing serial drainage algorithms cannot deal with large data volumes in a timely fashion, and few GIS platforms can process LTD beyond the GB size. High throughput computing (HTC), a distributed parallel computing mode, is proposed to improve the efficiency of drainage networks extraction from LTD. Drainage network extraction using HTC involves two key issues: (1) how to decompose the large DEM datasets into independent computing units and (2) how to merge the separate outputs into a final result. A new decomposition method is presented in which the large datasets are partitioned into independent computing units using natural watershed boundaries instead of using regular 1-dimensional (strip-wise) and 2-dimensional (block-wise) decomposition. Because the distribution of drainage networks is strongly related to watershed boundaries, the new decomposition method is more effective and natural. The method to extract natural watershed boundaries was improved by using multi-scale DEMs instead of single-scale DEMs. A HTC environment is employed to test the proposed methods with real datasets.

  12. Received signal strength in large-scale wireless relay sensor network: a stochastic ray approach

    NARCIS (Netherlands)

    Hu, L.; Chen, Y.; Scanlon, W.G.

    2011-01-01

    The authors consider a point percolation lattice representation of a large-scale wireless relay sensor network (WRSN) deployed in a cluttered environment. Each relay sensor corresponds to a grid point in the random lattice and the signal sent by the source is modelled as an ensemble of photons that

  13. Node localization algorithm of wireless sensor networks for large electrical equipment monitoring application

    DEFF Research Database (Denmark)

    Chen, Qinyin; Hu, Y.; Chen, Zhe

    2016-01-01

    Node localization technology is an important technology for the Wireless Sensor Networks (WSNs) applications. An improved 3D node localization algorithm is proposed in this paper, which is based on a Multi-dimensional Scaling (MDS) node localization algorithm for large electrical equipment monito...

  14. Par@Graph - a parallel toolbox for the construction and analysis of large complex climate networks

    NARCIS (Netherlands)

    Tantet, A.J.J.

    2015-01-01

    In this paper, we present Par@Graph, a software toolbox to reconstruct and analyze complex climate networks having a large number of nodes (up to at least 106) and edges (up to at least 1012). The key innovation is an efficient set of parallel software tools designed to leverage the inherited hybrid

  15. Large-scale computer networks and the future of legal knowledge-based systems

    NARCIS (Netherlands)

    Leenes, R.E.; Svensson, Jorgen S.; Hage, J.C.; Bench-Capon, T.J.M.; Cohen, M.J.; van den Herik, H.J.

    1995-01-01

    In this paper we investigate the relation between legal knowledge-based systems and large-scale computer networks such as the Internet. On the one hand, researchers of legal knowledge-based systems have claimed huge possibilities, but despite the efforts over the last twenty years, the number of

  16. Streaming Parallel GPU Acceleration of Large-Scale filter-based Spiking Neural Networks

    NARCIS (Netherlands)

    L.P. Slazynski (Leszek); S.M. Bohte (Sander)

    2012-01-01

    htmlabstractThe arrival of graphics processing (GPU) cards suitable for massively parallel computing promises a↵ordable large-scale neural network simulation previously only available at supercomputing facil- ities. While the raw numbers suggest that GPUs may outperform CPUs by at least an order of

  17. Local, distributed topology control for large-scale wireless ad-hoc networks

    NARCIS (Netherlands)

    Nieberg, T.; Hurink, Johann L.

    In this document, topology control of a large-scale, wireless network by a distributed algorithm that uses only locally available information is presented. Topology control algorithms adjust the transmission power of wireless nodes to create a desired topology. The algorithm, named local power

  18. The Use of Online Social Networks by Polish Former Erasmus Students: A Large-Scale Survey

    Science.gov (United States)

    Bryla, Pawel

    2014-01-01

    There is an increasing role of online social networks in the life of young Poles. We conducted a large-scale survey among Polish former Erasmus students. We have received 2450 completed questionnaires from alumni of 115 higher education institutions all over Poland. 85.4% of our respondents reported they kept in touch with their former Erasmus…

  19. Largenet2: an object-oriented programming library for simulating large adaptive networks.

    Science.gov (United States)

    Zschaler, Gerd; Gross, Thilo

    2013-01-15

    The largenet2 C++ library provides an infrastructure for the simulation of large dynamic and adaptive networks with discrete node and link states. The library is released as free software. It is available at http://biond.github.com/largenet2. Largenet2 is licensed under the Creative Commons Attribution-NonCommercial 3.0 Unported License. gerd@biond.org

  20. Modeling Temporal Behavior in Large Networks: A Dynamic Mixed-Membership Model

    Energy Technology Data Exchange (ETDEWEB)

    Rossi, R; Gallagher, B; Neville, J; Henderson, K

    2011-11-11

    Given a large time-evolving network, how can we model and characterize the temporal behaviors of individual nodes (and network states)? How can we model the behavioral transition patterns of nodes? We propose a temporal behavior model that captures the 'roles' of nodes in the graph and how they evolve over time. The proposed dynamic behavioral mixed-membership model (DBMM) is scalable, fully automatic (no user-defined parameters), non-parametric/data-driven (no specific functional form or parameterization), interpretable (identifies explainable patterns), and flexible (applicable to dynamic and streaming networks). Moreover, the interpretable behavioral roles are generalizable, computationally efficient, and natively supports attributes. We applied our model for (a) identifying patterns and trends of nodes and network states based on the temporal behavior, (b) predicting future structural changes, and (c) detecting unusual temporal behavior transitions. We use eight large real-world datasets from different time-evolving settings (dynamic and streaming). In particular, we model the evolving mixed-memberships and the corresponding behavioral transitions of Twitter, Facebook, IP-Traces, Email (University), Internet AS, Enron, Reality, and IMDB. The experiments demonstrate the scalability, flexibility, and effectiveness of our model for identifying interesting patterns, detecting unusual structural transitions, and predicting the future structural changes of the network and individual nodes.

  1. Network theory-based analysis of risk interactions in large engineering projects

    International Nuclear Information System (INIS)

    Fang, Chao; Marle, Franck; Zio, Enrico; Bocquet, Jean-Claude

    2012-01-01

    This paper presents an approach based on network theory to deal with risk interactions in large engineering projects. Indeed, such projects are exposed to numerous and interdependent risks of various nature, which makes their management more difficult. In this paper, a topological analysis based on network theory is presented, which aims at identifying key elements in the structure of interrelated risks potentially affecting a large engineering project. This analysis serves as a powerful complement to classical project risk analysis. Its originality lies in the application of some network theory indicators to the project risk management field. The construction of the risk network requires the involvement of the project manager and other team members assigned to the risk management process. Its interpretation improves their understanding of risks and their potential interactions. The outcomes of the analysis provide a support for decision-making regarding project risk management. An example of application to a real large engineering project is presented. The conclusion is that some new insights can be found about risks, about their interactions and about the global potential behavior of the project. - Highlights: ► The method addresses the modeling of complexity in project risk analysis. ► Network theory indicators enable other risks than classical criticality analysis to be highlighted. ► This topological analysis improves project manager's understanding of risks and risk interactions. ► This helps project manager to make decisions considering the position in the risk network. ► An application to a real tramway implementation project in a city is provided.

  2. Identifying influential nodes in large-scale directed networks: the role of clustering.

    Science.gov (United States)

    Chen, Duan-Bing; Gao, Hui; Lü, Linyuan; Zhou, Tao

    2013-01-01

    Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node's neighbors but do not directly make use of the interactions among it's neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR) spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about [Formula: see text] nodes, more than 15 times faster than PageRank.

  3. Identifying influential nodes in large-scale directed networks: the role of clustering.

    Directory of Open Access Journals (Sweden)

    Duan-Bing Chen

    Full Text Available Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node's neighbors but do not directly make use of the interactions among it's neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about [Formula: see text] nodes, more than 15 times faster than PageRank.

  4. ShakeNet: a portable wireless sensor network for instrumenting large civil structures

    Science.gov (United States)

    Kohler, Monica D.; Hao, Shuai; Mishra, Nilesh; Govindan, Ramesh; Nigbor, Robert

    2015-08-03

    We report our findings from a U.S. Geological Survey (USGS) National Earthquake Hazards Reduction Program-funded project to develop and test a wireless, portable, strong-motion network of up to 40 triaxial accelerometers for structural health monitoring. The overall goal of the project was to record ambient vibrations for several days from USGS-instrumented structures. Structural health monitoring has important applications in fields like civil engineering and the study of earthquakes. The emergence of wireless sensor networks provides a promising means to such applications. However, while most wireless sensor networks are still in the experimentation stage, very few take into consideration the realistic earthquake engineering application requirements. To collect comprehensive data for structural health monitoring for civil engineers, high-resolution vibration sensors and sufficient sampling rates should be adopted, which makes it challenging for current wireless sensor network technology in the following ways: processing capabilities, storage limit, and communication bandwidth. The wireless sensor network has to meet expectations set by wired sensor devices prevalent in the structural health monitoring community. For this project, we built and tested an application-realistic, commercially based, portable, wireless sensor network called ShakeNet for instrumentation of large civil structures, especially for buildings, bridges, or dams after earthquakes. Two to three people can deploy ShakeNet sensors within hours after an earthquake to measure the structural response of the building or bridge during aftershocks. ShakeNet involved the development of a new sensing platform (ShakeBox) running a software suite for networking, data collection, and monitoring. Deployments reported here on a tall building and a large dam were real-world tests of ShakeNet operation, and helped to refine both hardware and software. 

  5. Large-scale brain networks are distinctly affected in right and left mesial temporal lobe epilepsy.

    Science.gov (United States)

    de Campos, Brunno Machado; Coan, Ana Carolina; Lin Yasuda, Clarissa; Casseb, Raphael Fernandes; Cendes, Fernando

    2016-09-01

    Mesial temporal lobe epilepsy (MTLE) with hippocampus sclerosis (HS) is associated with functional and structural alterations extending beyond the temporal regions and abnormal pattern of brain resting state networks (RSNs) connectivity. We hypothesized that the interaction of large-scale RSNs is differently affected in patients with right- and left-MTLE with HS compared to controls. We aimed to determine and characterize these alterations through the analysis of 12 RSNs, functionally parceled in 70 regions of interest (ROIs), from resting-state functional-MRIs of 99 subjects (52 controls, 26 right- and 21 left-MTLE patients with HS). Image preprocessing and statistical analysis were performed using UF(2) C-toolbox, which provided ROI-wise results for intranetwork and internetwork connectivity. Intranetwork abnormalities were observed in the dorsal default mode network (DMN) in both groups of patients and in the posterior salience network in right-MTLE. Both groups showed abnormal correlation between the dorsal-DMN and the posterior salience, as well as between the dorsal-DMN and the executive-control network. Patients with left-MTLE also showed reduced correlation between the dorsal-DMN and visuospatial network and increased correlation between bilateral thalamus and the posterior salience network. The ipsilateral hippocampus stood out as a central area of abnormalities. Alterations on left-MTLE expressed a low cluster coefficient, whereas the altered connections on right-MTLE showed low cluster coefficient in the DMN but high in the posterior salience regions. Both right- and left-MTLE patients with HS have widespread abnormal interactions of large-scale brain networks; however, all parameters evaluated indicate that left-MTLE has a more intricate bihemispheric dysfunction compared to right-MTLE. Hum Brain Mapp 37:3137-3152, 2016. © 2016 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc. © 2016 The Authors Human Brain Mapping Published by

  6. Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering

    Science.gov (United States)

    Chen, Duan-Bing; Gao, Hui; Lü, Linyuan; Zhou, Tao

    2013-01-01

    Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node’s neighbors but do not directly make use of the interactions among it’s neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors’ influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR) spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about nodes, more than 15 times faster than PageRank. PMID:24204833

  7. Competitive STDP Learning of Overlapping Spatial Patterns.

    Science.gov (United States)

    Krunglevicius, Dalius

    2015-08-01

    Spike-timing-dependent plasticity (STDP) is a set of Hebbian learning rules firmly based on biological evidence. It has been demonstrated that one of the STDP learning rules is suited for learning spatiotemporal patterns. When multiple neurons are organized in a simple competitive spiking neural network, this network is capable of learning multiple distinct patterns. If patterns overlap significantly (i.e., patterns are mutually inclusive), however, competition would not preclude trained neuron's responding to a new pattern and adjusting synaptic weights accordingly. This letter presents a simple neural network that combines vertical inhibition and Euclidean distance-dependent synaptic strength factor. This approach helps to solve the problem of pattern size-dependent parameter optimality and significantly reduces the probability of a neuron's forgetting an already learned pattern. For demonstration purposes, the network was trained for the first ten letters of the Braille alphabet.

  8. The Relationship of Policymaking and Networking Characteristics among Leaders of Large Urban Health Departments.

    Science.gov (United States)

    Leider, Jonathon P; Castrucci, Brian C; Harris, Jenine K; Hearne, Shelley

    2015-08-06

    The relationship between policy networks and policy development among local health departments (LHDs) is a growing area of interest to public health practitioners and researchers alike. In this study, we examine policy activity and ties between public health leadership across large urban health departments. This study uses data from a national profile of local health departments as well as responses from a survey sent to three staff members (local health official, chief of policy, chief science officer) in each of 16 urban health departments in the United States. Network questions related to frequency of contact with health department personnel in other cities. Using exponential random graph models, network density and centrality were examined, as were patterns of communication among those working on several policy areas using exponential random graph models. All 16 LHDs were active in communicating about chronic disease as well as about use of alcohol, tobacco, and other drugs (ATOD). Connectedness was highest among local health officials (density = .55), and slightly lower for chief science officers (d = .33) and chiefs of policy (d = .29). After accounting for organizational characteristics, policy homophily (i.e., when two network members match on a single characteristic) and tenure were the most significant predictors of formation of network ties. Networking across health departments has the potential for accelerating the adoption of public health policies. This study suggests similar policy interests and formation of connections among senior leadership can potentially drive greater connectedness among other staff.

  9. The Relationship of Policymaking and Networking Characteristics among Leaders of Large Urban Health Departments

    Directory of Open Access Journals (Sweden)

    Jonathon P. Leider

    2015-08-01

    Full Text Available Background: The relationship between policy networks and policy development among local health departments (LHDs is a growing area of interest to public health practitioners and researchers alike. In this study, we examine policy activity and ties between public health leadership across large urban health departments. Methods: This study uses data from a national profile of local health departments as well as responses from a survey sent to three staff members (local health official, chief of policy, chief science officer in each of 16 urban health departments in the United States. Network questions related to frequency of contact with health department personnel in other cities. Using exponential random graph models, network density and centrality were examined, as were patterns of communication among those working on several policy areas using exponential random graph models. Results: All 16 LHDs were active in communicating about chronic disease as well as about use of alcohol, tobacco, and other drugs (ATOD. Connectedness was highest among local health officials (density = .55, and slightly lower for chief science officers (d = .33 and chiefs of policy (d = .29. After accounting for organizational characteristics, policy homophily (i.e., when two network members match on a single characteristic and tenure were the most significant predictors of formation of network ties. Conclusion: Networking across health departments has the potential for accelerating the adoption of public health policies. This study suggests similar policy interests and formation of connections among senior leadership can potentially drive greater connectedness among other staff.

  10. Socio-Cognitive Phenotypes Differentially Modulate Large-Scale Structural Covariance Networks.

    Science.gov (United States)

    Valk, Sofie L; Bernhardt, Boris C; Böckler, Anne; Trautwein, Fynn-Mathis; Kanske, Philipp; Singer, Tania

    2017-02-01

    Functional neuroimaging studies have suggested the existence of 2 largely distinct social cognition networks, one for theory of mind (taking others' cognitive perspective) and another for empathy (sharing others' affective states). To address whether these networks can also be dissociated at the level of brain structure, we combined behavioral phenotyping across multiple socio-cognitive tasks with 3-Tesla MRI cortical thickness and structural covariance analysis in 270 healthy adults, recruited across 2 sites. Regional thickness mapping only provided partial support for divergent substrates, highlighting that individual differences in empathy relate to left insular-opercular thickness while no correlation between thickness and mentalizing scores was found. Conversely, structural covariance analysis showed clearly divergent network modulations by socio-cognitive and -affective phenotypes. Specifically, individual differences in theory of mind related to structural integration between temporo-parietal and dorsomedial prefrontal regions while empathy modulated the strength of dorsal anterior insula networks. Findings were robust across both recruitment sites, suggesting generalizability. At the level of structural network embedding, our study provides a double dissociation between empathy and mentalizing. Moreover, our findings suggest that structural substrates of higher-order social cognition are reflected rather in interregional networks than in the the local anatomical markup of specific regions per se. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  11. A new traffic control design method for large networks with signalized intersections

    Science.gov (United States)

    Leininger, G. G.; Colony, D. C.; Seldner, K.

    1979-01-01

    The paper presents a traffic control design technique for application to large traffic networks with signalized intersections. It is shown that the design method adopts a macroscopic viewpoint to establish a new traffic modelling procedure in which vehicle platoons are subdivided into main stream queues and turning queues. Optimization of the signal splits minimizes queue lengths in the steady state condition and improves traffic flow conditions, from the viewpoint of the traveling public. Finally, an application of the design method to a traffic network with thirty-three signalized intersections is used to demonstrate the effectiveness of the proposed technique.

  12. Harnessing diversity towards the reconstructing of large scale gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Takeshi Hase

    Full Text Available Elucidating gene regulatory network (GRN from large scale experimental data remains a central challenge in systems biology. Recently, numerous techniques, particularly consensus driven approaches combining different algorithms, have become a potentially promising strategy to infer accurate GRNs. Here, we develop a novel consensus inference algorithm, TopkNet that can integrate multiple algorithms to infer GRNs. Comprehensive performance benchmarking on a cloud computing framework demonstrated that (i a simple strategy to combine many algorithms does not always lead to performance improvement compared to the cost of consensus and (ii TopkNet integrating only high-performance algorithms provide significant performance improvement compared to the best individual algorithms and community prediction. These results suggest that a priori determination of high-performance algorithms is a key to reconstruct an unknown regulatory network. Similarity among gene-expression datasets can be useful to determine potential optimal algorithms for reconstruction of unknown regulatory networks, i.e., if expression-data associated with known regulatory network is similar to that with unknown regulatory network, optimal algorithms determined for the known regulatory network can be repurposed to infer the unknown regulatory network. Based on this observation, we developed a quantitative measure of similarity among gene-expression datasets and demonstrated that, if similarity between the two expression datasets is high, TopkNet integrating algorithms that are optimal for known dataset perform well on the unknown dataset. The consensus framework, TopkNet, together with the similarity measure proposed in this study provides a powerful strategy towards harnessing the wisdom of the crowds in reconstruction of unknown regulatory networks.

  13. Load reduction test method of similarity theory and BP neural networks of large cranes

    Science.gov (United States)

    Yang, Ruigang; Duan, Zhibin; Lu, Yi; Wang, Lei; Xu, Gening

    2016-01-01

    Static load tests are an important means of supervising and detecting a crane's lift capacity. Due to space restrictions, however, there are difficulties and potential danger when testing large bridge cranes. To solve the loading problems of large-tonnage cranes during testing, an equivalency test is proposed based on the similarity theory and BP neural networks. The maximum stress and displacement of a large bridge crane is tested in small loads, combined with the training neural network of a similar structure crane through stress and displacement data which is collected by a physics simulation progressively loaded to a static load test load within the material scope of work. The maximum stress and displacement of a crane under a static load test load can be predicted through the relationship of stress, displacement, and load. By measuring the stress and displacement of small tonnage weights, the stress and displacement of large loads can be predicted, such as the maximum load capacity, which is 1.25 times the rated capacity. Experimental study shows that the load reduction test method can reflect the lift capacity of large bridge cranes. The load shedding predictive analysis for Sanxia 1200 t bridge crane test data indicates that when the load is 1.25 times the rated lifting capacity, the predicted displacement and actual displacement error is zero. The method solves the problem that lifting capacities are difficult to obtain and testing accidents are easily possible when 1.25 times related weight loads are tested for large tonnage cranes.

  14. Detection of large-scale concentric gravity waves from a Chinese airglow imager network

    Science.gov (United States)

    Lai, Chang; Yue, Jia; Xu, Jiyao; Yuan, Wei; Li, Qinzeng; Liu, Xiao

    2018-06-01

    Concentric gravity waves (CGWs) contain a broad spectrum of horizontal wavelengths and periods due to their instantaneous localized sources (e.g., deep convection, volcanic eruptions, or earthquake, etc.). However, it is difficult to observe large-scale gravity waves of >100 km wavelength from the ground for the limited field of view of a single camera and local bad weather. Previously, complete large-scale CGW imagery could only be captured by satellite observations. In the present study, we developed a novel method that uses assembling separate images and applying low-pass filtering to obtain temporal and spatial information about complete large-scale CGWs from a network of all-sky airglow imagers. Coordinated observations from five all-sky airglow imagers in Northern China were assembled and processed to study large-scale CGWs over a wide area (1800 km × 1 400 km), focusing on the same two CGW events as Xu et al. (2015). Our algorithms yielded images of large-scale CGWs by filtering out the small-scale CGWs. The wavelengths, wave speeds, and periods of CGWs were measured from a sequence of consecutive assembled images. Overall, the assembling and low-pass filtering algorithms can expand the airglow imager network to its full capacity regarding the detection of large-scale gravity waves.

  15. Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels

    International Nuclear Information System (INIS)

    Havemann, Frank; Heinz, Michael; Struck, Alexander; Gläser, Jochen

    2011-01-01

    We propose a new local, deterministic and parameter-free algorithm that detects fuzzy and crisp overlapping communities in a weighted network and simultaneously reveals their hierarchy. Using a local fitness function, the algorithm greedily expands natural communities of seeds until the whole graph is covered. The hierarchy of communities is obtained analytically by calculating resolution levels at which communities grow rather than numerically by testing different resolution levels. This analytic procedure is not only more exact than its numerical alternatives such as LFM and GCE but also much faster. Critical resolution levels can be identified by searching for intervals in which large changes of the resolution do not lead to growth of communities. We tested our algorithm on benchmark graphs and on a network of 492 papers in information science. Combined with a specific post-processing, the algorithm gives much more precise results on LFR benchmarks with high overlap compared to other algorithms and performs very similarly to GCE

  16. Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels

    Science.gov (United States)

    Havemann, Frank; Heinz, Michael; Struck, Alexander; Gläser, Jochen

    2011-01-01

    We propose a new local, deterministic and parameter-free algorithm that detects fuzzy and crisp overlapping communities in a weighted network and simultaneously reveals their hierarchy. Using a local fitness function, the algorithm greedily expands natural communities of seeds until the whole graph is covered. The hierarchy of communities is obtained analytically by calculating resolution levels at which communities grow rather than numerically by testing different resolution levels. This analytic procedure is not only more exact than its numerical alternatives such as LFM and GCE but also much faster. Critical resolution levels can be identified by searching for intervals in which large changes of the resolution do not lead to growth of communities. We tested our algorithm on benchmark graphs and on a network of 492 papers in information science. Combined with a specific post-processing, the algorithm gives much more precise results on LFR benchmarks with high overlap compared to other algorithms and performs very similarly to GCE.

  17. Large-scale simulations of plastic neural networks on neuromorphic hardware

    Directory of Open Access Journals (Sweden)

    James Courtney Knight

    2016-04-01

    Full Text Available SpiNNaker is a digital, neuromorphic architecture designed for simulating large-scale spiking neural networks at speeds close to biological real-time. Rather than using bespoke analog or digital hardware, the basic computational unit of a SpiNNaker system is a general-purpose ARM processor, allowing it to be programmed to simulate a wide variety of neuron and synapse models. This flexibility is particularly valuable in the study of biological plasticity phenomena. A recently proposed learning rule based on the Bayesian Confidence Propagation Neural Network (BCPNN paradigm offers a generic framework for modeling the interaction of different plasticity mechanisms using spiking neurons. However, it can be computationally expensive to simulate large networks with BCPNN learning since it requires multiple state variables for each synapse, each of which needs to be updated every simulation time-step. We discuss the trade-offs in efficiency and accuracy involved in developing an event-based BCPNN implementation for SpiNNaker based on an analytical solution to the BCPNN equations, and detail the steps taken to fit this within the limited computational and memory resources of the SpiNNaker architecture. We demonstrate this learning rule by learning temporal sequences of neural activity within a recurrent attractor network which we simulate at scales of up to 20000 neurons and 51200000 plastic synapses: the largest plastic neural network ever to be simulated on neuromorphic hardware. We also run a comparable simulation on a Cray XC-30 supercomputer system and find that, if it is to match the run-time of our SpiNNaker simulation, the super computer system uses approximately more power. This suggests that cheaper, more power efficient neuromorphic systems are becoming useful discovery tools in the study of plasticity in large-scale brain models.

  18. Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xing Li

    2015-07-01

    Full Text Available With the rapid development of wireless communication technology, sensor technology, information acquisition and processing technology, sensor networks will finally have a deep influence on all aspects of people’s lives. The battery resources of sensor nodes should be managed efficiently in order to prolong network lifetime in large-scale wireless sensor networks (LWSNs. Data aggregation represents an important method to remove redundancy as well as unnecessary data transmission and hence cut down the energy used in communication. As sensor nodes are deployed in hostile environments, the security of the sensitive information such as confidentiality and integrity should be considered. This paper proposes Fully homomorphic Encryption based Secure data Aggregation (FESA in LWSNs which can protect end-to-end data confidentiality and support arbitrary aggregation operations over encrypted data. In addition, by utilizing message authentication codes (MACs, this scheme can also verify data integrity during data aggregation and forwarding processes so that false data can be detected as early as possible. Although the FHE increase the computation overhead due to its large public key size, simulation results show that it is implementable in LWSNs and performs well. Compared with other protocols, the transmitted data and network overhead are reduced in our scheme.

  19. A Self-Organizing Spatial Clustering Approach to Support Large-Scale Network RTK Systems.

    Science.gov (United States)

    Shen, Lili; Guo, Jiming; Wang, Lei

    2018-06-06

    The network real-time kinematic (RTK) technique can provide centimeter-level real time positioning solutions and play a key role in geo-spatial infrastructure. With ever-increasing popularity, network RTK systems will face issues in the support of large numbers of concurrent users. In the past, high-precision positioning services were oriented towards professionals and only supported a few concurrent users. Currently, precise positioning provides a spatial foundation for artificial intelligence (AI), and countless smart devices (autonomous cars, unmanned aerial-vehicles (UAVs), robotic equipment, etc.) require precise positioning services. Therefore, the development of approaches to support large-scale network RTK systems is urgent. In this study, we proposed a self-organizing spatial clustering (SOSC) approach which automatically clusters online users to reduce the computational load on the network RTK system server side. The experimental results indicate that both the SOSC algorithm and the grid algorithm can reduce the computational load efficiently, while the SOSC algorithm gives a more elastic and adaptive clustering solution with different datasets. The SOSC algorithm determines the cluster number and the mean distance to cluster center (MDTCC) according to the data set, while the grid approaches are all predefined. The side-effects of clustering algorithms on the user side are analyzed with real global navigation satellite system (GNSS) data sets. The experimental results indicate that 10 km can be safely used as the cluster radius threshold for the SOSC algorithm without significantly reducing the positioning precision and reliability on the user side.

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

    Directory of Open Access Journals (Sweden)

    Lorenzo L. Pesce

    2013-01-01

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

  1. Large-Scale Brain Network Coupling Predicts Total Sleep Deprivation Effects on Cognitive Capacity.

    Directory of Open Access Journals (Sweden)

    Yu Lei

    Full Text Available Interactions between large-scale brain networks have received most attention in the study of cognitive dysfunction of human brain. In this paper, we aimed to test the hypothesis that the coupling strength of large-scale brain networks will reflect the pressure for sleep and will predict cognitive performance, referred to as sleep pressure index (SPI. Fourteen healthy subjects underwent this within-subject functional magnetic resonance imaging (fMRI study during rested wakefulness (RW and after 36 h of total sleep deprivation (TSD. Self-reported scores of sleepiness were higher for TSD than for RW. A subsequent working memory (WM task showed that WM performance was lower after 36 h of TSD. Moreover, SPI was developed based on the coupling strength of salience network (SN and default mode network (DMN. Significant increase of SPI was observed after 36 h of TSD, suggesting stronger pressure for sleep. In addition, SPI was significantly correlated with both the visual analogue scale score of sleepiness and the WM performance. These results showed that alterations in SN-DMN coupling might be critical in cognitive alterations that underlie the lapse after TSD. Further studies may validate the SPI as a potential clinical biomarker to assess the impact of sleep deprivation.

  2. Large-scale modeling of epileptic seizures: scaling properties of two parallel neuronal network simulation algorithms.

    Science.gov (United States)

    Pesce, Lorenzo L; Lee, Hyong C; Hereld, Mark; Visser, Sid; Stevens, Rick L; Wildeman, Albert; van Drongelen, Wim

    2013-01-01

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

  3. Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks.

    Science.gov (United States)

    Li, Xing; Chen, Dexin; Li, Chunyan; Wang, Liangmin

    2015-07-03

    With the rapid development of wireless communication technology, sensor technology, information acquisition and processing technology, sensor networks will finally have a deep influence on all aspects of people's lives. The battery resources of sensor nodes should be managed efficiently in order to prolong network lifetime in large-scale wireless sensor networks (LWSNs). Data aggregation represents an important method to remove redundancy as well as unnecessary data transmission and hence cut down the energy used in communication. As sensor nodes are deployed in hostile environments, the security of the sensitive information such as confidentiality and integrity should be considered. This paper proposes Fully homomorphic Encryption based Secure data Aggregation (FESA) in LWSNs which can protect end-to-end data confidentiality and support arbitrary aggregation operations over encrypted data. In addition, by utilizing message authentication codes (MACs), this scheme can also verify data integrity during data aggregation and forwarding processes so that false data can be detected as early as possible. Although the FHE increase the computation overhead due to its large public key size, simulation results show that it is implementable in LWSNs and performs well. Compared with other protocols, the transmitted data and network overhead are reduced in our scheme.

  4. Microarray Data Processing Techniques for Genome-Scale Network Inference from Large Public Repositories.

    Science.gov (United States)

    Chockalingam, Sriram; Aluru, Maneesha; Aluru, Srinivas

    2016-09-19

    Pre-processing of microarray data is a well-studied problem. Furthermore, all popular platforms come with their own recommended best practices for differential analysis of genes. However, for genome-scale network inference using microarray data collected from large public repositories, these methods filter out a considerable number of genes. This is primarily due to the effects of aggregating a diverse array of experiments with different technical and biological scenarios. Here we introduce a pre-processing pipeline suitable for inferring genome-scale gene networks from large microarray datasets. We show that partitioning of the available microarray datasets according to biological relevance into tissue- and process-specific categories significantly extends the limits of downstream network construction. We demonstrate the effectiveness of our pre-processing pipeline by inferring genome-scale networks for the model plant Arabidopsis thaliana using two different construction methods and a collection of 11,760 Affymetrix ATH1 microarray chips. Our pre-processing pipeline and the datasets used in this paper are made available at http://alurulab.cc.gatech.edu/microarray-pp.

  5. APPLICATION OF UKRAINIAN GRID INFRASTRUCTURE FOR INVESTIGATION OF NONLINEAR DYNAMICS IN LARGE NEURONAL NETWORKS

    Directory of Open Access Journals (Sweden)

    O. О. Sudakov

    2015-12-01

    Full Text Available In present work the Ukrainian National Grid (UNG infrastructure was applied for investigation of synchronization in large networks of interacting neurons. This application is important for solving of modern neuroscience problems related to mechanisms of nervous system activities (memory, cognition etc. and nervous pathologies (epilepsy, Parkinsonism, etc.. Modern non-linear dynamics theories and applications provides powerful basis for computer simulations of biological neuronal networks and investigation of phenomena which mechanisms hardly could be clarified by other approaches. Cubic millimeter of brain tissue contains about 105 neurons, so realistic (Hodgkin-Huxley model and phenomenological (Kuramoto-Sakaguchi, FitzHugh-Nagumo, etc. models simulations require consideration of large neurons numbers.

  6. Exact computation and large angular momentum asymptotics of 3nj symbols: Semiclassical disentangling of spin networks

    International Nuclear Information System (INIS)

    Anderson, Roger W.; Aquilanti, Vincenzo; Silva Ferreira, Cristiane da

    2008-01-01

    Spin networks, namely, the 3nj symbols of quantum angular momentum theory and their generalizations to groups other than SU(2) and to quantum groups, permeate many areas of pure and applied science. The issues of their computation and characterization for large values of their entries are a challenge for diverse fields, such as spectroscopy and quantum chemistry, molecular and condensed matter physics, quantum computing, and the geometry of space time. Here we record progress both in their efficient calculation and in the study of the large j asymptotics. For the 9j symbol, a prototypical entangled network, we present and extensively check numerically formulas that illustrate the passage to the semiclassical limit, manifesting both the occurrence of disentangling and the discrete-continuum transition.

  7. Application of neural networks to software quality modeling of a very large telecommunications system.

    Science.gov (United States)

    Khoshgoftaar, T M; Allen, E B; Hudepohl, J P; Aud, S J

    1997-01-01

    Society relies on telecommunications to such an extent that telecommunications software must have high reliability. Enhanced measurement for early risk assessment of latent defects (EMERALD) is a joint project of Nortel and Bell Canada for improving the reliability of telecommunications software products. This paper reports a case study of neural-network modeling techniques developed for the EMERALD system. The resulting neural network is currently in the prototype testing phase at Nortel. Neural-network models can be used to identify fault-prone modules for extra attention early in development, and thus reduce the risk of operational problems with those modules. We modeled a subset of modules representing over seven million lines of code from a very large telecommunications software system. The set consisted of those modules reused with changes from the previous release. The dependent variable was membership in the class of fault-prone modules. The independent variables were principal components of nine measures of software design attributes. We compared the neural-network model with a nonparametric discriminant model and found the neural-network model had better predictive accuracy.

  8. Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Swami Ananthram

    2007-01-01

    Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

  9. A Very Large Area Network (VLAN) knowledge-base applied to space communication problems

    Science.gov (United States)

    Zander, Carol S.

    1988-01-01

    This paper first describes a hierarchical model for very large area networks (VLAN). Space communication problems whose solution could profit by the model are discussed and then an enhanced version of this model incorporating the knowledge needed for the missile detection-destruction problem is presented. A satellite network or VLAN is a network which includes at least one satellite. Due to the complexity, a compromise between fully centralized and fully distributed network management has been adopted. Network nodes are assigned to a physically localized group, called a partition. Partitions consist of groups of cell nodes with one cell node acting as the organizer or master, called the Group Master (GM). Coordinating the group masters is a Partition Master (PM). Knowledge is also distributed hierarchically existing in at least two nodes. Each satellite node has a back-up earth node. Knowledge must be distributed in such a way so as to minimize information loss when a node fails. Thus the model is hierarchical both physically and informationally.

  10. Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ananthram Swami

    2007-12-01

    Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

  11. Tradeoffs between quality-of-control and quality-of-service in large-scale nonlinear networked control systems

    NARCIS (Netherlands)

    Borgers, D. P.; Geiselhart, R.; Heemels, W. P. M. H.

    2017-01-01

    In this paper we study input-to-state stability (ISS) of large-scale networked control systems (NCSs) in which sensors, controllers and actuators are connected via multiple (local) communication networks which operate asynchronously and independently of each other. We model the large-scale NCS as an

  12. Memory Transmission in Small Groups and Large Networks: An Agent-Based Model.

    Science.gov (United States)

    Luhmann, Christian C; Rajaram, Suparna

    2015-12-01

    The spread of social influence in large social networks has long been an interest of social scientists. In the domain of memory, collaborative memory experiments have illuminated cognitive mechanisms that allow information to be transmitted between interacting individuals, but these experiments have focused on small-scale social contexts. In the current study, we took a computational approach, circumventing the practical constraints of laboratory paradigms and providing novel results at scales unreachable by laboratory methodologies. Our model embodied theoretical knowledge derived from small-group experiments and replicated foundational results regarding collaborative inhibition and memory convergence in small groups. Ultimately, we investigated large-scale, realistic social networks and found that agents are influenced by the agents with which they interact, but we also found that agents are influenced by nonneighbors (i.e., the neighbors of their neighbors). The similarity between these results and the reports of behavioral transmission in large networks offers a major theoretical insight by linking behavioral transmission to the spread of information. © The Author(s) 2015.

  13. A hydrogeomorphic river network model predicts where and why hyporheic exchange is important in large basins

    Science.gov (United States)

    Gomez-Velez, Jesus D.; Harvey, Judson W.

    2014-09-01

    Hyporheic exchange has been hypothesized to have basin-scale consequences; however, predictions throughout river networks are limited by available geomorphic and hydrogeologic data and by models that can analyze and aggregate hyporheic exchange flows across large spatial scales. We developed a parsimonious but physically based model of hyporheic flow for application in large river basins: Networks with EXchange and Subsurface Storage (NEXSS). We applied NEXSS across a broad range of geomorphic diversity in river reaches and synthetic river networks. NEXSS demonstrates that vertical exchange beneath submerged bed forms rather than lateral exchange through meanders dominates hyporheic fluxes and turnover rates along river corridors. Per kilometer, low-order streams have a biogeochemical potential at least 2 orders of magnitude larger than higher-order streams. However, when biogeochemical potential is examined per average length of each stream order, low- and high-order streams were often found to be comparable. As a result, the hyporheic zone's intrinsic potential for biogeochemical transformations is comparable across different stream orders, but the greater river miles and larger total streambed area of lower order streams result in the highest cumulative impact from low-order streams. Lateral exchange through meander banks may be important in some cases but generally only in large rivers.

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

    Directory of Open Access Journals (Sweden)

    H. Poor

    2008-04-01

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

  15. Large-scale transportation network congestion evolution prediction using deep learning theory.

    Science.gov (United States)

    Ma, Xiaolei; Yu, Haiyang; Wang, Yunpeng; Wang, Yinhai

    2015-01-01

    Understanding how congestion at one location can cause ripples throughout large-scale transportation network is vital for transportation researchers and practitioners to pinpoint traffic bottlenecks for congestion mitigation. Traditional studies rely on either mathematical equations or simulation techniques to model traffic congestion dynamics. However, most of the approaches have limitations, largely due to unrealistic assumptions and cumbersome parameter calibration process. With the development of Intelligent Transportation Systems (ITS) and Internet of Things (IoT), transportation data become more and more ubiquitous. This triggers a series of data-driven research to investigate transportation phenomena. Among them, deep learning theory is considered one of the most promising techniques to tackle tremendous high-dimensional data. This study attempts to extend deep learning theory into large-scale transportation network analysis. A deep Restricted Boltzmann Machine and Recurrent Neural Network architecture is utilized to model and predict traffic congestion evolution based on Global Positioning System (GPS) data from taxi. A numerical study in Ningbo, China is conducted to validate the effectiveness and efficiency of the proposed method. Results show that the prediction accuracy can achieve as high as 88% within less than 6 minutes when the model is implemented in a Graphic Processing Unit (GPU)-based parallel computing environment. The predicted congestion evolution patterns can be visualized temporally and spatially through a map-based platform to identify the vulnerable links for proactive congestion mitigation.

  16. Large-scale transportation network congestion evolution prediction using deep learning theory.

    Directory of Open Access Journals (Sweden)

    Xiaolei Ma

    Full Text Available Understanding how congestion at one location can cause ripples throughout large-scale transportation network is vital for transportation researchers and practitioners to pinpoint traffic bottlenecks for congestion mitigation. Traditional studies rely on either mathematical equations or simulation techniques to model traffic congestion dynamics. However, most of the approaches have limitations, largely due to unrealistic assumptions and cumbersome parameter calibration process. With the development of Intelligent Transportation Systems (ITS and Internet of Things (IoT, transportation data become more and more ubiquitous. This triggers a series of data-driven research to investigate transportation phenomena. Among them, deep learning theory is considered one of the most promising techniques to tackle tremendous high-dimensional data. This study attempts to extend deep learning theory into large-scale transportation network analysis. A deep Restricted Boltzmann Machine and Recurrent Neural Network architecture is utilized to model and predict traffic congestion evolution based on Global Positioning System (GPS data from taxi. A numerical study in Ningbo, China is conducted to validate the effectiveness and efficiency of the proposed method. Results show that the prediction accuracy can achieve as high as 88% within less than 6 minutes when the model is implemented in a Graphic Processing Unit (GPU-based parallel computing environment. The predicted congestion evolution patterns can be visualized temporally and spatially through a map-based platform to identify the vulnerable links for proactive congestion mitigation.

  17. A hydrogeomorphic river network model predicts where and why hyporheic exchange is important in large basins

    Science.gov (United States)

    Gomez-Velez, Jesus D.; Harvey, Judson

    2014-01-01

    Hyporheic exchange has been hypothesized to have basin-scale consequences; however, predictions throughout river networks are limited by available geomorphic and hydrogeologic data and by models that can analyze and aggregate hyporheic exchange flows across large spatial scales. We developed a parsimonious but physically based model of hyporheic flow for application in large river basins: Networks with EXchange and Subsurface Storage (NEXSS). We applied NEXSS across a broad range of geomorphic diversity in river reaches and synthetic river networks. NEXSS demonstrates that vertical exchange beneath submerged bed forms rather than lateral exchange through meanders dominates hyporheic fluxes and turnover rates along river corridors. Per kilometer, low-order streams have a biogeochemical potential at least 2 orders of magnitude larger than higher-order streams. However, when biogeochemical potential is examined per average length of each stream order, low- and high-order streams were often found to be comparable. As a result, the hyporheic zone's intrinsic potential for biogeochemical transformations is comparable across different stream orders, but the greater river miles and larger total streambed area of lower order streams result in the highest cumulative impact from low-order streams. Lateral exchange through meander banks may be important in some cases but generally only in large rivers.

  18. A robust and high-performance queue management controller for large round trip time networks

    Science.gov (United States)

    Khoshnevisan, Ladan; Salmasi, Farzad R.

    2016-05-01

    Congestion management for transmission control protocol is of utmost importance to prevent packet loss within a network. This necessitates strategies for active queue management. The most applied active queue management strategies have their inherent disadvantages which lead to suboptimal performance and even instability in the case of large round trip time and/or external disturbance. This paper presents an internal model control robust queue management scheme with two degrees of freedom in order to restrict the undesired effects of large and small round trip time and parameter variations in the queue management. Conventional approaches such as proportional integral and random early detection procedures lead to unstable behaviour due to large delay. Moreover, internal model control-Smith scheme suffers from large oscillations due to the large round trip time. On the other hand, other schemes such as internal model control-proportional integral and derivative show excessive sluggish performance for small round trip time values. To overcome these shortcomings, we introduce a system entailing two individual controllers for queue management and disturbance rejection, simultaneously. Simulation results based on Matlab/Simulink and also Network Simulator 2 (NS2) demonstrate the effectiveness of the procedure and verify the analytical approach.

  19. Large-scale changes in network interactions as a physiological signature of spatial neglect.

    Science.gov (United States)

    Baldassarre, Antonello; Ramsey, Lenny; Hacker, Carl L; Callejas, Alicia; Astafiev, Serguei V; Metcalf, Nicholas V; Zinn, Kristi; Rengachary, Jennifer; Snyder, Abraham Z; Carter, Alex R; Shulman, Gordon L; Corbetta, Maurizio

    2014-12-01

    The relationship between spontaneous brain activity and behaviour following focal injury is not well understood. Here, we report a large-scale study of resting state functional connectivity MRI and spatial neglect following stroke in a large (n=84) heterogeneous sample of first-ever stroke patients (within 1-2 weeks). Spatial neglect, which is typically more severe after right than left hemisphere injury, includes deficits of spatial attention and motor actions contralateral to the lesion, and low general attention due to impaired vigilance/arousal. Patients underwent structural and resting state functional MRI scans, and spatial neglect was measured using the Posner spatial cueing task, and Mesulam and Behavioural Inattention Test cancellation tests. A principal component analysis of the behavioural tests revealed a main factor accounting for 34% of variance that captured three correlated behavioural deficits: visual neglect of the contralesional visual field, visuomotor neglect of the contralesional field, and low overall performance. In an independent sample (21 healthy subjects), we defined 10 resting state networks consisting of 169 brain regions: visual-fovea and visual-periphery, sensory-motor, auditory, dorsal attention, ventral attention, language, fronto-parietal control, cingulo-opercular control, and default mode. We correlated the neglect factor score with the strength of resting state functional connectivity within and across the 10 resting state networks. All damaged brain voxels were removed from the functional connectivity:behaviour correlational analysis. We found that the correlated behavioural deficits summarized by the factor score were associated with correlated multi-network patterns of abnormal functional connectivity involving large swaths of cortex. Specifically, dorsal attention and sensory-motor networks showed: (i) reduced interhemispheric functional connectivity; (ii) reduced anti-correlation with fronto-parietal and default mode

  20. Constant load supports attenuating shocks and vibrations for networks of pipes submitted to large thermal dilatation

    International Nuclear Information System (INIS)

    Prisecaru, Ilie; Panait; Adrian; Serban, Viorel; Ciocan, George; Androne, Marian; Florea, Ioana; State, Elena

    2004-01-01

    Full text: To avoid some drawbacks in the classical supports employed currently in networks of pipes it was conceived, designed, built and experimentally tested a new type of constant load supports which attenuate largely the shocks and vibrations for networks of pipes subjected to large thermal dilatation. These supports are particularly needed for solving the severe problems of the vibrations in networks of pipes in thermoelectric stations, nuclear power plants, or heavy water production plants. These supports allow building networks of new types, more reliable and of lower cost. The new type of support was developed on the basis of a number of patents protected by OSIM. It has a simple structure, ensures a secure functioning without blocking or other kinds of failures and is resistant to a very large variety of stresses. The new type of support of constant load avoids the drawbacks in classical supports i.e. the stress/deformation diagram is practically independent of stress level. The characteristic of the support is geometrically non-linear and presents a plateau with a small slope over a rather large deformation range which results from a serially mounted structure of sandwiches the deformation of which is controlled by a system of deforming central and peripheral pieces. The new supports of constant load, called SERB-PIPE, present a controlled elasticity and a high degree of damping as the package of elastic blades (the sandwich structure) is made of two sub-packages with relative movements what ensure the attenuation of the shocks and vibrations produced by the fluid flow within the pipes and or by seismic motions. By contrast with classical supports, the new supports have a simple structure and a high reliability. Breakdown under stress leading to severe changes in the stress distribution in pipe networks, which could generate overloads in pipes and over-loading in other supports, cannot occur. One can also mention that these supports can be built in a

  1. BFL: a node and edge betweenness based fast layout algorithm for large scale networks

    Science.gov (United States)

    Hashimoto, Tatsunori B; Nagasaki, Masao; Kojima, Kaname; Miyano, Satoru

    2009-01-01

    Background Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e.g. more than 10000 elements. Results To overcome these problems, we propose the use of a biologically important graph metric, betweenness, a measure of network flow. This metric is highly correlated with many biological phenomena such as lethality and clusters. We devise a new fast parallel algorithm calculating betweenness to minimize the preprocessing cost. Using this metric, we also invent a node and edge betweenness based fast layout algorithm (BFL). BFL places the high-betweenness nodes to optimal positions and allows the low-betweenness nodes to reach suboptimal positions. Furthermore, BFL reduces the runtime by combining a sequential insertion algorim with betweenness. For a graph with n nodes, this approach reduces the expected runtime of the algorithm to O(n2) when considering edge crossings, and to O(n log n) when considering only density and edge lengths. Conclusion Our BFL algorithm is compared against fast graph layout algorithms and approaches requiring intensive optimizations. For gene networks, we show that our algorithm is faster than all layout algorithms tested while providing readability on par with intensive optimization algorithms. We achieve a 1.4 second runtime for a graph with 4000 nodes and 12000 edges on a standard desktop computer. PMID:19146673

  2. Cardinality Estimation Algorithm in Large-Scale Anonymous Wireless Sensor Networks

    KAUST Repository

    Douik, Ahmed

    2017-08-30

    Consider a large-scale anonymous wireless sensor network with unknown cardinality. In such graphs, each node has no information about the network topology and only possesses a unique identifier. This paper introduces a novel distributed algorithm for cardinality estimation and topology discovery, i.e., estimating the number of node and structure of the graph, by querying a small number of nodes and performing statistical inference methods. While the cardinality estimation allows the design of more efficient coding schemes for the network, the topology discovery provides a reliable way for routing packets. The proposed algorithm is shown to produce a cardinality estimate proportional to the best linear unbiased estimator for dense graphs and specific running times. Simulation results attest the theoretical results and reveal that, for a reasonable running time, querying a small group of nodes is sufficient to perform an estimation of 95% of the whole network. Applications of this work include estimating the number of Internet of Things (IoT) sensor devices, online social users, active protein cells, etc.

  3. Soft network materials with isotropic negative Poisson's ratios over large strains.

    Science.gov (United States)

    Liu, Jianxing; Zhang, Yihui

    2018-01-31

    Auxetic materials with negative Poisson's ratios have important applications across a broad range of engineering areas, such as biomedical devices, aerospace engineering and automotive engineering. A variety of design strategies have been developed to achieve artificial auxetic materials with controllable responses in the Poisson's ratio. The development of designs that can offer isotropic negative Poisson's ratios over large strains can open up new opportunities in emerging biomedical applications, which, however, remains a challenge. Here, we introduce deterministic routes to soft architected materials that can be tailored precisely to yield the values of Poisson's ratio in the range from -1 to 1, in an isotropic manner, with a tunable strain range from 0% to ∼90%. The designs rely on a network construction in a periodic lattice topology, which incorporates zigzag microstructures as building blocks to connect lattice nodes. Combined experimental and theoretical studies on broad classes of network topologies illustrate the wide-ranging utility of these concepts. Quantitative mechanics modeling under both infinitesimal and finite deformations allows the development of a rigorous design algorithm that determines the necessary network geometries to yield target Poisson ratios over desired strain ranges. Demonstrative examples in artificial skin with both the negative Poisson's ratio and the nonlinear stress-strain curve precisely matching those of the cat's skin and in unusual cylindrical structures with engineered Poisson effect and shape memory effect suggest potential applications of these network materials.

  4. A large scale code resolution service network in the Internet of Things.

    Science.gov (United States)

    Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan

    2012-11-07

    In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT’s advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS.

  5. A Large Scale Code Resolution Service Network in the Internet of Things

    Directory of Open Access Journals (Sweden)

    Xiangzhan Yu

    2012-11-01

    Full Text Available In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT’s advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS.

  6. A Large Scale Code Resolution Service Network in the Internet of Things

    Science.gov (United States)

    Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan

    2012-01-01

    In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT's advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS. PMID:23202207

  7. Convolutional neural networks for transient candidate vetting in large-scale surveys

    Science.gov (United States)

    Gieseke, Fabian; Bloemen, Steven; van den Bogaard, Cas; Heskes, Tom; Kindler, Jonas; Scalzo, Richard A.; Ribeiro, Valério A. R. M.; van Roestel, Jan; Groot, Paul J.; Yuan, Fang; Möller, Anais; Tucker, Brad E.

    2017-12-01

    Current synoptic sky surveys monitor large areas of the sky to find variable and transient astronomical sources. As the number of detections per night at a single telescope easily exceeds several thousand, current detection pipelines make intensive use of machine learning algorithms to classify the detected objects and to filter out the most interesting candidates. A number of upcoming surveys will produce up to three orders of magnitude more data, which renders high-precision classification systems essential to reduce the manual and, hence, expensive vetting by human experts. We present an approach based on convolutional neural networks to discriminate between true astrophysical sources and artefacts in reference-subtracted optical images. We show that relatively simple networks are already competitive with state-of-the-art systems and that their quality can further be improved via slightly deeper networks and additional pre-processing steps - eventually yielding models outperforming state-of-the-art systems. In particular, our best model correctly classifies about 97.3 per cent of all 'real' and 99.7 per cent of all 'bogus' instances on a test set containing 1942 'bogus' and 227 'real' instances in total. Furthermore, the networks considered in this work can also successfully classify these objects at hand without relying on difference images, which might pave the way for future detection pipelines not containing image subtraction steps at all.

  8. Large-scale modeling of condition-specific gene regulatory networks by information integration and inference.

    Science.gov (United States)

    Ellwanger, Daniel Christian; Leonhardt, Jörn Florian; Mewes, Hans-Werner

    2014-12-01

    Understanding how regulatory networks globally coordinate the response of a cell to changing conditions, such as perturbations by shifting environments, is an elementary challenge in systems biology which has yet to be met. Genome-wide gene expression measurements are high dimensional as these are reflecting the condition-specific interplay of thousands of cellular components. The integration of prior biological knowledge into the modeling process of systems-wide gene regulation enables the large-scale interpretation of gene expression signals in the context of known regulatory relations. We developed COGERE (http://mips.helmholtz-muenchen.de/cogere), a method for the inference of condition-specific gene regulatory networks in human and mouse. We integrated existing knowledge of regulatory interactions from multiple sources to a comprehensive model of prior information. COGERE infers condition-specific regulation by evaluating the mutual dependency between regulator (transcription factor or miRNA) and target gene expression using prior information. This dependency is scored by the non-parametric, nonlinear correlation coefficient η(2) (eta squared) that is derived by a two-way analysis of variance. We show that COGERE significantly outperforms alternative methods in predicting condition-specific gene regulatory networks on simulated data sets. Furthermore, by inferring the cancer-specific gene regulatory network from the NCI-60 expression study, we demonstrate the utility of COGERE to promote hypothesis-driven clinical research. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

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

    Science.gov (United States)

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

    2012-09-15

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

  10. A large scale analysis of information-theoretic network complexity measures using chemical structures.

    Directory of Open Access Journals (Sweden)

    Matthias Dehmer

    Full Text Available This paper aims to investigate information-theoretic network complexity measures which have already been intensely used in mathematical- and medicinal chemistry including drug design. Numerous such measures have been developed so far but many of them lack a meaningful interpretation, e.g., we want to examine which kind of structural information they detect. Therefore, our main contribution is to shed light on the relatedness between some selected information measures for graphs by performing a large scale analysis using chemical networks. Starting from several sets containing real and synthetic chemical structures represented by graphs, we study the relatedness between a classical (partition-based complexity measure called the topological information content of a graph and some others inferred by a different paradigm leading to partition-independent measures. Moreover, we evaluate the uniqueness of network complexity measures numerically. Generally, a high uniqueness is an important and desirable property when designing novel topological descriptors having the potential to be applied to large chemical databases.

  11. On the rejection-based algorithm for simulation and analysis of large-scale reaction networks

    Energy Technology Data Exchange (ETDEWEB)

    Thanh, Vo Hong, E-mail: vo@cosbi.eu [The Microsoft Research-University of Trento Centre for Computational and Systems Biology, Piazza Manifattura 1, Rovereto 38068 (Italy); Zunino, Roberto, E-mail: roberto.zunino@unitn.it [Department of Mathematics, University of Trento, Trento (Italy); Priami, Corrado, E-mail: priami@cosbi.eu [The Microsoft Research-University of Trento Centre for Computational and Systems Biology, Piazza Manifattura 1, Rovereto 38068 (Italy); Department of Mathematics, University of Trento, Trento (Italy)

    2015-06-28

    Stochastic simulation for in silico studies of large biochemical networks requires a great amount of computational time. We recently proposed a new exact simulation algorithm, called the rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)], to improve simulation performance by postponing and collapsing as much as possible the propensity updates. In this paper, we analyze the performance of this algorithm in detail, and improve it for simulating large-scale biochemical reaction networks. We also present a new algorithm, called simultaneous RSSA (SRSSA), which generates many independent trajectories simultaneously for the analysis of the biochemical behavior. SRSSA improves simulation performance by utilizing a single data structure across simulations to select reaction firings and forming trajectories. The memory requirement for building and storing the data structure is thus independent of the number of trajectories. The updating of the data structure when needed is performed collectively in a single operation across the simulations. The trajectories generated by SRSSA are exact and independent of each other by exploiting the rejection-based mechanism. We test our new improvement on real biological systems with a wide range of reaction networks to demonstrate its applicability and efficiency.

  12. Direction of information flow in large-scale resting-state networks is frequency-dependent.

    Science.gov (United States)

    Hillebrand, Arjan; Tewarie, Prejaas; van Dellen, Edwin; Yu, Meichen; Carbo, Ellen W S; Douw, Linda; Gouw, Alida A; van Straaten, Elisabeth C W; Stam, Cornelis J

    2016-04-05

    Normal brain function requires interactions between spatially separated, and functionally specialized, macroscopic regions, yet the directionality of these interactions in large-scale functional networks is unknown. Magnetoencephalography was used to determine the directionality of these interactions, where directionality was inferred from time series of beamformer-reconstructed estimates of neuronal activation, using a recently proposed measure of phase transfer entropy. We observed well-organized posterior-to-anterior patterns of information flow in the higher-frequency bands (alpha1, alpha2, and beta band), dominated by regions in the visual cortex and posterior default mode network. Opposite patterns of anterior-to-posterior flow were found in the theta band, involving mainly regions in the frontal lobe that were sending information to a more distributed network. Many strong information senders in the theta band were also frequent receivers in the alpha2 band, and vice versa. Our results provide evidence that large-scale resting-state patterns of information flow in the human brain form frequency-dependent reentry loops that are dominated by flow from parieto-occipital cortex to integrative frontal areas in the higher-frequency bands, which is mirrored by a theta band anterior-to-posterior flow.

  13. Submarine canyons represent an essential habitat network for krill hotspots in a Large Marine Ecosystem.

    Science.gov (United States)

    Santora, Jarrod A; Zeno, Ramona; Dorman, Jeffrey G; Sydeman, William J

    2018-05-15

    Submarine canyon systems are ubiquitous features of marine ecosystems, known to support high levels of biodiversity. Canyons may be important to benthic-pelagic ecosystem coupling, but their role in concentrating plankton and structuring pelagic communities is not well known. We hypothesize that at the scale of a large marine ecosystem, canyons provide a critical habitat network, which maintain energy flow and trophic interactions. We evaluate canyon characteristics relative to the distribution and abundance of krill, critically important prey in the California Current Ecosystem. Using a geological database, we conducted a census of canyon locations, evaluated their dimensions, and quantified functional relationships with krill hotspots (i.e., sites of persistently elevated abundance) derived from hydro-acoustic surveys. We found that 76% of krill hotspots occurred within and adjacent to canyons. Most krill hotspots were associated with large shelf-incising canyons. Krill hotspots and canyon dimensions displayed similar coherence as a function of latitude and indicate a potential regional habitat network. The latitudinal migration of many fish, seabirds and mammals may be enhanced by using this canyon-krill network to maintain foraging opportunities. Biogeographic assessments and predictions of krill and krill-predator distributions under climate change may be improved by accounting for canyons in habitat models.

  14. Network connectivity paradigm for the large data produced by weather radar systems

    Science.gov (United States)

    Guenzi, Diego; Bechini, Renzo; Boraso, Rodolfo; Cremonini, Roberto; Fratianni, Simona

    2014-05-01

    The traffic over Internet is constantly increasing; this is due in particular to social networks activities but also to the enormous exchange of data caused especially by the so-called "Internet of Things". With this term we refer to every device that has the capability of exchanging information with other devices on the web. In geoscience (and, in particular, in meteorology and climatology) there is a constantly increasing number of sensors that are used to obtain data from different sources (like weather radars, digital rain gauges, etc.). This information-gathering activity, frequently, must be followed by a complex data analysis phase, especially when we have large data sets that can be very difficult to analyze (very long historical series of large data sets, for example), like the so called big data. These activities are particularly intensive in resource consumption and they lead to new computational models (like cloud computing) and new methods for storing data (like object store, linked open data, NOSQL or NewSQL). The weather radar systems can be seen as one of the sensors mentioned above: it transmit a large amount of raw data over the network (up to 40 megabytes every five minutes), with 24h/24h continuity and in any weather condition. Weather radar are often located in peaks and in wild areas where connectivity is poor. For this reason radar measurements are sometimes processed partially on site and reduced in size to adapt them to the limited bandwidth currently available by data transmission systems. With the aim to preserve the maximum flow of information, an innovative network connectivity paradigm for the large data produced by weather radar system is here presented. The study is focused on the Monte Settepani operational weather radar system, located over a wild peak summit in north-western Italy.

  15. The Effects of Topology on Throughput Capacity of Large Scale Wireless Networks

    Directory of Open Access Journals (Sweden)

    Qiuming Liu

    2017-03-01

    Full Text Available In this paper, we jointly consider the inhomogeneity and spatial dimension in large scale wireless networks. We study the effects of topology on the throughput capacity. This problem is inherently difficult since it is complex to handle the interference caused by simultaneous transmission. To solve this problem, we, according to the inhomogeneity of topology, divide the transmission into intra-cluster transmission and inter-cluster transmission. For the intra-cluster transmission, a spheroidal percolation model is constructed. The spheroidal percolation model guarantees a constant rate when a power control strategy is adopted. We also propose a cube percolation mode for the inter-cluster transmission. Different from the spheroidal percolation model, a constant transmission rate can be achieved without power control. For both transmissions, we propose a routing scheme with five phases. By comparing the achievable rate of each phase, we get the rate bottleneck, which is the throughput capacity of the network.

  16. Global asymptotic stabilization of large-scale hydraulic networks using positive proportional controls

    DEFF Research Database (Denmark)

    Jensen, Tom Nørgaard; Wisniewski, Rafal

    2014-01-01

    An industrial case study involving a large-scale hydraulic network underlying a district heating system subject to structural changes is considered. The problem of controlling the pressure drop across the so-called end-user valves in the network to a designated vector of reference values under...... directional actuator constraints is addressed. The proposed solution consists of a set of decentralized positively constrained proportional control actions. The results show that the closed-loop system always has a globally asymptotically stable equilibrium point independently on the number of end......-users. Furthermore, by a proper design of controller gains the closed-loop equilibrium point can be designed to belong to an arbitrarily small neighborhood of the desired equilibrium point. Since there exists a globally asymptotically stable equilibrium point independently on the number of end-users in the system...

  17. Differences between child and adult large-scale functional brain networks for reading tasks.

    Science.gov (United States)

    Liu, Xin; Gao, Yue; Di, Qiqi; Hu, Jiali; Lu, Chunming; Nan, Yun; Booth, James R; Liu, Li

    2018-02-01

    Reading is an important high-level cognitive function of the human brain, requiring interaction among multiple brain regions. Revealing differences between children's large-scale functional brain networks for reading tasks and those of adults helps us to understand how the functional network changes over reading development. Here we used functional magnetic resonance imaging data of 17 adults (19-28 years old) and 16 children (11-13 years old), and graph theoretical analyses to investigate age-related changes in large-scale functional networks during rhyming and meaning judgment tasks on pairs of visually presented Chinese characters. We found that: (1) adults had stronger inter-regional connectivity and nodal degree in occipital regions, while children had stronger inter-regional connectivity in temporal regions, suggesting that adults rely more on visual orthographic processing whereas children rely more on auditory phonological processing during reading. (2) Only adults showed between-task differences in inter-regional connectivity and nodal degree, whereas children showed no task differences, suggesting the topological organization of adults' reading network is more specialized. (3) Children showed greater inter-regional connectivity and nodal degree than adults in multiple subcortical regions; the hubs in children were more distributed in subcortical regions while the hubs in adults were more distributed in cortical regions. These findings suggest that reading development is manifested by a shift from reliance on subcortical to cortical regions. Taken together, our study suggests that Chinese reading development is supported by developmental changes in brain connectivity properties, and some of these changes may be domain-general while others may be specific to the reading domain. © 2017 Wiley Periodicals, Inc.

  18. A Self-Organizing Spatial Clustering Approach to Support Large-Scale Network RTK Systems

    Directory of Open Access Journals (Sweden)

    Lili Shen

    2018-06-01

    Full Text Available The network real-time kinematic (RTK technique can provide centimeter-level real time positioning solutions and play a key role in geo-spatial infrastructure. With ever-increasing popularity, network RTK systems will face issues in the support of large numbers of concurrent users. In the past, high-precision positioning services were oriented towards professionals and only supported a few concurrent users. Currently, precise positioning provides a spatial foundation for artificial intelligence (AI, and countless smart devices (autonomous cars, unmanned aerial-vehicles (UAVs, robotic equipment, etc. require precise positioning services. Therefore, the development of approaches to support large-scale network RTK systems is urgent. In this study, we proposed a self-organizing spatial clustering (SOSC approach which automatically clusters online users to reduce the computational load on the network RTK system server side. The experimental results indicate that both the SOSC algorithm and the grid algorithm can reduce the computational load efficiently, while the SOSC algorithm gives a more elastic and adaptive clustering solution with different datasets. The SOSC algorithm determines the cluster number and the mean distance to cluster center (MDTCC according to the data set, while the grid approaches are all predefined. The side-effects of clustering algorithms on the user side are analyzed with real global navigation satellite system (GNSS data sets. The experimental results indicate that 10 km can be safely used as the cluster radius threshold for the SOSC algorithm without significantly reducing the positioning precision and reliability on the user side.

  19. Experimental demonstration of large capacity WSDM optical access network with multicore fibers and advanced modulation formats.

    Science.gov (United States)

    Li, Borui; Feng, Zhenhua; Tang, Ming; Xu, Zhilin; Fu, Songnian; Wu, Qiong; Deng, Lei; Tong, Weijun; Liu, Shuang; Shum, Perry Ping

    2015-05-04

    Towards the next generation optical access network supporting large capacity data transmission to enormous number of users covering a wider area, we proposed a hybrid wavelength-space division multiplexing (WSDM) optical access network architecture utilizing multicore fibers with advanced modulation formats. As a proof of concept, we experimentally demonstrated a WSDM optical access network with duplex transmission using our developed and fabricated multicore (7-core) fibers with 58.7km distance. As a cost-effective modulation scheme for access network, the optical OFDM-QPSK signal has been intensity modulated on the downstream transmission in the optical line terminal (OLT) and it was directly detected in the optical network unit (ONU) after MCF transmission. 10 wavelengths with 25GHz channel spacing from an optical comb generator are employed and each wavelength is loaded with 5Gb/s OFDM-QPSK signal. After amplification, power splitting, and fan-in multiplexer, 10-wavelength downstream signal was injected into six outer layer cores simultaneously and the aggregation downstream capacity reaches 300 Gb/s. -16 dBm sensitivity has been achieved for 3.8 × 10-3 bit error ratio (BER) with 7% Forward Error Correction (FEC) limit for all wavelengths in every core. Upstream signal from ONU side has also been generated and the bidirectional transmission in the same core causes negligible performance degradation to the downstream signal. As a universal platform for wired/wireless data access, our proposed architecture provides additional dimension for high speed mobile signal transmission and we hence demonstrated an upstream delivery of 20Gb/s per wavelength with QPSK modulation formats using the inner core of MCF emulating a mobile backhaul service. The IQ modulated data was coherently detected in the OLT side. -19 dBm sensitivity has been achieved under the FEC limit and more than 18 dB power budget is guaranteed.

  20. Implementation of Cyberinfrastructure and Data Management Workflow for a Large-Scale Sensor Network

    Science.gov (United States)

    Jones, A. S.; Horsburgh, J. S.

    2014-12-01

    Monitoring with in situ environmental sensors and other forms of field-based observation presents many challenges for data management, particularly for large-scale networks consisting of multiple sites, sensors, and personnel. The availability and utility of these data in addressing scientific questions relies on effective cyberinfrastructure that facilitates transformation of raw sensor data into functional data products. It also depends on the ability of researchers to share and access the data in useable formats. In addition to addressing the challenges presented by the quantity of data, monitoring networks need practices to ensure high data quality, including procedures and tools for post processing. Data quality is further enhanced if practitioners are able to track equipment, deployments, calibrations, and other events related to site maintenance and associate these details with observational data. In this presentation we will describe the overall workflow that we have developed for research groups and sites conducting long term monitoring using in situ sensors. Features of the workflow include: software tools to automate the transfer of data from field sites to databases, a Python-based program for data quality control post-processing, a web-based application for online discovery and visualization of data, and a data model and web interface for managing physical infrastructure. By automating the data management workflow, the time from collection to analysis is reduced and sharing and publication is facilitated. The incorporation of metadata standards and descriptions and the use of open-source tools enhances the sustainability and reusability of the data. We will describe the workflow and tools that we have developed in the context of the iUTAH (innovative Urban Transitions and Aridregion Hydrosustainability) monitoring network. The iUTAH network consists of aquatic and climate sensors deployed in three watersheds to monitor Gradients Along Mountain to Urban

  1. Word-Length Correlations and Memory in Large Texts: A Visibility Network Analysis

    Directory of Open Access Journals (Sweden)

    Lev Guzmán-Vargas

    2015-11-01

    Full Text Available We study the correlation properties of word lengths in large texts from 30 ebooks in the English language from the Gutenberg Project (www.gutenberg.org using the natural visibility graph method (NVG. NVG converts a time series into a graph and then analyzes its graph properties. First, the original sequence of words is transformed into a sequence of values containing the length of each word, and then, it is integrated. Next, we apply the NVG to the integrated word-length series and construct the network. We show that the degree distribution of that network follows a power law, P ( k ∼ k - γ , with two regimes, which are characterized by the exponents γ s ≈ 1 . 7 (at short degree scales and γ l ≈ 1 . 3 (at large degree scales. This suggests that word lengths are much more strongly correlated at large distances between words than at short distances between words. That finding is also supported by the detrended fluctuation analysis (DFA and recurrence time distribution. These results provide new information about the universal characteristics of the structure of written texts beyond that given by word frequencies.

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

    Science.gov (United States)

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

    2017-11-01

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

  3. A methodology for the synthesis of heat exchanger networks having large numbers of uncertain parameters

    International Nuclear Information System (INIS)

    Novak Pintarič, Zorka; Kravanja, Zdravko

    2015-01-01

    This paper presents a robust computational methodology for the synthesis and design of flexible HEN (Heat Exchanger Networks) having large numbers of uncertain parameters. This methodology combines several heuristic methods which progressively lead to a flexible HEN design at a specific level of confidence. During the first step, a HEN topology is generated under nominal conditions followed by determining those points critical for flexibility. A significantly reduced multi-scenario model for flexible HEN design is formulated at the nominal point with the flexibility constraints at the critical points. The optimal design obtained is tested by stochastic Monte Carlo optimization and the flexibility index through solving one-scenario problems within a loop. This presented methodology is novel regarding the enormous reduction of scenarios in HEN design problems, and computational effort. Despite several simplifications, the capability of designing flexible HENs with large numbers of uncertain parameters, which are typical throughout industry, is not compromised. An illustrative case study is presented for flexible HEN synthesis comprising 42 uncertain parameters. - Highlights: • Methodology for HEN (Heat Exchanger Network) design under uncertainty is presented. • The main benefit is solving HENs having large numbers of uncertain parameters. • Drastically reduced multi-scenario HEN design problem is formulated through several steps. • Flexibility of HEN is guaranteed at a specific level of confidence.

  4. Suspended sediment transport trough a large fluvial-tidal channel network

    Science.gov (United States)

    Wright, Scott A.; Morgan-King, Tara L.

    2015-01-01

    The confluence of the Sacramento and San Joaquin Rivers, CA, forms a large network of interconnected channels, referred to as the Sacramento-San Joaquin Delta (the Delta). The Delta comprises the transition zone from the fluvial influences of the upstream rivers and tidal influences of San Francisco Bay downstream. Formerly an extensive tidal marsh, the hydrodynamics and geomorphology of Delta have been substantially modified by humans to support agriculture, navigation, and water supply. These modifications, including construction of new channels, diking and draining of tidal wetlands, dredging of navigation channels, and the operation of large pumping facilities for distribution of freshwater from the Delta to other parts of the state, have had a dramatic impact on the physical and ecological processes within the Delta. To better understand the current physical processes, and their linkages to ecological processes, the USGS maintains an extensive network of flow, sediment, and water quality gages in the Delta. Flow gaging is accomplished through use of the index-velocity method, and sediment monitoring uses turbidity as a surrogate for suspended-sediment concentration. Herein, we present analyses of the transport and dispersal of suspended sediment through the complex network of channels in the Delta. The primary source of sediment to the Delta is the Sacramento River, which delivers pulses of sediment primarily during winter and spring runoff events. Upon reaching the Delta, the sediment pulses move through the fluvial-tidal transition while also encountering numerous channel junctions as the Sacramento River branches into several distributary channels. The monitoring network allows us to track these pulses through the network and document the dominant transport pathways for suspended sediment. Further, the flow gaging allows for an assessment of the relative effects of advection (the fluvial signal) and dispersion (from the tides) on the sediment pulses as they

  5. An improvement of tree-Rule firewall for a large network: supporting large rule size and low delay

    NARCIS (Netherlands)

    Chomsiri, Thawatchai; He, Xiangjian; Nanda, Priyadarsi; Tan, Zhiyuan

    Firewalls are important network devices which provide first hand defense against network threat. This level of defense is depended on firewall rules. Traditional firewalls, i.e., Cisco ACL, IPTABLES, Check Point and Juniper NetScreen firewall use listed rule to regulate packet flows. However, the

  6. A new asynchronous parallel algorithm for inferring large-scale gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Xiangyun Xiao

    Full Text Available The reconstruction of gene regulatory networks (GRNs from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM, experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.

  7. A new asynchronous parallel algorithm for inferring large-scale gene regulatory networks.

    Science.gov (United States)

    Xiao, Xiangyun; Zhang, Wei; Zou, Xiufen

    2015-01-01

    The reconstruction of gene regulatory networks (GRNs) from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE)-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM), experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.

  8. An efficient method based on the uniformity principle for synthesis of large-scale heat exchanger networks

    International Nuclear Information System (INIS)

    Zhang, Chunwei; Cui, Guomin; Chen, Shang

    2016-01-01

    Highlights: • Two dimensionless uniformity factors are presented to heat exchange network. • The grouping of process streams reduces the computational complexity of large-scale HENS problems. • The optimal sub-network can be obtained by Powell particle swarm optimization algorithm. • The method is illustrated by a case study involving 39 process streams, with a better solution. - Abstract: The optimal design of large-scale heat exchanger networks is a difficult task due to the inherent non-linear characteristics and the combinatorial nature of heat exchangers. To solve large-scale heat exchanger network synthesis (HENS) problems, two dimensionless uniformity factors to describe the heat exchanger network (HEN) uniformity in terms of the temperature difference and the accuracy of process stream grouping are deduced. Additionally, a novel algorithm that combines deterministic and stochastic optimizations to obtain an optimal sub-network with a suitable heat load for a given group of streams is proposed, and is named the Powell particle swarm optimization (PPSO). As a result, the synthesis of large-scale heat exchanger networks is divided into two corresponding sub-parts, namely, the grouping of process streams and the optimization of sub-networks. This approach reduces the computational complexity and increases the efficiency of the proposed method. The robustness and effectiveness of the proposed method are demonstrated by solving a large-scale HENS problem involving 39 process streams, and the results obtained are better than those previously published in the literature.

  9. A Genetic Algorithm-based Antenna Selection Approach for Large-but-Finite MIMO Networks

    KAUST Repository

    Makki, Behrooz

    2016-12-29

    We study the performance of antenna selectionbased multiple-input-multiple-output (MIMO) networks with large but finite number of transmit antennas and receivers. Considering the continuous and bursty communication scenarios with different users’ data request probabilities, we develop an efficient antenna selection scheme using genetic algorithms (GA). As demonstrated, the proposed algorithm is generic in the sense that it can be used in the cases with different objective functions, precoding methods, levels of available channel state information and channel models. Our results show that the proposed GAbased algorithm reaches (almost) the same throughput as the exhaustive search-based optimal approach, with substantially less implementation complexity.

  10. Electricity network limitations on large-scale deployment of wind energy

    Energy Technology Data Exchange (ETDEWEB)

    Fairbairn, R.J.

    1999-07-01

    This report sought to identify limitation on large scale deployment of wind energy in the UK. A description of the existing electricity supply system in England, Scotland and Wales is given, and operational aspects of the integrated electricity networks, licence conditions, types of wind turbine generators, and the scope for deployment of wind energy in the UK are addressed. A review of technical limitations and technical criteria stipulated by the Distribution and Grid Codes, the effects of system losses, and commercial issues are examined. Potential solutions to technical limitations are proposed, and recommendations are outlined.

  11. Automated Stellar Classification for Large Surveys with EKF and RBF Neural Networks

    Institute of Scientific and Technical Information of China (English)

    Ling Bai; Ping Guo; Zhan-Yi Hu

    2005-01-01

    An automated classification technique for large size stellar surveys is proposed. It uses the extended Kalman filter as a feature selector and pre-classifier of the data, and the radial basis function neural networks for the classification.Experiments with real data have shown that the correct classification rate can reach as high as 93%, which is quite satisfactory. When different system models are selected for the extended Kalman filter, the classification results are relatively stable. It is shown that for this particular case the result using extended Kalman filter is better than using principal component analysis.

  12. A Genetic Algorithm-based Antenna Selection Approach for Large-but-Finite MIMO Networks

    KAUST Repository

    Makki, Behrooz; Ide, Anatole; Svensson, Tommy; Eriksson, Thomas; Alouini, Mohamed-Slim

    2016-01-01

    We study the performance of antenna selectionbased multiple-input-multiple-output (MIMO) networks with large but finite number of transmit antennas and receivers. Considering the continuous and bursty communication scenarios with different users’ data request probabilities, we develop an efficient antenna selection scheme using genetic algorithms (GA). As demonstrated, the proposed algorithm is generic in the sense that it can be used in the cases with different objective functions, precoding methods, levels of available channel state information and channel models. Our results show that the proposed GAbased algorithm reaches (almost) the same throughput as the exhaustive search-based optimal approach, with substantially less implementation complexity.

  13. Overlapping communities detection based on spectral analysis of line graphs

    Science.gov (United States)

    Gui, Chun; Zhang, Ruisheng; Hu, Rongjing; Huang, Guoming; Wei, Jiaxuan

    2018-05-01

    Community in networks are often overlapping where one vertex belongs to several clusters. Meanwhile, many networks show hierarchical structure such that community is recursively grouped into hierarchical organization. In order to obtain overlapping communities from a global hierarchy of vertices, a new algorithm (named SAoLG) is proposed to build the hierarchical organization along with detecting the overlap of community structure. SAoLG applies the spectral analysis into line graphs to unify the overlap and hierarchical structure of the communities. In order to avoid the limitation of absolute distance such as Euclidean distance, SAoLG employs Angular distance to compute the similarity between vertices. Furthermore, we make a micro-improvement partition density to evaluate the quality of community structure and use it to obtain the more reasonable and sensible community numbers. The proposed SAoLG algorithm achieves a balance between overlap and hierarchy by applying spectral analysis to edge community detection. The experimental results on one standard network and six real-world networks show that the SAoLG algorithm achieves higher modularity and reasonable community number values than those generated by Ahn's algorithm, the classical CPM and GN ones.

  14. Abnormal binding and disruption in large scale networks involved in human partial seizures

    Directory of Open Access Journals (Sweden)

    Bartolomei Fabrice

    2013-12-01

    Full Text Available There is a marked increase in the amount of electrophysiological and neuroimaging works dealing with the study of large scale brain connectivity in the epileptic brain. Our view of the epileptogenic process in the brain has largely evolved over the last twenty years from the historical concept of “epileptic focus” to a more complex description of “Epileptogenic networks” involved in the genesis and “propagation” of epileptic activities. In particular, a large number of studies have been dedicated to the analysis of intracerebral EEG signals to characterize the dynamic of interactions between brain areas during temporal lobe seizures. These studies have reported that large scale functional connectivity is dramatically altered during seizures, particularly during temporal lobe seizure genesis and development. Dramatic changes in neural synchrony provoked by epileptic rhythms are also responsible for the production of ictal symptoms or changes in patient’s behaviour such as automatisms, emotional changes or consciousness alteration. Beside these studies dedicated to seizures, large-scale network connectivity during the interictal state has also been investigated not only to define biomarkers of epileptogenicity but also to better understand the cognitive impairments observed between seizures.

  15. Large Scale Proteomic Data and Network-Based Systems Biology Approaches to Explore the Plant World.

    Science.gov (United States)

    Di Silvestre, Dario; Bergamaschi, Andrea; Bellini, Edoardo; Mauri, PierLuigi

    2018-06-03

    The investigation of plant organisms by means of data-derived systems biology approaches based on network modeling is mainly characterized by genomic data, while the potential of proteomics is largely unexplored. This delay is mainly caused by the paucity of plant genomic/proteomic sequences and annotations which are fundamental to perform mass-spectrometry (MS) data interpretation. However, Next Generation Sequencing (NGS) techniques are contributing to filling this gap and an increasing number of studies are focusing on plant proteome profiling and protein-protein interactions (PPIs) identification. Interesting results were obtained by evaluating the topology of PPI networks in the context of organ-associated biological processes as well as plant-pathogen relationships. These examples foreshadow well the benefits that these approaches may provide to plant research. Thus, in addition to providing an overview of the main-omic technologies recently used on plant organisms, we will focus on studies that rely on concepts of module, hub and shortest path, and how they can contribute to the plant discovery processes. In this scenario, we will also consider gene co-expression networks, and some examples of integration with metabolomic data and genome-wide association studies (GWAS) to select candidate genes will be mentioned.

  16. Development of a 3D Stream Network and Topography for Improved Large-Scale Hydraulic Modeling

    Science.gov (United States)

    Saksena, S.; Dey, S.; Merwade, V.

    2016-12-01

    Most digital elevation models (DEMs) used for hydraulic modeling do not include channel bed elevations. As a result, the DEMs are complimented with additional bathymetric data for accurate hydraulic simulations. Existing methods to acquire bathymetric information through field surveys or through conceptual models are limited to reach-scale applications. With an increasing focus on large scale hydraulic modeling of rivers, a framework to estimate and incorporate bathymetry for an entire stream network is needed. This study proposes an interpolation-based algorithm to estimate bathymetry for a stream network by modifying the reach-based empirical River Channel Morphology Model (RCMM). The effect of a 3D stream network that includes river bathymetry is then investigated by creating a 1D hydraulic model (HEC-RAS) and 2D hydrodynamic model (Integrated Channel and Pond Routing) for the Upper Wabash River Basin in Indiana, USA. Results show improved simulation of flood depths and storage in the floodplain. Similarly, the impact of river bathymetry incorporation is more significant in the 2D model as compared to the 1D model.

  17. Cooperative HARQ Assisted NOMA Scheme in Large-scale D2D Networks

    KAUST Repository

    Shi, Zheng

    2017-07-13

    This paper develops an interference aware design for cooperative hybrid automatic repeat request (HARQ) assisted non-orthogonal multiple access (NOMA) scheme for large-scale device-to-device (D2D) networks. Specifically, interference aware rate selection and power allocation are considered to maximize long term average throughput (LTAT) and area spectral efficiency (ASE). The design framework is based on stochastic geometry that jointly accounts for the spatial interference correlation at the NOMA receivers as well as the temporal interference correlation across HARQ transmissions. It is found that ignoring the effect of the aggregate interference, or overlooking the spatial and temporal correlation in interference, highly overestimates the NOMA performance and produces misleading design insights. An interference oblivious selection for the power and/or transmission rates leads to violating the network outage constraints. To this end, the results demonstrate the effectiveness of NOMA transmission and manifest the importance of the cooperative HARQ to combat the negative effect of the network aggregate interference. For instance, comparing to the non-cooperative HARQ assisted NOMA, the proposed scheme can yield an outage probability reduction by $32$%. Furthermore, an interference aware optimal design that maximizes the LTAT given outage constraints leads to $47$% throughput improvement over HARQ-assisted orthogonal multiple access (OMA) scheme.

  18. Examining Food Risk in the Large using a Complex, Networked System-of-sytems Approach

    Energy Technology Data Exchange (ETDEWEB)

    Ambrosiano, John [Los Alamos National Laboratory; Newkirk, Ryan [U OF MINNESOTA; Mc Donald, Mark P [VANDERBILT U

    2010-12-03

    The food production infrastructure is a highly complex system of systems. Characterizing the risks of intentional contamination in multi-ingredient manufactured foods is extremely challenging because the risks depend on the vulnerabilities of food processing facilities and on the intricacies of the supply-distribution networks that link them. A pure engineering approach to modeling the system is impractical because of the overall system complexity and paucity of data. A methodology is needed to assess food contamination risk 'in the large', based on current, high-level information about manufacturing facilities, corrunodities and markets, that will indicate which food categories are most at risk of intentional contamination and warrant deeper analysis. The approach begins by decomposing the system for producing a multi-ingredient food into instances of two subsystem archetypes: (1) the relevant manufacturing and processing facilities, and (2) the networked corrunodity flows that link them to each other and consumers. Ingredient manufacturing subsystems are modeled as generic systems dynamics models with distributions of key parameters that span the configurations of real facilities. Networks representing the distribution systems are synthesized from general information about food corrunodities. This is done in a series of steps. First, probability networks representing the aggregated flows of food from manufacturers to wholesalers, retailers, other manufacturers, and direct consumers are inferred from high-level approximate information. This is followed by disaggregation of the general flows into flows connecting 'large' and 'small' categories of manufacturers, wholesalers, retailers, and consumers. Optimization methods are then used to determine the most likely network flows consistent with given data. Vulnerability can be assessed for a potential contamination point using a modified CARVER + Shock model. Once the facility and

  19. Unscheduled load flow effect due to large variation in the distributed generation in a subtransmission network

    Science.gov (United States)

    Islam, Mujahidul

    A sustainable energy delivery infrastructure implies the safe and reliable accommodation of large scale penetration of renewable sources in the power grid. In this dissertation it is assumed there will be no significant change in the power transmission and distribution structure currently in place; except in the operating strategy and regulatory policy. That is to say, with the same old structure, the path towards unveiling a high penetration of switching power converters in the power system will be challenging. Some of the dimensions of this challenge are power quality degradation, frequent false trips due to power system imbalance, and losses due to a large neutral current. The ultimate result is the reduced life of many power distribution components - transformers, switches and sophisticated loads. Numerous ancillary services are being developed and offered by the utility operators to mitigate these problems. These services will likely raise the system's operational cost, not only from the utility operators' end, but also reflected on the Independent System Operators and by the Regional Transmission Operators (RTO) due to an unforeseen backlash of frequent variation in the load-side generation or distributed generation. The North American transmission grid is an interconnected system similar to a large electrical circuit. This circuit was not planned but designed over 100 years. The natural laws of physics govern the power flow among loads and generators except where control mechanisms are installed. The control mechanism has not matured enough to withstand the high penetration of variable generators at uncontrolled distribution ends. Unlike a radial distribution system, mesh or loop networks can alleviate complex channels for real and reactive power flow. Significant variation in real power injection and absorption on the distribution side can emerge as a bias signal on the routing reactive power in some physical links or channels that are not distinguishable

  20. Restoring large-scale brain networks in PTSD and related disorders: a proposal for neuroscientifically-informed treatment interventions

    Directory of Open Access Journals (Sweden)

    Ruth A. Lanius

    2015-03-01

    Full Text Available Background: Three intrinsic connectivity networks in the brain, namely the central executive, salience, and default mode networks, have been identified as crucial to the understanding of higher cognitive functioning, and the functioning of these networks has been suggested to be impaired in psychopathology, including posttraumatic stress disorder (PTSD. Objective: 1 To describe three main large-scale networks of the human brain; 2 to discuss the functioning of these neural networks in PTSD and related symptoms; and 3 to offer hypotheses for neuroscientifically-informed interventions based on treating the abnormalities observed in these neural networks in PTSD and related disorders. Method: Literature relevant to this commentary was reviewed. Results: Increasing evidence for altered functioning of the central executive, salience, and default mode networks in PTSD has been demonstrated. We suggest that each network is associated with specific clinical symptoms observed in PTSD, including cognitive dysfunction (central executive network, increased and decreased arousal/interoception (salience network, and an altered sense of self (default mode network. Specific testable neuroscientifically-informed treatments aimed to restore each of these neural networks and related clinical dysfunction are proposed. Conclusions: Neuroscientifically-informed treatment interventions will be essential to future research agendas aimed at targeting specific PTSD and related symptoms.

  1. A triple network connectivity study of large-scale brain systems in cognitively normal APOE4 carriers

    Directory of Open Access Journals (Sweden)

    Xia Wu

    2016-09-01

    Full Text Available The triple network model, consisting of the central executive network, salience network and default mode network, has been recently employed to understand dysfunction in core networks across various disorders. Here we used the triple network model to investigate the large-scale brain networks in cognitively normal APOE4 carriers who are at risk of Alzheimer’s disease (AD. To explore the functional connectivity for each of the three networks and the effective connectivity among them, we evaluated 17 cognitively normal individuals with a family history of AD and at least one copy of the apolipoprotein e4 (APOE4 allele and compared the findings to those of 12 individuals who did not carry the APOE4 gene or have a family history of AD, using independent component analysis and Bayesian network approach. Our findings indicated altered within-network connectivity that suggests future cognitive decline risk, and preserved between-network connectivity that may support their current preserved cognition in the cognitively normal APOE4 allele carries. The study provides novel sights into our understanding of the risk factors for AD and their influence on the triple network model of major psychopathology.

  2. An effective fractal-tree closure model for simulating blood flow in large arterial networks.

    Science.gov (United States)

    Perdikaris, Paris; Grinberg, Leopold; Karniadakis, George Em

    2015-06-01

    The aim of the present work is to address the closure problem for hemodynamic simulations by developing a flexible and effective model that accurately distributes flow in the downstream vasculature and can stably provide a physiological pressure outflow boundary condition. To achieve this goal, we model blood flow in the sub-pixel vasculature by using a non-linear 1D model in self-similar networks of compliant arteries that mimic the structure and hierarchy of vessels in the meso-vascular regime (radii [Formula: see text]). We introduce a variable vessel length-to-radius ratio for small arteries and arterioles, while also addressing non-Newtonian blood rheology and arterial wall viscoelasticity effects in small arteries and arterioles. This methodology aims to overcome substantial cut-off radius sensitivities, typically arising in structured tree and linearized impedance models. The proposed model is not sensitive to outflow boundary conditions applied at the end points of the fractal network, and thus does not require calibration of resistance/capacitance parameters typically required for outflow conditions. The proposed model convergences to a periodic state in two cardiac cycles even when started from zero-flow initial conditions. The resulting fractal-trees typically consist of thousands to millions of arteries, posing the need for efficient parallel algorithms. To this end, we have scaled up a Discontinuous Galerkin solver that utilizes the MPI/OpenMP hybrid programming paradigm to thousands of computer cores, and can simulate blood flow in networks of millions of arterial segments at the rate of one cycle per 5 min. The proposed model has been extensively tested on a large and complex cranial network with 50 parent, patient-specific arteries and 21 outlets to which fractal trees where attached, resulting to a network of up to 4,392,484 vessels in total, and a detailed network of the arm with 276 parent arteries and 103 outlets (a total of 702,188 vessels

  3. Identifying Hierarchical and Overlapping Protein Complexes Based on Essential Protein-Protein Interactions and “Seed-Expanding” Method

    Directory of Open Access Journals (Sweden)

    Jun Ren

    2014-01-01

    Full Text Available Many evidences have demonstrated that protein complexes are overlapping and hierarchically organized in PPI networks. Meanwhile, the large size of PPI network wants complex detection methods have low time complexity. Up to now, few methods can identify overlapping and hierarchical protein complexes in a PPI network quickly. In this paper, a novel method, called MCSE, is proposed based on λ-module and “seed-expanding.” First, it chooses seeds as essential PPIs or edges with high edge clustering values. Then, it identifies protein complexes by expanding each seed to a λ-module. MCSE is suitable for large PPI networks because of its low time complexity. MCSE can identify overlapping protein complexes naturally because a protein can be visited by different seeds. MCSE uses the parameter λ_th to control the range of seed expanding and can detect a hierarchical organization of protein complexes by tuning the value of λ_th. Experimental results of S. cerevisiae show that this hierarchical organization is similar to that of known complexes in MIPS database. The experimental results also show that MCSE outperforms other previous competing algorithms, such as CPM, CMC, Core-Attachment, Dpclus, HC-PIN, MCL, and NFC, in terms of the functional enrichment and matching with known protein complexes.

  4. A theoretical bilevel control scheme for power networks with large-scale penetration of distributed renewable resources

    DEFF Research Database (Denmark)

    Boroojeni, Kianoosh; Amini, M. Hadi; Nejadpak, Arash

    2016-01-01

    In this paper, we present a bilevel control framework to achieve a highly-reliable smart distribution network with large-scale penetration of distributed renewable resources (DRRs). We assume that the power distribution network consists of several residential/commercial communities. In the first ...

  5. Large-scale brain networks underlying language acquisition in early infancy

    Directory of Open Access Journals (Sweden)

    Fumitaka eHomae

    2011-05-01

    Full Text Available A critical issue in human development is that of whether the language-related areas in the left frontal and temporal regions work as a functional network in preverbal infants. Here, we used 94-channel near-infrared spectroscopy (NIRS to reveal the functional networks in the brains of sleeping 3-month-old infants with and without presenting speech sounds. During the first 3 min, we measured spontaneous brain activation (period 1. After period 1, we provided stimuli by playing Japanese sentences for 3 min (period 2. Finally, we measured brain activation for 3 min without providing the stimulus (period 3, as in period 1. We found that not only the bilateral temporal and temporoparietal regions but also the prefrontal and occipital regions showed oxygenated hemoglobin (oxy-Hb signal increases and deoxygenated hemoglobin (deoxy-Hb signal decreases when speech sounds were presented to infants. By calculating time-lagged cross-correlations and coherences of oxy-Hb signals between channels, we tested the functional connectivity for the 3 periods. The oxy-Hb signals in neighboring channels, as well as their homologous channels in the contralateral hemisphere, showed high correlation coefficients in period 1. Similar correlations were observed in period 2; however, the number of channels showing high correlations was higher in the ipsilateral hemisphere, especially in the anterior-posterior direction. The functional connectivity in period 3 showed a close relationship between the frontal and temporal regions, which was less prominent in period 1, indicating that these regions form the functional networks and work as a hysteresis system that has memory of the previous inputs. We propose a hypothesis that the spatiotemporally large-scale brain networks, including the frontal and temporal regions, underlie speech processing in infants and they might play important roles in language acquisition during infancy.

  6. QUAL-NET, a high temporal-resolution eutrophication model for large hydrographic networks

    Directory of Open Access Journals (Sweden)

    C. Minaudo

    2018-04-01

    Full Text Available To allow climate change impact assessment of water quality in river systems, the scientific community lacks efficient deterministic models able to simulate hydrological and biogeochemical processes in drainage networks at the regional scale, with high temporal resolution and water temperature explicitly determined. The model QUALity-NETwork (QUAL-NET was developed and tested on the Middle Loire River Corridor, a sub-catchment of the Loire River in France, prone to eutrophication. Hourly variations computed efficiently by the model helped disentangle the complex interactions existing between hydrological and biological processes across different timescales. Phosphorus (P availability was the most constraining factor for phytoplankton development in the Loire River, but simulating bacterial dynamics in QUAL-NET surprisingly evidenced large amounts of organic matter recycled within the water column through the microbial loop, which delivered significant fluxes of available P and enhanced phytoplankton growth. This explained why severe blooms still occur in the Loire River despite large P input reductions since 1990. QUAL-NET could be used to study past evolutions or predict future trajectories under climate change and land use scenarios.

  7. An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Choi Jeonghee

    2008-01-01

    Full Text Available Abstract So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs, but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.

  8. QUAL-NET, a high temporal-resolution eutrophication model for large hydrographic networks

    Science.gov (United States)

    Minaudo, Camille; Curie, Florence; Jullian, Yann; Gassama, Nathalie; Moatar, Florentina

    2018-04-01

    To allow climate change impact assessment of water quality in river systems, the scientific community lacks efficient deterministic models able to simulate hydrological and biogeochemical processes in drainage networks at the regional scale, with high temporal resolution and water temperature explicitly determined. The model QUALity-NETwork (QUAL-NET) was developed and tested on the Middle Loire River Corridor, a sub-catchment of the Loire River in France, prone to eutrophication. Hourly variations computed efficiently by the model helped disentangle the complex interactions existing between hydrological and biological processes across different timescales. Phosphorus (P) availability was the most constraining factor for phytoplankton development in the Loire River, but simulating bacterial dynamics in QUAL-NET surprisingly evidenced large amounts of organic matter recycled within the water column through the microbial loop, which delivered significant fluxes of available P and enhanced phytoplankton growth. This explained why severe blooms still occur in the Loire River despite large P input reductions since 1990. QUAL-NET could be used to study past evolutions or predict future trajectories under climate change and land use scenarios.

  9. Pediatric disaster preparedness of a hospital network in a large metropolitan region.

    Science.gov (United States)

    Ferrer, Rizaldy R; Balasuriya, Darshi; Iverson, Ellen; Upperman, Jeffrey S

    2010-01-01

    We describe pediatric-related emergency experiences and responses, disaster preparation and planning, emergency plan execution and evaluation, and hospital pediatric capabilities and vulnerabilities among a disaster response network in a large urban county in the West Coast of the United States. Using semistructured key informant interviews, the authors conducted qualitative research between March and April 2008. Eleven hospitals and a representative from the community clinic association agreed to participate (86 percent response rate) and a total of 22 key informant interviews were completed. Data were analyzed using ATLAS.ti.v.5.0, a qualitative analytical software program. Although hospitals have infrastructure to respond in the event of a large-scale disaster, well-established disaster preparedness plans have not fully accounted for the needs of children. The general hospitals do not anticipate a surge of pediatric victims in the event of a disaster, and they expect that children will be transported to a children's hospital as their conditions become stable. Even hospitals with well-established disaster preparedness plans have not fully accounted for the needs of children during a disaster. Improved communication between disaster network hospitals is necessary as incorrect information still persists.

  10. A large interconnecting network within hybrid MEH-PPV/TiO2 nanorod photovoltaic devices

    International Nuclear Information System (INIS)

    Zeng, T-W; Lin, Y-Y; Lo, H-H; Chen, C-W; Chen, C-H; Liou, S-C; Huang, H-Y; Su, W-F

    2006-01-01

    This is a study of hybrid photovoltaic devices based on TiO 2 nanorods and poly[2-methoxy-5-(2'-ethyl-hexyloxy)-1,4-phenylene vinylene] (MEH-PPV). We use TiO 2 nanorods as the electron acceptors and conduction pathways. Here we describe how to develop a large interconnecting network within the photovoltaic device fabricated by inserting a layer of TiO 2 nanorods between the MEH-PPV:TiO 2 nanorod hybrid active layer and the aluminium electrode. The formation of a large interconnecting network provides better connectivity to the electrode, leading to a 2.5-fold improvement in external quantum efficiency as compared to the reference device without the TiO 2 nanorod layer. A power conversion efficiency of 2.2% under illumination at 565 nm and a maximum external quantum efficiency of 24% at 430 nm are achieved. A power conversion efficiency of 0.49% is obtained under Air Mass 1.5 illumination

  11. An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Yongwan Park

    2008-12-01

    Full Text Available So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs, but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.

  12. Topological susceptibility from the overlap

    DEFF Research Database (Denmark)

    Del Debbio, Luigi; Pica, Claudio

    2003-01-01

    The chiral symmetry at finite lattice spacing of Ginsparg-Wilson fermionic actions constrains the renormalization of the lattice operators; in particular, the topological susceptibility does not require any renormalization, when using a fermionic estimator to define the topological charge....... Therefore, the overlap formalism appears as an appealing candidate to study the continuum limit of the topological susceptibility while keeping the systematic errors under theoretical control. We present results for the SU(3) pure gauge theory using the index of the overlap Dirac operator to study...

  13. Low frequency steady-state brain responses modulate large scale functional networks in a frequency-specific means.

    Science.gov (United States)

    Wang, Yi-Feng; Long, Zhiliang; Cui, Qian; Liu, Feng; Jing, Xiu-Juan; Chen, Heng; Guo, Xiao-Nan; Yan, Jin H; Chen, Hua-Fu

    2016-01-01

    Neural oscillations are essential for brain functions. Research has suggested that the frequency of neural oscillations is lower for more integrative and remote communications. In this vein, some resting-state studies have suggested that large scale networks function in the very low frequency range (frequency characteristics of brain networks because both resting-state studies and conventional frequency tagging approaches cannot simultaneously capture multiple large scale networks in controllable cognitive activities. In this preliminary study, we aimed to examine whether large scale networks can be modulated by task-induced low frequency steady-state brain responses (lfSSBRs) in a frequency-specific pattern. In a revised attention network test, the lfSSBRs were evoked in the triple network system and sensory-motor system, indicating that large scale networks can be modulated in a frequency tagging way. Furthermore, the inter- and intranetwork synchronizations as well as coherence were increased at the fundamental frequency and the first harmonic rather than at other frequency bands, indicating a frequency-specific modulation of information communication. However, there was no difference among attention conditions, indicating that lfSSBRs modulate the general attention state much stronger than distinguishing attention conditions. This study provides insights into the advantage and mechanism of lfSSBRs. More importantly, it paves a new way to investigate frequency-specific large scale brain activities. © 2015 Wiley Periodicals, Inc.

  14. A large-scale perspective on stress-induced alterations in resting-state networks

    Science.gov (United States)

    Maron-Katz, Adi; Vaisvaser, Sharon; Lin, Tamar; Hendler, Talma; Shamir, Ron

    2016-02-01

    Stress is known to induce large-scale neural modulations. However, its neural effect once the stressor is removed and how it relates to subjective experience are not fully understood. Here we used a statistically sound data-driven approach to investigate alterations in large-scale resting-state functional connectivity (rsFC) induced by acute social stress. We compared rsfMRI profiles of 57 healthy male subjects before and after stress induction. Using a parcellation-based univariate statistical analysis, we identified a large-scale rsFC change, involving 490 parcel-pairs. Aiming to characterize this change, we employed statistical enrichment analysis, identifying anatomic structures that were significantly interconnected by these pairs. This analysis revealed strengthening of thalamo-cortical connectivity and weakening of cross-hemispheral parieto-temporal connectivity. These alterations were further found to be associated with change in subjective stress reports. Integrating report-based information on stress sustainment 20 minutes post induction, revealed a single significant rsFC change between the right amygdala and the precuneus, which inversely correlated with the level of subjective recovery. Our study demonstrates the value of enrichment analysis for exploring large-scale network reorganization patterns, and provides new insight on stress-induced neural modulations and their relation to subjective experience.

  15. Prediction of Thermal Environment in a Large Space Using Artificial Neural Network

    Directory of Open Access Journals (Sweden)

    Hyun-Jung Yoon

    2018-02-01

    Full Text Available Since the thermal environment of large space buildings such as stadiums can vary depending on the location of the stands, it is important to divide them into different zones and evaluate their thermal environment separately. The thermal environment can be evaluated using physical values measured with the sensors, but the occupant density of the stadium stands is high, which limits the locations available to install the sensors. As a method to resolve the limitations of installing the sensors, we propose a method to predict the thermal environment of each zone in a large space. We set six key thermal factors affecting the thermal environment in a large space to be predicted factors (indoor air temperature, mean radiant temperature, and clothing and the fixed factors (air velocity, metabolic rate, and relative humidity. Using artificial neural network (ANN models and the outdoor air temperature and the surface temperature of the interior walls around the stands as input data, we developed a method to predict the three thermal factors. Learning and verification datasets were established using STAR CCM+ (2016.10, Siemens PLM software, Plano, TX, USA. An analysis of each model’s prediction results showed that the prediction accuracy increased with the number of learning data points. The thermal environment evaluation process developed in this study can be used to control heating, ventilation, and air conditioning (HVAC facilities in each zone in a large space building with sufficient learning by ANN models at the building testing or the evaluation stage.

  16. Actin and microtubule networks contribute differently to cell response for small and large strains

    Science.gov (United States)

    Kubitschke, H.; Schnauss, J.; Nnetu, K. D.; Warmt, E.; Stange, R.; Kaes, J.

    2017-09-01

    Cytoskeletal filaments provide cells with mechanical stability and organization. The main key players are actin filaments and microtubules governing a cell’s response to mechanical stimuli. We investigated the specific influences of these crucial components by deforming MCF-7 epithelial cells at small (≤5% deformation) and large strains (>5% deformation). To understand specific contributions of actin filaments and microtubules, we systematically studied cellular responses after treatment with cytoskeleton influencing drugs. Quantification with the microfluidic optical stretcher allowed capturing the relative deformation and relaxation of cells under different conditions. We separated distinctive deformational and relaxational contributions to cell mechanics for actin and microtubule networks for two orders of magnitude of drug dosages. Disrupting actin filaments via latrunculin A, for instance, revealed a strain-independent softening. Stabilizing these filaments by treatment with jasplakinolide yielded cell softening for small strains but showed no significant change at large strains. In contrast, cells treated with nocodazole to disrupt microtubules displayed a softening at large strains but remained unchanged at small strains. Stabilizing microtubules within the cells via paclitaxel revealed no significant changes for deformations at small strains, but concentration-dependent impact at large strains. This suggests that for suspended cells, the actin cortex is probed at small strains, while at larger strains; the whole cell is probed with a significant contribution from the microtubules.

  17. Pattern overlap implies runaway growth in hierarchical tile systems

    Directory of Open Access Journals (Sweden)

    David Doty

    2015-11-01

    Full Text Available We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile types in the overlap region is identical in both translations, then arbitrarily large assemblies are producible. The significance of this result is that tile systems intended to controllably produce finite structures must avoid pattern repetition in their producible assemblies that would lead to such overlap.This answers an open question of Chen and Doty (SODA 2012, who showed that so-called "partial-order" systems producing a unique finite assembly and avoiding such overlaps must require time linear in the assembly diameter. An application of our main result is that any system producing a unique finite assembly is automatically guaranteed to avoid such overlaps, simplifying the hypothesis of Chen and Doty's main theorem.

  18. Large research infrastrucures and networking. Two key factors for maintaining nuclear expertise in Europe

    International Nuclear Information System (INIS)

    Cognet, G.; Iracane, D.

    2004-01-01

    Large research infrastructures are of key importance to improve the efficiency and the safety of nuclear energy production. To support present and coming power reactors and fuel cycle facilities and to develop future systems, it is necessary to optimise these infrastructures and their use by taking into account the networking of existing facilities, the access by the European researchers to conduct their own research projects and the creation of new installations when facing ageing issues. Large infrastructures include material testing reactor, hot laboratories for material and fuel under irradiation studies, fuel cycle researches and facilities dedicated to severe accident studies. For example, the CEA severe accident study platform has been recently used by a Bulgarian team to conduct its own research project with a grant provided by the European Commission. Furthermore, because present European material testing reactors are ageing, renewing the irradiation capability is an important and structuring stake for the fission research in Europe in order to continue safe and optimised operations of existing reactors, to support Generation 4 RTD and to keep alive competences. Considering that, CEA has decided to launch the project Jules Horowitz aiming at building a new research reactor. The access to the CEA facilities, including the Jules Horowitz reactor, combined with equivalent possibilities of access to other European facilities through a specific platform would help to develop a long-term vision, to create a coherent and dynamic strategy, to contribute to the stimulation of a large cooperation on nuclear fission, to enable a common approach of safety issues, to gather competencies, to promote the attractiveness of nuclear research to young scientists and to maintain European nuclear expertise at the highest level. This paper intends to provide a view of the existing and needed infrastructures, discuss the ways of access and finally open the discussion on the

  19. Topological susceptibility from the overlap

    International Nuclear Information System (INIS)

    Del Debbio, Luigi; Pica, Claudio

    2004-01-01

    The chiral symmetry at finite lattice spacing of Ginsparg-Wilson fermionic actions constrains the renormalization of the lattice operators; in particular, the topological susceptibility does not require any renormalization, when using a fermionic estimator to define the topological charge. Therefore, the overlap formalism appears as an appealing candidate to study the continuum limit of the topological susceptibility while keeping the systematic errors under theoretical control. We present results for the SU(3) pure gauge theory using the index of the overlap Dirac operator to study the topology of the gauge configurations. The topological charge is obtained from the zero modes of the overlap and using a new algorithm for the spectral flow analysis. A detailed comparison with cooling techniques is presented. Particular care is taken in assessing the systematic errors. Relatively high statistics (500 to 1000 independent configurations) yield an extrapolated continuum limit with errors that are comparable with other methods. Our current value from the overlap is χ 1/4 = 188±12±5MeV (author)

  20. Angular overlap model in actinides

    International Nuclear Information System (INIS)

    Gajek, Z.; Mulak, J.

    1991-01-01

    Quantitative foundations of the Angular Overlap Model in actinides based on ab initio calculations of the crystal field effect in the uranium (III) (IV) and (V) ions in various crystals are presented. The calculations justify some common simplifications of the model and fix up the relations between the AOM parameters. Traps and limitations of the AOM phenomenology are discussed

  1. Angular overlap model in actinides

    Energy Technology Data Exchange (ETDEWEB)

    Gajek, Z.; Mulak, J. (Polska Akademia Nauk, Wroclaw (PL). Inst. Niskich Temperatur i Badan Strukturalnych)

    1991-01-01

    Quantitative foundations of the Angular Overlap Model in actinides based on ab initio calculations of the crystal field effect in the uranium (III) (IV) and (V) ions in various crystals are presented. The calculations justify some common simplifications of the model and fix up the relations between the AOM parameters. Traps and limitations of the AOM phenomenology are discussed.

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

    Science.gov (United States)

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

    2013-05-06

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

  3. Numerical Experiments on Advective Transport in Large Three-Dimensional Discrete Fracture Networks

    Science.gov (United States)

    Makedonska, N.; Painter, S. L.; Karra, S.; Gable, C. W.

    2013-12-01

    Modeling of flow and solute transport in discrete fracture networks is an important approach for understanding the migration of contaminants in impermeable hard rocks such as granite, where fractures provide dominant flow and transport pathways. The discrete fracture network (DFN) model attempts to mimic discrete pathways for fluid flow through a fractured low-permeable rock mass, and may be combined with particle tracking simulations to address solute transport. However, experience has shown that it is challenging to obtain accurate transport results in three-dimensional DFNs because of the high computational burden and difficulty in constructing a high-quality unstructured computational mesh on simulated fractures. An integrated DFN meshing [1], flow, and particle tracking [2] simulation capability that enables accurate flow and particle tracking simulation on large DFNs has recently been developed. The new capability has been used in numerical experiments on advective transport in large DFNs with tens of thousands of fractures and millions of computational cells. The modeling procedure starts from the fracture network generation using a stochastic model derived from site data. A high-quality computational mesh is then generated [1]. Flow is then solved using the highly parallel PFLOTRAN [3] code. PFLOTRAN uses the finite volume approach, which is locally mass conserving and thus eliminates mass balance problems during particle tracking. The flow solver provides the scalar fluxes on each control volume face. From the obtained fluxes the Darcy velocity is reconstructed for each node in the network [4]. Velocities can then be continuously interpolated to any point in the domain of interest, thus enabling random walk particle tracking. In order to describe the flow field on fractures intersections, the control volume cells on intersections are split into four planar polygons, where each polygon corresponds to a piece of a fracture near the intersection line. Thus

  4. Multi-GNSS PPP-RTK: From Large- to Small-Scale Networks

    Directory of Open Access Journals (Sweden)

    Nandakumaran Nadarajah

    2018-04-01

    Full Text Available Precise point positioning (PPP and its integer ambiguity resolution-enabled variant, PPP-RTK (real-time kinematic, can benefit enormously from the integration of multiple global navigation satellite systems (GNSS. In such a multi-GNSS landscape, the positioning convergence time is expected to be reduced considerably as compared to the one obtained by a single-GNSS setup. It is therefore the goal of the present contribution to provide numerical insights into the role taken by the multi-GNSS integration in delivering fast and high-precision positioning solutions (sub-decimeter and centimeter levels using PPP-RTK. To that end, we employ the Curtin PPP-RTK platform and process data-sets of GPS, BeiDou Navigation Satellite System (BDS and Galileo in stand-alone and combined forms. The data-sets are collected by various receiver types, ranging from high-end multi-frequency geodetic receivers to low-cost single-frequency mass-market receivers. The corresponding stations form a large-scale (Australia-wide network as well as a small-scale network with inter-station distances less than 30 km. In case of the Australia-wide GPS-only ambiguity-float setup, 90% of the horizontal positioning errors (kinematic mode are shown to become less than five centimeters after 103 min. The stated required time is reduced to 66 min for the corresponding GPS + BDS + Galieo setup. The time is further reduced to 15 min by applying single-receiver ambiguity resolution. The outcomes are supported by the positioning results of the small-scale network.

  5. Social management of laboratory rhesus macaques housed in large groups using a network approach: A review.

    Science.gov (United States)

    McCowan, Brenda; Beisner, Brianne; Hannibal, Darcy

    2017-12-07

    Biomedical facilities across the nation and worldwide aim to develop cost-effective methods for the reproductive management of macaque breeding groups, typically by housing macaques in large, multi-male multi-female social groups that provide monkey subjects for research as well as appropriate socialization for their psychological well-being. One of the most difficult problems in managing socially housed macaques is their propensity for deleterious aggression. From a management perspective, deleterious aggression (as opposed to less intense aggression that serves to regulate social relationships) is undoubtedly the most problematic behavior observed in group-housed macaques, which can readily escalate to the degree that it causes social instability, increases serious physical trauma leading to group dissolution, and reduces psychological well-being. Thus for both welfare and other management reasons, aggression among rhesus macaques at primate centers and facilities needs to be addressed with a more proactive approach.Management strategies need to be instituted that maximize social housing while also reducing problematic social aggression due to instability using efficacious methods for detection and prevention in the most cost effective manner. Herein we review a new proactive approach using social network analysis to assess and predict deleterious aggression in macaque groups. We discovered three major pathways leading to instability, such as unusually high rates and severity of trauma and social relocations.These pathways are linked either directly or indirectly to network structure in rhesus macaque societies. We define these pathways according to the key intrinsic and extrinsic variables (e.g., demographic, genetic or social factors) that influence network and behavioral measures of stability (see Fig. 1). They are: (1) presence of natal males, (2) matrilineal genetic fragmentation, and (3) the power structure and conflict policing behavior supported by this

  6. Performance Evaluation of Hadoop-based Large-scale Network Traffic Analysis Cluster

    Directory of Open Access Journals (Sweden)

    Tao Ran

    2016-01-01

    Full Text Available As Hadoop has gained popularity in big data era, it is widely used in various fields. The self-design and self-developed large-scale network traffic analysis cluster works well based on Hadoop, with off-line applications running on it to analyze the massive network traffic data. On purpose of scientifically and reasonably evaluating the performance of analysis cluster, we propose a performance evaluation system. Firstly, we set the execution times of three benchmark applications as the benchmark of the performance, and pick 40 metrics of customized statistical resource data. Then we identify the relationship between the resource data and the execution times by a statistic modeling analysis approach, which is composed of principal component analysis and multiple linear regression. After training models by historical data, we can predict the execution times by current resource data. Finally, we evaluate the performance of analysis cluster by the validated predicting of execution times. Experimental results show that the predicted execution times by trained models are within acceptable error range, and the evaluation results of performance are accurate and reliable.

  7. Dynamics of Disagreement: Large-Scale Temporal Network Analysis Reveals Negative Interactions in Online Collaboration

    Science.gov (United States)

    Tsvetkova, Milena; García-Gavilanes, Ruth; Yasseri, Taha

    2016-11-01

    Disagreement and conflict are a fact of social life. However, negative interactions are rarely explicitly declared and recorded and this makes them hard for scientists to study. In an attempt to understand the structural and temporal features of negative interactions in the community, we use complex network methods to analyze patterns in the timing and configuration of reverts of article edits to Wikipedia. We investigate how often and how fast pairs of reverts occur compared to a null model in order to control for patterns that are natural to the content production or are due to the internal rules of Wikipedia. Our results suggest that Wikipedia editors systematically revert the same person, revert back their reverter, and come to defend a reverted editor. We further relate these interactions to the status of the involved editors. Even though the individual reverts might not necessarily be negative social interactions, our analysis points to the existence of certain patterns of negative social dynamics within the community of editors. Some of these patterns have not been previously explored and carry implications for the knowledge collection practice conducted on Wikipedia. Our method can be applied to other large-scale temporal collaboration networks to identify the existence of negative social interactions and other social processes.

  8. Distributed processing and network of data acquisition and diagnostics control for Large Helical Device (LHD)

    International Nuclear Information System (INIS)

    Nakanishi, H.; Kojima, M.; Hidekuma, S.

    1997-11-01

    The LHD (Large Helical Device) data processing system has been designed in order to deal with the huge amount of diagnostics data of 600-900 MB per 10-second short-pulse experiment. It prepares the first plasma experiment in March 1998. The recent increase of the data volume obliged to adopt the fully distributed system structure which uses multiple data transfer paths in parallel and separates all of the computer functions into clients and servers. The fundamental element installed for every diagnostic device consists of two kinds of server computers; the data acquisition PC/Windows NT and the real-time diagnostics control VME/VxWorks. To cope with diversified kinds of both device control channels and diagnostics data, the object-oriented method are utilized wholly for the development of this system. It not only reduces the development burden, but also widen the software portability and flexibility. 100Mbps EDDI-based fast networks will re-integrate the distributed server computers so that they can behave as one virtual macro-machine for users. Network methods applied for the LHD data processing system are completely based on the TCP/IP internet technology, and it provides the same accessibility to the remote collaborators as local participants can operate. (author)

  9. Traffic Flow Prediction Model for Large-Scale Road Network Based on Cloud Computing

    Directory of Open Access Journals (Sweden)

    Zhaosheng Yang

    2014-01-01

    Full Text Available To increase the efficiency and precision of large-scale road network traffic flow prediction, a genetic algorithm-support vector machine (GA-SVM model based on cloud computing is proposed in this paper, which is based on the analysis of the characteristics and defects of genetic algorithm and support vector machine. In cloud computing environment, firstly, SVM parameters are optimized by the parallel genetic algorithm, and then this optimized parallel SVM model is used to predict traffic flow. On the basis of the traffic flow data of Haizhu District in Guangzhou City, the proposed model was verified and compared with the serial GA-SVM model and parallel GA-SVM model based on MPI (message passing interface. The results demonstrate that the parallel GA-SVM model based on cloud computing has higher prediction accuracy, shorter running time, and higher speedup.

  10. Introduction to focus issue: Synchronization in large networks and continuous media—data, models, and supermodels

    Science.gov (United States)

    Duane, Gregory S.; Grabow, Carsten; Selten, Frank; Ghil, Michael

    2017-12-01

    The synchronization of loosely coupled chaotic systems has increasingly found applications to large networks of differential equations and to models of continuous media. These applications are at the core of the present Focus Issue. Synchronization between a system and its model, based on limited observations, gives a new perspective on data assimilation. Synchronization among different models of the same system defines a supermodel that can achieve partial consensus among models that otherwise disagree in several respects. Finally, novel methods of time series analysis permit a better description of synchronization in a system that is only observed partially and for a relatively short time. This Focus Issue discusses synchronization in extended systems or in components thereof, with particular attention to data assimilation, supermodeling, and their applications to various areas, from climate modeling to macroeconomics.

  11. Introduction to focus issue: Synchronization in large networks and continuous media-data, models, and supermodels.

    Science.gov (United States)

    Duane, Gregory S; Grabow, Carsten; Selten, Frank; Ghil, Michael

    2017-12-01

    The synchronization of loosely coupled chaotic systems has increasingly found applications to large networks of differential equations and to models of continuous media. These applications are at the core of the present Focus Issue. Synchronization between a system and its model, based on limited observations, gives a new perspective on data assimilation. Synchronization among different models of the same system defines a supermodel that can achieve partial consensus among models that otherwise disagree in several respects. Finally, novel methods of time series analysis permit a better description of synchronization in a system that is only observed partially and for a relatively short time. This Focus Issue discusses synchronization in extended systems or in components thereof, with particular attention to data assimilation, supermodeling, and their applications to various areas, from climate modeling to macroeconomics.

  12. Fault Detection for Large-Scale Railway Maintenance Equipment Base on Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Junfu Yu

    2014-04-01

    Full Text Available Focusing on the fault detection application for large-scale railway maintenance equipment with the specialties of low-cost, energy efficiency, collecting data of the function units. This paper proposed energy efficiency, convenient installation fault detection application using Sigsbee wireless sensor networks, which Sigsbee is the most widely used protocol based on IEEE 802.15.4. This paper proposed a systematic application from hardware design using STM32F103 chips as processer, to software system. Fault detection application is the basic part of the fault diagnose system, wireless sensor nodes of the fault detection application with different kinds of sensors for verities function units communication by Sigsbee to collecting and sending basic working status data to the home gateway, then data will be sent to the fault diagnose system.

  13. Generating functional analysis of complex formation and dissociation in large protein interaction networks

    International Nuclear Information System (INIS)

    Coolen, A C C; Rabello, S

    2009-01-01

    We analyze large systems of interacting proteins, using techniques from the non-equilibrium statistical mechanics of disordered many-particle systems. Apart from protein production and removal, the most relevant microscopic processes in the proteome are complex formation and dissociation, and the microscopic degrees of freedom are the evolving concentrations of unbound proteins (in multiple post-translational states) and of protein complexes. Here we only include dimer-complexes, for mathematical simplicity, and we draw the network that describes which proteins are reaction partners from an ensemble of random graphs with an arbitrary degree distribution. We show how generating functional analysis methods can be used successfully to derive closed equations for dynamical order parameters, representing an exact macroscopic description of the complex formation and dissociation dynamics in the infinite system limit. We end this paper with a discussion of the possible routes towards solving the nontrivial order parameter equations, either exactly (in specific limits) or approximately.

  14. Atypical language laterality is associated with large-scale disruption of network integration in children with intractable focal epilepsy.

    Science.gov (United States)

    Ibrahim, George M; Morgan, Benjamin R; Doesburg, Sam M; Taylor, Margot J; Pang, Elizabeth W; Donner, Elizabeth; Go, Cristina Y; Rutka, James T; Snead, O Carter

    2015-04-01

    Epilepsy is associated with disruption of integration in distributed networks, together with altered localization for functions such as expressive language. The relation between atypical network connectivity and altered localization is unknown. In the current study we tested whether atypical expressive language laterality was associated with the alteration of large-scale network integration in children with medically-intractable localization-related epilepsy (LRE). Twenty-three right-handed children (age range 8-17) with medically-intractable LRE performed a verb generation task in fMRI. Language network activation was identified and the Laterality index (LI) was calculated within the pars triangularis and pars opercularis. Resting-state data from the same cohort were subjected to independent component analysis. Dual regression was used to identify associations between resting-state integration and LI values. Higher positive values of the LI, indicating typical language localization were associated with stronger functional integration of various networks including the default mode network (DMN). The normally symmetric resting-state networks showed a pattern of lateralized connectivity mirroring that of language function. The association between atypical language localization and network integration implies a widespread disruption of neural network development. These findings may inform the interpretation of localization studies by providing novel insights into reorganization of neural networks in epilepsy. Copyright © 2015 Elsevier Ltd. All rights reserved.

  15. Large-Scale Functional Brain Network Abnormalities in Alzheimer’s Disease: Insights from Functional Neuroimaging

    Directory of Open Access Journals (Sweden)

    Bradford C. Dickerson

    2009-01-01

    Full Text Available Functional MRI (fMRI studies of mild cognitive impairment (MCI and Alzheimer’s disease (AD have begun to reveal abnormalities in large-scale memory and cognitive brain networks. Since the medial temporal lobe (MTL memory system is a site of very early pathology in AD, a number of studies have focused on this region of the brain. Yet it is clear that other regions of the large-scale episodic memory network are affected early in the disease as well, and fMRI has begun to illuminate functional abnormalities in frontal, temporal, and parietal cortices as well in MCI and AD. Besides predictable hypoactivation of brain regions as they accrue pathology and undergo atrophy, there are also areas of hyperactivation in brain memory and cognitive circuits, possibly representing attempted compensatory activity. Recent fMRI data in MCI and AD are beginning to reveal relationships between abnormalities of functional activity in the MTL memory system and in functionally connected brain regions, such as the precuneus. Additional work with “resting state” fMRI data is illuminating functional-anatomic brain circuits and their disruption by disease. As this work continues to mature, it will likely contribute to our understanding of fundamental memory processes in the human brain and how these are perturbed in memory disorders. We hope these insights will translate into the incorporation of measures of task-related brain function into diagnostic assessment or therapeutic monitoring, which will hopefully one day be useful for demonstrating beneficial effects of treatments being tested in clinical trials.

  16. Handover Incentives for Self-Interested WLANs with Overlapping Coverage

    DEFF Research Database (Denmark)

    Fafoutis, Xenofon; Siris, Vasilios A.

    2012-01-01

    We consider an environment where self-interested IEEE 802.11 Wireless Local Area Networks (WLANs) have overlapping coverage, and investigate the incentives that can trigger handovers between the WLANs. Our focus is on the incentives for supporting handovers due solely to the improved performance...

  17. [Asthma-COPD overlap syndrome].

    Science.gov (United States)

    Odler, Balázs; Müller, Veronika

    2016-08-01

    Obstructive lung diseases represent a major health problem worldwide due to their high prevalence associated with elevated socioeconomic costs. Bronchial asthma and chronic obstructive pulmonary disease are chronic obstructive ventilatory disorders with airway inflammation, however they are separate nosological entities based on thedifferent development, diagnostic and therapeutic approaches, and prognostic features. However, these diseases may coexist and can be defined as the coexistence of increased variability of airflow in a patient with incompletely reversible airway obstruction. This phenotype is called asthma - chronic obstructive pulmonary disease overlap syndrome. The syndrome is a clinical and scientific challenge as the majority of these patients have been excluded from the clinical and pharmacological trials, thus well-defined clinical characteristics and therapeutic approaches are lacking. The aim of this review is to summarize the currently available literature focusing on pathophysiological and clinical features, and discuss possible therapeutic approaches of patients with asthma - chronic obstructive pulmonary disease overlap syndrome. Orv. Hetil., 2016, 157(33), 1304-1313.

  18. Overlapping ETF: Pair trading between two gold stocks

    OpenAIRE

    Bell, Peter N; Lui, Brian; Brekke, Alex

    2012-01-01

    The purpose of this paper is to propose a trading strategy for overlapping ETF and calculate the profitability using real price data. For two overlapping ETF that are designed to provide the same intraday percentage change, the difference in percentage changes is a measure of mispricing. This mispricing is the central focus of the paper. The premise of the paper is that mispricing can take large positive or negative values, but it will always come back to zero. This assumption reflects ou...

  19. Common mycorrhizal networks amplify competition by preferential mineral nutrient allocation to large host plants.

    Science.gov (United States)

    Weremijewicz, Joanna; Sternberg, Leonel da Silveira Lobo O'Reilly; Janos, David P

    2016-10-01

    Arbuscular mycorrhizal (AM) fungi interconnect plants in common mycorrhizal networks (CMNs) which can amplify competition among neighbors. Amplified competition might result from the fungi supplying mineral nutrients preferentially to hosts that abundantly provide fixed carbon, as suggested by research with organ-cultured roots. We examined whether CMNs supplied (15) N preferentially to large, nonshaded, whole plants. We conducted an intraspecific target-neighbor pot experiment with Andropogon gerardii and several AM fungi in intact, severed or prevented CMNs. Neighbors were supplied (15) N, and half of the target plants were shaded. Intact CMNs increased target dry weight (DW), intensified competition and increased size inequality. Shading decreased target weight, but shaded plants in intact CMNs had mycorrhizal colonization similar to that of sunlit plants. AM fungi in intact CMNs acquired (15) N from the substrate of neighbors and preferentially allocated it to sunlit, large, target plants. Sunlit, intact CMN, target plants acquired as much as 27% of their nitrogen from the vicinity of their neighbors, but shaded targets did not. These results suggest that AM fungi in CMNs preferentially provide mineral nutrients to those conspecific host individuals best able to provide them with fixed carbon or representing the strongest sinks, thereby potentially amplifying asymmetric competition below ground. © 2016 The Authors. New Phytologist © 2016 New Phytologist Trust.

  20. a Stochastic Approach to Multiobjective Optimization of Large-Scale Water Reservoir Networks

    Science.gov (United States)

    Bottacin-Busolin, A.; Worman, A. L.

    2013-12-01

    A main challenge for the planning and management of water resources is the development of multiobjective strategies for operation of large-scale water reservoir networks. The optimal sequence of water releases from multiple reservoirs depends on the stochastic variability of correlated hydrologic inflows and on various processes that affect water demand and energy prices. Although several methods have been suggested, large-scale optimization problems arising in water resources management are still plagued by the high dimensional state space and by the stochastic nature of the hydrologic inflows. In this work, the optimization of reservoir operation is approached using approximate dynamic programming (ADP) with policy iteration and function approximators. The method is based on an off-line learning process in which operating policies are evaluated for a number of stochastic inflow scenarios, and the resulting value functions are used to design new, improved policies until convergence is attained. A case study is presented of a multi-reservoir system in the Dalälven River, Sweden, which includes 13 interconnected reservoirs and 36 power stations. Depending on the late spring and summer peak discharges, the lowlands adjacent to Dalälven can often be flooded during the summer period, and the presence of stagnating floodwater during the hottest months of the year is the cause of a large proliferation of mosquitos, which is a major problem for the people living in the surroundings. Chemical pesticides are currently being used as a preventive countermeasure, which do not provide an effective solution to the problem and have adverse environmental impacts. In this study, ADP was used to analyze the feasibility of alternative operating policies for reducing the flood risk at a reasonable economic cost for the hydropower companies. To this end, mid-term operating policies were derived by combining flood risk reduction with hydropower production objectives. The performance

  1. A Low Collision and High Throughput Data Collection Mechanism for Large-Scale Super Dense Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chunyang Lei

    2016-07-01

    Full Text Available Super dense wireless sensor networks (WSNs have become popular with the development of Internet of Things (IoT, Machine-to-Machine (M2M communications and Vehicular-to-Vehicular (V2V networks. While highly-dense wireless networks provide efficient and sustainable solutions to collect precise environmental information, a new channel access scheme is needed to solve the channel collision problem caused by the large number of competing nodes accessing the channel simultaneously. In this paper, we propose a space-time random access method based on a directional data transmission strategy, by which collisions in the wireless channel are significantly decreased and channel utility efficiency is greatly enhanced. Simulation results show that our proposed method can decrease the packet loss rate to less than 2 % in large scale WSNs and in comparison with other channel access schemes for WSNs, the average network throughput can be doubled.

  2. A Low Collision and High Throughput Data Collection Mechanism for Large-Scale Super Dense Wireless Sensor Networks.

    Science.gov (United States)

    Lei, Chunyang; Bie, Hongxia; Fang, Gengfa; Gaura, Elena; Brusey, James; Zhang, Xuekun; Dutkiewicz, Eryk

    2016-07-18

    Super dense wireless sensor networks (WSNs) have become popular with the development of Internet of Things (IoT), Machine-to-Machine (M2M) communications and Vehicular-to-Vehicular (V2V) networks. While highly-dense wireless networks provide efficient and sustainable solutions to collect precise environmental information, a new channel access scheme is needed to solve the channel collision problem caused by the large number of competing nodes accessing the channel simultaneously. In this paper, we propose a space-time random access method based on a directional data transmission strategy, by which collisions in the wireless channel are significantly decreased and channel utility efficiency is greatly enhanced. Simulation results show that our proposed method can decrease the packet loss rate to less than 2 % in large scale WSNs and in comparison with other channel access schemes for WSNs, the average network throughput can be doubled.

  3. Developing Large-Scale Bayesian Networks by Composition: Fault Diagnosis of Electrical Power Systems in Aircraft and Spacecraft

    Science.gov (United States)

    Mengshoel, Ole Jakob; Poll, Scott; Kurtoglu, Tolga

    2009-01-01

    This CD contains files that support the talk (see CASI ID 20100021404). There are 24 models that relate to the ADAPT system and 1 Excel worksheet. In the paper an investigation into the use of Bayesian networks to construct large-scale diagnostic systems is described. The high-level specifications, Bayesian networks, clique trees, and arithmetic circuits representing 24 different electrical power systems are described in the talk. The data in the CD are the models of the 24 different power systems.

  4. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

    OpenAIRE

    Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

    2013-01-01

    Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are inve...

  5. Coarse-grain bandwidth estimation techniques for large-scale network

    Science.gov (United States)

    Cheung, Kar-Ming; Jennings, E.

    In this paper, we describe a top-down analysis and simulation approach to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

  6. Coarse-Grain Bandwidth Estimation Techniques for Large-Scale Space Network

    Science.gov (United States)

    Cheung, Kar-Ming; Jennings, Esther

    2013-01-01

    In this paper, we describe a top-down analysis and simulation approach to size the bandwidths of a store-andforward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

  7. An investigation of scalable anomaly detection techniques for a large network of Wi-Fi hotspots

    CSIR Research Space (South Africa)

    Machaka, P

    2015-01-01

    Full Text Available . The Neural Networks, Bayesian Networks and Artificial Immune Systems were used for this experiment. Using a set of data extracted from a live network of Wi-Fi hotspots managed by an ISP; we integrated algorithms into a data collection system to detect...

  8. Enhancement of a model for Large-scale Airline Network Planning Problems

    NARCIS (Netherlands)

    Kölker, K.; Lopes dos Santos, Bruno F.; Lütjens, K.

    2016-01-01

    The main focus of this study is to solve the network planning problem based on passenger decision criteria including the preferred departure time and travel time for a real-sized airline network. For this purpose, a model of the integrated network planning problem is formulated including scheduling

  9. The index-based subgraph matching algorithm (ISMA: fast subgraph enumeration in large networks using optimized search trees.

    Directory of Open Access Journals (Sweden)

    Sofie Demeyer

    Full Text Available Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.

  10. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

    Science.gov (United States)

    Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

    2013-01-01

    Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/. PMID:23620730

  11. Scalability analysis of large-scale LoRaWAN networks in ns-3

    OpenAIRE

    Abeele, Floris Van den; Haxhibeqiri, Jetmir; Moerman, Ingrid; Hoebeke, Jeroen

    2017-01-01

    As LoRaWAN networks are actively being deployed in the field, it is important to comprehend the limitations of this Low Power Wide Area Network technology. Previous work has raised questions in terms of the scalability and capacity of LoRaWAN networks as the number of end devices grows to hundreds or thousands per gateway. Some works have modeled LoRaWAN networks as pure ALOHA networks, which fails to capture important characteristics such as the capture effect and the effects of interference...

  12. Interference management with partial uplink/downlink spectrum overlap

    KAUST Repository

    Randrianantenaina, Itsikiantsoa

    2016-07-26

    Simultaneous reuse of spectral resources by uplink and downlink, denoted as in-band full duplex (FD) communication, is promoted to double the spectral efficiency when compared to its half-duplex (HD) counterpart. Interference management, however, remains challenging in FD cellular networks, especially when high disparity between uplink and downlink transmission powers exists. The uplink performance can be particularly deteriorated when operating on channels that are simultaneously occupied with downlink transmission. This paper considers a cellular wireless system with partial spectrum overlap between the downlink and uplink. The performance of the system becomes, therefore, a function of the overlap fraction, as well as the power levels of both the uplink and downlink transmissions. The paper considers the problem of maximizing an overall network utility to find the uplink/downlink transmission powers and the spectrum overlap fraction between the uplink and downlink spectrum in each cell, and proposes solving the problem using interior point method. Simulations results confirm the vulnerability of the uplink performance to the FD operation, and show the superiority of the proposed scheme over the FD and HD schemes. The results further show that explicit uplink and downlink performance should be considered for efficient design of cellular networks with overlapping uplink/downlink resources. © 2016 IEEE.

  13. Optimal overlapping of waveform relaxation method for linear differential equations

    International Nuclear Information System (INIS)

    Yamada, Susumu; Ozawa, Kazufumi

    2000-01-01

    Waveform relaxation (WR) method is extremely suitable for solving large systems of ordinary differential equations (ODEs) on parallel computers, but the convergence of the method is generally slow. In order to accelerate the convergence, the methods which decouple the system into many subsystems with overlaps some of the components between the adjacent subsystems have been proposed. The methods, in general, converge much faster than the ones without overlapping, but the computational cost per iteration becomes larger due to the increase of the dimension of each subsystem. In this research, the convergence of the WR method for solving constant coefficients linear ODEs is investigated and the strategy to determine the number of overlapped components which minimizes the cost of the parallel computations is proposed. Numerical experiments on an SR2201 parallel computer show that the estimated number of the overlapped components by the proposed strategy is reasonable. (author)

  14. Action Video Game Experience Related to Altered Large-Scale White Matter Networks.

    Science.gov (United States)

    Gong, Diankun; Ma, Weiyi; Gong, Jinnan; He, Hui; Dong, Li; Zhang, Dan; Li, Jianfu; Luo, Cheng; Yao, Dezhong

    2017-01-01

    With action video games (AVGs) becoming increasingly popular worldwide, the cognitive benefits of AVG experience have attracted continuous research attention over the past two decades. Research has repeatedly shown that AVG experience can causally enhance cognitive ability and is related to neural plasticity in gray matter and functional networks in the brain. However, the relation between AVG experience and the plasticity of white matter (WM) network still remains unclear. WM network modulates the distribution of action potentials, coordinating the communication between brain regions and acting as the framework of neural networks. And various types of cognitive deficits are usually accompanied by impairments of WM networks. Thus, understanding this relation is essential in assessing the influence of AVG experience on neural plasticity and using AVG experience as an interventional tool for impairments of WM networks. Using graph theory, this study analyzed WM networks in AVG experts and amateurs. Results showed that AVG experience is related to altered WM networks in prefrontal networks, limbic system, and sensorimotor networks, which are related to cognitive control and sensorimotor functions. These results shed new light on the influence of AVG experience on the plasticity of WM networks and suggested the clinical applicability of AVG experience.

  15. Action Video Game Experience Related to Altered Large-Scale White Matter Networks

    Directory of Open Access Journals (Sweden)

    Diankun Gong

    2017-01-01

    Full Text Available With action video games (AVGs becoming increasingly popular worldwide, the cognitive benefits of AVG experience have attracted continuous research attention over the past two decades. Research has repeatedly shown that AVG experience can causally enhance cognitive ability and is related to neural plasticity in gray matter and functional networks in the brain. However, the relation between AVG experience and the plasticity of white matter (WM network still remains unclear. WM network modulates the distribution of action potentials, coordinating the communication between brain regions and acting as the framework of neural networks. And various types of cognitive deficits are usually accompanied by impairments of WM networks. Thus, understanding this relation is essential in assessing the influence of AVG experience on neural plasticity and using AVG experience as an interventional tool for impairments of WM networks. Using graph theory, this study analyzed WM networks in AVG experts and amateurs. Results showed that AVG experience is related to altered WM networks in prefrontal networks, limbic system, and sensorimotor networks, which are related to cognitive control and sensorimotor functions. These results shed new light on the influence of AVG experience on the plasticity of WM networks and suggested the clinical applicability of AVG experience.

  16. 3D fully convolutional networks for subcortical segmentation in MRI: A large-scale study.

    Science.gov (United States)

    Dolz, Jose; Desrosiers, Christian; Ben Ayed, Ismail

    2018-04-15

    This study investigates a 3D and fully convolutional neural network (CNN) for subcortical brain structure segmentation in MRI. 3D CNN architectures have been generally avoided due to their computational and memory requirements during inference. We address the problem via small kernels, allowing deeper architectures. We further model both local and global context by embedding intermediate-layer outputs in the final prediction, which encourages consistency between features extracted at different scales and embeds fine-grained information directly in the segmentation process. Our model is efficiently trained end-to-end on a graphics processing unit (GPU), in a single stage, exploiting the dense inference capabilities of fully CNNs. We performed comprehensive experiments over two publicly available datasets. First, we demonstrate a state-of-the-art performance on the ISBR dataset. Then, we report a large-scale multi-site evaluation over 1112 unregistered subject datasets acquired from 17 different sites (ABIDE dataset), with ages ranging from 7 to 64 years, showing that our method is robust to various acquisition protocols, demographics and clinical factors. Our method yielded segmentations that are highly consistent with a standard atlas-based approach, while running in a fraction of the time needed by atlas-based methods and avoiding registration/normalization steps. This makes it convenient for massive multi-site neuroanatomical imaging studies. To the best of our knowledge, our work is the first to study subcortical structure segmentation on such large-scale and heterogeneous data. Copyright © 2017 Elsevier Inc. All rights reserved.

  17. Data transfer over the wide area network with a large round trip time

    Science.gov (United States)

    Matsunaga, H.; Isobe, T.; Mashimo, T.; Sakamoto, H.; Ueda, I.

    2010-04-01

    A Tier-2 regional center is running at the University of Tokyo in Japan. This center receives a large amount of data of the ATLAS experiment from the Tier-1 center in France. Although the link between the two centers has 10Gbps bandwidth, it is not a dedicated link but is shared with other traffic, and the round trip time is 290ms. It is not easy to exploit the available bandwidth for such a link, so-called long fat network. We performed data transfer tests by using GridFTP in various combinations of the parameters, such as the number of parallel streams and the TCP window size. In addition, we have gained experience of the actual data transfer in our production system where the Disk Pool Manager (DPM) is used as the Storage Element and the data transfer is controlled by the File Transfer Service (FTS). We report results of the tests and the daily activity, and discuss the improvement of the data transfer throughput.

  18. Large-scale neural networks and the lateralization of motivation and emotion.

    Science.gov (United States)

    Tops, Mattie; Quirin, Markus; Boksem, Maarten A S; Koole, Sander L

    2017-09-01

    Several lines of research in animals and humans converge on the distinction between two basic large-scale brain networks of self-regulation, giving rise to predictive and reactive control systems (PARCS). Predictive (internally-driven) and reactive (externally-guided) control are supported by dorsal versus ventral corticolimbic systems, respectively. Based on extant empirical evidence, we demonstrate how the PARCS produce frontal laterality effects in emotion and motivation. In addition, we explain how this framework gives rise to individual differences in appraising and coping with challenges. PARCS theory integrates separate fields of research, such as research on the motivational correlates of affect, EEG frontal alpha power asymmetry and implicit affective priming effects on cardiovascular indicators of effort during cognitive task performance. Across these different paradigms, converging evidence points to a qualitative motivational division between, on the one hand, angry and happy emotions, and, on the other hand, sad and fearful emotions. PARCS suggests that those two pairs of emotions are associated with predictive and reactive control, respectively. PARCS theory may thus generate important new insights on the motivational and emotional dynamics that drive autonomic and homeostatic control processes. Copyright © 2017 Elsevier B.V. All rights reserved.

  19. Data transfer over the wide area network with a large round trip time

    International Nuclear Information System (INIS)

    Matsunaga, H; Isobe, T; Mashimo, T; Sakamoto, H; Ueda, I

    2010-01-01

    A Tier-2 regional center is running at the University of Tokyo in Japan. This center receives a large amount of data of the ATLAS experiment from the Tier-1 center in France. Although the link between the two centers has 10Gbps bandwidth, it is not a dedicated link but is shared with other traffic, and the round trip time is 290ms. It is not easy to exploit the available bandwidth for such a link, so-called long fat network. We performed data transfer tests by using GridFTP in various combinations of the parameters, such as the number of parallel streams and the TCP window size. In addition, we have gained experience of the actual data transfer in our production system where the Disk Pool Manager (DPM) is used as the Storage Element and the data transfer is controlled by the File Transfer Service (FTS). We report results of the tests and the daily activity, and discuss the improvement of the data transfer throughput.

  20. Event management for large scale event-driven digital hardware spiking neural networks.

    Science.gov (United States)

    Caron, Louis-Charles; D'Haene, Michiel; Mailhot, Frédéric; Schrauwen, Benjamin; Rouat, Jean

    2013-09-01

    The interest in brain-like computation has led to the design of a plethora of innovative neuromorphic systems. Individually, spiking neural networks (SNNs), event-driven simulation and digital hardware neuromorphic systems get a lot of attention. Despite the popularity of event-driven SNNs in software, very few digital hardware architectures are found. This is because existing hardware solutions for event management scale badly with the number of events. This paper introduces the structured heap queue, a pipelined digital hardware data structure, and demonstrates its suitability for event management. The structured heap queue scales gracefully with the number of events, allowing the efficient implementation of large scale digital hardware event-driven SNNs. The scaling is linear for memory, logarithmic for logic resources and constant for processing time. The use of the structured heap queue is demonstrated on a field-programmable gate array (FPGA) with an image segmentation experiment and a SNN of 65,536 neurons and 513,184 synapses. Events can be processed at the rate of 1 every 7 clock cycles and a 406×158 pixel image is segmented in 200 ms. Copyright © 2013 Elsevier Ltd. All rights reserved.

  1. Statistical Modeling of Large-Scale Signal Path Loss in Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Manuel Perez Malumbres

    2013-02-01

    Full Text Available In an underwater acoustic channel, the propagation conditions are known to vary in time, causing the deviation of the received signal strength from the nominal value predicted by a deterministic propagation model. To facilitate a large-scale system design in such conditions (e.g., power allocation, we have developed a statistical propagation model in which the transmission loss is treated as a random variable. By applying repetitive computation to the acoustic field, using ray tracing for a set of varying environmental conditions (surface height, wave activity, small node displacements around nominal locations, etc., an ensemble of transmission losses is compiled and later used to infer the statistical model parameters. A reasonable agreement is found with log-normal distribution, whose mean obeys a log-distance increases, and whose variance appears to be constant for a certain range of inter-node distances in a given deployment location. The statistical model is deemed useful for higher-level system planning, where simulation is needed to assess the performance of candidate network protocols under various resource allocation policies, i.e., to determine the transmit power and bandwidth allocation necessary to achieve a desired level of performance (connectivity, throughput, reliability, etc..

  2. Head-circumference distribution in a large primary care network differs from CDC and WHO curves.

    Science.gov (United States)

    Daymont, Carrie; Hwang, Wei-Ting; Feudtner, Chris; Rubin, David

    2010-10-01

    To compare currently available head-circumference growth curves to curves constructed from clinical measurements from patients in a large US primary care network (PCN). We performed a retrospective cohort study of 75 412 patients in an urban-suburban PCN. Patients with a birth weight of curves. The PCN curves were most similar to the National Center for Health Statistics (NCHS) curves and were substantially different from the Centers for Disease Control and Prevention (CDC) and World Health Organization (WHO) curves. The overall proportion of observations above the 95th percentile was 4.9% (PCN), 6.2% (NCHS), 8.6% (CDC), and 14.0% (WHO). The proportion below the 5th percentile was 4.4% (PCN), 5.1% (NCHS), 2.9% (CDC), and 2.3% (WHO). When using the CDC curves, the proportion above the 95th percentile increased from 0.2% for children younger than 2 weeks to 11.8% for children 12 months old. When using the WHO curves, the proportion above the 95th percentile was >5% at all ages, with a maximum of 18.0% for children older than 24 months. The CDC and WHO head-circumference curves describe different distributions than the clinical measurements in our PCN population, especially for children with larger heads. The resulting percentile misclassification may delay diagnosis in children with intracranial pathology in very young infants and spur unnecessary evaluation of healthy children older than 6 months.

  3. Overlapping sphincteroplasty and posterior repair.

    Science.gov (United States)

    Crane, Andrea K; Myers, Erinn M; Lippmann, Quinn K; Matthews, Catherine A

    2014-12-01

    Knowledge of how to anatomically reconstruct extensive posterior-compartment defects is variable among gynecologists. The objective of this video is to demonstrate an effective technique of overlapping sphincteroplasty and posterior repair. In this video, a scripted storyboard was constructed that outlines the key surgical steps of a comprehensive posterior compartment repair: (1) surgical incision that permits access to posterior compartment and perineal body, (2) dissection of the rectovaginal space up to the level of the cervix, (3) plication of the rectovaginal muscularis, (4) repair of internal and external anal sphincters, and (5) reconstruction of the perineal body. Using a combination of graphic illustrations and live video footage, tips on repair are highlighted. The goals at the end of repair are to: (1) have improved vaginal caliber, (2) increase rectal tone along the entire posterior vaginal wall, (3) have the posterior vaginal wall at a perpendicular plane to the perineal body, (4) reform the hymenal ring, and (5) not have an overly elongated perineal body. This video provides a step-by-step guide on how to perform an overlapping sphincteroplasty and posterior repair.

  4. Urban Freight Management with Stochastic Time-Dependent Travel Times and Application to Large-Scale Transportation Networks

    Directory of Open Access Journals (Sweden)

    Shichao Sun

    2015-01-01

    Full Text Available This paper addressed the vehicle routing problem (VRP in large-scale urban transportation networks with stochastic time-dependent (STD travel times. The subproblem which is how to find the optimal path connecting any pair of customer nodes in a STD network was solved through a robust approach without requiring the probability distributions of link travel times. Based on that, the proposed STD-VRP model can be converted into solving a normal time-dependent VRP (TD-VRP, and algorithms for such TD-VRPs can also be introduced to obtain the solution. Numerical experiments were conducted to address STD-VRPTW of practical sizes on a real world urban network, demonstrated here on the road network of Shenzhen, China. The stochastic time-dependent link travel times of the network were calibrated by historical floating car data. A route construction algorithm was applied to solve the STD problem in 4 delivery scenarios efficiently. The computational results showed that the proposed STD-VRPTW model can improve the level of customer service by satisfying the time-window constraint under any circumstances. The improvement can be very significant especially for large-scale network delivery tasks with no more increase in cost and environmental impacts.

  5. Large networks of artificial radar reflectors to monitor land subsidence in natural lowlying coastal areas

    Science.gov (United States)

    Tosi, Luigi; Strozzi, Tazio; Teatini, Pietro

    2014-05-01

    Deltas, lagoons, estuaries are generally much prone to land subsidence. They are also very sensitive to land lowering due to their small elevation with respect to the mean sea level, also in view of the expected eustatic sea rise due to climate changes. Land subsidence can be presently monitored with an impressive accuracy by Persistent Scatterer Interferometry (PSI) on the large megacities that are often located on lowlying coastlands, e.g., Shanghai (China) on the Yangtze River delta, Dhaka (Bangladesh) on the Gange River delta, New Orleans (Louisiana) on the Mississippi river delta. Conversely, the land movements of the portions of these transitional coastlands where natural environments still persist are very challenging to be measured. The lack of anthropogenic structures strongly limits the use of PSI and the difficult accessibility caused by the presence of marshlands, tidal marshes, channels, and ponds yield traditional methodologies, such as levelling and GPS, both time-consuming and costly. In this contribution we present a unique experimental study aimed at using a large network of artificial radar reflectors to measure land subsidence in natural coastal areas. The test site is the 60-km long, 10-15 km wide lagoon of Venice, Italy, where previous PSI investigations revealed the lack of radar reflectors in large portions of the northern and southern lagoon basins (e.g., Teatini et al., 2011). A network of 57 trihedral corner reflectors (TCRs) were established between the end of 2006 and the beginning of 2007 and monitored by ENVISAT ASAR and TerraSAR-X acquisitions covering the time period from 2007 to 2011 (Strozzi et al., 2012). The application has provided general important insights on the possibility of controlling land subsidence using this approach. For example: (i) relatively small-size (from 0.5 to 1.0 m edge length) and cheap (few hundred euros) TCRs suffice to be clearly detectable from the radar sensors because of the low backscattering

  6. Optimized district heating supply temperature for large networks; Optimerad framledningstemperatur foer stora fjaerrvaermenaet

    Energy Technology Data Exchange (ETDEWEB)

    Saarinen, Lisa; Boman, Katarina

    2012-02-15

    The supply temperature of the Uppsala district heating network was optimized using a model-based control strategy. Simulation of the network showed that the supply temperature could be decreased by in average 8 deg and the electricity production of the plants supplying the network could be increased with 2.5 % during the period January- April, giving an extra income of 1.2 MSEK due to increased income from electricity sales

  7. Reducing weight precision of convolutional neural networks towards large-scale on-chip image recognition

    Science.gov (United States)

    Ji, Zhengping; Ovsiannikov, Ilia; Wang, Yibing; Shi, Lilong; Zhang, Qiang

    2015-05-01

    In this paper, we develop a server-client quantization scheme to reduce bit resolution of deep learning architecture, i.e., Convolutional Neural Networks, for image recognition tasks. Low bit resolution is an important factor in bringing the deep learning neural network into hardware implementation, which directly determines the cost and power consumption. We aim to reduce the bit resolution of the network without sacrificing its performance. To this end, we design a new quantization algorithm called supervised iterative quantization to reduce the bit resolution of learned network weights. In the training stage, the supervised iterative quantization is conducted via two steps on server - apply k-means based adaptive quantization on learned network weights and retrain the network based on quantized weights. These two steps are alternated until the convergence criterion is met. In this testing stage, the network configuration and low-bit weights are loaded to the client hardware device to recognize coming input in real time, where optimized but expensive quantization becomes infeasible. Considering this, we adopt a uniform quantization for the inputs and internal network responses (called feature maps) to maintain low on-chip expenses. The Convolutional Neural Network with reduced weight and input/response precision is demonstrated in recognizing two types of images: one is hand-written digit images and the other is real-life images in office scenarios. Both results show that the new network is able to achieve the performance of the neural network with full bit resolution, even though in the new network the bit resolution of both weight and input are significantly reduced, e.g., from 64 bits to 4-5 bits.

  8. Simulations of Large-scale WiFi-based Wireless Networks: Interdisciplinary Challenges and Applications

    OpenAIRE

    Nekovee, Maziar

    2008-01-01

    Wireless Fidelity (WiFi) is the fastest growing wireless technology to date. In addition to providing wire-free connectivity to the Internet WiFi technology also enables mobile devices to connect directly to each other and form highly dynamic wireless adhoc networks. Such distributed networks can be used to perform cooperative communication tasks such ad data routing and information dissemination in the absence of a fixed infrastructure. Furthermore, adhoc grids composed of wirelessly network...

  9. Decentralized State-Observer-Based Traffic Density Estimation of Large-Scale Urban Freeway Network by Dynamic Model

    Directory of Open Access Journals (Sweden)

    Yuqi Guo

    2017-08-01

    Full Text Available In order to estimate traffic densities in a large-scale urban freeway network in an accurate and timely fashion when traffic sensors do not cover the freeway network completely and thus only local measurement data can be utilized, this paper proposes a decentralized state observer approach based on a macroscopic traffic flow model. Firstly, by using the well-known cell transmission model (CTM, the urban freeway network is modeled in the way of distributed systems. Secondly, based on the model, a decentralized observer is designed. With the help of the Lyapunov function and S-procedure theory, the observer gains are computed by using linear matrix inequality (LMI technique. So, the traffic densities of the whole road network can be estimated by the designed observer. Finally, this method is applied to the outer ring of the Beijing’s second ring road and experimental results demonstrate the effectiveness and applicability of the proposed approach.

  10. Multistandard wireless transmission over SSMF and large-core POF for access and in-home networks

    NARCIS (Netherlands)

    Shi, Y.; Morant, M.; Okonkwo, C.M.; Llorente, R.; Tangdiongga, E.; Koonen, A.M.J.

    2012-01-01

    An end-to-end transmission of coexisting multistandard radio (LTE, WiMAX, and UWB) signals is demonstrated for the first time with the transmission over a combined access and in-home networks consisting of 25-km SSMF, 25-m large-core diameter polymethylmethacrylate graded-index plastic optical fiber

  11. Equation Chapter 1 Section 1Cross Layer Design for Localization in Large-Scale Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yuanfeng ZHANG

    2014-02-01

    Full Text Available There are many technical challenges for designing large-scale underwater sensor networks, especially the sensor node localization. Although many papers studied for large-scale sensor node localization, previous studies mainly study the location algorithm without the cross layer design for localization. In this paper, by utilizing the network hierarchical structure of underwater sensor networks, we propose a new large-scale underwater acoustic localization scheme based on cross layer design. In this scheme, localization is performed in a hierarchical way, and the whole localization process focused on the physical layer, data link layer and application layer. We increase the pipeline parameters which matched the acoustic channel, added in MAC protocol to increase the authenticity of the large-scale underwater sensor networks, and made analysis of different location algorithm. We conduct extensive simulations, and our results show that MAC layer protocol and the localization algorithm all would affect the result of localization which can balance the trade-off between localization accuracy, localization coverage, and communication cost.

  12. Large-scale cortico-subcortical functional networks in focal epilepsies: The role of the basal ganglia

    Directory of Open Access Journals (Sweden)

    Eva Výtvarová

    2017-01-01

    Significance: Focal epilepsies affect large-scale brain networks beyond the epileptogenic zones. Cortico-subcortical functional connectivity disturbance was displayed in LTLE, FLE, and POLE. Significant changes in the resting-state functional connectivity between cortical and subcortical structures suggest an important role of the BG and thalamus in focal epilepsies.

  13. Network dynamics with BrainX(3): a large-scale simulation of the human brain network with real-time interaction.

    Science.gov (United States)

    Arsiwalla, Xerxes D; Zucca, Riccardo; Betella, Alberto; Martinez, Enrique; Dalmazzo, David; Omedas, Pedro; Deco, Gustavo; Verschure, Paul F M J

    2015-01-01

    BrainX(3) is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX(3) in real-time by perturbing brain regions with transient stimulations to observe reverberating network activity, simulate lesion dynamics or implement network analysis functions from a library of graph theoretic measures. BrainX(3) can thus be used as a novel immersive platform for exploration and analysis of dynamical activity patterns in brain networks, both at rest or in a task-related state, for discovery of signaling pathways associated to brain function and/or dysfunction and as a tool for virtual neurosurgery. Our results demonstrate these functionalities and shed insight on the dynamics of the resting-state attractor. Specifically, we found that a noisy network seems to favor a low firing attractor state. We also found that the dynamics of a noisy network is less resilient to lesions. Our simulations on TMS perturbations show that even though TMS inhibits most of the network, it also sparsely excites a few regions. This is presumably due to anti-correlations in the dynamics and suggests that even a lesioned network can show sparsely distributed increased activity compared to healthy resting-state, over specific brain areas.

  14. Network dynamics with BrainX3: a large-scale simulation of the human brain network with real-time interaction

    Science.gov (United States)

    Arsiwalla, Xerxes D.; Zucca, Riccardo; Betella, Alberto; Martinez, Enrique; Dalmazzo, David; Omedas, Pedro; Deco, Gustavo; Verschure, Paul F. M. J.

    2015-01-01

    BrainX3 is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX3 in real-time by perturbing brain regions with transient stimulations to observe reverberating network activity, simulate lesion dynamics or implement network analysis functions from a library of graph theoretic measures. BrainX3 can thus be used as a novel immersive platform for exploration and analysis of dynamical activity patterns in brain networks, both at rest or in a task-related state, for discovery of signaling pathways associated to brain function and/or dysfunction and as a tool for virtual neurosurgery. Our results demonstrate these functionalities and shed insight on the dynamics of the resting-state attractor. Specifically, we found that a noisy network seems to favor a low firing attractor state. We also found that the dynamics of a noisy network is less resilient to lesions. Our simulations on TMS perturbations show that even though TMS inhibits most of the network, it also sparsely excites a few regions. This is presumably due to anti-correlations in the dynamics and suggests that even a lesioned network can show sparsely distributed increased activity compared to healthy resting-state, over specific brain areas. PMID:25759649

  15. Network Dynamics with BrainX3: A Large-Scale Simulation of the Human Brain Network with Real-Time Interaction

    Directory of Open Access Journals (Sweden)

    Xerxes D. Arsiwalla

    2015-02-01

    Full Text Available BrainX3 is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX3 in real-time by perturbing brain regions with transient stimulations to observe reverberating network activity, simulate lesion dynamics or implement network analysis functions from a library of graph theoretic measures. BrainX3 can thus be used as a novel immersive platform for real-time exploration and analysis of dynamical activity patterns in brain networks, both at rest or in a task-related state, for discovery of signaling pathways associated to brain function and/or dysfunction and as a tool for virtual neurosurgery. Our results demonstrate these functionalities and shed insight on the dynamics of the resting-state attractor. Specifically, we found that a noisy network seems to favor a low firing attractor state. We also found that the dynamics of a noisy network is less resilient to lesions. Our simulations on TMS perturbations show that even though TMS inhibits most of the network, it also sparsely excites a few regions. This is presumably, due to anti-correlations in the dynamics and suggests that even a lesioned network can show sparsely distributed increased activity compared to healthy resting-state, over specific brain areas.

  16. Overlapping community detection based on link graph using distance dynamics

    Science.gov (United States)

    Chen, Lei; Zhang, Jing; Cai, Li-Jun

    2018-01-01

    The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

  17. Humans and Deep Networks Largely Agree on Which Kinds of Variation Make Object Recognition Harder.

    Science.gov (United States)

    Kheradpisheh, Saeed R; Ghodrati, Masoud; Ganjtabesh, Mohammad; Masquelier, Timothée

    2016-01-01

    View-invariant object recognition is a challenging problem that has attracted much attention among the psychology, neuroscience, and computer vision communities. Humans are notoriously good at it, even if some variations are presumably more difficult to handle than others (e.g., 3D rotations). Humans are thought to solve the problem through hierarchical processing along the ventral stream, which progressively extracts more and more invariant visual features. This feed-forward architecture has inspired a new generation of bio-inspired computer vision systems called deep convolutional neural networks (DCNN), which are currently the best models for object recognition in natural images. Here, for the first time, we systematically compared human feed-forward vision and DCNNs at view-invariant object recognition task using the same set of images and controlling the kinds of transformation (position, scale, rotation in plane, and rotation in depth) as well as their magnitude, which we call "variation level." We used four object categories: car, ship, motorcycle, and animal. In total, 89 human subjects participated in 10 experiments in which they had to discriminate between two or four categories after rapid presentation with backward masking. We also tested two recent DCNNs (proposed respectively by Hinton's group and Zisserman's group) on the same tasks. We found that humans and DCNNs largely agreed on the relative difficulties of each kind of variation: rotation in depth is by far the hardest transformation to handle, followed by scale, then rotation in plane, and finally position (much easier). This suggests that DCNNs would be reasonable models of human feed-forward vision. In addition, our results show that the variation levels in rotation in depth and scale strongly modulate both humans' and DCNNs' recognition performances. We thus argue that these variations should be controlled in the image datasets used in vision research.

  18. Humans and deep networks largely agree on which kinds of variation make object recognition harder

    Directory of Open Access Journals (Sweden)

    Saeed Reza Kheradpisheh

    2016-08-01

    Full Text Available View-invariant object recognition is a challenging problem that has attracted much attention among the psychology, neuroscience, and computer vision communities. Humans are notoriously good at it, even if some variations are presumably more difficult to handle than others (e.g. 3D rotations. Humans are thought to solve the problem through hierarchical processing along the ventral stream, which progressively extracts more and more invariant visual features. This feed-forward architecture has inspired a new generation of bio-inspired computer vision systems called deep convolutional neural networks (DCNN, which are currently the best models for object recognition in natural images. Here, for the first time, we systematically compared human feed-forward vision and DCNNs at view-invariant object recognition task using the same set of images and controlling the kinds of transformation (position, scale, rotation in plane, and rotation in depth as well as their magnitude, which we call variation level. We used four object categories: car, ship, motorcycle, and animal. In total, 89 human subjects participated in 10 experiments in which they had to discriminate between two or four categories after rapid presentation with backward masking. We also tested two recent DCNNs (proposed respectively by Hinton's group and Zisserman's group on the same tasks. We found that humans and DCNNs largely agreed on the relative difficulties of each kind of variation: rotation in depth is by far the hardest transformation to handle, followed by scale, then rotation in plane, and finally position (much easier. This suggests that DCNNs would be reasonable models of human feed-forward vision. In addition, our results show that the variation levels in rotation in depth and scale strongly modulate both humans' and DCNNs' recognition performances. We thus argue that these variations should be controlled in the image datasets used in vision research.

  19. "Mitochondrial neuropathies": A survey from the large cohort of the Italian Network.

    Science.gov (United States)

    Mancuso, Michelangelo; Orsucci, Daniele; Angelini, Corrado; Bertini, Enrico; Carelli, Valerio; Comi, Giacomo Pietro; Federico, Antonio; Minetti, Carlo; Moggio, Maurizio; Mongini, Tiziana; Tonin, Paola; Toscano, Antonio; Bruno, Claudio; Ienco, Elena Caldarazzo; Filosto, Massimiliano; Lamperti, Costanza; Diodato, Daria; Moroni, Isabella; Musumeci, Olimpia; Pegoraro, Elena; Spinazzi, Marco; Ahmed, Naghia; Sciacco, Monica; Vercelli, Liliana; Ardissone, Anna; Zeviani, Massimo; Siciliano, Gabriele

    2016-01-01

    Involvement of the peripheral nervous system in mitochondrial disorders has been previously reported. However, the prevalence of peripheral neuropathy in mitochondrial disorders is still unclear. Based on the large database of the "Nation-wide Italian Collaborative Network of Mitochondrial Diseases", we reviewed the clinical data of 1200 patients, with special regard to peripheral neuropathy (mean age at onset 24.3 ± 20.1 years; age at last evaluation 39.8 ± 22.3 years; females 52.7%; childhood onset [before age 16 years] 43.1%). Peripheral neuropathy was present in 143/1156 patients (12.4%), being one of the ten most common signs and symptoms. POLG mutations cause a potentially painful, axonal/mixed, mainly sensory polyneuropathy; TYMP mutations lead to a demyelinating sensory-motor polyneuropathy; SURF1 mutations are associated with a demyelinating/mixed sensory-motor polyneuropathy. The only mtDNA mutation consistently associated with peripheral neuropathy (although less severely than in the above-considered nuclear genes) was the m.8993T > G (or the rarer T > C) changes, which lead to an axonal, mainly sensory polyneuropathy. In conclusion, peripheral neuropathy is one of the most common features of a mitochondrial disorder, and may negatively impact on the quality of life of these patients. Furthermore, the presence or absence of peripheral neuropathy, as well as its specific forms and the association with neuropathic pain (indicative of a POLG-associated disease) can guide the molecular analysis. Copyright © 2016 Elsevier B.V. All rights reserved.

  20. Wireless multihop networks with stealing : large buffer asymptotics via the ray method

    NARCIS (Netherlands)

    Guillemin, F.; Knessl, C.; Leeuwaarden, van J.S.H.

    2011-01-01

    Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multihop networks is the hidden node problem, which causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability $p$.

  1. A dedicated tool for analysing protection selectivity and back-up in large MV networks

    NARCIS (Netherlands)

    Rombouts, S. P.J.; Morren, J.

    2010-01-01

    Due to integration of distributed generation the operation of medium-voltage distribution networks is becoming more difficult. This paper describes a dedicated simulation tool that can be used to study the protection coordination in the network. One of the main advantages of the program is that it

  2. Communication efficiency and congestion of signal traffic in large-scale brain networks.

    Science.gov (United States)

    Mišić, Bratislav; Sporns, Olaf; McIntosh, Anthony R

    2014-01-01

    The complex connectivity of the cerebral cortex suggests that inter-regional communication is a primary function. Using computational modeling, we show that anatomical connectivity may be a major determinant for global information flow in brain networks. A macaque brain network was implemented as a communication network in which signal units flowed between grey matter nodes along white matter paths. Compared to degree-matched surrogate networks, information flow on the macaque brain network was characterized by higher loss rates, faster transit times and lower throughput, suggesting that neural connectivity may be optimized for speed rather than fidelity. Much of global communication was mediated by a "rich club" of hub regions: a sub-graph comprised of high-degree nodes that are more densely interconnected with each other than predicted by chance. First, macaque communication patterns most closely resembled those observed for a synthetic rich club network, but were less similar to those seen in a synthetic small world network, suggesting that the former is a more fundamental feature of brain network topology. Second, rich club regions attracted the most signal traffic and likewise, connections between rich club regions carried more traffic than connections between non-rich club regions. Third, a number of rich club regions were significantly under-congested, suggesting that macaque connectivity actively shapes information flow, funneling traffic towards some nodes and away from others. Together, our results indicate a critical role of the rich club of hub nodes in dynamic aspects of global brain communication.

  3. Note: Design and development of wireless controlled aerosol sampling network for large scale aerosol dispersion experiments

    International Nuclear Information System (INIS)

    Gopalakrishnan, V.; Subramanian, V.; Baskaran, R.; Venkatraman, B.

    2015-01-01

    Wireless based custom built aerosol sampling network is designed, developed, and implemented for environmental aerosol sampling. These aerosol sampling systems are used in field measurement campaign, in which sodium aerosol dispersion experiments have been conducted as a part of environmental impact studies related to sodium cooled fast reactor. The sampling network contains 40 aerosol sampling units and each contains custom built sampling head and the wireless control networking designed with Programmable System on Chip (PSoC™) and Xbee Pro RF modules. The base station control is designed using graphical programming language LabView. The sampling network is programmed to operate in a preset time and the running status of the samplers in the network is visualized from the base station. The system is developed in such a way that it can be used for any other environment sampling system deployed in wide area and uneven terrain where manual operation is difficult due to the requirement of simultaneous operation and status logging

  4. Note: Design and development of wireless controlled aerosol sampling network for large scale aerosol dispersion experiments

    Energy Technology Data Exchange (ETDEWEB)

    Gopalakrishnan, V.; Subramanian, V.; Baskaran, R.; Venkatraman, B. [Radiation Impact Assessment Section, Radiological Safety Division, Indira Gandhi Centre for Atomic Research, Kalpakkam 603 102 (India)

    2015-07-15

    Wireless based custom built aerosol sampling network is designed, developed, and implemented for environmental aerosol sampling. These aerosol sampling systems are used in field measurement campaign, in which sodium aerosol dispersion experiments have been conducted as a part of environmental impact studies related to sodium cooled fast reactor. The sampling network contains 40 aerosol sampling units and each contains custom built sampling head and the wireless control networking designed with Programmable System on Chip (PSoC™) and Xbee Pro RF modules. The base station control is designed using graphical programming language LabView. The sampling network is programmed to operate in a preset time and the running status of the samplers in the network is visualized from the base station. The system is developed in such a way that it can be used for any other environment sampling system deployed in wide area and uneven terrain where manual operation is difficult due to the requirement of simultaneous operation and status logging.

  5. Grid adaptation using chimera composite overlapping meshes

    Science.gov (United States)

    Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

    1994-01-01

    The objective of this paper is to perform grid adaptation using composite overlapping meshes in regions of large gradient to accurately capture the salient features during computation. The chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using trilinear interpolation. Application to the Euler equations for shock reflections and to shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well-resolved.

  6. Grid adaption using Chimera composite overlapping meshes

    Science.gov (United States)

    Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

    1993-01-01

    The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.

  7. Overlapping structures in sensory-motor mappings.

    Directory of Open Access Journals (Sweden)

    Kevin Earland

    Full Text Available This paper examines a biologically-inspired representation technique designed for the support of sensory-motor learning in developmental robotics. An interesting feature of the many topographic neural sheets in the brain is that closely packed receptive fields must overlap in order to fully cover a spatial region. This raises interesting scientific questions with engineering implications: e.g. is overlap detrimental? does it have any benefits? This paper examines the effects and properties of overlap between elements arranged in arrays or maps. In particular we investigate how overlap affects the representation and transmission of spatial location information on and between topographic maps. Through a series of experiments we determine the conditions under which overlap offers advantages and identify useful ranges of overlap for building mappings in cognitive robotic systems. Our motivation is to understand the phenomena of overlap in order to provide guidance for application in sensory-motor learning robots.

  8. Large-scale network analysis of imagination reveals extended but limited top-down components in human visual cognition.

    Directory of Open Access Journals (Sweden)

    Verkhlyutov V.M.

    2014-12-01

    Full Text Available We investigated whole-brain functional magnetic resonance imaging (fMRI activation in a group of 21 healthy adult subjects during perception, imagination and remembering of two dynamic visual scenarios. Activation of the posterior parts of the cortex prevailed when watching videos. The cognitive tasks of imagination and remembering were accompanied by a predominant activity in the anterior parts of the cortex. An independent component analysis identified seven large-scale cortical networks with relatively invariant spatial distributions across all experimental conditions. The time course of their activation over experimental sessions was task-dependent. These detected networks can be interpreted as a recombination of resting state networks. Both central and peripheral networks were identified within the primary visual cortex. The central network around the caudal pole of BA17 and centers of other visual areas was activated only by direct visual stimulation, while the peripheral network responded to the presentation of visual information as well as to the cognitive tasks of imagination and remembering. The latter result explains the particular susceptibility of peripheral and twilight vision to cognitive top-down influences that often result in false-alarm detections.

  9. Network Dynamics with BrainX3: A Large-Scale Simulation of the Human Brain Network with Real-Time Interaction

    OpenAIRE

    Xerxes D. Arsiwalla; Riccardo eZucca; Alberto eBetella; Enrique eMartinez; David eDalmazzo; Pedro eOmedas; Gustavo eDeco; Gustavo eDeco; Paul F.M.J. Verschure; Paul F.M.J. Verschure

    2015-01-01

    BrainX3 is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX3 in real-time by perturbing brain regions with transient stimula...

  10. Network dynamics with BrainX3: a large-scale simulation of the human brain network with real-time interaction

    OpenAIRE

    Arsiwalla, Xerxes D.; Zucca, Riccardo; Betella, Alberto; Martínez, Enrique, 1961-; Dalmazzo, David; Omedas, Pedro; Deco, Gustavo; Verschure, Paul F. M. J.

    2015-01-01

    BrainX3 is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX3 in real-time by perturbing brain regions with transient stimula...

  11. Large-scale brain networks in affective and social neuroscience: Towards an integrative functional architecture of the brain

    Science.gov (United States)

    Barrett, Lisa Feldman; Satpute, Ajay

    2013-01-01

    Understanding how a human brain creates a human mind ultimately depends on mapping psychological categories and concepts to physical measurements of neural response. Although it has long been assumed that emotional, social, and cognitive phenomena are realized in the operations of separate brain regions or brain networks, we demonstrate that it is possible to understand the body of neuroimaging evidence using a framework that relies on domain general, distributed structure-function mappings. We review current research in affective and social neuroscience and argue that the emerging science of large-scale intrinsic brain networks provides a coherent framework for a domain-general functional architecture of the human brain. PMID:23352202

  12. An access alternative for mobile satellite networks

    Science.gov (United States)

    Wu, W. W.

    1988-01-01

    Conceptually, this paper discusses strategies of digital satellite communication networks for a very large number of low density traffic stations. These stations can be either aeronautical, land mobile, or maritime. The techniques can be applied to international, domestic, regional, and special purpose satellite networks. The applications can be commercial, scientific, military, emergency, navigational or educational. The key strategy is the use of a non-orthogonal access method, which tolerates overlapping signals. With n being either time or frequency partitions, and with a single overlapping signal allowed, a low cost mobile satellite system can be designed with n squared (n squared + n + 1) number of terminals.

  13. Unified Tractable Model for Large-Scale Networks Using Stochastic Geometry: Analysis and Design

    KAUST Repository

    Afify, Laila H.

    2016-01-01

    about the interferers symbols can be approximated via the Gaussian signaling approach. The developed mathematical model presents twofold analysis unification for uplink and downlink cellular networks literature. It aligns the tangible decoding error

  14. On the network protocol performance evaluation for large scale communication system of nuclear plant

    International Nuclear Information System (INIS)

    Song, K. S.; Lee, T. H.; Kim, H. R.; Kim, D. H.; Ku, I. S.

    1998-01-01

    Computer technology has been dramatically advanced and it is now natural to apply digital network technology into nuclear plants. Communication architecture for nuclear plant defines the coordination of safety reactor control, balance of plant, subsystem utilities, and plant monitoring functions, and how they are connected and their user interface to guarantee plant performance and guarantee safety requirements. Therefore, to implement a digital network for control and monitoring systems of advanced nuclear plant needs systematic design and evaluation procedures because of responsive and hard real-time process characteristics of nuclear plant. In this paper, we evaluate several digital network protocols in terms of network delay, link failure effects to hard real-time requirements with full scale traffic

  15. Real-time Railway Traffic Management : Dispatching in complex, large and busy railway networks

    NARCIS (Netherlands)

    Corman, F.

    2010-01-01

    Railway is an important and sustainable transportation mode, which despite good potentials results in a limited attractiveness, mostly due to the perceived consequences of unreliability. In fact, busy railway networks with frequent and heterogeneous services are highly sensitive to delay

  16. A network approach to large-scale experimental data acquisition and analysis

    International Nuclear Information System (INIS)

    Corbould, M.A.; How, J.A.

    1984-01-01

    The Plasma Research Laboatory at the Australian National University has developed a sophisticated and flexible data acquisition system for its LT-4 tokamak that requires very little support to construct, maintain and expand. It is novel in that is based on a minicomputer network and is built almost entirely of commercially available products. Benchmarks show that the network system outperforms conventional stand-alone and time-shared data systems

  17. Obesity and addiction: neurobiological overlaps.

    Science.gov (United States)

    Volkow, N D; Wang, G-J; Tomasi, D; Baler, R D

    2013-01-01

    Drug addiction and obesity appear to share several properties. Both can be defined as disorders in which the saliency of a specific type of reward (food or drug) becomes exaggerated relative to, and at the expense of others rewards. Both drugs and food have powerful reinforcing effects, which are in part mediated by abrupt dopamine increases in the brain reward centres. The abrupt dopamine increases, in vulnerable individuals, can override the brain's homeostatic control mechanisms. These parallels have generated interest in understanding the shared vulnerabilities between addiction and obesity. Predictably, they also engendered a heated debate. Specifically, brain imaging studies are beginning to uncover common features between these two conditions and delineate some of the overlapping brain circuits whose dysfunctions may underlie the observed deficits. The combined results suggest that both obese and drug-addicted individuals suffer from impairments in dopaminergic pathways that regulate neuronal systems associated not only with reward sensitivity and incentive motivation, but also with conditioning, self-control, stress reactivity and interoceptive awareness. In parallel, studies are also delineating differences between them that centre on the key role that peripheral signals involved with homeostatic control exert on food intake. Here, we focus on the shared neurobiological substrates of obesity and addiction. © 2012 The Authors. obesity reviews © 2012 International Association for the Study of Obesity.

  18. Epidemic Wave Dynamics Attributable to Urban Community Structure: A Theoretical Characterization of Disease Transmission in a Large Network

    Science.gov (United States)

    Eggo, Rosalind M; Lenczner, Michael

    2015-01-01

    Background Multiple waves of transmission during infectious disease epidemics represent a major public health challenge, but the ecological and behavioral drivers of epidemic resurgence are poorly understood. In theory, community structure—aggregation into highly intraconnected and loosely interconnected social groups—within human populations may lead to punctuated outbreaks as diseases progress from one community to the next. However, this explanation has been largely overlooked in favor of temporal shifts in environmental conditions and human behavior and because of the difficulties associated with estimating large-scale contact patterns. Objective The aim was to characterize naturally arising patterns of human contact that are capable of producing simulated epidemics with multiple wave structures. Methods We used an extensive dataset of proximal physical contacts between users of a public Wi-Fi Internet system to evaluate the epidemiological implications of an empirical urban contact network. We characterized the modularity (community structure) of the network and then estimated epidemic dynamics under a percolation-based model of infectious disease spread on the network. We classified simulated epidemics as multiwave using a novel metric and we identified network structures that were critical to the network’s ability to produce multiwave epidemics. Results We identified robust community structure in a large, empirical urban contact network from which multiwave epidemics may emerge naturally. This pattern was fueled by a special kind of insularity in which locally popular individuals were not the ones forging contacts with more distant social groups. Conclusions Our results suggest that ordinary contact patterns can produce multiwave epidemics at the scale of a single urban area without the temporal shifts that are usually assumed to be responsible. Understanding the role of community structure in epidemic dynamics allows officials to anticipate epidemic

  19. Large Scale Environmental Monitoring through Integration of Sensor and Mesh Networks

    Directory of Open Access Journals (Sweden)

    Raja Jurdak

    2008-11-01

    Full Text Available Monitoring outdoor environments through networks of wireless sensors has received interest for collecting physical and chemical samples at high spatial and temporal scales. A central challenge to environmental monitoring applications of sensor networks is the short communication range of the sensor nodes, which increases the complexity and cost of monitoring commodities that are located in geographically spread areas. To address this issue, we propose a new communication architecture that integrates sensor networks with medium range wireless mesh networks, and provides users with an advanced web portal for managing sensed information in an integrated manner. Our architecture adopts a holistic approach targeted at improving the user experience by optimizing the system performance for handling data that originates at the sensors, traverses the mesh network, and resides at the server for user consumption. This holistic approach enables users to set high level policies that can adapt the resolution of information collected at the sensors, set the preferred performance targets for their application, and run a wide range of queries and analysis on both real-time and historical data. All system components and processes will be described in this paper.

  20. Large Scale Environmental Monitoring through Integration of Sensor and Mesh Networks.

    Science.gov (United States)

    Jurdak, Raja; Nafaa, Abdelhamid; Barbirato, Alessio

    2008-11-24

    Monitoring outdoor environments through networks of wireless sensors has received interest for collecting physical and chemical samples at high spatial and temporal scales. A central challenge to environmental monitoring applications of sensor networks is the short communication range of the sensor nodes, which increases the complexity and cost of monitoring commodities that are located in geographically spread areas. To address this issue, we propose a new communication architecture that integrates sensor networks with medium range wireless mesh networks, and provides users with an advanced web portal for managing sensed information in an integrated manner. Our architecture adopts a holistic approach targeted at improving the user experience by optimizing the system performance for handling data that originates at the sensors, traverses the mesh network, and resides at the server for user consumption. This holistic approach enables users to set high level policies that can adapt the resolution of information collected at the sensors, set the preferred performance targets for their application, and run a wide range of queries and analysis on both real-time and historical data. All system components and processes will be described in this paper.

  1. Limitations of demand- and pressure-driven modeling for large deficient networks

    Science.gov (United States)

    Braun, Mathias; Piller, Olivier; Deuerlein, Jochen; Mortazavi, Iraj

    2017-10-01

    The calculation of hydraulic state variables for a network is an important task in managing the distribution of potable water. Over the years the mathematical modeling process has been improved by numerous researchers for utilization in new computer applications and the more realistic modeling of water distribution networks. But, in spite of these continuous advances, there are still a number of physical phenomena that may not be tackled correctly by current models. This paper will take a closer look at the two modeling paradigms given by demand- and pressure-driven modeling. The basic equations are introduced and parallels are drawn with the optimization formulations from electrical engineering. These formulations guarantee the existence and uniqueness of the solution. One of the central questions of the French and German research project ResiWater is the investigation of the network resilience in the case of extreme events or disasters. Under such extraordinary conditions where models are pushed beyond their limits, we talk about deficient network models. Examples of deficient networks are given by highly regulated flow, leakage or pipe bursts and cases where pressure falls below the vapor pressure of water. These examples will be presented and analyzed on the solvability and physical correctness of the solution with respect to demand- and pressure-driven models.

  2. Developing Large-Scale Bayesian Networks by Composition: Fault Diagnosis of Electrical Power Systems in Aircraft and Spacecraft

    Science.gov (United States)

    Mengshoel, Ole Jakob; Poll, Scott; Kurtoglu, Tolga

    2009-01-01

    In this paper, we investigate the use of Bayesian networks to construct large-scale diagnostic systems. In particular, we consider the development of large-scale Bayesian networks by composition. This compositional approach reflects how (often redundant) subsystems are architected to form systems such as electrical power systems. We develop high-level specifications, Bayesian networks, clique trees, and arithmetic circuits representing 24 different electrical power systems. The largest among these 24 Bayesian networks contains over 1,000 random variables. Another BN represents the real-world electrical power system ADAPT, which is representative of electrical power systems deployed in aerospace vehicles. In addition to demonstrating the scalability of the compositional approach, we briefly report on experimental results from the diagnostic competition DXC, where the ProADAPT team, using techniques discussed here, obtained the highest scores in both Tier 1 (among 9 international competitors) and Tier 2 (among 6 international competitors) of the industrial track. While we consider diagnosis of power systems specifically, we believe this work is relevant to other system health management problems, in particular in dependable systems such as aircraft and spacecraft. (See CASI ID 20100021910 for supplemental data disk.)

  3. Measuring the extent of overlaps in protected area designations.

    Science.gov (United States)

    Deguignet, Marine; Arnell, Andy; Juffe-Bignoli, Diego; Shi, Yichuan; Bingham, Heather; MacSharry, Brian; Kingston, Naomi

    2017-01-01

    Over the past decades, a number of national policies and international conventions have been implemented to promote the expansion of the world's protected area network, leading to a diversification of protected area strategies, types and designations. As a result, many areas are protected by more than one convention, legal instrument, or other effective means which may result in a lack of clarity around the governance and management regimes of particular locations. We assess the degree to which different designations overlap at global, regional and national levels to understand the extent of this phenomenon at different scales. We then compare the distribution and coverage of these multi-designated areas in the terrestrial and marine realms at the global level and among different regions, and we present the percentage of each county's protected area extent that is under more than one designation. Our findings show that almost a quarter of the world's protected area network is protected through more than one designation. In fact, we have documented up to eight overlapping designations. These overlaps in protected area designations occur in every region of the world, both in the terrestrial and marine realms, but are more common in the terrestrial realm and in some regions, notably Europe. In the terrestrial realm, the most common overlap is between one national and one international designation. In the marine realm, the most common overlap is between any two national designations. Multi-designations are therefore a widespread phenomenon but its implications are not well understood. This analysis identifies, for the first time, multi-designated areas across all designation types. This is a key step to understand how these areas are managed and governed to then move towards integrated and collaborative approaches that consider the different management and conservation objectives of each designation.

  4. Towards Agent-Based Simulation of Emerging and Large-Scale Social Networks. Examples of the Migrant Crisis and MMORPGs

    Directory of Open Access Journals (Sweden)

    Schatten, Markus

    2016-10-01

    Full Text Available Large-scale agent based simulation of social networks is described in the context of the migrant crisis in Syria and the EU as well as massively multi-player on-line role playing games (MMORPG. The recipeWorld system by Terna and Fontana is proposed as a possible solution to simulating large-scale social networks. The initial system has been re-implemented using the Smart Python multi-Agent Development Environment (SPADE and Pyinteractive was used for visualization. We present initial models of simulation that we plan to develop further in future studies. Thus this paper is research in progress that will hopefully establish a novel agent-based modelling system in the context of the ModelMMORPG project.

  5. The Strip Clustering Scheme for data collection in large-scale Wireless Sensing Network of the road

    Directory of Open Access Journals (Sweden)

    Zhoujing Ye

    2018-03-01

    Full Text Available For intelligent traffic and road structural health monitoring, Wireless Sensing Network has been applied widely in transportation, and large quantity of sensor nodes have been embedded in roadways. Now the service lives of sensors are limited mainly because of their battery power storage. So the life cycle of the whole network can be extended if the service life of each sensor in the network is prolonged. In this paper, the Strip Clustering Scheme (SCS is proposed to replace the Conventional Scheme (CS. This method includes region division, cluster head node selection, link construction, data fusion and transmission. Adopting SCS can reduce a lot of redundant data and the total energy consumption of the network by data fusion. In addition, adopting SCS can also extend the monitoring area without increasing the communication range of the Access Point (AP, and facilitate further expansion of the network as a result. Based on the numerically simulated results, CS method can be used for the WSN within 75 m, and SCS method is more suitable when the monitoring range is larger than 75 m. To achieve the optimal network costs and the network life cycle by using SCS, the range of d (the longitudinal spacing of adjacent nodes, is suggested as 10–12.5 m and the energy of cluster head nodes is 60% higher than the energy of non-head nodes with fixed w (the transverse distance of adjacent nodes. And the extra energy of head nodes can be obtained by adding the number of battery within the head nodes or using renewable energy technologies. Keywords: WSN, Road, Energy consumption, Conventional Scheme, Strip Clustering Scheme

  6. Applying 4-regular grid structures in large-scale access networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Knudsen, Thomas P.; Patel, Ahmed

    2006-01-01

    4-Regular grid structures have been used in multiprocessor systems for decades due to a number of nice properties with regard to routing, protection, and restoration, together with a straightforward planar layout. These qualities are to an increasing extent demanded also in largescale access...... networks, but concerning protection and restoration these demands have been met only to a limited extent by the commonly used ring and tree structures. To deal with the fact that classical 4-regular grid structures are not directly applicable in such networks, this paper proposes a number of extensions...... concerning restoration, protection, scalability, embeddability, flexibility, and cost. The extensions are presented as a tool case, which can be used for implementing semi-automatic and in the longer term full automatic network planning tools....

  7. Insights into a spatially embedded social network from a large-scale snowball sample

    Science.gov (United States)

    Illenberger, J.; Kowald, M.; Axhausen, K. W.; Nagel, K.

    2011-12-01

    Much research has been conducted to obtain insights into the basic laws governing human travel behaviour. While the traditional travel survey has been for a long time the main source of travel data, recent approaches to use GPS data, mobile phone data, or the circulation of bank notes as a proxy for human travel behaviour are promising. The present study proposes a further source of such proxy-data: the social network. We collect data using an innovative snowball sampling technique to obtain details on the structure of a leisure-contacts network. We analyse the network with respect to its topology, the individuals' characteristics, and its spatial structure. We further show that a multiplication of the functions describing the spatial distribution of leisure contacts and the frequency of physical contacts results in a trip distribution that is consistent with data from the Swiss travel survey.

  8. Annotating gene sets by mining large literature collections with protein networks.

    Science.gov (United States)

    Wang, Sheng; Ma, Jianzhu; Yu, Michael Ku; Zheng, Fan; Huang, Edward W; Han, Jiawei; Peng, Jian; Ideker, Trey

    2018-01-01

    Analysis of patient genomes and transcriptomes routinely recognizes new gene sets associated with human disease. Here we present an integrative natural language processing system which infers common functions for a gene set through automatic mining of the scientific literature with biological networks. This system links genes with associated literature phrases and combines these links with protein interactions in a single heterogeneous network. Multiscale functional annotations are inferred based on network distances between phrases and genes and then visualized as an ontology of biological concepts. To evaluate this system, we predict functions for gene sets representing known pathways and find that our approach achieves substantial improvement over the conventional text-mining baseline method. Moreover, our system discovers novel annotations for gene sets or pathways without previously known functions. Two case studies demonstrate how the system is used in discovery of new cancer-related pathways with ontological annotations.

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

    Science.gov (United States)

    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.

  10. Reorganization of large-scale cognitive networks during automation of imagination of a complex sequential movement.

    Science.gov (United States)

    Sauvage, C; De Greef, N; Manto, M; Jissendi, P; Nioche, C; Habas, C

    2015-04-01

    We investigated the functional reconfiguration of the cerebral networks involved in imagination of sequential movements of the left foot, both performed at regular and fast speed after mental imagery training. Thirty-five volunteers were scanned with a 3T MRI while they imagined a sequence of ankle movements (dorsiflexion, plantar flexion, varus and valgus) before and after mental practice. Subjects were distributed in two groups: the first group executed regular movements whereas the second group made fast movements. We applied the general linear model (GLM) and model-free, exploratory tensorial independent component analytic (TICA) approaches to identify plastic post-training effects on brain activation. GLM showed that post-training imagination of movement was accompanied by a dual effect: a specific recruitment of a medial prefronto-cingulo-parietal circuit reminiscent of the default-mode network, with the left putamen, and a decreased activity of a lateral fronto-parietal network. Training-related subcortical changes only consisted in an increased activity in the left striatum. Unexpectedly, no difference was observed in the cerebellum. TICA also revealed involvement of the left executive network, and of the dorsal control executive network but no significant differences were found between pre- and post-training phases. Therefore, repetitive motor mental imagery induced specific putamen (motor rehearsal) recruitment that one previously observed during learning of overt movements, and, simultaneously, a specific shift of activity from the dorsolateral prefrontal cortex (attention, working memory) to the medial posterior parietal and cingulate cortices (mental imagery and memory rehearsal). Our data complement and confirm the notion that differential and coupled recruitment of cognitive networks can constitute a neural marker of training effects. Copyright © 2014 Elsevier Masson SAS. All rights reserved.

  11. Resting-state functional under-connectivity within and between large-scale cortical networks across three low-frequency bands in adolescents with autism.

    Science.gov (United States)

    Duan, Xujun; Chen, Heng; He, Changchun; Long, Zhiliang; Guo, Xiaonan; Zhou, Yuanyue; Uddin, Lucina Q; Chen, Huafu

    2017-10-03

    Although evidence is accumulating that autism spectrum disorder (ASD) is associated with disruption of functional connections between and within brain networks, it remains largely unknown whether these abnormalities are related to specific frequency bands. To address this question, network contingency analysis was performed on brain functional connectomes obtained from 213 adolescent participants across nine sites in the Autism Brain Imaging Data Exchange (ABIDE) multisite sample, to determine the disrupted connections between and within seven major cortical networks in adolescents with ASD at Slow-5, Slow-4 and Slow-3 frequency bands and further assess whether the aberrant intra- and inter-network connectivity varied as a function of ASD symptoms. Overall under-connectivity within and between large-scale intrinsic networks in ASD was revealed across the three frequency bands. Specifically, decreased connectivity strength within the default mode network (DMN), between DMN and visual network (VN), ventral attention network (VAN), and between dorsal attention network (DAN) and VAN was observed in the lower frequency band (slow-5, slow-4), while decreased connectivity between limbic network (LN) and frontal-parietal network (FPN) was observed in the higher frequency band (slow-3). Furthermore, weaker connectivity within and between specific networks correlated with poorer communication and social interaction skills in the slow-5 band, uniquely. These results demonstrate intrinsic under-connectivity within and between multiple brain networks within predefined frequency bands in ASD, suggesting that frequency-related properties underlie abnormal brain network organization in the disorder. Copyright © 2017 Elsevier Inc. All rights reserved.

  12. Principles of Network Architecture Emerging from Comparisons of the Cerebral Cortex in Large and Small Brains.

    Directory of Open Access Journals (Sweden)

    Barbara L Finlay

    2016-09-01

    Full Text Available The cerebral cortex retains its fundamental organization, layering, and input-output relations as it scales in volume over many orders of magnitude in mammals. How is its network architecture affected by size scaling? By comparing network organization of the mouse and rhesus macaque cortical connectome derived from complete neuroanatomical tracing studies, a recent study in PLOS Biology shows that an exponential distance rule emerges that reveals the falloff in connection probability with distance in the two brains that in turn determines common organizational features.

  13. Cooperative HARQ Assisted NOMA Scheme in Large-scale D2D Networks

    KAUST Repository

    Shi, Zheng; Ma, Shaodan; Elsawy, Hesham; Yang, Guanghua; Alouini, Mohamed-Slim

    2017-01-01

    spatial and temporal correlation in interference, highly overestimates the NOMA performance and produces misleading design insights. An interference oblivious selection for the power and/or transmission rates leads to violating the network outage constraints. To this end, the results demonstrate the effectiveness of NOMA transmission and manifest the importance of the cooperative HARQ to combat the negative effect of the network aggregate interference. For instance, comparing to the non-cooperative HARQ assisted NOMA, the proposed scheme can yield an outage probability reduction by $32$%. Furthermore, an interference aware optimal design that maximizes the LTAT given outage constraints leads to $47$% throughput improvement over HARQ-assisted orthogonal multiple access (OMA) scheme.

  14. Coordinated Multi-layer Multi-domain Optical Network (COMMON) for Large-Scale Science Applications (COMMON)

    Energy Technology Data Exchange (ETDEWEB)

    Vokkarane, Vinod [University of Massachusetts

    2013-09-01

    We intend to implement a Coordinated Multi-layer Multi-domain Optical Network (COMMON) Framework for Large-scale Science Applications. In the COMMON project, specific problems to be addressed include 1) anycast/multicast/manycast request provisioning, 2) deployable OSCARS enhancements, 3) multi-layer, multi-domain quality of service (QoS), and 4) multi-layer, multidomain path survivability. In what follows, we outline the progress in the above categories (Year 1, 2, and 3 deliverables).

  15. Multiscale virtual particle based elastic network model (MVP-ENM) for normal mode analysis of large-sized biomolecules.

    Science.gov (United States)

    Xia, Kelin

    2017-12-20

    In this paper, a multiscale virtual particle based elastic network model (MVP-ENM) is proposed for the normal mode analysis of large-sized biomolecules. The multiscale virtual particle (MVP) model is proposed for the discretization of biomolecular density data. With this model, large-sized biomolecular structures can be coarse-grained into virtual particles such that a balance between model accuracy and computational cost can be achieved. An elastic network is constructed by assuming "connections" between virtual particles. The connection is described by a special harmonic potential function, which considers the influence from both the mass distributions and distance relations of the virtual particles. Two independent models, i.e., the multiscale virtual particle based Gaussian network model (MVP-GNM) and the multiscale virtual particle based anisotropic network model (MVP-ANM), are proposed. It has been found that in the Debye-Waller factor (B-factor) prediction, the results from our MVP-GNM with a high resolution are as good as the ones from GNM. Even with low resolutions, our MVP-GNM can still capture the global behavior of the B-factor very well with mismatches predominantly from the regions with large B-factor values. Further, it has been demonstrated that the low-frequency eigenmodes from our MVP-ANM are highly consistent with the ones from ANM even with very low resolutions and a coarse grid. Finally, the great advantage of MVP-ANM model for large-sized biomolecules has been demonstrated by using two poliovirus virus structures. The paper ends with a conclusion.

  16. A Greedy Algorithm for Neighborhood Overlap-Based Community Detection

    Directory of Open Access Journals (Sweden)

    Natarajan Meghanathan

    2016-01-01

    Full Text Available The neighborhood overlap (NOVER of an edge u-v is defined as the ratio of the number of nodes who are neighbors for both u and v to that of the number of nodes who are neighbors of at least u or v. In this paper, we hypothesize that an edge u-v with a lower NOVER score bridges two or more sets of vertices, with very few edges (other than u-v connecting vertices from one set to another set. Accordingly, we propose a greedy algorithm of iteratively removing the edges of a network in the increasing order of their neighborhood overlap and calculating the modularity score of the resulting network component(s after the removal of each edge. The network component(s that have the largest cumulative modularity score are identified as the different communities of the network. We evaluate the performance of the proposed NOVER-based community detection algorithm on nine real-world network graphs and compare the performance against the multi-level aggregation-based Louvain algorithm, as well as the original and time-efficient versions of the edge betweenness-based Girvan-Newman (GN community detection algorithm.

  17. An Efficient and Reliable Statistical Method for Estimating Functional Connectivity in Large Scale Brain Networks Using Partial Correlation.

    Science.gov (United States)

    Wang, Yikai; Kang, Jian; Kemmer, Phebe B; Guo, Ying

    2016-01-01

    Currently, network-oriented analysis of fMRI data has become an important tool for understanding brain organization and brain networks. Among the range of network modeling methods, partial correlation has shown great promises in accurately detecting true brain network connections. However, the application of partial correlation in investigating brain connectivity, especially in large-scale brain networks, has been limited so far due to the technical challenges in its estimation. In this paper, we propose an efficient and reliable statistical method for estimating partial correlation in large-scale brain network modeling. Our method derives partial correlation based on the precision matrix estimated via Constrained L1-minimization Approach (CLIME), which is a recently developed statistical method that is more efficient and demonstrates better performance than the existing methods. To help select an appropriate tuning parameter for sparsity control in the network estimation, we propose a new Dens-based selection method that provides a more informative and flexible tool to allow the users to select the tuning parameter based on the desired sparsity level. Another appealing feature of the Dens-based method is that it is much faster than the existing methods, which provides an important advantage in neuroimaging applications. Simulation studies show that the Dens-based method demonstrates comparable or better performance with respect to the existing methods in network estimation. We applied the proposed partial correlation method to investigate resting state functional connectivity using rs-fMRI data from the Philadelphia Neurodevelopmental Cohort (PNC) study. Our results show that partial correlation analysis removed considerable between-module marginal connections identified by full correlation analysis, suggesting these connections were likely caused by global effects or common connection to other nodes. Based on partial correlation, we find that the most significant

  18. APINetworks Java. A Java approach to the efficient treatment of large-scale complex networks

    Science.gov (United States)

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

    2016-10-01

    We present a new version of the core structural package of our Application Programming Interface, APINetworks, for the treatment of complex networks in arbitrary computational environments. The new version is written in Java and presents several advantages over the previous C++ version: the portability of the Java code, the easiness of object-oriented design implementations, and the simplicity of memory management. In addition, some additional data structures are introduced for storing the sets of nodes and edges. Also, by resorting to the different garbage collectors currently available in the JVM the Java version is much more efficient than the C++ one with respect to memory management. In particular, the G1 collector is the most efficient one because of the parallel execution of G1 and the Java application. Using G1, APINetworks Java outperforms the C++ version and the well-known NetworkX and JGraphT packages in the building and BFS traversal of linear and complete networks. The better memory management of the present version allows for the modeling of much larger networks.

  19. Must Invisible Colleges Be Invisible? An Approach to Examining Large Communities of Network Users.

    Science.gov (United States)

    Ruth, Stephen R.; Gouet, Raul

    1993-01-01

    Discussion of characteristics of users of computer-mediated communication systems and scientific networks focuses on a study of the scientific community in Chile. Topics addressed include users and nonusers; productivity; educational level; academic specialty; age; gender; international connectivity; public policy issues; and future research…

  20. Benchmark Networks for grid integration impact studies of large PV plants

    DEFF Research Database (Denmark)

    Craciun, Bogdan-Ionut; Kerekes, Tamas; Sera, Dezso

    2013-01-01

    into the system led to stability concerns of the entire system affecting its reliability and availability. In consequence system operators such as the European Network of Transmission System Operators for Electricity (ENTSO-E) had an immediate response imposing strict operating regulations in order to keep...

  1. Non-Orthogonal Multiple Access for Large-Scale 5G Networks: Interference Aware Design

    KAUST Repository

    Ali, Konpal S.; Elsawy, Hesham; Chaaban, Anas; Alouini, Mohamed-Slim

    2017-01-01

    the cell), which is a major performance limiting parameter in 5G networks. This article sheds light on the drastic negative-impact of intercell interference on the NOMA performance and advocates interference-aware NOMA design that jointly accounts for both

  2. COSIGN – developing an optical software controlled data plane for future large-scale datacenter networks

    DEFF Research Database (Denmark)

    Galili, Michael; Kamchevska, Valerija; Fagertun, Anna Manolova

    2015-01-01

    This talk will present the work of the EU project COSIGN targeting the development of optical data plane solutions for future high-capacity datacenter networks (DCNs). Optical data planes with high capacity and high flexibility through software control are developed in order to enable a coherent...

  3. On Hierarchical Extensions of Large-Scale 4-regular Grid Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Patel, A.; Knudsen, Thomas Phillip

    It is studied how the introduction of ordered hierarchies in 4-regular grid network structures decreses distances remarkably, while at the same time allowing for simple topological routing schemes. Both meshes and tori are considered; in both cases non-hierarchical structures have power law depen...

  4. A Self-Adaptive Energy-Efficient Framework for Large Unattended Wireless Sensor Networks

    Science.gov (United States)

    2014-11-06

    Transactions on Vehicular Technology, (10 2011): 3919. doi: 10.1109/ TVT .2011.2166093 Miao Zhao, Yuanyuan Yang. Optimization-Based DistributedAlgorithms for...Networks, IEEE Transactions on Vehicular Technology, (05 2013): 0. doi: 10.1109/ TVT .2012.2229309 Miao Zhao, Ming Ma, Yuanyuan Yang. Applying

  5. A hybrid Genetic and Simulated Annealing Algorithm for Chordal Ring implementation in large-scale networks

    DEFF Research Database (Denmark)

    Riaz, M. Tahir; Gutierrez Lopez, Jose Manuel; Pedersen, Jens Myrup

    2011-01-01

    The paper presents a hybrid Genetic and Simulated Annealing algorithm for implementing Chordal Ring structure in optical backbone network. In recent years, topologies based on regular graph structures gained a lot of interest due to their good communication properties for physical topology of the...

  6. Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks

    DEFF Research Database (Denmark)

    Badiu, Mihai Alin; Saad, David; Coon, Justin P.

    2018-01-01

    We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated...

  7. Disrupted coupling of large-scale networks is associated with relapse behaviour in heroin-dependent men

    Science.gov (United States)

    Li, Qiang; Liu, Jierong; Wang, Wei; Wang, Yarong; Li, Wei; Chen, Jiajie; Zhu, Jia; Yan, Xuejiao; Li, Yongbin; Li, Zhe; Ye, Jianjun; Wang, Wei

    2018-01-01

    Background It is unknown whether impaired coupling among 3 core large-scale brain networks (salience [SN], default mode [DMN] and executive control networks [ECN]) is associated with relapse behaviour in treated heroin-dependent patients. Methods We conducted a prospective resting-state functional MRI study comparing the functional connectivity strength among healthy controls and heroin-dependent men who had either relapsed or were in early remission. Men were considered to be either relapsed or in early remission based on urine drug screens during a 3-month follow-up period. We also examined how the coupling of large-scale networks correlated with relapse behaviour among heroin-dependent men. Results We included 20 controls and 50 heroin-dependent men (26 relapsed and 24 early remission) in our analyses. The relapsed men showed greater connectivity than the early remission and control groups between the dorsal anterior cingulate cortex (key node of the SN) and the dorsomedial prefrontal cortex (included in the DMN). The relapsed men and controls showed lower connectivity than the early remission group between the left dorsolateral prefrontal cortex (key node of the left ECN) and the dorsomedial prefrontal cortex. The percentage of positive urine drug screens positively correlated with the coupling between the dorsal anterior cingulate cortex and dorsomedial prefrontal cortex, but negatively correlated with the coupling between the left dorsolateral prefrontal cortex and dorsomedial prefrontal cortex. Limitations We examined deficits in only 3 core networks leading to relapse behaviour. Other networks may also contribute to relapse. Conclusion Greater coupling between the SN and DMN and lower coupling between the left ECN and DMN is associated with relapse behaviour. These findings may shed light on the development of new treatments for heroin addiction. PMID:29252165

  8. The national stream quality accounting network: A flux-basedapproach to monitoring the water quality of large rivers

    Science.gov (United States)

    Hooper, R.P.; Aulenbach, Brent T.; Kelly, V.J.

    2001-01-01

    Estimating the annual mass flux at a network of fixed stations is one approach to characterizing water quality of large rivers. The interpretive context provided by annual flux includes identifying source and sink areas for constituents and estimating the loadings to receiving waters, such as reservoirs or the ocean. Since 1995, the US Geological Survey's National Stream Quality Accounting Network (NASQAN) has employed this approach at a network of 39 stations in four of the largest river basins of the USA: The Mississippi, the Columbia, the Colorado and the Rio Grande. In this paper, the design of NASQAN is described and its effectiveness at characterizing the water quality of these rivers is evaluated using data from the first 3 years of operation. A broad range of constituents was measured by NASQAN, including trace organic and inorganic chemicals, major ions, sediment and nutrients. Where possible, a regression model relating concentration to discharge and season was used to interpolate between chemical observations for flux estimation. For water-quality network design, the most important finding from NASQAN was the importance of having a specific objective (that is, estimating annual mass flux) and, from that, an explicitly stated data analysis strategy, namely the use of regression models to interpolate between observations. The use of such models aided in the design of sampling strategy and provided a context for data review. The regression models essentially form null hypotheses for concentration variation that can be evaluated by the observed data. The feedback between network operation and data collection established by the hypothesis tests places the water-quality network on a firm scientific footing.

  9. Sensing across large-scale cognitive radio networks: Data processing, algorithms, and testbed for wireless tomography and moving target tracking

    Science.gov (United States)

    Bonior, Jason David

    As the use of wireless devices has become more widespread so has the potential for utilizing wireless networks for remote sensing applications. Regular wireless communication devices are not typically designed for remote sensing. Remote sensing techniques must be carefully tailored to the capabilities of these networks before they can be applied. Experimental verification of these techniques and algorithms requires robust yet flexible testbeds. In this dissertation, two experimental testbeds for the advancement of research into sensing across large-scale cognitive radio networks are presented. System architectures, implementations, capabilities, experimental verification, and performance are discussed. One testbed is designed for the collection of scattering data to be used in RF and wireless tomography research. This system is used to collect full complex scattering data using a vector network analyzer (VNA) and amplitude-only data using non-synchronous software-defined radios (SDRs). Collected data is used to experimentally validate a technique for phase reconstruction using semidefinite relaxation and demonstrate the feasibility of wireless tomography. The second testbed is a SDR network for the collection of experimental data. The development of tools for network maintenance and data collection is presented and discussed. A novel recursive weighted centroid algorithm for device-free target localization using the variance of received signal strength for wireless links is proposed. The signal variance resulting from a moving target is modeled as having contours related to Cassini ovals. This model is used to formulate recursive weights which reduce the influence of wireless links that are farther from the target location estimate. The algorithm and its implementation on this testbed are presented and experimental results discussed.

  10. Timetable-based simulation method for choice set generation in large-scale public transport networks

    DEFF Research Database (Denmark)

    Rasmussen, Thomas Kjær; Anderson, Marie Karen; Nielsen, Otto Anker

    2016-01-01

    The composition and size of the choice sets are a key for the correct estimation of and prediction by route choice models. While existing literature has posed a great deal of attention towards the generation of path choice sets for private transport problems, the same does not apply to public...... transport problems. This study proposes a timetable-based simulation method for generating path choice sets in a multimodal public transport network. Moreover, this study illustrates the feasibility of its implementation by applying the method to reproduce 5131 real-life trips in the Greater Copenhagen Area...... and to assess the choice set quality in a complex multimodal transport network. Results illustrate the applicability of the algorithm and the relevance of the utility specification chosen for the reproduction of real-life path choices. Moreover, results show that the level of stochasticity used in choice set...

  11. Social Transmission of False Memory in Small Groups and Large Networks.

    Science.gov (United States)

    Maswood, Raeya; Rajaram, Suparna

    2018-05-21

    Sharing information and memories is a key feature of social interactions, making social contexts important for developing and transmitting accurate memories and also false memories. False memory transmission can have wide-ranging effects, including shaping personal memories of individuals as well as collective memories of a network of people. This paper reviews a collection of key findings and explanations in cognitive research on the transmission of false memories in small groups. It also reviews the emerging experimental work on larger networks and collective false memories. Given the reconstructive nature of memory, the abundance of misinformation in everyday life, and the variety of social structures in which people interact, an understanding of transmission of false memories has both scientific and societal implications. © 2018 Cognitive Science Society, Inc.

  12. Lewis Research Center studies of multiple large wind turbine generators on a utility network

    Science.gov (United States)

    Gilbert, L. J.; Triezenberg, D. M.

    1979-01-01

    A NASA-Lewis program to study the anticipated performance of a wind turbine generator farm on an electric utility network is surveyed. The paper describes the approach of the Lewis Wind Energy Project Office to developing analysis capabilities in the area of wind turbine generator-utility network computer simulations. Attention is given to areas such as, the Lewis Purdue hybrid simulation, an independent stability study, DOE multiunit plant study, and the WEST simulator. Also covered are the Lewis mod-2 simulation including analog simulation of a two wind turbine system and comparison with Boeing simulation results, and gust response of a two machine model. Finally future work to be done is noted and it is concluded that the study shows little interaction between the generators and between the generators and the bus.

  13. A Feature Selection Method for Large-Scale Network Traffic Classification Based on Spark

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2016-02-01

    Full Text Available Currently, with the rapid increasing of data scales in network traffic classifications, how to select traffic features efficiently is becoming a big challenge. Although a number of traditional feature selection methods using the Hadoop-MapReduce framework have been proposed, the execution time was still unsatisfactory with numeral iterative computations during the processing. To address this issue, an efficient feature selection method for network traffic based on a new parallel computing framework called Spark is proposed in this paper. In our approach, the complete feature set is firstly preprocessed based on Fisher score, and a sequential forward search strategy is employed for subsets. The optimal feature subset is then selected using the continuous iterations of the Spark computing framework. The implementation demonstrates that, on the precondition of keeping the classification accuracy, our method reduces the time cost of modeling and classification, and improves the execution efficiency of feature selection significantly.

  14. Robust node estimation and topology discovery for large-scale networks

    KAUST Repository

    Alouini, Mohamed-Slim

    2017-02-23

    Various examples are provided for node estimation and topology discovery for networks. In one example, a method includes receiving a packet having an identifier from a first node; adding the identifier to another transmission packet based on a comparison between the first identifier and existing identifiers associated with the other packet; adjusting a transmit probability based on the comparison; and transmitting the other packet based on a comparison between the transmit probability and a probability distribution. In another example, a system includes a network device that can adds an identifier received in a packet to a list including existing identifiers and adjust a transmit probability based on a comparison between the identifiers; and transmit another packet based on a comparison between the transmit probability and a probability distribution. In another example, a method includes determining a quantity of sensor devices based on a plurality of identifiers received in a packet.

  15. Operational aspects of CASA UNO '88-The first large scale international GPS geodetic network

    Science.gov (United States)

    Neilan, Ruth E.; Dixon, T. H.; Meehan, Thomas K.; Melbourne, William G.; Scheid, John A.; Kellogg, J. N.; Stowell, J. L.

    1989-01-01

    For three weeks, from January 18 to February 5, 1988, scientists and engineers from 13 countries and 30 international agencies and institutions cooperated in the most extensive GPS (Global Positioning System) field campaign, and the largest geodynamics experiment, in the world to date. This collaborative eperiment concentrated GPS receivers in Central and South America. The predicted rates of motions are on the order of 5-10 cm/yr. Global coverage of GPS observations spanned 220 deg of longitude and 125 deg of latitude using a total of 43 GPS receivers. The experiment was the first civilian effort at implementing an extended international GPS satellite tracking network. Covariance analyses incorporating the extended tracking network predicted significant improvement in precise orbit determination, allowing accurate long-baseline geodesy in the science areas.

  16. Robust node estimation and topology discovery for large-scale networks

    KAUST Repository

    Alouini, Mohamed-Slim; Douik, Ahmed S.; Aly, Salah A.; Al-Naffouri, Tareq Y.

    2017-01-01

    Various examples are provided for node estimation and topology discovery for networks. In one example, a method includes receiving a packet having an identifier from a first node; adding the identifier to another transmission packet based on a comparison between the first identifier and existing identifiers associated with the other packet; adjusting a transmit probability based on the comparison; and transmitting the other packet based on a comparison between the transmit probability and a probability distribution. In another example, a system includes a network device that can adds an identifier received in a packet to a list including existing identifiers and adjust a transmit probability based on a comparison between the identifiers; and transmit another packet based on a comparison between the transmit probability and a probability distribution. In another example, a method includes determining a quantity of sensor devices based on a plurality of identifiers received in a packet.

  17. Delay-Tolerant, Low-Power Protocols for Large Security-Critical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Claudio S. Malavenda

    2012-01-01

    Full Text Available This paper reports the analysis, implementation, and experimental testing of a delay-tolerant and energy-aware protocol for a wireless sensor node, oriented to security applications. The solution proposed takes advantages from different domains considering as a guideline the low power consumption and facing the problems of seamless and lossy connectivity offered by the wireless medium along with very limited resources offered by a wireless network node. The paper is organized as follows: first we give an overview on delay-tolerant wireless sensor networking (DTN; then we perform a simulation-based comparative analysis of state-of-the-art DTN approaches and illustrate the improvement offered by the proposed protocol; finally we present experimental data gathered from the implementation of the proposed protocol on a proprietary hardware node.

  18. Efficient methods for overlapping group lasso.

    Science.gov (United States)

    Yuan, Lei; Liu, Jun; Ye, Jieping

    2013-09-01

    The group Lasso is an extension of the Lasso for feature selection on (predefined) nonoverlapping groups of features. The nonoverlapping group structure limits its applicability in practice. There have been several recent attempts to study a more general formulation where groups of features are given, potentially with overlaps between the groups. The resulting optimization is, however, much more challenging to solve due to the group overlaps. In this paper, we consider the efficient optimization of the overlapping group Lasso penalized problem. We reveal several key properties of the proximal operator associated with the overlapping group Lasso, and compute the proximal operator by solving the smooth and convex dual problem, which allows the use of the gradient descent type of algorithms for the optimization. Our methods and theoretical results are then generalized to tackle the general overlapping group Lasso formulation based on the l(q) norm. We further extend our algorithm to solve a nonconvex overlapping group Lasso formulation based on the capped norm regularization, which reduces the estimation bias introduced by the convex penalty. We have performed empirical evaluations using both a synthetic and the breast cancer gene expression dataset, which consists of 8,141 genes organized into (overlapping) gene sets. Experimental results show that the proposed algorithm is more efficient than existing state-of-the-art algorithms. Results also demonstrate the effectiveness of the nonconvex formulation for overlapping group Lasso.

  19. Toward a Stakeholder Perspective on Social Stability Risk of Large Hydraulic Engineering Projects in China: A Social Network Analysis

    Directory of Open Access Journals (Sweden)

    Zhengqi He

    2018-04-01

    Full Text Available In China, large hydraulic engineering projects have made a great contribution to social economic development; at the same time, they also lead to social risks that affect social stability. The pluralism of stakeholders in large hydraulic engineering projects and the complex interrelationship among stakeholders are the important factors affecting social stability risk. Previous studies of social stability risk have mainly focused on risk identification and risk assessment, without considering the relationships among stakeholders and their linkages of risks. For large hydraulic engineering projects, this paper investigated the relevant risk factors and their interrelationships through a literature review and interviews that represented stakeholder perspectives. The key social stability risk factors were identified based on social network analysis. A multi-channel project financial system, a perfect interest compensation mechanism, an efficient prevention mechanism of group events, and a complete project schedule control system were proposed to mitigate the social st