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

PubMed

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

2018-01-01

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

Contingent association between the size of the social support network and osteoporosis among Korean elderly women

PubMed Central

Seo, Da Hea; Kim, Kyoung Min; Lee, Eun Young; Kim, Hyeon Chang; Kim, Chang Oh; Youm, Yoosik; Rhee, Yumie

2017-01-01

Objective To investigate the association between the number of personal ties (or the size of the social support network) and the incidence of osteoporosis among older women in Korea. Methods Data from the Korean Urban Rural Elderly Study were used. Bone density was measured by dual-energy X-ray absorptiometry at the lumbar spine (L1–L4) and femur neck. T-score, the standardized bone density compared with what is normally expected in a healthy young adult, was measured and the presence of osteoporosis was determined, if the T-score was < -2.5. The social support network size was measured by self-responses (number of confidants and spouse). Results Of the 1,846 participants, 44.9% were diagnosed with osteoporosis. The association between the social support network size and the incidence of osteoporosis was curvilinear in both bivariate and multivariate analyses. Having more people in one’s social support network size was associated with lower risk of osteoporosis until it reached around four. Increasing the social support network size beyond four, in contrast, was associated with a higher risk of osteoporosis. This association was contingent on the average intimacy level of the social network. At the highest average intimacy level (“extremely close”), increasing the number of social support network members from one to six was associated with linear decrease in the predicted probability of osteoporosis from 45% to 30%. However, at the lowest average intimacy level (“not very close”), the predicted probability of osteoporosis dramatically increased from 48% to 80% as the size of the social network increased from one to six. Conclusion Our results show that maintaining a large and intimate social support network is associated with a lower risk of osteoporosis among elderly Korean women, while a large but less-intimate social relationship is associated with a higher risk. PMID:28700637

Contingent association between the size of the social support network and osteoporosis among Korean elderly women.

PubMed

Lee, Seungwon; Seo, Da Hea; Kim, Kyoung Min; Lee, Eun Young; Kim, Hyeon Chang; Kim, Chang Oh; Youm, Yoosik; Rhee, Yumie

2017-01-01

To investigate the association between the number of personal ties (or the size of the social support network) and the incidence of osteoporosis among older women in Korea. Data from the Korean Urban Rural Elderly Study were used. Bone density was measured by dual-energy X-ray absorptiometry at the lumbar spine (L1-L4) and femur neck. T-score, the standardized bone density compared with what is normally expected in a healthy young adult, was measured and the presence of osteoporosis was determined, if the T-score was < -2.5. The social support network size was measured by self-responses (number of confidants and spouse). Of the 1,846 participants, 44.9% were diagnosed with osteoporosis. The association between the social support network size and the incidence of osteoporosis was curvilinear in both bivariate and multivariate analyses. Having more people in one's social support network size was associated with lower risk of osteoporosis until it reached around four. Increasing the social support network size beyond four, in contrast, was associated with a higher risk of osteoporosis. This association was contingent on the average intimacy level of the social network. At the highest average intimacy level ("extremely close"), increasing the number of social support network members from one to six was associated with linear decrease in the predicted probability of osteoporosis from 45% to 30%. However, at the lowest average intimacy level ("not very close"), the predicted probability of osteoporosis dramatically increased from 48% to 80% as the size of the social network increased from one to six. Our results show that maintaining a large and intimate social support network is associated with a lower risk of osteoporosis among elderly Korean women, while a large but less-intimate social relationship is associated with a higher risk.

Social Networks of Lesbian, Gay, Bisexual, and Transgender Older Adults

PubMed Central

Erosheva, Elena A.; Kim, Hyun-Jun; Emlet, Charles; Fredriksen-Goldsen, Karen I.

2015-01-01

Purpose This study examines global social networks—including friendship, support, and acquaintance networks—of lesbian, gay, bisexual, and transgender (LGBT) older adults. Design and Methods Utilizing data from a large community-based study, we employ multiple regression analyses to examine correlates of social network size and diversity. Results Controlling for background characteristics, network size was positively associated with being female, transgender identity, employment, higher income, having a partner or a child, identity disclosure to a neighbor, engagement in religious activities, and service use. Controlling in addition for network size, network diversity was positively associated with younger age, being female, transgender identity, identity disclosure to a friend, religious activity, and service use. Implications According to social capital theory, social networks provide a vehicle for social resources that can be beneficial for successful aging and well-being. This study is a first step at understanding the correlates of social network size and diversity among LGBT older adults. PMID:25882129

Time-dependent breakdown of fiber networks: Uncertainty of lifetime

NASA Astrophysics Data System (ADS)

Mattsson, Amanda; Uesaka, Tetsu

2017-05-01

Materials often fail when subjected to stresses over a prolonged period. The time to failure, also called the lifetime, is known to exhibit large variability of many materials, particularly brittle and quasibrittle materials. For example, a coefficient of variation reaches 100% or even more. Its distribution shape is highly skewed toward zero lifetime, implying a large number of premature failures. This behavior contrasts with that of normal strength, which shows a variation of only 4%-10% and a nearly bell-shaped distribution. The fundamental cause of this large and unique variability of lifetime is not well understood because of the complex interplay between stochastic processes taking place on the molecular level and the hierarchical and disordered structure of the material. We have constructed fiber network models, both regular and random, as a paradigm for general material structures. With such networks, we have performed Monte Carlo simulations of creep failure to establish explicit relationships among fiber characteristics, network structures, system size, and lifetime distribution. We found that fiber characteristics have large, sometimes dominating, influences on the lifetime variability of a network. Among the factors investigated, geometrical disorders of the network were found to be essential to explain the large variability and highly skewed shape of the lifetime distribution. With increasing network size, the distribution asymptotically approaches a double-exponential form. The implication of this result is that, so-called "infant mortality," which is often predicted by the Weibull approximation of the lifetime distribution, may not exist for a large system.

Too Many Friends: Social Integration, Network Cohesion and Adolescent Depressive Symptoms

ERIC Educational Resources Information Center

Falci, Christina; McNeely, Clea

2009-01-01

Using a nationally representative sample of adolescents, we examine associations among social integration (network size), network cohesion (alter-density), perceptions of social relationships (e.g., social support) and adolescent depressive symptoms. We find that adolescents with either too large or too small a network have higher levels of…

MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning

PubMed Central

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. PMID:26681933

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

PubMed

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.

Social brain volume is associated with in-degree social network size among older adults

PubMed Central

2018-01-01

The social brain hypothesis proposes that large neocortex size evolved to support cognitively demanding social interactions. Accordingly, previous studies have observed that larger orbitofrontal and amygdala structures predict the size of an individual's social network. However, it remains uncertain how an individual's social connectedness reported by other people is associated with the social brain volume. In this study, we found that a greater in-degree network size, a measure of social ties identified by a subject's social connections rather than by the subject, significantly correlated with a larger regional volume of the orbitofrontal cortex, dorsomedial prefrontal cortex and lingual gyrus. By contrast, out-degree size, which is based on an individual's self-perceived connectedness, showed no associations. Meta-analytic reverse inference further revealed that regional volume pattern of in-degree size was specifically involved in social inference ability. These findings were possible because our dataset contained the social networks of an entire village, i.e. a global network. The results suggest that the in-degree aspect of social network size not only confirms the previously reported brain correlates of the social network but also shows an association in brain regions involved in the ability to infer other people's minds. This study provides insight into understanding how the social brain is uniquely associated with sociocentric measures derived from a global network. PMID:29367402

Correlation between Academic and Skills-Based Tests in Computer Networks

ERIC Educational Resources Information Center

Buchanan, William

2006-01-01

Computing-related programmes and modules have many problems, especially related to large class sizes, large-scale plagiarism, module franchising, and an increased requirement from students for increased amounts of hands-on, practical work. This paper presents a practical computer networks module which uses a mixture of online examinations and a…

Drug Network Characteristics and HIV Risk Among Injection Drug Users in Russia: The roles of Trust, Size, and Stability

PubMed Central

Odinokova, Veronika A.; Heimer, Robert; Grau, Lauretta E.; Lyubimova, Alexandra; Safiullina, Liliya; Levina, Olga S.; Niccolai, Linda M.

2011-01-01

We investigated the influence of drug network characteristics including trust, size, and stability on HIV risk behaviors and HIV testing among injection drug users (IDUs) in St. Petersburg, Russia. Overall, male and female IDUs who reported having high levels of trust in their drug networks were significantly more likely to share syringes than those with lower levels of trust (OR [95% CI]) 2.87 [1.06, 7.81] and 4.89 [1.05, 21.94], respectively). Male and female IDUs in larger drug networks were more likely to share syringes than those in smaller networks (4.21 [1.54, 11.51] and 4.80 [1.20, 19.94], respectively). Characteristics that were significantly associated with not having been HIV tested included drug network instability among men and larger network size among women. High trust, large size, and instability were positively and significantly associated with syringe sharing and not having been HIV tested. Effectiveness of interventions in Russia to reduce the risk of HIV infection may be enhanced if network characteristics are addressed. PMID:20872063

The effects of neuron morphology on graph theoretic measures of network connectivity: the analysis of a two-level statistical model.

PubMed

Aćimović, Jugoslava; Mäki-Marttunen, Tuomo; Linne, Marja-Leena

2015-01-01

We developed a two-level statistical model that addresses the question of how properties of neurite morphology shape the large-scale network connectivity. We adopted a low-dimensional statistical description of neurites. From the neurite model description we derived the expected number of synapses, node degree, and the effective radius, the maximal distance between two neurons expected to form at least one synapse. We related these quantities to the network connectivity described using standard measures from graph theory, such as motif counts, clustering coefficient, minimal path length, and small-world coefficient. These measures are used in a neuroscience context to study phenomena from synaptic connectivity in the small neuronal networks to large scale functional connectivity in the cortex. For these measures we provide analytical solutions that clearly relate different model properties. Neurites that sparsely cover space lead to a small effective radius. If the effective radius is small compared to the overall neuron size the obtained networks share similarities with the uniform random networks as each neuron connects to a small number of distant neurons. Large neurites with densely packed branches lead to a large effective radius. If this effective radius is large compared to the neuron size, the obtained networks have many local connections. In between these extremes, the networks maximize the variability of connection repertoires. The presented approach connects the properties of neuron morphology with large scale network properties without requiring heavy simulations with many model parameters. The two-steps procedure provides an easier interpretation of the role of each modeled parameter. The model is flexible and each of its components can be further expanded. We identified a range of model parameters that maximizes variability in network connectivity, the property that might affect network capacity to exhibit different dynamical regimes.

Predictors of Social Network Composition among Homeless and Runaway Adolescents

ERIC Educational Resources Information Center

Johnson, K.D.; Whitbeck, L.B.; Hoyt, D.R.

2005-01-01

Recent research on the social support networks of homeless and runaway youth suggest the social networks of runaway youth are made up largely of transient deviant peer relationships. This paper examined social network characteristics of 428 homeless and runaway adolescents from small-to moderate-sized cities in four Midwestern states. We…

Point-Cloud Compression for Vehicle-Based Mobile Mapping Systems Using Portable Network Graphics

NASA Astrophysics Data System (ADS)

Kohira, K.; Masuda, H.

2017-09-01

A mobile mapping system is effective for capturing dense point-clouds of roads and roadside objects Point-clouds of urban areas, residential areas, and arterial roads are useful for maintenance of infrastructure, map creation, and automatic driving. However, the data size of point-clouds measured in large areas is enormously large. A large storage capacity is required to store such point-clouds, and heavy loads will be taken on network if point-clouds are transferred through the network. Therefore, it is desirable to reduce data sizes of point-clouds without deterioration of quality. In this research, we propose a novel point-cloud compression method for vehicle-based mobile mapping systems. In our compression method, point-clouds are mapped onto 2D pixels using GPS time and the parameters of the laser scanner. Then, the images are encoded in the Portable Networking Graphics (PNG) format and compressed using the PNG algorithm. In our experiments, our method could efficiently compress point-clouds without deteriorating the quality.

A networked voting rule for democratic representation

NASA Astrophysics Data System (ADS)

Hernández, Alexis R.; Gracia-Lázaro, Carlos; Brigatti, Edgardo; Moreno, Yamir

2018-03-01

We introduce a general framework for exploring the problem of selecting a committee of representatives with the aim of studying a networked voting rule based on a decentralized large-scale platform, which can assure a strong accountability of the elected. The results of our simulations suggest that this algorithm-based approach is able to obtain a high representativeness for relatively small committees, performing even better than a classical voting rule based on a closed list of candidates. We show that a general relation between committee size and representatives exists in the form of an inverse square root law and that the normalized committee size approximately scales with the inverse of the community size, allowing the scalability to very large populations. These findings are not strongly influenced by the different networks used to describe the individuals' interactions, except for the presence of few individuals with very high connectivity which can have a marginal negative effect in the committee selection process.

Social network changes and life events across the life span: a meta-analysis.

PubMed

Wrzus, Cornelia; Hänel, Martha; Wagner, Jenny; Neyer, Franz J

2013-01-01

For researchers and practitioners interested in social relationships, the question remains as to how large social networks typically are, and how their size and composition change across adulthood. On the basis of predictions of socioemotional selectivity theory and social convoy theory, we conducted a meta-analysis on age-related social network changes and the effects of life events on social networks using 277 studies with 177,635 participants from adolescence to old age. Cross-sectional as well as longitudinal studies consistently showed that (a) the global social network increased up until young adulthood and then decreased steadily, (b) both the personal network and the friendship network decreased throughout adulthood, (c) the family network was stable in size from adolescence to old age, and (d) other networks with coworkers or neighbors were important only in specific age ranges. Studies focusing on life events that occur at specific ages, such as transition to parenthood, job entry, or widowhood, demonstrated network changes similar to such age-related network changes. Moderator analyses detected that the type of network assessment affected the reported size of global, personal, and family networks. Period effects on network sizes occurred for personal and friendship networks, which have decreased in size over the last 35 years. Together the findings are consistent with the view that a portion of normative, age-related social network changes are due to normative, age-related life events. We discuss how these patterns of normative social network development inform research in social, evolutionary, cultural, and personality psychology. (PsycINFO Database Record (c) 2013 APA, all rights reserved).

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

NASA Astrophysics Data System (ADS)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

Convolutional neural network for road extraction

NASA Astrophysics Data System (ADS)

Li, Junping; Ding, Yazhou; Feng, Fajie; Xiong, Baoyu; Cui, Weihong

2017-11-01

In this paper, the convolution neural network with large block input and small block output was used to extract road. To reflect the complex road characteristics in the study area, a deep convolution neural network VGG19 was conducted for road extraction. Based on the analysis of the characteristics of different sizes of input block, output block and the extraction effect, the votes of deep convolutional neural networks was used as the final road prediction. The study image was from GF-2 panchromatic and multi-spectral fusion in Yinchuan. The precision of road extraction was 91%. The experiments showed that model averaging can improve the accuracy to some extent. At the same time, this paper gave some advice about the choice of input block size and output block size.

Naming game with biased assimilation over adaptive networks

NASA Astrophysics Data System (ADS)

Fu, Guiyuan; Zhang, Weidong

2018-01-01

The dynamics of two-word naming game incorporating the influence of biased assimilation over adaptive network is investigated in this paper. Firstly an extended naming game with biased assimilation (NGBA) is proposed. The hearer in NGBA accepts the received information in a biased manner, where he may refuse to accept the conveyed word from the speaker with a predefined probability, if the conveyed word is different from his current memory. Secondly, the adaptive network is formulated by rewiring the links. Theoretical analysis is developed to show that the population in NGBA will eventually reach global consensus on either A or B. Numerical simulation results show that the larger strength of biased assimilation on both words, the slower convergence speed, while larger strength of biased assimilation on only one word can slightly accelerate the convergence; larger population size can make the rate of convergence slower to a large extent when it increases from a relatively small size, while such effect becomes minor when the population size is large; the behavior of adaptively reconnecting the existing links can greatly accelerate the rate of convergence especially on the sparse connected network.

Persistent homology analysis of ion aggregations and hydrogen-bonding networks.

PubMed

Xia, Kelin

2018-05-16

Despite the great advancement of experimental tools and theoretical models, a quantitative characterization of the microscopic structures of ion aggregates and their associated water hydrogen-bonding networks still remains a challenging problem. In this paper, a newly-invented mathematical method called persistent homology is introduced, for the first time, to quantitatively analyze the intrinsic topological properties of ion aggregation systems and hydrogen-bonding networks. The two most distinguishable properties of persistent homology analysis of assembly systems are as follows. First, it does not require a predefined bond length to construct the ion or hydrogen-bonding network. Persistent homology results are determined by the morphological structure of the data only. Second, it can directly measure the size of circles or holes in ion aggregates and hydrogen-bonding networks. To validate our model, we consider two well-studied systems, i.e., NaCl and KSCN solutions, generated from molecular dynamics simulations. They are believed to represent two morphological types of aggregation, i.e., local clusters and extended ion networks. It has been found that the two aggregation types have distinguishable topological features and can be characterized by our topological model very well. Further, we construct two types of networks, i.e., O-networks and H2O-networks, for analyzing the topological properties of hydrogen-bonding networks. It is found that for both models, KSCN systems demonstrate much more dramatic variations in their local circle structures with a concentration increase. A consistent increase of large-sized local circle structures is observed and the sizes of these circles become more and more diverse. In contrast, NaCl systems show no obvious increase of large-sized circles. Instead a consistent decline of the average size of the circle structures is observed and the sizes of these circles become more and more uniform with a concentration increase. As far as we know, these unique intrinsic topological features in ion aggregation systems have never been pointed out before. More importantly, our models can be directly used to quantitatively analyze the intrinsic topological invariants, including circles, loops, holes, and cavities, of any network-like structures, such as nanomaterials, colloidal systems, biomolecular assemblies, among others. These topological invariants cannot be described by traditional graph and network models.

Distribution of genotype network sizes in sequence-to-structure genotype-phenotype maps.

PubMed

Manrubia, Susanna; Cuesta, José A

2017-04-01

An essential quantity to ensure evolvability of populations is the navigability of the genotype space. Navigability, understood as the ease with which alternative phenotypes are reached, relies on the existence of sufficiently large and mutually attainable genotype networks. The size of genotype networks (e.g. the number of RNA sequences folding into a particular secondary structure or the number of DNA sequences coding for the same protein structure) is astronomically large in all functional molecules investigated: an exhaustive experimental or computational study of all RNA folds or all protein structures becomes impossible even for moderately long sequences. Here, we analytically derive the distribution of genotype network sizes for a hierarchy of models which successively incorporate features of increasingly realistic sequence-to-structure genotype-phenotype maps. The main feature of these models relies on the characterization of each phenotype through a prototypical sequence whose sites admit a variable fraction of letters of the alphabet. Our models interpolate between two limit distributions: a power-law distribution, when the ordering of sites in the prototypical sequence is strongly constrained, and a lognormal distribution, as suggested for RNA, when different orderings of the same set of sites yield different phenotypes. Our main result is the qualitative and quantitative identification of those features of sequence-to-structure maps that lead to different distributions of genotype network sizes. © 2017 The Author(s).

The social network-network: size is predicted by brain structure and function in the amygdala and paralimbic regions

PubMed Central

Von Der Heide, Rebecca; Vyas, Govinda

2014-01-01

The social brain hypothesis proposes that the large size of the primate neocortex evolved to support complex and demanding social interactions. Accordingly, recent studies have reported correlations between the size of an individual’s social network and the density of gray matter (GM) in regions of the brain implicated in social cognition. However, the reported relationships between GM density and social group size are somewhat inconsistent with studies reporting correlations in different brain regions. One factor that might account for these discrepancies is the use of different measures of social network size (SNS). This study used several measures of SNS to assess the relationships SNS and GM density. The second goal of this study was to test the relationship between social network measures and functional brain activity. Participants performed a social closeness task using photos of their friends and unknown people. Across the VBM and functional magnetic resonance imaging analyses, individual differences in SNS were consistently related to structural and functional differences in three regions: the left amygdala, right amygdala and the right entorhinal/ventral anterior temporal cortex. PMID:24493846

Representing perturbed dynamics in biological network models

NASA Astrophysics Data System (ADS)

Stoll, Gautier; Rougemont, Jacques; Naef, Felix

2007-07-01

We study the dynamics of gene activities in relatively small size biological networks (up to a few tens of nodes), e.g., the activities of cell-cycle proteins during the mitotic cell-cycle progression. Using the framework of deterministic discrete dynamical models, we characterize the dynamical modifications in response to structural perturbations in the network connectivities. In particular, we focus on how perturbations affect the set of fixed points and sizes of the basins of attraction. Our approach uses two analytical measures: the basin entropy H and the perturbation size Δ , a quantity that reflects the distance between the set of fixed points of the perturbed network and that of the unperturbed network. Applying our approach to the yeast-cell-cycle network introduced by Li [Proc. Natl. Acad. Sci. U.S.A. 101, 4781 (2004)] provides a low-dimensional and informative fingerprint of network behavior under large classes of perturbations. We identify interactions that are crucial for proper network function, and also pinpoint functionally redundant network connections. Selected perturbations exemplify the breadth of dynamical responses in this cell-cycle model.

Weak signal transmission in complex networks and its application in detecting connectivity.

PubMed

Liang, Xiaoming; Liu, Zonghua; Li, Baowen

2009-10-01

We present a network model of coupled oscillators to study how a weak signal is transmitted in complex networks. Through both theoretical analysis and numerical simulations, we find that the response of other nodes to the weak signal decays exponentially with their topological distance to the signal source and the coupling strength between two neighboring nodes can be figured out by the responses. This finding can be conveniently used to detect the topology of unknown network, such as the degree distribution, clustering coefficient and community structure, etc., by repeatedly choosing different nodes as the signal source. Through four typical networks, i.e., the regular one dimensional, small world, random, and scale-free networks, we show that the features of network can be approximately given by investigating many fewer nodes than the network size, thus our approach to detect the topology of unknown network may be efficient in practical situations with large network size.

Evaluating factors that predict the structure of a commensalistic epiphyte–phorophyte network

PubMed Central

Sáyago, Roberto; Lopezaraiza-Mikel, Martha; Quesada, Mauricio; Álvarez-Añorve, Mariana Yolotl; Cascante-Marín, Alfredo; Bastida, Jesus Ma.

2013-01-01

A central issue in ecology is the understanding of the establishment of biotic interactions. We studied the factors that affect the assembly of the commensalistic interactions between vascular epiphytes and their host plants. We used an analytical approach that considers all individuals and species of epiphytic bromeliads and woody hosts and non-hosts at study plots. We built models of interaction probabilities among species to assess if host traits and abundance and spatial overlap of species predict the quantitative epiphyte–host network. Species abundance, species spatial overlap and host size largely predicted pairwise interactions and several network metrics. Wood density and bark texture of hosts also contributed to explain network structure. Epiphytes were more common on large hosts, on abundant woody species, with denser wood and/or rougher bark. The network had a low level of specialization, although several interactions were more frequent than expected by the models. We did not detect a phylogenetic signal on the network structure. The effect of host size on the establishment of epiphytes indicates that mature forests are necessary to preserve diverse bromeliad communities. PMID:23407832

Humans use compression heuristics to improve the recall of social networks.

PubMed

Brashears, Matthew E

2013-01-01

The ability of primates, including humans, to maintain large social networks appears to depend on the ratio of the neocortex to the rest of the brain. However, observed human network size frequently exceeds predictions based on this ratio (e.g., "Dunbar's Number"), implying that human networks are too large to be cognitively managed. Here I show that humans adaptively use compression heuristics to allow larger amounts of social information to be stored in the same brain volume. I find that human adults can remember larger numbers of relationships in greater detail when a network exhibits triadic closure and kin labels than when it does not. These findings help to explain how humans manage large and complex social networks with finite cognitive resources and suggest that many of the unusual properties of human social networks are rooted in the strategies necessary to cope with cognitive limitations.

Organization and scaling in water supply networks

NASA Astrophysics Data System (ADS)

Cheng, Likwan; Karney, Bryan W.

2017-12-01

Public water supply is one of the society's most vital resources and most costly infrastructures. Traditional concepts of these networks capture their engineering identity as isolated, deterministic hydraulic units, but overlook their physics identity as related entities in a probabilistic, geographic ensemble, characterized by size organization and property scaling. Although discoveries of allometric scaling in natural supply networks (organisms and rivers) raised the prospect for similar findings in anthropogenic supplies, so far such a finding has not been reported in public water or related civic resource supplies. Examining an empirical ensemble of large number and wide size range, we show that water supply networks possess self-organized size abundance and theory-explained allometric scaling in spatial, infrastructural, and resource- and emission-flow properties. These discoveries establish scaling physics for water supply networks and may lead to novel applications in resource- and jurisdiction-scale water governance.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

PubMed

Li, Yuhong; Gong, Guanghong; Li, Ni

2018-01-01

In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

The development of a fiber optics communication network for controlling a Multidegree-Of-Freedom Serpentine Truss

NASA Astrophysics Data System (ADS)

Andrawis, Alfred S.

1994-10-01

The problem addressed by this report is the large size and heavy weight of the cable bundle, used for controlling a Multidegree-Of-Freedom Serpentine Truss Manipulator arm, which imposes limitations on the manipulator arm maneuverability. This report covers a design of an optical fiber network to replace the existing copper wire network of the Serpentine Truss Manipulator. This report proposes a fiber network design which significantly reduces the bundle size into two phases. The first phase does not require any modifications for the manipulator architecture, while the other requires major modifications. Design philosophy, hardware details and schematic diagrams are presented.

The development of a fiber optics communication network for controlling a Multidegree-Of-Freedom Serpentine Truss

NASA Technical Reports Server (NTRS)

Andrawis, Alfred S.

1994-01-01

The problem addressed by this report is the large size and heavy weight of the cable bundle, used for controlling a Multidegree-Of-Freedom Serpentine Truss Manipulator arm, which imposes limitations on the manipulator arm maneuverability. This report covers a design of an optical fiber network to replace the existing copper wire network of the Serpentine Truss Manipulator. This report proposes a fiber network design which significantly reduces the bundle size into two phases. The first phase does not require any modifications for the manipulator architecture, while the other requires major modifications. Design philosophy, hardware details and schematic diagrams are presented.

A networked voting rule for democratic representation

PubMed Central

Brigatti, Edgardo; Moreno, Yamir

2018-01-01

We introduce a general framework for exploring the problem of selecting a committee of representatives with the aim of studying a networked voting rule based on a decentralized large-scale platform, which can assure a strong accountability of the elected. The results of our simulations suggest that this algorithm-based approach is able to obtain a high representativeness for relatively small committees, performing even better than a classical voting rule based on a closed list of candidates. We show that a general relation between committee size and representatives exists in the form of an inverse square root law and that the normalized committee size approximately scales with the inverse of the community size, allowing the scalability to very large populations. These findings are not strongly influenced by the different networks used to describe the individuals’ interactions, except for the presence of few individuals with very high connectivity which can have a marginal negative effect in the committee selection process. PMID:29657817

CompareSVM: supervised, Support Vector Machine (SVM) inference of gene regularity networks.

PubMed

Gillani, Zeeshan; Akash, Muhammad Sajid Hamid; Rahaman, M D Matiur; Chen, Ming

2014-11-30

Predication of gene regularity network (GRN) from expression data is a challenging task. There are many methods that have been developed to address this challenge ranging from supervised to unsupervised methods. Most promising methods are based on support vector machine (SVM). There is a need for comprehensive analysis on prediction accuracy of supervised method SVM using different kernels on different biological experimental conditions and network size. We developed a tool (CompareSVM) based on SVM to compare different kernel methods for inference of GRN. Using CompareSVM, we investigated and evaluated different SVM kernel methods on simulated datasets of microarray of different sizes in detail. The results obtained from CompareSVM showed that accuracy of inference method depends upon the nature of experimental condition and size of the network. For network with nodes (<200) and average (over all sizes of networks), SVM Gaussian kernel outperform on knockout, knockdown, and multifactorial datasets compared to all the other inference methods. For network with large number of nodes (~500), choice of inference method depend upon nature of experimental condition. CompareSVM is available at http://bis.zju.edu.cn/CompareSVM/ .

Facebook, stress, and incidence of upper respiratory infection in undergraduate college students.

PubMed

Campisi, Jay; Bynog, Pamela; McGehee, Hope; Oakland, Joshua C; Quirk, Shannon; Taga, Carlee; Taylor, Morgan

2012-12-01

Having a large social network is generally beneficial to health. However, it is unclear how Internet-based social networks might influence health. Chronic stress can have negative health consequences, and some data suggest that Facebook could be a new source of psychological stress. Thus, we examined undergraduate college student perceptions of Facebook use and incidence of upper respiratory infections (URIs). We hypothesized that subjects with more diverse networks (i.e., more friends on Facebook) would have fewer URIs than their less diverse counterparts; that subjects reporting Facebook-induced stress would be more susceptible to URIs; and that subjects with more diverse networks who report Facebook-induced stress would be less susceptible to URIs than subjects with less diverse social networks who reported Facebook-induced stress. In this prospective study, healthy college students completed online questionnaires that assessed use and perceptions of Facebook and technology, and then were interviewed weekly for 10 weeks to track incidence of URI. URI episodes were defined by a symptom-based criterion. The social network size was significantly related to the rate of URI, such that, the larger the social network, the greater the incidence rate of URI. Most (85.7 percent) respondents experienced some degree of Facebook-induced stress. The effects of Facebook-induced stress on incidence of URI varied across the social network size, such that, the impact of stress on the URI incidence rate increased with the size of the social network. These results are largely in contrast to our hypotheses, but clearly suggest an association between Facebook use, psychological stress, and health.

Large-Scale, Three–Dimensional, Free–Standing, and Mesoporous Metal Oxide Networks for High–Performance Photocatalysis

PubMed Central

Bai, Hua; Li, Xinshi; Hu, Chao; Zhang, Xuan; Li, Junfang; Yan, Yan; Xi, Guangcheng

2013-01-01

Mesoporous nanostructures represent a unique class of photocatalysts with many applications, including splitting of water, degradation of organic contaminants, and reduction of carbon dioxide. In this work, we report a general Lewis acid catalytic template route for the high–yield producing single– and multi–component large–scale three–dimensional (3D) mesoporous metal oxide networks. The large-scale 3D mesoporous metal oxide networks possess large macroscopic scale (millimeter–sized) and mesoporous nanostructure with huge pore volume and large surface exposure area. This method also can be used for the synthesis of large–scale 3D macro/mesoporous hierarchical porous materials and noble metal nanoparticles loaded 3D mesoporous networks. Photocatalytic degradation of Azo dyes demonstrated that the large–scale 3D mesoporous metal oxide networks enable high photocatalytic activity. The present synthetic method can serve as the new design concept for functional 3D mesoporous nanomaterials. PMID:23857595

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

PubMed Central

Diwadkar, Amit; Vaidya, Umesh

2016-01-01

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

Spectra of English evolving word co-occurrence networks

NASA Astrophysics Data System (ADS)

Liang, Wei

2017-02-01

Spectral analysis is a powerful tool that provides global measures of the network properties. In this paper, 200 English articles are collected. A word co-occurrence network is constructed from each single article (denoted by single network). Furthermore, 5 large English word co-occurrence networks are constructed (denoted by large network). Spectra of their adjacency matrices are computed. The largest eigenvalue, λ1, depends on the network size N and the number of edges E as λ1 ∝N0.66 and λ1 ∝E0.54, respectively. The number of different eigenvalues, Nλ, increase in the manner of Nλ ∝N0.58 and Nλ ∝E0.47. The middle part of the spectral distribution can be fitted by a line with slope - 0.01 in each of the large networks, whereas two segments with the same slope - 0.03 for 0 ≪ N < 260 and - 0.02 for 260 < N < 2800 are needed for the single networks. An "M"-shape distribution appears in each of the spectral densities of the large networks. These and other results can provide useful insight into the structural properties of English linguistic networks.

Coarse-Grain Bandwidth Estimation Techniques for Large-Scale Space Network

NASA Technical Reports Server (NTRS)

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.

A simple model of global cascades on random networks

NASA Astrophysics Data System (ADS)

Watts, Duncan J.

2002-04-01

The origin of large but rare cascades that are triggered by small initial shocks is a phenomenon that manifests itself as diversely as cultural fads, collective action, the diffusion of norms and innovations, and cascading failures in infrastructure and organizational networks. This paper presents a possible explanation of this phenomenon in terms of a sparse, random network of interacting agents whose decisions are determined by the actions of their neighbors according to a simple threshold rule. Two regimes are identified in which the network is susceptible to very large cascadesherein called global cascadesthat occur very rarely. When cascade propagation is limited by the connectivity of the network, a power law distribution of cascade sizes is observed, analogous to the cluster size distribution in standard percolation theory and avalanches in self-organized criticality. But when the network is highly connected, cascade propagation is limited instead by the local stability of the nodes themselves, and the size distribution of cascades is bimodal, implying a more extreme kind of instability that is correspondingly harder to anticipate. In the first regime, where the distribution of network neighbors is highly skewed, it is found that the most connected nodes are far more likely than average nodes to trigger cascades, but not in the second regime. Finally, it is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but an increasingly heterogeneous degree distribution makes it less vulnerable.

How Many "Friends" Do You Need? Teaching Students How to Network Using Social Media

ERIC Educational Resources Information Center

Sacks, Michael Alan; Graves, Nikki

2012-01-01

Student reliance on social media is undeniable. However, while we largely regard social media as a new phenomena, the concepts underlying it come directly from social network theory in sociology and organizational behavior. In this article, the authors examine how the social network concepts of size, quality, complexity, diffusion, and distance…

Dynamical origins of the community structure of an online multi-layer society

NASA Astrophysics Data System (ADS)

Klimek, Peter; Diakonova, Marina; Eguíluz, Víctor M.; San Miguel, Maxi; Thurner, Stefan

2016-08-01

Social structures emerge as a result of individuals managing a variety of different social relationships. Societies can be represented as highly structured dynamic multiplex networks. Here we study the dynamical origins of the specific community structures of a large-scale social multiplex network of a human society that interacts in a virtual world of a massive multiplayer online game. There we find substantial differences in the community structures of different social actions, represented by the various layers in the multiplex network. Community sizes distributions are either fat-tailed or appear to be centered around a size of 50 individuals. To understand these observations we propose a voter model that is built around the principle of triadic closure. It explicitly models the co-evolution of node- and link-dynamics across different layers of the multiplex network. Depending on link and node fluctuation probabilities, the model exhibits an anomalous shattered fragmentation transition, where one layer fragments from one large component into many small components. The observed community size distributions are in good agreement with the predicted fragmentation in the model. This suggests that several detailed features of the fragmentation in societies can be traced back to the triadic closure processes.

Spatial, socio-economic, and ecological implications of incorporating minimum size constraints in marine protected area network design.

PubMed

Metcalfe, Kristian; Vaughan, Gregory; Vaz, Sandrine; Smith, Robert J

2015-12-01

Marine protected areas (MPAs) are the cornerstone of most marine conservation strategies, but the effectiveness of each one partly depends on its size and distance to other MPAs in a network. Despite this, current recommendations on ideal MPA size and spacing vary widely, and data are lacking on how these constraints might influence the overall spatial characteristics, socio-economic impacts, and connectivity of the resultant MPA networks. To address this problem, we tested the impact of applying different MPA size constraints in English waters. We used the Marxan spatial prioritization software to identify a network of MPAs that met conservation feature targets, whilst minimizing impacts on fisheries; modified the Marxan outputs with the MinPatch software to ensure each MPA met a minimum size; and used existing data on the dispersal distances of a range of species found in English waters to investigate the likely impacts of such spatial constraints on the region's biodiversity. Increasing MPA size had little effect on total network area or the location of priority areas, but as MPA size increased, fishing opportunity cost to stakeholders increased. In addition, as MPA size increased, the number of closely connected sets of MPAs in networks and the average distance between neighboring MPAs decreased, which consequently increased the proportion of the planning region that was isolated from all MPAs. These results suggest networks containing large MPAs would be more viable for the majority of the region's species that have small dispersal distances, but dispersal between MPA sets and spill-over of individuals into unprotected areas would be reduced. These findings highlight the importance of testing the impact of applying different MPA size constraints because there are clear trade-offs that result from the interaction of size, number, and distribution of MPAs in a network. © 2015 Society for Conservation Biology.

The neural representation of social networks.

PubMed

Weaverdyck, Miriam E; Parkinson, Carolyn

2018-05-24

The computational demands associated with navigating large, complexly bonded social groups are thought to have significantly shaped human brain evolution. Yet, research on social network representation and cognitive neuroscience have progressed largely independently. Thus, little is known about how the human brain encodes the structure of the social networks in which it is embedded. This review highlights recent work seeking to bridge this gap in understanding. While the majority of research linking social network analysis and neuroimaging has focused on relating neuroanatomy to social network size, researchers have begun to define the neural architecture that encodes social network structure, cognitive and behavioral consequences of encoding this information, and individual differences in how people represent the structure of their social world. Copyright © 2018 Elsevier Ltd. All rights reserved.

RF beam transmission of x-band PAA system utilizing large-area, polymer-based true-time-delay module developed using imprinting and inkjet printing

NASA Astrophysics Data System (ADS)

Pan, Zeyu; Subbaraman, Harish; Zhang, Cheng; Li, Qiaochu; Xu, Xiaochuan; Chen, Xiangning; Zhang, Xingyu; Zou, Yi; Panday, Ashwin; Guo, L. Jay; Chen, Ray T.

2016-02-01

Phased-array antenna (PAA) technology plays a significant role in modern day radar and communication networks. Truetime- delay (TTD) enabled beam steering networks provide several advantages over their electronic counterparts, including squint-free beam steering, low RF loss, immunity to electromagnetic interference (EMI), and large bandwidth control of PAAs. Chip-scale and integrated TTD modules promise a miniaturized, light-weight system; however, the modules are still rigid and they require complex packaging solutions. Moreover, the total achievable time delay is still restricted by the wafer size. In this work, we propose a light-weight and large-area, true-time-delay beamforming network that can be fabricated on light-weight and flexible/rigid surfaces utilizing low-cost "printing" techniques. In order to prove the feasibility of the approach, a 2-bit thermo-optic polymer TTD network is developed using a combination of imprinting and ink-jet printing. RF beam steering of a 1×4 X-band PAA up to 60° is demonstrated. The development of such active components on large area, light-weight, and low-cost substrates promises significant improvement in size, weight, and power (SWaP) requirements over the state-of-the-art.

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

DOE PAGES

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

2013-01-01

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

Mean Field Analysis of Large-Scale Interacting Populations of Stochastic Conductance-Based Spiking Neurons Using the Klimontovich Method

NASA Astrophysics Data System (ADS)

Gandolfo, Daniel; Rodriguez, Roger; Tuckwell, Henry C.

2017-03-01

We investigate the dynamics of large-scale interacting neural populations, composed of conductance based, spiking model neurons with modifiable synaptic connection strengths, which are possibly also subjected to external noisy currents. The network dynamics is controlled by a set of neural population probability distributions (PPD) which are constructed along the same lines as in the Klimontovich approach to the kinetic theory of plasmas. An exact non-closed, nonlinear, system of integro-partial differential equations is derived for the PPDs. As is customary, a closing procedure leads to a mean field limit. The equations we have obtained are of the same type as those which have been recently derived using rigorous techniques of probability theory. The numerical solutions of these so called McKean-Vlasov-Fokker-Planck equations, which are only valid in the limit of infinite size networks, actually shows that the statistical measures as obtained from PPDs are in good agreement with those obtained through direct integration of the stochastic dynamical system for large but finite size networks. Although numerical solutions have been obtained for networks of Fitzhugh-Nagumo model neurons, which are often used to approximate Hodgkin-Huxley model neurons, the theory can be readily applied to networks of general conductance-based model neurons of arbitrary dimension.

Wayfinding in Social Networks

NASA Astrophysics Data System (ADS)

Liben-Nowell, David

With the recent explosion of popularity of commercial social-networking sites like Facebook and MySpace, the size of social networks that can be studied scientifically has passed from the scale traditionally studied by sociologists and anthropologists to the scale of networks more typically studied by computer scientists. In this chapter, I will highlight a recent line of computational research into the modeling and analysis of the small-world phenomenon - the observation that typical pairs of people in a social network are connected by very short chains of intermediate friends - and the ability of members of a large social network to collectively find efficient routes to reach individuals in the network. I will survey several recent mathematical models of social networks that account for these phenomena, with an emphasis on both the provable properties of these social-network models and the empirical validation of the models against real large-scale social-network data.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Influence of Blurred Ways on Pattern Recognition of a Scale-Free Hopfield Neural Network

NASA Astrophysics Data System (ADS)

Chang, Wen-Li

2010-01-01

We investigate the influence of blurred ways on pattern recognition of a Barabási-Albert scale-free Hopfield neural network (SFHN) with a small amount of errors. Pattern recognition is an important function of information processing in brain. Due to heterogeneous degree of scale-free network, different blurred ways have different influences on pattern recognition with same errors. Simulation shows that among partial recognition, the larger loading ratio (the number of patterns to average degree P/langlekrangle) is, the smaller the overlap of SFHN is. The influence of directed (large) way is largest and the directed (small) way is smallest while random way is intermediate between them. Under the ratio of the numbers of stored patterns to the size of the network P/N is less than 0. 1 conditions, there are three families curves of the overlap corresponding to directed (small), random and directed (large) blurred ways of patterns and these curves are not associated with the size of network and the number of patterns. This phenomenon only occurs in the SFHN. These conclusions are benefit for understanding the relation between neural network structure and brain function.

Intrinsic Amygdala-Cortical Functional Connectivity Predicts Social Network Size in Humans

PubMed Central

Bickart, Kevin C.; Hollenbeck, Mark C.; Barrett, Lisa Feldman; Dickerson, Bradford C.

2012-01-01

Using resting-state functional MRI data from two independent samples of healthy adults, we parsed the amygdala’s intrinsic connectivity into three partially-distinct large-scale networks that strongly resemble the known anatomical organization of amygdala connectivity in rodents and monkeys. Moreover, in a third independent sample, we discovered that people who fostered and maintained larger and more complex social networks not only had larger amygdala volumes, but also amygdalae with stronger intrinsic connectivity within two of these networks, one putatively subserving perceptual abilities and one subserving affiliative behaviors. Our findings were anatomically specific to amygdalar circuitry in that individual differences in social network size and complexity could not be explained by the strength of intrinsic connectivity between nodes within two networks that do not typically involve the amygdala (i.e., the mentalizing and mirror networks), and were behaviorally specific in that amygdala connectivity did not correlate with other self-report measures of sociality. PMID:23077058

Social contagions on correlated multiplex networks

NASA Astrophysics Data System (ADS)

Wang, Wei; Cai, Meng; Zheng, Muhua

2018-06-01

The existence of interlayer degree correlations has been disclosed by abundant multiplex network analysis. However, how they impose on the dynamics of social contagions are remain largely unknown. In this paper, we propose a non-Markovian social contagion model in multiplex networks with inter-layer degree correlations to delineate the behavior spreading, and develop an edge-based compartmental (EBC) theory to describe the model. We find that multiplex networks promote the final behavior adoption size. Remarkably, it can be observed that the growth pattern of the final behavior adoption size, versus the behavioral information transmission probability, changes from discontinuous to continuous once decreasing the behavior adoption threshold in one layer. We finally unravel that the inter-layer degree correlations play a role on the final behavior adoption size but have no effects on the growth pattern, which is coincidence with our prediction by using the suggested theory.

Interplay between cooperation-enhancing mechanisms in evolutionary games with tag-mediated interactions

NASA Astrophysics Data System (ADS)

Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu

2018-04-01

Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.

Designing marine reserve networks for both conservation and fisheries management.

PubMed

Gaines, Steven D; White, Crow; Carr, Mark H; Palumbi, Stephen R

2010-10-26

Marine protected areas (MPAs) that exclude fishing have been shown repeatedly to enhance the abundance, size, and diversity of species. These benefits, however, mean little to most marine species, because individual protected areas typically are small. To meet the larger-scale conservation challenges facing ocean ecosystems, several nations are expanding the benefits of individual protected areas by building networks of protected areas. Doing so successfully requires a detailed understanding of the ecological and physical characteristics of ocean ecosystems and the responses of humans to spatial closures. There has been enormous scientific interest in these topics, and frameworks for the design of MPA networks for meeting conservation and fishery management goals are emerging. Persistent in the literature is the perception of an inherent tradeoff between achieving conservation and fishery goals. Through a synthetic analysis across these conservation and bioeconomic studies, we construct guidelines for MPA network design that reduce or eliminate this tradeoff. We present size, spacing, location, and configuration guidelines for designing networks that simultaneously can enhance biological conservation and reduce fishery costs or even increase fishery yields and profits. Indeed, in some settings, a well-designed MPA network is critical to the optimal harvest strategy. When reserves benefit fisheries, the optimal area in reserves is moderately large (mode ≈30%). Assessing network design principals is limited currently by the absence of empirical data from large-scale networks. Emerging networks will soon rectify this constraint.

Experimental study of thin film sensor networks for wind turbine blade damage detection

NASA Astrophysics Data System (ADS)

Downey, A.; Laflamme, S.; Ubertini, F.; Sauder, H.; Sarkar, P.

2017-02-01

Damage detection of wind turbine blades is difficult due to their complex geometry and large size, for which large deployment of sensing systems is typically not economical. A solution is to develop and deploy dedicated sensor networks fabricated from inexpensive materials and electronics. The authors have recently developed a novel skin-type strain gauge for measuring strain over very large surfaces. The skin, a type of large-area electronics, is constituted from a network of soft elastomeric capacitors. The sensing system is analogous to a biological skin, where local strain can be monitored over a global area. In this paper, we propose the utilization of a dense network of soft elastomeric capacitors to detect, localize, and quantify damage on wind turbine blades. We also leverage mature off-the-shelf technologies, in particular resistive strain gauges, to augment such dense sensor network with high accuracy data at key locations, therefore constituting a hybrid dense sensor network. The proposed hybrid dense sensor network is installed inside a wind turbine blade model, and tested in a wind tunnel to simulate an operational environment. Results demonstrate the ability of the hybrid dense sensor network to detect, localize, and quantify damage.

A mass storage system for supercomputers based on Unix

NASA Technical Reports Server (NTRS)

Richards, J.; Kummell, T.; Zarlengo, D. G.

1988-01-01

The authors present the design, implementation, and utilization of a large mass storage subsystem (MSS) for the numerical aerodynamics simulation. The MSS supports a large networked, multivendor Unix-based supercomputing facility. The MSS at Ames Research Center provides all processors on the numerical aerodynamics system processing network, from workstations to supercomputers, the ability to store large amounts of data in a highly accessible, long-term repository. The MSS uses Unix System V and is capable of storing hundreds of thousands of files ranging from a few bytes to 2 Gb in size.

One-step estimation of networked population size: Respondent-driven capture-recapture with anonymity.

PubMed

Khan, Bilal; Lee, Hsuan-Wei; Fellows, Ian; Dombrowski, Kirk

2018-01-01

Size estimation is particularly important for populations whose members experience disproportionate health issues or pose elevated health risks to the ambient social structures in which they are embedded. Efforts to derive size estimates are often frustrated when the population is hidden or hard-to-reach in ways that preclude conventional survey strategies, as is the case when social stigma is associated with group membership or when group members are involved in illegal activities. This paper extends prior research on the problem of network population size estimation, building on established survey/sampling methodologies commonly used with hard-to-reach groups. Three novel one-step, network-based population size estimators are presented, for use in the context of uniform random sampling, respondent-driven sampling, and when networks exhibit significant clustering effects. We give provably sufficient conditions for the consistency of these estimators in large configuration networks. Simulation experiments across a wide range of synthetic network topologies validate the performance of the estimators, which also perform well on a real-world location-based social networking data set with significant clustering. Finally, the proposed schemes are extended to allow them to be used in settings where participant anonymity is required. Systematic experiments show favorable tradeoffs between anonymity guarantees and estimator performance. Taken together, we demonstrate that reasonable population size estimates are derived from anonymous respondent driven samples of 250-750 individuals, within ambient populations of 5,000-40,000. The method thus represents a novel and cost-effective means for health planners and those agencies concerned with health and disease surveillance to estimate the size of hidden populations. We discuss limitations and future work in the concluding section.

Artificial neural network based particle size prediction of polymeric nanoparticles.

PubMed

Youshia, John; Ali, Mohamed Ehab; Lamprecht, Alf

2017-10-01

Particle size of nanoparticles and the respective polydispersity are key factors influencing their biopharmaceutical behavior in a large variety of therapeutic applications. Predicting these attributes would skip many preliminary studies usually required to optimize formulations. The aim was to build a mathematical model capable of predicting the particle size of polymeric nanoparticles produced by a pharmaceutical polymer of choice. Polymer properties controlling the particle size were identified as molecular weight, hydrophobicity and surface activity, and were quantified by measuring polymer viscosity, contact angle and interfacial tension, respectively. A model was built using artificial neural network including these properties as input with particle size and polydispersity index as output. The established model successfully predicted particle size of nanoparticles covering a range of 70-400nm prepared from other polymers. The percentage bias for particle prediction was 2%, 4% and 6%, for the training, validation and testing data, respectively. Polymer surface activity was found to have the highest impact on the particle size followed by viscosity and finally hydrophobicity. Results of this study successfully highlighted polymer properties affecting particle size and confirmed the usefulness of artificial neural networks in predicting the particle size and polydispersity of polymeric nanoparticles. Copyright © 2017 Elsevier B.V. All rights reserved.

A simulation analysis to characterize the dynamics of vaccinating behaviour on contact networks.

PubMed

Perisic, Ana; Bauch, Chris T

2009-05-28

Human behavior influences infectious disease transmission, and numerous "prevalence-behavior" models have analyzed this interplay. These previous analyses assumed homogeneously mixing populations without spatial or social structure. However, spatial and social heterogeneity are known to significantly impact transmission dynamics and are particularly relevant for certain diseases. Previous work has demonstrated that social contact structure can change the individual incentive to vaccinate, thus enabling eradication of a disease under a voluntary vaccination policy when the corresponding homogeneous mixing model predicts that eradication is impossible due to free rider effects. Here, we extend this work and characterize the range of possible behavior-prevalence dynamics on a network. We simulate transmission of a vaccine-preventable infection through a random, static contact network. Individuals choose whether or not to vaccinate on any given day according to perceived risks of vaccination and infection. We find three possible outcomes for behavior-prevalence dynamics on this type of network: small final number vaccinated and final epidemic size (due to rapid control through voluntary ring vaccination); large final number vaccinated and significant final epidemic size (due to imperfect voluntary ring vaccination), and little or no vaccination and large final epidemic size (corresponding to little or no voluntary ring vaccination). We also show that the social contact structure enables eradication under a broad range of assumptions, except when vaccine risk is sufficiently high, the disease risk is sufficiently low, or individuals vaccinate too late for the vaccine to be effective. For populations where infection can spread only through social contact network, relatively small differences in parameter values relating to perceived risk or vaccination behavior at the individual level can translate into large differences in population-level outcomes such as final size and final number vaccinated. The qualitative outcome of rational, self interested behaviour under a voluntary vaccination policy can vary substantially depending on interactions between social contact structure, perceived vaccine and disease risks, and the way that individual vaccination decision-making is modelled.

A simulation analysis to characterize the dynamics of vaccinating behaviour on contact networks

PubMed Central

2009-01-01

Background Human behavior influences infectious disease transmission, and numerous "prevalence-behavior" models have analyzed this interplay. These previous analyses assumed homogeneously mixing populations without spatial or social structure. However, spatial and social heterogeneity are known to significantly impact transmission dynamics and are particularly relevant for certain diseases. Previous work has demonstrated that social contact structure can change the individual incentive to vaccinate, thus enabling eradication of a disease under a voluntary vaccination policy when the corresponding homogeneous mixing model predicts that eradication is impossible due to free rider effects. Here, we extend this work and characterize the range of possible behavior-prevalence dynamics on a network. Methods We simulate transmission of a vaccine-prevetable infection through a random, static contact network. Individuals choose whether or not to vaccinate on any given day according to perceived risks of vaccination and infection. Results We find three possible outcomes for behavior-prevalence dynamics on this type of network: small final number vaccinated and final epidemic size (due to rapid control through voluntary ring vaccination); large final number vaccinated and significant final epidemic size (due to imperfect voluntary ring vaccination), and little or no vaccination and large final epidemic size (corresponding to little or no voluntary ring vaccination). We also show that the social contact structure enables eradication under a broad range of assumptions, except when vaccine risk is sufficiently high, the disease risk is sufficiently low, or individuals vaccinate too late for the vaccine to be effective. Conclusion For populations where infection can spread only through social contact network, relatively small differences in parameter values relating to perceived risk or vaccination behavior at the individual level can translate into large differences in population-level outcomes such as final size and final number vaccinated. The qualitative outcome of rational, self interested behaviour under a voluntary vaccination policy can vary substantially depending on interactions between social contact structure, perceived vaccine and disease risks, and the way that individual vaccination decision-making is modelled. PMID:19476616

Distributed sensor networks: a cellular nonlinear network perspective.

PubMed

Haenggi, Martin

2003-12-01

Large-scale networks of integrated wireless sensors become increasingly tractable. Advances in hardware technology and engineering design have led to dramatic reductions in size, power consumption, and cost for digital circuitry, and wireless communications. Networking, self-organization, and distributed operation are crucial ingredients to harness the sensing, computing, and computational capabilities of the nodes into a complete system. This article shows that those networks can be considered as cellular nonlinear networks (CNNs), and that their analysis and design may greatly benefit from the rich theoretical results available for CNNs.

Synchronization on Erdös-Rényi networks.

PubMed

Gong, Baihua; Yang, Lei; Yang, Kongqing

2005-09-01

In this Brief Report, by analyzing the spectral properties of the Laplacian matrix of Erdös-Rényi networks, we obtained the critical coupling strength of the complete synchronization analytically. In particular, for any size of the networks, when the average degree is greater than a threshold and the coupling strength is large enough, the networks can synchronize. Here, the threshold is determined by the value of the maximal Lyapunov exponent of each dynamical unit.

Robust scalable stabilisability conditions for large-scale heterogeneous multi-agent systems with uncertain nonlinear interactions: towards a distributed computing architecture

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2016-06-01

Large-scale dynamic systems are becoming highly pervasive in their occurrence with applications ranging from system biology, environment monitoring, sensor networks, and power systems. They are characterised by high dimensionality, complexity, and uncertainty in the node dynamic/interactions that require more and more computational demanding methods for their analysis and control design, as well as the network size and node system/interaction complexity increase. Therefore, it is a challenging problem to find scalable computational method for distributed control design of large-scale networks. In this paper, we investigate the robust distributed stabilisation problem of large-scale nonlinear multi-agent systems (briefly MASs) composed of non-identical (heterogeneous) linear dynamical systems coupled by uncertain nonlinear time-varying interconnections. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, new conditions are given for the distributed control design of large-scale MASs that can be easily solved by the toolbox of MATLAB. The stabilisability of each node dynamic is a sufficient assumption to design a global stabilising distributed control. The proposed approach improves some of the existing LMI-based results on MAS by both overcoming their computational limits and extending the applicative scenario to large-scale nonlinear heterogeneous MASs. Additionally, the proposed LMI conditions are further reduced in terms of computational requirement in the case of weakly heterogeneous MASs, which is a common scenario in real application where the network nodes and links are affected by parameter uncertainties. One of the main advantages of the proposed approach is to allow to move from a centralised towards a distributed computing architecture so that the expensive computation workload spent to solve LMIs may be shared among processors located at the networked nodes, thus increasing the scalability of the approach than the network size. Finally, a numerical example shows the applicability of the proposed method and its advantage in terms of computational complexity when compared with the existing approaches.

Supporting large scale applications on networks of workstations

NASA Technical Reports Server (NTRS)

Cooper, Robert; Birman, Kenneth P.

1989-01-01

Distributed applications on networks of workstations are an increasingly common way to satisfy computing needs. However, existing mechanisms for distributed programming exhibit poor performance and reliability as application size increases. Extension of the ISIS distributed programming system to support large scale distributed applications by providing hierarchical process groups is discussed. Incorporation of hierarchy in the program structure and exploitation of this to limit the communication and storage required in any one component of the distributed system is examined.

Western State Hospital: implementing a MUMPS-based PC network.

PubMed

Russ, D C

1991-06-01

Western State Hospital, a state-administered 1,200-bed mental health institution near Tacoma, Wash., confronted the challenge of automating its large campus through the application of the Healthcare Integrated Information System (HIIS). It is the first adaptation of the Veterans Administration's Decentralized Hospital Computer Program software in a mental health institution of this size, and the first DHCP application to be installed on a PC client/server network in a large U.S. hospital.

The impact of an unfavorable depression course on network size and loneliness in older people: a longitudinal study in the community.

PubMed

Houtjes, Wim; van Meijel, Berno; van de Ven, Peter M; Deeg, Dorly; van Tilburg, Theo; Beekman, Aartjan

2014-10-01

This work aims to gain insight into the long-term impact of depression course on social network size and perceived loneliness in older people living in the community. Within a large representative sample of older people in the community (Longitudinal Aging Study Amsterdam (LASA)), participants with clinically relevant levels of depressive symptoms (scores >16 on the Center for Epidemiological Studies Depression Scale) were followed up over a period of 13 years of the LASA study (five waves). General estimating equations were used to estimate the impact of depression course on network size and loneliness and the interaction with gender and age. An unfavorable course of depression was found to be associated with smaller network sizes and higher levels of loneliness over time, especially in men and older participants. The findings of this study stress the importance of clinical attention to the negative consequences of chronicity in depressed older people. Clinicians should assess possible erosion of the social network over time and be aware of increased feelings of loneliness in this patient group. Copyright © 2014 John Wiley & Sons, Ltd.

Protograph LDPC Codes Over Burst Erasure Channels

NASA Technical Reports Server (NTRS)

Divsalar, Dariush; Dolinar, Sam; Jones, Christopher

2006-01-01

In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class.

Compression-based aggregation model for medical web services.

PubMed

Al-Shammary, Dhiah; Khalil, Ibrahim

2010-01-01

Many organizations such as hospitals have adopted Cloud Web services in applying their network services to avoid investing heavily computing infrastructure. SOAP (Simple Object Access Protocol) is the basic communication protocol of Cloud Web services that is XML based protocol. Generally,Web services often suffer congestions and bottlenecks as a result of the high network traffic that is caused by the large XML overhead size. At the same time, the massive load on Cloud Web services in terms of the large demand of client requests has resulted in the same problem. In this paper, two XML-aware aggregation techniques that are based on exploiting the compression concepts are proposed in order to aggregate the medical Web messages and achieve higher message size reduction.

ACCURATE CHEMICAL MASTER EQUATION SOLUTION USING MULTI-FINITE BUFFERS

PubMed Central

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-01-01

The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multi-scale nature of many networks where reaction rates have large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the Accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multi-finite buffers for reducing the state space by O(n!), exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes, and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be pre-computed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multi-scale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks. PMID:27761104

Scalable population estimates using spatial-stream-network (SSN) models, fish density surveys, and national geospatial database frameworks for streams

Treesearch

Daniel J. Isaak; Jay M. Ver Hoef; Erin E. Peterson; Dona L. Horan; David E. Nagel

2017-01-01

Population size estimates for stream fishes are important for conservation and management, but sampling costs limit the extent of most estimates to small portions of river networks that encompass 100s–10 000s of linear kilometres. However, the advent of large fish density data sets, spatial-stream-network (SSN) models that benefit from nonindependence among samples,...

Properties of on-line social systems

NASA Astrophysics Data System (ADS)

Grabowski, A.; Kruszewska, N.; Kosiński, R. A.

2008-11-01

We study properties of five different social systems: (i) internet society of friends consisting of over 106 people, (ii) social network consisting of 3 × 104 individuals, who interact in a large virtual world of Massive Multiplayer Online Role Playing Games (MMORPGs), (iii) over 106 users of music community website, (iv) over 5 × 106 users of gamers community server and (v) over 0.25 × 106 users of books admirer website. Individuals included in large social network form an Internet community and organize themselves in groups of different sizes. The destiny of those systems, as well as the method of creating of new connections, are different, however we found that the properties of these networks are very similar. We have found that the network components size distribution follow the power-law scaling form. In all five systems we have found interesting scaling laws concerning human dynamics. Our research has shown how long people are interested in a single task, how much time they devote to it and how fast they are making friends. It is surprising that the time evolution of an individual connectivity is very similar in each system.

Propagation of economic shocks in input-output networks: A cross-country analysis

NASA Astrophysics Data System (ADS)

Contreras, Martha G. Alatriste; Fagiolo, Giorgio

2014-12-01

This paper investigates how economic shocks propagate and amplify through the input-output network connecting industrial sectors in developed economies. We study alternative models of diffusion on networks and we calibrate them using input-output data on real-world inter-sectoral dependencies for several European countries before the Great Depression. We show that the impact of economic shocks strongly depends on the nature of the shock and country size. Shocks that impact on final demand without changing production and the technological relationships between sectors have on average a large but very homogeneous impact on the economy. Conversely, when shocks change also the magnitudes of input-output across-sector interdependencies (and possibly sector production), the economy is subject to predominantly large but more heterogeneous avalanche sizes. In this case, we also find that (i) the more a sector is globally central in the country network, the larger its impact; (ii) the largest European countries, such as those constituting the core of the European Union's economy, typically experience the largest avalanches, signaling their intrinsic higher vulnerability to economic shocks.

The Complexity of Dynamics in Small Neural Circuits

PubMed Central

Panzeri, Stefano

2016-01-01

Mean-field approximations are a powerful tool for studying large neural networks. However, they do not describe well the behavior of networks composed of a small number of neurons. In this case, major differences between the mean-field approximation and the real behavior of the network can arise. Yet, many interesting problems in neuroscience involve the study of mesoscopic networks composed of a few tens of neurons. Nonetheless, mathematical methods that correctly describe networks of small size are still rare, and this prevents us to make progress in understanding neural dynamics at these intermediate scales. Here we develop a novel systematic analysis of the dynamics of arbitrarily small networks composed of homogeneous populations of excitatory and inhibitory firing-rate neurons. We study the local bifurcations of their neural activity with an approach that is largely analytically tractable, and we numerically determine the global bifurcations. We find that for strong inhibition these networks give rise to very complex dynamics, caused by the formation of multiple branching solutions of the neural dynamics equations that emerge through spontaneous symmetry-breaking. This qualitative change of the neural dynamics is a finite-size effect of the network, that reveals qualitative and previously unexplored differences between mesoscopic cortical circuits and their mean-field approximation. The most important consequence of spontaneous symmetry-breaking is the ability of mesoscopic networks to regulate their degree of functional heterogeneity, which is thought to help reducing the detrimental effect of noise correlations on cortical information processing. PMID:27494737

Large-Scale Coronal Heating from the Solar Magnetic Network

NASA Technical Reports Server (NTRS)

Falconer, David A.; Moore, Ronald L.; Porter, Jason G.; Hathaway, David H.

1999-01-01

In Fe 12 images from SOHO/EIT, the quiet solar corona shows structure on scales ranging from sub-supergranular (i.e., bright points and coronal network) to multi- supergranular. In Falconer et al 1998 (Ap.J., 501, 386) we suppressed the large-scale background and found that the network-scale features are predominantly rooted in the magnetic network lanes at the boundaries of the supergranules. The emission of the coronal network and bright points contribute only about 5% of the entire quiet solar coronal Fe MI emission. Here we investigate the large-scale corona, the supergranular and larger-scale structure that we had previously treated as a background, and that emits 95% of the total Fe XII emission. We compare the dim and bright halves of the large- scale corona and find that the bright half is 1.5 times brighter than the dim half, has an order of magnitude greater area of bright point coverage, has three times brighter coronal network, and has about 1.5 times more magnetic flux than the dim half These results suggest that the brightness of the large-scale corona is more closely related to the large- scale total magnetic flux than to bright point activity. We conclude that in the quiet sun: (1) Magnetic flux is modulated (concentrated/diluted) on size scales larger than supergranules. (2) The large-scale enhanced magnetic flux gives an enhanced, more active, magnetic network and an increased incidence of network bright point formation. (3) The heating of the large-scale corona is dominated by more widespread, but weaker, network activity than that which heats the bright points. This work was funded by the Solar Physics Branch of NASA's office of Space Science through the SR&T Program and the SEC Guest Investigator Program.

Enabling Comprehension of Patient Subgroups and Characteristics in Large Bipartite Networks: Implications for Precision Medicine

PubMed Central

Bhavnani, Suresh K.; Chen, Tianlong; Ayyaswamy, Archana; Visweswaran, Shyam; Bellala, Gowtham; Rohit, Divekar; Kevin E., Bassler

2017-01-01

A primary goal of precision medicine is to identify patient subgroups based on their characteristics (e.g., comorbidities or genes) with the goal of designing more targeted interventions. While network visualization methods such as Fruchterman-Reingold have been used to successfully identify such patient subgroups in small to medium sized data sets, they often fail to reveal comprehensible visual patterns in large and dense networks despite having significant clustering. We therefore developed an algorithm called ExplodeLayout, which exploits the existence of significant clusters in bipartite networks to automatically “explode” a traditional network layout with the goal of separating overlapping clusters, while at the same time preserving key network topological properties that are critical for the comprehension of patient subgroups. We demonstrate the utility of ExplodeLayout by visualizing a large dataset extracted from Medicare consisting of readmitted hip-fracture patients and their comorbidities, demonstrate its statistically significant improvement over a traditional layout algorithm, and discuss how the resulting network visualization enabled clinicians to infer mechanisms precipitating hospital readmission in specific patient subgroups. PMID:28815099

Transitions in Smokers’ Social Networks After Quit Attempts: A Latent Transition Analysis

PubMed Central

Smith, Rachel A.; Piper, Megan E.; Roberts, Linda J.; Baker, Timothy B.

2016-01-01

Introduction: Smokers’ social networks vary in size, composition, and amount of exposure to smoking. The extent to which smokers’ social networks change after a quit attempt is unknown, as is the relation between quitting success and later network changes. Methods: Unique types of social networks for 691 smokers enrolled in a smoking-cessation trial were identified based on network size, new network members, members’ smoking habits, within network smoking, smoking buddies, and romantic partners’ smoking. Latent transition analysis was used to identify the network classes and to predict transitions in class membership across 3 years from biochemically assessed smoking abstinence. Results: Five network classes were identified: Immersed (large network, extensive smoking exposure including smoking buddies), Low Smoking Exposure (large network, minimal smoking exposure), Smoking Partner (small network, smoking exposure primarily from partner), Isolated (small network, minimal smoking exposure), and Distant Smoking Exposure (small network, considerable nonpartner smoking exposure). Abstinence at years 1 and 2 was associated with shifts in participants’ social networks to less contact with smokers and larger networks in years 2 and 3. Conclusions: In the years following a smoking-cessation attempt, smokers’ social networks changed, and abstinence status predicted these changes. Networks defined by high levels of exposure to smokers were especially associated with continued smoking. Abstinence, however, predicted transitions to larger social networks comprising less smoking exposure. These results support treatments that aim to reduce exposure to smoking cues and smokers, including partners who smoke. Implications: Prior research has shown that social network features predict the likelihood of subsequent smoking cessation. The current research illustrates how successful quitting predicts social network change over 3 years following a quit attempt. Specifically, abstinence predicts transitions to networks that are larger and afford less exposure to smokers. This suggests that quitting smoking may expand a person’s social milieu rather than narrow it. This effect, plus reduced exposure to smokers, may help sustain abstinence. PMID:27613925

A framework for detecting communities of unbalanced sizes in networks

NASA Astrophysics Data System (ADS)

Žalik, Krista Rizman; Žalik, Borut

2018-01-01

Community detection in large networks has been a focus of recent research in many of fields, including biology, physics, social sciences, and computer science. Most community detection methods partition the entire network into communities, groups of nodes that have many connections within communities and few connections between them and do not identify different roles that nodes can have in communities. We propose a community detection model that integrates more different measures that can fast identify communities of different sizes and densities. We use node degree centrality, strong similarity with one node from community, maximal similarity of node to community, compactness of communities and separation between communities. Each measure has its own strength and weakness. Thus, combining different measures can benefit from the strengths of each one and eliminate encountered problems of using an individual measure. We present a fast local expansion algorithm for uncovering communities of different sizes and densities and reveals rich information on input networks. Experimental results show that the proposed algorithm is better or as effective as the other community detection algorithms for both real-world and synthetic networks while it requires less time.

Linear Vector Quantisation and Uniform Circular Arrays based decoupled two-dimensional angle of arrival estimation

NASA Astrophysics Data System (ADS)

Ndaw, Joseph D.; Faye, Andre; Maïga, Amadou S.

2017-05-01

Artificial neural networks (ANN)-based models are efficient ways of source localisation. However very large training sets are needed to precisely estimate two-dimensional Direction of arrival (2D-DOA) with ANN models. In this paper we present a fast artificial neural network approach for 2D-DOA estimation with reduced training sets sizes. We exploit the symmetry properties of Uniform Circular Arrays (UCA) to build two different datasets for elevation and azimuth angles. Linear Vector Quantisation (LVQ) neural networks are then sequentially trained on each dataset to separately estimate elevation and azimuth angles. A multilevel training process is applied to further reduce the training sets sizes.

Framework for cascade size calculations on random networks

NASA Astrophysics Data System (ADS)

Burkholz, Rebekka; Schweitzer, Frank

2018-04-01

We present a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size. Our method is exact and applies to network ensembles with almost arbitrary degree distribution, degree-degree correlations, and, in case of threshold models, for arbitrary threshold distribution. With our approach, we shift the perspective from the known branching process approximations to the iterative update of suitable probability distributions. Such distributions are key to capture cascade dynamics that involve possibly continuous quantities and that depend on the cascade history, e.g., if load is accumulated over time. As a proof of concept, we provide two examples: (a) Constant load models that cover many of the analytically tractable casacade models, and, as a highlight, (b) a fiber bundle model that was not tractable by branching process approximations before. Our derivations cover the whole cascade dynamics, not only their steady state. This allows us to include interventions in time or further model complexity in the analysis.

Deep learning in the small sample size setting: cascaded feed forward neural networks for medical image segmentation

NASA Astrophysics Data System (ADS)

Gaonkar, Bilwaj; Hovda, David; Martin, Neil; Macyszyn, Luke

2016-03-01

Deep Learning, refers to large set of neural network based algorithms, have emerged as promising machine- learning tools in the general imaging and computer vision domains. Convolutional neural networks (CNNs), a specific class of deep learning algorithms, have been extremely effective in object recognition and localization in natural images. A characteristic feature of CNNs, is the use of a locally connected multi layer topology that is inspired by the animal visual cortex (the most powerful vision system in existence). While CNNs, perform admirably in object identification and localization tasks, typically require training on extremely large datasets. Unfortunately, in medical image analysis, large datasets are either unavailable or are extremely expensive to obtain. Further, the primary tasks in medical imaging are organ identification and segmentation from 3D scans, which are different from the standard computer vision tasks of object recognition. Thus, in order to translate the advantages of deep learning to medical image analysis, there is a need to develop deep network topologies and training methodologies, that are geared towards medical imaging related tasks and can work in a setting where dataset sizes are relatively small. In this paper, we present a technique for stacked supervised training of deep feed forward neural networks for segmenting organs from medical scans. Each `neural network layer' in the stack is trained to identify a sub region of the original image, that contains the organ of interest. By layering several such stacks together a very deep neural network is constructed. Such a network can be used to identify extremely small regions of interest in extremely large images, inspite of a lack of clear contrast in the signal or easily identifiable shape characteristics. What is even more intriguing is that the network stack achieves accurate segmentation even when it is trained on a single image with manually labelled ground truth. We validate this approach,using a publicly available head and neck CT dataset. We also show that a deep neural network of similar depth, if trained directly using backpropagation, cannot acheive the tasks achieved using our layer wise training paradigm.

A stochastic-field description of finite-size spiking neural networks

PubMed Central

Longtin, André

2017-01-01

Neural network dynamics are governed by the interaction of spiking neurons. Stochastic aspects of single-neuron dynamics propagate up to the network level and shape the dynamical and informational properties of the population. Mean-field models of population activity disregard the finite-size stochastic fluctuations of network dynamics and thus offer a deterministic description of the system. Here, we derive a stochastic partial differential equation (SPDE) describing the temporal evolution of the finite-size refractory density, which represents the proportion of neurons in a given refractory state at any given time. The population activity—the density of active neurons per unit time—is easily extracted from this refractory density. The SPDE includes finite-size effects through a two-dimensional Gaussian white noise that acts both in time and along the refractory dimension. For an infinite number of neurons the standard mean-field theory is recovered. A discretization of the SPDE along its characteristic curves allows direct simulations of the activity of large but finite spiking networks; this constitutes the main advantage of our approach. Linearizing the SPDE with respect to the deterministic asynchronous state allows the theoretical investigation of finite-size activity fluctuations. In particular, analytical expressions for the power spectrum and autocorrelation of activity fluctuations are obtained. Moreover, our approach can be adapted to incorporate multiple interacting populations and quasi-renewal single-neuron dynamics. PMID:28787447

Extreme fluctuations in stochastic network coordination with time delays

NASA Astrophysics Data System (ADS)

Hunt, D.; Molnár, F.; Szymanski, B. K.; Korniss, G.

2015-12-01

We study the effects of uniform time delays on the extreme fluctuations in stochastic synchronization and coordination problems with linear couplings in complex networks. We obtain the average size of the fluctuations at the nodes from the behavior of the underlying modes of the network. We then obtain the scaling behavior of the extreme fluctuations with system size, as well as the distribution of the extremes on complex networks, and compare them to those on regular one-dimensional lattices. For large complex networks, when the delay is not too close to the critical one, fluctuations at the nodes effectively decouple, and the limit distributions converge to the Fisher-Tippett-Gumbel density. In contrast, fluctuations in low-dimensional spatial graphs are strongly correlated, and the limit distribution of the extremes is the Airy density. Finally, we also explore the effects of nonlinear couplings on the stability and on the extremes of the synchronization landscapes.

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

Chen, Dong; Heidelberger, Philip; Sugawara, Yutaka

An apparatus and method for extending the scalability and improving the partitionability of networks that contain all-to-all links for transporting packet traffic from a source endpoint to a destination endpoint with low per-endpoint (per-server) cost and a small number of hops. An all-to-all wiring in the baseline topology is decomposed into smaller all-to-all components in which each smaller all-to-all connection is replaced with star topology by using global switches. Stacking multiple copies of the star topology baseline network creates a multi-planed switching topology for transporting packet traffic. Point-to-point unified stacking method using global switch wiring methods connects multiple planes ofmore » a baseline topology by using the global switches to create a large network size with a low number of hops, i.e., low network latency. Grouped unified stacking method increases the scalability (network size) of a stacked topology.« less

The robustness of multiplex networks under layer node-based attack

PubMed Central

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-01-01

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology. PMID:27075870

The robustness of multiplex networks under layer node-based attack.

PubMed

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-04-14

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology.

Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution.

PubMed

Menezes, Mozart B C; Kim, Seokjin; Huang, Rongbing

2017-01-01

Though the small-world phenomenon is widespread in many real networks, it is still challenging to replicate a large network at the full scale for further study on its structure and dynamics when sufficient data are not readily available. We propose a method to construct a Watts-Strogatz network using a sample from a small-world network with symmetric degree distribution. Our method yields an estimated degree distribution which fits closely with that of a Watts-Strogatz network and leads into accurate estimates of network metrics such as clustering coefficient and degree of separation. We observe that the accuracy of our method increases as network size increases.

Towards cortex sized artificial neural systems.

PubMed

Johansson, Christopher; Lansner, Anders

2007-01-01

We propose, implement, and discuss an abstract model of the mammalian neocortex. This model is instantiated with a sparse recurrently connected neural network that has spiking leaky integrator units and continuous Hebbian learning. First we study the structure, modularization, and size of neocortex, and then we describe a generic computational model of the cortical circuitry. A characterizing feature of the model is that it is based on the modularization of neocortex into hypercolumns and minicolumns. Both a floating- and fixed-point arithmetic implementation of the model are presented along with simulation results. We conclude that an implementation on a cluster computer is not communication but computation bounded. A mouse and rat cortex sized version of our model executes in 44% and 23% of real-time respectively. Further, an instance of the model with 1.6 x 10(6) units and 2 x 10(11) connections performed noise reduction and pattern completion. These implementations represent the current frontier of large-scale abstract neural network simulations in terms of network size and running speed.

Traffic sharing algorithms for hybrid mobile networks

NASA Technical Reports Server (NTRS)

Arcand, S.; Murthy, K. M. S.; Hafez, R.

1995-01-01

In a hybrid (terrestrial + satellite) mobile personal communications networks environment, a large size satellite footprint (supercell) overlays on a large number of smaller size, contiguous terrestrial cells. We assume that the users have either a terrestrial only single mode terminal (SMT) or a terrestrial/satellite dual mode terminal (DMT) and the ratio of DMT to the total terminals is defined gamma. It is assumed that the call assignments to and handovers between terrestrial cells and satellite supercells take place in a dynamic fashion when necessary. The objectives of this paper are twofold, (1) to propose and define a class of traffic sharing algorithms to manage terrestrial and satellite network resources efficiently by handling call handovers dynamically, and (2) to analyze and evaluate the algorithms by maximizing the traffic load handling capability (defined in erl/cell) over a wide range of terminal ratios (gamma) given an acceptable range of blocking probabilities. Two of the algorithms (G & S) in the proposed class perform extremely well for a wide range of gamma.

Tunable electronic lens using a gradient polymer network liquid crystal

NASA Astrophysics Data System (ADS)

Ren, Hongwen; Wu, Shin-Tson

2003-01-01

Tunable electronic lenses using gradient polymer network liquid crystal (PNLC) cells were demonstrated. By changing the photomask pattern, both positive and negative lenses were fabricated. The advantages of such a PNLC lens are low operation voltage, large aperture size, and simple electrode design. To overcome the polarization dependence, stacking two orthogonal homogeneous PNLC cells is considered.

Valley segments, stream reaches, and channel units [Chapter 2

Treesearch

Peter A. Bisson; David R. Montgomery; John M. Buffington

2006-01-01

Valley segments, stream reaches, and channel units are three hierarchically nested subdivisions of the drainage network (Frissell et al. 1986), falling in size between landscapes and watersheds (see Chapter 1) and individual point measurements made along the stream network (Table 2.1; also see Chapters 3 and 4). These three subdivisions compose the habitat for large,...

Social Network Changes and Life Events across the Life Span: A Meta-Analysis

ERIC Educational Resources Information Center

Wrzus, Cornelia; Hanel, Martha; Wagner, Jenny; Neyer, Franz J.

2013-01-01

For researchers and practitioners interested in social relationships, the question remains as to how large social networks typically are, and how their size and composition change across adulthood. On the basis of predictions of socioemotional selectivity theory and social convoy theory, we conducted a meta-analysis on age-related social network…

Accurate chemical master equation solution using multi-finite buffers

DOE PAGES

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-06-29

Here, the discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multiscale nature of many networks where reaction rates have a large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multifinite buffers for reducing the state spacemore » by $O(n!)$, exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be precomputed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multiscale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.« less

Accurate chemical master equation solution using multi-finite buffers

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

Cao, Youfang; Terebus, Anna; Liang, Jie

Here, the discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multiscale nature of many networks where reaction rates have a large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multifinite buffers for reducing the state spacemore » by $O(n!)$, exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be precomputed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multiscale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.« less

Modelling of information diffusion on social networks with applications to WeChat

NASA Astrophysics Data System (ADS)

Liu, Liang; Qu, Bo; Chen, Bin; Hanjalic, Alan; Wang, Huijuan

2018-04-01

Traces of user activities recorded in online social networks open new possibilities to systematically understand the information diffusion process on social networks. From the online social network WeChat, we collected a large number of information cascade trees, each of which tells the spreading trajectory of a message/information such as which user creates the information and which users view or forward the information shared by which neighbours. In this work, we propose two heterogeneous non-linear models, one for the topologies of the information cascade trees and the other for the stochastic process of information diffusion on a social network. Both models are validated by the WeChat data in reproducing and explaining key features of cascade trees. Specifically, we apply the Random Recursive Tree (RRT) to model the growth of cascade trees. The RRT model could capture key features, i.e. the average path length and degree variance of a cascade tree in relation to the number of nodes (size) of the tree. Its single identified parameter quantifies the relative depth or broadness of the cascade trees and indicates that information propagates via a star-like broadcasting or viral-like hop by hop spreading. The RRT model explains the appearance of hubs, thus a possibly smaller average path length as the cascade size increases, as observed in WeChat. We further propose the stochastic Susceptible View Forward Removed (SVFR) model to depict the dynamic user behaviour including creating, viewing, forwarding and ignoring a message on a given social network. Beside the average path length and degree variance of the cascade trees in relation to their sizes, the SVFR model could further explain the power-law cascade size distribution in WeChat and unravel that a user with a large number of friends may actually have a smaller probability to read a message (s)he receives due to limited attention.

Ultrafast and Wide Range Analysis of DNA Molecules Using Rigid Network Structure of Solid Nanowires

PubMed Central

Rahong, Sakon; Yasui, Takao; Yanagida, Takeshi; Nagashima, Kazuki; Kanai, Masaki; Klamchuen, Annop; Meng, Gang; He, Yong; Zhuge, Fuwei; Kaji, Noritada; Kawai, Tomoji; Baba, Yoshinobu

2014-01-01

Analyzing sizes of DNA via electrophoresis using a gel has played an important role in the recent, rapid progress of biology and biotechnology. Although analyzing DNA over a wide range of sizes in a short time is desired, no existing electrophoresis methods have been able to fully satisfy these two requirements. Here we propose a novel method using a rigid 3D network structure composed of solid nanowires within a microchannel. This rigid network structure enables analysis of DNA under applied DC electric fields for a large DNA size range (100 bp–166 kbp) within 13 s, which are much wider and faster conditions than those of any existing methods. The network density is readily varied for the targeted DNA size range by tailoring the number of cycles of the nanowire growth only at the desired spatial position within the microchannel. The rigid dense 3D network structure with spatial density control plays an important role in determining the capability for analyzing DNA. Since the present method allows the spatial location and density of the nanostructure within the microchannels to be defined, this unique controllability offers a new strategy to develop an analytical method not only for DNA but also for other biological molecules. PMID:24918865

Ultrafast and Wide Range Analysis of DNA Molecules Using Rigid Network Structure of Solid Nanowires

NASA Astrophysics Data System (ADS)

Rahong, Sakon; Yasui, Takao; Yanagida, Takeshi; Nagashima, Kazuki; Kanai, Masaki; Klamchuen, Annop; Meng, Gang; He, Yong; Zhuge, Fuwei; Kaji, Noritada; Kawai, Tomoji; Baba, Yoshinobu

2014-06-01

Analyzing sizes of DNA via electrophoresis using a gel has played an important role in the recent, rapid progress of biology and biotechnology. Although analyzing DNA over a wide range of sizes in a short time is desired, no existing electrophoresis methods have been able to fully satisfy these two requirements. Here we propose a novel method using a rigid 3D network structure composed of solid nanowires within a microchannel. This rigid network structure enables analysis of DNA under applied DC electric fields for a large DNA size range (100 bp-166 kbp) within 13 s, which are much wider and faster conditions than those of any existing methods. The network density is readily varied for the targeted DNA size range by tailoring the number of cycles of the nanowire growth only at the desired spatial position within the microchannel. The rigid dense 3D network structure with spatial density control plays an important role in determining the capability for analyzing DNA. Since the present method allows the spatial location and density of the nanostructure within the microchannels to be defined, this unique controllability offers a new strategy to develop an analytical method not only for DNA but also for other biological molecules.

Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks

NASA Astrophysics Data System (ADS)

Giang, Pham Thanh; Nakagawa, Kenji

The IEEE 802.11 MAC standard for wireless ad hoc networks adopts Binary Exponential Back-off (BEB) mechanism to resolve bandwidth contention between stations. BEB mechanism controls the bandwidth allocation for each station by choosing a back-off value from one to CW according to the uniform random distribution, where CW is the contention window size. However, in asymmetric multi-hop networks, some stations are disadvantaged in opportunity of access to the shared channel and may suffer severe throughput degradation when the traffic load is large. Then, the network performance is degraded in terms of throughput and fairness. In this paper, we propose a new cross-layer scheme aiming to solve the per-flow unfairness problem and achieve good throughput performance in IEEE 802.11 multi-hop ad hoc networks. Our cross-layer scheme collects useful information from the physical, MAC and link layers of own station. This information is used to determine the optimal Contention Window (CW) size for per-station fairness. We also use this information to adjust CW size for each flow in the station in order to achieve per-flow fairness. Performance of our cross-layer scheme is examined on various asymmetric multi-hop network topologies by using Network Simulator (NS-2).

An Energy-Efficient Mobile Sink-Based Unequal Clustering Mechanism for WSNs.

PubMed

Gharaei, Niayesh; Abu Bakar, Kamalrulnizam; Mohd Hashim, Siti Zaiton; Hosseingholi Pourasl, Ali; Siraj, Mohammad; Darwish, Tasneem

2017-08-11

Network lifetime and energy efficiency are crucial performance metrics used to evaluate wireless sensor networks (WSNs). Decreasing and balancing the energy consumption of nodes can be employed to increase network lifetime. In cluster-based WSNs, one objective of applying clustering is to decrease the energy consumption of the network. In fact, the clustering technique will be considered effective if the energy consumed by sensor nodes decreases after applying clustering, however, this aim will not be achieved if the cluster size is not properly chosen. Therefore, in this paper, the energy consumption of nodes, before clustering, is considered to determine the optimal cluster size. A two-stage Genetic Algorithm (GA) is employed to determine the optimal interval of cluster size and derive the exact value from the interval. Furthermore, the energy hole is an inherent problem which leads to a remarkable decrease in the network's lifespan. This problem stems from the asynchronous energy depletion of nodes located in different layers of the network. For this reason, we propose Circular Motion of Mobile-Sink with Varied Velocity Algorithm (CM2SV2) to balance the energy consumption ratio of cluster heads (CH). According to the results, these strategies could largely increase the network's lifetime by decreasing the energy consumption of sensors and balancing the energy consumption among CHs.

LVQ and backpropagation neural networks applied to NASA SSME data

NASA Technical Reports Server (NTRS)

Doniere, Timothy F.; Dhawan, Atam P.

1993-01-01

Feedfoward neural networks with backpropagation learning have been used as function approximators for modeling the space shuttle main engine (SSME) sensor signals. The modeling of these sensor signals is aimed at the development of a sensor fault detection system that can be used during ground test firings. The generalization capability of a neural network based function approximator depends on the training vectors which in this application may be derived from a number of SSME ground test-firings. This yields a large number of training vectors. Large training sets can cause the time required to train the network to be very large. Also, the network may not be able to generalize for large training sets. To reduce the size of the training sets, the SSME test-firing data is reduced using the learning vector quantization (LVQ) based technique. Different compression ratios were used to obtain compressed data in training the neural network model. The performance of the neural model trained using reduced sets of training patterns is presented and compared with the performance of the model trained using complete data. The LVQ can also be used as a function approximator. The performance of the LVQ as a function approximator using reduced training sets is presented and compared with the performance of the backpropagation network.

Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Jo, Hang-Hyun

2015-05-01

Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributions in large-scale networks only using local information of a small fraction of sampled nodes. Here we propose a tail-scope method based on local observational bias of the friendship paradox. We show that the tail-scope method outperforms the uniform node sampling for estimating heavy tails of degree distributions, while the opposite tendency is observed in the range of small degrees. In order to take advantages of both sampling methods, we devise the hybrid method that successfully recovers the whole range of degree distributions. Our tail-scope method shows how structural heterogeneities of large-scale complex networks can be used to effectively reveal the network structure only with limited local information.

Modulation aware cluster size optimisation in wireless sensor networks

NASA Astrophysics Data System (ADS)

Sriram Naik, M.; Kumar, Vinay

2017-07-01

Wireless sensor networks (WSNs) play a great role because of their numerous advantages to the mankind. The main challenge with WSNs is the energy efficiency. In this paper, we have focused on the energy minimisation with the help of cluster size optimisation along with consideration of modulation effect when the nodes are not able to communicate using baseband communication technique. Cluster size optimisations is important technique to improve the performance of WSNs. It provides improvement in energy efficiency, network scalability, network lifetime and latency. We have proposed analytical expression for cluster size optimisation using traditional sensing model of nodes for square sensing field with consideration of modulation effects. Energy minimisation can be achieved by changing the modulation schemes such as BPSK, 16-QAM, QPSK, 64-QAM, etc., so we are considering the effect of different modulation techniques in the cluster formation. The nodes in the sensing fields are random and uniformly deployed. It is also observed that placement of base station at centre of scenario enables very less number of modulation schemes to work in energy efficient manner but when base station placed at the corner of the sensing field, it enable large number of modulation schemes to work in energy efficient manner.

HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks

PubMed Central

Azad, Ariful; Ouzounis, Christos A; Kyrpides, Nikos C; Buluç, Aydin

2018-01-01

Abstract Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein–protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL’s scalability to cluster large datasets still remains a bottleneck due to high running times and memory demands. Here, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ∼70 million nodes with ∼68 billion edges in ∼2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license. PMID:29315405

HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks

DOE PAGES

Azad, Ariful; Pavlopoulos, Georgios A.; Ouzounis, Christos A.; ...

2018-01-05

Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein–protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL’s scalability to cluster large datasets still remains a bottleneck due to high running times andmore » memory demands. In this paper, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ~70 million nodes with ~68 billion edges in ~2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. Finally, HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license.« less

HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks

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

Azad, Ariful; Pavlopoulos, Georgios A.; Ouzounis, Christos A.

Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein–protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL’s scalability to cluster large datasets still remains a bottleneck due to high running times andmore » memory demands. In this paper, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ~70 million nodes with ~68 billion edges in ~2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. Finally, HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license.« less

Exit probability of the one-dimensional q-voter model: Analytical results and simulations for large networks

NASA Astrophysics Data System (ADS)

Timpanaro, André M.; Prado, Carmen P. C.

2014-05-01

We discuss the exit probability of the one-dimensional q-voter model and present tools to obtain estimates about this probability, both through simulations in large networks (around 107 sites) and analytically in the limit where the network is infinitely large. We argue that the result E(ρ )=ρq/ρq+(1-ρ)q, that was found in three previous works [F. Slanina, K. Sznajd-Weron, and P. Przybyła, Europhys. Lett. 82, 18006 (2008), 10.1209/0295-5075/82/18006; R. Lambiotte and S. Redner, Europhys. Lett. 82, 18007 (2008), 10.1209/0295-5075/82/18007, for the case q =2; and P. Przybyła, K. Sznajd-Weron, and M. Tabiszewski, Phys. Rev. E 84, 031117 (2011), 10.1103/PhysRevE.84.031117, for q >2] using small networks (around 103 sites), is a good approximation, but there are noticeable deviations that appear even for small systems and that do not disappear when the system size is increased (with the notable exception of the case q =2). We also show that, under some simple and intuitive hypotheses, the exit probability must obey the inequality ρq/ρq+(1-ρ)≤E(ρ)≤ρ/ρ +(1-ρ)q in the infinite size limit. We believe this settles in the negative the suggestion made [S. Galam and A. C. R. Martins, Europhys. Lett. 95, 48005 (2001), 10.1209/0295-5075/95/48005] that this result would be a finite size effect, with the exit probability actually being a step function. We also show how the result that the exit probability cannot be a step function can be reconciled with the Galam unified frame, which was also a source of controversy.

A Multilevel Gamma-Clustering Layout Algorithm for Visualization of Biological Networks

PubMed Central

Hruz, Tomas; Lucas, Christoph; Laule, Oliver; Zimmermann, Philip

2013-01-01

Visualization of large complex networks has become an indispensable part of systems biology, where organisms need to be considered as one complex system. The visualization of the corresponding network is challenging due to the size and density of edges. In many cases, the use of standard visualization algorithms can lead to high running times and poorly readable visualizations due to many edge crossings. We suggest an approach that analyzes the structure of the graph first and then generates a new graph which contains specific semantic symbols for regular substructures like dense clusters. We propose a multilevel gamma-clustering layout visualization algorithm (MLGA) which proceeds in three subsequent steps: (i) a multilevel γ-clustering is used to identify the structure of the underlying network, (ii) the network is transformed to a tree, and (iii) finally, the resulting tree which shows the network structure is drawn using a variation of a force-directed algorithm. The algorithm has a potential to visualize very large networks because it uses modern clustering heuristics which are optimized for large graphs. Moreover, most of the edges are removed from the visual representation which allows keeping the overview over complex graphs with dense subgraphs. PMID:23864855

Social networks in cardiovascular disease management.

PubMed

Shaya, Fadia T; Yan, Xia; Farshid, Maryam; Barakat, Samer; Jung, Miah; Low, Sara; Fedder, Donald

2010-12-01

Cardiovascular disease remains the leading cause of death in the USA. Social networks have a positive association with obesity, smoking cessation and weight loss. This article summarizes studies evaluating the impact of social networks on the management of cardiovascular disease. The 35 studies included in the article describe the impact of social networks on a decreased incidence of cardiovascular disease, depression and mortality. In addition, having a large-sized social network is also associated with better outcomes and improved health. The role of pharmacists is beginning to play an important role in the patient-centered medical home, which needs to be incorporated into social networks. The patient-centered medical home can serve as an adaptive source for social network evolvement.

Localization of diffusion sources in complex networks with sparse observations

NASA Astrophysics Data System (ADS)

Hu, Zhao-Long; Shen, Zhesi; Tang, Chang-Bing; Xie, Bin-Bin; Lu, Jian-Feng

2018-04-01

Locating sources in a large network is of paramount importance to reduce the spreading of disruptive behavior. Based on the backward diffusion-based method and integer programming, we propose an efficient approach to locate sources in complex networks with limited observers. The results on model networks and empirical networks demonstrate that, for a certain fraction of observers, the accuracy of our method for source localization will improve as the increase of network size. Besides, compared with the previous method (the maximum-minimum method), the performance of our method is much better with a small fraction of observers, especially in heterogeneous networks. Furthermore, our method is more robust against noise environments and strategies of choosing observers.

The Renormalization Group and Its Applications to Generating Coarse-Grained Models of Large Biological Molecular Systems.

PubMed

Koehl, Patrice; Poitevin, Frédéric; Navaza, Rafael; Delarue, Marc

2017-03-14

Understanding the dynamics of biomolecules is the key to understanding their biological activities. Computational methods ranging from all-atom molecular dynamics simulations to coarse-grained normal-mode analyses based on simplified elastic networks provide a general framework to studying these dynamics. Despite recent successes in studying very large systems with up to a 100,000,000 atoms, those methods are currently limited to studying small- to medium-sized molecular systems due to computational limitations. One solution to circumvent these limitations is to reduce the size of the system under study. In this paper, we argue that coarse-graining, the standard approach to such size reduction, must define a hierarchy of models of decreasing sizes that are consistent with each other, i.e., that each model contains the information of the dynamics of its predecessor. We propose a new method, Decimate, for generating such a hierarchy within the context of elastic networks for normal-mode analysis. This method is based on the concept of the renormalization group developed in statistical physics. We highlight the details of its implementation, with a special focus on its scalability to large systems of up to millions of atoms. We illustrate its application on two large systems, the capsid of a virus and the ribosome translation complex. We show that highly decimated representations of those systems, containing down to 1% of their original number of atoms, still capture qualitatively and quantitatively their dynamics. Decimate is available as an OpenSource resource.

Cortical network modeling: analytical methods for firing rates and some properties of networks of LIF neurons.

PubMed

Tuckwell, Henry C

2006-01-01

The circuitry of cortical networks involves interacting populations of excitatory (E) and inhibitory (I) neurons whose relationships are now known to a large extent. Inputs to E- and I-cells may have their origins in remote or local cortical areas. We consider a rudimentary model involving E- and I-cells. One of our goals is to test an analytic approach to finding firing rates in neural networks without using a diffusion approximation and to this end we consider in detail networks of excitatory neurons with leaky integrate-and-fire (LIF) dynamics. A simple measure of synchronization, denoted by S(q), where q is between 0 and 100 is introduced. Fully connected E-networks have a large tendency to become dominated by synchronously firing groups of cells, except when inputs are relatively weak. We observed random or asynchronous firing in such networks with diverse sets of parameter values. When such firing patterns were found, the analytical approach was often able to accurately predict average neuronal firing rates. We also considered several properties of E-E networks, distinguishing several kinds of firing pattern. Included were those with silences before or after periods of intense activity or with periodic synchronization. We investigated the occurrence of synchronized firing with respect to changes in the internal excitatory postsynaptic potential (EPSP) magnitude in a network of 100 neurons with fixed values of the remaining parameters. When the internal EPSP size was less than a certain value, synchronization was absent. The amount of synchronization then increased slowly as the EPSP amplitude increased until at a particular EPSP size the amount of synchronization abruptly increased, with S(5) attaining the maximum value of 100%. We also found network frequency transfer characteristics for various network sizes and found a linear dependence of firing frequency over wide ranges of the external afferent frequency, with non-linear effects at lower input frequencies. The theory may also be applied to sparsely connected networks, whose firing behaviour was found to change abruptly as the probability of a connection passed through a critical value. The analytical method was also found to be useful for a feed-forward excitatory network and a network of excitatory and inhibitory neurons.

Network structure of subway passenger flows

NASA Astrophysics Data System (ADS)

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

2016-03-01

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

Biology Inspired Approach for Communal Behavior in Sensor Networks

NASA Technical Reports Server (NTRS)

Jones, Kennie H.; Lodding, Kenneth N.; Olariu, Stephan; Wilson, Larry; Xin, Chunsheng

2006-01-01

Research in wireless sensor network technology has exploded in the last decade. Promises of complex and ubiquitous control of the physical environment by these networks open avenues for new kinds of science and business. Due to the small size and low cost of sensor devices, visionaries promise systems enabled by deployment of massive numbers of sensors working in concert. Although the reduction in size has been phenomenal it results in severe limitations on the computing, communicating, and power capabilities of these devices. Under these constraints, research efforts have concentrated on developing techniques for performing relatively simple tasks with minimal energy expense assuming some form of centralized control. Unfortunately, centralized control does not scale to massive size networks and execution of simple tasks in sparsely populated networks will not lead to the sophisticated applications predicted. These must be enabled by new techniques dependent on local and autonomous cooperation between sensors to effect global functions. As a step in that direction, in this work we detail a technique whereby a large population of sensors can attain a global goal using only local information and by making only local decisions without any form of centralized control.

Land of the Giants. Science Safari.

ERIC Educational Resources Information Center

Sheldon, Louisa; And Others

This is the fourth program in the Science Safari series produced by the Fairfax Network of the Fairfax County (Virginia) Public Schools. It focuses on large animals, their life, advantages and disadvantages of their size, and the adaptations that allow them to survive in their environments. The large animals highlighted include the Komodo dragon,…

A network property necessary for concentration robustness

NASA Astrophysics Data System (ADS)

Eloundou-Mbebi, Jeanne M. O.; Küken, Anika; Omranian, Nooshin; Kleessen, Sabrina; Neigenfind, Jost; Basler, Georg; Nikoloski, Zoran

2016-10-01

Maintenance of functionality of complex cellular networks and entire organisms exposed to environmental perturbations often depends on concentration robustness of the underlying components. Yet, the reasons and consequences of concentration robustness in large-scale cellular networks remain largely unknown. Here, we derive a necessary condition for concentration robustness based only on the structure of networks endowed with mass action kinetics. The structural condition can be used to design targeted experiments to study concentration robustness. We show that metabolites satisfying the necessary condition are present in metabolic networks from diverse species, suggesting prevalence of this property across kingdoms of life. We also demonstrate that our predictions about concentration robustness of energy-related metabolites are in line with experimental evidence from Escherichia coli. The necessary condition is applicable to mass action biological systems of arbitrary size, and will enable understanding the implications of concentration robustness in genetic engineering strategies and medical applications.

A network property necessary for concentration robustness.

PubMed

Eloundou-Mbebi, Jeanne M O; Küken, Anika; Omranian, Nooshin; Kleessen, Sabrina; Neigenfind, Jost; Basler, Georg; Nikoloski, Zoran

2016-10-19

Maintenance of functionality of complex cellular networks and entire organisms exposed to environmental perturbations often depends on concentration robustness of the underlying components. Yet, the reasons and consequences of concentration robustness in large-scale cellular networks remain largely unknown. Here, we derive a necessary condition for concentration robustness based only on the structure of networks endowed with mass action kinetics. The structural condition can be used to design targeted experiments to study concentration robustness. We show that metabolites satisfying the necessary condition are present in metabolic networks from diverse species, suggesting prevalence of this property across kingdoms of life. We also demonstrate that our predictions about concentration robustness of energy-related metabolites are in line with experimental evidence from Escherichia coli. The necessary condition is applicable to mass action biological systems of arbitrary size, and will enable understanding the implications of concentration robustness in genetic engineering strategies and medical applications.

A network property necessary for concentration robustness

PubMed Central

Eloundou-Mbebi, Jeanne M. O.; Küken, Anika; Omranian, Nooshin; Kleessen, Sabrina; Neigenfind, Jost; Basler, Georg; Nikoloski, Zoran

2016-01-01

Maintenance of functionality of complex cellular networks and entire organisms exposed to environmental perturbations often depends on concentration robustness of the underlying components. Yet, the reasons and consequences of concentration robustness in large-scale cellular networks remain largely unknown. Here, we derive a necessary condition for concentration robustness based only on the structure of networks endowed with mass action kinetics. The structural condition can be used to design targeted experiments to study concentration robustness. We show that metabolites satisfying the necessary condition are present in metabolic networks from diverse species, suggesting prevalence of this property across kingdoms of life. We also demonstrate that our predictions about concentration robustness of energy-related metabolites are in line with experimental evidence from Escherichia coli. The necessary condition is applicable to mass action biological systems of arbitrary size, and will enable understanding the implications of concentration robustness in genetic engineering strategies and medical applications. PMID:27759015

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

PubMed

Araujo, Robyn P; Liotta, Lance A

2018-05-01

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

In situ formed Si nanoparticle network with micron-sized Si particles for lithium-ion battery anodes.

PubMed

Wu, Mingyan; Sabisch, Julian E C; Song, Xiangyun; Minor, Andrew M; Battaglia, Vincent S; Liu, Gao

2013-01-01

To address the significant challenges associated with large volume change of micrometer-sized Si particles as high-capacity anode materials for lithium-ion batteries, we demonstrated a simple but effective strategy: using Si nanoparticles as a structural and conductive additive, with micrometer-sized Si as the main lithium-ion storage material. The Si nanoparticles connected into the network structure in situ during the charge process, to provide electronic connectivity and structure stability for the electrode. The resulting electrode showed a high specific capacity of 2500 mAh/g after 30 cycles with high initial Coulombic efficiency (73%) and good rate performance during electrochemical lithiation and delithiation: between 0.01 and 1 V vs Li/Li(+).

Population size effects in evolutionary dynamics on neutral networks and toy landscapes

NASA Astrophysics Data System (ADS)

Sumedha; Martin, Olivier C.; Peliti, Luca

2007-05-01

We study the dynamics of a population subject to selective pressures, evolving either on RNA neutral networks or on toy fitness landscapes. We discuss the spread and the neutrality of the population in the steady state. Different limits arise depending on whether selection or random drift is dominant. In the presence of strong drift we show that the observables depend mainly on Mμ, M being the population size and μ the mutation rate, while corrections to this scaling go as 1/M: such corrections can be quite large in the presence of selection if there are barriers in the fitness landscape. Also we find that the convergence to the large-Mμ limit is linear in 1/Mμ. Finally we introduce a protocol that minimizes drift; then observables scale like 1/M rather than 1/(Mμ), allowing one to determine the large-M limit more quickly when μ is small; furthermore the genotypic diversity increases from O(lnM) to O(M).

Optimization of Turbine Blade Design for Reusable Launch Vehicles

NASA Technical Reports Server (NTRS)

Shyy, Wei

1998-01-01

To facilitate design optimization of turbine blade shape for reusable launching vehicles, appropriate techniques need to be developed to process and estimate the characteristics of the design variables and the response of the output with respect to the variations of the design variables. The purpose of this report is to offer insight into developing appropriate techniques for supporting such design and optimization needs. Neural network and polynomial-based techniques are applied to process aerodynamic data obtained from computational simulations for flows around a two-dimensional airfoil and a generic three- dimensional wing/blade. For the two-dimensional airfoil, a two-layered radial-basis network is designed and trained. The performances of two different design functions for radial-basis networks, one based on the accuracy requirement, whereas the other one based on the limit on the network size. While the number of neurons needed to satisfactorily reproduce the information depends on the size of the data, the neural network technique is shown to be more accurate for large data set (up to 765 simulations have been used) than the polynomial-based response surface method. For the three-dimensional wing/blade case, smaller aerodynamic data sets (between 9 to 25 simulations) are considered, and both the neural network and the polynomial-based response surface techniques improve their performance as the data size increases. It is found while the relative performance of two different network types, a radial-basis network and a back-propagation network, depends on the number of input data, the number of iterations required for radial-basis network is less than that for the back-propagation network.

A scalable moment-closure approximation for large-scale biochemical reaction networks

PubMed Central

Kazeroonian, Atefeh; Theis, Fabian J.; Hasenauer, Jan

2017-01-01

Abstract Motivation: Stochastic molecular processes are a leading cause of cell-to-cell variability. Their dynamics are often described by continuous-time discrete-state Markov chains and simulated using stochastic simulation algorithms. As these stochastic simulations are computationally demanding, ordinary differential equation models for the dynamics of the statistical moments have been developed. The number of state variables of these approximating models, however, grows at least quadratically with the number of biochemical species. This limits their application to small- and medium-sized processes. Results: In this article, we present a scalable moment-closure approximation (sMA) for the simulation of statistical moments of large-scale stochastic processes. The sMA exploits the structure of the biochemical reaction network to reduce the covariance matrix. We prove that sMA yields approximating models whose number of state variables depends predominantly on local properties, i.e. the average node degree of the reaction network, instead of the overall network size. The resulting complexity reduction is assessed by studying a range of medium- and large-scale biochemical reaction networks. To evaluate the approximation accuracy and the improvement in computational efficiency, we study models for JAK2/STAT5 signalling and NFκB signalling. Our method is applicable to generic biochemical reaction networks and we provide an implementation, including an SBML interface, which renders the sMA easily accessible. Availability and implementation: The sMA is implemented in the open-source MATLAB toolbox CERENA and is available from https://github.com/CERENADevelopers/CERENA. Contact: jan.hasenauer@helmholtz-muenchen.de or atefeh.kazeroonian@tum.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28881983

Implementation of Dynamic Extensible Adaptive Locally Exchangeable Measures (IDEALEM) v 0.1

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

Sim, Alex; Lee, Dongeun; Wu, K. John

2016-03-04

Handling large streaming data is essential for various applications such as network traffic analysis, social networks, energy cost trends, and environment modeling. However, it is in general intractable to store, compute, search, and retrieve large streaming data. This software addresses a fundamental issue, which is to reduce the size of large streaming data and still obtain accurate statistical analysis. As an example, when a high-speed network such as 100 Gbps network is monitored, the collected measurement data rapidly grows so that polynomial time algorithms (e.g., Gaussian processes) become intractable. One possible solution to reduce the storage of vast amounts ofmore » measured data is to store a random sample, such as one out of 1000 network packets. However, such static sampling methods (linear sampling) have drawbacks: (1) it is not scalable for high-rate streaming data, and (2) there is no guarantee of reflecting the underlying distribution. In this software, we implemented a dynamic sampling algorithm, based on the recent technology from the relational dynamic bayesian online locally exchangeable measures, that reduces the storage of data records in a large scale, and still provides accurate analysis of large streaming data. The software can be used for both online and offline data records.« less

Dendritic nonlinearities reduce network size requirements and mediate ON and OFF states of persistent activity in a PFC microcircuit model.

PubMed

Papoutsi, Athanasia; Sidiropoulou, Kyriaki; Poirazi, Panayiota

2014-07-01

Technological advances have unraveled the existence of small clusters of co-active neurons in the neocortex. The functional implications of these microcircuits are in large part unexplored. Using a heavily constrained biophysical model of a L5 PFC microcircuit, we recently showed that these structures act as tunable modules of persistent activity, the cellular correlate of working memory. Here, we investigate the mechanisms that underlie persistent activity emergence (ON) and termination (OFF) and search for the minimum network size required for expressing these states within physiological regimes. We show that (a) NMDA-mediated dendritic spikes gate the induction of persistent firing in the microcircuit. (b) The minimum network size required for persistent activity induction is inversely proportional to the synaptic drive of each excitatory neuron. (c) Relaxation of connectivity and synaptic delay constraints eliminates the gating effect of NMDA spikes, albeit at a cost of much larger networks. (d) Persistent activity termination by increased inhibition depends on the strength of the synaptic input and is negatively modulated by dADP. (e) Slow synaptic mechanisms and network activity contain predictive information regarding the ability of a given stimulus to turn ON and/or OFF persistent firing in the microcircuit model. Overall, this study zooms out from dendrites to cell assemblies and suggests a tight interaction between dendritic non-linearities and network properties (size/connectivity) that may facilitate the short-memory function of the PFC.

Transitions in Smokers' Social Networks After Quit Attempts: A Latent Transition Analysis.

PubMed

Bray, Bethany C; Smith, Rachel A; Piper, Megan E; Roberts, Linda J; Baker, Timothy B

2016-12-01

Smokers' social networks vary in size, composition, and amount of exposure to smoking. The extent to which smokers' social networks change after a quit attempt is unknown, as is the relation between quitting success and later network changes. Unique types of social networks for 691 smokers enrolled in a smoking-cessation trial were identified based on network size, new network members, members' smoking habits, within network smoking, smoking buddies, and romantic partners' smoking. Latent transition analysis was used to identify the network classes and to predict transitions in class membership across 3 years from biochemically assessed smoking abstinence. Five network classes were identified: Immersed (large network, extensive smoking exposure including smoking buddies), Low Smoking Exposure (large network, minimal smoking exposure), Smoking Partner (small network, smoking exposure primarily from partner), Isolated (small network, minimal smoking exposure), and Distant Smoking Exposure (small network, considerable nonpartner smoking exposure). Abstinence at years 1 and 2 was associated with shifts in participants' social networks to less contact with smokers and larger networks in years 2 and 3. In the years following a smoking-cessation attempt, smokers' social networks changed, and abstinence status predicted these changes. Networks defined by high levels of exposure to smokers were especially associated with continued smoking. Abstinence, however, predicted transitions to larger social networks comprising less smoking exposure. These results support treatments that aim to reduce exposure to smoking cues and smokers, including partners who smoke. Prior research has shown that social network features predict the likelihood of subsequent smoking cessation. The current research illustrates how successful quitting predicts social network change over 3 years following a quit attempt. Specifically, abstinence predicts transitions to networks that are larger and afford less exposure to smokers. This suggests that quitting smoking may expand a person's social milieu rather than narrow it. This effect, plus reduced exposure to smokers, may help sustain abstinence. © The Author 2016. Published by Oxford University Press on behalf of the Society for Research on Nicotine and Tobacco. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Megatux

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

2012-09-25

The Megatux platform enables the emulation of large scale (multi-million node) distributed systems. In particular, it allows for the emulation of large-scale networks interconnecting a very large number of emulated computer systems. It does this by leveraging virtualization and associated technologies to allow hundreds of virtual computers to be hosted on a single moderately sized server or workstation. Virtualization technology provided by modern processors allows for multiple guest OSs to run at the same time, sharing the hardware resources. The Megatux platform can be deployed on a single PC, a small cluster of a few boxes or a large clustermore » of computers. With a modest cluster, the Megatux platform can emulate complex organizational networks. By using virtualization, we emulate the hardware, but run actual software enabling large scale without sacrificing fidelity.« less

Classification of urine sediment based on convolution neural network

NASA Astrophysics Data System (ADS)

Pan, Jingjing; Jiang, Cunbo; Zhu, Tiantian

2018-04-01

By designing a new convolution neural network framework, this paper breaks the constraints of the original convolution neural network framework requiring large training samples and samples of the same size. Move and cropping the input images, generate the same size of the sub-graph. And then, the generated sub-graph uses the method of dropout, increasing the diversity of samples and preventing the fitting generation. Randomly select some proper subset in the sub-graphic set and ensure that the number of elements in the proper subset is same and the proper subset is not the same. The proper subsets are used as input layers for the convolution neural network. Through the convolution layer, the pooling, the full connection layer and output layer, we can obtained the classification loss rate of test set and training set. In the red blood cells, white blood cells, calcium oxalate crystallization classification experiment, the classification accuracy rate of 97% or more.

Design and maintenance of a network for collecting high-resolution suspended-sediment data at remote locations on rivers, with examples from the Colorado River

USGS Publications Warehouse

Griffiths, Ronald E.; Topping, David J.; Andrews, Timothy; Bennett, Glenn E.; Sabol, Thomas A.; Melis, Theodore S.

2012-01-01

Management of sand and finer sediment in fluvial settings has become increasingly important for reasons ranging from endangered-species habitat to transport of sediment-associated contaminants. In all rivers, some fraction of the suspended load is transported as washload, and some as suspended bed material. Typically, the washload is composed of silt-and-clay-size sediment, and the suspended bed material is composed of sand-size sediment. In most rivers, as a result of changes in the upstream supply of silt and clay, large, systematic changes in the concentration of the washload occur over time, independent of changes in water discharge. Recent work has shown that large, systematic, discharge-independent changes in the concentration of the suspended bed material are also present in many rivers. In bedrock canyon rivers, such as the Colorado River in Grand Canyon National Park, changes in the upstream tributary supply of sand may cause large changes in the grain-size distribution of the bed sand, resulting in changes in both the concentration and grain-size distribution of the sand in suspension. Large discharge-independent changes in suspended-sand concentration coupled to discharge-independent changes in the grain-size distribution of the suspended sand are not unique to bedrock canyon rivers, but also occur in large alluvial rivers, such as the Mississippi River. These systematic changes in either suspended-silt-and-clay concentration or suspended-sand concentration may not be detectable by using conventional equal-discharge- or equal-width-increment measurements, which may be too infrequently collected relative to the time scale over which these changes in the sediment load are occurring. Furthermore, because large discharge-independent changes in both suspended-silt-and-clay and suspended-sand concentration are possible in many rivers, methods using water discharge as a proxy for suspended-sediment concentration (such as sediment rating curves) may not produce sufficiently accurate estimates of sediment loads. Finally, conventional suspended-sediment measurements are both labor and cost intensive and may not be possible at the resolution required to resolve discharge-independent changes in suspended-sediment concentration, especially in more remote locations. For these reasons, the U.S. Geological Survey has pursued the use of surrogate technologies (such as acoustic and laser diffraction) for providing higher-resolution measurements of suspended-sediment concentration and grain size than are possible by using conventional suspended-sediment measurements alone. These factors prompted the U.S. Geological Survey's Grand Canyon Monitoring and Research Center to design and construct a network to automatically measure suspended-sediment transport at 15-minute intervals by using acoustic and laser-diffraction surrogate technologies at remote locations along the Colorado River within Marble and Grand Canyons in Grand Canyon National Park. Because of the remoteness of the Colorado River in this reach, this network also included the design of a broadband satellite-telemetry system to communicate with the instruments deployed at each station in this network. Although the sediment-transport monitoring network described in this report was developed for the Colorado River in Grand Canyon National Park, the design of this network can easily be adapted for use on other rivers, no matter how remote. In the Colorado River case-study example described in this report, suspended-sediment concentration and grain size are measured at five remote stations. At each of these stations, surrogate measurements of suspended-sediment concentration and grain size are made at 15-minute intervals using an array of different single-frequency acoustic-Doppler side-looking profilers. Laser-diffraction instruments are also used at two of these stations to measure both suspended-sediment concentrations and grain-size distributions. Cross-section calibrations of these instruments have been constructed and verified by using either equal-discharge-increment (EDI) or equal-width-increment (EWI) measurements of the velocity-weighted suspended-sediment concentration and grain-size distribution. The suspended-silt-and-clay concentration parts of these calibration relations have also included information from EDI- or EWI-calibrated samples collected by automatic pump samplers. Three of the monitoring stations are equipped with two-way satellite broadband telemetry systems that operate once a day to remotely monitor and program the instruments and download data. Data from these stations are typically downloaded twice per month; data from stations without satellite-telemetry systems are downloaded during site visits, which occur every 2 months or semiannually, depending on the remoteness of the site. Upon downloading and processing, suspended-silt-and-clay concentration, suspended-sand concentration, and suspended-sand median grain size are posted on the World Wide Web. Satellite telemetry in combination with the high-resolution sediment surrogate measurements can generate near-real-time suspended-sediment-concentration and grain-size data (limited only by the time required to download the instruments and process the data). The approach for measuring suspended-sediment concentration and grain size using this monitoring network is more practical, and can be done at a much lower cost and with higher temporal resolution, than any other method.

The Buildup of a Scale-free Photospheric Magnetic Network

NASA Astrophysics Data System (ADS)

Thibault, K.; Charbonneau, P.; Crouch, A. D.

2012-10-01

We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

The scaling of human interactions with city size

PubMed Central

Schläpfer, Markus; Bettencourt, Luís M. A.; Grauwin, Sébastian; Raschke, Mathias; Claxton, Rob; Smoreda, Zbigniew; West, Geoffrey B.; Ratti, Carlo

2014-01-01

The size of cities is known to play a fundamental role in social and economic life. Yet, its relation to the structure of the underlying network of human interactions has not been investigated empirically in detail. In this paper, we map society-wide communication networks to the urban areas of two European countries. We show that both the total number of contacts and the total communication activity grow superlinearly with city population size, according to well-defined scaling relations and resulting from a multiplicative increase that affects most citizens. Perhaps surprisingly, however, the probability that an individual's contacts are also connected with each other remains largely unaffected. These empirical results predict a systematic and scale-invariant acceleration of interaction-based spreading phenomena as cities get bigger, which is numerically confirmed by applying epidemiological models to the studied networks. Our findings should provide a microscopic basis towards understanding the superlinear increase of different socioeconomic quantities with city size, that applies to almost all urban systems and includes, for instance, the creation of new inventions or the prevalence of certain contagious diseases. PMID:24990287

Nursing Unit Design, Nursing Staff Communication Networks, and Patient Falls: Are They Related?

PubMed

Brewer, Barbara B; Carley, Kathleen M; Benham-Hutchins, Marge; Effken, Judith A; Reminga, Jeffrey

2018-01-01

The purpose of this research is to (1) investigate the impact of nursing unit design on nursing staff communication patterns and, ultimately, on patient falls in acute care nursing units; and (2) evaluate whether differences in fall rates, if found, were associated with the nursing unit physical structure (shape) or size. Nursing staff communication and nursing unit design are frequently linked to patient safety outcomes, yet little is known about the impact of specific nursing unit designs on nursing communication patterns that might affect patient falls. An exploratory longitudinal correlational design was used to measure nursing unit communication structures using social network analysis techniques. Data were collected 4 times over a 7-month period. Floor plans were used to determine nursing unit design. Fall rates were provided by hospital coordinators. An analysis of covariance controlling for hospitals resulted in a statistically significant interaction of unit shape and size (number of beds). The interaction occurred when medium- and large-sized racetrack-shaped units intersected with medium- and large-sized cross-shaped units. The results suggest that nursing unit design shape impacts nursing communication patterns, and the interaction of shape and size may impact patient falls. How those communication patterns affect patient falls should be considered when planning hospital construction of nursing care units.

Optimal Sizing and Placement of Battery Energy Storage in Distribution System Based on Solar Size for Voltage Regulation

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

Nazaripouya, Hamidreza; Wang, Yubo; Chu, Peter

2016-07-26

This paper proposes a new strategy to achieve voltage regulation in distributed power systems in the presence of solar energy sources and battery storage systems. The goal is to find the minimum size of battery storage and its corresponding location in the network based on the size and place of the integrated solar generation. The proposed method formulates the problem by employing the network impedance matrix to obtain an analytical solution instead of using a recursive algorithm such as power flow. The required modifications for modeling the slack and PV buses (generator buses) are utilized to increase the accuracy ofmore » the approach. The use of reactive power control to regulate the voltage regulation is not always an optimal solution as in distribution systems R/X is large. In this paper the minimum size and the best place of battery storage is achieved by optimizing the amount of both active and reactive power exchanged by battery storage and its gridtie inverter (GTI) based on the network topology and R/X ratios in the distribution system. Simulation results for the IEEE 14-bus system verify the effectiveness of the proposed approach.« less

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Influence maximization in complex networks through optimal percolation

NASA Astrophysics Data System (ADS)

Morone, Flaviano; Makse, Hernan; CUNY Collaboration; CUNY Collaboration

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. Reference: F. Morone, H. A. Makse, Nature 524,65-68 (2015)

Spacecraft Will Communicate "on the Fly"

NASA Technical Reports Server (NTRS)

Laufenberg, Lawrence

2003-01-01

As NASA probes deeper into space, the distance between sensor and scientist increases, as does the time delay. NASA needs to close that gap, while integrating more spacecraft types and missions-from near-Earth orbit to deep space. To speed and integrate communications from space missions to scientists on Earth and back again. NASA needs a comprehensive, high-performance communications network. To this end, the CICT Programs Space Communications (SC) Project is providing technologies for building the Space Internet which will consist of large backbone network, mid-size access networks linked to the backbones, and smaller, ad-hoc network linked to the access network. A key component will be mobile, wireless networks for spacecraft flying in different configurations.

Vulnerability and cosusceptibility determine the size of network cascades

DOE PAGES

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

2017-01-27

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

Self-avoiding walks on scale-free networks

NASA Astrophysics Data System (ADS)

Herrero, Carlos P.

2005-01-01

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAW’s) are expected to be more suitable than unrestricted random walks to explore various kinds of real-life networks. Here we study long-range properties of random SAW’s on scale-free networks, characterized by a degree distribution P (k) ˜ k-γ . In the limit of large networks (system size N→∞ ), the average number sn of SAW’s starting from a generic site increases as μn , with μ= < k2 > / -1 . For finite N , sn is reduced due to the presence of loops in the network, which causes the emergence of attrition of the paths. For kinetic growth walks, the average maximum length increases as a power of the system size: ˜ Nα , with an exponent α increasing as the parameter γ is raised. We discuss the dependence of α on the minimum allowed degree in the network. A similar power-law dependence is found for the mean self-intersection length of nonreversal random walks. Simulation results support our approximate analytical calculations.

Maximal Neighbor Similarity Reveals Real Communities in Networks

PubMed Central

Žalik, Krista Rizman

2015-01-01

An important problem in the analysis of network data is the detection of groups of densely interconnected nodes also called modules or communities. Community structure reveals functions and organizations of networks. Currently used algorithms for community detection in large-scale real-world networks are computationally expensive or require a priori information such as the number or sizes of communities or are not able to give the same resulting partition in multiple runs. In this paper we investigate a simple and fast algorithm that uses the network structure alone and requires neither optimization of pre-defined objective function nor information about number of communities. We propose a bottom up community detection algorithm in which starting from communities consisting of adjacent pairs of nodes and their maximal similar neighbors we find real communities. We show that the overall advantage of the proposed algorithm compared to the other community detection algorithms is its simple nature, low computational cost and its very high accuracy in detection communities of different sizes also in networks with blurred modularity structure consisting of poorly separated communities. All communities identified by the proposed method for facebook network and E-Coli transcriptional regulatory network have strong structural and functional coherence. PMID:26680448

Role of Edges in Complex Network Epidemiology

NASA Astrophysics Data System (ADS)

Zhang, Hao; Jiang, Zhi-Hong; Wang, Hui; Xie, Fei; Chen, Chao

2012-09-01

In complex network epidemiology, diseases spread along contacting edges between individuals and different edges may play different roles in epidemic outbreaks. Quantifying the efficiency of edges is an important step towards arresting epidemics. In this paper, we study the efficiency of edges in general susceptible-infected-recovered models, and introduce the transmission capability to measure the efficiency of edges. Results show that deleting edges with the highest transmission capability will greatly decrease epidemics on scale-free networks. Basing on the message passing approach, we get exact mathematical solution on configuration model networks with edge deletion in the large size limit.

Large Phased Array Radar Using Networked Small Parabolic Reflectors

NASA Technical Reports Server (NTRS)

Amoozegar, Farid

2006-01-01

Multifunction phased array systems with radar, telecom, and imaging applications have already been established for flat plate phased arrays of dipoles, or waveguides. In this paper the design trades and candidate options for combining the radar and telecom functions of the Deep Space Network (DSN) into a single large transmit array of small parabolic reflectors will be discussed. In particular the effect of combing the radar and telecom functions on the sizes of individual antenna apertures and the corresponding spacing between the antenna elements of the array will be analyzed. A heterogeneous architecture for the DSN large transmit array is proposed to meet the radar and telecom requirements while considering the budget, scheduling, and strategic planning constrains.

Survey on large scale system control methods

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1987-01-01

The problem inherent to large scale systems such as power network, communication network and economic or ecological systems were studied. The increase in size and flexibility of future spacecraft has put those dynamical systems into the category of large scale systems, and tools specific to the class of large systems are being sought to design control systems that can guarantee more stability and better performance. Among several survey papers, reference was found to a thorough investigation on decentralized control methods. Especially helpful was the classification made of the different existing approaches to deal with large scale systems. A very similar classification is used, even though the papers surveyed are somehow different from the ones reviewed in other papers. Special attention is brought to the applicability of the existing methods to controlling large mechanical systems like large space structures. Some recent developments are added to this survey.

Fair and efficient network congestion control based on minority game

NASA Astrophysics Data System (ADS)

Wang, Zuxi; Wang, Wen; Hu, Hanping; Deng, Zhaozhang

2011-12-01

Low link utility, RTT unfairness and unfairness of Multi-Bottleneck network are the existing problems in the present network congestion control algorithms at large. Through the analogy of network congestion control with the "El Farol Bar" problem, we establish a congestion control model based on minority game(MG), and then present a novel network congestion control algorithm based on the model. The result of simulations indicates that the proposed algorithm can make the achievements of link utility closing to 100%, zero packet lose rate, and small of queue size. Besides, the RTT unfairness and the unfairness of Multi-Bottleneck network can be solved, to achieve the max-min fairness in Multi-Bottleneck network, while efficiently weaken the "ping-pong" oscillation caused by the overall synchronization.

Inferring species roles in metacommunity structure from species co-occurrence networks

PubMed Central

Borthagaray, Ana I.; Arim, Matías; Marquet, Pablo A.

2014-01-01

A long-standing question in community ecology is what determines the identity of species that coexist across local communities or metacommunity assembly. To shed light upon this question, we used a network approach to analyse the drivers of species co-occurrence patterns. In particular, we focus on the potential roles of body size and trophic status as determinants of metacommunity cohesion because of their link to resource use and dispersal ability. Small-sized individuals at low-trophic levels, and with limited dispersal potential, are expected to form highly linked subgroups, whereas large-size individuals at higher trophic positions, and with good dispersal potential, will foster the spatial coupling of subgroups and the cohesion of the whole metacommunity. By using modularity analysis, we identified six modules of species with similar responses to ecological conditions and high co-occurrence across local communities. Most species either co-occur with species from a single module or are connectors of the whole network. Among the latter are carnivorous species of intermediate body size, which by virtue of their high incidence provide connectivity to otherwise isolated communities playing the role of spatial couplers. Our study also demonstrates that the incorporation of network tools to the analysis of metacommunity ecology can help unveil the mechanisms underlying patterns and processes in metacommunity assembly. PMID:25143039

Financial fluctuations anchored to economic fundamentals: A mesoscopic network approach.

PubMed

Sharma, Kiran; Gopalakrishnan, Balagopal; Chakrabarti, Anindya S; Chakraborti, Anirban

2017-08-14

We demonstrate the existence of an empirical linkage between nominal financial networks and the underlying economic fundamentals, across countries. We construct the nominal return correlation networks from daily data to encapsulate sector-level dynamics and infer the relative importance of the sectors in the nominal network through measures of centrality and clustering algorithms. Eigenvector centrality robustly identifies the backbone of the minimum spanning tree defined on the return networks as well as the primary cluster in the multidimensional scaling map. We show that the sectors that are relatively large in size, defined with three metrics, viz., market capitalization, revenue and number of employees, constitute the core of the return networks, whereas the periphery is mostly populated by relatively smaller sectors. Therefore, sector-level nominal return dynamics are anchored to the real size effect, which ultimately shapes the optimal portfolios for risk management. Our results are reasonably robust across 27 countries of varying degrees of prosperity and across periods of market turbulence (2008-09) as well as periods of relative calmness (2012-13 and 2015-16).

HiDi: an efficient reverse engineering schema for large-scale dynamic regulatory network reconstruction using adaptive differentiation.

PubMed

Deng, Yue; Zenil, Hector; Tegnér, Jesper; Kiani, Narsis A

2017-12-15

The use of differential equations (ODE) is one of the most promising approaches to network inference. The success of ODE-based approaches has, however, been limited, due to the difficulty in estimating parameters and by their lack of scalability. Here, we introduce a novel method and pipeline to reverse engineer gene regulatory networks from gene expression of time series and perturbation data based upon an improvement on the calculation scheme of the derivatives and a pre-filtration step to reduce the number of possible links. The method introduces a linear differential equation model with adaptive numerical differentiation that is scalable to extremely large regulatory networks. We demonstrate the ability of this method to outperform current state-of-the-art methods applied to experimental and synthetic data using test data from the DREAM4 and DREAM5 challenges. Our method displays greater accuracy and scalability. We benchmark the performance of the pipeline with respect to dataset size and levels of noise. We show that the computation time is linear over various network sizes. The Matlab code of the HiDi implementation is available at: www.complexitycalculator.com/HiDiScript.zip. hzenilc@gmail.com or narsis.kiani@ki.se. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Space and energy. [space systems for energy generation, distribution and control

NASA Technical Reports Server (NTRS)

Bekey, I.

1976-01-01

Potential contributions of space to energy-related activities are discussed. Advanced concepts presented include worldwide energy distribution to substation-sized users using low-altitude space reflectors; powering large numbers of large aircraft worldwide using laser beams reflected from space mirror complexes; providing night illumination via sunlight-reflecting space mirrors; fine-scale power programming and monitoring in transmission networks by monitoring millions of network points from space; prevention of undetected hijacking of nuclear reactor fuels by space tracking of signals from tagging transmitters on all such materials; and disposal of nuclear power plant radioactive wastes in space.

Size-dependent survival of brook trout Salvelinus fontinalis in summer: effects of water temperature and stream flow.

PubMed

Xu, C L; Letcher, B H; Nislow, K H

2010-06-01

A 5 year individual-based data set was used to estimate size-specific survival rates in a wild brook trout Salvelinus fontinalis population in a stream network encompassing a mainstem and three tributaries (1.5-6 m wetted width), western Massachusetts, U.S.A. The relationships between survival in summer and temperature and flow metrics derived from continuous monitoring data were then tested. Increased summer temperatures significantly reduced summer survival rates for S. fontinalis in almost all size classes in all four sites throughout the network. In contrast, extreme low summer flows reduced survival of large fish, but only in small tributaries, and had no significant effects on fish in smaller size classes in any location. These results provide direct evidence of a link between season-specific survival and environmental factors likely to be affected by climate change and have important consequences for the management of both habitats and populations.

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

NASA Astrophysics Data System (ADS)

Pasten, D.

2017-12-01

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

Comparative Study of Neural Network Frameworks for the Next Generation of Adaptive Optics Systems.

PubMed

González-Gutiérrez, Carlos; Santos, Jesús Daniel; Martínez-Zarzuela, Mario; Basden, Alistair G; Osborn, James; Díaz-Pernas, Francisco Javier; De Cos Juez, Francisco Javier

2017-06-02

Many of the next generation of adaptive optics systems on large and extremely large telescopes require tomographic techniques in order to correct for atmospheric turbulence over a large field of view. Multi-object adaptive optics is one such technique. In this paper, different implementations of a tomographic reconstructor based on a machine learning architecture named "CARMEN" are presented. Basic concepts of adaptive optics are introduced first, with a short explanation of three different control systems used on real telescopes and the sensors utilised. The operation of the reconstructor, along with the three neural network frameworks used, and the developed CUDA code are detailed. Changes to the size of the reconstructor influence the training and execution time of the neural network. The native CUDA code turns out to be the best choice for all the systems, although some of the other frameworks offer good performance under certain circumstances.

Comparative Study of Neural Network Frameworks for the Next Generation of Adaptive Optics Systems

PubMed Central

González-Gutiérrez, Carlos; Santos, Jesús Daniel; Martínez-Zarzuela, Mario; Basden, Alistair G.; Osborn, James; Díaz-Pernas, Francisco Javier; De Cos Juez, Francisco Javier

2017-01-01

Many of the next generation of adaptive optics systems on large and extremely large telescopes require tomographic techniques in order to correct for atmospheric turbulence over a large field of view. Multi-object adaptive optics is one such technique. In this paper, different implementations of a tomographic reconstructor based on a machine learning architecture named “CARMEN” are presented. Basic concepts of adaptive optics are introduced first, with a short explanation of three different control systems used on real telescopes and the sensors utilised. The operation of the reconstructor, along with the three neural network frameworks used, and the developed CUDA code are detailed. Changes to the size of the reconstructor influence the training and execution time of the neural network. The native CUDA code turns out to be the best choice for all the systems, although some of the other frameworks offer good performance under certain circumstances. PMID:28574426

Fast detection of the fuzzy communities based on leader-driven algorithm

NASA Astrophysics Data System (ADS)

Fang, Changjian; Mu, Dejun; Deng, Zhenghong; Hu, Jun; Yi, Chen-He

2018-03-01

In this paper, we present the leader-driven algorithm (LDA) for learning community structure in networks. The algorithm allows one to find overlapping clusters in a network, an important aspect of real networks, especially social networks. The algorithm requires no input parameters and learns the number of clusters naturally from the network. It accomplishes this using leadership centrality in a clever manner. It identifies local minima of leadership centrality as followers which belong only to one cluster, and the remaining nodes are leaders which connect clusters. In this way, the number of clusters can be learned using only the network structure. The LDA is also an extremely fast algorithm, having runtime linear in the network size. Thus, this algorithm can be used to efficiently cluster extremely large networks.

Genotet: An Interactive Web-based Visual Exploration Framework to Support Validation of Gene Regulatory Networks.

PubMed

Yu, Bowen; Doraiswamy, Harish; Chen, Xi; Miraldi, Emily; Arrieta-Ortiz, Mario Luis; Hafemeister, Christoph; Madar, Aviv; Bonneau, Richard; Silva, Cláudio T

2014-12-01

Elucidation of transcriptional regulatory networks (TRNs) is a fundamental goal in biology, and one of the most important components of TRNs are transcription factors (TFs), proteins that specifically bind to gene promoter and enhancer regions to alter target gene expression patterns. Advances in genomic technologies as well as advances in computational biology have led to multiple large regulatory network models (directed networks) each with a large corpus of supporting data and gene-annotation. There are multiple possible biological motivations for exploring large regulatory network models, including: validating TF-target gene relationships, figuring out co-regulation patterns, and exploring the coordination of cell processes in response to changes in cell state or environment. Here we focus on queries aimed at validating regulatory network models, and on coordinating visualization of primary data and directed weighted gene regulatory networks. The large size of both the network models and the primary data can make such coordinated queries cumbersome with existing tools and, in particular, inhibits the sharing of results between collaborators. In this work, we develop and demonstrate a web-based framework for coordinating visualization and exploration of expression data (RNA-seq, microarray), network models and gene-binding data (ChIP-seq). Using specialized data structures and multiple coordinated views, we design an efficient querying model to support interactive analysis of the data. Finally, we show the effectiveness of our framework through case studies for the mouse immune system (a dataset focused on a subset of key cellular functions) and a model bacteria (a small genome with high data-completeness).

Time-Series Forecast Modeling on High-Bandwidth Network Measurements

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

Yoo, Wucherl; Sim, Alex

With the increasing number of geographically distributed scientific collaborations and the growing sizes of scientific data, it has become challenging for users to achieve the best possible network performance on a shared network. In this paper, we have developed a model to forecast expected bandwidth utilization on high-bandwidth wide area networks. The forecast model can improve the efficiency of the resource utilization and scheduling of data movements on high-bandwidth networks to accommodate ever increasing data volume for large-scale scientific data applications. A univariate time-series forecast model is developed with the Seasonal decomposition of Time series by Loess (STL) and themore » AutoRegressive Integrated Moving Average (ARIMA) on Simple Network Management Protocol (SNMP) path utilization measurement data. Compared with the traditional approach such as Box-Jenkins methodology to train the ARIMA model, our forecast model reduces computation time up to 92.6 %. It also shows resilience against abrupt network usage changes. Finally, our forecast model conducts the large number of multi-step forecast, and the forecast errors are within the mean absolute deviation (MAD) of the monitored measurements.« less

Time-Series Forecast Modeling on High-Bandwidth Network Measurements

DOE PAGES

Yoo, Wucherl; Sim, Alex

2016-06-24

With the increasing number of geographically distributed scientific collaborations and the growing sizes of scientific data, it has become challenging for users to achieve the best possible network performance on a shared network. In this paper, we have developed a model to forecast expected bandwidth utilization on high-bandwidth wide area networks. The forecast model can improve the efficiency of the resource utilization and scheduling of data movements on high-bandwidth networks to accommodate ever increasing data volume for large-scale scientific data applications. A univariate time-series forecast model is developed with the Seasonal decomposition of Time series by Loess (STL) and themore » AutoRegressive Integrated Moving Average (ARIMA) on Simple Network Management Protocol (SNMP) path utilization measurement data. Compared with the traditional approach such as Box-Jenkins methodology to train the ARIMA model, our forecast model reduces computation time up to 92.6 %. It also shows resilience against abrupt network usage changes. Finally, our forecast model conducts the large number of multi-step forecast, and the forecast errors are within the mean absolute deviation (MAD) of the monitored measurements.« less

Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

2013-03-01

With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

Scaling and percolation in the small-world network model

NASA Astrophysics Data System (ADS)

Newman, M. E. J.; Watts, D. J.

1999-12-01

In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one nontrivial length-scale in the model, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit. This length-scale governs the crossover from large- to small-world behavior in the model, as well as the number of vertices in a neighborhood of given radius on the network. We derive the value of the single critical exponent controlling behavior in the critical region and the finite size scaling form for the average vertex-vertex distance on the network, and, using series expansion and Padé approximants, find an approximate analytic form for the scaling function. We calculate the effective dimension of small-world graphs and show that this dimension varies as a function of the length-scale on which it is measured, in a manner reminiscent of multifractals. We also study the problem of site percolation on small-world networks as a simple model of disease propagation, and derive an approximate expression for the percolation probability at which a giant component of connected vertices first forms (in epidemiological terms, the point at which an epidemic occurs). The typical cluster radius satisfies the expected finite size scaling form with a cluster size exponent close to that for a random graph. All our analytic results are confirmed by extensive numerical simulations of the model.

Reconstructing gene regulatory networks from knock-out data using Gaussian Noise Model and Pearson Correlation Coefficient.

PubMed

Mohamed Salleh, Faridah Hani; Arif, Shereena Mohd; Zainudin, Suhaila; Firdaus-Raih, Mohd

2015-12-01

A gene regulatory network (GRN) is a large and complex network consisting of interacting elements that, over time, affect each other's state. The dynamics of complex gene regulatory processes are difficult to understand using intuitive approaches alone. To overcome this problem, we propose an algorithm for inferring the regulatory interactions from knock-out data using a Gaussian model combines with Pearson Correlation Coefficient (PCC). There are several problems relating to GRN construction that have been outlined in this paper. We demonstrated the ability of our proposed method to (1) predict the presence of regulatory interactions between genes, (2) their directionality and (3) their states (activation or suppression). The algorithm was applied to network sizes of 10 and 50 genes from DREAM3 datasets and network sizes of 10 from DREAM4 datasets. The predicted networks were evaluated based on AUROC and AUPR. We discovered that high false positive values were generated by our GRN prediction methods because the indirect regulations have been wrongly predicted as true relationships. We achieved satisfactory results as the majority of sub-networks achieved AUROC values above 0.5. Copyright © 2015 Elsevier Ltd. All rights reserved.

Inverse modelling of fluvial sediment connectivity identifies characteristics and spatial distribution of sediment sources in a large river network.

NASA Astrophysics Data System (ADS)

Schmitt, R. J. P.; Bizzi, S.; Kondolf, G. M.; Rubin, Z.; Castelletti, A.

2016-12-01

Field and laboratory evidence indicates that the spatial distribution of transport in both alluvial and bedrock rivers is an adaptation to sediment supply. Sediment supply, in turn, depends on spatial distribution and properties (e.g., grain sizes and supply rates) of individual sediment sources. Analyzing the distribution of transport capacity in a river network could hence clarify the spatial distribution and properties of sediment sources. Yet, challenges include a) identifying magnitude and spatial distribution of transport capacity for each of multiple grain sizes being simultaneously transported, and b) estimating source grain sizes and supply rates, both at network scales. Herein, we approach the problem of identifying the spatial distribution of sediment sources and the resulting network sediment fluxes in a major, poorly monitored tributary (80,000 km2) of the Mekong. Therefore, we apply the CASCADE modeling framework (Schmitt et al. (2016)). CASCADE calculates transport capacities and sediment fluxes for multiple grainsizes on the network scale based on remotely-sensed morphology and modelled hydrology. CASCADE is run in an inverse Monte Carlo approach for 7500 random initializations of source grain sizes. In all runs, supply of each source is inferred from the minimum downstream transport capacity for the source grain size. Results for each realization are compared to sparse available sedimentary records. Only 1 % of initializations reproduced the sedimentary record. Results for these realizations revealed a spatial pattern in source supply rates, grain sizes, and network sediment fluxes that correlated well with map-derived patterns in lithology and river-morphology. Hence, we propose that observable river hydro-morphology contains information on upstream source properties that can be back-calculated using an inverse modeling approach. Such an approach could be coupled to more detailed models of hillslope processes in future to derive integrated models of hillslope production and fluvial transport processes, which is particularly useful to identify sediment provenance in poorly monitored river basins.

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

NASA Astrophysics Data System (ADS)

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.

The slow-scale linear noise approximation: an accurate, reduced stochastic description of biochemical networks under timescale separation conditions

PubMed Central

2012-01-01

Background It is well known that the deterministic dynamics of biochemical reaction networks can be more easily studied if timescale separation conditions are invoked (the quasi-steady-state assumption). In this case the deterministic dynamics of a large network of elementary reactions are well described by the dynamics of a smaller network of effective reactions. Each of the latter represents a group of elementary reactions in the large network and has associated with it an effective macroscopic rate law. A popular method to achieve model reduction in the presence of intrinsic noise consists of using the effective macroscopic rate laws to heuristically deduce effective probabilities for the effective reactions which then enables simulation via the stochastic simulation algorithm (SSA). The validity of this heuristic SSA method is a priori doubtful because the reaction probabilities for the SSA have only been rigorously derived from microscopic physics arguments for elementary reactions. Results We here obtain, by rigorous means and in closed-form, a reduced linear Langevin equation description of the stochastic dynamics of monostable biochemical networks in conditions characterized by small intrinsic noise and timescale separation. The slow-scale linear noise approximation (ssLNA), as the new method is called, is used to calculate the intrinsic noise statistics of enzyme and gene networks. The results agree very well with SSA simulations of the non-reduced network of elementary reactions. In contrast the conventional heuristic SSA is shown to overestimate the size of noise for Michaelis-Menten kinetics, considerably under-estimate the size of noise for Hill-type kinetics and in some cases even miss the prediction of noise-induced oscillations. Conclusions A new general method, the ssLNA, is derived and shown to correctly describe the statistics of intrinsic noise about the macroscopic concentrations under timescale separation conditions. The ssLNA provides a simple and accurate means of performing stochastic model reduction and hence it is expected to be of widespread utility in studying the dynamics of large noisy reaction networks, as is common in computational and systems biology. PMID:22583770

Extreme events and event size fluctuations in biased random walks on networks.

PubMed

Kishore, Vimal; Santhanam, M S; Amritkar, R E

2012-05-01

Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the context of complex networks. This was motivated by the occurrence of rare events such as traffic jams, floods, and power blackouts which take place on networks. In this work, we study extreme events in a generalized random walk model in which the walk is preferentially biased by the network topology. The walkers preferentially choose to hop toward the hubs or small degree nodes. In this setting, we show that extremely large fluctuations in event sizes are possible on small degree nodes when the walkers are biased toward the hubs. In particular, we obtain the distribution of event sizes on the network. Further, the probability for the occurrence of extreme events on any node in the network depends on its "generalized strength," a measure of the ability of a node to attract walkers. The generalized strength is a function of the degree of the node and that of its nearest neighbors. We obtain analytical and simulation results for the probability of occurrence of extreme events on the nodes of a network using a generalized random walk model. The result reveals that the nodes with a larger value of generalized strength, on average, display lower probability for the occurrence of extreme events compared to the nodes with lower values of generalized strength.

Transition from isotropic to digitated growth modulates network formation in Physarum polycephalum

NASA Astrophysics Data System (ADS)

Vogel, David; Gautrais, Jacques; Perna, Andrea; Sumpter, David J. T.; Deneubourg, Jean-Louis; Dussutour, Audrey

2017-01-01

Some organisms, including fungi, ants, and slime molds, explore their environment and forage by forming interconnected networks. The plasmodium of the slime mold Physarum polycephalum is a large unicellular amoeboid organism that grows a tubular spatial network through which nutrients, body mass, and chemical signals are transported. Individual plasmodia are capable of sophisticated behaviours such as optimizing their network connectivity and dynamics using only decentralized information processing. In this study, we used a population of plasmodia that interconnect through time to analyse the dynamical interactions between growth of individual plasmodia and global network formation. Our results showed how initial conditions, such as the distance between plasmodia, their size, or the presence and quality of food, affect the emerging network connectivity.

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

DOE PAGES

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-01

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polishmore » grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.« less

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Solutions and Applications (PART II)

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

Frolov, Vladimir; Backhaus, Scott N.; Chertkov, Michael

2014-01-14

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~2700 nodes and ~3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid ismore » used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements« less

Uncertainty Reduction for Stochastic Processes on Complex Networks

NASA Astrophysics Data System (ADS)

Radicchi, Filippo; Castellano, Claudio

2018-05-01

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

Sex-specific effects of social networks on the prevalence, awareness, and control of hypertension among older Korean adults.

PubMed

Baek, Jiwon; Hur, Nam Wook; Kim, Hyeon Chang; Youm, Yoosik

2016-07-01

Hypertension is a common chronic disease among older adults, and is associated with medical complications and mortality. This study aimed to examine the effects of social network characteristics on the prevalence, awareness, and control of hypertension among older adults. The Korean Social Life, Health, and Aging Project (KSHAP) interviewed 814 ≥ 60-year-old residents and their spouses from a rural township between December 2011 and March 2012 (response rate: 95%). We evaluated the data from 595 participants. Multivariate logistic regression models were used to assess the effects of network characteristics on hypertension. We observed strong sex-specific network effects on the prevalence, awareness, and control of hypertension. Among older women, network density was associated with hypertension awareness [odds ratio (OR): 2.63, 95% confidence interval (CI): 1.03-5.37] and control (OR: 1.72; 95% CI: 0.94-3.13). Among older men, large networks were associated with a lower prevalence of hypertension (OR: 0.75; 95% CI: 0.58-0.96). Compared to older women, older men with coarse networks exhibited better hypertension awareness (OR: 0.37; 95% CI: 0.14-0.95) and control (OR: 0.42; 95% CI: 0.19-0.91). Network size interacted with density for hypertension control (P = 0.051), with controlled hypertension being associated with large and course networks. A large network was associated with a lower risk for hypertension, and a coarse network was associated with hypertension awareness and control among older men. Older women with dense networks were most likely to exhibit hypertension awareness and control.

Prediction-based association control scheme in dense femtocell networks.

PubMed

Sung, Nak Woon; Pham, Ngoc-Thai; Huynh, Thong; Hwang, Won-Joo; You, Ilsun; Choo, Kim-Kwang Raymond

2017-01-01

The deployment of large number of femtocell base stations allows us to extend the coverage and efficiently utilize resources in a low cost manner. However, the small cell size of femtocell networks can result in frequent handovers to the mobile user, and consequently throughput degradation. Thus, in this paper, we propose predictive association control schemes to improve the system's effective throughput. Our design focuses on reducing handover frequency without impacting on throughput. The proposed schemes determine handover decisions that contribute most to the network throughput and are proper for distributed implementations. The simulation results show significant gains compared with existing methods in terms of handover frequency and network throughput perspective.

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

NASA Astrophysics Data System (ADS)

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-01

We explore optimization methods for planning the placement, sizing and operations of flexible alternating current transmission system (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to series compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of linear programs (LP) that are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically sized networks that suffer congestion from a range of causes, including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically sized network.

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

DOE PAGES

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-24

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPowermore » Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.« less

A new estimation of equivalent matrix block sizes in fractured media with two-phase flow applications in dual porosity models

NASA Astrophysics Data System (ADS)

Jerbi, Chahir; Fourno, André; Noetinger, Benoit; Delay, Frederick

2017-05-01

Single and multiphase flows in fractured porous media at the scale of natural reservoirs are often handled by resorting to homogenized models that avoid the heavy computations associated with a complete discretization of both fractures and matrix blocks. For example, the two overlapping continua (fractures and matrix) of a dual porosity system are coupled by way of fluid flux exchanges that deeply condition flow at the large scale. This characteristic is a key to realistic flow simulations, especially for multiphase flow as capillary forces and contrasts of fluid mobility compete in the extraction of a fluid from a capacitive matrix then conveyed through the fractures. The exchange rate between fractures and matrix is conditioned by the so-called mean matrix block size which can be viewed as the size of a single matrix block neighboring a single fracture within a mesh of a dual porosity model. We propose a new evaluation of this matrix block size based on the analysis of discrete fracture networks. The fundaments rely upon establishing at the scale of a fractured block the equivalence between the actual fracture network and a Warren and Root network only made of three regularly spaced fracture families parallel to the facets of the fractured block. The resulting matrix block sizes are then compared via geometrical considerations and two-phase flow simulations to the few other available methods. It is shown that the new method is stable in the sense it provides accurate sizes irrespective of the type of fracture network investigated. The method also results in two-phase flow simulations from dual porosity models very close to that from references calculated in finely discretized networks. Finally, calculations of matrix block sizes by this new technique reveal very rapid, which opens the way to cumbersome applications such as preconditioning a dual porosity approach applied to regional fractured reservoirs.

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

PubMed

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.

The scaling of human interactions with city size.

PubMed

Schläpfer, Markus; Bettencourt, Luís M A; Grauwin, Sébastian; Raschke, Mathias; Claxton, Rob; Smoreda, Zbigniew; West, Geoffrey B; Ratti, Carlo

2014-09-06

The size of cities is known to play a fundamental role in social and economic life. Yet, its relation to the structure of the underlying network of human interactions has not been investigated empirically in detail. In this paper, we map society-wide communication networks to the urban areas of two European countries. We show that both the total number of contacts and the total communication activity grow superlinearly with city population size, according to well-defined scaling relations and resulting from a multiplicative increase that affects most citizens. Perhaps surprisingly, however, the probability that an individual's contacts are also connected with each other remains largely unaffected. These empirical results predict a systematic and scale-invariant acceleration of interaction-based spreading phenomena as cities get bigger, which is numerically confirmed by applying epidemiological models to the studied networks. Our findings should provide a microscopic basis towards understanding the superlinear increase of different socioeconomic quantities with city size, that applies to almost all urban systems and includes, for instance, the creation of new inventions or the prevalence of certain contagious diseases. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Clustering in large networks does not promote upstream reciprocity.

PubMed

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.

Clustering in Large Networks Does Not Promote Upstream Reciprocity

PubMed Central

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. PMID:21998641

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

Network optimization is being an increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. In many applications, however, there are several criteria associated with traversing each edge of a network. For example, cost and flow measures are both important in the networks. As a result, there has been recent interest in solving Bicriteria Network Optimization Problem. The Bicriteria Network Optimization Problem is known a NP-hard. The efficient set of paths may be very large, possibly exponential in size. Thus the computational effort required to solve it can increase exponentially with the problem size in the worst case. In this paper, we propose a genetic algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including maximum flow (MXF) model and minimum cost flow (MCF) model. The objective is to find the set of Pareto optimal solutions that give possible maximum flow with minimum cost. This paper also combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. Computer simulations show the several numerical experiments by using some difficult-to-solve network design problems, and show the effectiveness of the proposed method.

Scale dependence of the mechanics of active gels with increasing motor concentration.

PubMed

Sonn-Segev, Adar; Bernheim-Groswasser, Anne; Roichman, Yael

2017-10-18

Actin is a protein that plays an essential role in maintaining the mechanical integrity of cells. In response to strong external stresses, it can assemble into large bundles, but it grows into a fine branched network to induce cell motion. In some cases, the self-organization of actin fibers and networks involves the action of bipolar filaments of the molecular motor myosin. Such self-organization processes mediated by large myosin bipolar filaments have been studied extensively in vitro. Here we create active gels, composed of single actin filaments and small myosin bipolar filaments. The active steady state in these gels persists long enough to enable the characterization of their mechanical properties using one and two point microrheology. We study the effect of myosin concentration on the mechanical properties of this model system for active matter, for two different motor assembly sizes. In contrast to previous studies of networks with large motor assemblies, we find that the fluctuations of tracer particles embedded in the network decrease in amplitude as motor concentration increases. Nonetheless, we show that myosin motors stiffen the actin networks, in accordance with bulk rheology measurements of networks containing larger motor assemblies. This implies that such stiffening is of universal nature and may be relevant to a wider range of cytoskeleton-based structures.

Evolution on neutral networks accelerates the ticking rate of the molecular clock.

PubMed

Manrubia, Susanna; Cuesta, José A

2015-01-06

Large sets of genotypes give rise to the same phenotype, because phenotypic expression is highly redundant. Accordingly, a population can accept mutations without altering its phenotype, as long as the genotype mutates into another one on the same set. By linking every pair of genotypes that are mutually accessible through mutation, genotypes organize themselves into neutral networks (NNs). These networks are known to be heterogeneous and assortative, and these properties affect the evolutionary dynamics of the population. By studying the dynamics of populations on NNs with arbitrary topology, we analyse the effect of assortativity, of NN (phenotype) fitness and of network size. We find that the probability that the population leaves the network is smaller the longer the time spent on it. This progressive 'phenotypic entrapment' entails a systematic increase in the overdispersion of the process with time and an acceleration in the fixation rate of neutral mutations. We also quantify the variation of these effects with the size of the phenotype and with its fitness relative to that of neighbouring alternatives. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Evolution on neutral networks accelerates the ticking rate of the molecular clock

PubMed Central

Manrubia, Susanna; Cuesta, José A.

2015-01-01

Large sets of genotypes give rise to the same phenotype, because phenotypic expression is highly redundant. Accordingly, a population can accept mutations without altering its phenotype, as long as the genotype mutates into another one on the same set. By linking every pair of genotypes that are mutually accessible through mutation, genotypes organize themselves into neutral networks (NNs). These networks are known to be heterogeneous and assortative, and these properties affect the evolutionary dynamics of the population. By studying the dynamics of populations on NNs with arbitrary topology, we analyse the effect of assortativity, of NN (phenotype) fitness and of network size. We find that the probability that the population leaves the network is smaller the longer the time spent on it. This progressive ‘phenotypic entrapment’ entails a systematic increase in the overdispersion of the process with time and an acceleration in the fixation rate of neutral mutations. We also quantify the variation of these effects with the size of the phenotype and with its fitness relative to that of neighbouring alternatives. PMID:25392402

Mapping U.S. cattle shipment networks: Spatial and temporal patterns of trade communities from 2009 to 2011.

PubMed

Gorsich, Erin E; Luis, Angela D; Buhnerkempe, Michael G; Grear, Daniel A; Portacci, Katie; Miller, Ryan S; Webb, Colleen T

2016-11-01

The application of network analysis to cattle shipments broadens our understanding of shipment patterns beyond pairwise interactions to the network as a whole. Such a quantitative description of cattle shipments in the U.S. can identify trade communities, describe temporal shipment patterns, and inform the design of disease surveillance and control strategies. Here, we analyze a longitudinal dataset of beef and dairy cattle shipments from 2009 to 2011 in the United States to characterize communities within the broader cattle shipment network, which are groups of counties that ship mostly to each other. Because shipments occur over time, we aggregate the data at various temporal scales to examine the consistency of network and community structure over time. Our results identified nine large (>50 counties) communities based on shipments of beef cattle in 2009 aggregated into an annual network and nine large communities based on shipments of dairy cattle. The size and connectance of the shipment network was highly dynamic; monthly networks were smaller than yearly networks and revealed seasonal shipment patterns consistent across years. Comparison of the shipment network over time showed largely consistent shipping patterns, such that communities identified on annual networks of beef and diary shipments from 2009 still represented 41-95% of shipments in monthly networks from 2009 and 41-66% of shipments from networks in 2010 and 2011. The temporal aspects of cattle shipments suggest that future applications of the U.S. cattle shipment network should consider seasonal shipment patterns. However, the consistent within-community shipping patterns indicate that yearly communities could provide a reasonable way to group regions for management. Copyright © 2016 Elsevier B.V. All rights reserved.

Disease implications of animal social network structure: A synthesis across social systems.

PubMed

Sah, Pratha; Mann, Janet; Bansal, Shweta

2018-05-01

The disease costs of sociality have largely been understood through the link between group size and transmission. However, infectious disease spread is driven primarily by the social organization of interactions in a group and not its size. We used statistical models to review the social network organization of 47 species, including mammals, birds, reptiles, fish and insects by categorizing each species into one of three social systems, relatively solitary, gregarious and socially hierarchical. Additionally, using computational experiments of infection spread, we determined the disease costs of each social system. We find that relatively solitary species have large variation in number of social partners, that socially hierarchical species are the least clustered in their interactions, and that social networks of gregarious species tend to be the most fragmented. However, these structural differences are primarily driven by weak connections, which suggest that different social systems have evolved unique strategies to organize weak ties. Our synthetic disease experiments reveal that social network organization can mitigate the disease costs of group living for socially hierarchical species when the pathogen is highly transmissible. In contrast, highly transmissible pathogens cause frequent and prolonged epidemic outbreaks in gregarious species. We evaluate the implications of network organization across social systems despite methodological challenges, and our findings offer new perspective on the debate about the disease costs of group living. Additionally, our study demonstrates the potential of meta-analytic methods in social network analysis to test ecological and evolutionary hypotheses on cooperation, group living, communication and resilience to extrinsic pressures. © 2017 The Authors. Journal of Animal Ecology © 2017 British Ecological Society.

Multilayered nano-architecture of variable sized graphene nanosheets for enhanced supercapacitor electrode performance.

PubMed

Biswas, Sanjib; Drzal, Lawrence T

2010-08-01

The diverse physical and chemical aspects of graphene nanosheets such as particle size surface area and edge chemistry were combined to fabricate a new supercapacitor electrode architecture consisting of a highly aligned network of large-sized nanosheets as a series of current collectors within a multilayer configuration of bulk electrode. Capillary driven self-assembly of monolayers of graphene nanosheets was employed to create a flexible, multilayer, free-standing film of highly hydrophobic nanosheets over large macroscopic areas. This nanoarchitecture exhibits a high-frequency capacitative response and a nearly rectangular cyclic voltammogram at 1000 mV/s scanning rate and possesses a rapid current response, small equivalent series resistance (ESR), and fast ionic diffusion for high-power electrical double-layer capacitor (EDLC) application.

Small-size pedestrian detection in large scene based on fast R-CNN

NASA Astrophysics Data System (ADS)

Wang, Shengke; Yang, Na; Duan, Lianghua; Liu, Lu; Dong, Junyu

2018-04-01

Pedestrian detection is a canonical sub-problem of object detection with high demand during recent years. Although recent deep learning object detectors such as Fast/Faster R-CNN have shown excellent performance for general object detection, they have limited success for small size pedestrian detection in large-view scene. We study that the insufficient resolution of feature maps lead to the unsatisfactory accuracy when handling small instances. In this paper, we investigate issues involving Fast R-CNN for pedestrian detection. Driven by the observations, we propose a very simple but effective baseline for pedestrian detection based on Fast R-CNN, employing the DPM detector to generate proposals for accuracy, and training a fast R-CNN style network to jointly optimize small size pedestrian detection with skip connection concatenating feature from different layers to solving coarseness of feature maps. And the accuracy is improved in our research for small size pedestrian detection in the real large scene.

Control range: a controllability-based index for node significance in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong

2012-04-01

While a large number of methods for module detection have been developed for undirected networks, it is difficult to adapt them to handle directed networks due to the lack of consensus criteria for measuring the node significance in a directed network. In this paper, we propose a novel structural index, the control range, motivated by recent studies on the structural controllability of large-scale directed networks. The control range of a node quantifies the size of the subnetwork that the node can effectively control. A related index, called the control range similarity, is also introduced to measure the structural similarity between two nodes. When applying the index of control range to several real-world and synthetic directed networks, it is observed that the control range of the nodes is mainly influenced by the network's degree distribution and that nodes with a low degree may have a high control range. We use the index of control range similarity to detect and analyze functional modules in glossary networks and the enzyme-centric network of homo sapiens. Our results, as compared with other approaches to module detection such as modularity optimization algorithm, dynamic algorithm and clique percolation method, indicate that the proposed indices are effective and practical in depicting structural and modular characteristics of sparse directed networks.

Percolation properties of 3-D multiscale pore networks: how connectivity controls soil filtration processes

NASA Astrophysics Data System (ADS)

Perrier, E. M. A.; Bird, N. R. A.; Rieutord, T. B.

2010-04-01

Quantifying the connectivity of pore networks is a key issue not only for modelling fluid flow and solute transport in porous media but also for assessing the ability of soil ecosystems to filter bacteria, viruses and any type of living microorganisms as well inert particles which pose a contamination risk. Straining is the main mechanical component of filtration processes: it is due to size effects, when a given soil retains a conveyed entity larger than the pores through which it is attempting to pass. We postulate that the range of sizes of entities which can be trapped inside soils has to be associated with the large range of scales involved in natural soil structures and that information on the pore size distribution has to be complemented by information on a Critical Filtration Size (CFS) delimiting the transition between percolating and non percolating regimes in multiscale pore networks. We show that the mass fractal dimensions which are classically used in soil science to quantify scaling laws in observed pore size distributions can also be used to build 3-D multiscale models of pore networks exhibiting such a critical transition. We extend to the 3-D case a new theoretical approach recently developed to address the connectivity of 2-D fractal networks (Bird and Perrier, 2009). Theoretical arguments based on renormalisation functions provide insight into multi-scale connectivity and a first estimation of CFS. Numerical experiments on 3-D prefractal media confirm the qualitative theory. These results open the way towards a new methodology to estimate soil filtration efficiency from the construction of soil structural models to be calibrated on available multiscale data.

Percolation properties of 3-D multiscale pore networks: how connectivity controls soil filtration processes

NASA Astrophysics Data System (ADS)

Perrier, E. M. A.; Bird, N. R. A.; Rieutord, T. B.

2010-10-01

Quantifying the connectivity of pore networks is a key issue not only for modelling fluid flow and solute transport in porous media but also for assessing the ability of soil ecosystems to filter bacteria, viruses and any type of living microorganisms as well inert particles which pose a contamination risk. Straining is the main mechanical component of filtration processes: it is due to size effects, when a given soil retains a conveyed entity larger than the pores through which it is attempting to pass. We postulate that the range of sizes of entities which can be trapped inside soils has to be associated with the large range of scales involved in natural soil structures and that information on the pore size distribution has to be complemented by information on a critical filtration size (CFS) delimiting the transition between percolating and non percolating regimes in multiscale pore networks. We show that the mass fractal dimensions which are classically used in soil science to quantify scaling laws in observed pore size distributions can also be used to build 3-D multiscale models of pore networks exhibiting such a critical transition. We extend to the 3-D case a new theoretical approach recently developed to address the connectivity of 2-D fractal networks (Bird and Perrier, 2009). Theoretical arguments based on renormalisation functions provide insight into multi-scale connectivity and a first estimation of CFS. Numerical experiments on 3-D prefractal media confirm the qualitative theory. These results open the way towards a new methodology to estimate soil filtration efficiency from the construction of soil structural models to be calibrated on available multiscale data.

Understanding the implementation of evidence-based care: a structural network approach.

PubMed

Parchman, Michael L; Scoglio, Caterina M; Schumm, Phillip

2011-02-24

Recent study of complex networks has yielded many new insights into phenomenon such as social networks, the internet, and sexually transmitted infections. The purpose of this analysis is to examine the properties of a network created by the 'co-care' of patients within one region of the Veterans Health Affairs. Data were obtained for all outpatient visits from 1 October 2006 to 30 September 2008 within one large Veterans Integrated Service Network. Types of physician within each clinic were nodes connected by shared patients, with a weighted link representing the number of shared patients between each connected pair. Network metrics calculated included edge weights, node degree, node strength, node coreness, and node betweenness. Log-log plots were used to examine the distribution of these metrics. Sizes of k-core networks were also computed under multiple conditions of node removal. There were 4,310,465 encounters by 266,710 shared patients between 722 provider types (nodes) across 41 stations or clinics resulting in 34,390 edges. The number of other nodes to which primary care provider nodes have a connection (172.7) is 42% greater than that of general surgeons and two and one-half times as high as cardiology. The log-log plot of the edge weight distribution appears to be linear in nature, revealing a 'scale-free' characteristic of the network, while the distributions of node degree and node strength are less so. The analysis of the k-core network sizes under increasing removal of primary care nodes shows that about 10 most connected primary care nodes play a critical role in keeping the k-core networks connected, because their removal disintegrates the highest k-core network. Delivery of healthcare in a large healthcare system such as that of the US Department of Veterans Affairs (VA) can be represented as a complex network. This network consists of highly connected provider nodes that serve as 'hubs' within the network, and demonstrates some 'scale-free' properties. By using currently available tools to explore its topology, we can explore how the underlying connectivity of such a system affects the behavior of providers, and perhaps leverage that understanding to improve quality and outcomes of care.

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

NASA Astrophysics Data System (ADS)

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.

Large wood recruitment and redistribution in headwater streams in the southern Oregon Coast Range, U.S.A.

Treesearch

C. L. May; R. E. Gresswell

2003-01-01

Abstract - Large wood recruitment and redistribution mechanisms were investigated in a 3.9 km 2 basin with an old-growth Pseudotsuga menziesii (Mirb.) Franco and Tsuga heterophylla (Raf.) Sarg. Forest, located in the southern Coast Range of Oregon. Stream size and topographic setting strongly influenced processes that delivered wood to the channel network. In small...

Recovery of infrastructure networks after localised attacks.

PubMed

Hu, Fuyu; Yeung, Chi Ho; Yang, Saini; Wang, Weiping; Zeng, An

2016-04-14

The stability of infrastructure network is always a critical issue studied by researchers in different fields. A lot of works have been devoted to reveal the robustness of the infrastructure networks against random and malicious attacks. However, real attack scenarios such as earthquakes and typhoons are instead localised attacks which are investigated only recently. Unlike previous studies, we examine in this paper the resilience of infrastructure networks by focusing on the recovery process from localised attacks. We introduce various preferential repair strategies and found that they facilitate and improve network recovery compared to that of random repairs, especially when population size is uneven at different locations. Moreover, our strategic repair methods show similar effectiveness as the greedy repair. The validations are conducted on simulated networks, and on real networks with real disasters. Our method is meaningful in practice as it can largely enhance network resilience and contribute to network risk reduction.

Recovery of infrastructure networks after localised attacks

PubMed Central

Hu, Fuyu; Yeung, Chi Ho; Yang, Saini; Wang, Weiping; Zeng, An

2016-01-01

The stability of infrastructure network is always a critical issue studied by researchers in different fields. A lot of works have been devoted to reveal the robustness of the infrastructure networks against random and malicious attacks. However, real attack scenarios such as earthquakes and typhoons are instead localised attacks which are investigated only recently. Unlike previous studies, we examine in this paper the resilience of infrastructure networks by focusing on the recovery process from localised attacks. We introduce various preferential repair strategies and found that they facilitate and improve network recovery compared to that of random repairs, especially when population size is uneven at different locations. Moreover, our strategic repair methods show similar effectiveness as the greedy repair. The validations are conducted on simulated networks, and on real networks with real disasters. Our method is meaningful in practice as it can largely enhance network resilience and contribute to network risk reduction. PMID:27075559

Size-independent neural networks based first-principles method for accurate prediction of heat of formation of fuels

NASA Astrophysics Data System (ADS)

Yang, GuanYa; Wu, Jiang; Chen, ShuGuang; Zhou, WeiJun; Sun, Jian; Chen, GuanHua

2018-06-01

Neural network-based first-principles method for predicting heat of formation (HOF) was previously demonstrated to be able to achieve chemical accuracy in a broad spectrum of target molecules [L. H. Hu et al., J. Chem. Phys. 119, 11501 (2003)]. However, its accuracy deteriorates with the increase in molecular size. A closer inspection reveals a systematic correlation between the prediction error and the molecular size, which appears correctable by further statistical analysis, calling for a more sophisticated machine learning algorithm. Despite the apparent difference between simple and complex molecules, all the essential physical information is already present in a carefully selected set of small molecule representatives. A model that can capture the fundamental physics would be able to predict large and complex molecules from information extracted only from a small molecules database. To this end, a size-independent, multi-step multi-variable linear regression-neural network-B3LYP method is developed in this work, which successfully improves the overall prediction accuracy by training with smaller molecules only. And in particular, the calculation errors for larger molecules are drastically reduced to the same magnitudes as those of the smaller molecules. Specifically, the method is based on a 164-molecule database that consists of molecules made of hydrogen and carbon elements. 4 molecular descriptors were selected to encode molecule's characteristics, among which raw HOF calculated from B3LYP and the molecular size are also included. Upon the size-independent machine learning correction, the mean absolute deviation (MAD) of the B3LYP/6-311+G(3df,2p)-calculated HOF is reduced from 16.58 to 1.43 kcal/mol and from 17.33 to 1.69 kcal/mol for the training and testing sets (small molecules), respectively. Furthermore, the MAD of the testing set (large molecules) is reduced from 28.75 to 1.67 kcal/mol.

Evidence for fish dispersal from spatial analysis of stream network topology

USGS Publications Warehouse

Hitt, N.P.; Angermeier, P.L.

2008-01-01

Developing spatially explicit conservation strategies for stream fishes requires an understanding of the spatial structure of dispersal within stream networks. We explored spatial patterns of stream fish dispersal by evaluating how the size and proximity of connected streams (i.e., stream network topology) explained variation in fish assemblage structure and how this relationship varied with local stream size. We used data from the US Environmental Protection Agency's Environmental Monitoring and Assessment Program in wadeable streams of the Mid-Atlantic Highlands region (n = 308 sites). We quantified stream network topology with a continuous analysis based on the rate of downstream flow accumulation from sites and with a discrete analysis based on the presence of mainstem river confluences (i.e., basin area >250 km2) within 20 fluvial km (fkm) from sites. Continuous variation in stream network topology was related to local species richness within a distance of ???10 fkm, suggesting an influence of fish dispersal within this spatial grain. This effect was explained largely by catostomid species, cyprinid species, and riverine species, but was not explained by zoogeographic regions, ecoregions, sampling period, or spatial autocorrelation. Sites near mainstem river confluences supported greater species richness and abundance of catostomid, cyprinid, and ictalurid fishes than did sites >20 fkm from such confluences. Assemblages at sites on the smallest streams were not related to stream network topology, consistent with the hypothesis that local stream size regulates the influence of regional dispersal. These results demonstrate that the size and proximity of connected streams influence the spatial distribution of fish and suggest that these influences can be incorporated into the designs of stream bioassessments and reserves to enhance management efficacy. ?? 2008 by The North American Benthological Society.

Robustness of networks with assortative dependence groups

NASA Astrophysics Data System (ADS)

Wang, Hui; Li, Ming; Deng, Lin; Wang, Bing-Hong

2018-07-01

Assortativity is one of the important characteristics in real networks. To study the effects of this characteristic on the robustness of networks, we propose a percolation model on networks with assortative dependence group. The assortativity in this model means that the nodes with the same or similar degrees form dependence groups, for which one node fails, other nodes in the same group are very likely to fail. We find that the assortativity makes the nodes with large degrees easier to survive from the cascading failure. In this way, such networks are more robust than that with random dependence group, which also proves the assortative network is robust in another perspective. Furthermore, we also present exact solutions to the size of the giant component and the critical point, which are in agreement with the simulation results well.

NetBenchmark: a bioconductor package for reproducible benchmarks of gene regulatory network inference.

PubMed

Bellot, Pau; Olsen, Catharina; Salembier, Philippe; Oliveras-Vergés, Albert; Meyer, Patrick E

2015-09-29

In the last decade, a great number of methods for reconstructing gene regulatory networks from expression data have been proposed. However, very few tools and datasets allow to evaluate accurately and reproducibly those methods. Hence, we propose here a new tool, able to perform a systematic, yet fully reproducible, evaluation of transcriptional network inference methods. Our open-source and freely available Bioconductor package aggregates a large set of tools to assess the robustness of network inference algorithms against different simulators, topologies, sample sizes and noise intensities. The benchmarking framework that uses various datasets highlights the specialization of some methods toward network types and data. As a result, it is possible to identify the techniques that have broad overall performances.

A Novel Characterization of Amalgamated Networks in Natural Systems

PubMed Central

Barranca, Victor J.; Zhou, Douglas; Cai, David

2015-01-01

Densely-connected networks are prominent among natural systems, exhibiting structural characteristics often optimized for biological function. To reveal such features in highly-connected networks, we introduce a new network characterization determined by a decomposition of network-connectivity into low-rank and sparse components. Based on these components, we discover a new class of networks we define as amalgamated networks, which exhibit large functional groups and dense connectivity. Analyzing recent experimental findings on cerebral cortex, food-web, and gene regulatory networks, we establish the unique importance of amalgamated networks in fostering biologically advantageous properties, including rapid communication among nodes, structural stability under attacks, and separation of network activity into distinct functional modules. We further observe that our network characterization is scalable with network size and connectivity, thereby identifying robust features significant to diverse physical systems, which are typically undetectable by conventional characterizations of connectivity. We expect that studying the amalgamation properties of biological networks may offer new insights into understanding their structure-function relationships. PMID:26035066

FPGA implementation of a biological neural network based on the Hodgkin-Huxley neuron model.

PubMed

Yaghini Bonabi, Safa; Asgharian, Hassan; Safari, Saeed; Nili Ahmadabadi, Majid

2014-01-01

A set of techniques for efficient implementation of Hodgkin-Huxley-based (H-H) model of a neural network on FPGA (Field Programmable Gate Array) is presented. The central implementation challenge is H-H model complexity that puts limits on the network size and on the execution speed. However, basics of the original model cannot be compromised when effect of synaptic specifications on the network behavior is the subject of study. To solve the problem, we used computational techniques such as CORDIC (Coordinate Rotation Digital Computer) algorithm and step-by-step integration in the implementation of arithmetic circuits. In addition, we employed different techniques such as sharing resources to preserve the details of model as well as increasing the network size in addition to keeping the network execution speed close to real time while having high precision. Implementation of a two mini-columns network with 120/30 excitatory/inhibitory neurons is provided to investigate the characteristic of our method in practice. The implementation techniques provide an opportunity to construct large FPGA-based network models to investigate the effect of different neurophysiological mechanisms, like voltage-gated channels and synaptic activities, on the behavior of a neural network in an appropriate execution time. Additional to inherent properties of FPGA, like parallelism and re-configurability, our approach makes the FPGA-based system a proper candidate for study on neural control of cognitive robots and systems as well.

Stability-to-instability transition in the structure of large-scale networks

NASA Astrophysics Data System (ADS)

Hu, Dandan; Ronhovde, Peter; Nussinov, Zohar

2012-12-01

We examine phase transitions between the “easy,” “hard,” and “unsolvable” phases when attempting to identify structure in large complex networks (“community detection”) in the presence of disorder induced by network “noise” (spurious links that obscure structure), heat bath temperature T, and system size N. The partition of a graph into q optimally disjoint subgraphs or “communities” inherently requires Potts-type variables. In earlier work [Philos. Mag.1478-643510.1080/14786435.2011.616547 92, 406 (2012)], when examining power law and other networks (and general associated Potts models), we illustrated that transitions in the computational complexity of the community detection problem typically correspond to spin-glass-type transitions (and transitions to chaotic dynamics in mechanical analogs) at both high and low temperatures and/or noise. The computationally “hard” phase exhibits spin-glass type behavior including memory effects. The region over which the hard phase extends in the noise and temperature phase diagram decreases as N increases while holding the average number of nodes per community fixed. This suggests that in the thermodynamic limit a direct sharp transition may occur between the easy and unsolvable phases. When present, transitions at low temperature or low noise correspond to entropy driven (or “order by disorder”) annealing effects, wherein stability may initially increase as temperature or noise is increased before becoming unsolvable at sufficiently high temperature or noise. Additional transitions between contending viable solutions (such as those at different natural scales) are also possible. Identifying community structure via a dynamical approach where “chaotic-type” transitions were found earlier. The correspondence between the spin-glass-type complexity transitions and transitions into chaos in dynamical analogs might extend to other hard computational problems. In this work, we examine large networks (with a power law distribution in cluster size) that have a large number of communities (q≫1). We infer that large systems at a constant ratio of q to the number of nodes N asymptotically tend towards insolvability in the limit of large N for any positive T. The asymptotic behavior of temperatures below which structure identification might be possible, T×=O[1/lnq], decreases slowly, so for practical system sizes, there remains an accessible, and generally easy, global solvable phase at low temperature. We further employ multivariate Tutte polynomials to show that increasing q emulates increasing T for a general Potts model, leading to a similar stability region at low T. Given the relation between Tutte and Jones polynomials, our results further suggest a link between the above complexity transitions and transitions associated with random knots.

Automated Construction of Node Software Using Attributes in a Ubiquitous Sensor Network Environment

PubMed Central

Lee, Woojin; Kim, Juil; Kang, JangMook

2010-01-01

In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric—the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment. PMID:22163678

Common arbuscular mycorrhizal networks amplify competition for phosphorus between seedlings and established plants.

PubMed

Merrild, Marie P; Ambus, Per; Rosendahl, Søren; Jakobsen, Iver

2013-10-01

Common mycorrhizal networks (CMNs) influence competition between plants, but reports regarding their precise effect are conflicting. We studied CMN effects on phosphorus (P) uptake and growth of seedlings as influenced by various disruptions of network components. Tomato (Solanum lycopersicon) seedlings grew into established networks of Rhizophagus irregularis and cucumber (Cucumis sativus) in two experiments. One experiment studied seedling uptake of (32)P in the network in response to cutting of cucumber shoots; the other analysed seedling uptake of P and nitrogen (N) in the presence of intact or severed arbuscular mycorrhizal fungus networks and at two soil P concentrations. Pre-established and intact networks suppressed growth of tomato seedlings. Cutting of cucumber shoots mitigated P deficiency symptoms of seedlings, which obtained access to P in the extraradical mycelium and thereby showed improved growth. Solitary seedlings growing in a network patch that had been severed from the CMN also grew much better than seedlings of the corresponding CMN. Interspecific and size-asymmetric competition between plants may be amplified rather than relaxed by CMNs that transfer P to large plants providing most carbon and render small plants P deficient. It is likely that grazing or senescence of the large plants will alleviate the network-induced suppression of seedling growth. © 2013 The Authors. New Phytologist © 2013 New Phytologist Trust.

Range-wide network of priority areas for greater sage-grouse - a design for conserving connected distributions or isolating individual zoos?

USGS Publications Warehouse

Crist, Michele R.; Knick, Steven T.; Hanser, Steven E.

2015-09-08

The network of areas delineated in 11 Western States for prioritizing management of greater sage-grouse (Centrocercus urophasianus) represents a grand experiment in conservation biology and reserve design. We used centrality metrics from social network theory to gain insights into how this priority area network might function. The network was highly centralized. Twenty of 188 priority areas accounted for 80 percent of the total centrality scores. These priority areas, characterized by large size and a central location in the range-wide distribution, are strongholds for greater sage-grouse populations and also might function as sources. Mid-ranking priority areas may serve as stepping stones because of their location between large central and smaller peripheral priority areas. The current network design and conservation strategy has risks. The contribution of almost one-half (n = 93) of the priority areas combined for less than 1 percent of the cumulative centrality scores for the network. These priority areas individually are likely too small to support viable sage-grouse populations within their boundary. Without habitat corridors to connect small priority areas either to larger priority areas or as a clustered group within the network, their isolation could lead to loss of sage-grouse within these regions of the network. 

Automated construction of node software using attributes in a ubiquitous sensor network environment.

PubMed

Lee, Woojin; Kim, Juil; Kang, JangMook

2010-01-01

In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric-the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment.

Revealing the Hidden Relationship by Sparse Modules in Complex Networks with a Large-Scale Analysis

PubMed Central

Jiao, Qing-Ju; Huang, Yan; Liu, Wei; Wang, Xiao-Fan; Chen, Xiao-Shuang; Shen, Hong-Bin

2013-01-01

One of the remarkable features of networks is module that can provide useful insights into not only network organizations but also functional behaviors between their components. Comprehensive efforts have been devoted to investigating cohesive modules in the past decade. However, it is still not clear whether there are important structural characteristics of the nodes that do not belong to any cohesive module. In order to answer this question, we performed a large-scale analysis on 25 complex networks with different types and scales using our recently developed BTS (bintree seeking) algorithm, which is able to detect both cohesive and sparse modules in the network. Our results reveal that the sparse modules composed by the cohesively isolated nodes widely co-exist with the cohesive modules. Detailed analysis shows that both types of modules provide better characterization for the division of a network into functional units than merely cohesive modules, because the sparse modules possibly re-organize the nodes in the so-called cohesive modules, which lack obvious modular significance, into meaningful groups. Compared with cohesive modules, the sizes of sparse ones are generally smaller. Sparse modules are also found to have preferences in social and biological networks than others. PMID:23762457

High performance interconnection between high data rate networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, K.; Overstreet, C. M.; Zhang, L.; Sun, W.

1992-01-01

The bridge/gateway system needed to interconnect a wide range of computer networks to support a wide range of user quality-of-service requirements is discussed. The bridge/gateway must handle a wide range of message types including synchronous and asynchronous traffic, large, bursty messages, short, self-contained messages, time critical messages, etc. It is shown that messages can be classified into three basic classes, synchronous and large and small asynchronous messages. The first two require call setup so that packet identification, buffer handling, etc. can be supported in the bridge/gateway. Identification enables resequences in packet size. The third class is for messages which do not require call setup. Resequencing hardware based to handle two types of resequencing problems is presented. The first is for a virtual parallel circuit which can scramble channel bytes. The second system is effective in handling both synchronous and asynchronous traffic between networks with highly differing packet sizes and data rates. The two other major needs for the bridge/gateway are congestion and error control. A dynamic, lossless congestion control scheme which can easily support effective error correction is presented. Results indicate that the congestion control scheme provides close to optimal capacity under congested conditions. Under conditions where error may develop due to intervening networks which are not lossless, intermediate error recovery and correction takes 1/3 less time than equivalent end-to-end error correction under similar conditions.

Inversion for slip distribution using teleseismic P waveforms: North Palm Springs, Borah Peak, and Michoacan earthquakes

USGS Publications Warehouse

Mendoza, C.; Hartzell, S.H.

1988-01-01

We have inverted the teleseismic P waveforms recorded by stations of the Global Digital Seismograph Network for the 8 July 1986 North Palm Springs, California, the 28 October 1983 Borah Peak, Idaho, and the 19 September 1985 Michoacan, Mexico, earthquakes to recover the distribution of slip on each of the faults using a point-by-point inversion method with smoothing and positivity constraints. Results of the inversion indicate that the Global digital Seismograph Network data are useful for deriving fault dislocation models for moderate to large events. However, a wide range of frequencies is necessary to infer the distribution of slip on the earthquake fault. Although the long-period waveforms define the size (dimensions and seismic moment) of the earthquake, data at shorter period provide additional constraints on the variation of slip on the fault. Dislocation models obtained for all three earthquakes are consistent with a heterogeneous rupture process where failure is controlled largely by the size and location of high-strength asperity regions. -from Authors

Lens ion homeostasis relies on the assembly and/or stability of large connexin 46 gap junction plaques on the broad sides of differentiating fiber cells

PubMed Central

Cheng, Catherine; Nowak, Roberta B.; Gao, Junyuan; Sun, Xiurong; Biswas, Sondip K.; Lo, Woo-Kuen; Mathias, Richard T.

2015-01-01

The eye lens consists of layers of tightly packed fiber cells, forming a transparent and avascular organ that is important for focusing light onto the retina. A microcirculation system, facilitated by a network of gap junction channels composed of connexins 46 and 50 (Cx46 and Cx50), is hypothesized to maintain and nourish lens fiber cells. We measured lens impedance in mice lacking tropomodulin 1 (Tmod1, an actin pointed-end capping protein), CP49 (a lens-specific intermediate filament protein), or both Tmod1 and CP49. We were surprised to find that simultaneous loss of Tmod1 and CP49, which disrupts cytoskeletal networks in lens fiber cells, results in increased gap junction coupling resistance, hydrostatic pressure, and sodium concentration. Protein levels of Cx46 and Cx50 in Tmod1−/−;CP49−/− double-knockout (DKO) lenses were unchanged, and electron microscopy revealed normal gap junctions. However, immunostaining and quantitative analysis of three-dimensional confocal images showed that Cx46 gap junction plaques are smaller and more dispersed in DKO differentiating fiber cells. The localization and sizes of Cx50 gap junction plaques in DKO fibers were unaffected, suggesting that Cx46 and Cx50 form homomeric channels. We also demonstrate that gap junction plaques rest in lacunae of the membrane-associated actin-spectrin network, suggesting that disruption of the actin-spectrin network in DKO fibers may interfere with gap junction plaque accretion into micrometer-sized domains or alter the stability of large plaques. This is the first work to reveal that normal gap junction plaque localization and size are associated with normal lens coupling conductance. PMID:25740157

Lens ion homeostasis relies on the assembly and/or stability of large connexin 46 gap junction plaques on the broad sides of differentiating fiber cells.

PubMed

Cheng, Catherine; Nowak, Roberta B; Gao, Junyuan; Sun, Xiurong; Biswas, Sondip K; Lo, Woo-Kuen; Mathias, Richard T; Fowler, Velia M

2015-05-15

The eye lens consists of layers of tightly packed fiber cells, forming a transparent and avascular organ that is important for focusing light onto the retina. A microcirculation system, facilitated by a network of gap junction channels composed of connexins 46 and 50 (Cx46 and Cx50), is hypothesized to maintain and nourish lens fiber cells. We measured lens impedance in mice lacking tropomodulin 1 (Tmod1, an actin pointed-end capping protein), CP49 (a lens-specific intermediate filament protein), or both Tmod1 and CP49. We were surprised to find that simultaneous loss of Tmod1 and CP49, which disrupts cytoskeletal networks in lens fiber cells, results in increased gap junction coupling resistance, hydrostatic pressure, and sodium concentration. Protein levels of Cx46 and Cx50 in Tmod1(-/-);CP49(-/-) double-knockout (DKO) lenses were unchanged, and electron microscopy revealed normal gap junctions. However, immunostaining and quantitative analysis of three-dimensional confocal images showed that Cx46 gap junction plaques are smaller and more dispersed in DKO differentiating fiber cells. The localization and sizes of Cx50 gap junction plaques in DKO fibers were unaffected, suggesting that Cx46 and Cx50 form homomeric channels. We also demonstrate that gap junction plaques rest in lacunae of the membrane-associated actin-spectrin network, suggesting that disruption of the actin-spectrin network in DKO fibers may interfere with gap junction plaque accretion into micrometer-sized domains or alter the stability of large plaques. This is the first work to reveal that normal gap junction plaque localization and size are associated with normal lens coupling conductance. Copyright © 2015 the American Physiological Society.

The Research and Education Collaborative Occultation Network: A System for Coordinated TNO Occultation Observations

NASA Astrophysics Data System (ADS)

Buie, Marc W.; Keller, John M.

2016-03-01

We describe a new system and method for collecting coordinated occultation observations of trans-Neptunian objects (TNOs). Occultations by objects in the outer solar system are more difficult to predict due to their large distance and limited span of the astrometric data used to determine their orbits and positions. This project brings together the research and educational community into a unique citizen-science partnership to overcome the difficulties of observing these distant objects. The goal of the project is to get sizes and shapes for TNOs with diameters larger than 100 km. As a result of the system design it will also serve as a probe for binary systems with spatial separations as small as contact systems. Traditional occultation efforts strive to get a prediction sufficiently good to place mobile ground stations in the shadow track. Our system takes a new approach of setting up a large number of fixed observing stations and letting the shadows come to the network. The nominal spacing of the stations is 50 km so that we ensure two chords at our limiting size. The spread of the network is roughly 2000 km along a roughly north-south line in the western United States. The network contains 56 stations that are committed to the project and we get additional ad hoc support from International Occultation Timing Association members. At our minimum size, two stations will record an event while the other stations will be probing the inner regions for secondary events. Larger objects will get more chords and will allow determination of shape profiles. The stations are almost exclusively sited and associated with schools, usually at the 9-12 grade level. We present a full description of the system we have developed for the continued exploration of the Kuiper Belt.

Efficient discovery of overlapping communities in massive networks

PubMed Central

Gopalan, Prem K.; Blei, David M.

2013-01-01

Detecting overlapping communities is essential to analyzing and exploring natural networks such as social networks, biological networks, and citation networks. However, most existing approaches do not scale to the size of networks that we regularly observe in the real world. In this paper, we develop a scalable approach to community detection that discovers overlapping communities in massive real-world networks. Our approach is based on a Bayesian model of networks that allows nodes to participate in multiple communities, and a corresponding algorithm that naturally interleaves subsampling from the network and updating an estimate of its communities. We demonstrate how we can discover the hidden community structure of several real-world networks, including 3.7 million US patents, 575,000 physics articles from the arXiv preprint server, and 875,000 connected Web pages from the Internet. Furthermore, we demonstrate on large simulated networks that our algorithm accurately discovers the true community structure. This paper opens the door to using sophisticated statistical models to analyze massive networks. PMID:23950224

Prediction-based association control scheme in dense femtocell networks

PubMed Central

Pham, Ngoc-Thai; Huynh, Thong; Hwang, Won-Joo; You, Ilsun; Choo, Kim-Kwang Raymond

2017-01-01

The deployment of large number of femtocell base stations allows us to extend the coverage and efficiently utilize resources in a low cost manner. However, the small cell size of femtocell networks can result in frequent handovers to the mobile user, and consequently throughput degradation. Thus, in this paper, we propose predictive association control schemes to improve the system’s effective throughput. Our design focuses on reducing handover frequency without impacting on throughput. The proposed schemes determine handover decisions that contribute most to the network throughput and are proper for distributed implementations. The simulation results show significant gains compared with existing methods in terms of handover frequency and network throughput perspective. PMID:28328992

Team assembly mechanisms determine collaboration network structure and team performance.

PubMed

Guimerà, Roger; Uzzi, Brian; Spiro, Jarrett; Amaral, Luís A Nunes

2005-04-29

Agents in creative enterprises are embedded in networks that inspire, support, and evaluate their work. Here, we investigate how the mechanisms by which creative teams self-assemble determine the structure of these collaboration networks. We propose a model for the self-assembly of creative teams that has its basis in three parameters: team size, the fraction of newcomers in new productions, and the tendency of incumbents to repeat previous collaborations. The model suggests that the emergence of a large connected community of practitioners can be described as a phase transition. We find that team assembly mechanisms determine both the structure of the collaboration network and team performance for teams derived from both artistic and scientific fields.

Trophic level, successional age and trait matching determine specialization of deadwood-based interaction networks of saproxylic beetles

PubMed Central

Gossner, Martin M.; Grass, Ingo; Arnstadt, Tobias; Hofrichter, Martin; Floren, Andreas; Linsenmair, Karl Eduard; Weisser, Wolfgang W.; Steffan-Dewenter, Ingolf

2017-01-01

The specialization of ecological networks provides important insights into possible consequences of biodiversity loss for ecosystem functioning. However, mostly mutualistic and antagonistic interactions of living organisms have been studied, whereas detritivore networks and their successional changes are largely unexplored. We studied the interactions of saproxylic (deadwood-dependent) beetles with their dead host trees. In a large-scale experiment, 764 logs of 13 tree species were exposed to analyse network structure of three trophic groups of saproxylic beetles over 3 successional years. We found remarkably high specialization of deadwood-feeding xylophages and lower specialization of fungivorous and predatory species. During deadwood succession, community composition, network specialization and network robustness changed differently for the functional groups. To reveal potential drivers of network specialization, we linked species' functional traits to their network roles, and tested for trait matching between plant (i.e. chemical compounds) and beetle (i.e. body size) traits. We found that both plant and animal traits are major drivers of species specialization, and that trait matching can be more important in explaining interactions than neutral processes reflecting species abundance distributions. High network specialization in the early successional stage and decreasing network robustness during succession indicate vulnerability of detritivore networks to reduced tree species diversity and beetle extinctions, with unknown consequences for wood decomposition and nutrient cycling. PMID:28469020

Abruptness of Cascade Failures in Power Grids

NASA Astrophysics Data System (ADS)

Pahwa, Sakshi; Scoglio, Caterina; Scala, Antonio

2014-01-01

Electric power-systems are one of the most important critical infrastructures. In recent years, they have been exposed to extreme stress due to the increasing demand, the introduction of distributed renewable energy sources, and the development of extensive interconnections. We investigate the phenomenon of abrupt breakdown of an electric power-system under two scenarios: load growth (mimicking the ever-increasing customer demand) and power fluctuations (mimicking the effects of renewable sources). Our results on real, realistic and synthetic networks indicate that increasing the system size causes breakdowns to become more abrupt; in fact, mapping the system to a solvable statistical-physics model indicates the occurrence of a first order transition in the large size limit. Such an enhancement for the systemic risk failures (black-outs) with increasing network size is an effect that should be considered in the current projects aiming to integrate national power-grids into ``super-grids''.

Abruptness of cascade failures in power grids.

PubMed

Pahwa, Sakshi; Scoglio, Caterina; Scala, Antonio

2014-01-15

Electric power-systems are one of the most important critical infrastructures. In recent years, they have been exposed to extreme stress due to the increasing demand, the introduction of distributed renewable energy sources, and the development of extensive interconnections. We investigate the phenomenon of abrupt breakdown of an electric power-system under two scenarios: load growth (mimicking the ever-increasing customer demand) and power fluctuations (mimicking the effects of renewable sources). Our results on real, realistic and synthetic networks indicate that increasing the system size causes breakdowns to become more abrupt; in fact, mapping the system to a solvable statistical-physics model indicates the occurrence of a first order transition in the large size limit. Such an enhancement for the systemic risk failures (black-outs) with increasing network size is an effect that should be considered in the current projects aiming to integrate national power-grids into "super-grids".

Abruptness of Cascade Failures in Power Grids

PubMed Central

Pahwa, Sakshi; Scoglio, Caterina; Scala, Antonio

2014-01-01

Electric power-systems are one of the most important critical infrastructures. In recent years, they have been exposed to extreme stress due to the increasing demand, the introduction of distributed renewable energy sources, and the development of extensive interconnections. We investigate the phenomenon of abrupt breakdown of an electric power-system under two scenarios: load growth (mimicking the ever-increasing customer demand) and power fluctuations (mimicking the effects of renewable sources). Our results on real, realistic and synthetic networks indicate that increasing the system size causes breakdowns to become more abrupt; in fact, mapping the system to a solvable statistical-physics model indicates the occurrence of a first order transition in the large size limit. Such an enhancement for the systemic risk failures (black-outs) with increasing network size is an effect that should be considered in the current projects aiming to integrate national power-grids into “super-grids”. PMID:24424239

Estimating the size of the solution space of metabolic networks

PubMed Central

Braunstein, Alfredo; Mulet, Roberto; Pagnani, Andrea

2008-01-01

Background Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network is quite well understood there is still a lack of comprehension regarding the global functional behavior of the system. In the last few years flux-balance analysis (FBA) has been the most successful and widely used technique for studying metabolism at system level. This method strongly relies on the hypothesis that the organism maximizes an objective function. However only under very specific biological conditions (e.g. maximization of biomass for E. coli in reach nutrient medium) the cell seems to obey such optimization law. A more refined analysis not assuming extremization remains an elusive task for large metabolic systems due to algorithmic limitations. Results In this work we propose a novel algorithmic strategy that provides an efficient characterization of the whole set of stable fluxes compatible with the metabolic constraints. Using a technique derived from the fields of statistical physics and information theory we designed a message-passing algorithm to estimate the size of the affine space containing all possible steady-state flux distributions of metabolic networks. The algorithm, based on the well known Bethe approximation, can be used to approximately compute the volume of a non full-dimensional convex polytope in high dimensions. We first compare the accuracy of the predictions with an exact algorithm on small random metabolic networks. We also verify that the predictions of the algorithm match closely those of Monte Carlo based methods in the case of the Red Blood Cell metabolic network. Then we test the effect of gene knock-outs on the size of the solution space in the case of E. coli central metabolism. Finally we analyze the statistical properties of the average fluxes of the reactions in the E. coli metabolic network. Conclusion We propose a novel efficient distributed algorithmic strategy to estimate the size and shape of the affine space of a non full-dimensional convex polytope in high dimensions. The method is shown to obtain, quantitatively and qualitatively compatible results with the ones of standard algorithms (where this comparison is possible) being still efficient on the analysis of large biological systems, where exact deterministic methods experience an explosion in algorithmic time. The algorithm we propose can be considered as an alternative to Monte Carlo sampling methods. PMID:18489757

Dependence of physical and mechanical properties on polymer architecture for model polymer networks

NASA Astrophysics Data System (ADS)

Guo, Ruilan

Effect of architecture at nanoscale on the macroscopic properties of polymer materials has long been a field of major interest, as evidenced by inhomogeneities in networks, multimodal network topologies, etc. The primary purpose of this research is to establish the architecture-property relationship of polymer networks by studying the physical and mechanical responses of a series of topologically different PTHF networks. Monodispersed allyl-tenninated PTHF precursors were synthesized through "living" cationic polymerization and functional end-capping. Model networks of various crosslink densities and inhomogeneities levels (unimodal, bimodal and clustered) were prepared by endlinking precursors via thiol-ene reaction. Thermal characteristics, i.e., glass transition, melting point, and heat of fusion, of model PTHF networks were investigated as functions of crosslink density and inhomogeneities, which showed different dependence on these two architectural parameters. Study of freezing point depression (FPD) of solvent confined in swollen networks indicated that the size of solvent microcrystals is comparable to the mesh size formed by intercrosslink chains depending on crosslink density and inhomogeneities. Relationship between crystal size and FPD provided a good reflection of the existing architecture facts in the networks. Mechanical responses of elastic chains to uniaxial strains were studied through SANS. Spatial inhomogeneities in bimodal and clustered networks gave rise to "abnormal butterfly patterns", which became more pronounced as elongation ratio increases. Radii of gyration of chains were analyzed at directions parallel and perpendicular to stretching axis. Dependence of Rg on lambda was compared to three rubber elasticity models and the molecular deformation mechanisms for unimodal, bimodal and clustered networks were explored. The thesis focused its last part on the investigation of evolution of free volume distribution of linear polymer (PE) subjected to uniaxial strain at various temperatures using a combination of MD, hard sphere probe method and Voronoi tessellation. Combined effects of temperature and strain on free volume were studied and mechanism of formation of large and ellipsoidal free volume voids was explored.

Optimization and resilience of complex supply-demand networks

NASA Astrophysics Data System (ADS)

Zhang, Si-Ping; Huang, Zi-Gang; Dong, Jia-Qi; Eisenberg, Daniel; Seager, Thomas P.; Lai, Ying-Cheng

2015-06-01

Supply-demand processes take place on a large variety of real-world networked systems ranging from power grids and the internet to social networking and urban systems. In a modern infrastructure, supply-demand systems are constantly expanding, leading to constant increase in load requirement for resources and consequently, to problems such as low efficiency, resource scarcity, and partial system failures. Under certain conditions global catastrophe on the scale of the whole system can occur through the dynamical process of cascading failures. We investigate optimization and resilience of time-varying supply-demand systems by constructing network models of such systems, where resources are transported from the supplier sites to users through various links. Here by optimization we mean minimization of the maximum load on links, and system resilience can be characterized using the cascading failure size of users who fail to connect with suppliers. We consider two representative classes of supply schemes: load driven supply and fix fraction supply. Our findings are: (1) optimized systems are more robust since relatively smaller cascading failures occur when triggered by external perturbation to the links; (2) a large fraction of links can be free of load if resources are directed to transport through the shortest paths; (3) redundant links in the performance of the system can help to reroute the traffic but may undesirably transmit and enlarge the failure size of the system; (4) the patterns of cascading failures depend strongly upon the capacity of links; (5) the specific location of the trigger determines the specific route of cascading failure, but has little effect on the final cascading size; (6) system expansion typically reduces the efficiency; and (7) when the locations of the suppliers are optimized over a long expanding period, fewer suppliers are required. These results hold for heterogeneous networks in general, providing insights into designing optimal and resilient complex supply-demand systems that expand constantly in time.

Social networks of men who have sex with men and their implications for HIV/STI interventions: results from a cross-sectional study using respondent-driven sampling in a large and a small city in Tanzania.

PubMed

Ross, Michael W; Larsson, Markus; Jacobson, Jerry; Nyoni, Joyce; Agardh, Anette

2016-11-18

Men who have sex with men (MSM) in sub-Saharan Africa remain hidden and hard to reach for involvement in HIV and sexually transmitted infection (STI) services. The aim of the current study was to describe MSM social networks in a large and a small Tanzanian city in order to explore their utility for peer-based healthcare interventions. Data were collected through respondent-driven sampling (RDS) in Dar es Salaam (n=197) and in Tanga (n=99) in 2012 and 2013, using 5 and 4 seeds, respectively. All results were adjusted for RDS sampling design. Mean personal network size based on the number of MSM who were reported by the participants, as known to them was 12.0±15.5 in Dar es Salaam and 7.6±8.1 in Tanga. Mean actual RDS network size was 39.4±31.4 in Dar es Salaam and 25.3±9.7 in Tanga. A majority (97%) reported that the person from whom they received the recruitment coupon was a sexual partner, close friend or acquaintance. Homophile in recruitment patterns (selective affiliation) was present for age, gay openness, and HIV status in Dar es Salaam, and for sexual identification in Tanga. The personal network sizes and existence of contacts between recruiter and referral indicate that it is possible to use peer-driven interventions to reach MSM for HIV/STI interventions in larger and smaller sub-Saharan African cities. The study was reviewed and approved by the University of Texas Health Science Center's Institutional Review Board (HSC-SPH-10-0033) and the Tanzanian National Institute for Medical Research (NIMR/HQ/R.8a/Vol. IX/1088). Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

A CCD experimental platform for large telescope in Antarctica based on FPGA

NASA Astrophysics Data System (ADS)

Zhu, Yuhua; Qi, Yongjun

2014-07-01

The CCD , as a detector , is one of the important components of astronomical telescopes. For a large telescope in Antarctica, a set of CCD detector system with large size, high sensitivity and low noise is indispensable. Because of the extremely low temperatures and unattended, system maintenance and software and hardware upgrade become hard problems. This paper introduces a general CCD controller experiment platform, using Field programmable gate array FPGA, which is, in fact, a large-scale field reconfigurable array. Taking the advantage of convenience to modify the system, construction of driving circuit, digital signal processing module, network communication interface, control algorithm validation, and remote reconfigurable module may realize. With the concept of integrated hardware and software, the paper discusses the key technology of building scientific CCD system suitable for the special work environment in Antarctica, focusing on the method of remote reconfiguration for controller via network and then offering a feasible hardware and software solution.

Regulation of behaviorally associated gene networks in worker honey bee ovaries

PubMed Central

Wang, Ying; Kocher, Sarah D.; Linksvayer, Timothy A.; Grozinger, Christina M.; Page, Robert E.; Amdam, Gro V.

2012-01-01

SUMMARY Several lines of evidence support genetic links between ovary size and division of labor in worker honey bees. However, it is largely unknown how ovaries influence behavior. To address this question, we first performed transcriptional profiling on worker ovaries from two genotypes that differ in social behavior and ovary size. Then, we contrasted the differentially expressed ovarian genes with six sets of available brain transcriptomes. Finally, we probed behavior-related candidate gene networks in wild-type ovaries of different sizes. We found differential expression in 2151 ovarian transcripts in these artificially selected honey bee strains, corresponding to approximately 20.3% of the predicted gene set of honey bees. Differences in gene expression overlapped significantly with changes in the brain transcriptomes. Differentially expressed genes were associated with neural signal transmission (tyramine receptor, TYR) and ecdysteroid signaling; two independently tested nuclear hormone receptors (HR46 and ftz-f1) were also significantly correlated with ovary size in wild-type bees. We suggest that the correspondence between ovary and brain transcriptomes identified here indicates systemic regulatory networks among hormones (juvenile hormone and ecdysteroids), pheromones (queen mandibular pheromone), reproductive organs and nervous tissues in worker honey bees. Furthermore, robust correlations between ovary size and neuraland endocrine response genes are consistent with the hypothesized roles of the ovaries in honey bee behavioral regulation. PMID:22162860

From field notes to data portal - An operational QA/QC framework for tower networks

NASA Astrophysics Data System (ADS)

Sturtevant, C.; Hackley, S.; Meehan, T.; Roberti, J. A.; Holling, G.; Bonarrigo, S.

2016-12-01

Quality assurance and control (QA/QC) is one of the most important yet challenging aspects of producing research-quality data. This is especially so for environmental sensor networks collecting numerous high-frequency measurement streams at distributed sites. Here, the quality issues are multi-faceted, including sensor malfunctions, unmet theoretical assumptions, and measurement interference from the natural environment. To complicate matters, there are often multiple personnel managing different sites or different steps in the data flow. For large, centrally managed sensor networks such as NEON, the separation of field and processing duties is in the extreme. Tower networks such as Ameriflux, ICOS, and NEON continue to grow in size and sophistication, yet tools for robust, efficient, scalable QA/QC have lagged. Quality control remains a largely manual process relying on visual inspection of the data. In addition, notes of observed measurement interference or visible problems are often recorded on paper without an explicit pathway to data flagging during processing. As such, an increase in network size requires a near-proportional increase in personnel devoted to QA/QC, quickly stressing the human resources available. There is a need for a scalable, operational QA/QC framework that combines the efficiency and standardization of automated tests with the power and flexibility of visual checks, and includes an efficient communication pathway from field personnel to data processors to end users. Here we propose such a framework and an accompanying set of tools in development, including a mobile application template for recording tower maintenance and an R/shiny application for efficiently monitoring and synthesizing data quality issues. This framework seeks to incorporate lessons learned from the Ameriflux community and provide tools to aid continued network advancements.

Multi-period response management to contaminated water distribution networks: dynamic programming versus genetic algorithms

NASA Astrophysics Data System (ADS)

Bashi-Azghadi, Seyyed Nasser; Afshar, Abbas; Afshar, Mohammad Hadi

2018-03-01

Previous studies on consequence management assume that the selected response action including valve closure and/or hydrant opening remains unchanged during the entire management period. This study presents a new embedded simulation-optimization methodology for deriving time-varying operational response actions in which the network topology may change from one stage to another. Dynamic programming (DP) and genetic algorithm (GA) are used in order to minimize selected objective functions. Two networks of small and large sizes are used in order to illustrate the performance of the proposed modelling schemes if a time-dependent consequence management strategy is to be implemented. The results show that for a small number of decision variables even in large-scale networks, DP is superior in terms of accuracy and computer runtime. However, as the number of potential actions grows, DP loses its merit over the GA approach. This study clearly proves the priority of the proposed dynamic operation strategy over the commonly used static strategy.

A sparse structure learning algorithm for Gaussian Bayesian Network identification from high-dimensional data.

PubMed

Huang, Shuai; Li, Jing; Ye, Jieping; Fleisher, Adam; Chen, Kewei; Wu, Teresa; Reiman, Eric

2013-06-01

Structure learning of Bayesian Networks (BNs) is an important topic in machine learning. Driven by modern applications in genetics and brain sciences, accurate and efficient learning of large-scale BN structures from high-dimensional data becomes a challenging problem. To tackle this challenge, we propose a Sparse Bayesian Network (SBN) structure learning algorithm that employs a novel formulation involving one L1-norm penalty term to impose sparsity and another penalty term to ensure that the learned BN is a Directed Acyclic Graph--a required property of BNs. Through both theoretical analysis and extensive experiments on 11 moderate and large benchmark networks with various sample sizes, we show that SBN leads to improved learning accuracy, scalability, and efficiency as compared with 10 existing popular BN learning algorithms. We apply SBN to a real-world application of brain connectivity modeling for Alzheimer's disease (AD) and reveal findings that could lead to advancements in AD research.

A Sparse Structure Learning Algorithm for Gaussian Bayesian Network Identification from High-Dimensional Data

PubMed Central

Huang, Shuai; Li, Jing; Ye, Jieping; Fleisher, Adam; Chen, Kewei; Wu, Teresa; Reiman, Eric

2014-01-01

Structure learning of Bayesian Networks (BNs) is an important topic in machine learning. Driven by modern applications in genetics and brain sciences, accurate and efficient learning of large-scale BN structures from high-dimensional data becomes a challenging problem. To tackle this challenge, we propose a Sparse Bayesian Network (SBN) structure learning algorithm that employs a novel formulation involving one L1-norm penalty term to impose sparsity and another penalty term to ensure that the learned BN is a Directed Acyclic Graph (DAG)—a required property of BNs. Through both theoretical analysis and extensive experiments on 11 moderate and large benchmark networks with various sample sizes, we show that SBN leads to improved learning accuracy, scalability, and efficiency as compared with 10 existing popular BN learning algorithms. We apply SBN to a real-world application of brain connectivity modeling for Alzheimer’s disease (AD) and reveal findings that could lead to advancements in AD research. PMID:22665720

Exploring metabolic pathways in genome-scale networks via generating flux modes.

PubMed

Rezola, A; de Figueiredo, L F; Brock, M; Pey, J; Podhorski, A; Wittmann, C; Schuster, S; Bockmayr, A; Planes, F J

2011-02-15

The reconstruction of metabolic networks at the genome scale has allowed the analysis of metabolic pathways at an unprecedented level of complexity. Elementary flux modes (EFMs) are an appropriate concept for such analysis. However, their number grows in a combinatorial fashion as the size of the metabolic network increases, which renders the application of EFMs approach to large metabolic networks difficult. Novel methods are expected to deal with such complexity. In this article, we present a novel optimization-based method for determining a minimal generating set of EFMs, i.e. a convex basis. We show that a subset of elements of this convex basis can be effectively computed even in large metabolic networks. Our method was applied to examine the structure of pathways producing lysine in Escherichia coli. We obtained a more varied and informative set of pathways in comparison with existing methods. In addition, an alternative pathway to produce lysine was identified using a detour via propionyl-CoA, which shows the predictive power of our novel approach. The source code in C++ is available upon request.

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

PubMed Central

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

2015-01-01

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. PMID:26151208

Experimental damage detection of wind turbine blade using thin film sensor array

NASA Astrophysics Data System (ADS)

Downey, Austin; Laflamme, Simon; Ubertini, Filippo; Sarkar, Partha

2017-04-01

Damage detection of wind turbine blades is difficult due to their large sizes and complex geometries. Additionally, economic restraints limit the viability of high-cost monitoring methods. While it is possible to monitor certain global signatures through modal analysis, obtaining useful measurements over a blade's surface using off-the-shelf sensing technologies is difficult and typically not economical. A solution is to deploy dedicated sensor networks fabricated from inexpensive materials and electronics. The authors have recently developed a novel large-area electronic sensor measuring strain over very large surfaces. The sensing system is analogous to a biological skin, where local strain can be monitored over a global area. In this paper, we propose the utilization of a hybrid dense sensor network of soft elastomeric capacitors to detect, localize, and quantify damage, and resistive strain gauges to augment such dense sensor network with high accuracy data at key locations. The proposed hybrid dense sensor network is installed inside a wind turbine blade model and tested in a wind tunnel to simulate an operational environment. Damage in the form of changing boundary conditions is introduced into the monitored section of the blade. Results demonstrate the ability of the hybrid dense sensor network, and associated algorithms, to detect, localize, and quantify damage.

Mobility based multicast routing in wireless mesh networks

NASA Astrophysics Data System (ADS)

Jain, Sanjeev; Tripathi, Vijay S.; Tiwari, Sudarshan

2013-01-01

There exist two fundamental approaches to multicast routing namely minimum cost trees and shortest path trees. The (MCT's) minimum cost tree is one which connects receiver and sources by providing a minimum number of transmissions (MNTs) the MNTs approach is generally used for energy constraint sensor and mobile ad hoc networks. In this paper we have considered node mobility and try to find out simulation based comparison of the (SPT's) shortest path tree, (MST's) minimum steiner trees and minimum number of transmission trees in wireless mesh networks by using the performance metrics like as an end to end delay, average jitter, throughput and packet delivery ratio, average unicast packet delivery ratio, etc. We have also evaluated multicast performance in the small and large wireless mesh networks. In case of multicast performance in the small networks we have found that when the traffic load is moderate or high the SPTs outperform the MSTs and MNTs in all cases. The SPTs have lowest end to end delay and average jitter in almost all cases. In case of multicast performance in the large network we have seen that the MSTs provide minimum total edge cost and minimum number of transmissions. We have also found that the one drawback of SPTs, when the group size is large and rate of multicast sending is high SPTs causes more packet losses to other flows as MCTs.

Hetero-association for pattern translation

NASA Astrophysics Data System (ADS)

Yu, Francis T. S.; Lu, Thomas T.; Yang, Xiangyang

1991-09-01

A hetero-association neural network using an interpattern association algorithm is presented. By using simple logical rules, hetero-association memory can be constructed based on the association between the input-output reference patterns. For optical implementation, a compact size liquid crystal television neural network is used. Translations between the English letters and the Chinese characters as well as Arabic and Chinese numerics are demonstrated. The authors have shown that the hetero-association model can perform more effectively in comparison to the Hopfield model in retrieving large numbers of similar patterns.

Alignment-free protein interaction network comparison

PubMed Central

Ali, Waqar; Rito, Tiago; Reinert, Gesine; Sun, Fengzhu; Deane, Charlotte M.

2014-01-01

Motivation: Biological network comparison software largely relies on the concept of alignment where close matches between the nodes of two or more networks are sought. These node matches are based on sequence similarity and/or interaction patterns. However, because of the incomplete and error-prone datasets currently available, such methods have had limited success. Moreover, the results of network alignment are in general not amenable for distance-based evolutionary analysis of sets of networks. In this article, we describe Netdis, a topology-based distance measure between networks, which offers the possibility of network phylogeny reconstruction. Results: We first demonstrate that Netdis is able to correctly separate different random graph model types independent of network size and density. The biological applicability of the method is then shown by its ability to build the correct phylogenetic tree of species based solely on the topology of current protein interaction networks. Our results provide new evidence that the topology of protein interaction networks contains information about evolutionary processes, despite the lack of conservation of individual interactions. As Netdis is applicable to all networks because of its speed and simplicity, we apply it to a large collection of biological and non-biological networks where it clusters diverse networks by type. Availability and implementation: The source code of the program is freely available at http://www.stats.ox.ac.uk/research/proteins/resources. Contact: w.ali@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25161230

Measures of large-scale structure in the CfA redshift survey slices

NASA Technical Reports Server (NTRS)

De Lapparent, Valerie; Geller, Margaret J.; Huchra, John P.

1991-01-01

Variations of the counts-in-cells with cell size are used here to define two statistical measures of large-scale clustering in three 6 deg slices of the CfA redshift survey. A percolation criterion is used to estimate the filling factor which measures the fraction of the total volume in the survey occupied by the large-scale structures. For the full 18 deg slice of the CfA redshift survey, f is about 0.25 + or - 0.05. After removing groups with more than five members from two of the slices, variations of the counts in occupied cells with cell size have a power-law behavior with a slope beta about 2.2 on scales from 1-10/h Mpc. Application of both this statistic and the percolation analysis to simulations suggests that a network of two-dimensional structures is a better description of the geometry of the clustering in the CfA slices than a network of one-dimensional structures. Counts-in-cells are also used to estimate at 0.3 galaxy h-squared/Mpc the average galaxy surface density in sheets like the Great Wall.

Evolving bipartite authentication graph partitions

DOE PAGES

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

2017-01-16

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Evolving bipartite authentication graph partitions

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

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Investigation of Spatial Data with Open Source Social Network Analysis and Geographic Information Systems Applications

NASA Astrophysics Data System (ADS)

Sabah, L.; Şimşek, M.

2017-11-01

Social networks are the real social experience of individuals in the online environment. In this environment, people use symbolic gestures and mimics, sharing thoughts and content. Social network analysis is the visualization of complex and large quantities of data to ensure that the overall picture appears. It is the understanding, development, quantitative and qualitative analysis of the relations in the social networks of Graph theory. Social networks are expressed in the form of nodes and edges. Nodes are people/organizations, and edges are relationships between nodes. Relations are directional, non-directional, weighted, and weightless. The purpose of this study is to examine the effects of social networks on the evaluation of person data with spatial coordinates. For this, the cluster size and the effect on the geographical area of the circle where the placements of the individual are influenced by the frequently used placeholder feature in the social networks have been studied.

Network bandwidth utilization forecast model on high bandwidth networks

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

Yoo, Wuchert; Sim, Alex

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology,more » our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.« less

Network Bandwidth Utilization Forecast Model on High Bandwidth Network

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

Yoo, Wucherl; Sim, Alex

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology,more » our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.« less

Characteristics of Social Networks and Mortality Risk: Evidence From 2 Prospective Cohort Studies.

PubMed

Kauppi, Maarit; Kawachi, Ichiro; Batty, George David; Oksanen, Tuula; Elovainio, Marko; Pentti, Jaana; Aalto, Ville; Virtanen, Marianna; Koskenvuo, Markku; Vahtera, Jussi; Kivimäki, Mika

2018-04-01

The size of a person's social network is linked to health and longevity, but it is unclear whether the number of strong social ties or the number of weak social ties is most influential for health. We examined social network characteristics as predictors of mortality in the Finnish Public Sector Study (n = 7,617) and the Health and Social Support Study (n = 20,816). Social network characteristics were surveyed at baseline in 1998. Information about mortality was obtained from the Finnish National Death Registry. During a mean follow-up period of 16 years, participants with a small social network (≤10 members) were more likely to die than those with a large social network (≥21 members) (adjusted hazard ratio (HR) = 1.23, 95% confidence interval (CI): 1.04, 1.46). Mortality risk was increased among participants with both a small number of strong ties (≤2 members) and a small number of weak ties (≤5 members) (HR = 1.55, 95% CI: 1.26, 1.79) and among participants with both a large number of strong ties and a small number of weak ties (HR = 1.28, 95% CI: 1.08, 1.52), but not among those with a small number of strong ties and a large number of weak ties (HR = 1.04, 95% CI: 0.87, 1.25). These findings suggest that in terms of mortality risk, the number of weak ties may be an important component of social networks.

The Elastic Behaviour of Sintered Metallic Fibre Networks: A Finite Element Study by Beam Theory

PubMed Central

Bosbach, Wolfram A.

2015-01-01

Background The finite element method has complimented research in the field of network mechanics in the past years in numerous studies about various materials. Numerical predictions and the planning efficiency of experimental procedures are two of the motivational aspects for these numerical studies. The widespread availability of high performance computing facilities has been the enabler for the simulation of sufficiently large systems. Objectives and Motivation In the present study, finite element models were built for sintered, metallic fibre networks and validated by previously published experimental stiffness measurements. The validated models were the basis for predictions about so far unknown properties. Materials and Methods The finite element models were built by transferring previously published skeletons of fibre networks into finite element models. Beam theory was applied as simplification method. Results and Conclusions The obtained material stiffness isn’t a constant but rather a function of variables such as sample size and boundary conditions. Beam theory offers an efficient finite element method for the simulated fibre networks. The experimental results can be approximated by the simulated systems. Two worthwhile aspects for future work will be the influence of size and shape and the mechanical interaction with matrix materials. PMID:26569603

Splenomegaly Segmentation using Global Convolutional Kernels and Conditional Generative Adversarial Networks

PubMed Central

Huo, Yuankai; Xu, Zhoubing; Bao, Shunxing; Bermudez, Camilo; Plassard, Andrew J.; Liu, Jiaqi; Yao, Yuang; Assad, Albert; Abramson, Richard G.; Landman, Bennett A.

2018-01-01

Spleen volume estimation using automated image segmentation technique may be used to detect splenomegaly (abnormally enlarged spleen) on Magnetic Resonance Imaging (MRI) scans. In recent years, Deep Convolutional Neural Networks (DCNN) segmentation methods have demonstrated advantages for abdominal organ segmentation. However, variations in both size and shape of the spleen on MRI images may result in large false positive and false negative labeling when deploying DCNN based methods. In this paper, we propose the Splenomegaly Segmentation Network (SSNet) to address spatial variations when segmenting extraordinarily large spleens. SSNet was designed based on the framework of image-to-image conditional generative adversarial networks (cGAN). Specifically, the Global Convolutional Network (GCN) was used as the generator to reduce false negatives, while the Markovian discriminator (PatchGAN) was used to alleviate false positives. A cohort of clinically acquired 3D MRI scans (both T1 weighted and T2 weighted) from patients with splenomegaly were used to train and test the networks. The experimental results demonstrated that a mean Dice coefficient of 0.9260 and a median Dice coefficient of 0.9262 using SSNet on independently tested MRI volumes of patients with splenomegaly.

Complex and unexpected dynamics in simple genetic regulatory networks

NASA Astrophysics Data System (ADS)

Borg, Yanika; Ullner, Ekkehard; Alagha, Afnan; Alsaedi, Ahmed; Nesbeth, Darren; Zaikin, Alexey

2014-03-01

One aim of synthetic biology is to construct increasingly complex genetic networks from interconnected simpler ones to address challenges in medicine and biotechnology. However, as systems increase in size and complexity, emergent properties lead to unexpected and complex dynamics due to nonlinear and nonequilibrium properties from component interactions. We focus on four different studies of biological systems which exhibit complex and unexpected dynamics. Using simple synthetic genetic networks, small and large populations of phase-coupled quorum sensing repressilators, Goodwin oscillators, and bistable switches, we review how coupled and stochastic components can result in clustering, chaos, noise-induced coherence and speed-dependent decision making. A system of repressilators exhibits oscillations, limit cycles, steady states or chaos depending on the nature and strength of the coupling mechanism. In large repressilator networks, rich dynamics can also be exhibited, such as clustering and chaos. In populations of Goodwin oscillators, noise can induce coherent oscillations. In bistable systems, the speed with which incoming external signals reach steady state can bias the network towards particular attractors. These studies showcase the range of dynamical behavior that simple synthetic genetic networks can exhibit. In addition, they demonstrate the ability of mathematical modeling to analyze nonlinearity and inhomogeneity within these systems.

Comparing the Happiness Effects of Real and On-Line Friends

PubMed Central

Helliwell, John F.; Huang, Haifang

2013-01-01

A recent large Canadian survey permits us to compare face-to-face (‘real-life’) and on-line social networks as sources of subjective well-being. The sample of 5,000 is drawn randomly from an on-line pool of respondents, a group well placed to have and value on-line friendships. We find three key results. First, the number of real-life friends is positively correlated with subjective well-being (SWB) even after controlling for income, demographic variables and personality differences. Doubling the number of friends in real life has an equivalent effect on well-being as a 50% increase in income. Second, the size of online networks is largely uncorrelated with subjective well-being. Third, we find that real-life friends are much more important for people who are single, divorced, separated or widowed than they are for people who are married or living with a partner. Findings from large international surveys (the European Social Surveys 2002–2008) are used to confirm the importance of real-life social networks to SWB; they also indicate a significantly smaller value of social networks to married or partnered couples. PMID:24019875

Macroscopic self-oscillations and aging transition in a network of synaptically coupled quadratic integrate-and-fire neurons.

PubMed

Ratas, Irmantas; Pyragas, Kestutis

2016-09-01

We analyze the dynamics of a large network of coupled quadratic integrate-and-fire neurons, which represent the canonical model for class I neurons near the spiking threshold. The network is heterogeneous in that it includes both inherently spiking and excitable neurons. The coupling is global via synapses that take into account the finite width of synaptic pulses. Using a recently developed reduction method based on the Lorentzian ansatz, we derive a closed system of equations for the neuron's firing rate and the mean membrane potential, which are exact in the infinite-size limit. The bifurcation analysis of the reduced equations reveals a rich scenario of asymptotic behavior, the most interesting of which is the macroscopic limit-cycle oscillations. It is shown that the finite width of synaptic pulses is a necessary condition for the existence of such oscillations. The robustness of the oscillations against aging damage, which transforms spiking neurons into nonspiking neurons, is analyzed. The validity of the reduced equations is confirmed by comparing their solutions with the solutions of microscopic equations for the finite-size networks.

Naming games in two-dimensional and small-world-connected random geometric networks.

PubMed

Lu, Qiming; Korniss, G; Szymanski, B K

2008-01-01

We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game [Baronchelli, J. Stat. Mech.: Theory Exp. (2006) P06014] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the naming games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case.

Estimating the Local Size and Coverage of Interaction Network Regions

ERIC Educational Resources Information Center

Eagle, Michael; Barnes, Tiffany

2015-01-01

Interactive problem solving environments, such as intelligent tutoring systems and educational video games, produce large amounts of transactional data which make it a challenge for both researchers and educators to understand how students work within the environment. Researchers have modeled the student-tutor interactions using complex network…

Cooperation in N-person evolutionary snowdrift game in scale-free Barabási Albert networks

NASA Astrophysics Data System (ADS)

Lee, K. H.; Chan, Chun-Him; Hui, P. M.; Zheng, Da-Fang

2008-09-01

Cooperation in the N-person evolutionary snowdrift game (NESG) is studied in scale-free Barabási-Albert (BA) networks. Due to the inhomogeneity of the network, two versions of NESG are proposed and studied. In a model where the size of the competing group varies from agent to agent, the fraction of cooperators drops as a function of the payoff parameter. The networking effect is studied via the fraction of cooperative agents for nodes with a particular degree. For small payoff parameters, it is found that the small- k agents are dominantly cooperators, while large- k agents are of non-cooperators. Studying the spatial correlation reveals that cooperative agents will avoid to be nearest neighbors and the correlation disappears beyond the next-nearest neighbors. The behavior can be explained in terms of the networking effect and payoffs. In another model with a fixed size of competing groups, the fraction of cooperators could show a non-monotonic behavior in the regime of small payoff parameters. This non-trivial behavior is found to be a combined effect of the many agents with the smallest degree in the BA network and the increasing fraction of cooperators among these agents with the payoff for small payoffs.

FPGA implementation of a biological neural network based on the Hodgkin-Huxley neuron model

PubMed Central

Yaghini Bonabi, Safa; Asgharian, Hassan; Safari, Saeed; Nili Ahmadabadi, Majid

2014-01-01

A set of techniques for efficient implementation of Hodgkin-Huxley-based (H-H) model of a neural network on FPGA (Field Programmable Gate Array) is presented. The central implementation challenge is H-H model complexity that puts limits on the network size and on the execution speed. However, basics of the original model cannot be compromised when effect of synaptic specifications on the network behavior is the subject of study. To solve the problem, we used computational techniques such as CORDIC (Coordinate Rotation Digital Computer) algorithm and step-by-step integration in the implementation of arithmetic circuits. In addition, we employed different techniques such as sharing resources to preserve the details of model as well as increasing the network size in addition to keeping the network execution speed close to real time while having high precision. Implementation of a two mini-columns network with 120/30 excitatory/inhibitory neurons is provided to investigate the characteristic of our method in practice. The implementation techniques provide an opportunity to construct large FPGA-based network models to investigate the effect of different neurophysiological mechanisms, like voltage-gated channels and synaptic activities, on the behavior of a neural network in an appropriate execution time. Additional to inherent properties of FPGA, like parallelism and re-configurability, our approach makes the FPGA-based system a proper candidate for study on neural control of cognitive robots and systems as well. PMID:25484854

A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

PubMed

Röhl, Annika; Bockmayr, Alexander

2017-01-03

Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

Distributed Environment Control Using Wireless Sensor/Actuator Networks for Lighting Applications

PubMed Central

Nakamura, Masayuki; Sakurai, Atsushi; Nakamura, Jiro

2009-01-01

We propose a decentralized algorithm to calculate the control signals for lights in wireless sensor/actuator networks. This algorithm uses an appropriate step size in the iterative process used for quickly computing the control signals. We demonstrate the accuracy and efficiency of this approach compared with the penalty method by using Mote-based mesh sensor networks. The estimation error of the new approach is one-eighth as large as that of the penalty method with one-fifth of its computation time. In addition, we describe our sensor/actuator node for distributed lighting control based on the decentralized algorithm and demonstrate its practical efficacy. PMID:22291525

Pass-transistor very large scale integration

NASA Technical Reports Server (NTRS)

Maki, Gary K. (Inventor); Bhatia, Prakash R. (Inventor)

2004-01-01

Logic elements are provided that permit reductions in layout size and avoidance of hazards. Such logic elements may be included in libraries of logic cells. A logical function to be implemented by the logic element is decomposed about logical variables to identify factors corresponding to combinations of the logical variables and their complements. A pass transistor network is provided for implementing the pass network function in accordance with this decomposition. The pass transistor network includes ordered arrangements of pass transistors that correspond to the combinations of variables and complements resulting from the logical decomposition. The logic elements may act as selection circuits and be integrated with memory and buffer elements.

Personal social networks and organizational affiliation of South Asians in the United States.

PubMed

Kandula, Namratha R; Cooper, Andrew J; Schneider, John A; Fujimoto, Kayo; Kanaya, Alka M; Van Horn, Linda; deKoning, Lawrence; Siddique, Juned

2018-02-05

Understanding the social lives of South Asian immigrants in the United States (U.S) and their influence on health can inform interpersonal and community-level health interventions for this growing community. This paper describe the rationale, survey design, measurement, and network properties of 700 South Asian individuals in the Mediators of Atherosclerosis in South Asians Living in America (MASALA) social networks ancillary study. MASALA is a community-based cohort, established in 2010, to understand risk factors for cardiovascular disease among South Asians living in the U.S. Survey data collection on personal social networks occurred between 2014 and 2017. Network measurements included size, composition, density, and organizational affiliations. Data on participants' self-rated health and social support functions and health-related discussions among network members were also collected. Participants' age ranged from 44 to 84 (average 59 years), and 57% were men. South Asians had large (size=5.6, SD=2.6), kin-centered (proportion kin=0.71, SD=0.28), and dense networks. Affiliation with religious and spiritual organizations was perceived as beneficial to health. Emotional closeness with network members was positively associated with participants' self-rated health (p-value <0.001), and networks with higher density and more kin were significantly associated with health-related discussions. The MASALA networks study advances research on the cultural patterning of social relationships and sources of social support in South Asians living in the U.S. Future analyses will examine how personal social networks and organizational affiliations influence South Asians' health behaviors and outcomes. ClinicalTrials.gov identifier: NCT02268513.

Federated queries of clinical data repositories: Scaling to a national network.

PubMed

Weber, Griffin M

2015-06-01

Federated networks of clinical research data repositories are rapidly growing in size from a handful of sites to true national networks with more than 100 hospitals. This study creates a conceptual framework for predicting how various properties of these systems will scale as they continue to expand. Starting with actual data from Harvard's four-site Shared Health Research Information Network (SHRINE), the framework is used to imagine a future 4000 site network, representing the majority of hospitals in the United States. From this it becomes clear that several common assumptions of small networks fail to scale to a national level, such as all sites being online at all times or containing data from the same date range. On the other hand, a large network enables researchers to select subsets of sites that are most appropriate for particular research questions. Developers of federated clinical data networks should be aware of how the properties of these networks change at different scales and design their software accordingly. Copyright © 2015 Elsevier Inc. All rights reserved.

FCDECOMP: decomposition of metabolic networks based on flux coupling relations.

PubMed

Rezvan, Abolfazl; Marashi, Sayed-Amir; Eslahchi, Changiz

2014-10-01

A metabolic network model provides a computational framework to study the metabolism of a cell at the system level. Due to their large sizes and complexity, rational decomposition of these networks into subsystems is a strategy to obtain better insight into the metabolic functions. Additionally, decomposing metabolic networks paves the way to use computational methods that will be otherwise very slow when run on the original genome-scale network. In the present study, we propose FCDECOMP decomposition method based on flux coupling relations (FCRs) between pairs of reaction fluxes. This approach utilizes a genetic algorithm (GA) to obtain subsystems that can be analyzed in isolation, i.e. without considering the reactions of the original network in the analysis. Therefore, we propose that our method is useful for discovering biologically meaningful modules in metabolic networks. As a case study, we show that when this method is applied to the metabolic networks of barley seeds and yeast, the modules are in good agreement with the biological compartments of these networks.

A flexible, open, decentralized system for digital pathology networks.

PubMed

Schuler, Robert; Smith, David E; Kumaraguruparan, Gowri; Chervenak, Ann; Lewis, Anne D; Hyde, Dallas M; Kesselman, Carl

2012-01-01

High-resolution digital imaging is enabling digital archiving and sharing of digitized microscopy slides and new methods for digital pathology. Collaborative research centers, outsourced medical services, and multi-site organizations stand to benefit from sharing pathology data in a digital pathology network. Yet significant technological challenges remain due to the large size and volume of digitized whole slide images. While information systems do exist for managing local pathology laboratories, they tend to be oriented toward narrow clinical use cases or offer closed ecosystems around proprietary formats. Few solutions exist for networking digital pathology operations. Here we present a system architecture and implementation of a digital pathology network and share results from a production system that federates major research centers.

A Flexible, Open, Decentralized System for Digital Pathology Networks

PubMed Central

SMITH, David E.; KUMARAGURUPARAN, Gowri; CHERVENAK, Ann; LEWIS, Anne D.; HYDE, Dallas M.; KESSELMAN, Carl

2014-01-01

High-resolution digital imaging is enabling digital archiving and sharing of digitized microscopy slides and new methods for digital pathology. Collaborative research centers, outsourced medical services, and multi-site organizations stand to benefit from sharing pathology data in a digital pathology network. Yet significant technological challenges remain due to the large size and volume of digitized whole slide images. While information systems do exist for managing local pathology laboratories, they tend to be oriented toward narrow clinical use cases or offer closed ecosystems around proprietary formats. Few solutions exist for networking digital pathology operations. Here we present a system architecture and implementation of a digital pathology network and share results from a production system that federates major research centers. PMID:22941985

Neural networks for data mining electronic text collections

NASA Astrophysics Data System (ADS)

Walker, Nicholas; Truman, Gregory

1997-04-01

The use of neural networks in information retrieval and text analysis has primarily suffered from the issues of adequate document representation, the ability to scale to very large collections, dynamism in the face of new information and the practical difficulties of basing the design on the use of supervised training sets. Perhaps the most important approach to begin solving these problems is the use of `intermediate entities' which reduce the dimensionality of document representations and the size of documents collections to manageable levels coupled with the use of unsupervised neural network paradigms. This paper describes the issues, a fully configured neural network-based text analysis system--dataHARVEST--aimed at data mining text collections which begins this process, along with the remaining difficulties and potential ways forward.

Influence maximization in complex networks through optimal percolation

NASA Astrophysics Data System (ADS)

Morone, Flaviano; Makse, Hernán A.

2015-08-01

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Influence maximization in complex networks through optimal percolation.

PubMed

Morone, Flaviano; Makse, Hernán A

2015-08-06

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Object recognition using deep convolutional neural networks with complete transfer and partial frozen layers

NASA Astrophysics Data System (ADS)

Kruithof, Maarten C.; Bouma, Henri; Fischer, Noëlle M.; Schutte, Klamer

2016-10-01

Object recognition is important to understand the content of video and allow flexible querying in a large number of cameras, especially for security applications. Recent benchmarks show that deep convolutional neural networks are excellent approaches for object recognition. This paper describes an approach of domain transfer, where features learned from a large annotated dataset are transferred to a target domain where less annotated examples are available as is typical for the security and defense domain. Many of these networks trained on natural images appear to learn features similar to Gabor filters and color blobs in the first layer. These first-layer features appear to be generic for many datasets and tasks while the last layer is specific. In this paper, we study the effect of copying all layers and fine-tuning a variable number. We performed an experiment with a Caffe-based network on 1000 ImageNet classes that are randomly divided in two equal subgroups for the transfer from one to the other. We copy all layers and vary the number of layers that is fine-tuned and the size of the target dataset. We performed additional experiments with the Keras platform on CIFAR-10 dataset to validate general applicability. We show with both platforms and both datasets that the accuracy on the target dataset improves when more target data is used. When the target dataset is large, it is beneficial to freeze only a few layers. For a large target dataset, the network without transfer learning performs better than the transfer network, especially if many layers are frozen. When the target dataset is small, it is beneficial to transfer (and freeze) many layers. For a small target dataset, the transfer network boosts generalization and it performs much better than the network without transfer learning. Learning time can be reduced by freezing many layers in a network.

Injection Drug Users’ Involvement In Drug Economy: Dynamics of Sociometric and Egocentric Social Networks

PubMed Central

Yang, Cui; Latkin, Carl; Muth, Stephen Q.; Rudolph, Abby

2014-01-01

The purpose of this analysis was to examine the effect of social network cohesiveness on drug economy involvement, and to test whether this relationship is mediated by drug support network size in a sample of active injection drug users. Involvement in the drug economy was defined by self-report of participation in at least one of the following activities: selling drugs, holding drugs or money for drugs, providing street security for drug sellers, cutting/packaging/cooking drugs, selling or renting drug paraphernalia (e.g., pipes, tools, rigs), and injecting drugs in others’ veins. The sample consists of 273 active injection drug users in Baltimore, Maryland who reported having injected drugs in the last 6 months and were recruited through either street outreach or by their network members. Egocentric drug support networks were assessed through a social network inventory at baseline. Sociometric networks were built upon the linkages by selected matching characteristics, and k-plex rank was used to characterize the level of cohesiveness of the individual to others in the social network. Although no direct effect was observed, structural equation modeling indicated k-plex rank was indirectly associated with drug economy involvement through drug support network size. These findings suggest the effects of large-scale sociometric networks on injectors’ drug economy involvement may occur through their immediate egocentric networks. Future harm reduction programs for injection drug users (IDUs) should consider providing programs coupled with economic opportunities to those drug users within a cohesive network subgroup. Moreover, individuals with a high connectivity to others in their network may be optimal individuals to train for diffusing HIV prevention messages. PMID:25309015

Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks.

PubMed

Adalsteinsson, David; McMillen, David; Elston, Timothy C

2004-03-08

Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA) molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. We have developed the software package Biochemical Network Stochastic Simulator (BioNetS) for efficiently and accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous) for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solves the appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

PubMed

Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

2014-06-26

A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra

PubMed Central

2014-01-01

Background A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. Results This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. Conclusions The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem. PMID:24965213

Estimating network parameters from combined dynamics of firing rate and irregularity of single neurons.

PubMed

Hamaguchi, Kosuke; Riehle, Alexa; Brunel, Nicolas

2011-01-01

High firing irregularity is a hallmark of cortical neurons in vivo, and modeling studies suggest a balance of excitation and inhibition is necessary to explain this high irregularity. Such a balance must be generated, at least partly, from local interconnected networks of excitatory and inhibitory neurons, but the details of the local network structure are largely unknown. The dynamics of the neural activity depends on the local network structure; this in turn suggests the possibility of estimating network structure from the dynamics of the firing statistics. Here we report a new method to estimate properties of the local cortical network from the instantaneous firing rate and irregularity (CV(2)) under the assumption that recorded neurons are a part of a randomly connected sparse network. The firing irregularity, measured in monkey motor cortex, exhibits two features; many neurons show relatively stable firing irregularity in time and across different task conditions; the time-averaged CV(2) is widely distributed from quasi-regular to irregular (CV(2) = 0.3-1.0). For each recorded neuron, we estimate the three parameters of a local network [balance of local excitation-inhibition, number of recurrent connections per neuron, and excitatory postsynaptic potential (EPSP) size] that best describe the dynamics of the measured firing rates and irregularities. Our analysis shows that optimal parameter sets form a two-dimensional manifold in the three-dimensional parameter space that is confined for most of the neurons to the inhibition-dominated region. High irregularity neurons tend to be more strongly connected to the local network, either in terms of larger EPSP and inhibitory PSP size or larger number of recurrent connections, compared with the low irregularity neurons, for a given excitatory/inhibitory balance. Incorporating either synaptic short-term depression or conductance-based synapses leads many low CV(2) neurons to move to the excitation-dominated region as well as to an increase of EPSP size.

Fault tolerance of artificial neural networks with applications in critical systems

NASA Technical Reports Server (NTRS)

Protzel, Peter W.; Palumbo, Daniel L.; Arras, Michael K.

1992-01-01

This paper investigates the fault tolerance characteristics of time continuous recurrent artificial neural networks (ANN) that can be used to solve optimization problems. The principle of operations and performance of these networks are first illustrated by using well-known model problems like the traveling salesman problem and the assignment problem. The ANNs are then subjected to 13 simultaneous 'stuck at 1' or 'stuck at 0' faults for network sizes of up to 900 'neurons'. The effects of these faults is demonstrated and the cause for the observed fault tolerance is discussed. An application is presented in which a network performs a critical task for a real-time distributed processing system by generating new task allocations during the reconfiguration of the system. The performance degradation of the ANN under the presence of faults is investigated by large-scale simulations, and the potential benefits of delegating a critical task to a fault tolerant network are discussed.

Low-cost Large Aperture Telescopes for Optical Communications

NASA Technical Reports Server (NTRS)

Hemmati, Hamid

2006-01-01

Low-cost, large-aperture optical receivers are required to form an affordable optical ground receiver network for laser communications. Among the ground receiver station's multiple subsystems, here, we only discuss the ongoing research activities aimed at reducing the cost of the large-size optics on the receiver. Experimental results of two different approaches for fabricating low-cost mirrors of wavefront quality on the order of 100-200X the diffraction limit are described. Laboratory-level effort are underway to improve the surface figure to better than 20X the diffraction limit.

Mechanics of membrane bulging during cell-wall disruption in Gram-negative bacteria

NASA Astrophysics Data System (ADS)

Daly, Kristopher E.; Huang, Kerwyn Casey; Wingreen, Ned S.; Mukhopadhyay, Ranjan

2011-04-01

The bacterial cell wall is a network of sugar strands crosslinked by peptides that serve as the primary structure for bearing osmotic stress. Despite its importance in cellular survival, the robustness of the cell wall to network defects has been relatively unexplored. Treatment of the Gram-negative bacterium Escherichia coli with the antibiotic vancomycin, which disrupts the crosslinking of new material during growth, leads to the development of pronounced bulges and eventually of cell lysis. Here, we model the mechanics of the bulging of the cytoplasmic membrane through pores in the cell wall. We find that the membrane undergoes a transition between a nearly flat state and a spherical bulge at a critical pore radius of ~20 nm. This critical pore size is large compared to the typical distance between neighboring peptides and glycan strands, and hence pore size acts as a constraint on network integrity. We also discuss the general implications of our model to membrane deformations in eukaryotic blebbing and vesiculation in red blood cells.

Mobile visual communications and displays

NASA Astrophysics Data System (ADS)

Valliath, George T.

2004-09-01

The different types of mobile visual communication modes and the types of displays needed in cellular handsets are explored. The well-known 2-way video conferencing is only one of the possible modes. Some modes are already supported on current handsets while others need the arrival of advanced network capabilities to be supported. Displays for devices that support these visual communication modes need to deliver the required visual experience. Over the last 20 years the display has grown in size while the rest of the handset has shrunk. However, the display is still not large enough - the processor performance and network capabilities continue to outstrip the display ability. This makes the display a bottleneck. This paper will explore potential solutions to a small large image on a small handset.

Are Social Networking Sites Making Health Behavior Change Interventions More Effective? A Meta-Analytic Review.

PubMed

Yang, Qinghua

2017-03-01

The increasing popularity of social networking sites (SNSs) has drawn scholarly attention in recent years, and a large amount of efforts have been made in applying SNSs to health behavior change interventions. However, these interventions showed mixed results, with a large variance of effect sizes in Cohen's d ranging from -1.17 to 1.28. To provide a better understanding of SNS-based interventions' effectiveness, a meta-analysis of 21 studies examining the effects of health interventions using SNS was conducted. Results indicated that health behavior change interventions using SNS are effective in general, but the effects were moderated by health topic, methodological features, and participant features. Theoretical and practical implications of findings are discussed.

A decentralized approach to reducing the social costs of cascading failures

NASA Astrophysics Data System (ADS)

Hines, Paul

Large cascading failures in electrical power networks come with enormous social costs. These can be direct financial costs, such as the loss of refrigerated foods in grocery stores, or more indirect social costs, such as the traffic congestion that results from the failure of traffic signals. While engineers and policy makers have made numerous technical and organizational changes to reduce the frequency and impact of large cascading failures, the existing data, as described in Chapter 2 of this work, indicate that the overall frequency and impact of large electrical blackouts in the United States are not decreasing. Motivated by the cascading failure problem, this thesis describes a new method for Distributed Model Predictive Control and a power systems application. The central goal of the method, when applied to power systems, is to reduce the social costs of cascading failures by making small, targeted reductions in load and generation and changes to generator voltage set points. Unlike some existing schemes that operate from centrally located control centers, the method is operated by software agents located at substations distributed throughout the power network. The resulting multi-agent control system is a new approach to decentralized control, combining Distributed Model Predictive Control and Reciprocal Altruism. Experimental results indicate that this scheme can in fact decrease the average size, and thus social costs, of cascading failures. Over 100 randomly generated disturbances to a model of the IEEE 300 bus test network, the method resulted in nearly an order of magnitude decrease in average event size (measured in cost) relative to cascading failure simulations without remedial control actions. Additionally, the communication requirements for the method are measured, and found to be within the bandwidth capabilities of current communications technology (on the order of 100kB/second). Experiments on several resistor networks with varying structures, including a random graph, a scale-free network and a power grid indicate that the effectiveness of decentralized control schemes, like the method proposed here, is a function of the structure of the network that is to be controlled.

SIR rumor spreading model considering the effect of difference in nodes’ identification capabilities

NASA Astrophysics Data System (ADS)

Wang, Ya-Qi; Wang, Jing

In this paper, we study the effect of difference in network nodes’ identification capabilities on rumor propagation. A novel susceptible-infected-removed (SIR) model is proposed, based on the mean-field theory, to investigate the dynamical behaviors of such model on homogeneous networks and inhomogeneous networks, respectively. Theoretical analysis and simulation results demonstrate that when we consider the influence of difference in nodes’ identification capabilities, the critical thresholds obviously increase, but the final rumor sizes are apparently reduced. We also find that the difference in nodes’ identification capabilities prolongs the time of rumor propagation reaching a steady state, and decreases the number of nodes that finally accept rumors. Additionally, under the influence of difference of nodes’ identification capabilities, compared with the homogeneous networks, the rumor transmission rate on the inhomogeneous networks is relatively large.

Inverse targeting —An effective immunization strategy

NASA Astrophysics Data System (ADS)

Schneider, C. M.; Mihaljev, T.; Herrmann, H. J.

2012-05-01

We propose a new method to immunize populations or computer networks against epidemics which is more efficient than any continuous immunization method considered before. The novelty of our method resides in the way of determining the immunization targets. First we identify those individuals or computers that contribute the least to the disease spreading measured through their contribution to the size of the largest connected cluster in the social or a computer network. The immunization process follows the list of identified individuals or computers in inverse order, immunizing first those which are most relevant for the epidemic spreading. We have applied our immunization strategy to several model networks and two real networks, the Internet and the collaboration network of high-energy physicists. We find that our new immunization strategy is in the case of model networks up to 14%, and for real networks up to 33% more efficient than immunizing dynamically the most connected nodes in a network. Our strategy is also numerically efficient and can therefore be applied to large systems.

Neuronal avalanches of a self-organized neural network with active-neuron-dominant structure.

PubMed

Li, Xiumin; Small, Michael

2012-06-01

Neuronal avalanche is a spontaneous neuronal activity which obeys a power-law distribution of population event sizes with an exponent of -3/2. It has been observed in the superficial layers of cortex both in vivo and in vitro. In this paper, we analyze the information transmission of a novel self-organized neural network with active-neuron-dominant structure. Neuronal avalanches can be observed in this network with appropriate input intensity. We find that the process of network learning via spike-timing dependent plasticity dramatically increases the complexity of network structure, which is finally self-organized to be active-neuron-dominant connectivity. Both the entropy of activity patterns and the complexity of their resulting post-synaptic inputs are maximized when the network dynamics are propagated as neuronal avalanches. This emergent topology is beneficial for information transmission with high efficiency and also could be responsible for the large information capacity of this network compared with alternative archetypal networks with different neural connectivity.

A framework for analyzing contagion in assortative banking networks

PubMed Central

Hurd, Thomas R.; Gleeson, James P.; Melnik, Sergey

2017-01-01

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R0 in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk. PMID:28231324

Social networks and treatment adherence among Latino offenders with mental illness.

PubMed

Eno Louden, Jennifer; Manchak, Sarah M

2018-02-01

Mental health treatment adherence is often required for offenders with mental illness supervised on probation and parole. However, research on offenders with mental illness has largely overlooked cultural and ethnic responsivity factors that may affect adherence to treatment. Latinos are a quickly growing subgroup of offenders whose social networks differ in meaningful ways from European Americans' (e.g., size, composition, centrality of family). Social networks are known to relate to both clinical and criminal justice outcomes for offenders with mental illness, and there are features of nonoffender Latinos' social networks that suggest that findings distilled from work with non-Latino offenders may not apply to them. The present study examined the social networks of 86 Latino probationers with serious mental illness to (a) describe the size and composition of these networks and (b) to determine which factors of social networks are related to treatment adherence. The authors found that Latino offenders' social networks are small (∼6 individuals), consisting primarily of family and professionals such as treatment providers and probation officers. Supportive relationships with nonprofessionals and treatment providers was related to lower likelihood of missing treatment appointments, whereas social control and pressure from family and friends to attend treatment was not related to treatment adherence. Findings are discussed within the context of improved practices for community corrections and mental health agencies in working with Latino offenders with mental illness. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

A framework for analyzing contagion in assortative banking networks.

PubMed

Hurd, Thomas R; Gleeson, James P; Melnik, Sergey

2017-01-01

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R0 in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk.

Late Noachian fluvial erosion on Mars: Cumulative water volumes required to carve the valley networks and grain size of bed-sediment

NASA Astrophysics Data System (ADS)

Rosenberg, Eliott N.; Head, James W., III

2015-11-01

Our goal is to quantify the cumulative water volume that was required to carve the Late Noachian valley networks on Mars. We employ an improved methodology in which fluid/sediment flux ratios are based on empirical data, not assumed. We use a large quantity of data from terrestrial rivers to assess the variability of actual fluid/sediment flux sediment ratios. We find the flow depth by using an empirical relationship to estimate the fluid flux from the estimated channel width, and then using estimated grain sizes (theoretical sediment grain size predictions and comparison with observations by the Curiosity rover) to find the flow depth to which the resulting fluid flux corresponds. Assuming that the valley networks contained alluvial bed rivers, we find, from their current slopes and widths, that the onset of suspended transport occurs near the sand-gravel boundary. Thus, any bed sediment must have been fine gravel or coarser, whereas fine sediment would be carried downstream. Subsequent to the cessation of fluvial activity, aeolian processes have partially redistributed fine-grain particles in the valleys, often forming dunes. It seems likely that the dominant bed sediment size was near the threshold for suspension, and assuming that this was the case could make our final results underestimates, which is the same tendency that our other assumptions have. Making this assumption, we find a global equivalent layer (GEL) of 3-100 m of water to be the most probable cumulative volume that passed through the valley networks. This value is similar to the ∼34 m water GEL currently on the surface and in the near-surface in the form of ice. Note that the amount of water required to carve the valley networks could represent the same water recycled through a surface valley network hydrological system many times in separate or continuous precipitation/runoff/collection/evaporation/precipitation cycles.

The State of Planning of Automation Projects in the Libraries of Canada.

ERIC Educational Resources Information Center

Clement, Hope E. A.

Library automation in Canada is complicated by the large size, dispersed population, and cultural diversity of the country. The National Library of Canada is actively planning a Canadian library network based on national bibliographic services for which the library is now developing automated systems. Canadian libraries are involved in the…

Emergent patterns in interacting neuronal sub-populations

NASA Astrophysics Data System (ADS)

Kamal, Neeraj Kumar; Sinha, Sudeshna

2015-05-01

We investigate an ensemble of coupled model neurons, consisting of groups of varying sizes and intrinsic dynamics, ranging from periodic to chaotic, where the inter-group coupling interaction is effectively like a dynamic signal from a different sub-population. We observe that the minority group can significantly influence the majority group. For instance, when a small chaotic group is coupled to a large periodic group, the chaotic group de-synchronizes. However, counter-intuitively, when a small periodic group couples strongly to a large chaotic group, it leads to complete synchronization in the majority chaotic population, which also spikes at the frequency of the small periodic group. It then appears that the small group of periodic neurons can act like a pacemaker for the whole network. Further, we report the existence of varied clustering patterns, ranging from sets of synchronized clusters to anti-phase clusters, governed by the interplay of the relative sizes and dynamics of the sub-populations. So these results have relevance in understanding how a group can influence the synchrony of another group of dynamically different elements, reminiscent of event-related synchronization/de-synchronization in complex networks.

Maximizing capture of gene co-expression relationships through pre-clustering of input expression samples: an Arabidopsis case study.

PubMed

Feltus, F Alex; Ficklin, Stephen P; Gibson, Scott M; Smith, Melissa C

2013-06-05

In genomics, highly relevant gene interaction (co-expression) networks have been constructed by finding significant pair-wise correlations between genes in expression datasets. These networks are then mined to elucidate biological function at the polygenic level. In some cases networks may be constructed from input samples that measure gene expression under a variety of different conditions, such as for different genotypes, environments, disease states and tissues. When large sets of samples are obtained from public repositories it is often unmanageable to associate samples into condition-specific groups, and combining samples from various conditions has a negative effect on network size. A fixed significance threshold is often applied also limiting the size of the final network. Therefore, we propose pre-clustering of input expression samples to approximate condition-specific grouping of samples and individual network construction of each group as a means for dynamic significance thresholding. The net effect is increase sensitivity thus maximizing the total co-expression relationships in the final co-expression network compendium. A total of 86 Arabidopsis thaliana co-expression networks were constructed after k-means partitioning of 7,105 publicly available ATH1 Affymetrix microarray samples. We term each pre-sorted network a Gene Interaction Layer (GIL). Random Matrix Theory (RMT), an un-supervised thresholding method, was used to threshold each of the 86 networks independently, effectively providing a dynamic (non-global) threshold for the network. The overall gene count across all GILs reached 19,588 genes (94.7% measured gene coverage) and 558,022 unique co-expression relationships. In comparison, network construction without pre-sorting of input samples yielded only 3,297 genes (15.9%) and 129,134 relationships. in the global network. Here we show that pre-clustering of microarray samples helps approximate condition-specific networks and allows for dynamic thresholding using un-supervised methods. Because RMT ensures only highly significant interactions are kept, the GIL compendium consists of 558,022 unique high quality A. thaliana co-expression relationships across almost all of the measurable genes on the ATH1 array. For A. thaliana, these networks represent the largest compendium to date of significant gene co-expression relationships, and are a means to explore complex pathway, polygenic, and pleiotropic relationships for this focal model plant. The networks can be explored at sysbio.genome.clemson.edu. Finally, this method is applicable to any large expression profile collection for any organism and is best suited where a knowledge-independent network construction method is desired.

Maximizing capture of gene co-expression relationships through pre-clustering of input expression samples: an Arabidopsis case study

PubMed Central

2013-01-01

Background In genomics, highly relevant gene interaction (co-expression) networks have been constructed by finding significant pair-wise correlations between genes in expression datasets. These networks are then mined to elucidate biological function at the polygenic level. In some cases networks may be constructed from input samples that measure gene expression under a variety of different conditions, such as for different genotypes, environments, disease states and tissues. When large sets of samples are obtained from public repositories it is often unmanageable to associate samples into condition-specific groups, and combining samples from various conditions has a negative effect on network size. A fixed significance threshold is often applied also limiting the size of the final network. Therefore, we propose pre-clustering of input expression samples to approximate condition-specific grouping of samples and individual network construction of each group as a means for dynamic significance thresholding. The net effect is increase sensitivity thus maximizing the total co-expression relationships in the final co-expression network compendium. Results A total of 86 Arabidopsis thaliana co-expression networks were constructed after k-means partitioning of 7,105 publicly available ATH1 Affymetrix microarray samples. We term each pre-sorted network a Gene Interaction Layer (GIL). Random Matrix Theory (RMT), an un-supervised thresholding method, was used to threshold each of the 86 networks independently, effectively providing a dynamic (non-global) threshold for the network. The overall gene count across all GILs reached 19,588 genes (94.7% measured gene coverage) and 558,022 unique co-expression relationships. In comparison, network construction without pre-sorting of input samples yielded only 3,297 genes (15.9%) and 129,134 relationships. in the global network. Conclusions Here we show that pre-clustering of microarray samples helps approximate condition-specific networks and allows for dynamic thresholding using un-supervised methods. Because RMT ensures only highly significant interactions are kept, the GIL compendium consists of 558,022 unique high quality A. thaliana co-expression relationships across almost all of the measurable genes on the ATH1 array. For A. thaliana, these networks represent the largest compendium to date of significant gene co-expression relationships, and are a means to explore complex pathway, polygenic, and pleiotropic relationships for this focal model plant. The networks can be explored at sysbio.genome.clemson.edu. Finally, this method is applicable to any large expression profile collection for any organism and is best suited where a knowledge-independent network construction method is desired. PMID:23738693

Pruning artificial neural networks using neural complexity measures.

PubMed

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

2008-10-01

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

Classification of 2-dimensional array patterns: assembling many small neural networks is better than using a large one.

PubMed

Chen, Liang; Xue, Wei; Tokuda, Naoyuki

2010-08-01

In many pattern classification/recognition applications of artificial neural networks, an object to be classified is represented by a fixed sized 2-dimensional array of uniform type, which corresponds to the cells of a 2-dimensional grid of the same size. A general neural network structure, called an undistricted neural network, which takes all the elements in the array as inputs could be used for problems such as these. However, a districted neural network can be used to reduce the training complexity. A districted neural network usually consists of two levels of sub-neural networks. Each of the lower level neural networks, called a regional sub-neural network, takes the elements in a region of the array as its inputs and is expected to output a temporary class label, called an individual opinion, based on the partial information of the entire array. The higher level neural network, called an assembling sub-neural network, uses the outputs (opinions) of regional sub-neural networks as inputs, and by consensus derives the label decision for the object. Each of the sub-neural networks can be trained separately and thus the training is less expensive. The regional sub-neural networks can be trained and performed in parallel and independently, therefore a high speed can be achieved. We prove theoretically in this paper, using a simple model, that a districted neural network is actually more stable than an undistricted neural network in noisy environments. We conjecture that the result is valid for all neural networks. This theory is verified by experiments involving gender classification and human face recognition. We conclude that a districted neural network is highly recommended for neural network applications in recognition or classification of 2-dimensional array patterns in highly noisy environments. Copyright (c) 2010 Elsevier Ltd. All rights reserved.

Decay of interspecific avian flock networks along a disturbance gradient in Amazonia.

PubMed

Mokross, Karl; Ryder, Thomas B; Côrtes, Marina Corrêa; Wolfe, Jared D; Stouffer, Philip C

2014-02-07

Our understanding of how anthropogenic habitat change shapes species interactions is in its infancy. This is in large part because analytical approaches such as network theory have only recently been applied to characterize complex community dynamics. Network models are a powerful tool for quantifying how ecological interactions are affected by habitat modification because they provide metrics that quantify community structure and function. Here, we examine how large-scale habitat alteration has affected ecological interactions among mixed-species flocking birds in Amazonian rainforest. These flocks provide a model system for investigating how habitat heterogeneity influences non-trophic interactions and the subsequent social structure of forest-dependent mixed-species bird flocks. We analyse 21 flock interaction networks throughout a mosaic of primary forest, fragments of varying sizes and secondary forest (SF) at the Biological Dynamics of Forest Fragments Project in central Amazonian Brazil. Habitat type had a strong effect on network structure at the levels of both species and flock. Frequency of associations among species, as summarized by weighted degree, declined with increasing levels of forest fragmentation and SF. At the flock level, clustering coefficients and overall attendance positively correlated with mean vegetation height, indicating a strong effect of habitat structure on flock cohesion and stability. Prior research has shown that trophic interactions are often resilient to large-scale changes in habitat structure because species are ecologically redundant. By contrast, our results suggest that behavioural interactions and the structure of non-trophic networks are highly sensitive to environmental change. Thus, a more nuanced, system-by-system approach may be needed when thinking about the resiliency of ecological networks.

Coarse-Grained Clustering Dynamics of Heterogeneously Coupled Neurons.

PubMed

Moon, Sung Joon; Cook, Katherine A; Rajendran, Karthikeyan; Kevrekidis, Ioannis G; Cisternas, Jaime; Laing, Carlo R

2015-12-01

The formation of oscillating phase clusters in a network of identical Hodgkin-Huxley neurons is studied, along with their dynamic behavior. The neurons are synaptically coupled in an all-to-all manner, yet the synaptic coupling characteristic time is heterogeneous across the connections. In a network of N neurons where this heterogeneity is characterized by a prescribed random variable, the oscillatory single-cluster state can transition-through [Formula: see text] (possibly perturbed) period-doubling and subsequent bifurcations-to a variety of multiple-cluster states. The clustering dynamic behavior is computationally studied both at the detailed and the coarse-grained levels, and a numerical approach that can enable studying the coarse-grained dynamics in a network of arbitrarily large size is suggested. Among a number of cluster states formed, double clusters, composed of nearly equal sub-network sizes are seen to be stable; interestingly, the heterogeneity parameter in each of the double-cluster components tends to be consistent with the random variable over the entire network: Given a double-cluster state, permuting the dynamical variables of the neurons can lead to a combinatorially large number of different, yet similar "fine" states that appear practically identical at the coarse-grained level. For weak heterogeneity we find that correlations rapidly develop, within each cluster, between the neuron's "identity" (its own value of the heterogeneity parameter) and its dynamical state. For single- and double-cluster states we demonstrate an effective coarse-graining approach that uses the Polynomial Chaos expansion to succinctly describe the dynamics by these quickly established "identity-state" correlations. This coarse-graining approach is utilized, within the equation-free framework, to perform efficient computations of the neuron ensemble dynamics.

Design and implementation of a UNIX based distributed computing system

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

Love, J.S.; Michael, M.W.

1994-12-31

We have designed, implemented, and are running a corporate-wide distributed processing batch queue on a large number of networked workstations using the UNIX{reg_sign} operating system. Atlas Wireline researchers and scientists have used the system for over a year. The large increase in available computer power has greatly reduced the time required for nuclear and electromagnetic tool modeling. Use of remote distributed computing has simultaneously reduced computation costs and increased usable computer time. The system integrates equipment from different manufacturers, using various CPU architectures, distinct operating system revisions, and even multiple processors per machine. Various differences between the machines have tomore » be accounted for in the master scheduler. These differences include shells, command sets, swap spaces, memory sizes, CPU sizes, and OS revision levels. Remote processing across a network must be performed in a manner that is seamless from the users` perspective. The system currently uses IBM RISC System/6000{reg_sign}, SPARCstation{sup TM}, HP9000s700, HP9000s800, and DEC Alpha AXP{sup TM} machines. Each CPU in the network has its own speed rating, allowed working hours, and workload parameters. The system if designed so that all of the computers in the network can be optimally scheduled without adversely impacting the primary users of the machines. The increase in the total usable computational capacity by means of distributed batch computing can change corporate computing strategy. The integration of disparate computer platforms eliminates the need to buy one type of computer for computations, another for graphics, and yet another for day-to-day operations. It might be possible, for example, to meet all research and engineering computing needs with existing networked computers.« less

Digital Image Compression Using Artificial Neural Networks

NASA Technical Reports Server (NTRS)

Serra-Ricart, M.; Garrido, L.; Gaitan, V.; Aloy, A.

1993-01-01

The problem of storing, transmitting, and manipulating digital images is considered. Because of the file sizes involved, large amounts of digitized image information are becoming common in modern projects. Our goal is to described an image compression transform coder based on artificial neural networks techniques (NNCTC). A comparison of the compression results obtained from digital astronomical images by the NNCTC and the method used in the compression of the digitized sky survey from the Space Telescope Science Institute based on the H-transform is performed in order to assess the reliability of the NNCTC.

Towards a theory of cortical columns: From spiking neurons to interacting neural populations of finite size.

PubMed

Schwalger, Tilo; Deger, Moritz; Gerstner, Wulfram

2017-04-01

Neural population equations such as neural mass or field models are widely used to study brain activity on a large scale. However, the relation of these models to the properties of single neurons is unclear. Here we derive an equation for several interacting populations at the mesoscopic scale starting from a microscopic model of randomly connected generalized integrate-and-fire neuron models. Each population consists of 50-2000 neurons of the same type but different populations account for different neuron types. The stochastic population equations that we find reveal how spike-history effects in single-neuron dynamics such as refractoriness and adaptation interact with finite-size fluctuations on the population level. Efficient integration of the stochastic mesoscopic equations reproduces the statistical behavior of the population activities obtained from microscopic simulations of a full spiking neural network model. The theory describes nonlinear emergent dynamics such as finite-size-induced stochastic transitions in multistable networks and synchronization in balanced networks of excitatory and inhibitory neurons. The mesoscopic equations are employed to rapidly integrate a model of a cortical microcircuit consisting of eight neuron types, which allows us to predict spontaneous population activities as well as evoked responses to thalamic input. Our theory establishes a general framework for modeling finite-size neural population dynamics based on single cell and synapse parameters and offers an efficient approach to analyzing cortical circuits and computations.

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

NASA Technical Reports Server (NTRS)

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 the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

Classification of breast MRI lesions using small-size training sets: comparison of deep learning approaches

NASA Astrophysics Data System (ADS)

Amit, Guy; Ben-Ari, Rami; Hadad, Omer; Monovich, Einat; Granot, Noa; Hashoul, Sharbell

2017-03-01

Diagnostic interpretation of breast MRI studies requires meticulous work and a high level of expertise. Computerized algorithms can assist radiologists by automatically characterizing the detected lesions. Deep learning approaches have shown promising results in natural image classification, but their applicability to medical imaging is limited by the shortage of large annotated training sets. In this work, we address automatic classification of breast MRI lesions using two different deep learning approaches. We propose a novel image representation for dynamic contrast enhanced (DCE) breast MRI lesions, which combines the morphological and kinetics information in a single multi-channel image. We compare two classification approaches for discriminating between benign and malignant lesions: training a designated convolutional neural network and using a pre-trained deep network to extract features for a shallow classifier. The domain-specific trained network provided higher classification accuracy, compared to the pre-trained model, with an area under the ROC curve of 0.91 versus 0.81, and an accuracy of 0.83 versus 0.71. Similar accuracy was achieved in classifying benign lesions, malignant lesions, and normal tissue images. The trained network was able to improve accuracy by using the multi-channel image representation, and was more robust to reductions in the size of the training set. A small-size convolutional neural network can learn to accurately classify findings in medical images using only a few hundred images from a few dozen patients. With sufficient data augmentation, such a network can be trained to outperform a pre-trained out-of-domain classifier. Developing domain-specific deep-learning models for medical imaging can facilitate technological advancements in computer-aided diagnosis.

Avoiding the Enumeration of Infeasible Elementary Flux Modes by Including Transcriptional Regulatory Rules in the Enumeration Process Saves Computational Costs

PubMed Central

Jungreuthmayer, Christian; Ruckerbauer, David E.; Gerstl, Matthias P.; Hanscho, Michael; Zanghellini, Jürgen

2015-01-01

Despite the significant progress made in recent years, the computation of the complete set of elementary flux modes of large or even genome-scale metabolic networks is still impossible. We introduce a novel approach to speed up the calculation of elementary flux modes by including transcriptional regulatory information into the analysis of metabolic networks. Taking into account gene regulation dramatically reduces the solution space and allows the presented algorithm to constantly eliminate biologically infeasible modes at an early stage of the computation procedure. Thereby, computational costs, such as runtime, memory usage, and disk space, are extremely reduced. Moreover, we show that the application of transcriptional rules identifies non-trivial system-wide effects on metabolism. Using the presented algorithm pushes the size of metabolic networks that can be studied by elementary flux modes to new and much higher limits without the loss of predictive quality. This makes unbiased, system-wide predictions in large scale metabolic networks possible without resorting to any optimization principle. PMID:26091045

Analysis of 100Mb/s Ethernet for the Whitney Commodity Computing Testbed

NASA Technical Reports Server (NTRS)

Fineberg, Samuel A.; Pedretti, Kevin T.; Kutler, Paul (Technical Monitor)

1997-01-01

We evaluate the performance of a Fast Ethernet network configured with a single large switch, a single hub, and a 4x4 2D torus topology in a testbed cluster of "commodity" Pentium Pro PCs. We also evaluated a mixed network composed of ethernet hubs and switches. An MPI collective communication benchmark, and the NAS Parallel Benchmarks version 2.2 (NPB2) show that the torus network performs best for all sizes that we were able to test (up to 16 nodes). For larger networks the ethernet switch outperforms the hub, though its performance is far less than peak. The hub/switch combination tests indicate that the NAS parallel benchmarks are relatively insensitive to hub densities of less than 7 nodes per hub.

Inequality measures perform differently in global and local assessments: An exploratory computational experiment

NASA Astrophysics Data System (ADS)

Chiang, Yen-Sheng

2015-11-01

Inequality measures are widely used in both the academia and public media to help us understand how incomes and wealth are distributed. They can be used to assess the distribution of a whole society-global inequality-as well as inequality of actors' referent networks-local inequality. How different is local inequality from global inequality? Formalizing the structure of reference groups as a network, the paper conducted a computational experiment to see how the structure of complex networks influences the difference between global and local inequality assessed by a selection of inequality measures. It was found that local inequality tends to be higher than global inequality when population size is large; network is dense and heterophilously assorted, and income distribution is less dispersed. The implications of the simulation findings are discussed.

Extinction times of epidemic outbreaks in networks.

PubMed

Holme, Petter

2013-01-01

In the Susceptible-Infectious-Recovered (SIR) model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the population. Infections that are not contagious enough die out before they spread to a large fraction of people. We characterize how the maximal extinction time in SIR simulations on networks depend on the network structure. For example we find that the average distances in isolated components, weighted by the component size, is a good predictor of the maximal time to extinction. Furthermore, the transmission probability giving the longest outbreaks is larger than, but otherwise seemingly independent of, the epidemic threshold.

Aquatic Nitrate Retention at River Network Scales Across Flow Conditions Determined Using Nested In Situ Sensors

NASA Astrophysics Data System (ADS)

Wollheim, W. M.; Mulukutla, G. K.; Cook, C.; Carey, R. O.

2017-11-01

Nonpoint pollution sources are strongly influenced by hydrology and are therefore sensitive to climate variability. Some pollutants entering aquatic ecosystems, e.g., nitrate, can be mitigated by in-stream processes during transport through river networks. Whole river network nitrate retention is difficult to quantify with observations. High frequency, in situ nitrate sensors, deployed in nested locations within a single watershed, can improve estimates of both nonpoint inputs and aquatic retention at river network scales. We deployed a nested sensor network and associated sampling in the urbanizing Oyster River watershed in coastal New Hampshire, USA, to quantify storm event-scale loading and retention at network scales. An end member analysis used the relative behavior of reactive nitrate and conservative chloride to infer river network fate of nitrate. In the headwater catchments, nitrate and chloride concentrations are both increasingly diluted with increasing storm size. At the mouth of the watershed, chloride is also diluted, but nitrate tended to increase. The end member analysis suggests that this pattern is the result of high retention during small storms (51-78%) that declines to zero during large storms. Although high frequency nitrate sensors did not alter estimates of fluxes over seasonal time periods compared to less frequent grab sampling, they provide the ability to estimate nitrate flux versus storm size at event scales that is critical for such analyses. Nested sensor networks can improve understanding of the controls of both loading and network scale retention, and therefore also improve management of nonpoint source pollution.

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS

PubMed Central

Almquist, Zack W.; Butts, Carter T.

2015-01-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach. PMID:26120218

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS.

PubMed

Almquist, Zack W; Butts, Carter T

2014-08-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach.

Fractal multi-level organisation of human groups in a virtual world.

PubMed

Fuchs, Benedikt; Sornette, Didier; Thurner, Stefan

2014-10-06

Humans are fundamentally social. They form societies which consist of hierarchically layered nested groups of various quality, size, and structure. The anthropologic literature has classified these groups as support cliques, sympathy groups, bands, cognitive groups, tribes, linguistic groups, and so on. Anthropologic data show that, on average, each group consists of approximately three subgroups. However, a general understanding of the structural dependence of groups at different layers is largely missing. We extend these early findings to a very large high-precision large-scale internet-based social network data. We analyse the organisational structure of a complete, multi-relational, large social multiplex network of a human society consisting of about 400,000 odd players of an open-ended massive multiplayer online game for which we know all about their various group memberships at different layers. Remarkably, the online players' society exhibits the same type of structured hierarchical layers as found in hunter-gatherer societies. Our findings suggest that the hierarchical organisation of human society is deeply nested in human psychology.

Fractal multi-level organisation of human groups in a virtual world

PubMed Central

Fuchs, Benedikt; Sornette, Didier; Thurner, Stefan

2014-01-01

Humans are fundamentally social. They form societies which consist of hierarchically layered nested groups of various quality, size, and structure. The anthropologic literature has classified these groups as support cliques, sympathy groups, bands, cognitive groups, tribes, linguistic groups, and so on. Anthropologic data show that, on average, each group consists of approximately three subgroups. However, a general understanding of the structural dependence of groups at different layers is largely missing. We extend these early findings to a very large high-precision large-scale internet-based social network data. We analyse the organisational structure of a complete, multi-relational, large social multiplex network of a human society consisting of about 400,000 odd players of an open-ended massive multiplayer online game for which we know all about their various group memberships at different layers. Remarkably, the online players' society exhibits the same type of structured hierarchical layers as found in hunter-gatherer societies. Our findings suggest that the hierarchical organisation of human society is deeply nested in human psychology. PMID:25283998

Fractal multi-level organisation of human groups in a virtual world

NASA Astrophysics Data System (ADS)

Fuchs, Benedikt; Sornette, Didier; Thurner, Stefan

2014-10-01

Humans are fundamentally social. They form societies which consist of hierarchically layered nested groups of various quality, size, and structure. The anthropologic literature has classified these groups as support cliques, sympathy groups, bands, cognitive groups, tribes, linguistic groups, and so on. Anthropologic data show that, on average, each group consists of approximately three subgroups. However, a general understanding of the structural dependence of groups at different layers is largely missing. We extend these early findings to a very large high-precision large-scale internet-based social network data. We analyse the organisational structure of a complete, multi-relational, large social multiplex network of a human society consisting of about 400,000 odd players of an open-ended massive multiplayer online game for which we know all about their various group memberships at different layers. Remarkably, the online players' society exhibits the same type of structured hierarchical layers as found in hunter-gatherer societies. Our findings suggest that the hierarchical organisation of human society is deeply nested in human psychology.

Classification of brain MRI with big data and deep 3D convolutional neural networks

NASA Astrophysics Data System (ADS)

Wegmayr, Viktor; Aitharaju, Sai; Buhmann, Joachim

2018-02-01

Our ever-aging society faces the growing problem of neurodegenerative diseases, in particular dementia. Magnetic Resonance Imaging provides a unique tool for non-invasive investigation of these brain diseases. However, it is extremely difficult for neurologists to identify complex disease patterns from large amounts of three-dimensional images. In contrast, machine learning excels at automatic pattern recognition from large amounts of data. In particular, deep learning has achieved impressive results in image classification. Unfortunately, its application to medical image classification remains difficult. We consider two reasons for this difficulty: First, volumetric medical image data is considerably scarcer than natural images. Second, the complexity of 3D medical images is much higher compared to common 2D images. To address the problem of small data set size, we assemble the largest dataset ever used for training a deep 3D convolutional neural network to classify brain images as healthy (HC), mild cognitive impairment (MCI) or Alzheimers disease (AD). We use more than 20.000 images from subjects of these three classes, which is almost 9x the size of the previously largest data set. The problem of high dimensionality is addressed by using a deep 3D convolutional neural network, which is state-of-the-art in large-scale image classification. We exploit its ability to process the images directly, only with standard preprocessing, but without the need for elaborate feature engineering. Compared to other work, our workflow is considerably simpler, which increases clinical applicability. Accuracy is measured on the ADNI+AIBL data sets, and the independent CADDementia benchmark.

GPs’ use of defibrillators and the national radio network in emergency primary healthcare in Norway

PubMed Central

Zakariassen, Erik; Hunskaar, Steinar

2008-01-01

Objective To study the geographic size of out-of-hours districts, the availability of defibrillators and use of the national radio network in Norway. Design Survey. Setting The emergency primary healthcare system in Norway. Subjects A total of 282 host municipalities responsible for 260 out-of-hours districts. Main outcome measures Size of out-of-hours districts, use of national radio network and access to a defibrillator in emergency situations. Results The out-of-hours districts have a wide range of areas, which gives a large variation in driving time for doctors on call. The median longest transport time for doctors in Norway is 45 minutes. In 46% of out-of-hours districts doctors bring their own defibrillator on emergency callouts. Doctors always use the national radio network in 52% of out-of-hours districts. Use of the radio network and access to a defibrillator are significantly greater in out-of-hours districts with a host municipality of fewer then 5000 inhabitants compared with host municipalities of more than 20 000 inhabitants. Conclusion In half of out-of-hours districts doctors on call always use the national radio network. Doctors in out-of-hours districts with a host municipality of fewer than 5000 inhabitants are in a better state of readiness to attend an emergency, compared with doctors working in larger host municipalities. PMID:18570012

Drive to miniaturization: integrated optical networks on mobile platforms

NASA Astrophysics Data System (ADS)

Salour, Michael M.; Batayneh, Marwan; Figueroa, Luis

2011-11-01

With rapid growth of the Internet, bandwidth demand for data traffic is continuing to explode. In addition, emerging and future applications are becoming more and more network centric. With the proliferation of data communication platforms and data-intensive applications (e.g. cloud computing), high-bandwidth materials such as video clips dominating the Internet, and social networking tools, a networking technology is very desirable which can scale the Internet's capability (particularly its bandwidth) by two to three orders of magnitude. As the limits of Moore's law are approached, optical mesh networks based on wavelength-division multiplexing (WDM) have the ability to satisfy the large- and scalable-bandwidth requirements of our future backbone telecommunication networks. In addition, this trend is also affecting other special-purpose systems in applications such as mobile platforms, automobiles, aircraft, ships, tanks, and micro unmanned air vehicles (UAVs) which are becoming independent systems roaming the sky while sensing data, processing, making decisions, and even communicating and networking with other heterogeneous systems. Recently, WDM optical technologies have seen advances in its transmission speeds, switching technologies, routing protocols, and control systems. Such advances have made WDM optical technology an appealing choice for the design of future Internet architectures. Along these lines, scientists across the entire spectrum of the network architectures from physical layer to applications have been working on developing devices and communication protocols which can take full advantage of the rapid advances in WDM technology. Nevertheless, the focus has always been on large-scale telecommunication networks that span hundreds and even thousands of miles. Given these advances, we investigate the vision and applicability of integrating the traditionally large-scale WDM optical networks into miniaturized mobile platforms such as UAVs. We explain the benefits of WDM optical technology for these applications. We also describe some of the limitations of WDM optical networks as the size of a vehicle gets smaller, such as in micro-UAVs, and study the miniaturization and communication system limitations in such environments.

A dual-scale metal nanowire network transparent conductor for highly efficient and flexible organic light emitting diodes.

PubMed

Lee, Jinhwan; An, Kunsik; Won, Phillip; Ka, Yoonseok; Hwang, Hyejin; Moon, Hyunjin; Kwon, Yongwon; Hong, Sukjoon; Kim, Changsoon; Lee, Changhee; Ko, Seung Hwan

2017-02-02

Although solution processed metal nanowire (NW) percolation networks are a strong candidate to replace commercial indium tin oxide, their performance is limited in thin film device applications due to reduced effective electrical areas arising from the dimple structure and percolative voids that single size metal NW percolation networks inevitably possess. Here, we present a transparent electrode based on a dual-scale silver nanowire (AgNW) percolation network embedded in a flexible substrate to demonstrate a significant enhancement in the effective electrical area by filling the large percolative voids present in a long/thick AgNW network with short/thin AgNWs. As a proof of concept, the performance enhancement of a flexible phosphorescent OLED is demonstrated with the dual-scale AgNW percolation network compared to the previous mono-scale AgNWs. Moreover, we report that mechanical and oxidative robustness, which are critical for flexible OLEDs, are greatly increased by embedding the dual-scale AgNW network in a resin layer.

Information content of contact-pattern representations and predictability of epidemic outbreaks

PubMed Central

Holme, Petter

2015-01-01

To understand the contact patterns of a population—who is in contact with whom, and when the contacts happen—is crucial for modeling outbreaks of infectious disease. Traditional theoretical epidemiology assumes that any individual can meet any with equal probability. A more modern approach, network epidemiology, assumes people are connected into a static network over which the disease spreads. Newer yet, temporal network epidemiology, includes the time in the contact representations. In this paper, we investigate the effect of these successive inclusions of more information. Using empirical proximity data, we study both outbreak sizes from unknown sources, and from known states of ongoing outbreaks. In the first case, there are large differences going from a fully mixed simulation to a network, and from a network to a temporal network. In the second case, differences are smaller. We interpret these observations in terms of the temporal network structure of the data sets. For example, a fast overturn of nodes and links seem to make the temporal information more important. PMID:26403504

Why do Scale-Free Networks Emerge in Nature? From Gradient Networks to Transport Efficiency

NASA Astrophysics Data System (ADS)

Toroczkai, Zoltan

2004-03-01

It has recently been recognized [1,2,3] that a large number of complex networks are scale-free (having a power-law degree distribution). Examples include citation networks [4], the internet [5], the world-wide-web [6], cellular metabolic networks [7], protein interaction networks [8], the sex-web [9] and alliance networks in the U.S. biotechnology industry [10]. The existence of scale-free networks in such diverse systems suggests that there is a simple underlying common reason for their development. Here, we propose that scale-free networks emerge because they ensure efficient transport of some entity. We show that for flows generated by gradients of a scalar "potential'' distributed on a network, non scale-free networks, e.g., random graphs [11], will become maximally congested, while scale-free networks will ensure efficient transport in the large network size limit. [1] R. Albert and A.-L. Barabási, Rev.Mod.Phys. 74, 47 (2002). [2] M.E.J. Newman, SIAM Rev. 45, 167 (2003). [3] S.N. Dorogovtsev and J.F.F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford Univ. Press, Oxford, 2003. [4] S. Redner, Eur.Phys.J. B, 4, 131 (1998). [5] M. Faloutsos, P. Faloutsos and C. Faloutsos Comp.Comm.Rev. 29, 251 (1999). [6] R. Albert, H. Jeong, and A.L. Barabási, Nature 401, 130 (1999). [7] H. Jeong et.al. Nature 407, 651 (2000). [8] H. Jeong, S. Mason, A.-L. Barabási and Z. N. Oltvai, Nature 411, 41 (2001). [9] F. Liljeros et. al. Nature 411 907 (2000). [10] W. W. Powell, D. R. White, K. W. Koput and J. Owen-Smith Am.J.Soc. in press. [11] B. Bollobás, Random Graphs, Second Edition, Cambridge University Press (2001).

Latency-Efficient Communication in Wireless Mesh Networks under Consideration of Large Interference Range

NASA Astrophysics Data System (ADS)

Xin, Qin; Yao, Xiaolan; Engelstad, Paal E.

2010-09-01

Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study here the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc Wireless Mesh Networks (WMNs). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is well known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency-efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad-hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad-hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad-hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility-related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes.

Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes

NASA Astrophysics Data System (ADS)

Kyriakopoulos, Charalampos; Grossmann, Gerrit; Wolf, Verena; Bortolussi, Luca

2018-01-01

Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree kmax of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large kmax. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.

Cascades in the Threshold Model for varying system sizes

NASA Astrophysics Data System (ADS)

Karampourniotis, Panagiotis; Sreenivasan, Sameet; Szymanski, Boleslaw; Korniss, Gyorgy

2015-03-01

A classical model in opinion dynamics is the Threshold Model (TM) aiming to model the spread of a new opinion based on the social drive of peer pressure. Under the TM a node adopts a new opinion only when the fraction of its first neighbors possessing that opinion exceeds a pre-assigned threshold. Cascades in the TM depend on multiple parameters, such as the number and selection strategy of the initially active nodes (initiators), and the threshold distribution of the nodes. For a uniform threshold in the network there is a critical fraction of initiators for which a transition from small to large cascades occurs, which for ER graphs is largerly independent of the system size. Here, we study the spread contribution of each newly assigned initiator under the TM for different initiator selection strategies for synthetic graphs of various sizes. We observe that for ER graphs when large cascades occur, the spread contribution of the added initiator on the transition point is independent of the system size, while the contribution of the rest of the initiators converges to zero at infinite system size. This property is used for the identification of large transitions for various threshold distributions. Supported in part by ARL NS-CTA, ARO, ONR, and DARPA.

eqMAXEL: A new automatic earthquake location algorithm implementation for Earthworm

NASA Astrophysics Data System (ADS)

Lisowski, S.; Friberg, P. A.; Sheen, D. H.

2017-12-01

A common problem with automated earthquake location systems for a local to regional scale seismic network is false triggering and false locations inside the network caused by larger regional to teleseismic distance earthquakes. This false location issue also presents a problem for earthquake early warning systems where societal impacts of false alarms can be very expensive. Towards solving this issue, Sheen et al. (2016) implemented a robust maximum-likelihood earthquake location algorithm known as MAXEL. It was shown with both synthetics and real-data for a small number of arrivals, that large regional events were easily identifiable through metrics in the MAXEL algorithm. In the summer of 2017, we collaboratively implemented the MAXEL algorithm into a fully functional Earthworm module and tested it in regions of the USA where false detections and alarming are observed. We show robust improvement in the ability of the Earthworm system to filter out regional and teleseismic events that would have falsely located inside the network using the traditional Earthworm hypoinverse solution. We also explore using different grid sizes in the implementation of the MAXEL algorithm, which was originally designed with South Korea as the target network size.

On the Dynamics of the Spontaneous Activity in Neuronal Networks

PubMed Central

Bonifazi, Paolo; Ruaro, Maria Elisabetta; Torre, Vincent

2007-01-01

Most neuronal networks, even in the absence of external stimuli, produce spontaneous bursts of spikes separated by periods of reduced activity. The origin and functional role of these neuronal events are still unclear. The present work shows that the spontaneous activity of two very different networks, intact leech ganglia and dissociated cultures of rat hippocampal neurons, share several features. Indeed, in both networks: i) the inter-spike intervals distribution of the spontaneous firing of single neurons is either regular or periodic or bursting, with the fraction of bursting neurons depending on the network activity; ii) bursts of spontaneous spikes have the same broad distributions of size and duration; iii) the degree of correlated activity increases with the bin width, and the power spectrum of the network firing rate has a 1/f behavior at low frequencies, indicating the existence of long-range temporal correlations; iv) the activity of excitatory synaptic pathways mediated by NMDA receptors is necessary for the onset of the long-range correlations and for the presence of large bursts; v) blockage of inhibitory synaptic pathways mediated by GABAA receptors causes instead an increase in the correlation among neurons and leads to a burst distribution composed only of very small and very large bursts. These results suggest that the spontaneous electrical activity in neuronal networks with different architectures and functions can have very similar properties and common dynamics. PMID:17502919

Challenges in sending large radiology images over military communications channels

NASA Astrophysics Data System (ADS)

Cleary, Kevin R.; Levine, Betty A.; Norton, Gary S.; Mundur, Padmavathi V.

1997-05-01

In cooperation with the US Army, Georgetown University Medical Center (GUMC) deployed a teleradiology network to sites in Bosnia-Herzegovina, Hungary, and Germany in early 1996. This deployment was part of Operation Primetime III, a military project to provide state-of-the-art medical care to the 20,000 US troops stationed in Bosnia-Herzegovina.In a three-month time frame from January to April 1996, the Imaging Sciences and Information Systems (ISIS) Center at GUMC worked with the Army to design, develop, and deploy a teleradiology network for the digital storage and transmission of radiology images. This paper will discuss some of the problems associated with sending large files over communications networks with significant delays such as those introduced by satellite transmissions.Radiology images of up to 10 megabytes are acquired, stored, and transmitted over the wide area network (WAN). The WAN included leased lines from Germany to Hungary and a satellite link form Germany to Bosnia-Herzegovina. The communications links provided at least a T-1 bandwidth. The satellite link introduces a round-trip delay of approximately 500 milliseconds. This type of high bandwidth, high delay network is called a long fat network. The images are transferred across this network using the Transmission Control Protocol (TCP/IP). By modifying the TCP/IP software to increase the window size, the throughput of the satellite link can be greatly improved.

Property Improvement in CZT via Modeling and Processing Innovations . Te-particles in vertical gradient freeze CZT: Size and Spatial Distributions and Constitutional Supercooling

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

Henager, Charles H.; Alvine, Kyle J.; Bliss, Mary

2014-10-01

A section of a vertical gradient freeze CZT boule approximately 2100-mm 3 with a planar area of 300-mm 2 was prepared and examined using transmitted IR microscopy at various magnifications to determine the three-dimensional spatial and size distributions of Te-particles over large longitudinal and radial length scales. The boule section was approximately 50-mm wide by 60-mm in length by 7-mm thick and was doubly polished for TIR work. Te-particles were imaged through the thickness using extended focal imaging to locate the particles in thickness planes spaced 15-µm apart and then in plane of the image using xy-coordinates of the particlemore » center of mass so that a true three dimensional particle map was assembled for a 1-mm by 45-mm longitudinal strip and for a 1-mm by 50-mm radial strip. Te-particle density distributions were determined as a function of longitudinal and radial positions in these strips, and treating the particles as vertices of a network created a 3D image of the particle spatial distribution. Te-particles exhibited a multi-modal log-normal size density distribution that indicated a slight preference for increasing size with longitudinal growth time, while showing a pronounced cellular network structure throughout the boule that can be correlated to dislocation network sizes in CZT. Higher magnification images revealed a typical Rayleigh-instability pearl string morphology with large and small satellite droplets. This study includes solidification experiments in small crucibles of 30:70 mixtures of Cd:Te to reduce the melting point below 1273 K (1000°C). These solidification experiments were performed over a wide range of cooling rates and clearly demonstrated a growth instability with Te-particle capture that is suggested to be responsible for one of the peaks in the size distribution using size discrimination visualization. The results are discussed with regard to a manifold Te-particle genesis history as 1) Te-particle direct capture from melt-solid growth instabilities, 2) Te-particle formation from dislocation core diffusion and the formation and breakup of Te-tubes, and 3) Te-particle formation due to classical nucleation and growth as precipitates.« less

RRAM-based hardware implementations of artificial neural networks: progress update and challenges ahead

NASA Astrophysics Data System (ADS)

Prezioso, M.; Merrikh-Bayat, F.; Chakrabarti, B.; Strukov, D.

2016-02-01

Artificial neural networks have been receiving increasing attention due to their superior performance in many information processing tasks. Typically, scaling up the size of the network results in better performance and richer functionality. However, large neural networks are challenging to implement in software and customized hardware are generally required for their practical implementations. In this work, we will discuss our group's recent efforts on the development of such custom hardware circuits, based on hybrid CMOS/memristor circuits, in particular of CMOL variety. We will start by reviewing the basics of memristive devices and of CMOL circuits. We will then discuss our recent progress towards demonstration of hybrid circuits, focusing on the experimental and theoretical results for artificial neural networks based on crossbarintegrated metal oxide memristors. We will conclude presentation with the discussion of the remaining challenges and the most pressing research needs.

Nanoporous Metallic Networks: Fabrication, Optical Properties, and Applications.

PubMed

Ron, Racheli; Haleva, Emir; Salomon, Adi

2018-05-17

Nanoporous metallic networks are a group of porous materials made of solid metals with suboptical wavelength sizes of both particles and voids. They are characterized by unique optical properties, as well as high surface area and permeability of guest materials. As such, they attract a great focus as novel materials for photonics, catalysis, sensing, and renewable energy. Their properties together with the ability for scaling-up evoke an increased interest also in the industrial field. Here, fabrication techniques of large-scale metallic networks are discussed, and their interesting optical properties as well as their applications are considered. In particular, the focus is on disordered systems, which may facilitate the fabrication technique, yet, endow the three-dimensional (3D) network with distinct optical properties. These metallic networks bridge the nanoworld into the macroscopic world, and therefore pave the way to the fabrication of innovative materials with unique optoelectronic properties. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Phenotypic and Transcriptional Analysis of Divergently Selected Maize Populations Reveals the Role of Developmental Timing in Seed Size Determination1[W][OPEN

PubMed Central

Sekhon, Rajandeep S.; Hirsch, Candice N.; Childs, Kevin L.; Breitzman, Matthew W.; Kell, Paul; Duvick, Susan; Spalding, Edgar P.; Buell, C. Robin; de Leon, Natalia; Kaeppler, Shawn M.

2014-01-01

Seed size is a component of grain yield and an important trait in crop domestication. To understand the mechanisms governing seed size in maize (Zea mays), we examined transcriptional and developmental changes during seed development in populations divergently selected for large and small seed size from Krug, a yellow dent maize cultivar. After 30 cycles of selection, seeds of the large seed population (KLS30) have a 4.7-fold greater weight and a 2.6-fold larger size compared with the small seed population (KSS30). Patterns of seed weight accumulation from the time of pollination through 30 d of grain filling showed an earlier onset, slower rate, and earlier termination of grain filling in KSS30 relative to KLS30. This was further supported by transcriptome patterns in seeds from the populations and derived inbreds. Although the onset of key genes was earlier in small seeds, similar maximum transcription levels were observed in large seeds at later stages, suggesting that functionally weaker alleles, rather than transcript abundance, may be the basis of the slow rate of seed filling in KSS30. Gene coexpression networks identified several known genes controlling cellularization and proliferation as well as novel genes that will be useful candidates for biotechnological approaches aimed at altering seed size in maize and other cereals. PMID:24710068

Managing Programs for Adults Learning English. CAELA Network Brief

ERIC Educational Resources Information Center

Rodriguez, Amber Gallup; Burt, Miriam; Peyton, Joy Kreeft; Ueland, Michelle

2009-01-01

Programs for adults learning English vary widely in size and scope. Some are large, multilevel programs, such as the Arlington Education and Employment Program (REEP) in Virginia, which has more than 45 staff members, over 100 volunteers, and an array of student services for the 7,500 learners served annually at the program's 7 locations. Others…

Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report.

ERIC Educational Resources Information Center

Finn, Gregory G.

This report discusses some of the problems and limitations in existing internetwork design for the connection of packet-switching networks of different technologies and presents an algorithm that has been shown to be suitable for internetworks of unbounded size. Using a new form of address and a flat routing mechanism called Cartesian routing,…

Informal Care Networks in the Context of Multimorbidity: Size, Composition, and Associations With Recipient Psychological Well-Being.

PubMed

Andersson, Matthew A; Monin, Joan K

2018-04-01

We evaluate how the size and composition of care networks change with increasing morbidity count (i.e., multimorbidity) and how larger care networks relate to recipient psychological well-being. Using the National Health and Aging Trends study (NHATS; N = 7,026), we conduct multivariate regressions to analyze size and compositional differences in care networks by morbidity count and recipient gender, and to examine differences in recipient psychological well-being linked to care network size. Women report larger and more diverse care networks than men. These gender differences strengthen with increasing morbidity count. Larger care networks are associated with diminished psychological well-being among care recipients, especially as morbidity increases. These findings reveal how increasing morbidity translates differently to care network size and diversity for men and women. They also suggest that having multiple caregivers may undermine the psychological well-being of care recipients who face complex health challenges.

Mindfulness-based treatments for posttraumatic stress disorder: a review of the treatment literature and neurobiological evidence

PubMed Central

Boyd, Jenna E.; Lanius, Ruth A.; McKinnon, Margaret C.

2018-01-01

Mindfulness-based treatments for posttraumatic stress disorder (PTSD) have emerged as promising adjunctive or alternative intervention approaches. A scoping review of the literature on PTSD treatment studies, including approaches such as mindfulness-based stress reduction, mindfulness-based cognitive therapy and metta mindfulness, reveals low attrition with medium to large effect sizes. We review the convergence between neurobiological models of PTSD and neuroimaging findings in the mindfulness literature, where mindfulness interventions may target emotional under- and overmodulation, both of which are critical features of PTSD symptomatology. Recent emerging work indicates that mindfulness-based treatments may also be effective in restoring connectivity between large-scale brain networks among individuals with PTSD, including connectivity between the default mode network and the central executive and salience networks. Future directions, including further identification of the neurobiological mechanisms of mindfulness interventions in patients with PTSD and direct comparison of these interventions to first-line treatments for PTSD are discussed. PMID:29252162

Magnetic pattern at supergranulation scale: the void size distribution

NASA Astrophysics Data System (ADS)

Berrilli, F.; Scardigli, S.; Del Moro, D.

2014-08-01

The large-scale magnetic pattern observed in the photosphere of the quiet Sun is dominated by the magnetic network. This network, created by photospheric magnetic fields swept into convective downflows, delineates the boundaries of large-scale cells of overturning plasma and exhibits "voids" in magnetic organization. These voids include internetwork fields, which are mixed-polarity sparse magnetic fields that populate the inner part of network cells. To single out voids and to quantify their intrinsic pattern we applied a fast circle-packing-based algorithm to 511 SOHO/MDI high-resolution magnetograms acquired during the unusually long solar activity minimum between cycles 23 and 24. The computed void distribution function shows a quasi-exponential decay behavior in the range 10-60 Mm. The lack of distinct flow scales in this range corroborates the hypothesis of multi-scale motion flows at the solar surface. In addition to the quasi-exponential decay, we have found that the voids depart from a simple exponential decay at about 35 Mm.

Differences in Flower Transcriptome between Grapevine Clones Are Related to Their Cluster Compactness, Fruitfulness, and Berry Size

PubMed Central

Grimplet, Jérôme; Tello, Javier; Laguna, Natalia; Ibáñez, Javier

2017-01-01

Grapevine cluster compactness has a clear impact on fruit quality and health status, as clusters with greater compactness are more susceptible to pests and diseases and ripen more asynchronously. Different parameters related to inflorescence and cluster architecture (length, width, branching, etc.), fruitfulness (number of berries, number of seeds) and berry size (length, width) contribute to the final level of compactness. From a collection of 501 clones of cultivar Garnacha Tinta, two compact and two loose clones with stable differences for cluster compactness-related traits were selected and phenotyped. Key organs and developmental stages were selected for sampling and transcriptomic analyses. Comparison of global gene expression patterns in flowers at the end of bloom allowed identification of potential gene networks with a role in determining the final berry number, berry size and ultimately cluster compactness. A large portion of the differentially expressed genes were found in networks related to cell division (carbohydrates uptake, cell wall metabolism, cell cycle, nucleic acids metabolism, cell division, DNA repair). Their greater expression level in flowers of compact clones indicated that the number of berries and the berry size at ripening appear related to the rate of cell replication in flowers during the early growth stages after pollination. In addition, fluctuations in auxin and gibberellin signaling and transport related gene expression support that they play a central role in fruit set and impact berry number and size. Other hormones, such as ethylene and jasmonate may differentially regulate indirect effects, such as defense mechanisms activation or polyphenols production. This is the first transcriptomic based analysis focused on the discovery of the underlying gene networks involved in grapevine traits of grapevine cluster compactness, berry number and berry size. PMID:28496449

Differences in Flower Transcriptome between Grapevine Clones Are Related to Their Cluster Compactness, Fruitfulness, and Berry Size.

PubMed

Grimplet, Jérôme; Tello, Javier; Laguna, Natalia; Ibáñez, Javier

2017-01-01

Grapevine cluster compactness has a clear impact on fruit quality and health status, as clusters with greater compactness are more susceptible to pests and diseases and ripen more asynchronously. Different parameters related to inflorescence and cluster architecture (length, width, branching, etc.), fruitfulness (number of berries, number of seeds) and berry size (length, width) contribute to the final level of compactness. From a collection of 501 clones of cultivar Garnacha Tinta, two compact and two loose clones with stable differences for cluster compactness-related traits were selected and phenotyped. Key organs and developmental stages were selected for sampling and transcriptomic analyses. Comparison of global gene expression patterns in flowers at the end of bloom allowed identification of potential gene networks with a role in determining the final berry number, berry size and ultimately cluster compactness. A large portion of the differentially expressed genes were found in networks related to cell division (carbohydrates uptake, cell wall metabolism, cell cycle, nucleic acids metabolism, cell division, DNA repair). Their greater expression level in flowers of compact clones indicated that the number of berries and the berry size at ripening appear related to the rate of cell replication in flowers during the early growth stages after pollination. In addition, fluctuations in auxin and gibberellin signaling and transport related gene expression support that they play a central role in fruit set and impact berry number and size. Other hormones, such as ethylene and jasmonate may differentially regulate indirect effects, such as defense mechanisms activation or polyphenols production. This is the first transcriptomic based analysis focused on the discovery of the underlying gene networks involved in grapevine traits of grapevine cluster compactness, berry number and berry size.

Conditions for addressing environmental determinants of health behavior in intersectoral policy networks: A fuzzy set Qualitative Comparative Analysis.

PubMed

Peters, D T J M; Verweij, S; Grêaux, K; Stronks, K; Harting, J

2017-12-01

Improving health requires changes in the social, physical, economic and political determinants of health behavior. For the realization of policies that address these environmental determinants, intersectoral policy networks are considered necessary for the pooling of resources to implement different policy instruments. However, such network diversity may increase network complexity and therefore hamper network performance. Network complexity may be reduced by network management and the provision of financial resources. This study examined whether network diversity - amidst the other conditions - is indeed needed to address environmental determinants of health behavior. We included 25 intersectoral policy networks in Dutch municipalities aimed at reducing overweight, smoking, and alcohol/drugs abuse. For our fuzzy set Qualitative Comparative Analysis we used data from three web-based surveys among (a) project leaders regarding network diversity and size (n = 38); (b) project leaders and project partners regarding management (n = 278); and (c) implementation professionals regarding types of environmental determinants addressed (n = 137). Data on budgets were retrieved from project application forms. Contrary to their intentions, most policy networks typically addressed personal determinants. If the environment was addressed too, it was mostly the social environment. To address environmental determinants of health behavior, network diversity (>50% of the actors are non-public health) was necessary in networks that were either small (<16 actors) or had small budgets (<€183,172), when both were intensively managed. Irrespective of network diversity, environmental determinants also were addressed by small networks with large budgets, and by large networks with small budgets, when both provided network management. We conclude that network diversity is important - although not necessary - for resource pooling to address environmental determinants of health behavior, but only effective in the presence of network management. Our findings may support intersectoral policy networks in improving health behaviors by addressing a variety of environmental determinants. Copyright © 2017. Published by Elsevier Ltd.

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

NASA Astrophysics Data System (ADS)

Lu, Qiming

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

Predicting the particle size distribution of eroded sediment using artificial neural networks.

PubMed

Lagos-Avid, María Paz; Bonilla, Carlos A

2017-03-01

Water erosion causes soil degradation and nonpoint pollution. Pollutants are primarily transported on the surfaces of fine soil and sediment particles. Several soil loss models and empirical equations have been developed for the size distribution estimation of the sediment leaving the field, including the physically-based models and empirical equations. Usually, physically-based models require a large amount of data, sometimes exceeding the amount of available data in the modeled area. Conversely, empirical equations do not always predict the sediment composition associated with individual events and may require data that are not always available. Therefore, the objective of this study was to develop a model to predict the particle size distribution (PSD) of eroded soil. A total of 41 erosion events from 21 soils were used. These data were compiled from previous studies. Correlation and multiple regression analyses were used to identify the main variables controlling sediment PSD. These variables were the particle size distribution in the soil matrix, the antecedent soil moisture condition, soil erodibility, and hillslope geometry. With these variables, an artificial neural network was calibrated using data from 29 events (r 2 =0.98, 0.97, and 0.86; for sand, silt, and clay in the sediment, respectively) and then validated and tested on 12 events (r 2 =0.74, 0.85, and 0.75; for sand, silt, and clay in the sediment, respectively). The artificial neural network was compared with three empirical models. The network presented better performance in predicting sediment PSD and differentiating rain-runoff events in the same soil. In addition to the quality of the particle distribution estimates, this model requires a small number of easily obtained variables, providing a convenient routine for predicting PSD in eroded sediment in other pollutant transport models. Copyright © 2017 Elsevier B.V. All rights reserved.

Bipartite networks improve understanding of effects of waterbody size and angling method on angler–fish interactions

USGS Publications Warehouse

Chizinski, Christopher J.; Martin, Dustin R.; Shizuka, Daizaburo; Pope, Kevin L.

2018-01-01

Networks used to study interactions could provide insights to fisheries. We compiled data from 27 297 interviews of anglers across waterbodies that ranged in size from 1 to 12 113 ha. Catch rates of fish species among anglers grouped by species targeted generally differed between angling methods (bank or boat). We constructed angler–catch bipartite networks (angling method specific) between anglers and fish and measured several network metrics. There was considerable variation in networks among waterbodies, with multiple metrics influenced by waterbody size. Number of species-targeting angler groups and number of fish species caught increased with increasing waterbody size. Mean number of links for species-targeting angler groups and fish species caught also increased with waterbody size. Connectance (realized proportion of possible links) of angler–catch interaction networks decreased slower for boat anglers than for bank anglers with increasing waterbody size. Network specialization (deviation of number of interactions from expected) was not significantly related to waterbody size or angling methods. Application of bipartite networks in fishery science requires careful interpretation of outputs, especially considering the numerous confounding factors prevalent in recreational fisheries.

Do online social media cut through the constraints that limit the size of offline social networks?

PubMed Central

Dunbar, R. I. M.

2016-01-01

The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online social networking offers the potential to break through the glass ceiling imposed by at least the second of these, potentially enabling us to maintain much larger social networks. This is tested using two separate UK surveys, each randomly stratified by age, gender and regional population size. The data show that the size and range of online egocentric social networks, indexed as the number of Facebook friends, is similar to that of offline face-to-face networks. For one sample, respondents also specified the number of individuals in the inner layers of their network (formally identified as support clique and sympathy group), and these were also similar in size to those observed in offline networks. This suggests that, as originally proposed by the social brain hypothesis, there is a cognitive constraint on the size of social networks that even the communication advantages of online media are unable to overcome. In practical terms, it may reflect the fact that real (as opposed to casual) relationships require at least occasional face-to-face interaction to maintain them. PMID:26909163

Do online social media cut through the constraints that limit the size of offline social networks?

PubMed

Dunbar, R I M

2016-01-01

The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online social networking offers the potential to break through the glass ceiling imposed by at least the second of these, potentially enabling us to maintain much larger social networks. This is tested using two separate UK surveys, each randomly stratified by age, gender and regional population size. The data show that the size and range of online egocentric social networks, indexed as the number of Facebook friends, is similar to that of offline face-to-face networks. For one sample, respondents also specified the number of individuals in the inner layers of their network (formally identified as support clique and sympathy group), and these were also similar in size to those observed in offline networks. This suggests that, as originally proposed by the social brain hypothesis, there is a cognitive constraint on the size of social networks that even the communication advantages of online media are unable to overcome. In practical terms, it may reflect the fact that real (as opposed to casual) relationships require at least occasional face-to-face interaction to maintain them.

Social Networking Adapted for Distributed Scientific Collaboration

NASA Technical Reports Server (NTRS)

Karimabadi, Homa

2012-01-01

Share is a social networking site with novel, specially designed feature sets to enable simultaneous remote collaboration and sharing of large data sets among scientists. The site will include not only the standard features found on popular consumer-oriented social networking sites such as Facebook and Myspace, but also a number of powerful tools to extend its functionality to a science collaboration site. A Virtual Observatory is a promising technology for making data accessible from various missions and instruments through a Web browser. Sci-Share augments services provided by Virtual Observatories by enabling distributed collaboration and sharing of downloaded and/or processed data among scientists. This will, in turn, increase science returns from NASA missions. Sci-Share also enables better utilization of NASA s high-performance computing resources by providing an easy and central mechanism to access and share large files on users space or those saved on mass storage. The most common means of remote scientific collaboration today remains the trio of e-mail for electronic communication, FTP for file sharing, and personalized Web sites for dissemination of papers and research results. Each of these tools has well-known limitations. Sci-Share transforms the social networking paradigm into a scientific collaboration environment by offering powerful tools for cooperative discourse and digital content sharing. Sci-Share differentiates itself by serving as an online repository for users digital content with the following unique features: a) Sharing of any file type, any size, from anywhere; b) Creation of projects and groups for controlled sharing; c) Module for sharing files on HPC (High Performance Computing) sites; d) Universal accessibility of staged files as embedded links on other sites (e.g. Facebook) and tools (e.g. e-mail); e) Drag-and-drop transfer of large files, replacing awkward e-mail attachments (and file size limitations); f) Enterprise-level data and messaging encryption; and g) Easy-to-use intuitive workflow.

Detonation charge size versus coda magnitude relations in California and Nevada

USGS Publications Warehouse

Brocher, T.M.

2003-01-01

Magnitude-charge size relations have important uses in forensic seismology and are used in Comprehensive Nuclear-Test-Ban Treaty monitoring. I derive empirical magnitude versus detonation-charge-size relationships for 322 detonations located by permanent seismic networks in California and Nevada. These detonations, used in 41 different seismic refraction or network calibration experiments, ranged in yield (charge size) between 25 and 106 kg; coda magnitudes reported for them ranged from 0.5 to 3.9. Almost all represent simultaneous (single-fired) detonations of one or more boreholes. Repeated detonations at the same shotpoint suggest that the reported coda magnitudes are repeatable, on average, to within 0.1 magnitude unit. An empirical linear regression for these 322 detonations yields M = 0.31 + 0.50 log10(weight [kg]). The detonations compiled here demonstrate that the Khalturin et al. (1998) relationship, developed mainly for data from large chemical explosions but which fits data from nuclear blasts, can be used to estimate the minimum charge size for coda magnitudes between 0.5 and 3.9. Drilling, loading, and shooting logs indicate that the explosive specification, loading method, and effectiveness of tamp are the primary factors determining the efficiency of a detonation. These records indicate that locating a detonation within the water table is neither a necessary nor sufficient condition for an efficient shot.

Sex Differences in Virtual Network Characteristics and Sexual Risk Behavior among Emerging Adults

PubMed Central

Cook, Stephanie H.; Bauermeister, José A.; Zimmerman, Marc A.

2016-01-01

Emerging adults (EAs)ages 18 to 24 account for a large proportion of all sexually transmitted infections (STIs), HIV infections, and unintended pregnancies in the United States. Given the increased influence of online media on decision-making, we examined how EA online networks were associated with sexual risk behaviors. We used egocentric network data collected from EAs aged 18 to 24 years old across the United States (N=1,687) to examine how online norms (e.g., acceptance of HIV infections, other STIs, and pregnancy) and network characteristics (i.e., network size and density; ties' closeness, race, age, and sex similarities) were associated with participants' unprotected vaginal intercourse (UVI) in the last 30 days. Findings suggested that in male EAs, there was a strong association between sexual norms, structural characteristics, and sexual risk behavior compared to females. Researchers and practitioners may wish to address online peer norms and EAs' online network composition when developing online sexual risk prevention tools. PMID:28083447

Measuring the value of accurate link prediction for network seeding.

PubMed

Wei, Yijin; Spencer, Gwen

2017-01-01

The influence-maximization literature seeks small sets of individuals whose structural placement in the social network can drive large cascades of behavior. Optimization efforts to find the best seed set often assume perfect knowledge of the network topology. Unfortunately, social network links are rarely known in an exact way. When do seeding strategies based on less-than-accurate link prediction provide valuable insight? We introduce optimized-against-a-sample ([Formula: see text]) performance to measure the value of optimizing seeding based on a noisy observation of a network. Our computational study investigates [Formula: see text] under several threshold-spread models in synthetic and real-world networks. Our focus is on measuring the value of imprecise link information. The level of investment in link prediction that is strategic appears to depend closely on spread model: in some parameter ranges investments in improving link prediction can pay substantial premiums in cascade size. For other ranges, such investments would be wasted. Several trends were remarkably consistent across topologies.

Network-based model of the growth of termite nests

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Perna, Andrea; Fortunato, Santo; Darrouzet, Eric; Theraulaz, Guy; Jost, Christian

2015-12-01

We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, size of the largest connected component, average path lengths, backbone link ratios, and local graph redundancy). The two pruning alternatives can be associated with different genuses in the subfamily. A sensitivity analysis on the pruning and memory parameters indicates that Termitinae networks favor fast internal transportation over efficient defense strategies against ant predators. Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.

Broadband network selection issues

NASA Astrophysics Data System (ADS)

Leimer, Michael E.

1996-01-01

Selecting the best network for a given cable or telephone company provider is not as obvious as it appears. The cost and performance trades between Hybrid Fiber Coax (HFC), Fiber to the Curb (FTTC) and Asymmetric Digital Subscriber Line networks lead to very different choices based on the existing plant and the expected interactive subscriber usage model. This paper presents some of the issues and trades that drive network selection. The majority of the Interactive Television trials currently underway or planned are based on HFC networks. As a throw away market trial or a short term strategic incursion into a cable market, HFC may make sense. In the long run, if interactive services see high demand, HFC costs per node and an ever shrinking neighborhood node size to service large numbers of subscribers make FTTC appear attractive. For example, thirty-three 64-QAM modulators are required to fill the 550 MHz to 750 MHz spectrum with compressed video streams in 6 MHz channels. This large amount of hardware at each node drives not only initial build-out costs, but operations and maintenance costs as well. FTTC, with its potential for digitally switching large amounts of bandwidth to an given home, offers the potential to grow with the interactive subscriber base with less downstream cost. Integrated telephony on these networks is an issue that appears to be an afterthought for most of the networks being selected at the present time. The major players seem to be videocentric and include telephony as a simple add-on later. This may be a reasonable view point for the telephone companies that plan to leave their existing phone networks untouched. However, a phone company planning a network upgrade or a cable company jumping into the telephony business needs to carefully weigh the cost and performance issues of the various network choices. Each network type provides varying capability in both upstream and downstream bandwidth for voice channels. The noise characteristics vary as well. Cellular quality will not be tolerated by the home or business consumer. The network choices are not simple or obvious. Careful consideration of the cost and performance trades along with cable or telephone company strategic plans is required to ensure selecting the best network.

Optimal input sizes for neural network de-interlacing

NASA Astrophysics Data System (ADS)

Choi, Hyunsoo; Seo, Guiwon; Lee, Chulhee

2009-02-01

Neural network de-interlacing has shown promising results among various de-interlacing methods. In this paper, we investigate the effects of input size for neural networks for various video formats when the neural networks are used for de-interlacing. In particular, we investigate optimal input sizes for CIF, VGA and HD video formats.

Photogrammetric measurement to one part in a million

NASA Astrophysics Data System (ADS)

Fraser, Clive S.

1992-03-01

Industrial photogrammetric measurement to accuracies of 1 part in 1,000,000 of the size of the object is discussed. Network design concepts are reviewed, especially with regard both to the relationships between the first- and second-order design phases and to minimization of the influences of uncompensated systematic error. Photogrammetric system aspects are also briefly touched upon. The network optimization process for the measurement of a large compact range reflector is described and results of successive alignment surveys of this structure are summarized. These photogrammetric measurements yielded three dimensional (3D) coordinate accuracies surpassing one part in a million.

The role of storm scale, position and movement in controlling urban flood response

NASA Astrophysics Data System (ADS)

ten Veldhuis, Marie-claire; Zhou, Zhengzheng; Yang, Long; Liu, Shuguang; Smith, James

2018-01-01

The impact of spatial and temporal variability of rainfall on hydrological response remains poorly understood, in particular in urban catchments due to their strong variability in land use, a high degree of imperviousness and the presence of stormwater infrastructure. In this study, we analyze the effect of storm scale, position and movement in relation to basin scale and flow-path network structure on urban hydrological response. A catalog of 279 peak events was extracted from a high-quality observational dataset covering 15 years of flow observations and radar rainfall data for five (semi)urbanized basins ranging from 7.0 to 111.1 km2 in size. Results showed that the largest peak flows in the event catalog were associated with storm core scales exceeding basin scale, for all except the largest basin. Spatial scale of flood-producing storm events in the smaller basins fell into two groups: storms of large spatial scales exceeding basin size or small, concentrated events, with storm core much smaller than basin size. For the majority of events, spatial rainfall variability was strongly smoothed by the flow-path network, increasingly so for larger basin size. Correlation analysis showed that position of the storm in relation to the flow-path network was significantly correlated with peak flow in the smallest and in the two more urbanized basins. Analysis of storm movement relative to the flow-path network showed that direction of storm movement, upstream or downstream relative to the flow-path network, had little influence on hydrological response. Slow-moving storms tend to be associated with higher peak flows and longer lag times. Unexpectedly, position of the storm relative to impervious cover within the basins had little effect on flow peaks. These findings show the importance of observation-based analysis in validating and improving our understanding of interactions between the spatial distribution of rainfall and catchment variability.

Analyzing hidden populations online: topic, emotion, and social network of HIV-related users in the largest Chinese online community.

PubMed

Liu, Chuchu; Lu, Xin

2018-01-05

Traditional survey methods are limited in the study of hidden populations due to the hard to access properties, including lack of a sampling frame, sensitivity issue, reporting error, small sample size, etc. The rapid increase of online communities, of which members interact with others via the Internet, have generated large amounts of data, offering new opportunities for understanding hidden populations with unprecedented sample sizes and richness of information. In this study, we try to understand the multidimensional characteristics of a hidden population by analyzing the massive data generated in the online community. By elaborately designing crawlers, we retrieved a complete dataset from the "HIV bar," the largest bar related to HIV on the Baidu Tieba platform, for all records from January 2005 to August 2016. Through natural language processing and social network analysis, we explored the psychology, behavior and demand of online HIV population and examined the network community structure. In HIV communities, the average topic similarity among members is positively correlated to network efficiency (r = 0.70, p < 0.001), indicating that the closer the social distance between members of the community, the more similar their topics. The proportion of negative users in each community is around 60%, weakly correlated with community size (r = 0.25, p = 0.002). It is found that users suspecting initial HIV infection or first in contact with high-risk behaviors tend to seek help and advice on the social networking platform, rather than immediately going to a hospital for blood tests. Online communities have generated copious amounts of data offering new opportunities for understanding hidden populations with unprecedented sample sizes and richness of information. It is recommended that support through online services for HIV/AIDS consultation and diagnosis be improved to avoid privacy concerns and social discrimination in China.

Coarse-coded higher-order neural networks for PSRI object recognition. [position, scale, and rotation invariant

NASA Technical Reports Server (NTRS)

Spirkovska, Lilly; Reid, Max B.

1993-01-01

A higher-order neural network (HONN) can be designed to be invariant to changes in scale, translation, and inplane rotation. Invariances are built directly into the architecture of a HONN and do not need to be learned. Consequently, fewer training passes and a smaller training set are required to learn to distinguish between objects. The size of the input field is limited, however, because of the memory required for the large number of interconnections in a fully connected HONN. By coarse coding the input image, the input field size can be increased to allow the larger input scenes required for practical object recognition problems. We describe a coarse coding technique and present simulation results illustrating its usefulness and its limitations. Our simulations show that a third-order neural network can be trained to distinguish between two objects in a 4096 x 4096 pixel input field independent of transformations in translation, in-plane rotation, and scale in less than ten passes through the training set. Furthermore, we empirically determine the limits of the coarse coding technique in the object recognition domain.

Optimal sensor placement for leak location in water distribution networks using genetic algorithms.

PubMed

Casillas, Myrna V; Puig, Vicenç; Garza-Castañón, Luis E; Rosich, Albert

2013-11-04

This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs). The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs) are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach.

Optimal Sensor Placement for Leak Location in Water Distribution Networks Using Genetic Algorithms

PubMed Central

Casillas, Myrna V.; Puig, Vicenç; Garza-Castañón, Luis E.; Rosich, Albert

2013-01-01

This paper proposes a new sensor placement approach for leak location in water distribution networks (WDNs). The sensor placement problem is formulated as an integer optimization problem. The optimization criterion consists in minimizing the number of non-isolable leaks according to the isolability criteria introduced. Because of the large size and non-linear integer nature of the resulting optimization problem, genetic algorithms (GAs) are used as the solution approach. The obtained results are compared with a semi-exhaustive search method with higher computational effort, proving that GA allows one to find near-optimal solutions with less computational load. Moreover, three ways of increasing the robustness of the GA-based sensor placement method have been proposed using a time horizon analysis, a distance-based scoring and considering different leaks sizes. A great advantage of the proposed methodology is that it does not depend on the isolation method chosen by the user, as long as it is based on leak sensitivity analysis. Experiments in two networks allow us to evaluate the performance of the proposed approach. PMID:24193099

Near Critical Preferential Attachment Networks have Small Giant Components

NASA Astrophysics Data System (ADS)

Eckhoff, Maren; Mörters, Peter; Ortgiese, Marcel

2018-05-01

Preferential attachment networks with power law exponent τ >3 are known to exhibit a phase transition. There is a value ρ c>0 such that, for small edge densities ρ ≤ ρ c every component of the graph comprises an asymptotically vanishing proportion of vertices, while for large edge densities ρ >ρ c there is a unique giant component comprising an asymptotically positive proportion of vertices. In this paper we study the decay in the size of the giant component as the critical edge density is approached from above. We show that the size decays very rapidly, like \\exp (-c/ √{ρ -ρ c}) for an explicit constant c>0 depending on the model implementation. This result is in contrast to the behaviour of the class of rank-one models of scale-free networks, including the configuration model, where the decay is polynomial. Our proofs rely on the local neighbourhood approximations of Dereich and Mörters (Ann Probab 41(1):329-384, 2013) and recent progress in the theory of branching random walks (Gantert et al. in Ann Inst Henri Poincaré Probab Stat 47(1):111-129, 2011).

Integrated modeling of storm drain and natural channel networks for real-time flash flood forecasting in large urban areas

NASA Astrophysics Data System (ADS)

Habibi, H.; Norouzi, A.; Habib, A.; Seo, D. J.

2016-12-01

To produce accurate predictions of flooding in urban areas, it is necessary to model both natural channel and storm drain networks. While there exist many urban hydraulic models of varying sophistication, most of them are not practical for real-time application for large urban areas. On the other hand, most distributed hydrologic models developed for real-time applications lack the ability to explicitly simulate storm drains. In this work, we develop a storm drain model that can be coupled with distributed hydrologic models such as the National Weather Service Hydrology Laboratory's Distributed Hydrologic Model, for real-time flash flood prediction in large urban areas to improve prediction and to advance the understanding of integrated response of natural channels and storm drains to rainfall events of varying magnitude and spatiotemporal extent in urban catchments of varying sizes. The initial study area is the Johnson Creek Catchment (40.1 km2) in the City of Arlington, TX. For observed rainfall, the high-resolution (500 m, 1 min) precipitation data from the Dallas-Fort Worth Demonstration Network of the Collaborative Adaptive Sensing of the Atmosphere radars is used.

Using Swarming Agents for Scalable Security in Large Network Environments

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

Crouse, Michael; White, Jacob L.; Fulp, Errin W.

2011-09-23

The difficulty of securing computer infrastructures increases as they grow in size and complexity. Network-based security solutions such as IDS and firewalls cannot scale because of exponentially increasing computational costs inherent in detecting the rapidly growing number of threat signatures. Hostbased solutions like virus scanners and IDS suffer similar issues, and these are compounded when enterprises try to monitor these in a centralized manner. Swarm-based autonomous agent systems like digital ants and artificial immune systems can provide a scalable security solution for large network environments. The digital ants approach offers a biologically inspired design where each ant in the virtualmore » colony can detect atoms of evidence that may help identify a possible threat. By assembling the atomic evidences from different ant types the colony may detect the threat. This decentralized approach can require, on average, fewer computational resources than traditional centralized solutions; however there are limits to its scalability. This paper describes how dividing a large infrastructure into smaller managed enclaves allows the digital ant framework to effectively operate in larger environments. Experimental results will show that using smaller enclaves allows for more consistent distribution of agents and results in faster response times.« less

Structural diversity in social contagion

PubMed Central

Ugander, Johan; Backstrom, Lars; Marlow, Cameron; Kleinberg, Jon

2012-01-01

The concept of contagion has steadily expanded from its original grounding in epidemic disease to describe a vast array of processes that spread across networks, notably social phenomena such as fads, political opinions, the adoption of new technologies, and financial decisions. Traditional models of social contagion have been based on physical analogies with biological contagion, in which the probability that an individual is affected by the contagion grows monotonically with the size of his or her “contact neighborhood”—the number of affected individuals with whom he or she is in contact. Whereas this contact neighborhood hypothesis has formed the underpinning of essentially all current models, it has been challenging to evaluate it due to the difficulty in obtaining detailed data on individual network neighborhoods during the course of a large-scale contagion process. Here we study this question by analyzing the growth of Facebook, a rare example of a social process with genuinely global adoption. We find that the probability of contagion is tightly controlled by the number of connected components in an individual's contact neighborhood, rather than by the actual size of the neighborhood. Surprisingly, once this “structural diversity” is controlled for, the size of the contact neighborhood is in fact generally a negative predictor of contagion. More broadly, our analysis shows how data at the size and resolution of the Facebook network make possible the identification of subtle structural signals that go undetected at smaller scales yet hold pivotal predictive roles for the outcomes of social processes. PMID:22474360

Towards a theory of cortical columns: From spiking neurons to interacting neural populations of finite size

PubMed Central

Gerstner, Wulfram

2017-01-01

Neural population equations such as neural mass or field models are widely used to study brain activity on a large scale. However, the relation of these models to the properties of single neurons is unclear. Here we derive an equation for several interacting populations at the mesoscopic scale starting from a microscopic model of randomly connected generalized integrate-and-fire neuron models. Each population consists of 50–2000 neurons of the same type but different populations account for different neuron types. The stochastic population equations that we find reveal how spike-history effects in single-neuron dynamics such as refractoriness and adaptation interact with finite-size fluctuations on the population level. Efficient integration of the stochastic mesoscopic equations reproduces the statistical behavior of the population activities obtained from microscopic simulations of a full spiking neural network model. The theory describes nonlinear emergent dynamics such as finite-size-induced stochastic transitions in multistable networks and synchronization in balanced networks of excitatory and inhibitory neurons. The mesoscopic equations are employed to rapidly integrate a model of a cortical microcircuit consisting of eight neuron types, which allows us to predict spontaneous population activities as well as evoked responses to thalamic input. Our theory establishes a general framework for modeling finite-size neural population dynamics based on single cell and synapse parameters and offers an efficient approach to analyzing cortical circuits and computations. PMID:28422957

Micro-foundation using percolation theory of the finite time singular behavior of the crash hazard rate in a class of rational expectation bubbles

NASA Astrophysics Data System (ADS)

Seyrich, Maximilian; Sornette, Didier

2016-04-01

We present a plausible micro-founded model for the previously postulated power law finite time singular form of the crash hazard rate in the Johansen-Ledoit-Sornette (JLS) model of rational expectation bubbles. The model is based on a percolation picture of the network of traders and the concept that clusters of connected traders share the same opinion. The key ingredient is the notion that a shift of position from buyer to seller of a sufficiently large group of traders can trigger a crash. This provides a formula to estimate the crash hazard rate by summation over percolation clusters above a minimum size of a power sa (with a>1) of the cluster sizes s, similarly to a generalized percolation susceptibility. The power sa of cluster sizes emerges from the super-linear dependence of group activity as a function of group size, previously documented in the literature. The crash hazard rate exhibits explosive finite time singular behaviors when the control parameter (fraction of occupied sites, or density of traders in the network) approaches the percolation threshold pc. Realistic dynamics are generated by modeling the density of traders on the percolation network by an Ornstein-Uhlenbeck process, whose memory controls the spontaneous excursion of the control parameter close to the critical region of bubble formation. Our numerical simulations recover the main stylized properties of the JLS model with intermittent explosive super-exponential bubbles interrupted by crashes.

Criticality in finite dynamical networks

NASA Astrophysics Data System (ADS)

Rohlf, Thimo; Gulbahce, Natali; Teuscher, Christof

2007-03-01

It has been shown analytically and experimentally that both random boolean and random threshold networks show a transition from ordered to chaotic dynamics at a critical average connectivity Kc in the thermodynamical limit [1]. By looking at the statistical distributions of damage spreading (damage sizes), we go beyond this extensively studied mean-field approximation. We study the scaling properties of damage size distributions as a function of system size N and initial perturbation size d(t=0). We present numerical evidence that another characteristic point, Kd exists for finite system sizes, where the expectation value of damage spreading in the network is independent of the system size N. Further, the probability to obtain critical networks is investigated for a given system size and average connectivity k. Our results suggest that, for finite size dynamical networks, phase space structure is very complex and may not exhibit a sharp order-disorder transition. Finally, we discuss the implications of our findings for evolutionary processes and learning applied to networks which solve specific computational tasks. [1] Derrida, B. and Pomeau, Y. (1986), Europhys. Lett., 1, 45-49

The Accounting Network: How Financial Institutions React to Systemic Crisis

PubMed Central

Puliga, Michelangelo; Flori, Andrea; Pappalardo, Giuseppe; Chessa, Alessandro; Pammolli, Fabio

2016-01-01

The role of Network Theory in the study of the financial crisis has been widely spotted in the latest years. It has been shown how the network topology and the dynamics running on top of it can trigger the outbreak of large systemic crisis. Following this methodological perspective we introduce here the Accounting Network, i.e. the network we can extract through vector similarities techniques from companies’ financial statements. We build the Accounting Network on a large database of worldwide banks in the period 2001–2013, covering the onset of the global financial crisis of mid-2007. After a careful data cleaning, we apply a quality check in the construction of the network, introducing a parameter (the Quality Ratio) capable of trading off the size of the sample (coverage) and the representativeness of the financial statements (accuracy). We compute several basic network statistics and check, with the Louvain community detection algorithm, for emerging communities of banks. Remarkably enough sensible regional aggregations show up with the Japanese and the US clusters dominating the community structure, although the presence of a geographically mixed community points to a gradual convergence of banks into similar supranational practices. Finally, a Principal Component Analysis procedure reveals the main economic components that influence communities’ heterogeneity. Even using the most basic vector similarity hypotheses on the composition of the financial statements, the signature of the financial crisis clearly arises across the years around 2008. We finally discuss how the Accounting Networks can be improved to reflect the best practices in the financial statement analysis. PMID:27736865

The Accounting Network: How Financial Institutions React to Systemic Crisis.

PubMed

Puliga, Michelangelo; Flori, Andrea; Pappalardo, Giuseppe; Chessa, Alessandro; Pammolli, Fabio

2016-01-01

The role of Network Theory in the study of the financial crisis has been widely spotted in the latest years. It has been shown how the network topology and the dynamics running on top of it can trigger the outbreak of large systemic crisis. Following this methodological perspective we introduce here the Accounting Network, i.e. the network we can extract through vector similarities techniques from companies' financial statements. We build the Accounting Network on a large database of worldwide banks in the period 2001-2013, covering the onset of the global financial crisis of mid-2007. After a careful data cleaning, we apply a quality check in the construction of the network, introducing a parameter (the Quality Ratio) capable of trading off the size of the sample (coverage) and the representativeness of the financial statements (accuracy). We compute several basic network statistics and check, with the Louvain community detection algorithm, for emerging communities of banks. Remarkably enough sensible regional aggregations show up with the Japanese and the US clusters dominating the community structure, although the presence of a geographically mixed community points to a gradual convergence of banks into similar supranational practices. Finally, a Principal Component Analysis procedure reveals the main economic components that influence communities' heterogeneity. Even using the most basic vector similarity hypotheses on the composition of the financial statements, the signature of the financial crisis clearly arises across the years around 2008. We finally discuss how the Accounting Networks can be improved to reflect the best practices in the financial statement analysis.

Analysis and design of a 10 to 30 kW grid-connected solar power system for the JPL fire station and first aid station

NASA Technical Reports Server (NTRS)

Josephs, R. H.

1982-01-01

The design and performance of a modestly sized utility-connected power conditioning system and its supporting photovoltaic collector are described and estimated. Utility preparations and guidelines to conform with the output of a small generating station with that of a large power network are examined.

Interacting epidemics and coinfection on contact networks.

PubMed

Newman, M E J; Ferrario, Carrie R

2013-01-01

The spread of certain diseases can be promoted, in some cases substantially, by prior infection with another disease. One example is that of HIV, whose immunosuppressant effects significantly increase the chances of infection with other pathogens. Such coinfection processes, when combined with nontrivial structure in the contact networks over which diseases spread, can lead to complex patterns of epidemiological behavior. Here we consider a mathematical model of two diseases spreading through a single population, where infection with one disease is dependent on prior infection with the other. We solve exactly for the sizes of the outbreaks of both diseases in the limit of large population size, along with the complete phase diagram of the system. Among other things, we use our model to demonstrate how diseases can be controlled not only by reducing the rate of their spread, but also by reducing the spread of other infections upon which they depend.

Percolation of a general network of networks.

PubMed

Gao, Jianxi; Buldyrev, Sergey V; Stanley, H Eugene; Xu, Xiaoming; Havlin, Shlomo

2013-12-01

Percolation theory is an approach to study the vulnerability of a system. We develop an analytical framework and analyze the percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network shows that the damage in the network due to a failure is a continuous function of the size of the failure, i.e., the fraction of failed nodes. In sharp contrast, in NetONet, due to the cascading failures, the percolation transition may be discontinuous and even a single node failure may lead to an abrupt collapse of the system. We demonstrate our general framework for a NetONet composed of n classic Erdős-Rényi (ER) networks, where each network depends on the same number m of other networks, i.e., for a random regular network (RR) formed of interdependent ER networks. The dependency between nodes of different networks is taken as one-to-one correspondence, i.e., a node in one network can depend only on one node in the other network (no-feedback condition). In contrast to a treelike NetONet in which the size of the largest connected cluster (mutual component) depends on n, the loops in the RR NetONet cause the largest connected cluster to depend only on m and the topology of each network but not on n. We also analyzed the extremely vulnerable feedback condition of coupling, where the coupling between nodes of different networks is not one-to-one correspondence. In the case of NetONet formed of ER networks, percolation only exhibits two phases, a second order phase transition and collapse, and no first order percolation transition regime is found in the case of the no-feedback condition. In the case of NetONet composed of RR networks, there exists a first order phase transition when the coupling strength q (fraction of interdependency links) is large and a second order phase transition when q is small. Our insight on the resilience of coupled networks might help in designing robust interdependent systems.

Subjective well-being associated with size of social network and social support of elderly.

PubMed

Wang, Xingmin

2016-06-01

The current study examined the impact of size of social network on subjective well-being of elderly, mainly focused on confirmation of the mediator role of perceived social support. The results revealed that both size of social network and perceived social support were significantly correlated with subjective well-being. Structural equation modeling indicated that perceived social support partially mediated size of social network to subjective well-being. The final model also revealed significant both paths from size of social network to subjective well-being through perceived social support. The findings extended prior researches and provided valuable evidence on how to promote mental health of the elderly. © The Author(s) 2014.

Content-level deduplication on mobile internet datasets

NASA Astrophysics Data System (ADS)

Hou, Ziyu; Chen, Xunxun; Wang, Yang

2017-06-01

Various systems and applications involve a large volume of duplicate items. Based on high data redundancy in real world datasets, data deduplication can reduce storage capacity and improve the utilization of network bandwidth. However, chunks of existing deduplications range in size from 4KB to over 16KB, existing systems are not applicable to the datasets consisting of short records. In this paper, we propose a new framework called SF-Dedup which is able to implement the deduplication process on a large set of Mobile Internet records, the size of records can be smaller than 100B, or even smaller than 10B. SF-Dedup is a short fingerprint, in-line, hash-collisions-resolved deduplication. Results of experimental applications illustrate that SH-Dedup is able to reduce storage capacity and shorten query time on relational database.

Structure and function of airway surface layer of the human lungs & mobility of probe particles in complex fluids

NASA Astrophysics Data System (ADS)

Cai, Liheng

Numerous infectious particles such as bacteria and pathogens are deposited on the airway surface of the human lungs during our daily breathing. To avoid infection the lung has evolved to develop a smart and powerful defense system called mucociliary clearance. The airway surface layer is a critical component of this mucus clearance system, which consists of two parts: (1) a mucus layer, that traps inhaled particles and transports them out of the lung by cilia-generated flow; and (2) a periciliary layer, that provides a favorable environment for ciliary beating and cell surface lubrication. For 75 years, it has been dogma that a single gel-like mucus layer, which is composed of secreted mucin glycoproteins, is transported over a "watery" periciliary layer. This one-gel model, however, does not explain fundamental features of the normal system, e.g. formation of a distinct mucus layer, nor accurately predict how the mucus clearance system fails in disease. In the first part of this thesis we propose a novel "Gel-on-Brush" model with a mucus layer (the "gel") and a "brush-like" periciliary layer, composed of mucins tethered to the luminal of airway surface, and supporting data accurately describes both the biophysical and cell biological bases for normal mucus clearance and its failure in disease. Our "Gel-on-Brush" model describes for the first time how and why mucus is efficiently cleared in health and unifies the pathogenesis of major human diseases, including cystic fibrosis and chronic obstructive pulmonary disease. It is expected that this "Gel-on-Brush" model of airway surface layer opens new directions for treatments of airway diseases. A dilemma regarding the function of mucus is that, although mucus traps any inhaled harmful particulates, it also poses a long-time problem for drug delivery: mobility of cargos carrying pharmaceutical agents is slowed down in mucus. The second part of this thesis aims to answer the question: can we theoretically understand the relation between the motion of a probe particle and the local structure and dynamics of complex fluids such as mucus, or even one step back, simple polymer solutions and gels? It is well known that the thermal motion of a particle in simple solutions like water can be described by Stokes-Einstein relation, in which the mean-square displacement of the particle is (1) linearly proportional to time and (2) inversely proportional to the bulk viscosity of the solution. We found that these two statements become questionable if the particle size is relatively small and the solutions become complex fluids such as polymer solutions and gels. The motion of small particles with size smaller than the entanglement length (network mesh size) of a polymer solution (gel) is sub-diffusive with mean-square displacement proportional to the square root of time at relatively short time scales. Even at long time scales at which the mean-square displacement of the particles is diffusive, the mean-square displacement of the particles is not necessarily determined by the bulk viscosity, and is inversely proportional to an effective viscosity that is much smaller than the bulk value. An interesting question related to the particle motion in polymer gels is whether particles with size larger than the network mesh size can move through the gel? An intuitive answer would be that such large particles are trapped by the local network cages. We argue that the large particles can still diffuse via hopping mechanism, i.e., particles can wait for fluctuations of surrounding network cages that could be large enough to allow them to slip though. This hopping diffusion can be applied to understand the motion of large particles subjected to topological constraints such as permanent or reversible crosslinked networks as well as entanglements in high molecular weight polymer solutions, melts, and networks.

An automated method for finding molecular complexes in large protein interaction networks

PubMed Central

Bader, Gary D; Hogue, Christopher WV

2003-01-01

Background Recent advances in proteomics technologies such as two-hybrid, phage display and mass spectrometry have enabled us to create a detailed map of biomolecular interaction networks. Initial mapping efforts have already produced a wealth of data. As the size of the interaction set increases, databases and computational methods will be required to store, visualize and analyze the information in order to effectively aid in knowledge discovery. Results This paper describes a novel graph theoretic clustering algorithm, "Molecular Complex Detection" (MCODE), that detects densely connected regions in large protein-protein interaction networks that may represent molecular complexes. The method is based on vertex weighting by local neighborhood density and outward traversal from a locally dense seed protein to isolate the dense regions according to given parameters. The algorithm has the advantage over other graph clustering methods of having a directed mode that allows fine-tuning of clusters of interest without considering the rest of the network and allows examination of cluster interconnectivity, which is relevant for protein networks. Protein interaction and complex information from the yeast Saccharomyces cerevisiae was used for evaluation. Conclusion Dense regions of protein interaction networks can be found, based solely on connectivity data, many of which correspond to known protein complexes. The algorithm is not affected by a known high rate of false positives in data from high-throughput interaction techniques. The program is available from . PMID:12525261

Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes.

PubMed

Kyriakopoulos, Charalampos; Grossmann, Gerrit; Wolf, Verena; Bortolussi, Luca

2018-01-01

Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree k_{max} of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large k_{max}. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.

MicroSensors Systems: detection of a dismounted threat

NASA Astrophysics Data System (ADS)

Davis, Bill; Berglund, Victor; Falkofske, Dwight; Krantz, Brian

2005-05-01

The Micro Sensor System (MSS) is a layered sensor network with the goal of detecting dismounted threats approaching high value assets. A low power unattended ground sensor network is dependant on a network protocol for efficiency in order to minimize data transmissions after network establishment. The reduction of network 'chattiness' is a primary driver for minimizing power consumption and is a factor in establishing a low probability of detection and interception. The MSS has developed a unique protocol to meet these challenges. Unattended ground sensor systems are most likely dependant on batteries for power which due to size determines the ability of the sensor to be concealed after placement. To minimize power requirements, overcome size limitations, and maintain a low system cost the MSS utilizes advanced manufacturing processes know as Fluidic Self-Assembly and Chip Scale Packaging. The type of sensing element and the ability to sense various phenomenologies (particularly magnetic) at ranges greater than a few meters limits the effectiveness of a system. The MicroSensor System will overcome these limitations by deploying large numbers of low cost sensors, which is made possible by the advanced manufacturing process used in production of the sensors. The MSS program will provide unprecedented levels of real-time battlefield information which greatly enhances combat situational awareness when integrated with the existing Command, Control, Communications, Computers, Intelligence, Surveillance and Reconnaissance (C4ISR) infrastructure. This system will provide an important boost to realizing the information dominant, network-centric objective of Joint Vision 2020.

Efficient network disintegration under incomplete information: the comic effect of link prediction

NASA Astrophysics Data System (ADS)

Tan, Suo-Yi; Wu, Jun; Lü, Linyuan; Li, Meng-Jun; Lu, Xin

2016-03-01

The study of network disintegration has attracted much attention due to its wide applications, including suppressing the epidemic spreading, destabilizing terrorist network, preventing financial contagion, controlling the rumor diffusion and perturbing cancer networks. The crux of this matter is to find the critical nodes whose removal will lead to network collapse. This paper studies the disintegration of networks with incomplete link information. An effective method is proposed to find the critical nodes by the assistance of link prediction techniques. Extensive experiments in both synthetic and real networks suggest that, by using link prediction method to recover partial missing links in advance, the method can largely improve the network disintegration performance. Besides, to our surprise, we find that when the size of missing information is relatively small, our method even outperforms than the results based on complete information. We refer to this phenomenon as the “comic effect” of link prediction, which means that the network is reshaped through the addition of some links that identified by link prediction algorithms, and the reshaped network is like an exaggerated but characteristic comic of the original one, where the important parts are emphasized.

Efficient network disintegration under incomplete information: the comic effect of link prediction.

PubMed

Tan, Suo-Yi; Wu, Jun; Lü, Linyuan; Li, Meng-Jun; Lu, Xin

2016-03-10

The study of network disintegration has attracted much attention due to its wide applications, including suppressing the epidemic spreading, destabilizing terrorist network, preventing financial contagion, controlling the rumor diffusion and perturbing cancer networks. The crux of this matter is to find the critical nodes whose removal will lead to network collapse. This paper studies the disintegration of networks with incomplete link information. An effective method is proposed to find the critical nodes by the assistance of link prediction techniques. Extensive experiments in both synthetic and real networks suggest that, by using link prediction method to recover partial missing links in advance, the method can largely improve the network disintegration performance. Besides, to our surprise, we find that when the size of missing information is relatively small, our method even outperforms than the results based on complete information. We refer to this phenomenon as the "comic effect" of link prediction, which means that the network is reshaped through the addition of some links that identified by link prediction algorithms, and the reshaped network is like an exaggerated but characteristic comic of the original one, where the important parts are emphasized.

Efficient network disintegration under incomplete information: the comic effect of link prediction

PubMed Central

Tan, Suo-Yi; Wu, Jun; Lü, Linyuan; Li, Meng-Jun; Lu, Xin

2016-01-01

The study of network disintegration has attracted much attention due to its wide applications, including suppressing the epidemic spreading, destabilizing terrorist network, preventing financial contagion, controlling the rumor diffusion and perturbing cancer networks. The crux of this matter is to find the critical nodes whose removal will lead to network collapse. This paper studies the disintegration of networks with incomplete link information. An effective method is proposed to find the critical nodes by the assistance of link prediction techniques. Extensive experiments in both synthetic and real networks suggest that, by using link prediction method to recover partial missing links in advance, the method can largely improve the network disintegration performance. Besides, to our surprise, we find that when the size of missing information is relatively small, our method even outperforms than the results based on complete information. We refer to this phenomenon as the “comic effect” of link prediction, which means that the network is reshaped through the addition of some links that identified by link prediction algorithms, and the reshaped network is like an exaggerated but characteristic comic of the original one, where the important parts are emphasized. PMID:26960247

Effect of crystals and fibrous network polymer additives on cellular morphology of microcellular foams

NASA Astrophysics Data System (ADS)

Miyamoto, Ryoma; Utano, Tatsumi; Yasuhara, Shunya; Ishihara, Shota; Ohshima, Masahiro

2015-05-01

In this study, the core-back foam injection molding was used for preparing microcelluar polypropylene (PP) foam with either a 1,3:2,4 bis-O-(4-methylbenzylidene)-D-sorbitol gelling agent (Gel-all MD) or a fibros network polymer additive (Metablen 3000). Both agent and addiive could effectively control the celluar morphology in foams but somehow different ways. In course of cooling the polymer with Gel-all MD in the mold caity, the agent enhanced the crystal nucleation and resulted in the large number of small crystals. The crystals acted as effective bubble nucleation agent in foaming process. Thus, the agent reduced the cell size and increased the cell density, drastically. Furthermore, the small crystals provided an inhomogenuity to the expanding cell wall and produced the high open cell content with nano-scale fibril structure. Gell-all as well as Metablene 3000 formed a gel-like fibrous network in melt. The network increased the elongational viscosity and tended to prevent the cell wall from breaking up. The foaming temperature window was widened by the presence of the network. Especially, the temperature window where the macro-fibrous structure was formed was expanded to the higher temperature. The effects of crystal nucleating agent and PTFE on crystals' size and number, viscoelsticity, rheological propreties of PP and cellular morphology were compared and thorougly investigated.

Performance Comparison of the Digital Neuromorphic Hardware SpiNNaker and the Neural Network Simulation Software NEST for a Full-Scale Cortical Microcircuit Model

PubMed Central

van Albada, Sacha J.; Rowley, Andrew G.; Senk, Johanna; Hopkins, Michael; Schmidt, Maximilian; Stokes, Alan B.; Lester, David R.; Diesmann, Markus; Furber, Steve B.

2018-01-01

The digital neuromorphic hardware SpiNNaker has been developed with the aim of enabling large-scale neural network simulations in real time and with low power consumption. Real-time performance is achieved with 1 ms integration time steps, and thus applies to neural networks for which faster time scales of the dynamics can be neglected. By slowing down the simulation, shorter integration time steps and hence faster time scales, which are often biologically relevant, can be incorporated. We here describe the first full-scale simulations of a cortical microcircuit with biological time scales on SpiNNaker. Since about half the synapses onto the neurons arise within the microcircuit, larger cortical circuits have only moderately more synapses per neuron. Therefore, the full-scale microcircuit paves the way for simulating cortical circuits of arbitrary size. With approximately 80, 000 neurons and 0.3 billion synapses, this model is the largest simulated on SpiNNaker to date. The scale-up is enabled by recent developments in the SpiNNaker software stack that allow simulations to be spread across multiple boards. Comparison with simulations using the NEST software on a high-performance cluster shows that both simulators can reach a similar accuracy, despite the fixed-point arithmetic of SpiNNaker, demonstrating the usability of SpiNNaker for computational neuroscience applications with biological time scales and large network size. The runtime and power consumption are also assessed for both simulators on the example of the cortical microcircuit model. To obtain an accuracy similar to that of NEST with 0.1 ms time steps, SpiNNaker requires a slowdown factor of around 20 compared to real time. The runtime for NEST saturates around 3 times real time using hybrid parallelization with MPI and multi-threading. However, achieving this runtime comes at the cost of increased power and energy consumption. The lowest total energy consumption for NEST is reached at around 144 parallel threads and 4.6 times slowdown. At this setting, NEST and SpiNNaker have a comparable energy consumption per synaptic event. Our results widen the application domain of SpiNNaker and help guide its development, showing that further optimizations such as synapse-centric network representation are necessary to enable real-time simulation of large biological neural networks. PMID:29875620

Decades of urban growth and development on the Asian megadeltas

NASA Astrophysics Data System (ADS)

Small, Christopher; Sousa, Daniel; Yetman, Gregory; Elvidge, Christopher; MacManus, Kytt

2018-06-01

The current and ongoing expansion of urban areas worldwide represents the largest mass migration in human history. It is well known that the world's coastal zones are associated with large and growing concentrations of population, urban development and economic activity. Among coastal environments, deltas have long been recognized for both benefits and hazards. This is particularly true on the Asian megadeltas, where the majority of the world's deltaic populations reside. Current trends in urban migration, combined with demographic momentum suggest that the already large populations on the Asian megadeltas will continue to grow. In this study, we combine recently released gridded population density (circa 2010) with a newly developed night light change product (1992 to 2012) and a digital elevation model to quantify the spatial distribution of population and development on the nine Asian megadeltas. Bivariate distributions of population as functions of elevation and coastal proximity quantify potential exposure of deltaic populations to flood and coastal hazards. Comparison of these distributions for the Asian megadeltas show very different patterns of habitation with peak population elevations ranging from 2 to 11 m above sea level over a wide range of coastal proximities. Over all nine megadeltas, over 174 million people reside below a peak population elevation of 7 m. Changes in the spatial extent of anthropogenic night light from 1992 to 2012 show widely varying extents and changes of lighted urban development. All of the deltas except the Indus show the greatest increases in night light brightness occurring at elevations <10 m. At global and continental scales, growth of settlements of all sizes takes the form of evolving spatial networks of development. Spatial networks of lighted urban development in Asia show power law scaling properties consistent with other continents, but much higher rates of growth. The three largest networks of development in China all occur on deltas and adjacent lowlands, and are growing faster than the rest of the urban network in China. Since 2000, the Huanghe Delta + North China Plain urban network has surpassed the Japanese urban network in size and may soon connect with the Changjiang Delta + Yangtze River urban network to form the largest conurbation in Asia.

Graphene interfaced perovskite solar cells: Role of graphene flake size

NASA Astrophysics Data System (ADS)

Sakorikar, Tushar; Kavitha, M. K.; Tong, Shi Wun; Vayalamkuzhi, Pramitha; Loh, Kian Ping; Jaiswal, Manu

2018-04-01

Graphene interfaced inverted planar heterojunction perovskite solar cells are fabricated by facile solution method and studied its potential as hole conducting layer. Reduced graphene oxide (rGO) with small and large flake size and Polyethylenedioxythiophene:polystyrene sulfonate (PEDOT:PSS) are utilized as hole conducting layers in different devices. For the solar cell employing PEDOT:PSS as hole conducting layer, 3.8 % photoconversion efficiency is achieved. In case of solar cells fabricated with rGO as hole conducting layer, the efficiency of the device is strongly dependent on flake size. With all other fabrication conditions kept constant, the efficiency of graphene-interfaced solar cell improves by a factor of 6, by changing the flake size of graphene oxide. We attribute this effect to uniform coverage of graphene layer and improved electrical percolation network.

Localization and Classification of Paddy Field Pests using a Saliency Map and Deep Convolutional Neural Network.

PubMed

Liu, Ziyi; Gao, Junfeng; Yang, Guoguo; Zhang, Huan; He, Yong

2016-02-11

We present a pipeline for the visual localization and classification of agricultural pest insects by computing a saliency map and applying deep convolutional neural network (DCNN) learning. First, we used a global contrast region-based approach to compute a saliency map for localizing pest insect objects. Bounding squares containing targets were then extracted, resized to a fixed size, and used to construct a large standard database called Pest ID. This database was then utilized for self-learning of local image features which were, in turn, used for classification by DCNN. DCNN learning optimized the critical parameters, including size, number and convolutional stride of local receptive fields, dropout ratio and the final loss function. To demonstrate the practical utility of using DCNN, we explored different architectures by shrinking depth and width, and found effective sizes that can act as alternatives for practical applications. On the test set of paddy field images, our architectures achieved a mean Accuracy Precision (mAP) of 0.951, a significant improvement over previous methods.

Localization and Classification of Paddy Field Pests using a Saliency Map and Deep Convolutional Neural Network

PubMed Central

Liu, Ziyi; Gao, Junfeng; Yang, Guoguo; Zhang, Huan; He, Yong

2016-01-01

We present a pipeline for the visual localization and classification of agricultural pest insects by computing a saliency map and applying deep convolutional neural network (DCNN) learning. First, we used a global contrast region-based approach to compute a saliency map for localizing pest insect objects. Bounding squares containing targets were then extracted, resized to a fixed size, and used to construct a large standard database called Pest ID. This database was then utilized for self-learning of local image features which were, in turn, used for classification by DCNN. DCNN learning optimized the critical parameters, including size, number and convolutional stride of local receptive fields, dropout ratio and the final loss function. To demonstrate the practical utility of using DCNN, we explored different architectures by shrinking depth and width, and found effective sizes that can act as alternatives for practical applications. On the test set of paddy field images, our architectures achieved a mean Accuracy Precision (mAP) of 0.951, a significant improvement over previous methods. PMID:26864172

An ultra-compact and low loss passive beam-forming network integrated on chip with off chip linear array

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

Lepkowski, Stefan Mark

2015-05-01

The work here presents a review of beam forming architectures. As an example, the author presents an 8x8 Butler Matrix passive beam forming network including the schematic, design/modeling, operation, and simulated results. The limiting factor in traditional beam formers has been the large size dictated by transmission line based couplers. By replacing these couplers with transformer-based couplers, the matrix size is reduced substantially allowing for on chip compact integration. In the example presented, the core area, including the antenna crossover, measures 0.82mm×0.39mm (0.48% the size of a branch line coupler at the same frequency). The simulated beam forming achieves amore » peak PNR of 17.1 dB and 15dB from 57 to 63GHz. At the 60GHz center frequency the average insertion loss is simulated to be 3.26dB. The 8x8 Butler Matrix feeds into an 8-element antenna array to show the array patterns with single beam and adjacent beam isolation.« less

Allometric relationships between traveltime channel networks, convex hulls, and convexity measures

NASA Astrophysics Data System (ADS)

Tay, Lea Tien; Sagar, B. S. Daya; Chuah, Hean Teik

2006-06-01

The channel network (S) is a nonconvex set, while its basin [C(S)] is convex. We remove open-end points of the channel connectivity network iteratively to generate a traveltime sequence of networks (Sn). The convex hulls of these traveltime networks provide an interesting topological quantity, which has not been noted thus far. We compute lengths of shrinking traveltime networks L(Sn) and areas of corresponding convex hulls C(Sn), the ratios of which provide convexity measures CM(Sn) of traveltime networks. A statistically significant scaling relationship is found for a model network in the form L(Sn) ˜ A[C(Sn)]0.57. From the plots of the lengths of these traveltime networks and the areas of their corresponding convex hulls as functions of convexity measures, new power law relations are derived. Such relations for a model network are CM(Sn) ˜ ? and CM(Sn) ˜ ?. In addition to the model study, these relations for networks derived from seven subbasins of Cameron Highlands region of Peninsular Malaysia are provided. Further studies are needed on a large number of channel networks of distinct sizes and topologies to understand the relationships of these new exponents with other scaling exponents that define the scaling structure of river networks.

RECON - A new system for probing the outer solar system with stellar occultations

NASA Astrophysics Data System (ADS)

Buie, M. W.; Keller, J. M.; Wasserman, L. H.

2015-10-01

The Research and Education Collaborative Occultation Network (RECON) is a new system for coordinated occultation observations of outer solar system objects. Occultations by objects in the outer solar system are more difficult to predict due to their large distance and limited duration of the astrometric data used to determine their orbits and positions. This project brings together the research and educational community into a unique citizen-science partnership to overcome the difficulties of observing these distant objects. The goal of the project is to get sizes and shapes for TNOs with diameters larger than 100 km. As a result of the system design it will also serve as a probe for binary systems with spatial separations too small to be resolved directly. Our system takes the new approach of setting up a large number of fixed observing stations and letting the shadows come to the network. The nominal spacing of the stations is 50 km. The spread of the network is roughly 2000 km along a roughly north-south line in the western United States. The network contains 56 stations that are committed to the project and we get additional ad hoc support from the International Occultation Timing Association. At our minimum size, two stations will record an event while the other stations will be probing for secondary events. Larger objects will get more chords and will allow determination of shape profiles. The stations are almost exclusively sited and associated with schools, usually at the 9-12 grade level. We have successfully completed our first TNO observation which is presented in the compainion paper by G. Rossi et al (this conference).

On Applications of Disruption Tolerant Networking to Optical Networking in Space

NASA Technical Reports Server (NTRS)

Hylton, Alan Guy; Raible, Daniel E.; Juergens, Jeffrey; Iannicca, Dennis

2012-01-01

The integration of optical communication links into space networks via Disruption Tolerant Networking (DTN) is a largely unexplored area of research. Building on successful foundational work accomplished at JPL, we discuss a multi-hop multi-path network featuring optical links. The experimental test bed is constructed at the NASA Glenn Research Center featuring multiple Ethernet-to-fiber converters coupled with free space optical (FSO) communication channels. The test bed architecture models communication paths from deployed Mars assets to the deep space network (DSN) and finally to the mission operations center (MOC). Reliable versus unreliable communication methods are investigated and discussed; including reliable transport protocols, custody transfer, and fragmentation. Potential commercial applications may include an optical communications infrastructure deployment to support developing nations and remote areas, which are unburdened with supporting an existing heritage means of telecommunications. Narrow laser beam widths and control of polarization states offer inherent physical layer security benefits with optical communications over RF solutions. This paper explores whether or not DTN is appropriate for space-based optical networks, optimal payload sizes, reliability, and a discussion on security.

Informing the network: Improving communication with interface communities during wildland fire

USGS Publications Warehouse

Taylor, J.G.; Gillette, S.C.; Hodgson, R.W.; Downing, J.L.; Burns, M.R.; Chavez, D.J.; Hogan, J.T.

2007-01-01

An interagency research team studied fire communications that took place during different stages of two wildfires in southern California: one small fire of short duration and one large fire of long duration. This "quick- response" research showed that pre-fire communication planning was particularly effective for smaller fire events and parts of that planning proved invaluable for the large fire event as well. Information seeking by the affected public relied on locally convenient sources during the small fire. During the large fire, widespread evacuations disrupted many of the local informal communication networks. Residents' needs were for "real-time, " place-specific information: precise location, severity, size, and direction of spread of the fires. Fire management agencies must contribute real-time, place-specific fire information when it is most needed by the affected public, as they try to make sense out of the chaos of a wildland fire. Disseminating fire information as broadly as possible through multiple pathways will maximize the probability of the public finding the information they need. ?? Society for Human Ecology.

Landscape attributes and life history variability shape genetic structure of trout populations in a stream network

USGS Publications Warehouse

Neville, H.M.; Dunham, J.B.; Peacock, M.M.

2006-01-01

Spatial and temporal landscape patterns have long been recognized to influence biological processes, but these processes often operate at scales that are difficult to study by conventional means. Inferences from genetic markers can overcome some of these limitations. We used a landscape genetics approach to test hypotheses concerning landscape processes influencing the demography of Lahontan cutthroat trout in a complex stream network in the Great Basin desert of the western US. Predictions were tested with population- and individual-based analyses of microsatellite DNA variation, reflecting patterns of dispersal, population stability, and local effective population sizes. Complementary genetic inferences suggested samples from migratory corridors housed a mixture of fish from tributaries, as predicted based on assumed migratory life histories in those habitats. Also as predicted, populations presumed to have greater proportions of migratory fish or from physically connected, large, or high quality habitats had higher genetic variability and reduced genetic differentiation from other populations. Populations thought to contain largely non-migratory individuals generally showed the opposite pattern, suggesting behavioral isolation. Estimated effective sizes were small, and we identified significant and severe genetic bottlenecks in several populations that were isolated, recently founded, or that inhabit streams that desiccate frequently. Overall, this work suggested that Lahontan cutthroat trout populations in stream networks are affected by a combination of landscape and metapopulation processes. Results also demonstrated that genetic patterns can reveal unexpected processes, even within a system that is well studied from a conventional ecological perspective. ?? Springer 2006.

Normalization of similarity-based individual brain networks from gray matter MRI and its association with neurodevelopment in infants with intrauterine growth restriction.

PubMed

Batalle, Dafnis; Muñoz-Moreno, Emma; Figueras, Francesc; Bargallo, Nuria; Eixarch, Elisenda; Gratacos, Eduard

2013-12-01

Obtaining individual biomarkers for the prediction of altered neurological outcome is a challenge of modern medicine and neuroscience. Connectomics based on magnetic resonance imaging (MRI) stands as a good candidate to exhaustively extract information from MRI by integrating the information obtained in a few network features that can be used as individual biomarkers of neurological outcome. However, this approach typically requires the use of diffusion and/or functional MRI to extract individual brain networks, which require high acquisition times and present an extreme sensitivity to motion artifacts, critical problems when scanning fetuses and infants. Extraction of individual networks based on morphological similarity from gray matter is a new approach that benefits from the power of graph theory analysis to describe gray matter morphology as a large-scale morphological network from a typical clinical anatomic acquisition such as T1-weighted MRI. In the present paper we propose a methodology to normalize these large-scale morphological networks to a brain network with standardized size based on a parcellation scheme. The proposed methodology was applied to reconstruct individual brain networks of 63 one-year-old infants, 41 infants with intrauterine growth restriction (IUGR) and 22 controls, showing altered network features in the IUGR group, and their association with neurodevelopmental outcome at two years of age by means of ordinal regression analysis of the network features obtained with Bayley Scale for Infant and Toddler Development, third edition. Although it must be more widely assessed, this methodology stands as a good candidate for the development of biomarkers for altered neurodevelopment in the pediatric population. © 2013 Elsevier Inc. All rights reserved.

Higher-Order Neural Networks Applied to 2D and 3D Object Recognition

NASA Technical Reports Server (NTRS)

Spirkovska, Lilly; Reid, Max B.

1994-01-01

A Higher-Order Neural Network (HONN) can be designed to be invariant to geometric transformations such as scale, translation, and in-plane rotation. Invariances are built directly into the architecture of a HONN and do not need to be learned. Thus, for 2D object recognition, the network needs to be trained on just one view of each object class, not numerous scaled, translated, and rotated views. Because the 2D object recognition task is a component of the 3D object recognition task, built-in 2D invariance also decreases the size of the training set required for 3D object recognition. We present results for 2D object recognition both in simulation and within a robotic vision experiment and for 3D object recognition in simulation. We also compare our method to other approaches and show that HONNs have distinct advantages for position, scale, and rotation-invariant object recognition. The major drawback of HONNs is that the size of the input field is limited due to the memory required for the large number of interconnections in a fully connected network. We present partial connectivity strategies and a coarse-coding technique for overcoming this limitation and increasing the input field to that required by practical object recognition problems.

The social brain: scale-invariant layering of Erdős-Rényi networks in small-scale human societies.

PubMed

Harré, Michael S; Prokopenko, Mikhail

2016-05-01

The cognitive ability to form social links that can bind individuals together into large cooperative groups for safety and resource sharing was a key development in human evolutionary and social history. The 'social brain hypothesis' argues that the size of these social groups is based on a neurologically constrained capacity for maintaining long-term stable relationships. No model to date has been able to combine a specific socio-cognitive mechanism with the discrete scale invariance observed in ethnographic studies. We show that these properties result in nested layers of self-organizing Erdős-Rényi networks formed by each individual's ability to maintain only a small number of social links. Each set of links plays a specific role in the formation of different social groups. The scale invariance in our model is distinct from previous 'scale-free networks' studied using much larger social groups; here, the scale invariance is in the relationship between group sizes, rather than in the link degree distribution. We also compare our model with a dominance-based hierarchy and conclude that humans were probably egalitarian in hunter-gatherer-like societies, maintaining an average maximum of four or five social links connecting all members in a largest social network of around 132 people. © 2016 The Author(s).

Image quality assessment using deep convolutional networks

NASA Astrophysics Data System (ADS)

Li, Yezhou; Ye, Xiang; Li, Yong

2017-12-01

This paper proposes a method of accurately assessing image quality without a reference image by using a deep convolutional neural network. Existing training based methods usually utilize a compact set of linear filters for learning features of images captured by different sensors to assess their quality. These methods may not be able to learn the semantic features that are intimately related with the features used in human subject assessment. Observing this drawback, this work proposes training a deep convolutional neural network (CNN) with labelled images for image quality assessment. The ReLU in the CNN allows non-linear transformations for extracting high-level image features, providing a more reliable assessment of image quality than linear filters. To enable the neural network to take images of any arbitrary size as input, the spatial pyramid pooling (SPP) is introduced connecting the top convolutional layer and the fully-connected layer. In addition, the SPP makes the CNN robust to object deformations to a certain extent. The proposed method taking an image as input carries out an end-to-end learning process, and outputs the quality of the image. It is tested on public datasets. Experimental results show that it outperforms existing methods by a large margin and can accurately assess the image quality on images taken by different sensors of varying sizes.

Understanding the Collaborative Planning Process in Homeless Services: Networking, Advocacy, and Local Government Support May Reduce Service Gaps.

PubMed

Jarpe, Meghan; Mosley, Jennifer E; Smith, Bikki Tran

2018-06-07

The Continuum of Care (CoC) process-a nationwide system of regional collaborative planning networks addressing homelessness-is the chief administrative method utilized by the US Department of Housing and Urban Development to prevent and reduce homelessness in the United States. The objective of this study is to provide a benchmark comprehensive picture of the structure and practices of CoC networks, as well as information about which of those factors are associated with lower service gaps, a key goal of the initiative. A national survey of the complete population of CoCs in the United States was conducted in 2014 (n = 312, 75% response rate). This survey is the first to gather information on all available CoC networks. Ordinary least squares (OLS) regression was used to determine the relationship between internal networking, advocacy frequency, government investment, and degree of service gaps for CoCs of different sizes. United States. Lead contacts for CoCs (n = 312) that responded to the 2014 survey. Severity of regional service gaps for people who are homeless. Descriptive statistics show that CoCs vary considerably in regard to size, leadership, membership, and other organizational characteristics. Several independent variables were associated with reduced regional service gaps: networking for small CoCs (β = -.39, P < .05) and local government support for midsized CoCs (β = -.10, P < .05). For large CoCs, local government support was again significantly associated with lower service gaps, but there was also a significant interaction effect between advocacy and networking (β = .04, P < .05). To reduce service gaps and better serve the homeless, CoCs should consider taking steps to improve networking, particularly when advocacy is out of reach, and cultivate local government investment and support.

Cosmic string induced peculiar velocities

NASA Technical Reports Server (NTRS)

Van Dalen, Anthony; Schramm, David N.

1988-01-01

This paper considers the scenario of a flat universe with a network of heavy cosmic strings as the primordial fluctuation spectrum. The joint probability of finding streaming velocities of at least 600 km/s on large scales and local peculiar velocities of less than 800 km/s is calculated. It is shown how the effects of loops breaking up and being born with a spectrum of sizes can be estimated. It is found that to obtain large-scale streaming velocities of at least 600 km/s, it is necessary that either a large value for beta G mu exist or the effect of loop fissioning and production details be considerable.

Naming Game on Networks: Let Everyone be Both Speaker and Hearer

PubMed Central

Gao, Yuan; Chen, Guanrong; Chan, Rosa H. M.

2014-01-01

To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks. PMID:25143140

A local immunization strategy for networks with overlapping community structure

NASA Astrophysics Data System (ADS)

Taghavian, Fatemeh; Salehi, Mostafa; Teimouri, Mehdi

2017-02-01

Since full coverage treatment is not feasible due to limited resources, we need to utilize an immunization strategy to effectively distribute the available vaccines. On the other hand, the structure of contact network among people has a significant impact on epidemics of infectious diseases (such as SARS and influenza) in a population. Therefore, network-based immunization strategies aim to reduce the spreading rate by removing the vaccinated nodes from contact network. Such strategies try to identify more important nodes in epidemics spreading over a network. In this paper, we address the effect of overlapping nodes among communities on epidemics spreading. The proposed strategy is an optimized random-walk based selection of these nodes. The whole process is local, i.e. it requires contact network information in the level of nodes. Thus, it is applicable to large-scale and unknown networks in which the global methods usually are unrealizable. Our simulation results on different synthetic and real networks show that the proposed method outperforms the existing local methods in most cases. In particular, for networks with strong community structures, high overlapping membership of nodes or small size communities, the proposed method shows better performance.

Mobilizing homeless youth for HIV prevention: a social network analysis of the acceptability of a face-to-face and online social networking intervention.

PubMed

Rice, Eric; Tulbert, Eve; Cederbaum, Julie; Barman Adhikari, Anamika; Milburn, Norweeta G

2012-04-01

The objective of the study is to use social network analysis to examine the acceptability of a youth-led, hybrid face-to-face and online social networking HIV prevention program for homeless youth.Seven peer leaders (PLs) engaged face-to-face homeless youth (F2F) in the creation of digital media projects (e.g. You Tube videos). PL and F2F recruited online youth (OY) to participate in MySpace and Facebook communities where digital media was disseminated and discussed. The resulting social networks were assessed with respect to size, growth, density, relative centrality of positions and homophily of ties. Seven PL, 53 F2F and 103 OY created two large networks. After the first 50 F2F youth participated, online networks entered a rapid growth phase. OY were among the most central youth in these networks. Younger aged persons and females were disproportionately connected to like youth. The program appears highly acceptable to homeless youth. Social network analysis revealed which PL were the most critical to the program and which types of participants (younger youth and females) may require additional outreach efforts in the future.

Mobilizing homeless youth for HIV prevention: a social network analysis of the acceptability of a face-to-face and online social networking intervention

PubMed Central

Rice, Eric; Tulbert, Eve; Cederbaum, Julie; Barman Adhikari, Anamika; Milburn, Norweeta G.

2012-01-01

The objective of the study is to use social network analysis to examine the acceptability of a youth-led, hybrid face-to-face and online social networking HIV prevention program for homeless youth.Seven peer leaders (PLs) engaged face-to-face homeless youth (F2F) in the creation of digital media projects (e.g. You Tube videos). PL and F2F recruited online youth (OY) to participate in MySpace and Facebook communities where digital media was disseminated and discussed. The resulting social networks were assessed with respect to size, growth, density, relative centrality of positions and homophily of ties. Seven PL, 53 F2F and 103 OY created two large networks. After the first 50 F2F youth participated, online networks entered a rapid growth phase. OY were among the most central youth in these networks. Younger aged persons and females were disproportionately connected to like youth. The program appears highly acceptable to homeless youth. Social network analysis revealed which PL were the most critical to the program and which types of participants (younger youth and females) may require additional outreach efforts in the future. PMID:22247453

Naming Game on Networks: Let Everyone be Both Speaker and Hearer

NASA Astrophysics Data System (ADS)

Gao, Yuan; Chen, Guanrong; Chan, Rosa H. M.

2014-08-01

To investigate how consensus is reached on a large self-organized peer-to-peer network, we extended the naming game model commonly used in language and communication to Naming Game in Groups (NGG). Differing from other existing naming game models, in NGG everyone in the population (network) can be both speaker and hearer simultaneously, which resembles in a closer manner to real-life scenarios. Moreover, NGG allows the transmission (communication) of multiple words (opinions) for multiple intra-group consensuses. The communications among indirectly-connected nodes are also enabled in NGG. We simulated and analyzed the consensus process in some typical network topologies, including random-graph networks, small-world networks and scale-free networks, to better understand how global convergence (consensus) could be reached on one common word. The results are interpreted on group negotiation of a peer-to-peer network, which shows that global consensus in the population can be reached more rapidly when more opinions are permitted within each group or when the negotiating groups in the population are larger in size. The novel features and properties introduced by our model have demonstrated its applicability in better investigating general consensus problems on peer-to-peer networks.

HONTIOR - HIGHER-ORDER NEURAL NETWORK FOR TRANSFORMATION INVARIANT OBJECT RECOGNITION

NASA Technical Reports Server (NTRS)

Spirkovska, L.

1994-01-01

Neural networks have been applied in numerous fields, including transformation invariant object recognition, wherein an object is recognized despite changes in the object's position in the input field, size, or rotation. One of the more successful neural network methods used in invariant object recognition is the higher-order neural network (HONN) method. With a HONN, known relationships are exploited and the desired invariances are built directly into the architecture of the network, eliminating the need for the network to learn invariance to transformations. This results in a significant reduction in the training time required, since the network needs to be trained on only one view of each object, not on numerous transformed views. Moreover, one hundred percent accuracy is guaranteed for images characterized by the built-in distortions, providing noise is not introduced through pixelation. The program HONTIOR implements a third-order neural network having invariance to translation, scale, and in-plane rotation built directly into the architecture, Thus, for 2-D transformation invariance, the network needs only to be trained on just one view of each object. HONTIOR can also be used for 3-D transformation invariant object recognition by training the network only on a set of out-of-plane rotated views. Historically, the major drawback of HONNs has been that the size of the input field was limited to the memory required for the large number of interconnections in a fully connected network. HONTIOR solves this problem by coarse coding the input images (coding an image as a set of overlapping but offset coarser images). Using this scheme, large input fields (4096 x 4096 pixels) can easily be represented using very little virtual memory (30Mb). The HONTIOR distribution consists of three main programs. The first program contains the training and testing routines for a third-order neural network. The second program contains the same training and testing procedures as the first, but it also contains a number of functions to display and edit training and test images. Finally, the third program is an auxiliary program which calculates the included angles for a given input field size. HONTIOR is written in C language, and was originally developed for Sun3 and Sun4 series computers. Both graphic and command line versions of the program are provided. The command line version has been successfully compiled and executed both on computers running the UNIX operating system and on DEC VAX series computer running VMS. The graphic version requires the SunTools windowing environment, and therefore runs only on Sun series computers. The executable for the graphics version of HONTIOR requires 1Mb of RAM. The standard distribution medium for HONTIOR is a .25 inch streaming magnetic tape cartridge in UNIX tar format. It is also available on a 3.5 inch diskette in UNIX tar format. The package includes sample input and output data. HONTIOR was developed in 1991. Sun, Sun3 and Sun4 are trademarks of Sun Microsystems, Inc. UNIX is a registered trademark of AT&T Bell Laboratories. DEC, VAX, and VMS are trademarks of Digital Equipment Corporation.

Mental health network governance: comparative analysis across Canadian regions.

PubMed

Wiktorowicz, Mary E; Fleury, Marie-Josée; Adair, Carol E; Lesage, Alain; Goldner, Elliot; Peters, Suzanne

2010-10-26

Modes of governance were compared in ten local mental health networks in diverse contexts (rural/urban and regionalized/non-regionalized) to clarify the governance processes that foster inter-organizational collaboration and the conditions that support them. Case studies of ten local mental health networks were developed using qualitative methods of document review, semi-structured interviews and focus groups that incorporated provincial policy, network and organizational levels of analysis. Mental health networks adopted either a corporate structure, mutual adjustment or an alliance governance model. A corporate structure supported by regionalization offered the most direct means for local governance to attain inter-organizational collaboration. The likelihood that networks with an alliance model developed coordination processes depended on the presence of the following conditions: a moderate number of organizations, goal consensus and trust among the organizations, and network-level competencies. In the small and mid-sized urban networks where these conditions were met their alliance realized the inter-organizational collaboration sought. In the large urban and rural networks where these conditions were not met, externally brokered forms of network governance were required to support alliance based models. In metropolitan and rural networks with such shared forms of network governance as an alliance or voluntary mutual adjustment, external mediation by a regional or provincial authority was an important lever to foster inter-organizational collaboration.

Uncovering the spatial structure of mobility networks

NASA Astrophysics Data System (ADS)

Louail, Thomas; Lenormand, Maxime; Picornell, Miguel; García Cantú, Oliva; Herranz, Ricardo; Frias-Martinez, Enrique; Ramasco, José J.; Barthelemy, Marc

2015-01-01

The extraction of a clear and simple footprint of the structure of large, weighted and directed networks is a general problem that has relevance for many applications. An important example is seen in origin-destination matrices, which contain the complete information on commuting flows, but are difficult to analyze and compare. We propose here a versatile method, which extracts a coarse-grained signature of mobility networks, under the form of a 2 × 2 matrix that separates the flows into four categories. We apply this method to origin-destination matrices extracted from mobile phone data recorded in 31 Spanish cities. We show that these cities essentially differ by their proportion of two types of flows: integrated (between residential and employment hotspots) and random flows, whose importance increases with city size. Finally, the method allows the determination of categories of networks, and in the mobility case, the classification of cities according to their commuting structure.

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

Dorier, Matthieu; Mubarak, Misbah; Ross, Rob

Two-tiered direct network topologies such as Dragonflies have been proposed for future post-petascale and exascale machines, since they provide a high-radix, low-diameter, fast interconnection network. Such topologies call for redesigning MPI collective communication algorithms in order to attain the best performance. Yet as increasingly more applications share a machine, it is not clear how these topology-aware algorithms will react to interference with concurrent jobs accessing the same network. In this paper, we study three topology-aware broadcast algorithms, including one designed by ourselves. We evaluate their performance through event-driven simulation for small- and large-sized broadcasts (in terms of both data sizemore » and number of processes). We study the effect of different routing mechanisms on the topology-aware collective algorithms, as well as their sensitivity to network contention with other jobs. Our results show that while topology-aware algorithms dramatically reduce link utilization, their advantage in terms of latency is more limited.« less

Formation of Molecular Networks: Tailored Quantum Boxes and Behavior of Adsorbed CO in Them

NASA Astrophysics Data System (ADS)

Wyrick, Jon; Sun, Dezheng; Kim, Dae-Ho; Cheng, Zhihai; Lu, Wenhao; Zhu, Yeming; Luo, Miaomiao; Kim, Yong Su; Rotenberg, Eli; Kim, Kwangmoo; Einstein, T. L.; Bartels, Ludwig

2011-03-01

We show that the behavior of CO adsorbed into the pores of large regular networks on Cu(111) is significantly affected by their nano-scale lateral confinement and that formation of the networks themselves is directed by the Shockley surface state. Saturation coverages of CO are found to exhibit persistent dislocation lines; at lower coverages their mobility increases. Individual CO within the pores titrate the surface state, providing crucial information for understanding formation of the network as a result of optimization of the number N of electrons bound within each pore. Determination of N is based on quinone-coverage-dependent UPS data and an analysis of states of particles in a pore-shaped box (verified by CO's titration); a wide range of possible pore shapes and sizes has been considered. Work at UCR supported by NSF CHE 07-49949; at UMD by NSF CHE 07-50334 & UMD NSF-MRSEC DMR 05-20471.

Hysteretic transitions in the Kuramoto model with inertia.

PubMed

Olmi, Simona; Navas, Adrian; Boccaletti, Stefano; Torcini, Alessandro

2014-10-01

We report finite-size numerical investigations and mean-field analysis of a Kuramoto model with inertia for fully coupled and diluted systems. In particular, we examine, for a gaussian distribution of the frequencies, the transition from incoherence to coherence for increasingly large system size and inertia. For sufficiently large inertia the transition is hysteretic, and within the hysteretic region clusters of locked oscillators of various sizes and different levels of synchronization coexist. A modification of the mean-field theory developed by Tanaka, Lichtenberg, and Oishi [Physica D 100, 279 (1997)] allows us to derive the synchronization curve associated to each of these clusters. We have also investigated numerically the limits of existence of the coherent and of the incoherent solutions. The minimal coupling required to observe the coherent state is largely independent of the system size, and it saturates to a constant value already for moderately large inertia values. The incoherent state is observable up to a critical coupling whose value saturates for large inertia and for finite system sizes, while in the thermodinamic limit this critical value diverges proportionally to the mass. By increasing the inertia the transition becomes more complex, and the synchronization occurs via the emergence of clusters of whirling oscillators. The presence of these groups of coherently drifting oscillators induces oscillations in the order parameter. We have shown that the transition remains hysteretic even for randomly diluted networks up to a level of connectivity corresponding to a few links per oscillator. Finally, an application to the Italian high-voltage power grid is reported, which reveals the emergence of quasiperiodic oscillations in the order parameter due to the simultaneous presence of many competing whirling clusters.

Population size estimation of men who have sex with men through the network scale-up method in Japan.

PubMed

Ezoe, Satoshi; Morooka, Takeo; Noda, Tatsuya; Sabin, Miriam Lewis; Koike, Soichi

2012-01-01

Men who have sex with men (MSM) are one of the groups most at risk for HIV infection in Japan. However, size estimates of MSM populations have not been conducted with sufficient frequency and rigor because of the difficulty, high cost and stigma associated with reaching such populations. This study examined an innovative and simple method for estimating the size of the MSM population in Japan. We combined an internet survey with the network scale-up method, a social network method for estimating the size of hard-to-reach populations, for the first time in Japan. An internet survey was conducted among 1,500 internet users who registered with a nationwide internet-research agency. The survey participants were asked how many members of particular groups with known population sizes (firepersons, police officers, and military personnel) they knew as acquaintances. The participants were also asked to identify the number of their acquaintances whom they understood to be MSM. Using these survey results with the network scale-up method, the personal network size and MSM population size were estimated. The personal network size was estimated to be 363.5 regardless of the sex of the acquaintances and 174.0 for only male acquaintances. The estimated MSM prevalence among the total male population in Japan was 0.0402% without adjustment, and 2.87% after adjusting for the transmission error of MSM. The estimated personal network size and MSM prevalence seen in this study were comparable to those from previous survey results based on the direct-estimation method. Estimating population sizes through combining an internet survey with the network scale-up method appeared to be an effective method from the perspectives of rapidity, simplicity, and low cost as compared with more-conventional methods.

The Relationship of Age to Personal Network Size, Relational Multiplexity, and Proximity to Alters in the Western United States

PubMed Central

Smith, Emily J.; Marcum, Christopher S.; Boessen, Adam; Almquist, Zack W.; Hipp, John R.; Nagle, Nicholas N.

2015-01-01

Objectives. This study examines the association of age and other sociodemographic variables with properties of personal networks; using samples of individuals residing in the rural western United States and the City of Los Angeles, we evaluate the degree to which these associations vary with geographical context. For both samples, we test the hypothesis that age is negatively associated with network size (i.e., degree) and positively associated with network multiplexity (the extent of overlap) on 6 different relations: core discussion members, social activity participants, emergency contacts, neighborhood safety contacts, job informants, and kin. We also examine the relationship between age and spatial proximity to alters. Method. Our data consist of a large-scale, spatially stratified egocentric network survey containing information about respondents and those to whom they are tied. We use Poisson regression to test our hypothesis regarding degree while adjusting for covariates, including education, gender, race, and self-reported sense of neighborhood belonging. We use multiple linear regression to test our hypotheses on multiplexity and distance to alters. Results. For both rural and urban populations, we find a nonmonotone association between age and numbers of core discussants and emergency contacts, with rural populations also showing nonmonotone associations for social activity partners and kin. These nonmonotone relationships show a peak in expected degree at midlife, followed by an eventual decline. We find a decline in degree among the elderly for all relations in both populations. Age is positively associated with distance to nonhousehold alters for the rural population, although residential tenure is associated with shorter ego-alter distances in both rural and urban settings. Additionally, age is negatively associated with network multiplexity for both populations. Discussion. Although personal network size ultimately declines with age, we find that increases for some relations extend well into late-midlife and most elders still maintain numerous contacts across diverse relations. The evidence we present suggests that older people tap into an wider variety of different network members for different types of relations than do younger people. This is true even for populations in rural settings, for whom immediate access to potential alters is more limited. PMID:25324292

Topology reduction in deep convolutional feature extraction networks

NASA Astrophysics Data System (ADS)

Wiatowski, Thomas; Grohs, Philipp; Bölcskei, Helmut

2017-08-01

Deep convolutional neural networks (CNNs) used in practice employ potentially hundreds of layers and 10,000s of nodes. Such network sizes entail significant computational complexity due to the large number of convolutions that need to be carried out; in addition, a large number of parameters needs to be learned and stored. Very deep and wide CNNs may therefore not be well suited to applications operating under severe resource constraints as is the case, e.g., in low-power embedded and mobile platforms. This paper aims at understanding the impact of CNN topology, specifically depth and width, on the network's feature extraction capabilities. We address this question for the class of scattering networks that employ either Weyl-Heisenberg filters or wavelets, the modulus non-linearity, and no pooling. The exponential feature map energy decay results in Wiatowski et al., 2017, are generalized to O(a-N), where an arbitrary decay factor a > 1 can be realized through suitable choice of the Weyl-Heisenberg prototype function or the mother wavelet. We then show how networks of fixed (possibly small) depth N can be designed to guarantee that ((1 - ɛ) · 100)% of the input signal's energy are contained in the feature vector. Based on the notion of operationally significant nodes, we characterize, partly rigorously and partly heuristically, the topology-reducing effects of (effectively) band-limited input signals, band-limited filters, and feature map symmetries. Finally, for networks based on Weyl-Heisenberg filters, we determine the prototype function bandwidth that minimizes - for fixed network depth N - the average number of operationally significant nodes per layer.

Network analysis of functional brain connectivity in borderline personality disorder using resting-state fMRI

PubMed Central

Xu, Tingting; Cullen, Kathryn R.; Mueller, Bryon; Schreiner, Mindy W.; Lim, Kelvin O.; Schulz, S. Charles; Parhi, Keshab K.

2016-01-01

Borderline personality disorder (BPD) is associated with symptoms such as affect dysregulation, impaired sense of self, and self-harm behaviors. Neuroimaging research on BPD has revealed structural and functional abnormalities in specific brain regions and connections. However, little is known about the topological organizations of brain networks in BPD. We collected resting-state functional magnetic resonance imaging (fMRI) data from 20 patients with BPD and 10 healthy controls, and constructed frequency-specific functional brain networks by correlating wavelet-filtered fMRI signals from 82 cortical and subcortical regions. We employed graph-theory based complex network analysis to investigate the topological properties of the brain networks, and employed network-based statistic to identify functional dysconnections in patients. In the 0.03–0.06 Hz frequency band, compared to controls, patients with BPD showed significantly larger measures of global network topology, including the size of largest connected graph component, clustering coefficient, small-worldness, and local efficiency, indicating increased local cliquishness of the functional brain network. Compared to controls, patients showed lower nodal centrality at several hub nodes but greater centrality at several non-hub nodes in the network. Furthermore, an interconnected subnetwork in 0.03–0.06 Hz frequency band was identified that showed significantly lower connectivity in patients. The links in the subnetwork were mainly long-distance connections between regions located at different lobes; and the mean connectivity of this subnetwork was negatively correlated with the increased global topology measures. Lastly, the key network measures showed high correlations with several clinical symptom scores, and classified BPD patients against healthy controls with high accuracy based on linear discriminant analysis. The abnormal topological properties and connectivity found in this study may add new knowledge to the current understanding of functional brain networks in BPD. However, due to limitation of small sample sizes, the results of the current study should be viewed as exploratory and need to be validated on large samples in future works. PMID:26977400

Network analysis of functional brain connectivity in borderline personality disorder using resting-state fMRI.

PubMed

Xu, Tingting; Cullen, Kathryn R; Mueller, Bryon; Schreiner, Mindy W; Lim, Kelvin O; Schulz, S Charles; Parhi, Keshab K

2016-01-01

Borderline personality disorder (BPD) is associated with symptoms such as affect dysregulation, impaired sense of self, and self-harm behaviors. Neuroimaging research on BPD has revealed structural and functional abnormalities in specific brain regions and connections. However, little is known about the topological organizations of brain networks in BPD. We collected resting-state functional magnetic resonance imaging (fMRI) data from 20 patients with BPD and 10 healthy controls, and constructed frequency-specific functional brain networks by correlating wavelet-filtered fMRI signals from 82 cortical and subcortical regions. We employed graph-theory based complex network analysis to investigate the topological properties of the brain networks, and employed network-based statistic to identify functional dysconnections in patients. In the 0.03-0.06 Hz frequency band, compared to controls, patients with BPD showed significantly larger measures of global network topology, including the size of largest connected graph component, clustering coefficient, small-worldness, and local efficiency, indicating increased local cliquishness of the functional brain network. Compared to controls, patients showed lower nodal centrality at several hub nodes but greater centrality at several non-hub nodes in the network. Furthermore, an interconnected subnetwork in 0.03-0.06 Hz frequency band was identified that showed significantly lower connectivity in patients. The links in the subnetwork were mainly long-distance connections between regions located at different lobes; and the mean connectivity of this subnetwork was negatively correlated with the increased global topology measures. Lastly, the key network measures showed high correlations with several clinical symptom scores, and classified BPD patients against healthy controls with high accuracy based on linear discriminant analysis. The abnormal topological properties and connectivity found in this study may add new knowledge to the current understanding of functional brain networks in BPD. However, due to limitation of small sample sizes, the results of the current study should be viewed as exploratory and need to be validated on large samples in future works.

Comparison of Dolphins' Body and Brain Measurements with Four Other Groups of Cetaceans Reveals Great Diversity.

PubMed

Ridgway, Sam H; Carlin, Kevin P; Van Alstyne, Kaitlin R; Hanson, Alicia C; Tarpley, Raymond J

2016-01-01

We compared mature dolphins with 4 other groupings of mature cetaceans. With a large data set, we found great brain diversity among 5 different taxonomic groupings. The dolphins in our data set ranged in body mass from about 40 to 6,750 kg and in brain mass from 0.4 to 9.3 kg. Dolphin body length ranged from 1.3 to 7.6 m. In our combined data set from the 4 other groups of cetaceans, body mass ranged from about 20 to 120,000 kg and brain mass from about 0.2 to 9.2 kg, while body length varied from 1.21 to 26.8 m. Not all cetaceans have large brains relative to their body size. A few dolphins near human body size have human-sized brains. On the other hand, the absolute brain mass of some other cetaceans is only one-sixth as large. We found that brain volume relative to body mass decreases from Delphinidae to a group of Phocoenidae and Monodontidae, to a group of other odontocetes, to Balaenopteroidea, and finally to Balaenidae. We also found the same general trend when we compared brain volume relative to body length, except that the Delphinidae and Phocoenidae-Monodontidae groups do not differ significantly. The Balaenidae have the smallest relative brain mass and the lowest cerebral cortex surface area. Brain parts also vary. Relative to body mass and to body length, dolphins also have the largest cerebellums. Cortex surface area is isometric with brain size when we exclude the Balaenidae. Our data show that the brains of Balaenidae are less convoluted than those of the other cetaceans measured. Large vascular networks inside the cranial vault may help to maintain brain temperature, and these nonbrain tissues increase in volume with body mass and with body length ranging from 8 to 65% of the endocranial volume. Because endocranial vascular networks and other adnexa, such as the tentorium cerebelli, vary so much in different species, brain size measures from endocasts of some extinct cetaceans may be overestimates. Our regression of body length on endocranial adnexa might be used for better estimates of brain volume from endocasts or from endocranial volume of living species or extinct cetaceans. © 2017 The Author(s) Published by S. Karger AG, Basel.

Comparison of Dolphins' Body and Brain Measurements with Four Other Groups of Cetaceans Reveals Great Diversity

PubMed Central

Ridgway, Sam H.; Carlin, Kevin P.; Van Alstyne, Kaitlin R.; Hanson, Alicia C.; Tarpley, Raymond J.

2017-01-01

We compared mature dolphins with 4 other groupings of mature cetaceans. With a large data set, we found great brain diversity among 5 different taxonomic groupings. The dolphins in our data set ranged in body mass from about 40 to 6,750 kg and in brain mass from 0.4 to 9.3 kg. Dolphin body length ranged from 1.3 to 7.6 m. In our combined data set from the 4 other groups of cetaceans, body mass ranged from about 20 to 120,000 kg and brain mass from about 0.2 to 9.2 kg, while body length varied from 1.21 to 26.8 m. Not all cetaceans have large brains relative to their body size. A few dolphins near human body size have human-sized brains. On the other hand, the absolute brain mass of some other cetaceans is only one-sixth as large. We found that brain volume relative to body mass decreases from Delphinidae to a group of Phocoenidae and Monodontidae, to a group of other odontocetes, to Balaenopteroidea, and finally to Balaenidae. We also found the same general trend when we compared brain volume relative to body length, except that the Delphinidae and Phocoenidae-Monodontidae groups do not differ significantly. The Balaenidae have the smallest relative brain mass and the lowest cerebral cortex surface area. Brain parts also vary. Relative to body mass and to body length, dolphins also have the largest cerebellums. Cortex surface area is isometric with brain size when we exclude the Balaenidae. Our data show that the brains of Balaenidae are less convoluted than those of the other cetaceans measured. Large vascular networks inside the cranial vault may help to maintain brain temperature, and these nonbrain tissues increase in volume with body mass and with body length ranging from 8 to 65% of the endocranial volume. Because endocranial vascular networks and other adnexa, such as the tentorium cerebelli, vary so much in different species, brain size measures from endocasts of some extinct cetaceans may be overestimates. Our regression of body length on endocranial adnexa might be used for better estimates of brain volume from endocasts or from endocranial volume of living species or extinct cetaceans. PMID:28122370

Flow regulation in the Swiss Alps: a river network modelling approach to investigate the impacts on bed load and grain size distribution

NASA Astrophysics Data System (ADS)

Costa, A.; Molnar, P.; Schmitt, R. J. P.

2017-12-01

The grain size distribution (GSD) of river bed sediment results from the long term balance between transport capacity and sediment supply. Changes in climate and human activities may alter the spatial distribution of transport capacity and sediment supply along channels and hence impact local bedload transport and GSD. The effects of changed flow are not easily inferable due the non-linear, threshold-based nature of the relation between discharge and sediment mobilization, and the network-scale control on local sediment supply. We present a network-scale model for fractional sediment transport to quantify the impact of hydropower (HP) operations on river network GSD. We represent the river network as a series of connected links for which we extract the geometric characteristics from satellite images and a digital elevation model. We assign surface roughness based on the channel bed GSD. Bed shear stress is estimated at link-scale under the assumptions of rectangular prismatic cross sections and normal flow. The mass balance between sediment supply and transport capacity, computed with the Wilcock and Crowe model, determines transport rates of multiple grain size classes and the resulting GSD. We apply the model to the upper Rhone basin, a large Alpine basin in Switzerland. Since 1960s, changed flow conditions due to HP operations and sediment storage behind dams have potentially altered the sediment transport of the basin. However, little is known on the magnitude and spatial distribution of these changes. We force the model with time series of daily discharge derived with a spatially distributed hydrological model for pre and post HP scenarios. We initialize GSD under the assumption that coarse grains (d90) are mobilized only during mean annual maximum flows, and on the basis of ratios between d90 and characteristic diameters estimated from field measurements. Results show that effects of flow regulation vary significantly in space and in time and are grain size dependent. HP operations led to an overall reduction of sediment transport at network scale, especially in summer and for coarser grains, leading to a general coarsening of the river bed sediments at the upstream reaches. The model allows investigating the impact of modified HP operations and climate change projections on sediment dynamics at the network scale.

ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks.

PubMed

Ben Abdallah, Emna; Folschette, Maxime; Roux, Olivier; Magnin, Morgan

2017-01-01

This paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks (AN). AN is a general and well-suited formalism to study complex interactions between different components (genes, proteins,...). An attractor is a minimal trap domain, that is, a part of the state-transition graph that cannot be escaped. Such structures are terminal components of the dynamics and take the form of steady states (singleton) or complex compositions of cycles (non-singleton). Studying the effect of a disease or a mutation on an organism requires finding the attractors in the model to understand the long-term behaviors. We present a computational logical method based on answer set programming (ASP) to identify all attractors. Performed without any network reduction, the method can be applied on any dynamical semantics. In this paper, we present the two most widespread non-deterministic semantics: the asynchronous and the synchronous updating modes. The logical approach goes through a complete enumeration of the states of the network in order to find the attractors without the necessity to construct the whole state-transition graph. We realize extensive computational experiments which show good performance and fit the expected theoretical results in the literature. The originality of our approach lies on the exhaustive enumeration of all possible (sets of) states verifying the properties of an attractor thanks to the use of ASP. Our method is applied to non-deterministic semantics in two different schemes (asynchronous and synchronous). The merits of our methods are illustrated by applying them to biological examples of various sizes and comparing the results with some existing approaches. It turns out that our approach succeeds to exhaustively enumerate on a desktop computer, in a large model (100 components), all existing attractors up to a given size (20 states). This size is only limited by memory and computation time.

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

An application of digital network technology to medical image management.

PubMed

Chu, W K; Smith, C L; Wobig, R K; Hahn, F A

1997-01-01

With the advent of network technology, there is considerable interest within the medical community to manage the storage and distribution of medical images by digital means. Higher workflow efficiency leading to better patient care is one of the commonly cited outcomes [1,2]. However, due to the size of medical image files and the unique requirements in detail and resolution, medical image management poses special challenges. Storage requirements are usually large, which implies expenses or investment costs make digital networking projects financially out of reach for many clinical institutions. New advances in network technology and telecommunication, in conjunction with the decreasing cost in computer devices, have made digital image management achievable. In our institution, we have recently completed a pilot project to distribute medical images both within the physical confines of the clinical enterprise as well as outside the medical center campus. The design concept and the configuration of a comprehensive digital image network is described in this report.

Scaling of flow distance in random self-similar channel networks

USGS Publications Warehouse

Troutman, B.M.

2005-01-01

Natural river channel networks have been shown in empirical studies to exhibit power-law scaling behavior characteristic of self-similar and self-affine structures. Of particular interest is to describe how the distribution of distance to the outlet changes as a function of network size. In this paper, networks are modeled as random self-similar rooted tree graphs and scaling of distance to the root is studied using methods in stochastic branching theory. In particular, the asymptotic expectation of the width function (number of nodes as a function of distance to the outlet) is derived under conditions on the replacement generators. It is demonstrated further that the branching number describing rate of growth of node distance to the outlet is identical to the length ratio under a Horton-Strahler ordering scheme as order gets large, again under certain restrictions on the generators. These results are discussed in relation to drainage basin allometry and an application to an actual drainage network is presented. ?? World Scientific Publishing Company.

Practical approximation method for firing-rate models of coupled neural networks with correlated inputs

NASA Astrophysics Data System (ADS)

Barreiro, Andrea K.; Ly, Cheng

2017-08-01

Rapid experimental advances now enable simultaneous electrophysiological recording of neural activity at single-cell resolution across large regions of the nervous system. Models of this neural network activity will necessarily increase in size and complexity, thus increasing the computational cost of simulating them and the challenge of analyzing them. Here we present a method to approximate the activity and firing statistics of a general firing rate network model (of the Wilson-Cowan type) subject to noisy correlated background inputs. The method requires solving a system of transcendental equations and is fast compared to Monte Carlo simulations of coupled stochastic differential equations. We implement the method with several examples of coupled neural networks and show that the results are quantitatively accurate even with moderate coupling strengths and an appreciable amount of heterogeneity in many parameters. This work should be useful for investigating how various neural attributes qualitatively affect the spiking statistics of coupled neural networks.

An Evaluation of TCP with Larger Initial Windows

NASA Technical Reports Server (NTRS)

Allman, Mark; Hayes, Christopher; Ostermann, Shawn

1998-01-01

Transmission Control Protocol (TCP's) slow start algorithm gradually increases the amount of data a sender injects into the network, which prevents the sender from overwhelming the network with an inappropriately large burst of traffic. However, the slow start algorithm can make poor use of the available band-width for transfers which are small compared to the bandwidth-delay product of the link, such as file transfers up to few thousand characters over satellite links or even transfers of several hundred bytes over local area networks. This paper evaluates a proposed performance enhancement that raises the initial window used by TCP from 1 MSS-sized segment to roughly 4 KB. The paper evaluates the impact of using larger initial windows on TCP transfers over both the shared Internet and dialup modem links.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

PubMed

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

Dynamical modeling and analysis of large cellular regulatory networks

NASA Astrophysics Data System (ADS)

Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.

2013-06-01

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

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

PubMed

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

2016-02-01

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

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

PubMed Central

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

2016-01-01

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

Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

NASA Astrophysics Data System (ADS)

Zhang, Gui-Qing; Yang, Qiu-Ying; Chen, Tian-Lun

2008-08-01

Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities.

Low voltage polymer network liquid crystal for infrared spatial light modulators.

PubMed

Peng, Fenglin; Xu, Daming; Chen, Haiwei; Wu, Shin-Tson

2015-02-09

We report a low-voltage and fast-response polymer network liquid crystal (PNLC) infrared phase modulator. To optimize device performance, we propose a physical model to understand the curing temperature effect on average domain size. Good agreement between model and experiment is obtained. By optimizing the UV curing temperature and employing a large dielectric anisotropy LC host, we have lowered the 2π phase change voltage to 22.8V at 1.55μm wavelength while keeping response time at about 1 ms. Widespread application of such a PNLC integrated into a high resolution liquid-crystal-on-silicon (LCoS) for infrared spatial light modulator is foreseeable.

A low voltage submillisecond-response polymer network liquid crystal spatial light modulator

NASA Astrophysics Data System (ADS)

Sun, Jie; Wu, Shin-Tson; Haseba, Yasuhiro

2014-01-01

We report a low voltage and highly transparent polymer network liquid crystal (PNLC) with submillisecond response time. By employing a large dielectric anisotropy LC host JC-BP07N, we have lowered the V2π voltage to 23 V at λ = 514 nm. This will enable PNLC to be integrated with a high resolution liquid-crystal-on-silicon spatial light modulator, in which the maximum voltage is 24 V. A simple model correlating PNLC performance with its host LC is proposed and validated experimentally. By optimizing the domain size, we can achieve V2π < 15 V with some compromises in scattering and response time.

Improving Explicit Congestion Notification with the Mark-Front Strategy

NASA Technical Reports Server (NTRS)

Liu, Chunlei; Jain, Raj

2001-01-01

Delivering congestion signals is essential to the performance of networks. Current TCP/IP networks use packet losses to signal congestion. Packet losses not only reduces TCP performance, but also adds large delay. Explicit Congestion Notification (ECN) delivers a faster indication of congestion and has better performance. However, current ECN implementations mark the packet from the tail of the queue. In this paper, we propose the mark-front strategy to send an even faster congestion signal. We show that mark-front strategy reduces buffer size requirement, improves link efficiency and provides better fairness among users. Simulation results that verify our analysis are also presented.

How Big is Too Big for Hubs: Marginal Profitability in Hub-and-Spoke Networks

NASA Technical Reports Server (NTRS)

Ross, Leola B.; Schmidt, Stephen J.

1997-01-01

Increasing the scale of hub operations at major airports has led to concerns about congestion at excessively large hubs. In this paper, we estimate the marginal cost of adding spokes to an existing hub network. We observe entry/non-entry decisions on potential spokes from existing hubs, and estimate both a variable profit function for providing service in markets using that spoke as well as the fixed costs of providing service to the spoke. We let the fixed costs depend upon the scale of operations at the hub, and find the hub size at which spoke service costs are minimized.

Multispecialty physician networks in Ontario.

PubMed

Stukel, Therese A; Glazier, Richard H; Schultz, Susan E; Guan, Jun; Zagorski, Brandon M; Gozdyra, Peter; Henry, David A

2013-01-01

Large multispecialty physician group practices, with a central role for primary care practitioners, have been shown to achieve high-quality, low-cost care for patients with chronic disease. We assessed the extent to which informal multispecialty physician networks in Ontario could be identified by using health administrative data to exploit natural linkages among patients, physicians, and hospitals based on existing patient flow. We linked each Ontario resident to his or her usual provider of primary care over the period from fiscal year 2008/2009 to fiscal year 2010/2011. We linked each specialist to the hospital where he or she performed the most inpatient services. We linked each primary care physician to the hospital where most of his or her ambulatory patients were admitted for non-maternal medical care. Each resident was then linked to the same hospital as his or her usual provider of primary care. We computed "loyalty" as the proportion of care to network residents provided by physicians and hospitals within their network. Smaller clusters were aggregated to create networks based on a minimum population size, distance, and loyalty. Networks were not constrained geographically. We identified 78 multispecialty physician networks, comprising 12,410 primary care physicians, 14,687 specialists, and 175 acute care hospitals serving a total of 12,917,178 people. Median network size was 134,723 residents, 125 primary care physicians, and 143 specialists. Virtually all eligible residents were linked to a usual provider of primary care and to a network. Most specialists (93.5%) and primary care physicians (98.2%) were linked to a hospital. Median network physician loyalty was 68.4% for all physician visits and 81.1% for primary care visits. Median non-maternal admission loyalty was 67.4%. Urban networks had lower loyalties and were less self-contained but had more health care resources. We demonstrated the feasibility of identifying informal multispecialty physician networks in Ontario on the basis of patterns of health care-seeking behaviour. Networks were reasonably self-contained, in that individual residents received most of their care from providers within their respective networks. Formal constitution of networks could foster accountability for efficient, integrated care through care management tools and quality improvement, the ideas behind "accountable care organizations."

Efficiency of parallel direct optimization

NASA Technical Reports Server (NTRS)

Janies, D. A.; Wheeler, W. C.

2001-01-01

Tremendous progress has been made at the level of sequential computation in phylogenetics. However, little attention has been paid to parallel computation. Parallel computing is particularly suited to phylogenetics because of the many ways large computational problems can be broken into parts that can be analyzed concurrently. In this paper, we investigate the scaling factors and efficiency of random addition and tree refinement strategies using the direct optimization software, POY, on a small (10 slave processors) and a large (256 slave processors) cluster of networked PCs running LINUX. These algorithms were tested on several data sets composed of DNA and morphology ranging from 40 to 500 taxa. Various algorithms in POY show fundamentally different properties within and between clusters. All algorithms are efficient on the small cluster for the 40-taxon data set. On the large cluster, multibuilding exhibits excellent parallel efficiency, whereas parallel building is inefficient. These results are independent of data set size. Branch swapping in parallel shows excellent speed-up for 16 slave processors on the large cluster. However, there is no appreciable speed-up for branch swapping with the further addition of slave processors (>16). This result is independent of data set size. Ratcheting in parallel is efficient with the addition of up to 32 processors in the large cluster. This result is independent of data set size. c2001 The Willi Hennig Society.

Strain-driven criticality underlies nonlinear mechanics of fibrous networks

NASA Astrophysics Data System (ADS)

Sharma, A.; Licup, A. J.; Rens, R.; Vahabi, M.; Jansen, K. A.; Koenderink, G. H.; MacKintosh, F. C.

2016-10-01

Networks with only central force interactions are floppy when their average connectivity is below an isostatic threshold. Although such networks are mechanically unstable, they can become rigid when strained. It was recently shown that the transition from floppy to rigid states as a function of simple shear strain is continuous, with hallmark signatures of criticality [Sharma et al., Nature Phys. 12, 584 (2016), 10.1038/nphys3628]. The nonlinear mechanical response of collagen networks was shown to be quantitatively described within the framework of such mechanical critical phenomenon. Here, we provide a more quantitative characterization of critical behavior in subisostatic networks. Using finite-size scaling we demonstrate the divergence of strain fluctuations in the network at well-defined critical strain. We show that the characteristic strain corresponding to the onset of strain stiffening is distinct from but related to this critical strain in a way that depends on critical exponents. We confirm this prediction experimentally for collagen networks. Moreover, we find that the apparent critical exponents are largely independent of the spatial dimensionality. With subisostaticity as the only required condition, strain-driven criticality is expected to be a general feature of biologically relevant fibrous networks.

Rapid social network assessment for predicting HIV and STI risk among men attending bars and clubs in San Diego, California.

PubMed

Drumright, Lydia N; Frost, Simon D W

2010-12-01

To test the use of a rapid assessment tool to determine social network size, and to test whether social networks with a high density of HIV/sexually transmitted infection (STI) or substance using persons were independent predictors of HIV and STI status among men who have sex with men (MSM) using a rapid tool for collecting network information. We interviewed 609 MSM from 14 bars in San Diego, California, USA, using an enhanced version of the Priorities for Local AIDS Control Efforts (PLACE) methodology. Social network size was assessed using a series of 19 questions of the form 'How many people do you know that have the name X?', where X included specific male and female names (eg, Keith), use illicit substances, and have HIV. Generalised linear models were used to estimate average and group-specific network sizes, and their association with HIV status, STI history and methamphetamine use. Despite possible errors in ascertaining network size, average reported network sizes were larger for larger groups. Those who reported having HIV infection or having past STI reported significantly more HIV infected and methamphetamine or popper using individuals in their social network. There was a dose-dependent effect of social network size of HIV infected individuals on self-reported HIV status, past STI and use of methamphetamine in the last 12 months, after controlling for age, ethnicity and numbers of sexual partners in the last year. Relatively simple measures of social networks are associated with HIV/STI risk, and may provide a useful tool for targeting HIV/STI surveillance and prevention.

A Coarse-to-Fine Geometric Scale-Invariant Feature Transform for Large Size High Resolution Satellite Image Registration

PubMed Central

Chang, Xueli; Du, Siliang; Li, Yingying; Fang, Shenghui

2018-01-01

Large size high resolution (HR) satellite image matching is a challenging task due to local distortion, repetitive structures, intensity changes and low efficiency. In this paper, a novel matching approach is proposed for the large size HR satellite image registration, which is based on coarse-to-fine strategy and geometric scale-invariant feature transform (SIFT). In the coarse matching step, a robust matching method scale restrict (SR) SIFT is implemented at low resolution level. The matching results provide geometric constraints which are then used to guide block division and geometric SIFT in the fine matching step. The block matching method can overcome the memory problem. In geometric SIFT, with area constraints, it is beneficial for validating the candidate matches and decreasing searching complexity. To further improve the matching efficiency, the proposed matching method is parallelized using OpenMP. Finally, the sensing image is rectified to the coordinate of reference image via Triangulated Irregular Network (TIN) transformation. Experiments are designed to test the performance of the proposed matching method. The experimental results show that the proposed method can decrease the matching time and increase the number of matching points while maintaining high registration accuracy. PMID:29702589

Data storage and retrieval system

NASA Technical Reports Server (NTRS)

Nakamoto, Glen

1991-01-01

The Data Storage and Retrieval System (DSRS) consists of off-the-shelf system components integrated as a file server supporting very large files. These files are on the order of one gigabyte of data per file, although smaller files on the order of one megabyte can be accommodated as well. For instance, one gigabyte of data occupies approximately six 9 track tape reels (recorded at 6250 bpi). Due to this large volume of media, it was desirable to shrink the size of the proposed media to a single portable cassette. In addition to large size, a key requirement was that the data needs to be transferred to a (VME based) workstation at very high data rates. One gigabyte (GB) of data needed to be transferred from an archiveable media on a file server to a workstation in less than 5 minutes. Equivalent size, on-line data needed to be transferred in less than 3 minutes. These requirements imply effective transfer rates on the order of four to eight megabytes per second (4-8 MB/s). The DSRS also needed to be able to send and receive data from a variety of other sources accessible from an Ethernet local area network.

Data storage and retrieval system

NASA Technical Reports Server (NTRS)

Nakamoto, Glen

1992-01-01

The Data Storage and Retrieval System (DSRS) consists of off-the-shelf system components integrated as a file server supporting very large files. These files are on the order of one gigabyte of data per file, although smaller files on the order of one megabyte can be accommodated as well. For instance, one gigabyte of data occupies approximately six 9-track tape reels (recorded at 6250 bpi). Due to this large volume of media, it was desirable to 'shrink' the size of the proposed media to a single portable cassette. In addition to large size, a key requirement was that the data needs to be transferred to a (VME based) workstation at very high data rates. One gigabyte (GB) of data needed to be transferred from an archiveable media on a file server to a workstation in less than 5 minutes. Equivalent size, on-line data needed to be transferred in less than 3 minutes. These requirements imply effective transfer rates on the order of four to eight megabytes per second (4-8 MB/s). The DSRS also needed to be able to send and receive data from a variety of other sources accessible from an Ethernet local area network.

Dynamic properties of epidemic spreading on finite size complex networks

NASA Astrophysics Data System (ADS)

Li, Ying; Liu, Yang; Shan, Xiu-Ming; Ren, Yong; Jiao, Jian; Qiu, Ben

2005-11-01

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS (susceptible-infected-susceptible) model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.

Printable elastic conductors by in situ formation of silver nanoparticles from silver flakes

NASA Astrophysics Data System (ADS)

Matsuhisa, Naoji; Inoue, Daishi; Zalar, Peter; Jin, Hanbit; Matsuba, Yorishige; Itoh, Akira; Yokota, Tomoyuki; Hashizume, Daisuke; Someya, Takao

2017-08-01

Printable elastic conductors promise large-area stretchable sensor/actuator networks for healthcare, wearables and robotics. Elastomers with metal nanoparticles are one of the best approaches to achieve high performance, but large-area utilization is limited by difficulties in their processability. Here we report a printable elastic conductor containing Ag nanoparticles that are formed in situ, solely by mixing micrometre-sized Ag flakes, fluorine rubbers, and surfactant. Our printable elastic composites exhibit conductivity higher than 4,000 S cm-1 (highest value: 6,168 S cm-1) at 0% strain, and 935 S cm-1 when stretched up to 400%. Ag nanoparticle formation is influenced by the surfactant, heating processes, and elastomer molecular weight, resulting in a drastic improvement of conductivity. Fully printed sensor networks for stretchable robots are demonstrated, sensing pressure and temperature accurately, even when stretched over 250%.

Automated adaptive inference of phenomenological dynamical models.

PubMed

Daniels, Bryan C; Nemenman, Ilya

2015-08-21

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

Emergent Adaptive Noise Reduction from Communal Cooperation of Sensor Grid

NASA Technical Reports Server (NTRS)

Jones, Kennie H.; Jones, Michael G.; Nark, Douglas M.; Lodding, Kenneth N.

2010-01-01

In the last decade, the realization of small, inexpensive, and powerful devices with sensors, computers, and wireless communication has promised the development of massive sized sensor networks with dense deployments over large areas capable of high fidelity situational assessments. However, most management models have been based on centralized control and research has concentrated on methods for passing data from sensor devices to the central controller. Most implementations have been small but, as it is not scalable, this methodology is insufficient for massive deployments. Here, a specific application of a large sensor network for adaptive noise reduction demonstrates a new paradigm where communities of sensor/computer devices assess local conditions and make local decisions from which emerges a global behaviour. This approach obviates many of the problems of centralized control as it is not prone to single point of failure and is more scalable, efficient, robust, and fault tolerant

Thermospheric Airglow Perturbations in the Upper Atmosphere Caused by Hurricane Harvey

NASA Astrophysics Data System (ADS)

Bhatt, A.; Kendall, E. A.

2017-12-01

The Midlatitude Allsky imaging Network for Geophysical Observations (MANGO) consists of seven allsky imagers distributed across the United States recording observations of large-scale airglow perturbations. The imagers are filtered at 630 nm, a forbidden oxygen line, in order to record the predominant source of airglow at 250 km altitude. While the ubiquitous airglow layer is challenging to observe when under uniform conditions, waves in the upper atmosphere cause ripples in the airglow layer which can easily be imaged by appropriate instrumentation. MANGO is the first network to record perturbations in the airglow layer on a continent-size scale. Large and Mid-scale Traveling Ionospheric Disturbances (LSTIDs and MSTIDs) are recorded that are caused by auroral forcing, mountain turbulence, and tidal variations. On August 25, airglow perturbations centered on the Hurricane Harvey path were observed by MANGO. These images and connections to other complimentary data sets such as GPS will be presented.

Co-residence patterns in hunter-gatherer societies show unique human social structure.

PubMed

Hill, Kim R; Walker, Robert S; Bozicević, Miran; Eder, James; Headland, Thomas; Hewlett, Barry; Hurtado, A Magdalena; Marlowe, Frank; Wiessner, Polly; Wood, Brian

2011-03-11

Contemporary humans exhibit spectacular biological success derived from cumulative culture and cooperation. The origins of these traits may be related to our ancestral group structure. Because humans lived as foragers for 95% of our species' history, we analyzed co-residence patterns among 32 present-day foraging societies (total n = 5067 individuals, mean experienced band size = 28.2 adults). We found that hunter-gatherers display a unique social structure where (i) either sex may disperse or remain in their natal group, (ii) adult brothers and sisters often co-reside, and (iii) most individuals in residential groups are genetically unrelated. These patterns produce large interaction networks of unrelated adults and suggest that inclusive fitness cannot explain extensive cooperation in hunter-gatherer bands. However, large social networks may help to explain why humans evolved capacities for social learning that resulted in cumulative culture.

Automated adaptive inference of phenomenological dynamical models

PubMed Central

Daniels, Bryan C.; Nemenman, Ilya

2015-01-01

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

Self-assembled Ag nanoparticle network passivated by a nano-sized ZnO layer for transparent and flexible film heaters

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

Seo, Ki-Won; Kim, Han-Ki, E-mail: imdlhkkim@khu.ac.kr; Kim, Min-Yi

2015-12-15

We investigated a self-assembled Ag nanoparticle network electrode passivated by a nano-sized ZnO layer for use in high-performance transparent and flexible film heaters (TFFHs). The low temperature atomic layer deposition of a nano-sized ZnO layer effectively filled the uncovered area of Ag network and improved the current spreading in the self-assembled Ag network without a change in the sheet resistance and optical transmittance as well as mechanical flexibility. The time-temperature profiles and heat distribution analysis demonstrate that the performance of the TFTH with the ZnO/Ag network is superior to that of a TFFH with Ag nanowire electrodes. In addition, themore » TFTHs with ZnO/Ag network exhibited better stability than the TFFH with a bare Ag network due to the effective current spreading through the nano-sized ZnO layer.« less

Continuous time limits of the utterance selection model

NASA Astrophysics Data System (ADS)

Michaud, Jérôme

2017-02-01

In this paper we derive alternative continuous time limits of the utterance selection model (USM) for language change [G. J. Baxter et al., Phys. Rev. E 73, 046118 (2006), 10.1103/PhysRevE.73.046118]. This is motivated by the fact that the Fokker-Planck continuous time limit derived in the original version of the USM is only valid for a small range of parameters. We investigate the consequences of relaxing these constraints on parameters. Using the normal approximation of the multinomial approximation, we derive a continuous time limit of the USM in the form of a weak-noise stochastic differential equation. We argue that this weak noise, not captured by the Kramers-Moyal expansion, cannot be neglected. We then propose a coarse-graining procedure, which takes the form of a stochastic version of the heterogeneous mean field approximation. This approximation groups the behavior of nodes of the same degree, reducing the complexity of the problem. With the help of this approximation, we study in detail two simple families of networks: the regular networks and the star-shaped networks. The analysis reveals and quantifies a finite-size effect of the dynamics. If we increase the size of the network by keeping all the other parameters constant, we transition from a state where conventions emerge to a state where no convention emerges. Furthermore, we show that the degree of a node acts as a time scale. For heterogeneous networks such as star-shaped networks, the time scale difference can become very large, leading to a noisier behavior of highly connected nodes.

Deep Spatial-Temporal Joint Feature Representation for Video Object Detection.

PubMed

Zhao, Baojun; Zhao, Boya; Tang, Linbo; Han, Yuqi; Wang, Wenzheng

2018-03-04

With the development of deep neural networks, many object detection frameworks have shown great success in the fields of smart surveillance, self-driving cars, and facial recognition. However, the data sources are usually videos, and the object detection frameworks are mostly established on still images and only use the spatial information, which means that the feature consistency cannot be ensured because the training procedure loses temporal information. To address these problems, we propose a single, fully-convolutional neural network-based object detection framework that involves temporal information by using Siamese networks. In the training procedure, first, the prediction network combines the multiscale feature map to handle objects of various sizes. Second, we introduce a correlation loss by using the Siamese network, which provides neighboring frame features. This correlation loss represents object co-occurrences across time to aid the consistent feature generation. Since the correlation loss should use the information of the track ID and detection label, our video object detection network has been evaluated on the large-scale ImageNet VID dataset where it achieves a 69.5% mean average precision (mAP).

Multiway spectral community detection in networks

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Newman, M. E. J.

2015-11-01

One of the most widely used methods for community detection in networks is the maximization of the quality function known as modularity. Of the many maximization techniques that have been used in this context, some of the most conceptually attractive are the spectral methods, which are based on the eigenvectors of the modularity matrix. Spectral algorithms have, however, been limited, by and large, to the division of networks into only two or three communities, with divisions into more than three being achieved by repeated two-way division. Here we present a spectral algorithm that can directly divide a network into any number of communities. The algorithm makes use of a mapping from modularity maximization to a vector partitioning problem, combined with a fast heuristic for vector partitioning. We compare the performance of this spectral algorithm with previous approaches and find it to give superior results, particularly in cases where community sizes are unbalanced. We also give demonstrative applications of the algorithm to two real-world networks and find that it produces results in good agreement with expectations for the networks studied.

Information spreading on mobile communication networks: A new model that incorporates human behaviors

NASA Astrophysics Data System (ADS)

Ren, Fei; Li, Sai-Ping; Liu, Chuang

2017-03-01

Recently, there is a growing interest in the modeling and simulation based on real social networks among researchers in multi-disciplines. Using an empirical social network constructed from the calling records of a Chinese mobile service provider, we here propose a new model to simulate the information spreading process. This model takes into account two important ingredients that exist in real human behaviors: information prevalence and preferential spreading. The fraction of informed nodes when the system reaches an asymptotically stable state is primarily determined by information prevalence, and the heterogeneity of link weights would slow down the information diffusion. Moreover, the sizes of blind clusters which consist of connected uninformed nodes show a power-law distribution, and these uninformed nodes correspond to a particular portion of nodes which are located at special positions in the network, namely at the edges of large clusters or inside the clusters connected through weak links. Since the simulations are performed on a real world network, the results should be useful in the understanding of the influences of social network structures and human behaviors on information propagation.

How the Size of Our Social Network Influences Our Semantic Skills

ERIC Educational Resources Information Center

Lev-Ari, Shiri

2016-01-01

People differ in the size of their social network, and thus in the properties of the linguistic input they receive. This article examines whether differences in social network size influence individuals' linguistic skills in their native language, focusing on global comprehension of evaluative language. Study 1 exploits the natural variation in…

Class Size, School Size and the Size of the School Network

ERIC Educational Resources Information Center

Coupé, Tom; Olefir, Anna; Alonso, Juan Diego

2016-01-01

In many transition countries, including Ukraine, decreases in population and fertility have led to substantial falls in the number of school-aged children. As a consequence, these countries now have school networks that consist of many small schools, leading many countries to consider reorganizing their networks by closing smaller schools and…

Effective Network Size Predicted From Simulations of Pathogen Outbreaks Through Social Networks Provides a Novel Measure of Structure-Standardized Group Size.

PubMed

McCabe, Collin M; Nunn, Charles L

2018-01-01

The transmission of infectious disease through a population is often modeled assuming that interactions occur randomly in groups, with all individuals potentially interacting with all other individuals at an equal rate. However, it is well known that pairs of individuals vary in their degree of contact. Here, we propose a measure to account for such heterogeneity: effective network size (ENS), which refers to the size of a maximally complete network (i.e., unstructured, where all individuals interact with all others equally) that corresponds to the outbreak characteristics of a given heterogeneous, structured network. We simulated susceptible-infected (SI) and susceptible-infected-recovered (SIR) models on maximally complete networks to produce idealized outbreak duration distributions for a disease on a network of a given size. We also simulated the transmission of these same diseases on random structured networks and then used the resulting outbreak duration distributions to predict the ENS for the group or population. We provide the methods to reproduce these analyses in a public R package, "enss." Outbreak durations of simulations on randomly structured networks were more variable than those on complete networks, but tended to have similar mean durations of disease spread. We then applied our novel metric to empirical primate networks taken from the literature and compared the information represented by our ENSs to that by other established social network metrics. In AICc model comparison frameworks, group size and mean distance proved to be the metrics most consistently associated with ENS for SI simulations, while group size, centralization, and modularity were most consistently associated with ENS for SIR simulations. In all cases, ENS was shown to be associated with at least two other independent metrics, supporting its use as a novel metric. Overall, our study provides a proof of concept for simulation-based approaches toward constructing metrics of ENS, while also revealing the conditions under which this approach is most promising.

Do online gossipers promote brands?

PubMed

Okazaki, Shintaro; Rubio, Natalia; Campo, Sara

2013-02-01

Online gossip has been recognized as small talk on social networking sites (SNSs) that influences consumer behavior, but little attention has been paid to its role. This study makes three theoretical predictions: (a) propensity to gossip online leads to greater information value, entertainment value, and friendship value; (b) upon exposure to a high-involvement product, online gossipers are more willing to spread such information through electronic word-of-mouth (eWOM) in search of prestige or fame as a knowledge expert; and (c) this tendency will be more pronounced when they are connected with strong ties (rather than weak ties) and belong to a large network (rather than a small network). An experimental survey was conducted with a scenario method. In total, 818 general consumers participated in the survey. A multivariate analysis of variance (ANOVA) provides empirical support for prediction (1). With regard to predictions (2) and (3), a series of three-way and two-way between-subjective ANOVAs were performed. When a high-involvement product is promoted, gossipers, rather than nongossipers, are more willing to participate in eWOM on an SNS. Furthermore, a significant interaction effect indicates that online gossipers' willingness to particiapte in eWOM would be more pronounced if they belonged to a large network rather than a small network. However, when a low-involvement product is promoted, no interaction effect is found between online gossip and network size. In closing, theoretical and managerial implications are discussed, while important limitations are recognized.

Do Online Gossipers Promote Brands?

PubMed Central

Rubio, Natalia; Campo, Sara

2013-01-01

Abstract Online gossip has been recognized as small talk on social networking sites (SNSs) that influences consumer behavior, but little attention has been paid to its role. This study makes three theoretical predictions: (a) propensity to gossip online leads to greater information value, entertainment value, and friendship value; (b) upon exposure to a high-involvement product, online gossipers are more willing to spread such information through electronic word-of-mouth (eWOM) in search of prestige or fame as a knowledge expert; and (c) this tendency will be more pronounced when they are connected with strong ties (rather than weak ties) and belong to a large network (rather than a small network). An experimental survey was conducted with a scenario method. In total, 818 general consumers participated in the survey. A multivariate analysis of variance (ANOVA) provides empirical support for prediction (1). With regard to predictions (2) and (3), a series of three-way and two-way between-subjective ANOVAs were performed. When a high-involvement product is promoted, gossipers, rather than nongossipers, are more willing to participate in eWOM on an SNS. Furthermore, a significant interaction effect indicates that online gossipers' willingness to particiapte in eWOM would be more pronounced if they belonged to a large network rather than a small network. However, when a low-involvement product is promoted, no interaction effect is found between online gossip and network size. In closing, theoretical and managerial implications are discussed, while important limitations are recognized. PMID:23276259

Social networks of patients with psychosis: a systematic review.

PubMed

Palumbo, Claudia; Volpe, Umberto; Matanov, Aleksandra; Priebe, Stefan; Giacco, Domenico

2015-10-12

Social networks are important for mental health outcomes as they can mobilise resources and help individuals to cope with social stressors. Individuals with psychosis may have specific difficulties in establishing and maintaining social relationships which impacts on their well-being and quality of life. There has been a growing interest in developing social network interventions for patients with psychotic disorders. A systematic literature review was conducted to investigate the size of social networks of patients with psychotic disorders, as well as their friendship networks. A systematic electronic search was carried out in MEDLINE, EMBASE and PsychINFO databases using a combination of search terms relating to 'social network', 'friendship' and 'psychotic disorder'. The search identified 23 relevant papers. Out of them, 20 reported patient social network size. Four papers reported the mean number of friends in addition to whole network size, while three further papers focused exclusively on the number of friends. Findings varied substantially across the studies, with a weighted mean size of 11.7 individuals for whole social networks and 3.4 individuals for friendship networks. On average, 43.1 % of the whole social network was composed of family members, while friends accounted for 26.5 %. Studies assessing whole social network size and friendship networks of people with psychosis are difficult to compare as different concepts and methods of assessment were applied. The extent of the overlap between different social roles assessed in the networks was not always clear. Greater conceptual and methodological clarity is needed in order to help the development of effective strategies to increase social resources of patients with psychosis.

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

PubMed

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.

In vitro large-scale experimental and theoretical studies for the realization of bi-directional brain-prostheses.

PubMed

Bonifazi, Paolo; Difato, Francesco; Massobrio, Paolo; Breschi, Gian L; Pasquale, Valentina; Levi, Timothée; Goldin, Miri; Bornat, Yannick; Tedesco, Mariateresa; Bisio, Marta; Kanner, Sivan; Galron, Ronit; Tessadori, Jacopo; Taverna, Stefano; Chiappalone, Michela

2013-01-01

Brain-machine interfaces (BMI) were born to control "actions from thoughts" in order to recover motor capability of patients with impaired functional connectivity between the central and peripheral nervous system. The final goal of our studies is the development of a new proof-of-concept BMI-a neuromorphic chip for brain repair-to reproduce the functional organization of a damaged part of the central nervous system. To reach this ambitious goal, we implemented a multidisciplinary "bottom-up" approach in which in vitro networks are the paradigm for the development of an in silico model to be incorporated into a neuromorphic device. In this paper we present the overall strategy and focus on the different building blocks of our studies: (i) the experimental characterization and modeling of "finite size networks" which represent the smallest and most general self-organized circuits capable of generating spontaneous collective dynamics; (ii) the induction of lesions in neuronal networks and the whole brain preparation with special attention on the impact on the functional organization of the circuits; (iii) the first production of a neuromorphic chip able to implement a real-time model of neuronal networks. A dynamical characterization of the finite size circuits with single cell resolution is provided. A neural network model based on Izhikevich neurons was able to replicate the experimental observations. Changes in the dynamics of the neuronal circuits induced by optical and ischemic lesions are presented respectively for in vitro neuronal networks and for a whole brain preparation. Finally the implementation of a neuromorphic chip reproducing the network dynamics in quasi-real time (10 ns precision) is presented.

Limits to high-speed simulations of spiking neural networks using general-purpose computers.

PubMed

Zenke, Friedemann; Gerstner, Wulfram

2014-01-01

To understand how the central nervous system performs computations using recurrent neuronal circuitry, simulations have become an indispensable tool for theoretical neuroscience. To study neuronal circuits and their ability to self-organize, increasing attention has been directed toward synaptic plasticity. In particular spike-timing-dependent plasticity (STDP) creates specific demands for simulations of spiking neural networks. On the one hand a high temporal resolution is required to capture the millisecond timescale of typical STDP windows. On the other hand network simulations have to evolve over hours up to days, to capture the timescale of long-term plasticity. To do this efficiently, fast simulation speed is the crucial ingredient rather than large neuron numbers. Using different medium-sized network models consisting of several thousands of neurons and off-the-shelf hardware, we compare the simulation speed of the simulators: Brian, NEST and Neuron as well as our own simulator Auryn. Our results show that real-time simulations of different plastic network models are possible in parallel simulations in which numerical precision is not a primary concern. Even so, the speed-up margin of parallelism is limited and boosting simulation speeds beyond one tenth of real-time is difficult. By profiling simulation code we show that the run times of typical plastic network simulations encounter a hard boundary. This limit is partly due to latencies in the inter-process communications and thus cannot be overcome by increased parallelism. Overall, these results show that to study plasticity in medium-sized spiking neural networks, adequate simulation tools are readily available which run efficiently on small clusters. However, to run simulations substantially faster than real-time, special hardware is a prerequisite.

Impact of degree truncation on the spread of a contagious process on networks.

PubMed

Harling, Guy; Onnela, Jukka-Pekka

2018-03-01

Understanding how person-to-person contagious processes spread through a population requires accurate information on connections between population members. However, such connectivity data, when collected via interview, is often incomplete due to partial recall, respondent fatigue or study design, e.g., fixed choice designs (FCD) truncate out-degree by limiting the number of contacts each respondent can report. Past research has shown how FCD truncation affects network properties, but its implications for predicted speed and size of spreading processes remain largely unexplored. To study the impact of degree truncation on predictions of spreading process outcomes, we generated collections of synthetic networks containing specific properties (degree distribution, degree-assortativity, clustering), and also used empirical social network data from 75 villages in Karnataka, India. We simulated FCD using various truncation thresholds and ran a susceptible-infectious-recovered (SIR) process on each network. We found that spreading processes propagated on truncated networks resulted in slower and smaller epidemics, with a sudden decrease in prediction accuracy at a level of truncation that varied by network type. Our results have implications beyond FCD to truncation due to any limited sampling from a larger network. We conclude that knowledge of network structure is important for understanding the accuracy of predictions of process spread on degree truncated networks.

Ultrastructural networks in growth cones and neurites of cultured central nervous system neurons.

PubMed

Tsui, H C; Ris, H; Klein, W L

1983-09-01

We have examined growth cones and neurites of cultured central nervous system neurons by high-voltage electron microscopy. Embryonic chicken retina cells were cultured on polylysine-treated and Formvar-coated gold grids for 2-6 days, fixed, and critical point dried. Growth cones and neurites were examined as unembedded whole mounts. Three-dimensional images from stereo-pair electron micrographs of these regions showed a high degree of ultrastructural articulation, with distinct, non-tapering filaments (5-9 nm in diameter) joining both cytoskeletal and membranous components. In the central regions of growth cones, interconnected structures included microtubules, large membranous sacs (up to 400 nm), and irregular vesicles (25-75 nm). A denser filamentous network was prevalent at the edges of growth cones. This network, which frequently adjoined the surface membrane, linked vesicles of uniform size (35-40 nm). Such vesicles often were seen densely packed in growth cone protrusions that were about the size of small synaptic boutons. Prevalent structural interconnections within growth cones conceivably could play a logistic role in specific membrane assembly, intracellular transport, endocytosis, and secretion. Because such processes are not unique to growth cones, the extensive linkages we have observed may have implications for cytoplasmic structure in general.

Evolution of imitation networks in Minority Game model

NASA Astrophysics Data System (ADS)

Lavička, H.; Slanina, F.

2007-03-01

The Minority Game is adapted to study the “imitation dilemma”, i.e. the tradeoff between local benefit and global harm coming from imitation. The agents are placed on a substrate network and are allowed to imitate more successful neighbours. Imitation domains, which are oriented trees, are formed. We investigate size distribution of the domains and in-degree distribution within the trees. We use four types of substrate: one-dimensional chain; Erdös-Rényi graph; Barabási-Albert scale-free graph; Barabási-Albert 'model A' graph. The behaviour of some features of the imitation network strongly depend on the information cost epsilon, which is the percentage of gain the imitators must pay to the imitated. Generally, the system tends to form a few domains of equal size. However, positive epsilon makes the system stay in a long-lasting metastable state with complex structure. The in-degree distribution is found to follow a power law in two cases of those studied: for Erdös-Rényi substrate for any epsilon and for Barabási-Albert scale-free substrate for large enough epsilon. A brief comparison with empirical data is provided.

Visualizing collaborative electronic health record usage for hospitalized patients with heart failure.

PubMed

Soulakis, Nicholas D; Carson, Matthew B; Lee, Young Ji; Schneider, Daniel H; Skeehan, Connor T; Scholtens, Denise M

2015-03-01

To visualize and describe collaborative electronic health record (EHR) usage for hospitalized patients with heart failure. We identified records of patients with heart failure and all associated healthcare provider record usage through queries of the Northwestern Medicine Enterprise Data Warehouse. We constructed a network by equating access and updates of a patient's EHR to a provider-patient interaction. We then considered shared patient record access as the basis for a second network that we termed the provider collaboration network. We calculated network statistics, the modularity of provider interactions, and provider cliques. We identified 548 patient records accessed by 5113 healthcare providers in 2012. The provider collaboration network had 1504 nodes and 83 998 edges. We identified 7 major provider collaboration modules. Average clique size was 87.9 providers. We used a graph database to demonstrate an ad hoc query of our provider-patient network. Our analysis suggests a large number of healthcare providers across a wide variety of professions access records of patients with heart failure during their hospital stay. This shared record access tends to take place not only in a pairwise manner but also among large groups of providers. EHRs encode valuable interactions, implicitly or explicitly, between patients and providers. Network analysis provided strong evidence of multidisciplinary record access of patients with heart failure across teams of 100+ providers. Further investigation may lead to clearer understanding of how record access information can be used to strategically guide care coordination for patients hospitalized for heart failure. © The Author 2015. Published by Oxford University Press on behalf of the American Medical Informatics Association.

Where and why hyporheic exchange is important: Inferences from a parsimonious, physically-based river network model

NASA Astrophysics Data System (ADS)

Gomez-Velez, J. D.; Harvey, J. W.

2014-12-01

Hyporheic exchange has been hypothesized to have basin-scale consequences; however, predictions throughout river networks are limited by available geomorphic and hydrogeologic data as well as 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). At the core of NEXSS is a characterization of the channel geometry, geomorphic features, and related hydraulic drivers based on scaling equations from the literature and readily accessible information such as river discharge, bankfull width, median grain size, sinuosity, channel slope, and regional groundwater gradients. Multi-scale hyporheic flow is computed based on combining simple but powerful analytical and numerical expressions that have been previously published. We applied NEXSS across a broad range of geomorphic diversity in river reaches and synthetic river networks. NEXSS demonstrates that vertical exchange beneath submerged bedforms dominates hyporheic fluxes and turnover rates along the river corridor. Moreover, the hyporheic zone's potential for biogeochemical transformations is comparable across stream orders, but the abundance of lower-order channels results in a considerably higher cumulative effect for low-order streams. Thus, vertical exchange beneath submerged bedforms has more potential for biogeochemical transformations than lateral exchange beneath banks, although lateral exchange through meanders may be important in large rivers. These results have implications for predicting outcomes of river and basin management practices.

Predictors of Change in Self-Reported Social Networks among Homeless Young People

ERIC Educational Resources Information Center

Falci, Christina D.; Whitbeck, Les B.; Hoyt, Dan R.; Rose, Trina

2011-01-01

This research investigates changes in social network size and composition of 351 homeless adolescents over 3 years. Findings show that network size decreases over time. Homeless youth with a conduct disorder begin street life with small networks that remain small over time. Caregiver abuse is associated with smaller emotional networks due to fewer…

Lessons learned: Infrastructure development and financial management for large, publicly funded, international trials.

PubMed

Larson, Gregg S; Carey, Cate; Grarup, Jesper; Hudson, Fleur; Sachi, Karen; Vjecha, Michael J; Gordin, Fred

2016-04-01

Randomized clinical trials are widely recognized as essential to address worldwide clinical and public health research questions. However, their size and duration can overwhelm available public and private resources. To remain competitive in international research settings, advocates and practitioners of clinical trials must implement practices that reduce their cost. We identify approaches and practices for large, publicly funded, international trials that reduce cost without compromising data integrity and recommend an approach to cost reporting that permits comparison of clinical trials. We describe the organizational and financial characteristics of The International Network for Strategic Initiatives in Global HIV Trials, an infectious disease research network that conducts multiple, large, long-term, international trials, and examine challenges associated with simple and streamlined governance and an infrastructure and financial management model that is based on performance, transparency, and accountability. It is possible to reduce costs of participants' follow-up and not compromise clinical trial quality or integrity. The International Network for Strategic Initiatives in Global HIV Trials network has successfully completed three large HIV trials using cost-efficient practices that have not adversely affected investigator enthusiasm, accrual rates, loss-to-follow-up, adherence to the protocol, and completion of data collection. This experience is relevant to the conduct of large, publicly funded trials in other disease areas, particularly trials dependent on international collaborations. New approaches, or creative adaption of traditional clinical trial infrastructure and financial management tools, can render large, international clinical trials more cost-efficient by emphasizing structural simplicity, minimal up-front costs, payments for performance, and uniform algorithms and fees-for-service, irrespective of location. However, challenges remain. They include institutional resistance to financial change, growing trial complexity, and the difficulty of sustaining network infrastructure absent stable research work. There is also a need for more central monitoring, improved and harmonized regulations, and a widely applied metric for measuring and comparing cost efficiency in clinical trials. ClinicalTrials.gov is recommended as a location where standardized trial cost information could be made publicly accessible. © The Author(s) 2016.

Bladder cancer treatment response assessment using deep learning in CT with transfer learning

NASA Astrophysics Data System (ADS)

Cha, Kenny H.; Hadjiiski, Lubomir M.; Chan, Heang-Ping; Samala, Ravi K.; Cohan, Richard H.; Caoili, Elaine M.; Paramagul, Chintana; Alva, Ajjai; Weizer, Alon Z.

2017-03-01

We are developing a CAD system for bladder cancer treatment response assessment in CT. We compared the performance of the deep-learning convolution neural network (DL-CNN) using different network sizes, and with and without transfer learning using natural scene images or regions of interest (ROIs) inside and outside the bladder. The DL-CNN was trained to identify responders (T0 disease) and non-responders to chemotherapy. ROIs were extracted from segmented lesions in pre- and post-treatment scans of a patient and paired to generate hybrid pre-post-treatment paired ROIs. The 87 lesions from 82 patients generated 104 temporal lesion pairs and 6,700 pre-post-treatment paired ROIs. Two-fold cross-validation and receiver operating characteristic analysis were performed and the area under the curve (AUC) was calculated for the DL-CNN estimates. The AUCs for prediction of T0 disease after treatment were 0.77+/-0.08 and 0.75+/-0.08, respectively, for the two partitions using DL-CNN without transfer learning and a small network, and were 0.74+/-0.07 and 0.74+/-0.08 with a large network. The AUCs were 0.73+/-0.08 and 0.62+/-0.08 with transfer learning using a small network pre-trained with bladder ROIs. The AUC values were 0.77+/-0.08 and 0.73+/-0.07 using the large network pre-trained with the same bladder ROIs. With transfer learning using the large network pretrained with the Canadian Institute for Advanced Research (CIFAR-10) data set, the AUCs were 0.72+/-0.06 and 0.64+/-0.09, respectively, for the two partitions. None of the differences in the methods reached statistical significance. Our study demonstrated the feasibility of using DL-CNN for the estimation of treatment response in CT. Transfer learning did not improve the treatment response estimation. The DL-CNN performed better when transfer learning with bladder images was used instead of natural scene images.

Population Size Estimation of Men Who Have Sex with Men through the Network Scale-Up Method in Japan

PubMed Central

Ezoe, Satoshi; Morooka, Takeo; Noda, Tatsuya; Sabin, Miriam Lewis; Koike, Soichi

2012-01-01

Background Men who have sex with men (MSM) are one of the groups most at risk for HIV infection in Japan. However, size estimates of MSM populations have not been conducted with sufficient frequency and rigor because of the difficulty, high cost and stigma associated with reaching such populations. This study examined an innovative and simple method for estimating the size of the MSM population in Japan. We combined an internet survey with the network scale-up method, a social network method for estimating the size of hard-to-reach populations, for the first time in Japan. Methods and Findings An internet survey was conducted among 1,500 internet users who registered with a nationwide internet-research agency. The survey participants were asked how many members of particular groups with known population sizes (firepersons, police officers, and military personnel) they knew as acquaintances. The participants were also asked to identify the number of their acquaintances whom they understood to be MSM. Using these survey results with the network scale-up method, the personal network size and MSM population size were estimated. The personal network size was estimated to be 363.5 regardless of the sex of the acquaintances and 174.0 for only male acquaintances. The estimated MSM prevalence among the total male population in Japan was 0.0402% without adjustment, and 2.87% after adjusting for the transmission error of MSM. Conclusions The estimated personal network size and MSM prevalence seen in this study were comparable to those from previous survey results based on the direct-estimation method. Estimating population sizes through combining an internet survey with the network scale-up method appeared to be an effective method from the perspectives of rapidity, simplicity, and low cost as compared with more-conventional methods. PMID:22563366

TOFSIMS-P: a web-based platform for analysis of large-scale TOF-SIMS data.

PubMed

Yun, So Jeong; Park, Ji-Won; Choi, Il Ju; Kang, Byeongsoo; Kim, Hark Kyun; Moon, Dae Won; Lee, Tae Geol; Hwang, Daehee

2011-12-15

Time-of-flight secondary ion mass spectrometry (TOF-SIMS) has been a useful tool to profile secondary ions from the near surface region of specimens with its high molecular specificity and submicrometer spatial resolution. However, the TOF-SIMS analysis of even a moderately large size of samples has been hampered due to the lack of tools for automatically analyzing the huge amount of TOF-SIMS data. Here, we present a computational platform to automatically identify and align peaks, find discriminatory ions, build a classifier, and construct networks describing differential metabolic pathways. To demonstrate the utility of the platform, we analyzed 43 data sets generated from seven gastric cancer and eight normal tissues using TOF-SIMS. A total of 87 138 ions were detected from the 43 data sets by TOF-SIMS. We selected and then aligned 1286 ions. Among them, we found the 66 ions discriminating gastric cancer tissues from normal ones. Using these 66 ions, we then built a partial least square-discriminant analysis (PLS-DA) model resulting in a misclassification error rate of 0.024. Finally, network analysis of the 66 ions showed disregulation of amino acid metabolism in the gastric cancer tissues. The results show that the proposed framework was effective in analyzing TOF-SIMS data from a moderately large size of samples, resulting in discrimination of gastric cancer tissues from normal tissues and identification of biomarker candidates associated with the amino acid metabolism.

Fracture size and transmissivity correlations: Implications for transport simulations in sparse three-dimensional discrete fracture networks following a truncated power law distribution of fracture size

NASA Astrophysics Data System (ADS)

Hyman, J. D.; Aldrich, G.; Viswanathan, H.; Makedonska, N.; Karra, S.

2016-08-01

We characterize how different fracture size-transmissivity relationships influence flow and transport simulations through sparse three-dimensional discrete fracture networks. Although it is generally accepted that there is a positive correlation between a fracture's size and its transmissivity/aperture, the functional form of that relationship remains a matter of debate. Relationships that assume perfect correlation, semicorrelation, and noncorrelation between the two have been proposed. To study the impact that adopting one of these relationships has on transport properties, we generate multiple sparse fracture networks composed of circular fractures whose radii follow a truncated power law distribution. The distribution of transmissivities are selected so that the mean transmissivity of the fracture networks are the same and the distributions of aperture and transmissivity in models that include a stochastic term are also the same. We observe that adopting a correlation between a fracture size and its transmissivity leads to earlier breakthrough times and higher effective permeability when compared to networks where no correlation is used. While fracture network geometry plays the principal role in determining where transport occurs within the network, the relationship between size and transmissivity controls the flow speed. These observations indicate DFN modelers should be aware that breakthrough times and effective permeabilities can be strongly influenced by such a relationship in addition to fracture and network statistics.

Fracture size and transmissivity correlations: Implications for transport simulations in sparse three-dimensional discrete fracture networks following a truncated power law distribution of fracture size

NASA Astrophysics Data System (ADS)

Hyman, J.; Aldrich, G. A.; Viswanathan, H. S.; Makedonska, N.; Karra, S.

2016-12-01

We characterize how different fracture size-transmissivity relationships influence flow and transport simulations through sparse three-dimensional discrete fracture networks. Although it is generally accepted that there is a positive correlation between a fracture's size and its transmissivity/aperture, the functional form of that relationship remains a matter of debate. Relationships that assume perfect correlation, semi-correlation, and non-correlation between the two have been proposed. To study the impact that adopting one of these relationships has on transport properties, we generate multiple sparse fracture networks composed of circular fractures whose radii follow a truncated power law distribution. The distribution of transmissivities are selected so that the mean transmissivity of the fracture networks are the same and the distributions of aperture and transmissivity in models that include a stochastic term are also the same.We observe that adopting a correlation between a fracture size and its transmissivity leads to earlier breakthrough times and higher effective permeability when compared to networks where no correlation is used. While fracture network geometry plays the principal role in determining where transport occurs within the network, the relationship between size and transmissivity controls the flow speed. These observations indicate DFN modelers should be aware that breakthrough times and effective permeabilities can be strongly influenced by such a relationship in addition to fracture and network statistics.

A tree-like Bayesian structure learning algorithm for small-sample datasets from complex biological model systems.

PubMed

Yin, Weiwei; Garimalla, Swetha; Moreno, Alberto; Galinski, Mary R; Styczynski, Mark P

2015-08-28

There are increasing efforts to bring high-throughput systems biology techniques to bear on complex animal model systems, often with a goal of learning about underlying regulatory network structures (e.g., gene regulatory networks). However, complex animal model systems typically have significant limitations on cohort sizes, number of samples, and the ability to perform follow-up and validation experiments. These constraints are particularly problematic for many current network learning approaches, which require large numbers of samples and may predict many more regulatory relationships than actually exist. Here, we test the idea that by leveraging the accuracy and efficiency of classifiers, we can construct high-quality networks that capture important interactions between variables in datasets with few samples. We start from a previously-developed tree-like Bayesian classifier and generalize its network learning approach to allow for arbitrary depth and complexity of tree-like networks. Using four diverse sample networks, we demonstrate that this approach performs consistently better at low sample sizes than the Sparse Candidate Algorithm, a representative approach for comparison because it is known to generate Bayesian networks with high positive predictive value. We develop and demonstrate a resampling-based approach to enable the identification of a viable root for the learned tree-like network, important for cases where the root of a network is not known a priori. We also develop and demonstrate an integrated resampling-based approach to the reduction of variable space for the learning of the network. Finally, we demonstrate the utility of this approach via the analysis of a transcriptional dataset of a malaria challenge in a non-human primate model system, Macaca mulatta, suggesting the potential to capture indicators of the earliest stages of cellular differentiation during leukopoiesis. We demonstrate that by starting from effective and efficient approaches for creating classifiers, we can identify interesting tree-like network structures with significant ability to capture the relationships in the training data. This approach represents a promising strategy for inferring networks with high positive predictive value under the constraint of small numbers of samples, meeting a need that will only continue to grow as more high-throughput studies are applied to complex model systems.

Identifying Hierarchical and Overlapping Protein Complexes Based on Essential Protein-Protein Interactions and “Seed-Expanding” Method

PubMed Central

Ren, Jun; Zhou, Wei; Wang, Jianxin

2014-01-01

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. PMID:25143945

Mental health network governance: comparative analysis across Canadian regions

PubMed Central

Wiktorowicz, Mary E; Fleury, Marie-Josée; Adair, Carol E; Lesage, Alain; Goldner, Elliot; Peters, Suzanne

2010-01-01

Objective Modes of governance were compared in ten local mental health networks in diverse contexts (rural/urban and regionalized/non-regionalized) to clarify the governance processes that foster inter-organizational collaboration and the conditions that support them. Methods Case studies of ten local mental health networks were developed using qualitative methods of document review, semi-structured interviews and focus groups that incorporated provincial policy, network and organizational levels of analysis. Results Mental health networks adopted either a corporate structure, mutual adjustment or an alliance governance model. A corporate structure supported by regionalization offered the most direct means for local governance to attain inter-organizational collaboration. The likelihood that networks with an alliance model developed coordination processes depended on the presence of the following conditions: a moderate number of organizations, goal consensus and trust among the organizations, and network-level competencies. In the small and mid-sized urban networks where these conditions were met their alliance realized the inter-organizational collaboration sought. In the large urban and rural networks where these conditions were not met, externally brokered forms of network governance were required to support alliance based models. Discussion In metropolitan and rural networks with such shared forms of network governance as an alliance or voluntary mutual adjustment, external mediation by a regional or provincial authority was an important lever to foster inter-organizational collaboration. PMID:21289999

Engagement of large-scale networks is related to individual differences in inhibitory control

PubMed Central

Congdon, Eliza; Mumford, Jeanette A.; Cohen, Jessica R.; Galvan, Adriana; Aron, Adam R.; Xue, Gui; Miller, Eric; Poldrack, Russell A.

2010-01-01

Understanding which brain regions regulate the execution, and suppression, of goal-directed behavior has implications for a number of areas of research. In particular, understanding which brain regions engaged during tasks requiring the execution and inhibition of a motor response provides insight into the mechanisms underlying individual differences in response inhibition ability. However, neuroimaging studies examing the relation between activation and stopping have been inconsistent regarding the direction of the relationship, and also regarding the anatomical location of regions that correlate with behavior. These limitations likely arise from the relatively low power of vox-elwise correlations with small sample sizes. Here, we pooled data over five separate fMRI studies of the Stop-signal task in order to obtain a sufficiently large sample size to robustly detect brain/behavior correlations. In addition, rather than performing mass univariate correlation analysis across all voxels, we increased statistical power by reducing the dimensionality of the data set using independent components analysis and then examined correlations between behavior and the resulting component scores. We found that components reflecting activity in regions thought to be involved in stopping were associated with better stopping ability, while activity in a default-mode network was associated with poorer stopping ability across individuals. These results clearly show a relationship between individual differences in stopping ability in specific activated networks, including regions known to be critical for the behavior. The results also highlight the usefulness of using dimensionality reduction to increase the power to detect brain/behavior correlations in individual differences research. PMID:20600962

Exact Hybrid Particle/Population Simulation of Rule-Based Models of Biochemical Systems

PubMed Central

Stover, Lori J.; Nair, Niketh S.; Faeder, James R.

2014-01-01

Detailed modeling and simulation of biochemical systems is complicated by the problem of combinatorial complexity, an explosion in the number of species and reactions due to myriad protein-protein interactions and post-translational modifications. Rule-based modeling overcomes this problem by representing molecules as structured objects and encoding their interactions as pattern-based rules. This greatly simplifies the process of model specification, avoiding the tedious and error prone task of manually enumerating all species and reactions that can potentially exist in a system. From a simulation perspective, rule-based models can be expanded algorithmically into fully-enumerated reaction networks and simulated using a variety of network-based simulation methods, such as ordinary differential equations or Gillespie's algorithm, provided that the network is not exceedingly large. Alternatively, rule-based models can be simulated directly using particle-based kinetic Monte Carlo methods. This “network-free” approach produces exact stochastic trajectories with a computational cost that is independent of network size. However, memory and run time costs increase with the number of particles, limiting the size of system that can be feasibly simulated. Here, we present a hybrid particle/population simulation method that combines the best attributes of both the network-based and network-free approaches. The method takes as input a rule-based model and a user-specified subset of species to treat as population variables rather than as particles. The model is then transformed by a process of “partial network expansion” into a dynamically equivalent form that can be simulated using a population-adapted network-free simulator. The transformation method has been implemented within the open-source rule-based modeling platform BioNetGen, and resulting hybrid models can be simulated using the particle-based simulator NFsim. Performance tests show that significant memory savings can be achieved using the new approach and a monetary cost analysis provides a practical measure of its utility. PMID:24699269

Exact hybrid particle/population simulation of rule-based models of biochemical systems.

PubMed

Hogg, Justin S; Harris, Leonard A; Stover, Lori J; Nair, Niketh S; Faeder, James R

2014-04-01

Detailed modeling and simulation of biochemical systems is complicated by the problem of combinatorial complexity, an explosion in the number of species and reactions due to myriad protein-protein interactions and post-translational modifications. Rule-based modeling overcomes this problem by representing molecules as structured objects and encoding their interactions as pattern-based rules. This greatly simplifies the process of model specification, avoiding the tedious and error prone task of manually enumerating all species and reactions that can potentially exist in a system. From a simulation perspective, rule-based models can be expanded algorithmically into fully-enumerated reaction networks and simulated using a variety of network-based simulation methods, such as ordinary differential equations or Gillespie's algorithm, provided that the network is not exceedingly large. Alternatively, rule-based models can be simulated directly using particle-based kinetic Monte Carlo methods. This "network-free" approach produces exact stochastic trajectories with a computational cost that is independent of network size. However, memory and run time costs increase with the number of particles, limiting the size of system that can be feasibly simulated. Here, we present a hybrid particle/population simulation method that combines the best attributes of both the network-based and network-free approaches. The method takes as input a rule-based model and a user-specified subset of species to treat as population variables rather than as particles. The model is then transformed by a process of "partial network expansion" into a dynamically equivalent form that can be simulated using a population-adapted network-free simulator. The transformation method has been implemented within the open-source rule-based modeling platform BioNetGen, and resulting hybrid models can be simulated using the particle-based simulator NFsim. Performance tests show that significant memory savings can be achieved using the new approach and a monetary cost analysis provides a practical measure of its utility.

The inhabited environment, infrastructure development and advanced urbanization in China’s Yangtze River Delta Region

NASA Astrophysics Data System (ADS)

Zhu, Xiaoqing; Gao, Weijun; Zhou, Nan; Kammen, Daniel M.; Wu, Yiqun; Zhang, Yao; Chen, Wei

2016-12-01

This paper analyzes the relationship among the inhabited environment, infrastructure development and environmental impacts in China’s heavily urbanized Yangtze River Delta region. Using primary human environment data for the period 2006-2014, we examine factors affecting the inhabited environment and infrastructure development: urban population, GDP, built-up area, energy consumption, waste emission, transportation, real estate and urban greenery. Then we empirically investigate the impact of advanced urbanization with consideration of cities’ differences. Results from this study show that the growth rate of the inhabited environment and infrastructure development is strongly influenced by regional development structure, functional orientations, traffic network and urban size and form. The effect of advanced urbanization is more significant in large and mid-size cities than huge and mega cities. Energy consumption, waste emission and real estate in large and mid-size cities developed at an unprecedented rate with the rapid increase of economy. However, urban development of huge and mega cities gradually tended to be saturated. The transition development in these cities improved the inhabited environment and ecological protection instead of the urban construction simply. To maintain a sustainable advanced urbanization process, policy implications included urban sprawl control polices, ecological development mechanisms and reforming the economic structure for huge and mega cities, and construct major cross-regional infrastructure, enhance the carrying capacity and improvement of energy efficiency and structure for large and mid-size cities.

Automated detection of geological landforms on Mars using Convolutional Neural Networks

NASA Astrophysics Data System (ADS)

Palafox, Leon F.; Hamilton, Christopher W.; Scheidt, Stephen P.; Alvarez, Alexander M.

2017-04-01

The large volume of high-resolution images acquired by the Mars Reconnaissance Orbiter has opened a new frontier for developing automated approaches to detecting landforms on the surface of Mars. However, most landform classifiers focus on crater detection, which represents only one of many geological landforms of scientific interest. In this work, we use Convolutional Neural Networks (ConvNets) to detect both volcanic rootless cones and transverse aeolian ridges. Our system, named MarsNet, consists of five networks, each of which is trained to detect landforms of different sizes. We compare our detection algorithm with a widely used method for image recognition, Support Vector Machines (SVMs) using Histogram of Oriented Gradients (HOG) features. We show that ConvNets can detect a wide range of landforms and has better accuracy and recall in testing data than traditional classifiers based on SVMs.

Critical dynamics on a large human Open Connectome network

NASA Astrophysics Data System (ADS)

Ódor, Géza

2016-12-01

Extended numerical simulations of threshold models have been performed on a human brain network with N =836 733 connected nodes available from the Open Connectome Project. While in the case of simple threshold models a sharp discontinuous phase transition without any critical dynamics arises, variable threshold models exhibit extended power-law scaling regions. This is attributed to fact that Griffiths effects, stemming from the topological or interaction heterogeneity of the network, can become relevant if the input sensitivity of nodes is equalized. I have studied the effects of link directness, as well as the consequence of inhibitory connections. Nonuniversal power-law avalanche size and time distributions have been found with exponents agreeing with the values obtained in electrode experiments of the human brain. The dynamical critical region occurs in an extended control parameter space without the assumption of self-organized criticality.

Automated detection of geological landforms on Mars using Convolutional Neural Networks.

PubMed

Palafox, Leon F; Hamilton, Christopher W; Scheidt, Stephen P; Alvarez, Alexander M

2017-04-01

The large volume of high-resolution images acquired by the Mars Reconnaissance Orbiter has opened a new frontier for developing automated approaches to detecting landforms on the surface of Mars. However, most landform classifiers focus on crater detection, which represents only one of many geological landforms of scientific interest. In this work, we use Convolutional Neural Networks (ConvNets) to detect both volcanic rootless cones and transverse aeolian ridges. Our system, named MarsNet, consists of five networks, each of which is trained to detect landforms of different sizes. We compare our detection algorithm with a widely used method for image recognition, Support Vector Machines (SVMs) using Histogram of Oriented Gradients (HOG) features. We show that ConvNets can detect a wide range of landforms and has better accuracy and recall in testing data than traditional classifiers based on SVMs.

Programmable synaptic chip for electronic neural networks

NASA Technical Reports Server (NTRS)

Moopenn, A.; Langenbacher, H.; Thakoor, A. P.; Khanna, S. K.

1988-01-01

A binary synaptic matrix chip has been developed for electronic neural networks. The matrix chip contains a programmable 32X32 array of 'long channel' NMOSFET binary connection elements implemented in a 3-micron bulk CMOS process. Since the neurons are kept off-chip, the synaptic chip serves as a 'cascadable' building block for a multi-chip synaptic network as large as 512X512 in size. As an alternative to the programmable NMOSFET (long channel) connection elements, tailored thin film resistors are deposited, in series with FET switches, on some CMOS test chips, to obtain the weak synaptic connections. Although deposition and patterning of the resistors require additional processing steps, they promise substantial savings in silicon area. The performance of synaptic chip in a 32-neuron breadboard system in an associative memory test application is discussed.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

PubMed Central

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme. PMID:26690571

A Science Cloud: OneSpaceNet

NASA Astrophysics Data System (ADS)

Morikawa, Y.; Murata, K. T.; Watari, S.; Kato, H.; Yamamoto, K.; Inoue, S.; Tsubouchi, K.; Fukazawa, K.; Kimura, E.; Tatebe, O.; Shimojo, S.

2010-12-01

Main methodologies of Solar-Terrestrial Physics (STP) so far are theoretical, experimental and observational, and computer simulation approaches. Recently "informatics" is expected as a new (fourth) approach to the STP studies. Informatics is a methodology to analyze large-scale data (observation data and computer simulation data) to obtain new findings using a variety of data processing techniques. At NICT (National Institute of Information and Communications Technology, Japan) we are now developing a new research environment named "OneSpaceNet". The OneSpaceNet is a cloud-computing environment specialized for science works, which connects many researchers with high-speed network (JGN: Japan Gigabit Network). The JGN is a wide-area back-born network operated by NICT; it provides 10G network and many access points (AP) over Japan. The OneSpaceNet also provides with rich computer resources for research studies, such as super-computers, large-scale data storage area, licensed applications, visualization devices (like tiled display wall: TDW), database/DBMS, cluster computers (4-8 nodes) for data processing and communication devices. What is amazing in use of the science cloud is that a user simply prepares a terminal (low-cost PC). Once connecting the PC to JGN2plus, the user can make full use of the rich resources of the science cloud. Using communication devices, such as video-conference system, streaming and reflector servers, and media-players, the users on the OneSpaceNet can make research communications as if they belong to a same (one) laboratory: they are members of a virtual laboratory. The specification of the computer resources on the OneSpaceNet is as follows: The size of data storage we have developed so far is almost 1PB. The number of the data files managed on the cloud storage is getting larger and now more than 40,000,000. What is notable is that the disks forming the large-scale storage are distributed to 5 data centers over Japan (but the storage system performs as one disk). There are three supercomputers allocated on the cloud, one from Tokyo, one from Osaka and the other from Nagoya. One's simulation job data on any supercomputers are saved on the cloud data storage (same directory); it is a kind of virtual computing environment. The tiled display wall has 36 panels acting as one display; the pixel (resolution) size of it is as large as 18000x4300. This size is enough to preview or analyze the large-scale computer simulation data. It also allows us to take a look of multiple (e.g., 100 pictures) on one screen together with many researchers. In our talk we also present a brief report of the initial results using the OneSpaceNet for Global MHD simulations as an example of successful use of our science cloud; (i) Ultra-high time resolution visualization of Global MHD simulations on the large-scale storage and parallel processing system on the cloud, (ii) Database of real-time Global MHD simulation and statistic analyses of the data, and (iii) 3D Web service of Global MHD simulations.

The complexity and robustness of metro networks

NASA Astrophysics Data System (ADS)

Derrible, Sybil; Kennedy, Christopher

2010-09-01

Transportation systems, being real-life examples of networks, are particularly interesting to analyze from the viewpoint of the new and rapidly emerging field of network science. Two particular concepts seem to be particularly relevant: scale-free patterns and small-worlds. By looking at 33 metro systems in the world, this paper adapts network science methodologies to the transportation literature, and offers one application to the robustness of metros; here, metro refers to urban rail transit with exclusive right-of-way, whether it is underground, at grade or elevated. We find that most metros are indeed scale-free (with scaling factors ranging from 2.10 to 5.52) and small-worlds; they show atypical behaviors, however, with increasing size. In particular, the presence of transfer-hubs (stations hosting more than three lines) results in relatively large scaling factors. The analysis provides insights/recommendations for increasing the robustness of metro networks. Smaller networks should focus on creating transfer stations, thus generating cycles to offer alternative routes. For larger networks, few stations seem to detain a certain monopole on transferring, it is therefore important to create additional transfers, possibly at the periphery of city centers; the Tokyo system seems to remarkably incorporate these properties.

Link predication based on matrix factorization by fusion of multi class organizations of the network.

PubMed

Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun

2017-08-21

Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix factorization, which is called NMF 3 here. We first map the observed network into another space by kernel functions, which could get the different order organizations. Then we combine the adjacency matrix of the network with one of other organizations, which makes us obtain the objective function of our framework for link predication based on the nonnegative matrix factorization. Third, we derive an iterative algorithm to optimize the objective function, which converges to a local optimum, and we propose a fast optimization strategy for large networks. Lastly, we test the proposed framework based on two kernel functions on a series of real world networks under different sizes of training set, and the experimental results show the feasibility, effectiveness, and competitiveness of the proposed framework.

Single Step Laser Transfer and Laser Curing of Ag NanoWires: A Digital Process for the Fabrication of Flexible and Transparent Microelectrodes.

PubMed

Zacharatos, Filimon; Karvounis, Panagiotis; Theodorakos, Ioannis; Hatziapostolou, Antonios; Zergioti, Ioanna

2018-06-19

Ag nanowire (NW) networks have exquisite optical and electrical properties which make them ideal candidate materials for flexible transparent conductive electrodes. Despite the compatibility of Ag NW networks with laser processing, few demonstrations of laser fabricated Ag NW based components currently exist. In this work, we report on a novel single step laser transferring and laser curing process of micrometer sized pixels of Ag NW networks on flexible substrates. This process relies on the selective laser heating of the Ag NWs induced by the laser pulse energy and the subsequent localized melting of the polymeric substrate. We demonstrate that a single laser pulse can induce both transfer and curing of the Ag NW network. The feasibility of the process is confirmed experimentally and validated by Finite Element Analysis simulations, which indicate that selective heating is carried out within a submicron-sized heat affected zone. The resulting structures can be utilized as fully functional flexible transparent electrodes with figures of merit even higher than 100. Low sheet resistance (<50 Ohm/sq) and high visible light transparency (>90%) make the reported process highly desirable for a variety of applications, including selective heating or annealing of nanocomposite materials and laser processing of nanostructured materials on a large variety of optically transparent substrates, such as Polydimethylsiloxane (PDMS).

Formation Flying for Satellites and Unmanned Aerial Vehicles

NASA Technical Reports Server (NTRS)

Merrill, Garrick

2015-01-01

The shrinking size of satellites and unmanned aerial vehicles (UAVs) is enabling lower cost missions. As sensors and electronics continue to downsize, the next step is multiple vehicles providing different perspectives or variations for more precise measurements. While flying a single satellite or UAV autonomously is a challenge, flying multiple vehicles in a precise formation is even more challenging. The goal of this project is to develop a scalable mesh network between vehicles (satellites or UAVs) to share real-time position data and maintain formations autonomously. Newly available low-cost, commercial off-the-shelf credit card size computers will be used as the basis for this network. Mesh networking techniques will be used to provide redundant links and a flexible network. The Small Projects Rapid Integration and Test Environment Lab will be used to simulate formation flying of satellites. UAVs built by the Aero-M team will be used to demonstrate the formation flying in the West Test Area. The ability to test in flight on NASA-owned UAVs allows this technology to achieve a high Technology Readiness Level (TRL) (TRL-4 for satellites and TRL-7 for UAVs). The low cost of small UAVs and the availability of a large test range (West Test Area) dramatically reduces the expense of testing. The end goal is for this technology to be ready to use on any multiple satellite or UAV mission.

Nonlinear transport of soft droplets in pore networks

NASA Astrophysics Data System (ADS)

Vernerey, Franck; Benet Cerda, Eduard; Koo, Kanghyeon

A large number of biological and technological processes depend on the transport of soft colloidal particles through porous media; this includes the transport and separation of cells, viruses or drugs through tissues, membranes and microfluidic devices. In these systems, the interactions between soft particles, background fluid and the surrounding pore space yield complex, nonlinear behaviors such as non-Darcy flows, localization and jamming. We devise a computational strategy to investigate the transport of non-wetting and deformable water droplets in a microfluidic device made of a random distribution of cylindrical obstacles. We first derive scaling laws for the entry of the droplet in a single pore and discuss the role of surface tension, contact angle and size in this process. This information is then used to study the transport of multiple droplets in an obstacle network. We find that when the droplet size is close to the pore size, fluid flow and droplet trafficking strongly interact, leading to local redistributions in pressure fields, intermittent clogging and jamming. Importantly, it is found that the overall droplet and fluid transport display three different scaling regimes depending on the forcing pressure, and that these regimes can be related to droplet properties.

Small-angle x-ray scattering in amorphous silicon: A computational study

NASA Astrophysics Data System (ADS)

Paudel, Durga; Atta-Fynn, Raymond; Drabold, David A.; Elliott, Stephen R.; Biswas, Parthapratim

2018-05-01

We present a computational study of small-angle x-ray scattering (SAXS) in amorphous silicon (a -Si) with particular emphasis on the morphology and microstructure of voids. The relationship between the scattering intensity in SAXS and the three-dimensional structure of nanoscale inhomogeneities or voids is addressed by generating large high-quality a -Si networks with 0.1%-0.3% volume concentration of voids, as observed in experiments using SAXS and positron annihilation spectroscopy. A systematic study of the variation of the scattering intensity in the small-angle scattering region with the size, shape, number density, and the spatial distribution of the voids in the networks is presented. Our results suggest that the scattering intensity in the small-angle region is particularly sensitive to the size and the total volume fraction of the voids, but the effect of the geometry or shape of the voids is less pronounced in the intensity profiles. A comparison of the average size of the voids obtained from the simulated values of the intensity, using the Guinier approximation and Kratky plots, with that of the same from the spatial distribution of the atoms in the vicinity of void surfaces is presented.

Improved knowledge diffusion model based on the collaboration hypernetwork

NASA Astrophysics Data System (ADS)

Wang, Jiang-Pan; Guo, Qiang; Yang, Guang-Yong; Liu, Jian-Guo

2015-06-01

The process for absorbing knowledge becomes an essential element for innovation in firms and in adapting to changes in the competitive environment. In this paper, we present an improved knowledge diffusion hypernetwork (IKDH) model based on the idea that knowledge will spread from the target node to all its neighbors in terms of the hyperedge and knowledge stock. We apply the average knowledge stock V(t) , the variable σ2(t) , and the variance coefficient c(t) to evaluate the performance of knowledge diffusion. By analyzing different knowledge diffusion ways, selection ways of the highly knowledgeable nodes, hypernetwork sizes and hypernetwork structures for the performance of knowledge diffusion, results show that the diffusion speed of IKDH model is 3.64 times faster than that of traditional knowledge diffusion (TKDH) model. Besides, it is three times faster to diffuse knowledge by randomly selecting "expert" nodes than that by selecting large-hyperdegree nodes as "expert" nodes. Furthermore, either the closer network structure or smaller network size results in the faster knowledge diffusion.

[Correlations between features of social network and outcomes in those suffering from schizophrenia seven years from the first hospitalisation].

PubMed

Cechnicki, Andrzej; Wojciechowska, Anna

2007-01-01

A research had been conducted upon the correlations between selected parameters of social networks of 64 patients ill with schizophrenia who were diagnosed according to DSM-III, and the aims of treatment such as: motivation to receive treatment, insight, compliance in taking medication, satisfaction with treatment, and treatment outcomes in the area of clinical and social functioning as well as family functioning seven years after the first admission. The indices of social networks were studied with Bizon's questionnaire. It serves storing of data on persons who have supportive functions as well as allows to work out characteristic properties of the support system such as: range of the network, size of the extra-familial network, level and localisation of the support, network and support system age. A compound system of social support and large social network, with a high level of support, correlate in a beneficial way with higher subjective satisfaction with treatment. Whereas a large extra-familial network with high level of support, correlates with better insight into illness. The larger the social network was (its range to be precise), including extra-familial network and the high level of incoming support, the fewer positive and negative symptoms the patients had and much more remissions appeared then. The larger network's range correlates with smaller number of relapses and global time of being hospitalised. People with a larger network, with high level of support located in family and outside the family, have been rarely hospitalised. The connection between network's parameters and number of daily hospitalisations had been rated. People with a larger network, including extra-familial network, with high level of social support function better in the society didn't become regressive in their professional lives and they have smaller burden in their family life. The high level of social support correlates with better family function. In families of people ill with schizophrenia having larger extra-familial network with a high level of support there is less deterioration and disintegration, criticism and rejection.

Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

PubMed Central

Hosseini, S. M. Hadi; Kesler, Shelli R.

2013-01-01

In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures. PMID:23840672

Learning to play Go using recursive neural networks.

PubMed

Wu, Lin; Baldi, Pierre

2008-11-01

Go is an ancient board game that poses unique opportunities and challenges for artificial intelligence. Currently, there are no computer Go programs that can play at the level of a good human player. However, the emergence of large repositories of games is opening the door for new machine learning approaches to address this challenge. Here we develop a machine learning approach to Go, and related board games, focusing primarily on the problem of learning a good evaluation function in a scalable way. Scalability is essential at multiple levels, from the library of local tactical patterns, to the integration of patterns across the board, to the size of the board itself. The system we propose is capable of automatically learning the propensity of local patterns from a library of games. Propensity and other local tactical information are fed into recursive neural networks, derived from a probabilistic Bayesian network architecture. The recursive neural networks in turn integrate local information across the board in all four cardinal directions and produce local outputs that represent local territory ownership probabilities. The aggregation of these probabilities provides an effective strategic evaluation function that is an estimate of the expected area at the end, or at various other stages, of the game. Local area targets for training can be derived from datasets of games played by human players. In this approach, while requiring a learning time proportional to N(4), skills learned on a board of size N(2) can easily be transferred to boards of other sizes. A system trained using only 9 x 9 amateur game data performs surprisingly well on a test set derived from 19 x 19 professional game data. Possible directions for further improvements are briefly discussed.

Estimation of Global Network Statistics from Incomplete Data

PubMed Central

Bliss, Catherine A.; Danforth, Christopher M.; Dodds, Peter Sheridan

2014-01-01

Complex networks underlie an enormous variety of social, biological, physical, and virtual systems. A profound complication for the science of complex networks is that in most cases, observing all nodes and all network interactions is impossible. Previous work addressing the impacts of partial network data is surprisingly limited, focuses primarily on missing nodes, and suggests that network statistics derived from subsampled data are not suitable estimators for the same network statistics describing the overall network topology. We generate scaling methods to predict true network statistics, including the degree distribution, from only partial knowledge of nodes, links, or weights. Our methods are transparent and do not assume a known generating process for the network, thus enabling prediction of network statistics for a wide variety of applications. We validate analytical results on four simulated network classes and empirical data sets of various sizes. We perform subsampling experiments by varying proportions of sampled data and demonstrate that our scaling methods can provide very good estimates of true network statistics while acknowledging limits. Lastly, we apply our techniques to a set of rich and evolving large-scale social networks, Twitter reply networks. Based on 100 million tweets, we use our scaling techniques to propose a statistical characterization of the Twitter Interactome from September 2008 to November 2008. Our treatment allows us to find support for Dunbar's hypothesis in detecting an upper threshold for the number of active social contacts that individuals maintain over the course of one week. PMID:25338183

Large computer simulations on elastic networks: Small eigenvalues and eigenvalue spectra of the Kirchhoff matrix

NASA Astrophysics Data System (ADS)

Shy, L. Y.; Eichinger, B. E.

1989-05-01

Computer simulations of the formation of trifunctional and tetrafunctional polydimethyl-siloxane networks that are crosslinked by condensation of telechelic chains with multifunctional crosslinking agents have been carried out on systems containing up to 1.05×106 chains. Eigenvalue spectra of Kirchhoff matrices for these networks have been evaluated at two levels of approximation: (1) inclusion of all midchain modes, and (2) suppression of midchain modes. By use of the recursion method of Haydock and Nex, we have been able to effectively diagonalize matrices with 730 498 rows and columns without actually constructing matrices of this size. The small eigenvalues have been computed by use of the Lanczos algorithm. We demonstrate the following results: (1) The smallest eigenvalues (with chain modes suppressed) vary as μ-2/3 for sufficiently large μ, where μ is the number of junctions in the network; (2) the eigenvalue spectra of the Kirchhoff matrices are well described by McKay's theory for random regular graphs in the range of the larger eigenvalues, but there are significant departures in the region of small eigenvalues where computed spectra have many more small eigenvalues than random regular graphs; (3) the smallest eigenvalues vary as n-1.78 where n is the number of Rouse beads in the chains that comprise the network. Computations are done for both monodisperse and polydisperse chain length distributions. Large eigenvalues associated with localized motion of the junctions are found as predicted by theory. The relationship between the small eigenvalues and the equilibrium modulus of elasticity is discussed, as is the relationship between viscoelasticity and the band edge of the spectrum.

Coherent periodic activity in excitatory Erdös-Renyi neural networks: the role of network connectivity.

PubMed

Tattini, Lorenzo; Olmi, Simona; Torcini, Alessandro

2012-06-01

In this article, we investigate the role of connectivity in promoting coherent activity in excitatory neural networks. In particular, we would like to understand if the onset of collective oscillations can be related to a minimal average connectivity and how this critical connectivity depends on the number of neurons in the networks. For these purposes, we consider an excitatory random network of leaky integrate-and-fire pulse coupled neurons. The neurons are connected as in a directed Erdös-Renyi graph with average connectivity scaling as a power law with the number of neurons in the network. The scaling is controlled by a parameter γ, which allows to pass from massively connected to sparse networks and therefore to modify the topology of the system. At a macroscopic level, we observe two distinct dynamical phases: an asynchronous state corresponding to a desynchronized dynamics of the neurons and a regime of partial synchronization (PS) associated with a coherent periodic activity of the network. At low connectivity, the system is in an asynchronous state, while PS emerges above a certain critical average connectivity (c). For sufficiently large networks, (c) saturates to a constant value suggesting that a minimal average connectivity is sufficient to observe coherent activity in systems of any size irrespectively of the kind of considered network: sparse or massively connected. However, this value depends on the nature of the synapses: reliable or unreliable. For unreliable synapses, the critical value required to observe the onset of macroscopic behaviors is noticeably smaller than for reliable synaptic transmission. Due to the disorder present in the system, for finite number of neurons we have inhomogeneities in the neuronal behaviors, inducing a weak form of chaos, which vanishes in the thermodynamic limit. In such a limit, the disordered systems exhibit regular (non chaotic) dynamics and their properties correspond to that of a homogeneous fully connected network for any γ-value. Apart for the peculiar exception of sparse networks, which remain intrinsically inhomogeneous at any system size.

Synthesis of a large-sized mesoporous phosphosilicate thin film through evaporation-induced polymeric micelle assembly.

PubMed

Li, Yunqi; Bastakoti, Bishnu Prasad; Imura, Masataka; Suzuki, Norihiro; Jiang, Xiangfen; Ohki, Shinobu; Deguchi, Kenzo; Suzuki, Madoka; Arai, Satoshi; Yamauchi, Yusuke

2015-01-01

A triblock copolymer, poly(styrene-b-2-vinyl pyridine-b-ethylene oxide) (PS-b-P2VP-b-PEO) was used as a soft template to synthesize large-sized mesoporous phosphosilicate thin films. The kinetically frozen PS core stabilizes the micelles. The strong interaction of the inorganic precursors with the P2VP shell enables the fabrication of highly robust walls of phosphosilicate and the PEO helps orderly packing of the micelles during solvent evaporation. The molar ratio of phosphoric acid and tetraethyl orthosilicate is crucial to achieve the final mesostructure. The insertion of phosphorus species into the siloxane network is studied by (29) Si and (31) P MAS NMR spectra. The mesoporous phosphosilicate films exhibit steady cell adhesion properties and show great promise as excellent materials in bone-growth engineering applications. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Coherent operation of detector systems and their readout electronics in a complex experiment control environment

NASA Astrophysics Data System (ADS)

Koestner, Stefan

2009-09-01

With the increasing size and degree of complexity of today's experiments in high energy physics the required amount of work and complexity to integrate a complete subdetector into an experiment control system is often underestimated. We report here on the layered software structure and protocols used by the LHCb experiment to control its detectors and readout boards. The experiment control system of LHCb is based on the commercial SCADA system PVSS II. Readout boards which are outside the radiation area are accessed via embedded credit card sized PCs which are connected to a large local area network. The SPECS protocol is used for control of the front end electronics. Finite state machines are introduced to facilitate the control of a large number of electronic devices and to model the whole experiment at the level of an expert system.

Near-bed turbulence and sediment flux measurements in tidal channels

USGS Publications Warehouse

Wright, S.A.; Whealdon-Haught, D.R.

2012-01-01

Understanding the hydrodynamics and sediment transport dynamics in tidal channels is important for studies of estuary geomorphology, sediment supply to tidal wetlands, aquatic ecology and fish habitat, and dredging and navigation. Hydrodynamic and sediment transport data are essential for calibration and testing of numerical models that may be used to address management questions related to these topics. Herein we report preliminary analyses of near-bed turbulence and sediment flux measurements in the Sacramento-San Joaquin Delta, a large network of tidal channels and wetlands located at the confluence of the Sacramento and San Joaquin Rivers, California, USA (Figure 1). Measurements were made in 6 channels spanning a wide range of size and tidal conditions, from small channels that are primarily fluvial to large channels that are tidally dominated. The results of these measurements are summarized herein and the hydrodynamic and sediment transport characteristics of the channels are compared across this range of size and conditions.