Neural-like growing networks

NASA Astrophysics Data System (ADS)

Yashchenko, Vitaliy A.

2000-03-01

On the basis of the analysis of scientific ideas reflecting the law in the structure and functioning the biological structures of a brain, and analysis and synthesis of knowledge, developed by various directions in Computer Science, also there were developed the bases of the theory of a new class neural-like growing networks, not having the analogue in world practice. In a base of neural-like growing networks the synthesis of knowledge developed by classical theories - semantic and neural of networks is. The first of them enable to form sense, as objects and connections between them in accordance with construction of the network. With thus each sense gets a separate a component of a network as top, connected to other tops. In common it quite corresponds to structure reflected in a brain, where each obvious concept is presented by certain structure and has designating symbol. Secondly, this network gets increased semantic clearness at the expense owing to formation not only connections between neural by elements, but also themselves of elements as such, i.e. here has a place not simply construction of a network by accommodation sense structures in environment neural of elements, and purely creation of most this environment, as of an equivalent of environment of memory. Thus neural-like growing networks are represented by the convenient apparatus for modeling of mechanisms of teleological thinking, as a fulfillment of certain psychophysiological of functions.

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

Feed-forward and generalized regression neural networks in modeling feeding behavior of pigs in the grow-finishing phase

USDA-ARS?s Scientific Manuscript database

Feeding patterns in group-housed grow-finishing pigs have been investigated for use in management decisions, identifying sick animals, and determining genetic differences within a herd. Development of models to predict swine feeding behaviour has been limited due the large number of potential enviro...

Analysis of Road Network Pattern Considering Population Distribution and Central Business District

PubMed Central

Zhao, Fangxia; Sun, Huijun; Wu, Jianjun; Gao, Ziyou; Liu, Ronghui

2016-01-01

This paper proposes a road network growing model with the consideration of population distribution and central business district (CBD) attraction. In the model, the relative neighborhood graph (RNG) is introduced as the connection mechanism to capture the characteristics of road network topology. The simulation experiment is set up to illustrate the effects of population distribution and CBD attraction on the characteristics of road network. Moreover, several topological attributes of road network is evaluated by using coverage, circuitness, treeness and total length in the experiment. Finally, the suggested model is verified in the simulation of China and Beijing Highway networks. PMID:26981857

A feed-forward neural network for modeling feeding behavior of group-housed grow-finish pigs with respect to thermal conditions

USDA-ARS?s Scientific Manuscript database

Feeding patterns of pigs in the grow-finish phase have been investigated for use in management decisions, identifying sick animals, and determining genetic differences within a herd. Development of models to predict swine feeding behavior has been limited due the large number of potential environmen...

A Dynamic Bayesian Network Based Structural Learning towards Automated Handwritten Digit Recognition

NASA Astrophysics Data System (ADS)

Pauplin, Olivier; Jiang, Jianmin

Pattern recognition using Dynamic Bayesian Networks (DBNs) is currently a growing area of study. In this paper, we present DBN models trained for classification of handwritten digit characters. The structure of these models is partly inferred from the training data of each class of digit before performing parameter learning. Classification results are presented for the four described models.

Competing edge networks

NASA Astrophysics Data System (ADS)

Parsons, Mark; Grindrod, Peter

2012-06-01

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other's growth and encourage the other's demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.

Spatial statistical network models for stream and river temperature in New England, USA

NASA Astrophysics Data System (ADS)

Detenbeck, Naomi E.; Morrison, Alisa C.; Abele, Ralph W.; Kopp, Darin A.

2016-08-01

Watershed managers are challenged by the need for predictive temperature models with sufficient accuracy and geographic breadth for practical use. We described thermal regimes of New England rivers and streams based on a reduced set of metrics for the May-September growing season (July or August median temperature, diurnal rate of change, and magnitude and timing of growing season maximum) chosen through principal component analysis of 78 candidate metrics. We then developed and assessed spatial statistical models for each of these metrics, incorporating spatial autocorrelation based on both distance along the flow network and Euclidean distance between points. Calculation of spatial autocorrelation based on travel or retention time in place of network distance yielded tighter-fitting Torgegrams with less scatter but did not improve overall model prediction accuracy. We predicted monthly median July or August stream temperatures as a function of median air temperature, estimated urban heat island effect, shaded solar radiation, main channel slope, watershed storage (percent lake and wetland area), percent coarse-grained surficial deposits, and presence or maximum depth of a lake immediately upstream, with an overall root-mean-square prediction error of 1.4 and 1.5°C, respectively. Growing season maximum water temperature varied as a function of air temperature, local channel slope, shaded August solar radiation, imperviousness, and watershed storage. Predictive models for July or August daily range, maximum daily rate of change, and timing of growing season maximum were statistically significant but explained a much lower proportion of variance than the above models (5-14% of total).

Geometric Assortative Growth Model for Small-World Networks

PubMed Central

2014-01-01

It has been shown that both humanly constructed and natural networks are often characterized by small-world phenomenon and assortative mixing. In this paper, we propose a geometrically growing model for small-world networks. The model displays both tunable small-world phenomenon and tunable assortativity. We obtain analytical solutions of relevant topological properties such as order, size, degree distribution, degree correlation, clustering, transitivity, and diameter. It is also worth noting that the model can be viewed as a generalization for an iterative construction of Farey graphs. PMID:24578661

A Percolation Model for Fracking

NASA Astrophysics Data System (ADS)

Norris, J. Q.; Turcotte, D. L.; Rundle, J. B.

2014-12-01

Developments in fracking technology have enabled the recovery of vast reserves of oil and gas; yet, there is very little publicly available scientific research on fracking. Traditional reservoir simulator models for fracking are computationally expensive, and require many hours on a supercomputer to simulate a single fracking treatment. We have developed a computationally inexpensive percolation model for fracking that can be used to understand the processes and risks associated with fracking. In our model, a fluid is injected from a single site and a network of fractures grows from the single site. The fracture network grows in bursts, the failure of a relatively strong bond followed by the failure of a series of relatively weak bonds. These bursts display similarities to micro seismic events observed during a fracking treatment. The bursts follow a power-law (Gutenburg-Richter) frequency-size distribution and have growth rates similar to observed earthquake moment rates. These are quantifiable features that can be compared to observed microseismicity to help understand the relationship between observed microseismicity and the underlying fracture network.

Two Simple Models for Fracking

NASA Astrophysics Data System (ADS)

Norris, Jaren Quinn

Recent developments in fracking have enable the recovery of oil and gas from tight shale reservoirs. These developments have also made fracking one of the most controversial environmental issues in the United States. Despite the growing controversy surrounding fracking, there is relatively little publicly available research. This dissertation introduces two simple models for fracking that were developed using techniques from non-linear and statistical physics. The first model assumes that the volume of induced fractures must be equal to the volume of injected fluid. For simplicity, these fractures are assumed to form a spherically symmetric damage region around the borehole. The predicted volumes of water necessary to create a damage region with a given radius are in good agreement with reported values. The second model is a modification of invasion percolation which was previously introduced to model water flooding. The reservoir rock is represented by a regular lattice of local traps that contain oil and/or gas separated by rock barriers. The barriers are assumed to be highly heterogeneous and are assigned random strengths. Fluid is injected from a central site and the weakest rock barrier breaks allowing fluid to flow into the adjacent site. The process repeats with the weakest barrier breaking and fluid flowing to an adjacent site each time step. Extensive numerical simulations were carried out to obtain statistical properties of the growing fracture network. The network was found to be fractal with fractal dimensions differing slightly from the accepted values for traditional percolation. Additionally, the network follows Horton-Strahler and Tokunaga branching statistics which have been used to characterize river networks. As with other percolation models, the growth of the network occurs in bursts. These bursts follow a power-law size distribution similar to observed microseismic events. Reservoir stress anisotropy is incorporated into the model by assigning horizontal bonds weaker strengths on average than vertical bonds. Numerical simulations show that increasing bond strength anisotropy tends to reduce the fractal dimension of the growing fracture network, and decrease the power-law slope of the burst size distribution. Although simple, these two models are useful for making informed decisions about fracking.

Student beats the teacher: deep neural networks for lateral ventricles segmentation in brain MR

NASA Astrophysics Data System (ADS)

Ghafoorian, Mohsen; Teuwen, Jonas; Manniesing, Rashindra; Leeuw, Frank-Erik d.; van Ginneken, Bram; Karssemeijer, Nico; Platel, Bram

2018-03-01

Ventricular volume and its progression are known to be linked to several brain diseases such as dementia and schizophrenia. Therefore accurate measurement of ventricle volume is vital for longitudinal studies on these disorders, making automated ventricle segmentation algorithms desirable. In the past few years, deep neural networks have shown to outperform the classical models in many imaging domains. However, the success of deep networks is dependent on manually labeled data sets, which are expensive to acquire especially for higher dimensional data in the medical domain. In this work, we show that deep neural networks can be trained on muchcheaper-to-acquire pseudo-labels (e.g., generated by other automated less accurate methods) and still produce more accurate segmentations compared to the quality of the labels. To show this, we use noisy segmentation labels generated by a conventional region growing algorithm to train a deep network for lateral ventricle segmentation. Then on a large manually annotated test set, we show that the network significantly outperforms the conventional region growing algorithm which was used to produce the training labels for the network. Our experiments report a Dice Similarity Coefficient (DSC) of 0.874 for the trained network compared to 0.754 for the conventional region growing algorithm (p < 0.001).

Topology Property and Dynamic Behavior of a Growing Spatial Network

NASA Astrophysics Data System (ADS)

Cao, Xian-Bin; Du, Wen-Bo; Hu, Mao-Bin; Rong, Zhi-Hai; Sun, Peng; Chen, Cai-Long

In this paper, we propose a growing spatial network (GSN) model and investigate its topology properties and dynamical behaviors. The model is generated by adding one node i with m links into a square lattice at each time step and the new node i is connected to the existing nodes with probabilities proportional to: ({kj})α /dij2, where kj is the degree of node j, α is the tunable parameter and dij is the Euclidean distance between i and j. It is found that both the degree heterogeneity and the clustering coefficient monotonously increase with the increment of α, while the average shortest path length monotonously decreases. Moreover, the evolutionary game dynamics and network traffic dynamics are investigated. Simulation results show that the value of α can also greatly influence the dynamic behaviors.

Exploring the patterns and evolution of self-organized urban street networks through modeling

NASA Astrophysics Data System (ADS)

Rui, Yikang; Ban, Yifang; Wang, Jiechen; Haas, Jan

2013-03-01

As one of the most important subsystems in cities, urban street networks have recently been well studied by using the approach of complex networks. This paper proposes a growing model for self-organized urban street networks. The model involves a competition among new centers with different values of attraction radius and a local optimal principle of both geometrical and topological factors. We find that with the model growth, the local optimization in the connection process and appropriate probability for the loop construction well reflect the evolution strategy in real-world cities. Moreover, different values of attraction radius in centers competition process lead to morphological change in patterns including urban network, polycentric and monocentric structures. The model succeeds in reproducing a large diversity of road network patterns by varying parameters. The similarity between the properties of our model and empirical results implies that a simple universal growth mechanism exists in self-organized cities.

Growth and containment of a hierarchical criminal network

NASA Astrophysics Data System (ADS)

Marshak, Charles Z.; Rombach, M. Puck; Bertozzi, Andrea L.; D'Orsogna, Maria R.

2016-02-01

We model the hierarchical evolution of an organized criminal network via antagonistic recruitment and pursuit processes. Within the recruitment phase, a criminal kingpin enlists new members into the network, who in turn seek out other affiliates. New recruits are linked to established criminals according to a probability distribution that depends on the current network structure. At the same time, law enforcement agents attempt to dismantle the growing organization using pursuit strategies that initiate on the lower level nodes and that unfold as self-avoiding random walks. The global details of the organization are unknown to law enforcement, who must explore the hierarchy node by node. We halt the pursuit when certain local criteria of the network are uncovered, encoding if and when an arrest is made; the criminal network is assumed to be eradicated if the kingpin is arrested. We first analyze recruitment and study the large scale properties of the growing network; later we add pursuit and use numerical simulations to study the eradication probability in the case of three pursuit strategies, the time to first eradication, and related costs. Within the context of this model, we find that eradication becomes increasingly costly as the network increases in size and that the optimal way of arresting the kingpin is to intervene at the early stages of network formation. We discuss our results in the context of dark network disruption and their implications on possible law enforcement strategies.

Growth and containment of a hierarchical criminal network.

PubMed

Marshak, Charles Z; Rombach, M Puck; Bertozzi, Andrea L; D'Orsogna, Maria R

2016-02-01

We model the hierarchical evolution of an organized criminal network via antagonistic recruitment and pursuit processes. Within the recruitment phase, a criminal kingpin enlists new members into the network, who in turn seek out other affiliates. New recruits are linked to established criminals according to a probability distribution that depends on the current network structure. At the same time, law enforcement agents attempt to dismantle the growing organization using pursuit strategies that initiate on the lower level nodes and that unfold as self-avoiding random walks. The global details of the organization are unknown to law enforcement, who must explore the hierarchy node by node. We halt the pursuit when certain local criteria of the network are uncovered, encoding if and when an arrest is made; the criminal network is assumed to be eradicated if the kingpin is arrested. We first analyze recruitment and study the large scale properties of the growing network; later we add pursuit and use numerical simulations to study the eradication probability in the case of three pursuit strategies, the time to first eradication, and related costs. Within the context of this model, we find that eradication becomes increasingly costly as the network increases in size and that the optimal way of arresting the kingpin is to intervene at the early stages of network formation. We discuss our results in the context of dark network disruption and their implications on possible law enforcement strategies.

Quantum statistics in complex networks

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra

The Barabasi-Albert (BA) model for a complex network shows a characteristic power law connectivity distribution typical of scale free systems. The Ising model on the BA network shows that the ferromagnetic phase transition temperature depends logarithmically on its size. We have introduced a fitness parameter for the BA network which describes the different abilities of nodes to compete for links. This model predicts the formation of a scale free network where each node increases its connectivity in time as a power-law with an exponent depending on its fitness. This model includes the fact that the node connectivity and growth rate do not depend on the node age alone and it reproduces non trivial correlation properties of the Internet. We have proposed a model of bosonic networks by a generalization of the BA model where the properties of quantum statistics can be applied. We have introduced a fitness eta i = e-bei where the temperature T = 1/ b is determined by the noise in the system and the energy ei accounts for qualitative differences of each node for acquiring links. The results of this work show that a power law network with exponent gamma = 2 can give a Bose condensation where a single node grabs a finite fraction of all the links. In order to address the connection with self-organized processes we have introduced a model for a growing Cayley tree that generalizes the dynamics of invasion percolation. At each node we associate a parameter ei (called energy) such that the probability to grow for each node is given by pii ∝ ebei where T = 1/ b is a statistical parameter of the system determined by the noise called the temperature. This model has been solved analytically with a similar mathematical technique as the bosonic scale-free networks and it shows the self organization of the low energy nodes at the interface. In the thermodynamic limit the Fermi distribution describes the probability of the energy distribution at the interface.

Modeling of contact tracing in social networks

NASA Astrophysics Data System (ADS)

Tsimring, Lev S.; Huerta, Ramón

2003-07-01

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

Software-Enabled Distributed Network Governance: The PopMedNet Experience.

PubMed

Davies, Melanie; Erickson, Kyle; Wyner, Zachary; Malenfant, Jessica; Rosen, Rob; Brown, Jeffrey

2016-01-01

The expanded availability of electronic health information has led to increased interest in distributed health data research networks. The distributed research network model leaves data with and under the control of the data holder. Data holders, network coordinating centers, and researchers have distinct needs and challenges within this model. The concerns of network stakeholders are addressed in the design and governance models of the PopMedNet software platform. PopMedNet features include distributed querying, customizable workflows, and auditing and search capabilities. Its flexible role-based access control system enables the enforcement of varying governance policies. Four case studies describe how PopMedNet is used to enforce network governance models. Trust is an essential component of a distributed research network and must be built before data partners may be willing to participate further. The complexity of the PopMedNet system must be managed as networks grow and new data, analytic methods, and querying approaches are developed. The PopMedNet software platform supports a variety of network structures, governance models, and research activities through customizable features designed to meet the needs of network stakeholders.

Formation of Community-Based Hypertension Practice Networks: Success, Obstacles, and Lessons Learned

PubMed Central

Dart, Richard A.; Egan, Brent M.

2014-01-01

Community-based practice networks for research and improving the quality of care are growing in size and number but have variable success rates. In this paper we review recent efforts to initiate a community-based hypertension network modeled after the successful Outpatient Quality Improvement Network (O’QUIN) project, located at the Medical University of South Carolina. We highlight key lessons learned and new directions to be explored. PMID:24666425

Percolation Theory and Modern Hydraulic Fracturing

NASA Astrophysics Data System (ADS)

Norris, J. Q.; Turcotte, D. L.; Rundle, J. B.

2015-12-01

During the past few years, we have been developing a percolation model for fracking. This model provides a powerful tool for understanding the growth and properties of the complex fracture networks generated during a modern high volume hydraulic fracture stimulations of tight shale reservoirs. The model can also be used to understand the interaction between the growing fracture network and natural reservoir features such as joint sets and faults. Additionally, the model produces a power-law distribution of bursts which can easily be compared to observed microseismicity.

CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS.

PubMed

Shalizi, Cosma Rohilla; Rinaldo, Alessandro

2013-04-01

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the data consists only of a sampled sub-network. Parameters for the whole network, which is what is of interest, are estimated by applying the model to the sub-network. This assumes that the model is consistent under sampling , or, in terms of the theory of stochastic processes, that it defines a projective family. Focusing on the popular class of exponential random graph models (ERGMs), we show that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM's expressive power. These results are actually special cases of more general results about exponential families of dependent random variables, which we also prove. Using such results, we offer easily checked conditions for the consistency of maximum likelihood estimation in ERGMs, and discuss some possible constructive responses.

CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS

PubMed Central

Shalizi, Cosma Rohilla; Rinaldo, Alessandro

2015-01-01

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the data consists only of a sampled sub-network. Parameters for the whole network, which is what is of interest, are estimated by applying the model to the sub-network. This assumes that the model is consistent under sampling, or, in terms of the theory of stochastic processes, that it defines a projective family. Focusing on the popular class of exponential random graph models (ERGMs), we show that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM’s expressive power. These results are actually special cases of more general results about exponential families of dependent random variables, which we also prove. Using such results, we offer easily checked conditions for the consistency of maximum likelihood estimation in ERGMs, and discuss some possible constructive responses. PMID:26166910

A network-based approach for semi-quantitative knowledge mining and its application to yield variability

NASA Astrophysics Data System (ADS)

Schauberger, Bernhard; Rolinski, Susanne; Müller, Christoph

2016-12-01

Variability of crop yields is detrimental for food security. Under climate change its amplitude is likely to increase, thus it is essential to understand the underlying causes and mechanisms. Crop models are the primary tool to project future changes in crop yields under climate change. A systematic overview of drivers and mechanisms of crop yield variability (YV) can thus inform crop model development and facilitate improved understanding of climate change impacts on crop yields. Yet there is a vast body of literature on crop physiology and YV, which makes a prioritization of mechanisms for implementation in models challenging. Therefore this paper takes on a novel approach to systematically mine and organize existing knowledge from the literature. The aim is to identify important mechanisms lacking in models, which can help to set priorities in model improvement. We structure knowledge from the literature in a semi-quantitative network. This network consists of complex interactions between growing conditions, plant physiology and crop yield. We utilize the resulting network structure to assign relative importance to causes of YV and related plant physiological processes. As expected, our findings confirm existing knowledge, in particular on the dominant role of temperature and precipitation, but also highlight other important drivers of YV. More importantly, our method allows for identifying the relevant physiological processes that transmit variability in growing conditions to variability in yield. We can identify explicit targets for the improvement of crop models. The network can additionally guide model development by outlining complex interactions between processes and by easily retrieving quantitative information for each of the 350 interactions. We show the validity of our network method as a structured, consistent and scalable dictionary of literature. The method can easily be applied to many other research fields.

Interfacing 3D Engineered Neuronal Cultures to Micro-Electrode Arrays: An Innovative In Vitro Experimental Model.

PubMed

Tedesco, Mariateresa; Frega, Monica; Martinoia, Sergio; Pesce, Mattia; Massobrio, Paolo

2015-10-18

Currently, large-scale networks derived from dissociated neurons growing and developing in vitro on extracellular micro-transducer devices are the gold-standard experimental model to study basic neurophysiological mechanisms involved in the formation and maintenance of neuronal cell assemblies. However, in vitro studies have been limited to the recording of the electrophysiological activity generated by bi-dimensional (2D) neural networks. Nonetheless, given the intricate relationship between structure and dynamics, a significant improvement is necessary to investigate the formation and the developing dynamics of three-dimensional (3D) networks. In this work, a novel experimental platform in which 3D hippocampal or cortical networks are coupled to planar Micro-Electrode Arrays (MEAs) is presented. 3D networks are realized by seeding neurons in a scaffold constituted of glass microbeads (30-40 µm in diameter) on which neurons are able to grow and form complex interconnected 3D assemblies. In this way, it is possible to design engineered 3D networks made up of 5-8 layers with an expected final cell density. The increasing complexity in the morphological organization of the 3D assembly induces an enhancement of the electrophysiological patterns displayed by this type of networks. Compared with the standard 2D networks, where highly stereotyped bursting activity emerges, the 3D structure alters the bursting activity in terms of duration and frequency, as well as it allows observation of more random spiking activity. In this sense, the developed 3D model more closely resembles in vivo neural networks.

Interfacing 3D Engineered Neuronal Cultures to Micro-Electrode Arrays: An Innovative In Vitro Experimental Model

PubMed Central

Tedesco, Mariateresa; Frega, Monica; Martinoia, Sergio; Pesce, Mattia; Massobrio, Paolo

2015-01-01

Currently, large-scale networks derived from dissociated neurons growing and developing in vitro on extracellular micro-transducer devices are the gold-standard experimental model to study basic neurophysiological mechanisms involved in the formation and maintenance of neuronal cell assemblies. However, in vitro studies have been limited to the recording of the electrophysiological activity generated by bi-dimensional (2D) neural networks. Nonetheless, given the intricate relationship between structure and dynamics, a significant improvement is necessary to investigate the formation and the developing dynamics of three-dimensional (3D) networks. In this work, a novel experimental platform in which 3D hippocampal or cortical networks are coupled to planar Micro-Electrode Arrays (MEAs) is presented. 3D networks are realized by seeding neurons in a scaffold constituted of glass microbeads (30-40 µm in diameter) on which neurons are able to grow and form complex interconnected 3D assemblies. In this way, it is possible to design engineered 3D networks made up of 5-8 layers with an expected final cell density. The increasing complexity in the morphological organization of the 3D assembly induces an enhancement of the electrophysiological patterns displayed by this type of networks. Compared with the standard 2D networks, where highly stereotyped bursting activity emerges, the 3D structure alters the bursting activity in terms of duration and frequency, as well as it allows observation of more random spiking activity. In this sense, the developed 3D model more closely resembles in vivo neural networks. PMID:26554533

Interconnected growing self-organizing maps for auditory and semantic acquisition modeling.

PubMed

Cao, Mengxue; Li, Aijun; Fang, Qiang; Kaufmann, Emily; Kröger, Bernd J

2014-01-01

Based on the incremental nature of knowledge acquisition, in this study we propose a growing self-organizing neural network approach for modeling the acquisition of auditory and semantic categories. We introduce an Interconnected Growing Self-Organizing Maps (I-GSOM) algorithm, which takes associations between auditory information and semantic information into consideration, in this paper. Direct phonetic-semantic association is simulated in order to model the language acquisition in early phases, such as the babbling and imitation stages, in which no phonological representations exist. Based on the I-GSOM algorithm, we conducted experiments using paired acoustic and semantic training data. We use a cyclical reinforcing and reviewing training procedure to model the teaching and learning process between children and their communication partners. A reinforcing-by-link training procedure and a link-forgetting procedure are introduced to model the acquisition of associative relations between auditory and semantic information. Experimental results indicate that (1) I-GSOM has good ability to learn auditory and semantic categories presented within the training data; (2) clear auditory and semantic boundaries can be found in the network representation; (3) cyclical reinforcing and reviewing training leads to a detailed categorization as well as to a detailed clustering, while keeping the clusters that have already been learned and the network structure that has already been developed stable; and (4) reinforcing-by-link training leads to well-perceived auditory-semantic associations. Our I-GSOM model suggests that it is important to associate auditory information with semantic information during language acquisition. Despite its high level of abstraction, our I-GSOM approach can be interpreted as a biologically-inspired neurocomputational model.

A Case Study of the Implementation of Social Models of Teaching in E-Learning: "The Social Networks in Education", Online Course of the Inter-Orthodox Centre of the Church of Greece

ERIC Educational Resources Information Center

Komninou, Ioanna

2018-01-01

The development of e-learning has caused a growing interest in learning models that may have the best results. We believe that it is good practice to implement social learning models in the field of online education. In this case, the implementation of complex instruction in online training courses for teachers, on "Social Networks in…

A Complex Network Approach to Distributional Semantic Models

PubMed Central

Utsumi, Akira

2015-01-01

A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models. PMID:26295940

Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity

NASA Astrophysics Data System (ADS)

Zhou, Tao; Liu, Jian-Guo; Bai, Wen-Jie; Chen, Guanrong; Wang, Bing-Hong

2006-11-01

In this paper, we propose a susceptible-infected model with identical infectivity, in which, at every time step, each node can only contact a constant number of neighbors. We implemented this model on scale-free networks, and found that the infected population grows in an exponential form with the time scale proportional to the spreading rate. Furthermore, by numerical simulation, we demonstrated that the targeted immunization of the present model is much less efficient than that of the standard susceptible-infected model. Finally, we investigate a fast spreading strategy when only local information is available. Different from the extensively studied path-finding strategy, the strategy preferring small-degree nodes is more efficient than that preferring large-degree nodes. Our results indicate the existence of an essential relationship between network traffic and network epidemic on scale-free networks.

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

Formation of community-based hypertension practice networks: success, obstacles, and lessons learned.

PubMed

Dart, Richard A; Egan, Brent M

2014-06-01

Community-based practice networks for research and improving the quality of care are growing in size and number but have variable success rates. In this paper, the authors review recent efforts to initiate a community-based hypertension network modeled after the successful Outpatient Quality Improvement Network (O'QUIN) project, located at the Medical University of South Carolina. Key lessons learned and new directions to be explored are highlighted. ©2014 Wiley Periodicals, Inc.

Growing multiplex networks with arbitrary number of layers

NASA Astrophysics Data System (ADS)

Momeni, Naghmeh; Fotouhi, Babak

2015-12-01

This paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers and are confined to the special case of homogeneous growth and are limited to the state state (that is, the limit of infinite size). In the present paper, we first obtain closed-form solutions for the joint degree distribution of heterogeneously growing multiplex networks with arbitrary number of layers in the steady state. Heterogeneous growth means that each incoming node establishes different numbers of links in different layers. We consider both uniform and preferential growth. We then extend the analysis of the uniform growth mechanism to arbitrary times. We obtain a closed-form solution for the time-dependent joint degree distribution of a growing multiplex network with arbitrary initial conditions. Throughout, theoretical findings are corroborated with Monte Carlo simulations. The results shed light on the effects of the initial network on the transient dynamics of growing multiplex networks and takes a step towards characterizing the temporal variations of the connectivity of growing multiplex networks, as well as predicting their future structural properties.

Research on TCP/IP network communication based on Node.js

NASA Astrophysics Data System (ADS)

Huang, Jing; Cai, Lixiong

2018-04-01

In the face of big data, long connection and high synchronization, TCP/IP network communication will cause performance bottlenecks due to its blocking multi-threading service model. This paper presents a method of TCP/IP network communication protocol based on Node.js. On the basis of analyzing the characteristics of Node.js architecture and asynchronous non-blocking I/O model, the principle of its efficiency is discussed, and then compare and analyze the network communication model of TCP/IP protocol to expound the reasons why TCP/IP protocol stack is widely used in network communication. Finally, according to the large data and high concurrency in the large-scale grape growing environment monitoring process, a TCP server design based on Node.js is completed. The results show that the example runs stably and efficiently.

Flow Correlated Percolation during Vascular Remodeling in Growing Tumors

NASA Astrophysics Data System (ADS)

Lee, D.-S.; Rieger, H.; Bartha, K.

2006-02-01

A theoretical model based on the molecular interactions between a growing tumor and a dynamically evolving blood vessel network describes the transformation of the regular vasculature in normal tissues into a highly inhomogeneous tumor specific capillary network. The emerging morphology, characterized by the compartmentalization of the tumor into several regions differing in vessel density, diameter, and necrosis, is in accordance with experimental data for human melanoma. Vessel collapse due to a combination of severely reduced blood flow and solid stress exerted by the tumor leads to a correlated percolation process that is driven towards criticality by the mechanism of hydrodynamic vessel stabilization.

Modification Propagation in Complex Networks

NASA Astrophysics Data System (ADS)

Mouronte, Mary Luz; Vargas, María Luisa; Moyano, Luis Gregorio; Algarra, Francisco Javier García; Del Pozo, Luis Salvador

To keep up with rapidly changing conditions, business systems and their associated networks are growing increasingly intricate as never before. By doing this, network management and operation costs not only rise, but are difficult even to measure. This fact must be regarded as a major constraint to system optimization initiatives, as well as a setback to derived economic benefits. In this work we introduce a simple model in order to estimate the relative cost associated to modification propagation in complex architectures. Our model can be used to anticipate costs caused by network evolution, as well as for planning and evaluating future architecture development while providing benefit optimization.

How networks split when rival leaders emerge

NASA Astrophysics Data System (ADS)

Krawczyk, Malgorzata J.; Kułakowski, Krzysztof

2018-02-01

In a model social network, two hubs are appointed as leaders. Consecutive cutting of links on a shortest path between them splits the network in two. Next, the network is growing again till the initial size. Both processes are cyclically repeated. We investigate the size of a cluster containing the largest hub, the degree, the clustering coefficient, the closeness centrality and the betweenness centrality of the largest hub, as dependent on the number of cycles. The results are interpreted in terms of the leader's benefits from conflicts.

Interconnected growing self-organizing maps for auditory and semantic acquisition modeling

PubMed Central

Cao, Mengxue; Li, Aijun; Fang, Qiang; Kaufmann, Emily; Kröger, Bernd J.

2014-01-01

Based on the incremental nature of knowledge acquisition, in this study we propose a growing self-organizing neural network approach for modeling the acquisition of auditory and semantic categories. We introduce an Interconnected Growing Self-Organizing Maps (I-GSOM) algorithm, which takes associations between auditory information and semantic information into consideration, in this paper. Direct phonetic–semantic association is simulated in order to model the language acquisition in early phases, such as the babbling and imitation stages, in which no phonological representations exist. Based on the I-GSOM algorithm, we conducted experiments using paired acoustic and semantic training data. We use a cyclical reinforcing and reviewing training procedure to model the teaching and learning process between children and their communication partners. A reinforcing-by-link training procedure and a link-forgetting procedure are introduced to model the acquisition of associative relations between auditory and semantic information. Experimental results indicate that (1) I-GSOM has good ability to learn auditory and semantic categories presented within the training data; (2) clear auditory and semantic boundaries can be found in the network representation; (3) cyclical reinforcing and reviewing training leads to a detailed categorization as well as to a detailed clustering, while keeping the clusters that have already been learned and the network structure that has already been developed stable; and (4) reinforcing-by-link training leads to well-perceived auditory–semantic associations. Our I-GSOM model suggests that it is important to associate auditory information with semantic information during language acquisition. Despite its high level of abstraction, our I-GSOM approach can be interpreted as a biologically-inspired neurocomputational model. PMID:24688478

Research Note: The consequences of different methods for handling missing network data in Stochastic Actor Based Models

PubMed Central

Hipp, John R.; Wang, Cheng; Butts, Carter T.; Jose, Rupa; Lakon, Cynthia M.

2015-01-01

Although stochastic actor based models (e.g., as implemented in the SIENA software program) are growing in popularity as a technique for estimating longitudinal network data, a relatively understudied issue is the consequence of missing network data for longitudinal analysis. We explore this issue in our research note by utilizing data from four schools in an existing dataset (the AddHealth dataset) over three time points, assessing the substantive consequences of using four different strategies for addressing missing network data. The results indicate that whereas some measures in such models are estimated relatively robustly regardless of the strategy chosen for addressing missing network data, some of the substantive conclusions will differ based on the missing data strategy chosen. These results have important implications for this burgeoning applied research area, implying that researchers should more carefully consider how they address missing data when estimating such models. PMID:25745276

Research Note: The consequences of different methods for handling missing network data in Stochastic Actor Based Models.

PubMed

Hipp, John R; Wang, Cheng; Butts, Carter T; Jose, Rupa; Lakon, Cynthia M

2015-05-01

Although stochastic actor based models (e.g., as implemented in the SIENA software program) are growing in popularity as a technique for estimating longitudinal network data, a relatively understudied issue is the consequence of missing network data for longitudinal analysis. We explore this issue in our research note by utilizing data from four schools in an existing dataset (the AddHealth dataset) over three time points, assessing the substantive consequences of using four different strategies for addressing missing network data. The results indicate that whereas some measures in such models are estimated relatively robustly regardless of the strategy chosen for addressing missing network data, some of the substantive conclusions will differ based on the missing data strategy chosen. These results have important implications for this burgeoning applied research area, implying that researchers should more carefully consider how they address missing data when estimating such models.

Generative models for network neuroscience: prospects and promise

PubMed Central

Betzel, Richard F.

2017-01-01

Network neuroscience is the emerging discipline concerned with investigating the complex patterns of interconnections found in neural systems, and identifying principles with which to understand them. Within this discipline, one particularly powerful approach is network generative modelling, in which wiring rules are algorithmically implemented to produce synthetic network architectures with the same properties as observed in empirical network data. Successful models can highlight the principles by which a network is organized and potentially uncover the mechanisms by which it grows and develops. Here, we review the prospects and promise of generative models for network neuroscience. We begin with a primer on network generative models, with a discussion of compressibility and predictability, and utility in intuiting mechanisms, followed by a short history on their use in network science, broadly. We then discuss generative models in practice and application, paying particular attention to the critical need for cross-validation. Next, we review generative models of biological neural networks, both at the cellular and large-scale level, and across a variety of species including Caenorhabditis elegans, Drosophila, mouse, rat, cat, macaque and human. We offer a careful treatment of a few relevant distinctions, including differences between generative models and null models, sufficiency and redundancy, inferring and claiming mechanism, and functional and structural connectivity. We close with a discussion of future directions, outlining exciting frontiers both in empirical data collection efforts as well as in method and theory development that, together, further the utility of the generative network modelling approach for network neuroscience. PMID:29187640

Statistical Mechanics of Temporal and Interacting Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun

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

Structure Shift of GaN Among Nanowall Network, Nanocolumn, and Compact Film Grown on Si (111) by MBE.

PubMed

Zhong, Aihua; Fan, Ping; Zhong, Yuanting; Zhang, Dongping; Li, Fu; Luo, Jingting; Xie, Yizhu; Hane, Kazuhiro

2018-02-13

Structure shift of GaN nanowall network, nanocolumn, and compact film were successfully obtained on Si (111) by plasma-assisted molecular beam epitaxy (MBE). As is expected, growth of the GaN nanocolumns was observed in N-rich condition on bare Si, and the growth shifted to compact film when the Ga flux was improved. Interestingly, if an aluminum (Al) pre-deposition for 40 s was carried out prior to the GaN growth, GaN grows in the form of the nanowall network. Results show that the pre-deposited Al exits in the form of droplets with typical diameter and height of ~ 80 and ~ 6.7 nm, respectively. A growth model for the nanowall network is proposed and the growth mechanism is discussed. GaN grows in the area without Al droplets while the growth above Al droplets is hindered, resulting in the formation of continuous GaN nanowall network that removes the obstacles of nano-device fabrication.

Structure Shift of GaN Among Nanowall Network, Nanocolumn, and Compact Film Grown on Si (111) by MBE

NASA Astrophysics Data System (ADS)

Zhong, Aihua; Fan, Ping; Zhong, Yuanting; Zhang, Dongping; Li, Fu; Luo, Jingting; Xie, Yizhu; Hane, Kazuhiro

2018-02-01

Structure shift of GaN nanowall network, nanocolumn, and compact film were successfully obtained on Si (111) by plasma-assisted molecular beam epitaxy (MBE). As is expected, growth of the GaN nanocolumns was observed in N-rich condition on bare Si, and the growth shifted to compact film when the Ga flux was improved. Interestingly, if an aluminum (Al) pre-deposition for 40 s was carried out prior to the GaN growth, GaN grows in the form of the nanowall network. Results show that the pre-deposited Al exits in the form of droplets with typical diameter and height of 80 and 6.7 nm, respectively. A growth model for the nanowall network is proposed and the growth mechanism is discussed. GaN grows in the area without Al droplets while the growth above Al droplets is hindered, resulting in the formation of continuous GaN nanowall network that removes the obstacles of nano-device fabrication.

Stochastic Dynamical Model of a Growing Citation Network Based on a Self-Exciting Point Process

NASA Astrophysics Data System (ADS)

Golosovsky, Michael; Solomon, Sorin

2012-08-01

We put under experimental scrutiny the preferential attachment model that is commonly accepted as a generating mechanism of the scale-free complex networks. To this end we chose a citation network of physics papers and traced the citation history of 40 195 papers published in one year. Contrary to common belief, we find that the citation dynamics of the individual papers follows the superlinear preferential attachment, with the exponent α=1.25-1.3. Moreover, we show that the citation process cannot be described as a memoryless Markov chain since there is a substantial correlation between the present and recent citation rates of a paper. Based on our findings we construct a stochastic growth model of the citation network, perform numerical simulations based on this model and achieve an excellent agreement with the measured citation distributions.

Complex network view of evolving manifolds

NASA Astrophysics Data System (ADS)

da Silva, Diamantino C.; Bianconi, Ginestra; da Costa, Rui A.; Dorogovtsev, Sergey N.; Mendes, José F. F.

2018-03-01

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by the condition that at each step, all the faces must be triangles. Stochastic application of these operations leads to random networks with different architectures. We perform extensive numerical simulations and explore the geometries of growing and equilibrium complex networks generated by these transformations and their local structural properties. This characterization includes the Hausdorff and spectral dimensions of the resulting networks, their degree distributions, and various structural correlations. Our results reveal a rich zoo of architectures and geometries of these networks, some of which appear to be small worlds while others are finite dimensional with Hausdorff dimension equal or higher than the original dimensionality of their simplices. The range of spectral dimensions of the evolving triangulations turns out to be from about 1.4 to infinity. Our models include simplicial complexes representing manifolds with evolving topologies, for example, an h -holed torus with a progressively growing number of holes. This evolving graph demonstrates features of a small-world network and has a particularly heavy-tailed degree distribution.

Sampling from complex networks using distributed learning automata

NASA Astrophysics Data System (ADS)

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

2014-02-01

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

A fractal growth model: Exploring the connection pattern of hubs in complex networks

NASA Astrophysics Data System (ADS)

Li, Dongyan; Wang, Xingyuan; Huang, Penghe

2017-04-01

Fractal is ubiquitous in many real-world networks. Previous researches showed that the strong disassortativity between the hub-nodes on all length scales was the key principle that gave rise to the fractal architecture of networks. Although fractal property emerged in some models, there were few researches about the fractal growth model and quantitative analyses about the strength of the disassortativity for fractal model. In this paper, we proposed a novel inverse renormalization method, named Box-based Preferential Attachment (BPA), to build the fractal growth models in which the Preferential Attachment was performed at box level. The proposed models provided a new framework that demonstrated small-world-fractal transition. Also, we firstly demonstrated the statistical characteristic of connection patterns of the hubs in fractal networks. The experimental results showed that, given proper growing scale and added edges, the proposed models could clearly show pure small-world or pure fractal or both of them. It also showed that the hub connection ratio showed normal distribution in many real-world networks. At last, the comparisons of connection pattern between the proposed models and the biological and technical networks were performed. The results gave useful reference for exploring the growth principle and for modeling the connection patterns for real-world networks.

Transport link scanner: simulating geographic transport network expansion through individual investments

NASA Astrophysics Data System (ADS)

Jacobs-Crisioni, C.; Koopmans, C. C.

2016-07-01

This paper introduces a GIS-based model that simulates the geographic expansion of transport networks by several decision-makers with varying objectives. The model progressively adds extensions to a growing network by choosing the most attractive investments from a limited choice set. Attractiveness is defined as a function of variables in which revenue and broader societal benefits may play a role and can be based on empirically underpinned parameters that may differ according to private or public interests. The choice set is selected from an exhaustive set of links and presumably contains those investment options that best meet private operator's objectives by balancing the revenues of additional fare against construction costs. The investment options consist of geographically plausible routes with potential detours. These routes are generated using a fine-meshed regularly latticed network and shortest path finding methods. Additionally, two indicators of the geographic accuracy of the simulated networks are introduced. A historical case study is presented to demonstrate the model's first results. These results show that the modelled networks reproduce relevant results of the historically built network with reasonable accuracy.

Developing a Framework for Effective Network Capacity Planning

NASA Technical Reports Server (NTRS)

Yaprak, Ece

2005-01-01

As Internet traffic continues to grow exponentially, developing a clearer understanding of, and appropriately measuring, network's performance is becoming ever more critical. An important challenge faced by the Information Resources Directorate (IRD) at the Johnson Space Center in this context remains not only monitoring and maintaining a secure network, but also better understanding the capacity and future growth potential boundaries of its network. This requires capacity planning which involves modeling and simulating different network alternatives, and incorporating changes in design as technologies, components, configurations, and applications change, to determine optimal solutions in light of IRD's goals, objectives and strategies. My primary task this summer was to address this need. I evaluated network-modeling tools from OPNET Technologies Inc. and Compuware Corporation. I generated a baseline model for Building 45 using both tools by importing "real" topology/traffic information using IRD's various network management tools. I compared each tool against the other in terms of the advantages and disadvantages of both tools to accomplish IRD's goals. I also prepared step-by-step "how to design a baseline model" tutorial for both OPNET and Compuware products.

Balancing building and maintenance costs in growing transport networks

NASA Astrophysics Data System (ADS)

Bottinelli, Arianna; Louf, Rémi; Gherardi, Marco

2017-09-01

The costs associated to the length of links impose unavoidable constraints to the growth of natural and artificial transport networks. When future network developments cannot be predicted, the costs of building and maintaining connections cannot be minimized simultaneously, requiring competing optimization mechanisms. Here, we study a one-parameter nonequilibrium model driven by an optimization functional, defined as the convex combination of building cost and maintenance cost. By varying the coefficient of the combination, the model interpolates between global and local length minimization, i.e., between minimum spanning trees and a local version known as dynamical minimum spanning trees. We show that cost balance within this ensemble of dynamical networks is a sufficient ingredient for the emergence of tradeoffs between the network's total length and transport efficiency, and of optimal strategies of construction. At the transition between two qualitatively different regimes, the dynamics builds up power-law distributed waiting times between global rearrangements, indicating a point of nonoptimality. Finally, we use our model as a framework to analyze empirical ant trail networks, showing its relevance as a null model for cost-constrained network formation.

A Cyber Situational Awareness Model for Network Administrators

DTIC Science & Technology

2017-03-01

environments, the Internet of Things, artificial intelligence , and so on. As users’ data requirements grow more complex, they demand information...security of systems of interest. Further, artificial intelligence is a powerful concept in information technology. Therefore, new research should...look into how to use artificial intelligence to develop CSA. Human interaction with cyber systems is not making networks and their components safer

Spatial statistical network models for stream and river temperature in New England, USA

EPA Science Inventory

Watershed managers are challenged by the need for predictive temperature models with sufficient accuracy and geographic breadth for practical use. We described thermal regimes of New England rivers and streams based on a reduced set of metrics for the May–September growing ...

Neuronal network models of epileptogenesis

PubMed Central

Abdullahi, Aminu T.; Adamu, Lawan H.

2017-01-01

Epilepsy is a chronic neurological condition, following some trigger, transforming a normal brain to one that produces recurrent unprovoked seizures. In the search for the mechanisms that best explain the epileptogenic process, there is a growing body of evidence suggesting that the epilepsies are network level disorders. In this review, we briefly describe the concept of neuronal networks and highlight 2 methods used to analyse such networks. The first method, graph theory, is used to describe general characteristics of a network to facilitate comparison between normal and abnormal networks. The second, dynamic causal modelling, is useful in the analysis of the pathways of seizure spread. We concluded that the end results of the epileptogenic process are best understood as abnormalities of neuronal circuitry and not simply as molecular or cellular abnormalities. The network approach promises to generate new understanding and more targeted treatment of epilepsy. PMID:28416779

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

PubMed

Laghari, Samreen; Niazi, Muaz A

2016-01-01

Computer Networks have a tendency to grow at an unprecedented scale. Modern networks involve not only computers but also a wide variety of other interconnected devices ranging from mobile phones to other household items fitted with sensors. This vision of the "Internet of Things" (IoT) implies an inherent difficulty in modeling problems. It is practically impossible to implement and test all scenarios for large-scale and complex adaptive communication networks as part of Complex Adaptive Communication Networks and Environments (CACOONS). The goal of this study is to explore the use of Agent-based Modeling as part of the Cognitive Agent-based Computing (CABC) framework to model a Complex communication network problem. We use Exploratory Agent-based Modeling (EABM), as part of the CABC framework, to develop an autonomous multi-agent architecture for managing carbon footprint in a corporate network. To evaluate the application of complexity in practical scenarios, we have also introduced a company-defined computer usage policy. The conducted experiments demonstrated two important results: Primarily CABC-based modeling approach such as using Agent-based Modeling can be an effective approach to modeling complex problems in the domain of IoT. Secondly, the specific problem of managing the Carbon footprint can be solved using a multiagent system approach.

Social network models predict movement and connectivity in ecological landscapes

USGS Publications Warehouse

Fletcher, R.J.; Acevedo, M.A.; Reichert, Brian E.; Pias, Kyle E.; Kitchens, W.M.

2011-01-01

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Developing Countries Vaccine Manufacturers Network: doing good by making high-quality vaccines affordable for all.

PubMed

Pagliusi, Sonia; Leite, Luciana C C; Datla, Mahima; Makhoana, Morena; Gao, Yongzhong; Suhardono, Mahendra; Jadhav, Suresh; Harshavardhan, Gutla V J A; Homma, Akira

2013-04-18

The Developing Countries Vaccine Manufacturers Network (DCVMN) is a unique model of a public and private international alliance. It assembles governmental and private organizations to work toward a common goal of manufacturing and supplying high-quality vaccines at affordable prices to protect people around the world from known and emerging infectious diseases. Together, this group of manufacturers has decades of experience in manufacturing vaccines, with technologies, know-how, and capacity to produce more than 40 vaccines types. These manufacturers have already contributed more than 30 vaccines in various presentations that have been prequalified by the World Health Organization for use by global immunization programmes. Furthermore, more than 45 vaccines are in the pipeline. Recent areas of focus include vaccines to protect against rotavirus, human papillomavirus (HPV), Japanese encephalitis, meningitis, hepatitis E, poliovirus, influenza, and pertussis, as well as combined pentavalent vaccines for children. The network has a growing number of manufacturers that produce a growing number of products to supply the growing demand for vaccines in developing countries. Copyright © 2013. Published by Elsevier Ltd.

Coupled disease-behavior dynamics on complex networks: A review

NASA Astrophysics Data System (ADS)

Wang, Zhen; Andrews, Michael A.; Wu, Zhi-Xi; Wang, Lin; Bauch, Chris T.

2015-12-01

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years.

Using Neural Networks to Improve the Performance of Radiative Transfer Modeling Used for Geometry Dependent LER Calculations

NASA Astrophysics Data System (ADS)

Fasnacht, Z.; Qin, W.; Haffner, D. P.; Loyola, D. G.; Joiner, J.; Krotkov, N. A.; Vasilkov, A. P.; Spurr, R. J. D.

2017-12-01

In order to estimate surface reflectance used in trace gas retrieval algorithms, radiative transfer models (RTM) such as the Vector Linearized Discrete Ordinate Radiative Transfer Model (VLIDORT) can be used to simulate the top of the atmosphere (TOA) radiances with advanced models of surface properties. With large volumes of satellite data, these model simulations can become computationally expensive. Look up table interpolation can improve the computational cost of the calculations, but the non-linear nature of the radiances requires a dense node structure if interpolation errors are to be minimized. In order to reduce our computational effort and improve the performance of look-up tables, neural networks can be trained to predict these radiances. We investigate the impact of using look-up table interpolation versus a neural network trained using the smart sampling technique, and show that neural networks can speed up calculations and reduce errors while using significantly less memory and RTM calls. In future work we will implement a neural network in operational processing to meet growing demands for reflectance modeling in support of high spatial resolution satellite missions.

Complex growing networks with intrinsic vertex fitness

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

Bedogne, C.; Rodgers, G. J.

2006-10-15

One of the major questions in complex network research is to identify the range of mechanisms by which a complex network can self organize into a scale-free state. In this paper we investigate the interplay between a fitness linking mechanism and both random and preferential attachment. In our models, each vertex is assigned a fitness x, drawn from a probability distribution {rho}(x). In Model A, at each time step a vertex is added and joined to an existing vertex, selected at random, with probability p and an edge is introduced between vertices with fitnesses x and y, with a ratemore » f(x,y), with probability 1-p. Model B differs from Model A in that, with probability p, edges are added with preferential attachment rather than randomly. The analysis of Model A shows that, for every fixed fitness x, the network's degree distribution decays exponentially. In Model B we recover instead a power-law degree distribution whose exponent depends only on p, and we show how this result can be generalized. The properties of a number of particular networks are examined.« less

Effect of node attributes on the temporal dynamics of network structure

NASA Astrophysics Data System (ADS)

Momeni, Naghmeh; Fotouhi, Babak

2017-03-01

Many natural and social networks evolve in time and their structures are dynamic. In most networks, nodes are heterogeneous, and their roles in the evolution of structure differ. This paper focuses on the role of individual attributes on the temporal dynamics of network structure. We focus on a basic model for growing networks that incorporates node attributes (which we call "quality"), and we focus on the problem of forecasting the structural properties of the network in arbitrary times for an arbitrary initial network. That is, we address the following question: If we are given a certain initial network with given arbitrary structure and known node attributes, then how does the structure change in time as new nodes with given distribution of attributes join the network? We solve the model analytically and obtain the quality-degree joint distribution and degree correlations. We characterize the role of individual attributes in the position of individual nodes in the hierarchy of connections. We confirm the theoretical findings with Monte Carlo simulations.

Verification of satellite radar remote sensing based estimates of boreal and subalpine growing seasons using an ecosystem process model and surface biophysical measurement network information

NASA Technical Reports Server (NTRS)

McDonald, K. C.; Kimball, J. S.; Zimmerman, R.

2002-01-01

We employ daily surface Radar backscatter data from the SeaWinds Ku-band Scatterometer onboard Quikscat to estimate landscape freeze-thaw state and associated length of the seasonal non-frozen period as a surrogate for determining the annual growing season across boreal and subalpine regions of North America for 2000 and 2001.

Toward automatic time-series forecasting using neural networks.

PubMed

Yan, Weizhong

2012-07-01

Over the past few decades, application of artificial neural networks (ANN) to time-series forecasting (TSF) has been growing rapidly due to several unique features of ANN models. However, to date, a consistent ANN performance over different studies has not been achieved. Many factors contribute to the inconsistency in the performance of neural network models. One such factor is that ANN modeling involves determining a large number of design parameters, and the current design practice is essentially heuristic and ad hoc, this does not exploit the full potential of neural networks. Systematic ANN modeling processes and strategies for TSF are, therefore, greatly needed. Motivated by this need, this paper attempts to develop an automatic ANN modeling scheme. It is based on the generalized regression neural network (GRNN), a special type of neural network. By taking advantage of several GRNN properties (i.e., a single design parameter and fast learning) and by incorporating several design strategies (e.g., fusing multiple GRNNs), we have been able to make the proposed modeling scheme to be effective for modeling large-scale business time series. The initial model was entered into the NN3 time-series competition. It was awarded the best prediction on the reduced dataset among approximately 60 different models submitted by scholars worldwide.

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.

Self-organizing radial basis function networks for adaptive flight control and aircraft engine state estimation

NASA Astrophysics Data System (ADS)

Shankar, Praveen

The performance of nonlinear control algorithms such as feedback linearization and dynamic inversion is heavily dependent on the fidelity of the dynamic model being inverted. Incomplete or incorrect knowledge of the dynamics results in reduced performance and may lead to instability. Augmenting the baseline controller with approximators which utilize a parametrization structure that is adapted online reduces the effect of this error between the design model and actual dynamics. However, currently existing parameterizations employ a fixed set of basis functions that do not guarantee arbitrary tracking error performance. To address this problem, we develop a self-organizing parametrization structure that is proven to be stable and can guarantee arbitrary tracking error performance. The training algorithm to grow the network and adapt the parameters is derived from Lyapunov theory. In addition to growing the network of basis functions, a pruning strategy is incorporated to keep the size of the network as small as possible. This algorithm is implemented on a high performance flight vehicle such as F-15 military aircraft. The baseline dynamic inversion controller is augmented with a Self-Organizing Radial Basis Function Network (SORBFN) to minimize the effect of the inversion error which may occur due to imperfect modeling, approximate inversion or sudden changes in aircraft dynamics. The dynamic inversion controller is simulated for different situations including control surface failures, modeling errors and external disturbances with and without the adaptive network. A performance measure of maximum tracking error is specified for both the controllers a priori. Excellent tracking error minimization to a pre-specified level using the adaptive approximation based controller was achieved while the baseline dynamic inversion controller failed to meet this performance specification. The performance of the SORBFN based controller is also compared to a fixed RBF network based adaptive controller. While the fixed RBF network based controller which is tuned to compensate for control surface failures fails to achieve the same performance under modeling uncertainty and disturbances, the SORBFN is able to achieve good tracking convergence under all error conditions.

Network dynamics of 3D engineered neuronal cultures: a new experimental model for in-vitro electrophysiology.

PubMed

Frega, Monica; Tedesco, Mariateresa; Massobrio, Paolo; Pesce, Mattia; Martinoia, Sergio

2014-06-30

Despite the extensive use of in-vitro models for neuroscientific investigations and notwithstanding the growing field of network electrophysiology, all studies on cultured cells devoted to elucidate neurophysiological mechanisms and computational properties, are based on 2D neuronal networks. These networks are usually grown onto specific rigid substrates (also with embedded electrodes) and lack of most of the constituents of the in-vivo like environment: cell morphology, cell-to-cell interaction and neuritic outgrowth in all directions. Cells in a brain region develop in a 3D space and interact with a complex multi-cellular environment and extracellular matrix. Under this perspective, 3D networks coupled to micro-transducer arrays, represent a new and powerful in-vitro model capable of better emulating in-vivo physiology. In this work, we present a new experimental paradigm constituted by 3D hippocampal networks coupled to Micro-Electrode-Arrays (MEAs) and we show how the features of the recorded network dynamics differ from the corresponding 2D network model. Further development of the proposed 3D in-vitro model by adding embedded functionalized scaffolds might open new prospects for manipulating, stimulating and recording the neuronal activity to elucidate neurophysiological mechanisms and to design bio-hybrid microsystems.

Network dynamics of 3D engineered neuronal cultures: a new experimental model for in-vitro electrophysiology

PubMed Central

Frega, Monica; Tedesco, Mariateresa; Massobrio, Paolo; Pesce, Mattia; Martinoia, Sergio

2014-01-01

Despite the extensive use of in-vitro models for neuroscientific investigations and notwithstanding the growing field of network electrophysiology, all studies on cultured cells devoted to elucidate neurophysiological mechanisms and computational properties, are based on 2D neuronal networks. These networks are usually grown onto specific rigid substrates (also with embedded electrodes) and lack of most of the constituents of the in-vivo like environment: cell morphology, cell-to-cell interaction and neuritic outgrowth in all directions. Cells in a brain region develop in a 3D space and interact with a complex multi-cellular environment and extracellular matrix. Under this perspective, 3D networks coupled to micro-transducer arrays, represent a new and powerful in-vitro model capable of better emulating in-vivo physiology. In this work, we present a new experimental paradigm constituted by 3D hippocampal networks coupled to Micro-Electrode-Arrays (MEAs) and we show how the features of the recorded network dynamics differ from the corresponding 2D network model. Further development of the proposed 3D in-vitro model by adding embedded functionalized scaffolds might open new prospects for manipulating, stimulating and recording the neuronal activity to elucidate neurophysiological mechanisms and to design bio-hybrid microsystems. PMID:24976386

Decision support tool to assess importance of transportation facilities.

DOT National Transportation Integrated Search

2008-01-01

Assessing the importance of transportation facilities is an increasingly growing topic of interest to federal and state transportation agencies. This work proposes an optimization based model that uses concepts and techniques of complex networks scie...

Natural language acquisition in large scale neural semantic networks

NASA Astrophysics Data System (ADS)

Ealey, Douglas

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

Modeling a Wireless Network for International Space Station

NASA Technical Reports Server (NTRS)

Alena, Richard; Yaprak, Ece; Lamouri, Saad

2000-01-01

This paper describes the application of wireless local area network (LAN) simulation modeling methods to the hybrid LAN architecture designed for supporting crew-computing tools aboard the International Space Station (ISS). These crew-computing tools, such as wearable computers and portable advisory systems, will provide crew members with real-time vehicle and payload status information and access to digital technical and scientific libraries, significantly enhancing human capabilities in space. A wireless network, therefore, will provide wearable computer and remote instruments with the high performance computational power needed by next-generation 'intelligent' software applications. Wireless network performance in such simulated environments is characterized by the sustainable throughput of data under different traffic conditions. This data will be used to help plan the addition of more access points supporting new modules and more nodes for increased network capacity as the ISS grows.

Growing Actin Networks Form Lamellipodium and Lamellum by Self-Assembly

PubMed Central

Huber, Florian; Käs, Josef; Stuhrmann, Björn

2008-01-01

Many different cell types are able to migrate by formation of a thin actin-based cytoskeletal extension. Recently, it became evident that this extension consists of two distinct substructures, designated lamellipodium and lamellum, which differ significantly in their kinetic and kinematic properties as well as their biochemical composition. We developed a stochastic two-dimensional computer simulation that includes chemical reaction kinetics, G-actin diffusion, and filament transport to investigate the formation of growing actin networks in migrating cells. Model parameters were chosen based on experimental data or theoretical considerations. In this work, we demonstrate the system's ability to form two distinct networks by self-organization. We found a characteristic transition in mean filament length as well as a distinct maximum in depolymerization flux, both within the first 1–2 μm. The separation into two distinct substructures was found to be extremely robust with respect to initial conditions and variation of model parameters. We quantitatively investigated the complex interplay between ADF/cofilin and tropomyosin and propose a plausible mechanism that leads to spatial separation of, respectively, ADF/cofilin- or tropomyosin-dominated compartments. Tropomyosin was found to play an important role in stabilizing the lamellar actin network. Furthermore, the influence of filament severing and annealing on the network properties is explored, and simulation data are compared to existing experimental data. PMID:18708450

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

PubMed Central

2016-01-01

Background Computer Networks have a tendency to grow at an unprecedented scale. Modern networks involve not only computers but also a wide variety of other interconnected devices ranging from mobile phones to other household items fitted with sensors. This vision of the "Internet of Things" (IoT) implies an inherent difficulty in modeling problems. Purpose It is practically impossible to implement and test all scenarios for large-scale and complex adaptive communication networks as part of Complex Adaptive Communication Networks and Environments (CACOONS). The goal of this study is to explore the use of Agent-based Modeling as part of the Cognitive Agent-based Computing (CABC) framework to model a Complex communication network problem. Method We use Exploratory Agent-based Modeling (EABM), as part of the CABC framework, to develop an autonomous multi-agent architecture for managing carbon footprint in a corporate network. To evaluate the application of complexity in practical scenarios, we have also introduced a company-defined computer usage policy. Results The conducted experiments demonstrated two important results: Primarily CABC-based modeling approach such as using Agent-based Modeling can be an effective approach to modeling complex problems in the domain of IoT. Secondly, the specific problem of managing the Carbon footprint can be solved using a multiagent system approach. PMID:26812235

Applications of a New England stream temperature model to evaluate distribution of thermal regimes and sensitivity to change in riparian condition

EPA Science Inventory

We have applied a statistical stream network (SSN) model to predict stream thermal metrics (summer monthly medians, growing season maximum magnitude and timing, and daily rates of change) across New England nontidal streams and rivers, excluding northern Maine watersheds that ext...

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

PubMed

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

2004-12-01

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

Local-world and cluster-growing weighted networks with controllable clustering

NASA Astrophysics Data System (ADS)

Yang, Chun-Xia; Tang, Min-Xuan; Tang, Hai-Qiang; Deng, Qiang-Qiang

2014-12-01

We constructed an improved weighted network model by introducing local-world selection mechanism and triangle coupling mechanism based on the traditional BBV model. The model gives power-law distributions of degree, strength and edge weight and presents the linear relationship both between the degree and strength and between the degree and the clustering coefficient. Particularly, the model is equipped with an ability to accelerate the speed increase of strength exceeding that of degree. Besides, the model is more sound and efficient in tuning clustering coefficient than the original BBV model. Finally, based on our improved model, we analyze the virus spread process and find that reducing the size of local-world has a great inhibited effect on virus spread.

Multiplicative Forests for Continuous-Time Processes

PubMed Central

Weiss, Jeremy C.; Natarajan, Sriraam; Page, David

2013-01-01

Learning temporal dependencies between variables over continuous time is an important and challenging task. Continuous-time Bayesian networks effectively model such processes but are limited by the number of conditional intensity matrices, which grows exponentially in the number of parents per variable. We develop a partition-based representation using regression trees and forests whose parameter spaces grow linearly in the number of node splits. Using a multiplicative assumption we show how to update the forest likelihood in closed form, producing efficient model updates. Our results show multiplicative forests can be learned from few temporal trajectories with large gains in performance and scalability. PMID:25284967

Multiplicative Forests for Continuous-Time Processes.

PubMed

Weiss, Jeremy C; Natarajan, Sriraam; Page, David

2012-01-01

Learning temporal dependencies between variables over continuous time is an important and challenging task. Continuous-time Bayesian networks effectively model such processes but are limited by the number of conditional intensity matrices, which grows exponentially in the number of parents per variable. We develop a partition-based representation using regression trees and forests whose parameter spaces grow linearly in the number of node splits. Using a multiplicative assumption we show how to update the forest likelihood in closed form, producing efficient model updates. Our results show multiplicative forests can be learned from few temporal trajectories with large gains in performance and scalability.

Mathematical modelling of complex contagion on clustered networks

NASA Astrophysics Data System (ADS)

O'sullivan, David J.; O'Keeffe, Gary; Fennell, Peter; Gleeson, James

2015-09-01

The spreading of behavior, such as the adoption of a new innovation, is influenced bythe structure of social networks that interconnect the population. In the experiments of Centola (Science, 2010), adoption of new behavior was shown to spread further and faster across clustered-lattice networks than across corresponding random networks. This implies that the “complex contagion” effects of social reinforcement are important in such diffusion, in contrast to “simple” contagion models of disease-spread which predict that epidemics would grow more efficiently on random networks than on clustered networks. To accurately model complex contagion on clustered networks remains a challenge because the usual assumptions (e.g. of mean-field theory) regarding tree-like networks are invalidated by the presence of triangles in the network; the triangles are, however, crucial to the social reinforcement mechanism, which posits an increased probability of a person adopting behavior that has been adopted by two or more neighbors. In this paper we modify the analytical approach that was introduced by Hebert-Dufresne et al. (Phys. Rev. E, 2010), to study disease-spread on clustered networks. We show how the approximation method can be adapted to a complex contagion model, and confirm the accuracy of the method with numerical simulations. The analytical results of the model enable us to quantify the level of social reinforcement that is required to observe—as in Centola’s experiments—faster diffusion on clustered topologies than on random networks.

Coupled disease-behavior dynamics on complex networks: A review.

PubMed

Wang, Zhen; Andrews, Michael A; Wu, Zhi-Xi; Wang, Lin; Bauch, Chris T

2015-12-01

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years. Copyright © 2015 Elsevier B.V. All rights reserved.

Complex Networks - A Key to Understanding Brain Function

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

Sporns, Olaf

2008-01-23

The brain is a complex network of neurons, engaging in spontaneous and evoked activity that is thought to be the main substrate of mental life.  How this complex system works together to process information and generate coherent cognitive states, even consciousness, is not yet well understood.  In my talk I will review recent studies that have revealed characteristic structural and functional attributes of brain networks, and discuss efforts to build computational models of the brain that are informed by our growing knowledge of brain anatomy and physiology.

Complex Networks - A Key to Understanding Brain Function

ScienceCinema

Sporns, Olaf

2017-12-22

The brain is a complex network of neurons, engaging in spontaneous and evoked activity that is thought to be the main substrate of mental life.  How this complex system works together to process information and generate coherent cognitive states, even consciousness, is not yet well understood.  In my talk I will review recent studies that have revealed characteristic structural and functional attributes of brain networks, and discuss efforts to build computational models of the brain that are informed by our growing knowledge of brain anatomy and physiology.

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

PubMed

Gafarov, F M; Gafarova, V R

2016-09-01

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

How much spare capacity is necessary for the security of resource networks?

NASA Astrophysics Data System (ADS)

Zhao, Qian-Chuan; Jia, Qing-Shan; Cao, Yang

2007-01-01

The balance between the supply and demand of some kind of resource is critical for the functionality and security of many complex networks. Local contingencies that break this balance can cause a global collapse. These contingencies are usually dealt with by spare capacity, which is costly especially when the network capacity (the total amount of the resource generated/consumed in the network) grows. This paper studies the relationship between the spare capacity and the collapse probability under separation contingencies when the network capacity grows. Our results are obtained based on the analysis of the existence probability of balanced partitions, which is a measure of network security when network splitting is unavoidable. We find that a network with growing capacity will inevitably collapse after a separation contingency if the spare capacity in each island increases slower than a linear function of the network capacity and there is no suitable global coordinator.

The spreading of opposite opinions on online social networks with authoritative nodes

NASA Astrophysics Data System (ADS)

Yan, Shu; Tang, Shaoting; Pei, Sen; Jiang, Shijin; Zhang, Xiao; Ding, Wenrui; Zheng, Zhiming

2013-09-01

The study of opinion dynamics, such as spreading and controlling of rumors, has become an important issue on social networks. Numerous models have been devised to describe this process, including epidemic models and spin models, which mainly focus on how opinions spread and interact with each other, respectively. In this paper, we propose a model that combines the spreading stage and the interaction stage for opinions to illustrate the process of dispelling a rumor. Moreover, we set up authoritative nodes, which disseminate positive opinion to counterbalance the negative opinion prevailing on online social networking sites. With analysis of the relationship among positive opinion proportion, opinion strength and the density of authoritative nodes in networks with different topologies, we demonstrate that the positive opinion proportion grows with the density of authoritative nodes until the positive opinion prevails in the entire network. In particular, the relationship is linear in homogeneous topologies. Besides, it is also noteworthy that initial locations of the negative opinion source and authoritative nodes do not influence positive opinion proportion in homogeneous networks but have a significant impact on heterogeneous networks. The results are verified by numerical simulations and are helpful to understand the mechanism of two different opinions interacting with each other on online social networking sites.

A renaissance of neural networks in drug discovery.

PubMed

Baskin, Igor I; Winkler, David; Tetko, Igor V

2016-08-01

Neural networks are becoming a very popular method for solving machine learning and artificial intelligence problems. The variety of neural network types and their application to drug discovery requires expert knowledge to choose the most appropriate approach. In this review, the authors discuss traditional and newly emerging neural network approaches to drug discovery. Their focus is on backpropagation neural networks and their variants, self-organizing maps and associated methods, and a relatively new technique, deep learning. The most important technical issues are discussed including overfitting and its prevention through regularization, ensemble and multitask modeling, model interpretation, and estimation of applicability domain. Different aspects of using neural networks in drug discovery are considered: building structure-activity models with respect to various targets; predicting drug selectivity, toxicity profiles, ADMET and physicochemical properties; characteristics of drug-delivery systems and virtual screening. Neural networks continue to grow in importance for drug discovery. Recent developments in deep learning suggests further improvements may be gained in the analysis of large chemical data sets. It's anticipated that neural networks will be more widely used in drug discovery in the future, and applied in non-traditional areas such as drug delivery systems, biologically compatible materials, and regenerative medicine.

Epidemics Modelings: Some New Challenges

NASA Astrophysics Data System (ADS)

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

2010-09-01

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

Growing complex network of citations of scientific papers: Modeling and measurements

NASA Astrophysics Data System (ADS)

Golosovsky, Michael; Solomon, Sorin

2017-01-01

We consider the network of citations of scientific papers and use a combination of the theoretical and experimental tools to uncover microscopic details of this network growth. Namely, we develop a stochastic model of citation dynamics based on the copying-redirection-triadic closure mechanism. In a complementary and coherent way, the model accounts both for statistics of references of scientific papers and for their citation dynamics. Originating in empirical measurements, the model is cast in such a way that it can be verified quantitatively in every aspect. Such validation is performed by measuring citation dynamics of physics papers. The measurements revealed nonlinear citation dynamics, the nonlinearity being intricately related to network topology. The nonlinearity has far-reaching consequences including nonstationary citation distributions, diverging citation trajectories of similar papers, runaways or "immortal papers" with infinite citation lifetime, etc. Thus nonlinearity in complex network growth is our most important finding. In a more specific context, our results can be a basis for quantitative probabilistic prediction of citation dynamics of individual papers and of the journal impact factor.

Irreversible opinion spreading on scale-free networks

NASA Astrophysics Data System (ADS)

Candia, Julián

2007-02-01

We study the dynamical and critical behavior of a model for irreversible opinion spreading on Barabási-Albert (BA) scale-free networks by performing extensive Monte Carlo simulations. The opinion spreading within an inhomogeneous society is investigated by means of the magnetic Eden model, a nonequilibrium kinetic model for the growth of binary mixtures in contact with a thermal bath. The deposition dynamics, which is studied as a function of the degree of the occupied sites, shows evidence for the leading role played by hubs in the growth process. Systems of finite size grow either ordered or disordered, depending on the temperature. By means of standard finite-size scaling procedures, the effective order-disorder phase transitions are found to persist in the thermodynamic limit. This critical behavior, however, is absent in related equilibrium spin systems such as the Ising model on BA scale-free networks, which in the thermodynamic limit only displays a ferromagnetic phase. The dependence of these results on the degree exponent is also discussed for the case of uncorrelated scale-free networks.

Interaction of oscillations, and their suppression via deep brain stimulation, in a model of the cortico-basal ganglia network.

PubMed

Kang, Guiyeom; Lowery, Madeleine M

2013-03-01

Growing evidence suggests that synchronized neural oscillations in the cortico-basal ganglia network may play a critical role in the pathophysiology of Parkinson's disease. In this study, a new model of the closed loop network is used to explore the generation and interaction of network oscillations and their suppression through deep brain stimulation (DBS). Under simulated dopamine depletion conditions, increased gain through the hyperdirect pathway resulted in the interaction of neural oscillations at different frequencies in the cortex and subthalamic nucleus (STN), leading to the emergence of synchronized oscillations at a new intermediate frequency. Further increases in synaptic gain resulted in the cortex driving synchronous oscillatory activity throughout the network. When DBS was added to the model a progressive reduction in STN power at the tremor and beta frequencies was observed as the frequency of stimulation was increased, with resonance effects occurring for low frequency DBS (40 Hz) in agreement with experimental observations. The results provide new insights into the mechanisms by which synchronous oscillations can arise within the network and how DBS may suppress unwanted oscillatory activity.

Generating clustered scale-free networks using Poisson based localization of edges

NASA Astrophysics Data System (ADS)

Türker, İlker

2018-05-01

We introduce a variety of network models using a Poisson-based edge localization strategy, which result in clustered scale-free topologies. We first verify the success of our localization strategy by realizing a variant of the well-known Watts-Strogatz model with an inverse approach, implying a small-world regime of rewiring from a random network through a regular one. We then apply the rewiring strategy to a pure Barabasi-Albert model and successfully achieve a small-world regime, with a limited capacity of scale-free property. To imitate the high clustering property of scale-free networks with higher accuracy, we adapted the Poisson-based wiring strategy to a growing network with the ingredients of both preferential attachment and local connectivity. To achieve the collocation of these properties, we used a routine of flattening the edges array, sorting it, and applying a mixing procedure to assemble both global connections with preferential attachment and local clusters. As a result, we achieved clustered scale-free networks with a computational fashion, diverging from the recent studies by following a simple but efficient approach.

Markov Task Network: A Framework for Service Composition under Uncertainty in Cyber-Physical Systems.

PubMed

Mohammed, Abdul-Wahid; Xu, Yang; Hu, Haixiao; Agyemang, Brighter

2016-09-21

In novel collaborative systems, cooperative entities collaborate services to achieve local and global objectives. With the growing pervasiveness of cyber-physical systems, however, such collaboration is hampered by differences in the operations of the cyber and physical objects, and the need for the dynamic formation of collaborative functionality given high-level system goals has become practical. In this paper, we propose a cross-layer automation and management model for cyber-physical systems. This models the dynamic formation of collaborative services pursuing laid-down system goals as an ontology-oriented hierarchical task network. Ontological intelligence provides the semantic technology of this model, and through semantic reasoning, primitive tasks can be dynamically composed from high-level system goals. In dealing with uncertainty, we further propose a novel bridge between hierarchical task networks and Markov logic networks, called the Markov task network. This leverages the efficient inference algorithms of Markov logic networks to reduce both computational and inferential loads in task decomposition. From the results of our experiments, high-precision service composition under uncertainty can be achieved using this approach.

Polymorphic Attacks and Network Topology: Application of Concepts from Natural Systems

ERIC Educational Resources Information Center

Rangan, Prahalad

2010-01-01

The growing complexity of interactions between computers and networks makes the subject of network security a very interesting one. As our dependence on the services provided by computing networks grows, so does our investment in such technology. In this situation, there is a greater risk of occurrence of targeted malicious attacks on computers…

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

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2017-10-01

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

Language Networks as Complex Systems

ERIC Educational Resources Information Center

Lee, Max Kueiming; Ou, Sheue-Jen

2008-01-01

Starting in the late eighties, with a growing discontent with analytical methods in science and the growing power of computers, researchers began to study complex systems such as living organisms, evolution of genes, biological systems, brain neural networks, epidemics, ecology, economy, social networks, etc. In the early nineties, the research…

Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

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

Imam, Neena; Humble, Travis S.; McCaskey, Alex

A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using adiabatic quantum optimization. Our approach maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model. We then assess the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. We observe that different learning rules from the neural network community influence recallmore » accuracy but performance appears to be limited by potential noise in the processor. The strong connection established between quantum processors and neural network problems supports the growing intersection of these two ideas.« less

Identification of the actual state and entity availability forecasting in power engineering using neural-network technologies

NASA Astrophysics Data System (ADS)

Protalinsky, O. M.; Shcherbatov, I. A.; Stepanov, P. V.

2017-11-01

A growing number of severe accidents in RF call for the need to develop a system that could prevent emergency situations. In a number of cases accident rate is stipulated by careless inspections and neglects in developing repair programs. Across the country rates of accidents are growing because of a so-called “human factor”. In this regard, there has become urgent the problem of identification of the actual state of technological facilities in power engineering using data on engineering processes running and applying artificial intelligence methods. The present work comprises four model states of manufacturing equipment of engineering companies: defect, failure, preliminary situation, accident. Defect evaluation is carried out using both data from SCADA and ASEPCR and qualitative information (verbal assessments of experts in subject matter, photo- and video materials of surveys processed using pattern recognition methods in order to satisfy the requirements). Early identification of defects makes possible to predict the failure of manufacturing equipment using mathematical techniques of artificial neural network. In its turn, this helps to calculate predicted characteristics of reliability of engineering facilities using methods of reliability theory. Calculation of the given parameters provides the real-time estimation of remaining service life of manufacturing equipment for the whole operation period. The neural networks model allows evaluating possibility of failure of a piece of equipment consistent with types of actual defects and their previous reasons. The article presents the grounds for a choice of training and testing samples for the developed neural network, evaluates the adequacy of the neural networks model, and shows how the model can be used to forecast equipment failure. There have been carried out simulating experiments using a computer and retrospective samples of actual values for power engineering companies. The efficiency of the developed model for different types of manufacturing equipment has been proved. There have been offered other research areas in terms of the presented subject matter.

Characterizing Topology of Probabilistic Biological Networks.

PubMed

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-09-06

Biological interactions are often uncertain events, that may or may not take place with some probability. Existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. Here, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. We develop a method that accurately describes the degree distribution of such networks. We also extend our method to accurately compute the joint degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. It also helps us find an adequate mathematical model using maximum likelihood estimation. Our results demonstrate that power law and log-normal models best describe degree distributions for probabilistic networks. The inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected.

Knowledge diffusion in complex networks by considering time-varying information channels

NASA Astrophysics Data System (ADS)

Zhu, He; Ma, Jing

2018-03-01

In this article, based on a model of epidemic spreading, we explore the knowledge diffusion process with an innovative mechanism for complex networks by considering time-varying information channels. To cover the knowledge diffusion process in homogeneous and heterogeneous networks, two types of networks (the BA network and the ER network) are investigated. The mean-field theory is used to theoretically draw the knowledge diffusion threshold. Numerical simulation demonstrates that the knowledge diffusion threshold is almost linearly correlated with the mean of the activity rate. In addition, under the influence of the activity rate and distinct from the classic Susceptible-Infected-Susceptible (SIS) model, the density of knowers almost linearly grows with the spreading rate. Finally, in consideration of the ubiquitous mechanism of innovation, we further study the evolution of knowledge in our proposed model. The results suggest that compared with the effect of the spreading rate, the average knowledge version of the population is affected more by the innovation parameter and the mean of the activity rate. Furthermore, in the BA network, the average knowledge version of individuals with higher degree is always newer than those with lower degree.

Connectome sensitivity or specificity: which is more important?

PubMed

Zalesky, Andrew; Fornito, Alex; Cocchi, Luca; Gollo, Leonardo L; van den Heuvel, Martijn P; Breakspear, Michael

2016-11-15

Connectomes with high sensitivity and high specificity are unattainable with current axonal fiber reconstruction methods, particularly at the macro-scale afforded by magnetic resonance imaging. Tensor-guided deterministic tractography yields sparse connectomes that are incomplete and contain false negatives (FNs), whereas probabilistic methods steered by crossing-fiber models yield dense connectomes, often with low specificity due to false positives (FPs). Densely reconstructed probabilistic connectomes are typically thresholded to improve specificity at the cost of a reduction in sensitivity. What is the optimal tradeoff between connectome sensitivity and specificity? We show empirically and theoretically that specificity is paramount. Our evaluations of the impact of FPs and FNs on empirical connectomes indicate that specificity is at least twice as important as sensitivity when estimating key properties of brain networks, including topological measures of network clustering, network efficiency and network modularity. Our asymptotic analysis of small-world networks with idealized modular structure reveals that as the number of nodes grows, specificity becomes exactly twice as important as sensitivity to the estimation of the clustering coefficient. For the estimation of network efficiency, the relative importance of specificity grows linearly with the number of nodes. The greater importance of specificity is due to FPs occurring more prevalently between network modules rather than within them. These spurious inter-modular connections have a dramatic impact on network topology. We argue that efforts to maximize the sensitivity of connectome reconstruction should be realigned with the need to map brain networks with high specificity. Copyright © 2016 Elsevier Inc. All rights reserved.

Capturing the Flatness of a peer-to-peer lending network through random and selected perturbations

NASA Astrophysics Data System (ADS)

Karampourniotis, Panagiotis D.; Singh, Pramesh; Uparna, Jayaram; Horvat, Emoke-Agnes; Szymanski, Boleslaw K.; Korniss, Gyorgy; Bakdash, Jonathan Z.; Uzzi, Brian

Null models are established tools that have been used in network analysis to uncover various structural patterns. They quantify the deviance of an observed network measure to that given by the null model. We construct a null model for weighted, directed networks to identify biased links (carrying significantly different weights than expected according to the null model) and thus quantify the flatness of the system. Using this model, we study the flatness of Kiva, a large international crownfinancing network of borrowers and lenders, aggregated to the country level. The dataset spans the years from 2006 to 2013. Our longitudinal analysis shows that flatness of the system is reducing over time, meaning the proportion of biased inter-country links is growing. We extend our analysis by testing the robustness of the flatness of the network in perturbations on the links' weights or the nodes themselves. Examples of such perturbations are event shocks (e.g. erecting walls) or regulatory shocks (e.g. Brexit). We find that flatness is unaffected by random shocks, but changes after shocks target links with a large weight or bias. The methods we use to capture the flatness are based on analytics, simulations, and numerical computations using Shannon's maximum entropy. Supported by ARL NS-CTA.

Algebraic model checking for Boolean gene regulatory networks.

PubMed

Tran, Quoc-Nam

2011-01-01

We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

Network-induced oscillatory behavior in material flow networks and irregular business cycles

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Lämmer, Stefen; Witt, Ulrich; Brenner, Thomas

2004-11-01

Network theory is rapidly changing our understanding of complex systems, but the relevance of topological features for the dynamic behavior of metabolic networks, food webs, production systems, information networks, or cascade failures of power grids remains to be explored. Based on a simple model of supply networks, we offer an interpretation of instabilities and oscillations observed in biological, ecological, economic, and engineering systems. We find that most supply networks display damped oscillations, even when their units—and linear chains of these units—behave in a nonoscillatory way. Moreover, networks of damped oscillators tend to produce growing oscillations. This surprising behavior offers, for example, a different interpretation of business cycles and of oscillating or pulsating processes. The network structure of material flows itself turns out to be a source of instability, and cyclical variations are an inherent feature of decentralized adjustments.

Intelligent Middle-Ware Architecture for Mobile Networks

NASA Astrophysics Data System (ADS)

Rayana, Rayene Ben; Bonnin, Jean-Marie

Recent advances in electronic and automotive industries as well as in wireless telecommunication technologies have drawn a new picture where each vehicle became “fully networked”. Multiple stake-holders (network operators, drivers, car manufacturers, service providers, etc.) will participate in this emerging market, which could grow following various models. To free the market from technical constraints, it is important to return to the basics of the Internet, i.e., providing embarked devices with a fully operational Internet connectivity (IPv6).

Modeling Attrition in Organizations from Email Communication

DTIC Science & Technology

2013-09-08

networks [17]. A particular example is the video - gaming industry, a huge and growing market around the world, valued at about $65 billion in 2011 [18...Symposium, 2007. ANSS ’07. 40th Annual, march 2007, pp. 33 –40. [18] T. R. Corporation, “Factbox: A look at the $65 billion video games industry,” http...online multiplayer games , user involvement and movement in online social networking plat- forms, and employee turnover within an organization. At

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

NASA Astrophysics Data System (ADS)

Gong, Xinwei

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

Social Media and Health Education: What the Early Literature Says

ERIC Educational Resources Information Center

Gorham, Robyn; Carter, Lorraine; Nowrouzi, Behdin; McLean, Natalie; Guimond, Melissa

2012-01-01

Social media allows for a wealth of social interactions. More recently, there is a growing use of social media for the purposes of health education. Using an adaptation of the Networked student model by Drexler (2010) as a conceptual model, this article conducts a literature review focusing on the use of social media for health education purposes.…

Environment-dependent morphology in plasmodium of true slime mold Physarum polycephalum and a network growth model.

PubMed

Takamatsu, Atsuko; Takaba, Eri; Takizawa, Ginjiro

2009-01-07

Branching network growth patterns, depending on environmental conditions, in plasmodium of true slime mold Physarum polycephalum were investigated. Surprisingly, the patterns resemble those in bacterial colonies even though the biological mechanisms differ greatly. Bacterial colonies are collectives of microorganisms in which individual organisms have motility and interact through nutritious and chemical fields. In contrast, the plasmodium is a giant amoeba-like multinucleated unicellular organism that forms a network of tubular structures through which protoplasm streams. The cell motility of the plasmodium is generated by oscillation phenomena observed in the partial bodies, which interact through the tubular structures. First, we analyze characteristics of the morphology quantitatively, then we abstract local rules governing the growing process to construct a simple network growth model. This model is independent of specific systems, in which only two rules are applied. Finally, we discuss the mechanism of commonly observed biological pattern formations through comparison with the system of bacterial colonies.

Emergence of Multiplex Communities in Collaboration Networks.

PubMed

Battiston, Federico; Iacovacci, Jacopo; Nicosia, Vincenzo; Bianconi, Ginestra; Latora, Vito

2016-01-01

Community structures in collaboration networks reflect the natural tendency of individuals to organize their work in groups in order to better achieve common goals. In most of the cases, individuals exploit their connections to introduce themselves to new areas of interests, giving rise to multifaceted collaborations which span different fields. In this paper, we analyse collaborations in science and among movie actors as multiplex networks, where the layers represent respectively research topics and movie genres, and we show that communities indeed coexist and overlap at the different layers of such systems. We then propose a model to grow multiplex networks based on two mechanisms of intra and inter-layer triadic closure which mimic the real processes by which collaborations evolve. We show that our model is able to explain the multiplex community structure observed empirically, and we infer the strength of the two underlying social mechanisms from real-world systems. Being also able to correctly reproduce the values of intra-layer and inter-layer assortativity correlations, the model contributes to a better understanding of the principles driving the evolution of social networks.

Average weighted receiving time on the non-homogeneous double-weighted fractal networks

NASA Astrophysics Data System (ADS)

Ye, Dandan; Dai, Meifeng; Sun, Yu; Su, Weiyi

2017-05-01

In this paper, based on actual road networks, a model of the non-homogeneous double-weighted fractal networks is introduced depending on the number of copies s and two kinds of weight factors wi ,ri(i = 1 , 2 , … , s) . The double-weights represent the capacity-flowing weights and the cost-traveling weights, respectively. Denote by wijF the capacity-flowing weight connecting the nodes i and j, and denote by wijC the cost-traveling weight connecting the nodes i and j. Let wijF be related to the weight factors w1 ,w2 , … ,ws, and let wijC be related to the weight factors r1 ,r2 , … ,rs. Assuming that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. The average weighted receiving time (AWRT) is defined on the non-homogeneous double-weighted fractal networks. AWRT depends on the relationships of the number of copies s and two kinds of weight factors wi ,ri(i = 1 , 2 , … , s) . The obtained remarkable results display that in the large network, the AWRT grows as a power-law function of the network size Ng with the exponent, represented by θ =logs(w1r1 +w2r2 + ⋯ +wsrs) < 1 when w1r1 +w2r2 + ⋯ +wsrs ≠ 1, which means that the smaller the value of w1r1 +w2r2 + ⋯ +wsrs is, the more efficient the process of receiving information is. Especially when w1r1 +w2r2 + ⋯ +wsrs = 1, AWRT grows with increasing order Ng as logNg or (logNg) 2 . In the classic fractal networks, the average receiving time (ART) grows with linearly with the network size Ng. Thus, the non-homogeneous double-weighted fractal networks are more efficient than classic fractal networks in term of receiving information.

Measuring the default risk of sovereign debt from the perspective of network

NASA Astrophysics Data System (ADS)

Chuang, Hongwei; Ho, Hwai-Chung

2013-05-01

Recently, there has been a growing interest in network research, especially in the fields of biology, computer science, and sociology. It is natural to address complex financial issues such as the European sovereign debt crisis from the perspective of network. In this article, we construct a network model according to the debt-credit relations instead of using the conventional methodology to measure the default risk. Based on the model, a risk index is examined using the quarterly report of consolidated foreign claims from the Bank for International Settlements (BIS) and debt/GDP ratios among these reporting countries. The empirical results show that this index can help the regulators and practitioners not only to determine the status of interconnectivity but also to point out the degree of the sovereign debt default risk. Our approach sheds new light on the investigation of quantifying the systemic risk.

Bayesian Inference and Online Learning in Poisson Neuronal Networks.

PubMed

Huang, Yanping; Rao, Rajesh P N

2016-08-01

Motivated by the growing evidence for Bayesian computation in the brain, we show how a two-layer recurrent network of Poisson neurons can perform both approximate Bayesian inference and learning for any hidden Markov model. The lower-layer sensory neurons receive noisy measurements of hidden world states. The higher-layer neurons infer a posterior distribution over world states via Bayesian inference from inputs generated by sensory neurons. We demonstrate how such a neuronal network with synaptic plasticity can implement a form of Bayesian inference similar to Monte Carlo methods such as particle filtering. Each spike in a higher-layer neuron represents a sample of a particular hidden world state. The spiking activity across the neural population approximates the posterior distribution over hidden states. In this model, variability in spiking is regarded not as a nuisance but as an integral feature that provides the variability necessary for sampling during inference. We demonstrate how the network can learn the likelihood model, as well as the transition probabilities underlying the dynamics, using a Hebbian learning rule. We present results illustrating the ability of the network to perform inference and learning for arbitrary hidden Markov models.

A Hybrid Satellite-Terrestrial Approach to Aeronautical Communication Networks

NASA Technical Reports Server (NTRS)

Kerczewski, Robert J.; Chomos, Gerald J.; Griner, James H.; Mainger, Steven W.; Martzaklis, Konstantinos S.; Kachmar, Brian A.

2000-01-01

Rapid growth in air travel has been projected to continue for the foreseeable future. To maintain a safe and efficient national and global aviation system, significant advances in communications systems supporting aviation are required. Satellites will increasingly play a critical role in the aeronautical communications network. At the same time, current ground-based communications links, primarily very high frequency (VHF), will continue to be employed due to cost advantages and legacy issues. Hence a hybrid satellite-terrestrial network, or group of networks, will emerge. The increased complexity of future aeronautical communications networks dictates that system-level modeling be employed to obtain an optimal system fulfilling a majority of user needs. The NASA Glenn Research Center is investigating the current and potential future state of aeronautical communications, and is developing a simulation and modeling program to research future communications architectures for national and global aeronautical needs. This paper describes the primary requirements, the current infrastructure, and emerging trends of aeronautical communications, including a growing role for satellite communications. The need for a hybrid communications system architecture approach including both satellite and ground-based communications links is explained. Future aeronautical communication network topologies and key issues in simulation and modeling of future aeronautical communications systems are described.

Disease invasion risk in a growing population.

PubMed

Yuan, Sanling; van den Driessche, P; Willeboordse, Frederick H; Shuai, Zhisheng; Ma, Junling

2016-09-01

The spread of an infectious disease may depend on the population size. For simplicity, classic epidemic models assume homogeneous mixing, usually standard incidence or mass action. For standard incidence, the contact rate between any pair of individuals is inversely proportional to the population size, and so the basic reproduction number (and thus the initial exponential growth rate of the disease) is independent of the population size. For mass action, this contact rate remains constant, predicting that the basic reproduction number increases linearly with the population size, meaning that disease invasion is easiest when the population is largest. In this paper, we show that neither of these may be true on a slowly evolving contact network: the basic reproduction number of a short epidemic can reach its maximum while the population is still growing. The basic reproduction number is proportional to the spectral radius of a contact matrix, which is shown numerically to be well approximated by the average excess degree of the contact network. We base our analysis on modeling the dynamics of the average excess degree of a random contact network with constant population input, proportional deaths, and preferential attachment for contacts brought in by incoming individuals (i.e., individuals with more contacts attract more incoming contacts). In addition, we show that our result also holds for uniform attachment of incoming contacts (i.e., every individual has the same chance of attracting incoming contacts), and much more general population dynamics. Our results show that a disease spreading in a growing population may evade control if disease control planning is based on the basic reproduction number at maximum population size.

Population Fluctuation Promotes Cooperation in Networks

PubMed Central

Miller, Steve; Knowles, Joshua

2015-01-01

We consider the problem of explaining the emergence and evolution of cooperation in dynamic network-structured populations. Building on seminal work by Poncela et al., which shows how cooperation (in one-shot prisoner’s dilemma) is supported in growing populations by an evolutionary preferential attachment (EPA) model, we investigate the effect of fluctuations in the population size. We find that a fluctuating model – based on repeated population growth and truncation – is more robust than Poncela et al.’s in that cooperation flourishes for a wider variety of initial conditions. In terms of both the temptation to defect, and the types of strategies present in the founder network, the fluctuating population is found to lead more securely to cooperation. Further, we find that this model will also support the emergence of cooperation from pre-existing non-cooperative random networks. This model, like Poncela et al.’s, does not require agents to have memory, recognition of other agents, or other cognitive abilities, and so may suggest a more general explanation of the emergence of cooperation in early evolutionary transitions, than mechanisms such as kin selection, direct and indirect reciprocity. PMID:26061705

Ramification of Channel Networks Incised by Groundwater Flow

NASA Astrophysics Data System (ADS)

Yi, R. S.; Seybold, H. F.; Petroff, A. P.; Devauchelle, O.; Rothman, D.

2011-12-01

The geometry of channel networks has been a source of fascination since at least Leonardo da Vinci's time. Yet a comprehensive understanding of ramification---the mechanism of branching by which a stream network acquires its geometric complexity---remains elusive. To investigate the mechanisms of ramification and network growth, we consider channel growth driven by groundwater flow as a model system, analogous to a medical scientist's laboratory rat. We test our theoretical predictions through analysis of a particularly compelling example found on the Florida Panhandle north of Bristol. As our ultimate goal is to understand ramification and growth dynamics of the entire network, we build a computational model based on the following growth hypothesis: Channels grow in the direction that captures the maximum water flux. When there are two such directions, tips bifurcate. The direction of growth can be determined from the expansion of the ground water field around each tip, where each coefficient in this expansion has a physical interpretation. The first coefficient in the expansion determines the ground water discharge, leading to a straight growth of the channel. The second term describes the asymmetry in the water field leading to a bending of the stream in the direction of maximal water flux. The ratio between the first and the third coefficient determines a critical distance rc over which the tip feels inhomogeneities in the ground water table. This initiates then the splitting of the tip. In order to test our growth hypothesis and to determine rc, we grow the Florida network backward. At each time step we calculate the solution of the ground water field and determine the appropriate expansion coefficients around each tip. Comparing this simulation result to the predicted values provides us with a stringent measure for rc and the significance of our growth hypothesis.

"A Lifelong Classroom": Social Studies Educators' Engagement with Professional Learning Networks on Twitter

ERIC Educational Resources Information Center

Noble, Anna; McQuillan, Patrick; Littenberg-Tobias, Josh

2016-01-01

Growing numbers of educators are using social media platforms to connect with other educators to form professional learning networks. These networks serve as alternative sources of professional development for teachers who seek to enrich their professional growth beyond school-based programs. This study aims to add to the small but growing body of…

Sentiment classification technology based on Markov logic networks

NASA Astrophysics Data System (ADS)

He, Hui; Li, Zhigang; Yao, Chongchong; Zhang, Weizhe

2016-07-01

With diverse online media emerging, there is a growing concern of sentiment classification problem. At present, text sentiment classification mainly utilizes supervised machine learning methods, which feature certain domain dependency. On the basis of Markov logic networks (MLNs), this study proposed a cross-domain multi-task text sentiment classification method rooted in transfer learning. Through many-to-one knowledge transfer, labeled text sentiment classification, knowledge was successfully transferred into other domains, and the precision of the sentiment classification analysis in the text tendency domain was improved. The experimental results revealed the following: (1) the model based on a MLN demonstrated higher precision than the single individual learning plan model. (2) Multi-task transfer learning based on Markov logical networks could acquire more knowledge than self-domain learning. The cross-domain text sentiment classification model could significantly improve the precision and efficiency of text sentiment classification.

Advanced Fault Diagnosis Methods in Molecular Networks

PubMed Central

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

2014-01-01

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

Deep learning for computational chemistry

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

Goh, Garrett B.; Hodas, Nathan O.; Vishnu, Abhinav

The rise and fall of artificial neural networks is well documented in the scientific literature of both the fields of computer science and computational chemistry. Yet almost two decades later, we are now seeing a resurgence of interest in deep learning, a machine learning algorithm based on “deep” neural networks. Within the last few years, we have seen the transformative impact of deep learning the computer science domain, notably in speech recognition and computer vision, to the extent that the majority of practitioners in those field are now regularly eschewing prior established models in favor of deep learning models. Inmore » this review, we provide an introductory overview into the theory of deep neural networks and their unique properties as compared to traditional machine learning algorithms used in cheminformatics. By providing an overview of the variety of emerging applications of deep neural networks, we highlight its ubiquity and broad applicability to a wide range of challenges in the field, including QSAR, virtual screening, protein structure modeling, QM calculations, materials synthesis and property prediction. In reviewing the performance of deep neural networks, we observed a consistent outperformance against non neural networks state-of-the-art models across disparate research topics, and deep neural network based models often exceeded the “glass ceiling” expectations of their respective tasks. Coupled with the maturity of GPU-accelerated computing for training deep neural networks and the exponential growth of chemical data on which to train these networks on, we anticipate that deep learning algorithms will be a useful tool and may grow into a pivotal role for various challenges in the computational chemistry field.« less

Cooperation in group-structured populations with two layers of interactions

PubMed Central

Zhang, Yanling; Fu, Feng; Chen, Xiaojie; Xie, Guangming; Wang, Long

2015-01-01

Recently there has been a growing interest in studying multiplex networks where individuals are structured in multiple network layers. Previous agent-based simulations of games on multiplex networks reveal rich dynamics arising from interdependency of interactions along each network layer, yet there is little known about analytical conditions for cooperation to evolve thereof. Here we aim to tackle this issue by calculating the evolutionary dynamics of cooperation in group-structured populations with two layers of interactions. In our model, an individual is engaged in two layers of group interactions simultaneously and uses unrelated strategies across layers. Evolutionary competition of individuals is determined by the total payoffs accrued from two layers of interactions. We also consider migration which allows individuals to move to a new group within each layer. An approach combining the coalescence theory with the theory of random walks is established to overcome the analytical difficulty upon local migration. We obtain the exact results for all “isotropic” migration patterns, particularly for migration tuned with varying ranges. When the two layers use one game, the optimal migration ranges are proved identical across layers and become smaller as the migration probability grows. PMID:26632251

Statistical properties of the personal social network in the Facebook

NASA Astrophysics Data System (ADS)

Guo, Q.; Shao, F.; Hu, Z. L.; Liu, J. G.

2013-10-01

The statistical properties of the user interaction behaviors in a city have great significance for developing the network marketing strategy, promoting personalized service and so on. In this paper, we investigate the interaction property of the users from New Orleans network in the Facebook, and find that one's out-degree and in-degree are approximately the same. In addition, when the number of a user friends is less than 65, the number of their posts would linearly grow with the slope 4.2, but when one user's friends are more than 65, their posts would grow with the slope 2.1. Further, the average link weight is relatively flat when the out-degree ranges from 28 to 65, and before or after the section it is on the rise or in decline, respectively, from which we can conclude that one could not maintain stable and meaningful relationships with more than 65 people in a single city. We present a null model to reshuffle the network to guarantee that the empirical results are not obtained by accident. The result obtained after reshuffling suggests that there exists a limit that restricts people's social activities.

Toward Rigorous Parameterization of Underconstrained Neural Network Models Through Interactive Visualization and Steering of Connectivity Generation

PubMed Central

Nowke, Christian; Diaz-Pier, Sandra; Weyers, Benjamin; Hentschel, Bernd; Morrison, Abigail; Kuhlen, Torsten W.; Peyser, Alexander

2018-01-01

Simulation models in many scientific fields can have non-unique solutions or unique solutions which can be difficult to find. Moreover, in evolving systems, unique final state solutions can be reached by multiple different trajectories. Neuroscience is no exception. Often, neural network models are subject to parameter fitting to obtain desirable output comparable to experimental data. Parameter fitting without sufficient constraints and a systematic exploration of the possible solution space can lead to conclusions valid only around local minima or around non-minima. To address this issue, we have developed an interactive tool for visualizing and steering parameters in neural network simulation models. In this work, we focus particularly on connectivity generation, since finding suitable connectivity configurations for neural network models constitutes a complex parameter search scenario. The development of the tool has been guided by several use cases—the tool allows researchers to steer the parameters of the connectivity generation during the simulation, thus quickly growing networks composed of multiple populations with a targeted mean activity. The flexibility of the software allows scientists to explore other connectivity and neuron variables apart from the ones presented as use cases. With this tool, we enable an interactive exploration of parameter spaces and a better understanding of neural network models and grapple with the crucial problem of non-unique network solutions and trajectories. In addition, we observe a reduction in turn around times for the assessment of these models, due to interactive visualization while the simulation is computed. PMID:29937723

Direct2Experts: a pilot national network to demonstrate interoperability among research-networking platforms.

PubMed

Weber, Griffin M; Barnett, William; Conlon, Mike; Eichmann, David; Kibbe, Warren; Falk-Krzesinski, Holly; Halaas, Michael; Johnson, Layne; Meeks, Eric; Mitchell, Donald; Schleyer, Titus; Stallings, Sarah; Warden, Michael; Kahlon, Maninder

2011-12-01

Research-networking tools use data-mining and social networking to enable expertise discovery, matchmaking and collaboration, which are important facets of team science and translational research. Several commercial and academic platforms have been built, and many institutions have deployed these products to help their investigators find local collaborators. Recent studies, though, have shown the growing importance of multiuniversity teams in science. Unfortunately, the lack of a standard data-exchange model and resistance of universities to share information about their faculty have presented barriers to forming an institutionally supported national network. This case report describes an initiative, which, in only 6 months, achieved interoperability among seven major research-networking products at 28 universities by taking an approach that focused on addressing institutional concerns and encouraging their participation. With this necessary groundwork in place, the second phase of this effort can begin, which will expand the network's functionality and focus on the end users.

Network traffic intelligence using a low interaction honeypot

NASA Astrophysics Data System (ADS)

Nyamugudza, Tendai; Rajasekar, Venkatesh; Sen, Prasad; Nirmala, M.; Madhu Viswanatham, V.

2017-11-01

Advancements in networking technology have seen more and more devices becoming connected day by day. This has given organizations capacity to extend their networks beyond their boundaries to remote offices and remote employees. However as the network grows security becomes a major challenge since the attack surface also increases. There is need to guard the network against different types of attacks like intrusion and malware through using different tools at different networking levels. This paper describes how network intelligence can be acquired through implementing a low-interaction honeypot which detects and track network intrusion. Honeypot allows an organization to interact and gather information about an attack earlier before it compromises the network. This process is important because it allows the organization to learn about future attacks of the same nature and allows them to develop counter measures. The paper further shows how honeypot-honey net based model for interruption detection system (IDS) can be used to get the best valuable information about the attacker and prevent unexpected harm to the network.

Pathways towards instability in financial networks

NASA Astrophysics Data System (ADS)

Caldarelli, Guido; Bardoscia, Marco; Caccioli, Fabio; Battiston, Stefano

There is growing consensus that processes of market integration and risk diversification may come at the price of more systemic risk. Indeed, financial institutions are interconnected in a network of contracts where distress can either be amplified or dampened. However, a mathematical understanding of instability in relation to the network topology is still lacking. In a model financial network, we show that the origin of instability resides in the presence of specific types of cyclical structures, regardless of many of the details of the distress propagation mechanism. In particular, we show the existence of trajectories in the space of graphs along which a complex network turns from stable to unstable, although at each point along the trajectory its nodes satisfy constraints that would apparently make them individually stable. In the financial context, our findings have important implications for policies aimed at increasing financial stability. We illustrate the propositions on a sample dataset for the top 50 EU listed banks between 2008 and 2013. More in general, our results shed light on previous findings on the instability of model ecosystems and are relevant for a broad class of dynamical processes on complex networks.

Threshold cascades with response heterogeneity in multiplex networks

NASA Astrophysics Data System (ADS)

Lee, Kyu-Min; Brummitt, Charles D.; Goh, K.-I.

2014-12-01

Threshold cascade models have been used to describe the spread of behavior in social networks and cascades of default in financial networks. In some cases, these networks may have multiple kinds of interactions, such as distinct types of social ties or distinct types of financial liabilities; furthermore, nodes may respond in different ways to influence from their neighbors of multiple types. To start to capture such settings in a stylized way, we generalize a threshold cascade model to a multiplex network in which nodes follow one of two response rules: some nodes activate when, in at least one layer, a large enough fraction of neighbors is active, while the other nodes activate when, in all layers, a large enough fraction of neighbors is active. Varying the fractions of nodes following either rule facilitates or inhibits cascades. Near the inhibition regime, global cascades appear discontinuously as the network density increases; however, the cascade grows more slowly over time. This behavior suggests a way in which various collective phenomena in the real world could appear abruptly yet slowly.

A cloud-based data network approach for translational cancer research.

PubMed

Xing, Wei; Tsoumakos, Dimitrios; Ghanem, Moustafa

2015-01-01

We develop a new model and associated technology for constructing and managing self-organizing data to support translational cancer research studies. We employ a semantic content network approach to address the challenges of managing cancer research data. Such data is heterogeneous, large, decentralized, growing and continually being updated. Moreover, the data originates from different information sources that may be partially overlapping, creating redundancies as well as contradictions and inconsistencies. Building on the advantages of elasticity of cloud computing, we deploy the cancer data networks on top of the CELAR Cloud platform to enable more effective processing and analysis of Big cancer data.

A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities

NASA Astrophysics Data System (ADS)

Muscoloni, Alessandro; Vittorio Cannistraci, Carlo

2018-05-01

The investigation of the hidden metric space behind complex network topologies is a fervid topic in current network science and the hyperbolic space is one of the most studied, because it seems associated to the structural organization of many real complex systems. The popularity-similarity-optimization (PSO) model simulates how random geometric graphs grow in the hyperbolic space, generating realistic networks with clustering, small-worldness, scale-freeness and rich-clubness. However, it misses to reproduce an important feature of real complex networks, which is the community organization. The geometrical-preferential-attachment (GPA) model was recently developed in order to confer to the PSO also a soft community structure, which is obtained by forcing different angular regions of the hyperbolic disk to have a variable level of attractiveness. However, the number and size of the communities cannot be explicitly controlled in the GPA, which is a clear limitation for real applications. Here, we introduce the nonuniform PSO (nPSO) model. Differently from GPA, the nPSO generates synthetic networks in the hyperbolic space where heterogeneous angular node attractiveness is forced by sampling the angular coordinates from a tailored nonuniform probability distribution (for instance a mixture of Gaussians). The nPSO differs from GPA in other three aspects: it allows one to explicitly fix the number and size of communities; it allows one to tune their mixing property by means of the network temperature; it is efficient to generate networks with high clustering. Several tests on the detectability of the community structure in nPSO synthetic networks and wide investigations on their structural properties confirm that the nPSO is a valid and efficient model to generate realistic complex networks with communities.

A Privacy Preservation Model for Health-Related Social Networking Sites.

PubMed

Li, Jingquan

2015-07-08

The increasing use of social networking sites (SNS) in health care has resulted in a growing number of individuals posting personal health information online. These sites may disclose users' health information to many different individuals and organizations and mine it for a variety of commercial and research purposes, yet the revelation of personal health information to unauthorized individuals or entities brings a concomitant concern of greater risk for loss of privacy among users. Many users join multiple social networks for different purposes and enter personal and other specific information covering social, professional, and health domains into other websites. Integration of multiple online and real social networks makes the users vulnerable to unintentional and intentional security threats and misuse. This paper analyzes the privacy and security characteristics of leading health-related SNS. It presents a threat model and identifies the most important threats to users and SNS providers. Building on threat analysis and modeling, this paper presents a privacy preservation model that incorporates individual self-protection and privacy-by-design approaches and uses the model to develop principles and countermeasures to protect user privacy. This study paves the way for analysis and design of privacy-preserving mechanisms on health-related SNS.

A Privacy Preservation Model for Health-Related Social Networking Sites

PubMed Central

2015-01-01

The increasing use of social networking sites (SNS) in health care has resulted in a growing number of individuals posting personal health information online. These sites may disclose users' health information to many different individuals and organizations and mine it for a variety of commercial and research purposes, yet the revelation of personal health information to unauthorized individuals or entities brings a concomitant concern of greater risk for loss of privacy among users. Many users join multiple social networks for different purposes and enter personal and other specific information covering social, professional, and health domains into other websites. Integration of multiple online and real social networks makes the users vulnerable to unintentional and intentional security threats and misuse. This paper analyzes the privacy and security characteristics of leading health-related SNS. It presents a threat model and identifies the most important threats to users and SNS providers. Building on threat analysis and modeling, this paper presents a privacy preservation model that incorporates individual self-protection and privacy-by-design approaches and uses the model to develop principles and countermeasures to protect user privacy. This study paves the way for analysis and design of privacy-preserving mechanisms on health-related SNS. PMID:26155953

The simultaneous evolution of author and paper networks

PubMed Central

Börner, Katy; Maru, Jeegar T.; Goldstone, Robert L.

2004-01-01

There has been a long history of research into the structure and evolution of mankind's scientific endeavor. However, recent progress in applying the tools of science to understand science itself has been unprecedented because only recently has there been access to high-volume and high-quality data sets of scientific output (e.g., publications, patents, grants) and computers and algorithms capable of handling this enormous stream of data. This article reviews major work on models that aim to capture and recreate the structure and dynamics of scientific evolution. We then introduce a general process model that simultaneously grows coauthor and paper citation networks. The statistical and dynamic properties of the networks generated by this model are validated against a 20-year data set of articles published in PNAS. Systematic deviations from a power law distribution of citations to papers are well fit by a model that incorporates a partitioning of authors and papers into topics, a bias for authors to cite recent papers, and a tendency for authors to cite papers cited by papers that they have read. In this TARL model (for topics, aging, and recursive linking), the number of topics is linearly related to the clustering coefficient of the simulated paper citation network. PMID:14976254

Chimera patterns in two-dimensional networks of coupled neurons.

PubMed

Schmidt, Alexander; Kasimatis, Theodoros; Hizanidis, Johanne; Provata, Astero; Hövel, Philipp

2017-03-01

We discuss synchronization patterns in networks of FitzHugh-Nagumo and leaky integrate-and-fire oscillators coupled in a two-dimensional toroidal geometry. A common feature between the two models is the presence of fast and slow dynamics, a typical characteristic of neurons. Earlier studies have demonstrated that both models when coupled nonlocally in one-dimensional ring networks produce chimera states for a large range of parameter values. In this study, we give evidence of a plethora of two-dimensional chimera patterns of various shapes, including spots, rings, stripes, and grids, observed in both models, as well as additional patterns found mainly in the FitzHugh-Nagumo system. Both systems exhibit multistability: For the same parameter values, different initial conditions give rise to different dynamical states. Transitions occur between various patterns when the parameters (coupling range, coupling strength, refractory period, and coupling phase) are varied. Many patterns observed in the two models follow similar rules. For example, the diameter of the rings grows linearly with the coupling radius.

Chimera patterns in two-dimensional networks of coupled neurons

NASA Astrophysics Data System (ADS)

Schmidt, Alexander; Kasimatis, Theodoros; Hizanidis, Johanne; Provata, Astero; Hövel, Philipp

2017-03-01

We discuss synchronization patterns in networks of FitzHugh-Nagumo and leaky integrate-and-fire oscillators coupled in a two-dimensional toroidal geometry. A common feature between the two models is the presence of fast and slow dynamics, a typical characteristic of neurons. Earlier studies have demonstrated that both models when coupled nonlocally in one-dimensional ring networks produce chimera states for a large range of parameter values. In this study, we give evidence of a plethora of two-dimensional chimera patterns of various shapes, including spots, rings, stripes, and grids, observed in both models, as well as additional patterns found mainly in the FitzHugh-Nagumo system. Both systems exhibit multistability: For the same parameter values, different initial conditions give rise to different dynamical states. Transitions occur between various patterns when the parameters (coupling range, coupling strength, refractory period, and coupling phase) are varied. Many patterns observed in the two models follow similar rules. For example, the diameter of the rings grows linearly with the coupling radius.

Self-organized network of fractal-shaped components coupled through statistical interaction.

PubMed

Ugajin, R

2001-09-01

A dissipative dynamics is introduced to generate self-organized networks of interacting objects, which we call coupled-fractal networks. The growth model is constructed based on a growth hypothesis in which the growth rate of each object is a product of the probability of receiving source materials from faraway and the probability of receiving adhesives from other grown objects, where each object grows to be a random fractal if isolated, but connects with others if glued. The network is governed by the statistical interaction between fractal-shaped components, which can only be identified in a statistical manner over ensembles. This interaction is investigated using the degree of correlation between fractal-shaped components, enabling us to determine whether it is attractive or repulsive.

Emergence of Soft Communities from Geometric Preferential Attachment

PubMed Central

Zuev, Konstantin; Boguñá, Marián; Bianconi, Ginestra; Krioukov, Dmitri

2015-01-01

All real networks are different, but many have some structural properties in common. There seems to be no consensus on what the most common properties are, but scale-free degree distributions, strong clustering, and community structure are frequently mentioned without question. Surprisingly, there exists no simple generative mechanism explaining all the three properties at once in growing networks. Here we show how latent network geometry coupled with preferential attachment of nodes to this geometry fills this gap. We call this mechanism geometric preferential attachment (GPA), and validate it against the Internet. GPA gives rise to soft communities that provide a different perspective on the community structure in networks. The connections between GPA and cosmological models, including inflation, are also discussed. PMID:25923110

Wild cricket social networks show stability across generations.

PubMed

Fisher, David N; Rodríguez-Muñoz, Rolando; Tregenza, Tom

2016-07-27

A central part of an animal's environment is its interactions with conspecifics. There has been growing interest in the potential to capture these interactions in the form of a social network. Such networks can then be used to examine how relationships among individuals affect ecological and evolutionary processes. However, in the context of selection and evolution, the utility of this approach relies on social network structures persisting across generations. This is an assumption that has been difficult to test because networks spanning multiple generations have not been available. We constructed social networks for six annual generations over a period of eight years for a wild population of the cricket Gryllus campestris. Through the use of exponential random graph models (ERGMs), we found that the networks in any given year were able to predict the structure of networks in other years for some network characteristics. The capacity of a network model of any given year to predict the networks of other years did not depend on how far apart those other years were in time. Instead, the capacity of a network model to predict the structure of a network in another year depended on the similarity in population size between those years. Our results indicate that cricket social network structure resists the turnover of individuals and is stable across generations. This would allow evolutionary processes that rely on network structure to take place. The influence of network size may indicate that scaling up findings on social behaviour from small populations to larger ones will be difficult. Our study also illustrates the utility of ERGMs for comparing networks, a task for which an effective approach has been elusive.

Smart social adaptation prevents catastrophic ecological regime shifts in networks of myopic harvesters

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Lucht, Wolfgang; Wiedermann, Marc; Heitzig, Jobst; Kurths, Jürgen

2015-04-01

In the anthropocene, the rise of global social and economic networks with ever increasing connectivity and speed of interactions, e.g., the internet or global financial markets, is a key challenge for sustainable development. The spread of opinions, values or technologies on these networks, in conjunction with the coevolution of the network structures themselves, underlies nexuses of current concern such as anthropogenic climate change, biodiversity loss or global land use change. To isolate and quantitatively study the effects and implications of network dynamics for sustainable development, we propose an agent-based model of information flow on adaptive networks between myopic harvesters that exploit private renewable resources. In this conceptual model of a network of socio-ecological systems, information on management practices flows between agents via boundedly rational imitation depending on the state of the resource stocks involved in an interaction. Agents can also adapt the structure of their social network locally by preferentially connecting to culturally similar agents with identical management practices and, at the same time, disconnecting from culturally dissimilar agents. Investigating in detail the statistical mechanics of this model, we find that an increasing rate of information flow through faster imitation dynamics or growing density of network connectivity leads to a marked increase in the likelihood of environmental resource collapse. However, we show that an optimal rate of social network adaptation can mitigate this negative effect without loss of social cohesion through network fragmentation. Our results highlight that seemingly immaterial network dynamics of spreading opinions or values can be of large relevance for the sustainable management of socio-ecological systems and suggest smartly conservative network adaptation as a strategy for mitigating environmental collapse. Hence, facing the great acceleration, these network dynamics should be more routinely incorporated in standard models of economic development or integrated assessment models used for evaluating anthropogenic climate change.

Organizational Analysis of the TIDES Project and the STAR-TIDES Network Using the 7-S Framework

DTIC Science & Technology

2013-04-01

data, provided some useful rec- ommendations.8 Since that time, TIDES has continued to grow and change. The present study was undertaken to update the...information across platforms and within the secure NDU network. For ex- ample, many contacts made by the Director are preserved within his Blackberry ...the active participation of STAR-TIDES network members, and to grow the network. 5. Skills Skills refers to the talents and abilities of the

Self-growing neural network architecture using crisp and fuzzy entropy

NASA Technical Reports Server (NTRS)

Cios, Krzysztof J.

1992-01-01

The paper briefly describes the self-growing neural network algorithm, CID2, which makes decision trees equivalent to hidden layers of a neural network. The algorithm generates a feedforward architecture using crisp and fuzzy entropy measures. The results of a real-life recognition problem of distinguishing defects in a glass ribbon and of a benchmark problem of differentiating two spirals are shown and discussed.

Self-growing neural network architecture using crisp and fuzzy entropy

NASA Technical Reports Server (NTRS)

Cios, Krzysztof J.

1992-01-01

The paper briefly describes the self-growing neural network algorithm, CID3, which makes decision trees equivalent to hidden layers of a neural network. The algorithm generates a feedforward architecture using crisp and fuzzy entropy measures. The results for a real-life recognition problem of distinguishing defects in a glass ribbon, and for a benchmark problen of telling two spirals apart are shown and discussed.

Emerging School Sport Development Policy, Practice and Governance in England: Big Society, Autonomy and Decentralisation

ERIC Educational Resources Information Center

Mackintosh, Chris; Liddle, Joyce

2015-01-01

International interest in developing mass sports participation through systems of school and community sports development has become a growing field of public leisure policy interest. This research paper considers the policy change from School Sport Partnerships to the new 2012 School Games model of networked partnerships to establish…

Paying Your Way to the Top: Search Engine Advertising.

ERIC Educational Resources Information Center

Scott, David M.

2003-01-01

Explains how organizations can buy listings on major Web search engines, making it the fastest growing form of advertising. Highlights include two network models, Google and Overture; bidding on phrases to buy as links to use with ads; ad ranking; benefits for small businesses; and paid listings versus regular search results. (LRW)

A multi-period capacitated school location problem with modular equipment and closest assignment considerations

NASA Astrophysics Data System (ADS)

Delmelle, Eric M.; Thill, Jean-Claude; Peeters, Dominique; Thomas, Isabelle

2014-07-01

In rapidly growing urban areas, it is deemed vital to expand (or contract) an existing network of public facilities to meet anticipated changes in the level of demand. We present a multi-period capacitated median model for school network facility location planning that minimizes transportation costs, while functional costs are subject to a budget constraint. The proposed Vintage Flexible Capacitated Location Problem (ViFCLP) has the flexibility to account for a minimum school-age closing requirement, while the maximum capacity of each school can be adjusted by the addition of modular units. Non-closest assignments are controlled by the introduction of a parameter penalizing excess travel. The applicability of the ViFCLP is illustrated on a large US school system (Charlotte-Mecklenburg, North Carolina) where high school demand is expected to grow faster with distance to the city center. Higher school capacities and greater penalty on travel impedance parameter reduce the number of non-closest assignments. The proposed model is beneficial to policy makers seeking to improve the provision and efficiency of public services over a multi-period planning horizon.

Enhancing End-to-End Performance of Information Services Over Ka-Band Global Satellite Networks

NASA Technical Reports Server (NTRS)

Bhasin, Kul B.; Glover, Daniel R.; Ivancic, William D.; vonDeak, Thomas C.

1997-01-01

The Internet has been growing at a rapid rate as the key medium to provide information services such as e-mail, WWW and multimedia etc., however its global reach is limited. Ka-band communication satellite networks are being developed to increase the accessibility of information services via the Internet at global scale. There is need to assess satellite networks in their ability to provide these services and interconnect seamlessly with existing and proposed terrestrial telecommunication networks. In this paper the significant issues and requirements in providing end-to-end high performance for the delivery of information services over satellite networks based on various layers in the OSI reference model are identified. Key experiments have been performed to evaluate the performance of digital video and Internet over satellite-like testbeds. The results of the early developments in ATM and TCP protocols over satellite networks are summarized.

BioTapestry now provides a web application and improved drawing and layout tools

PubMed Central

Paquette, Suzanne M.; Leinonen, Kalle; Longabaugh, William J.R.

2016-01-01

Gene regulatory networks (GRNs) control embryonic development, and to understand this process in depth, researchers need to have a detailed understanding of both the network architecture and its dynamic evolution over time and space. Interactive visualization tools better enable researchers to conceptualize, understand, and share GRN models. BioTapestry is an established application designed to fill this role, and recent enhancements released in Versions 6 and 7 have targeted two major facets of the program. First, we introduced significant improvements for network drawing and automatic layout that have now made it much easier for the user to create larger, more organized network drawings. Second, we revised the program architecture so it could continue to support the current Java desktop Editor program, while introducing a new BioTapestry GRN Viewer that runs as a JavaScript web application in a browser. We have deployed a number of GRN models using this new web application. These improvements will ensure that BioTapestry remains viable as a research tool in the face of the continuing evolution of web technologies, and as our understanding of GRN models grows. PMID:27134726

BioTapestry now provides a web application and improved drawing and layout tools.

PubMed

Paquette, Suzanne M; Leinonen, Kalle; Longabaugh, William J R

2016-01-01

Gene regulatory networks (GRNs) control embryonic development, and to understand this process in depth, researchers need to have a detailed understanding of both the network architecture and its dynamic evolution over time and space. Interactive visualization tools better enable researchers to conceptualize, understand, and share GRN models. BioTapestry is an established application designed to fill this role, and recent enhancements released in Versions 6 and 7 have targeted two major facets of the program. First, we introduced significant improvements for network drawing and automatic layout that have now made it much easier for the user to create larger, more organized network drawings. Second, we revised the program architecture so it could continue to support the current Java desktop Editor program, while introducing a new BioTapestry GRN Viewer that runs as a JavaScript web application in a browser. We have deployed a number of GRN models using this new web application. These improvements will ensure that BioTapestry remains viable as a research tool in the face of the continuing evolution of web technologies, and as our understanding of GRN models grows.

Toward a Whole-Cell Model of Ribosome Biogenesis: Kinetic Modeling of SSU Assembly

PubMed Central

Earnest, Tyler M.; Lai, Jonathan; Chen, Ke; Hallock, Michael J.; Williamson, James R.; Luthey-Schulten, Zaida

2015-01-01

Central to all life is the assembly of the ribosome: a coordinated process involving the hierarchical association of ribosomal proteins to the RNAs forming the small and large ribosomal subunits. The process is further complicated by effects arising from the intracellular heterogeneous environment and the location of ribosomal operons within the cell. We provide a simplified model of ribosome biogenesis in slow-growing Escherichia coli. Kinetic models of in vitro small-subunit reconstitution at the level of individual protein/ribosomal RNA interactions are developed for two temperature regimes. The model at low temperatures predicts the existence of a novel 5′→3′→central assembly pathway, which we investigate further using molecular dynamics. The high-temperature assembly network is incorporated into a model of in vivo ribosome biogenesis in slow-growing E. coli. The model, described in terms of reaction-diffusion master equations, contains 1336 reactions and 251 species that dynamically couple transcription and translation to ribosome assembly. We use the Lattice Microbes software package to simulate the stochastic production of mRNA, proteins, and ribosome intermediates over a full cell cycle of 120 min. The whole-cell model captures the correct growth rate of ribosomes, predicts the localization of early assembly intermediates to the nucleoid region, and reproduces the known assembly timescales for the small subunit with no modifications made to the embedded in vitro assembly network. PMID:26333594

Characterization of topological structure on complex networks.

PubMed

Nakamura, Ikuo

2003-10-01

Characterizing the topological structure of complex networks is a significant problem especially from the viewpoint of data mining on the World Wide Web. "Page rank" used in the commercial search engine Google is such a measure of authority to rank all the nodes matching a given query. We have investigated the page-rank distribution of the real Web and a growing network model, both of which have directed links and exhibit a power law distributions of in-degree (the number of incoming links to the node) and out-degree (the number of outgoing links from the node), respectively. We find a concentration of page rank on a small number of nodes and low page rank on high degree regimes in the real Web, which can be explained by topological properties of the network, e.g., network motifs, and connectivities of nearest neighbors.

Joint space-time geostatistical model for air quality surveillance

NASA Astrophysics Data System (ADS)

Russo, A.; Soares, A.; Pereira, M. J.

2009-04-01

Air pollution and peoples' generalized concern about air quality are, nowadays, considered to be a global problem. Although the introduction of rigid air pollution regulations has reduced pollution from industry and power stations, the growing number of cars on the road poses a new pollution problem. Considering the characteristics of the atmospheric circulation and also the residence times of certain pollutants in the atmosphere, a generalized and growing interest on air quality issues led to research intensification and publication of several articles with quite different levels of scientific depth. As most natural phenomena, air quality can be seen as a space-time process, where space-time relationships have usually quite different characteristics and levels of uncertainty. As a result, the simultaneous integration of space and time is not an easy task to perform. This problem is overcome by a variety of methodologies. The use of stochastic models and neural networks to characterize space-time dispersion of air quality is becoming a common practice. The main objective of this work is to produce an air quality model which allows forecasting critical concentration episodes of a certain pollutant by means of a hybrid approach, based on the combined use of neural network models and stochastic simulations. A stochastic simulation of the spatial component with a space-time trend model is proposed to characterize critical situations, taking into account data from the past and a space-time trend from the recent past. To identify near future critical episodes, predicted values from neural networks are used at each monitoring station. In this paper, we describe the design of a hybrid forecasting tool for ambient NO2 concentrations in Lisbon, Portugal.

How does personality matter? An investigation of the impact of extraversion on individuals' SNS use.

PubMed

Deng, Shengli; Liu, Yong; Li, Hongxiu; Hu, Feng

2013-08-01

The fast proliferation of social networking sites (SNS) offers Internet users new possibilities for developing and maintaining their social network. Despite a growing interest in SNS, less research attention has been paid to SNS usage from the perspective of personality, that is, the Big Five personality traits. This study develops a model to elucidate how extraversion, an important dimension of personality, affects the perceptions of SNS users and their continuance intention. The research model is empirically tested with answers gained from 221 usable questionnaires. The results indicate that extraversion positively affects perceived satisfaction, supplementary entertainment, and critical mass directly, and indirectly influences both playfulness and SNS continuance intention.

Recognition of handwritten similar Chinese characters by self-growing probabilistic decision-based neural network.

PubMed

Fu, H C; Xu, Y Y; Chang, H Y

1999-12-01

Recognition of similar (confusion) characters is a difficult problem in optical character recognition (OCR). In this paper, we introduce a neural network solution that is capable of modeling minor differences among similar characters, and is robust to various personal handwriting styles. The Self-growing Probabilistic Decision-based Neural Network (SPDNN) is a probabilistic type neural network, which adopts a hierarchical network structure with nonlinear basis functions and a competitive credit-assignment scheme. Based on the SPDNN model, we have constructed a three-stage recognition system. First, a coarse classifier determines a character to be input to one of the pre-defined subclasses partitioned from a large character set, such as Chinese mixed with alphanumerics. Then a character recognizer determines the input image which best matches the reference character in the subclass. Lastly, the third module is a similar character recognizer, which can further enhance the recognition accuracy among similar or confusing characters. The prototype system has demonstrated a successful application of SPDNN to similar handwritten Chinese recognition for the public database CCL/HCCR1 (5401 characters x200 samples). Regarding performance, experiments on the CCL/HCCR1 database produced 90.12% recognition accuracy with no rejection, and 94.11% accuracy with 6.7% rejection, respectively. This recognition accuracy represents about 4% improvement on the previously announced performance. As to processing speed, processing before recognition (including image preprocessing, segmentation, and feature extraction) requires about one second for an A4 size character image, and recognition consumes approximately 0.27 second per character on a Pentium-100 based personal computer, without use of any hardware accelerator or co-processor.

The Topology of the Growing Human Interactome Data.

PubMed

Janjić, Vuk; Pržulj, Nataša

2014-06-01

We have long moved past the one-gene-one-function concept originally proposed by Beadle and Tatum back in 1941; but the full understanding of genotype-phenotype relations still largely relies on the analysis of static, snapshot-like, interaction data sets. Here, we look at what global patterns can be uncovered if we simply trace back the human interactome network over the last decade of protein-protein interaction (PPI) screening. We take a purely topological approach and find that as the human interactome is getting denser, it is not only gaining in structure (in terms of now being better fit by structured network models than before), but also there are patterns in the way in which it is growing: (a) newly added proteins tend to get linked to existing proteins in the interactome that are not know to interact; and (b) new proteins tend to link to already well connected proteins. Moreover, the alignment between human and yeast interactomes spanning over 40% of yeast's proteins - that are involved in regulation of transcription, RNA splicing and other cellcycle- related processes-suggests the existence of a part of the interactome which remains topologically and functionally unaffected through evolution. Furthermore, we find a small sub-network, specific to the "core" of the human interactome and involved in regulation of transcription and cancer development, whose wiring has not changed within the human interactome over the last 10 years of interacome data acquisition. Finally, we introduce a generalisation of the clustering coefficient of a network as a new measure called the cycle coefficient, and use it to show that PPI networks of human and model organisms are wired in a tight way which forbids the occurrence large cycles.

The topology of the growing human interactome data.

PubMed

Janjić, Vuk; Pržulj, Nataša

2014-06-23

We have long moved past the one-gene–one-function concept originally proposed by Beadle and Tatum back in 1941; but the full understanding of genotype–phenotype relations still largely relies on the analysis of static, snapshot-like, interaction data sets. Here, we look at what global patterns can be uncovered if we simply trace back the human interactome network over the last decade of protein- protein interaction (PPI) screening. We take a purely topological approach and find that as the human interactome is getting denser, it is not only gaining in structure (in terms of now being better fit by structured network models than before), but also there are patterns in the way in which it is growing: (a) newly added proteins tend to get linked to existing proteins in the interactome that are not know to interact; and (b) new proteins tend to link to already well connected proteins. Moreover, the alignment between human and yeast interactomes spanning over 40% of yeast’s proteins — that are involved in regulation of transcription, RNA splicing and other cellcycle-related processes—suggests the existence of a part of the interactome which remains topologically and functionally unaffected through evolution. Furthermore, we find a small sub-network, specific to the “core” of the human interactome and involved in regulation of transcription and cancer development, whose wiring has not changed within the human interactome over the last 10 years of interacome data acquisition. Finally, we introduce a generalisation of the clustering coefficient of a network as a new measure called the cycle coefficient, and use it to show that PPI networks of human and model organisms are wired in a tight way which forbids the occurrence large cycles.

Energy efficient flexible hybrid wavelength division multiplexing-time division multiplexing passive optical network with pay as you grow deployment

NASA Astrophysics Data System (ADS)

Garg, Amit Kumar; Madavi, Amresh Ashok; Janyani, Vijay

2017-02-01

A flexible hybrid wavelength division multiplexing-time division multiplexing passive optical network architecture that allows dual rate signals to be sent at 1 and 10 Gbps to each optical networking unit depending upon the traffic load is proposed. The proposed design allows dynamic wavelength allocation with pay-as-you-grow deployment capability. This architecture is capable of providing up to 40 Gbps of equal data rates to all optical distribution networks (ODNs) and up to 70 Gbps of a asymmetrical data rate to the specific ODN. The proposed design handles broadcasting capability with simultaneous point-to-point transmission, which further reduces energy consumption. In this architecture, each module sends a wavelength to each ODN, thus making the architecture fully flexible; this flexibility allows network providers to use only required OLT components and switch off others. The design is also reliable to any module or TRx failure and provides services without any service disruption. Dynamic wavelength allocation and pay-as-you-grow deployment support network extensibility and bandwidth scalability to handle future generation access networks.

Measuring and modeling correlations in multiplex networks.

PubMed

Nicosia, Vincenzo; Latora, Vito

2015-09-01

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

Quantum networks in divergence-free circuit QED

NASA Astrophysics Data System (ADS)

Parra-Rodriguez, A.; Rico, E.; Solano, E.; Egusquiza, I. L.

2018-04-01

Superconducting circuits are one of the leading quantum platforms for quantum technologies. With growing system complexity, it is of crucial importance to develop scalable circuit models that contain the minimum information required to predict the behaviour of the physical system. Based on microwave engineering methods, divergent and non-divergent Hamiltonian models in circuit quantum electrodynamics have been proposed to explain the dynamics of superconducting quantum networks coupled to infinite-dimensional systems, such as transmission lines and general impedance environments. Here, we study systematically common linear coupling configurations between networks and infinite-dimensional systems. The main result is that the simple Lagrangian models for these configurations present an intrinsic natural length that provides a natural ultraviolet cutoff. This length is due to the unavoidable dressing of the environment modes by the network. In this manner, the coupling parameters between their components correctly manifest their natural decoupling at high frequencies. Furthermore, we show the requirements to correctly separate infinite-dimensional coupled systems in local bases. We also compare our analytical results with other analytical and approximate methods available in the literature. Finally, we propose several applications of these general methods to analogue quantum simulation of multi-spin-boson models in non-perturbative coupling regimes.

An evolving model for the lodging-service network in a tourism destination

NASA Astrophysics Data System (ADS)

Hernández, Juan M.; González-Martel, Christian

2017-09-01

Tourism is a complex dynamic system including multiple actors which are related each other composing an evolving social network. This paper presents a growing model that explains how part of the supply components in a tourism system forms a social network. Specifically, the lodgings and services in a destination are the network nodes and a link between them appears if a representative tourist hosted in the lodging visits/consumes the service during his/her stay. The specific link between both categories are determined by a random and preferential attachment rule. The analytic results show that the long-term degree distribution of services follows a shifted power-law distribution. The numerical simulations show slight disagreements with the theoretical results in the case of the one-mode degree distribution of services, due to the low order of convergence to zero of X-motifs. The model predictions are compared with real data coming from a popular tourist destination in Gran Canaria, Spain, showing a good agreement between analytical and empirical data for the degree distribution of services. The theoretical model was validated assuming four type of perturbations in the real data.

Coupling effect of nodes popularity and similarity on social network persistence

PubMed Central

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-01-01

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology. PMID:28220840

Coupling effect of nodes popularity and similarity on social network persistence

NASA Astrophysics Data System (ADS)

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-01

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

Coupling effect of nodes popularity and similarity on social network persistence.

PubMed

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-21

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes' popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

Synchronization in a noise-driven developing neural network

NASA Astrophysics Data System (ADS)

Lin, I.-H.; Wu, R.-K.; Chen, C.-M.

2011-11-01

We use computer simulations to investigate the structural and dynamical properties of a developing neural network whose activity is driven by noise. Structurally, the constructed neural networks in our simulations exhibit the small-world properties that have been observed in several neural networks. The dynamical change of neuronal membrane potential is described by the Hodgkin-Huxley model, and two types of learning rules, including spike-timing-dependent plasticity (STDP) and inverse STDP, are considered to restructure the synaptic strength between neurons. Clustered synchronized firing (SF) of the network is observed when the network connectivity (number of connections/maximal connections) is about 0.75, in which the firing rate of neurons is only half of the network frequency. At the connectivity of 0.86, all neurons fire synchronously at the network frequency. The network SF frequency increases logarithmically with the culturing time of a growing network and decreases exponentially with the delay time in signal transmission. These conclusions are consistent with experimental observations. The phase diagrams of SF in a developing network are investigated for both learning rules.

Structural Synaptic Plasticity Has High Memory Capacity and Can Explain Graded Amnesia, Catastrophic Forgetting, and the Spacing Effect

PubMed Central

Knoblauch, Andreas; Körner, Edgar; Körner, Ursula; Sommer, Friedrich T.

2014-01-01

Although already William James and, more explicitly, Donald Hebb's theory of cell assemblies have suggested that activity-dependent rewiring of neuronal networks is the substrate of learning and memory, over the last six decades most theoretical work on memory has focused on plasticity of existing synapses in prewired networks. Research in the last decade has emphasized that structural modification of synaptic connectivity is common in the adult brain and tightly correlated with learning and memory. Here we present a parsimonious computational model for learning by structural plasticity. The basic modeling units are “potential synapses” defined as locations in the network where synapses can potentially grow to connect two neurons. This model generalizes well-known previous models for associative learning based on weight plasticity. Therefore, existing theory can be applied to analyze how many memories and how much information structural plasticity can store in a synapse. Surprisingly, we find that structural plasticity largely outperforms weight plasticity and can achieve a much higher storage capacity per synapse. The effect of structural plasticity on the structure of sparsely connected networks is quite intuitive: Structural plasticity increases the “effectual network connectivity”, that is, the network wiring that specifically supports storage and recall of the memories. Further, this model of structural plasticity produces gradients of effectual connectivity in the course of learning, thereby explaining various cognitive phenomena including graded amnesia, catastrophic forgetting, and the spacing effect. PMID:24858841

QoS prediction for web services based on user-trust propagation model

NASA Astrophysics Data System (ADS)

Thinh, Le-Van; Tu, Truong-Dinh

2017-10-01

There is an important online role for Web service providers and users; however, the rapidly growing number of service providers and users, it can create some similar functions among web services. This is an exciting area for research, and researchers seek to to propose solutions for the best service to users. Collaborative filtering (CF) algorithms are widely used in recommendation systems, although these are less effective for cold-start users. Recently, some recommender systems have been developed based on social network models, and the results show that social network models have better performance in terms of CF, especially for cold-start users. However, most social network-based recommendations do not consider the user's mood. This is a hidden source of information, and is very useful in improving prediction efficiency. In this paper, we introduce a new model called User-Trust Propagation (UTP). The model uses a combination of trust and the mood of users to predict the QoS value and matrix factorisation (MF), which is used to train the model. The experimental results show that the proposed model gives better accuracy than other models, especially for the cold-start problem.

Towards Resilient Critical Infrastructures: Application of Type-2 Fuzzy Logic in Embedded Network Security Cyber Sensor

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

Ondrej Linda; Todd Vollmer; Jim Alves-Foss

2011-08-01

Resiliency and cyber security of modern critical infrastructures is becoming increasingly important with the growing number of threats in the cyber-environment. This paper proposes an extension to a previously developed fuzzy logic based anomaly detection network security cyber sensor via incorporating Type-2 Fuzzy Logic (T2 FL). In general, fuzzy logic provides a framework for system modeling in linguistic form capable of coping with imprecise and vague meanings of words. T2 FL is an extension of Type-1 FL which proved to be successful in modeling and minimizing the effects of various kinds of dynamic uncertainties. In this paper, T2 FL providesmore » a basis for robust anomaly detection and cyber security state awareness. In addition, the proposed algorithm was specifically developed to comply with the constrained computational requirements of low-cost embedded network security cyber sensors. The performance of the system was evaluated on a set of network data recorded from an experimental cyber-security test-bed.« less

Discovering relevance knowledge in data: a growing cell structures approach.

PubMed

Azuaje, F; Dubitzky, W; Black, N; Adamson, K

2000-01-01

Both information retrieval and case-based reasoning systems rely on effective and efficient selection of relevant data. Typically, relevance in such systems is approximated by similarity or indexing models. However, the definition of what makes data items similar or how they should be indexed is often nontrivial and time-consuming. Based on growing cell structure artificial neural networks, this paper presents a method that automatically constructs a case retrieval model from existing data. Within the case-based reasoning (CBR) framework, the method is evaluated for two medical prognosis tasks, namely, colorectal cancer survival and coronary heart disease risk prognosis. The results of the experiments suggest that the proposed method is effective and robust. To gain a deeper insight and understanding of the underlying mechanisms of the proposed model, a detailed empirical analysis of the models structural and behavioral properties is also provided.

Zero Pearson coefficient for strongly correlated growing trees

NASA Astrophysics Data System (ADS)

Dorogovtsev, S. N.; Ferreira, A. L.; Goltsev, A. V.; Mendes, J. F. F.

2010-03-01

We obtained Pearson’s coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by m edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees (m=1) . If the number of connections of new vertices exceeds one (m>1) , then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent γ does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow power-law-like approach to an infinite network limit. Our findings indicate that Pearson’s coefficient strongly depends on size and details of networks, which makes this characteristic virtually useless for quantitative comparison of different networks.

Zero Pearson coefficient for strongly correlated growing trees.

PubMed

Dorogovtsev, S N; Ferreira, A L; Goltsev, A V; Mendes, J F F

2010-03-01

We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by m edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees (m=1). If the number of connections of new vertices exceeds one (m>1), then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent gamma does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow power-law-like approach to an infinite network limit. Our findings indicate that Pearson's coefficient strongly depends on size and details of networks, which makes this characteristic virtually useless for quantitative comparison of different networks.

Inter-organizational network in Indonesia during disasters: Examples and research agenda on disaster management

NASA Astrophysics Data System (ADS)

Bisri, M. B. F.

2017-02-01

Indonesia is facing various type of disaster risks, each with its own nature (sudden or slow onset, purely natural or man-made) and coverage of affected areas. Whereas science, technology and engineering intervention requires different modalities for each hazard, little has been known on whether the institutional setup and organizations involvement requires a different or similar types of intervention. Under a decentralized disaster management system, potential involvement of international organizations in response and growing diversified organizations involved in responding to disaster, it is important to understand the nature of inter-organizational network during various type of disasters in Indonesia. This paper is mixture of in-depth literature review and multiple case studies on utilization of social network analysis (SNA) in modelling inter-organizational network during various disasters in Indonesia.

A service-oriented architecture for integrating the modeling and formal verification of genetic regulatory networks

PubMed Central

2009-01-01

Background The study of biological networks has led to the development of increasingly large and detailed models. Computer tools are essential for the simulation of the dynamical behavior of the networks from the model. However, as the size of the models grows, it becomes infeasible to manually verify the predictions against experimental data or identify interesting features in a large number of simulation traces. Formal verification based on temporal logic and model checking provides promising methods to automate and scale the analysis of the models. However, a framework that tightly integrates modeling and simulation tools with model checkers is currently missing, on both the conceptual and the implementational level. Results We have developed a generic and modular web service, based on a service-oriented architecture, for integrating the modeling and formal verification of genetic regulatory networks. The architecture has been implemented in the context of the qualitative modeling and simulation tool GNA and the model checkers NUSMV and CADP. GNA has been extended with a verification module for the specification and checking of biological properties. The verification module also allows the display and visual inspection of the verification results. Conclusions The practical use of the proposed web service is illustrated by means of a scenario involving the analysis of a qualitative model of the carbon starvation response in E. coli. The service-oriented architecture allows modelers to define the model and proceed with the specification and formal verification of the biological properties by means of a unified graphical user interface. This guarantees a transparent access to formal verification technology for modelers of genetic regulatory networks. PMID:20042075

Effects of rewiring strategies on information spreading in complex dynamic networks

NASA Astrophysics Data System (ADS)

Ally, Abdulla F.; Zhang, Ning

2018-04-01

Recent advances in networks and communication services have attracted much interest to understand information spreading in social networks. Consequently, numerous studies have been devoted to provide effective and accurate models for mimicking information spreading. However, knowledge on how to spread information faster and more widely remains a contentious issue. Yet, most existing works are based on static networks which limit the reality of dynamism of entities that participate in information spreading. Using the SIR epidemic model, this study explores and compares effects of two rewiring models (Fermi-Dirac and Linear functions) on information spreading in scale free and small world networks. Our results show that for all the rewiring strategies, the spreading influence replenishes with time but stabilizes in a steady state at later time-steps. This means that information spreading takes-off during the initial spreading steps, after which the spreading prevalence settles toward its equilibrium, with majority of the population having recovered and thus, no longer affecting the spreading. Meanwhile, rewiring strategy based on Fermi-Dirac distribution function in one way or another impedes the spreading process, however, the structure of the networks mimic the spreading, even with a low spreading rate. The worst case can be when the spreading rate is extremely small. The results emphasize that despite a big role of such networks in mimicking the spreading, the role of the parameters cannot be simply ignored. Apparently, the probability of giant degree neighbors being informed grows much faster with the rewiring strategy of linear function compared to that of Fermi-Dirac distribution function. Clearly, rewiring model based on linear function generates the fastest spreading across the networks. Therefore, if we are interested in speeding up the spreading process in stochastic modeling, linear function may play a pivotal role.

Modeling of price and profit in coupled-ring networks

NASA Astrophysics Data System (ADS)

Tangmongkollert, Kittiwat; Suwanna, Sujin

2016-06-01

We study the behaviors of magnetization, price, and profit profiles in ring networks in the presence of the external magnetic field. The Ising model is used to determine the state of each node, which is mapped to the buy-or-sell state in a financial market, where +1 is identified as the buying state, and -1 as the selling state. Price and profit mechanisms are modeled based on the assumption that price should increase if demand is larger than supply, and it should decrease otherwise. We find that the magnetization can be induced between two rings via coupling links, where the induced magnetization strength depends on the number of the coupling links. Consequently, the price behaves linearly with time, where its rate of change depends on the magnetization. The profit grows like a quadratic polynomial with coefficients dependent on the magnetization. If two rings have opposite direction of net spins, the price flows in the direction of the majority spins, and the network with the minority spins gets a loss in profit.

Dendritic network models: Improving isoscapes and quantifying influence of landscape and in-stream processes on strontium isotopes in rivers

USGS Publications Warehouse

Brennan, Sean R.; Torgersen, Christian E.; Hollenbeck, Jeff P.; Fernandez, Diego P.; Jensen, Carrie K; Schindler, Daniel E.

2016-01-01

A critical challenge for the Earth sciences is to trace the transport and flux of matter within and among aquatic, terrestrial, and atmospheric systems. Robust descriptions of isotopic patterns across space and time, called “isoscapes,” form the basis of a rapidly growing and wide-ranging body of research aimed at quantifying connectivity within and among Earth's systems. However, isoscapes of rivers have been limited by conventional Euclidean approaches in geostatistics and the lack of a quantitative framework to apportion the influence of processes driven by landscape features versus in-stream phenomena. Here we demonstrate how dendritic network models substantially improve the accuracy of isoscapes of strontium isotopes and partition the influence of hydrologic transport versus local geologic features on strontium isotope ratios in a large Alaska river. This work illustrates the analytical power of dendritic network models for the field of isotope biogeochemistry, particularly for provenance studies of modern and ancient animals.

Multidimensional Convergence in Future 5G Networks

NASA Astrophysics Data System (ADS)

Ruffini, Marco

2017-02-01

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

Modeling Women's Menstrual Cycles using PICI Gates in Bayesian Network.

PubMed

Zagorecki, Adam; Łupińska-Dubicka, Anna; Voortman, Mark; Druzdzel, Marek J

2016-03-01

A major difficulty in building Bayesian network (BN) models is the size of conditional probability tables, which grow exponentially in the number of parents. One way of dealing with this problem is through parametric conditional probability distributions that usually require only a number of parameters that is linear in the number of parents. In this paper, we introduce a new class of parametric models, the Probabilistic Independence of Causal Influences (PICI) models, that aim at lowering the number of parameters required to specify local probability distributions, but are still capable of efficiently modeling a variety of interactions. A subset of PICI models is decomposable and this leads to significantly faster inference as compared to models that cannot be decomposed. We present an application of the proposed method to learning dynamic BNs for modeling a woman's menstrual cycle. We show that PICI models are especially useful for parameter learning from small data sets and lead to higher parameter accuracy than when learning CPTs.

Transcriptional network control of normal and leukaemic haematopoiesis

PubMed Central

Sive, Jonathan I.; Göttgens, Berthold

2014-01-01

Transcription factors (TFs) play a key role in determining the gene expression profiles of stem/progenitor cells, and defining their potential to differentiate into mature cell lineages. TF interactions within gene-regulatory networks are vital to these processes, and dysregulation of these networks by TF overexpression, deletion or abnormal gene fusions have been shown to cause malignancy. While investigation of these processes remains a challenge, advances in genome-wide technologies and growing interactions between laboratory and computational science are starting to produce increasingly accurate network models. The haematopoietic system provides an attractive experimental system to elucidate gene regulatory mechanisms, and allows experimental investigation of both normal and dysregulated networks. In this review we examine the principles of TF-controlled gene regulatory networks and the key experimental techniques used to investigate them. We look in detail at examples of how these approaches can be used to dissect out the regulatory mechanisms controlling normal haematopoiesis, as well as the dysregulated networks associated with haematological malignancies. PMID:25014893

Transcriptional network control of normal and leukaemic haematopoiesis.

PubMed

Sive, Jonathan I; Göttgens, Berthold

2014-12-10

Transcription factors (TFs) play a key role in determining the gene expression profiles of stem/progenitor cells, and defining their potential to differentiate into mature cell lineages. TF interactions within gene-regulatory networks are vital to these processes, and dysregulation of these networks by TF overexpression, deletion or abnormal gene fusions have been shown to cause malignancy. While investigation of these processes remains a challenge, advances in genome-wide technologies and growing interactions between laboratory and computational science are starting to produce increasingly accurate network models. The haematopoietic system provides an attractive experimental system to elucidate gene regulatory mechanisms, and allows experimental investigation of both normal and dysregulated networks. In this review we examine the principles of TF-controlled gene regulatory networks and the key experimental techniques used to investigate them. We look in detail at examples of how these approaches can be used to dissect out the regulatory mechanisms controlling normal haematopoiesis, as well as the dysregulated networks associated with haematological malignancies. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.

Direct2Experts: a pilot national network to demonstrate interoperability among research-networking platforms

PubMed Central

Barnett, William; Conlon, Mike; Eichmann, David; Kibbe, Warren; Falk-Krzesinski, Holly; Halaas, Michael; Johnson, Layne; Meeks, Eric; Mitchell, Donald; Schleyer, Titus; Stallings, Sarah; Warden, Michael; Kahlon, Maninder

2011-01-01

Research-networking tools use data-mining and social networking to enable expertise discovery, matchmaking and collaboration, which are important facets of team science and translational research. Several commercial and academic platforms have been built, and many institutions have deployed these products to help their investigators find local collaborators. Recent studies, though, have shown the growing importance of multiuniversity teams in science. Unfortunately, the lack of a standard data-exchange model and resistance of universities to share information about their faculty have presented barriers to forming an institutionally supported national network. This case report describes an initiative, which, in only 6 months, achieved interoperability among seven major research-networking products at 28 universities by taking an approach that focused on addressing institutional concerns and encouraging their participation. With this necessary groundwork in place, the second phase of this effort can begin, which will expand the network's functionality and focus on the end users. PMID:22037890

Network Hardware Virtualization for Application Provisioning in Core Networks

DOE PAGES

Gumaste, Ashwin; Das, Tamal; Khandwala, Kandarp; ...

2017-02-03

We present that service providers and vendors are moving toward a network virtualized core, whereby multiple applications would be treated on their own merit in programmable hardware. Such a network would have the advantage of being customized for user requirements and allow provisioning of next generation services that are built specifically to meet user needs. In this article, we articulate the impact of network virtualization on networks that provide customized services and how a provider's business can grow with network virtualization. We outline a decision map that allows mapping of applications with technology that is supported in network-virtualization - orientedmore » equipment. Analogies to the world of virtual machines and generic virtualization show that hardware supporting network virtualization will facilitate new customer needs while optimizing the provider network from the cost and performance perspectives. A key conclusion of the article is that growth would yield sizable revenue when providers plan ahead in terms of supporting network-virtualization-oriented technology in their networks. To be precise, providers have to incorporate into their growth plans network elements capable of new service deployments while protecting network neutrality. Finally, a simulation study validates our NV-induced model.« less

Network Hardware Virtualization for Application Provisioning in Core Networks

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

Gumaste, Ashwin; Das, Tamal; Khandwala, Kandarp

We present that service providers and vendors are moving toward a network virtualized core, whereby multiple applications would be treated on their own merit in programmable hardware. Such a network would have the advantage of being customized for user requirements and allow provisioning of next generation services that are built specifically to meet user needs. In this article, we articulate the impact of network virtualization on networks that provide customized services and how a provider's business can grow with network virtualization. We outline a decision map that allows mapping of applications with technology that is supported in network-virtualization - orientedmore » equipment. Analogies to the world of virtual machines and generic virtualization show that hardware supporting network virtualization will facilitate new customer needs while optimizing the provider network from the cost and performance perspectives. A key conclusion of the article is that growth would yield sizable revenue when providers plan ahead in terms of supporting network-virtualization-oriented technology in their networks. To be precise, providers have to incorporate into their growth plans network elements capable of new service deployments while protecting network neutrality. Finally, a simulation study validates our NV-induced model.« less

Complex networks as an emerging property of hierarchical preferential attachment.

PubMed

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

2015-12-01

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

Complex networks as an emerging property of hierarchical preferential attachment

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Alternative steady states in ecological networks

NASA Astrophysics Data System (ADS)

Fried, Yael; Shnerb, Nadav M.; Kessler, David A.

2017-07-01

In many natural situations, one observes a local system with many competing species that is coupled by weak immigration to a regional species pool. The dynamics of such a system is dominated by its stable and uninvadable (SU) states. When the competition matrix is random, the number of SUs depends on the average value and variance of its entries. Here we consider the problem in the limit of weak competition and large variance. Using a yes-no interaction model, we show that the number of SUs corresponds to the number of maximum cliques in an Erdös-Rényi network. The number of SUs grows exponentially with the number of species in this limit, unless the network is completely asymmetric. In the asymmetric limit, the number of SUs is O (1 ) . Numerical simulations suggest that these results are valid for models with a continuous distribution of competition terms.

Epidemic spreading with activity-driven awareness diffusion on multiplex network.

PubMed

Guo, Quantong; Lei, Yanjun; Jiang, Xin; Ma, Yifang; Huo, Guanying; Zheng, Zhiming

2016-04-01

There has been growing interest in exploring the interplay between epidemic spreading with human response, since it is natural for people to take various measures when they become aware of epidemics. As a proper way to describe the multiple connections among people in reality, multiplex network, a set of nodes interacting through multiple sets of edges, has attracted much attention. In this paper, to explore the coupled dynamical processes, a multiplex network with two layers is built. Specifically, the information spreading layer is a time varying network generated by the activity driven model, while the contagion layer is a static network. We extend the microscopic Markov chain approach to derive the epidemic threshold of the model. Compared with extensive Monte Carlo simulations, the method shows high accuracy for the prediction of the epidemic threshold. Besides, taking different spreading models of awareness into consideration, we explored the interplay between epidemic spreading with awareness spreading. The results show that the awareness spreading can not only enhance the epidemic threshold but also reduce the prevalence of epidemics. When the spreading of awareness is defined as susceptible-infected-susceptible model, there exists a critical value where the dynamical process on the awareness layer can control the onset of epidemics; while if it is a threshold model, the epidemic threshold emerges an abrupt transition with the local awareness ratio α approximating 0.5. Moreover, we also find that temporal changes in the topology hinder the spread of awareness which directly affect the epidemic threshold, especially when the awareness layer is threshold model. Given that the threshold model is a widely used model for social contagion, this is an important and meaningful result. Our results could also lead to interesting future research about the different time-scales of structural changes in multiplex networks.

Epidemic spreading with activity-driven awareness diffusion on multiplex network

NASA Astrophysics Data System (ADS)

Guo, Quantong; Lei, Yanjun; Jiang, Xin; Ma, Yifang; Huo, Guanying; Zheng, Zhiming

2016-04-01

There has been growing interest in exploring the interplay between epidemic spreading with human response, since it is natural for people to take various measures when they become aware of epidemics. As a proper way to describe the multiple connections among people in reality, multiplex network, a set of nodes interacting through multiple sets of edges, has attracted much attention. In this paper, to explore the coupled dynamical processes, a multiplex network with two layers is built. Specifically, the information spreading layer is a time varying network generated by the activity driven model, while the contagion layer is a static network. We extend the microscopic Markov chain approach to derive the epidemic threshold of the model. Compared with extensive Monte Carlo simulations, the method shows high accuracy for the prediction of the epidemic threshold. Besides, taking different spreading models of awareness into consideration, we explored the interplay between epidemic spreading with awareness spreading. The results show that the awareness spreading can not only enhance the epidemic threshold but also reduce the prevalence of epidemics. When the spreading of awareness is defined as susceptible-infected-susceptible model, there exists a critical value where the dynamical process on the awareness layer can control the onset of epidemics; while if it is a threshold model, the epidemic threshold emerges an abrupt transition with the local awareness ratio α approximating 0.5. Moreover, we also find that temporal changes in the topology hinder the spread of awareness which directly affect the epidemic threshold, especially when the awareness layer is threshold model. Given that the threshold model is a widely used model for social contagion, this is an important and meaningful result. Our results could also lead to interesting future research about the different time-scales of structural changes in multiplex networks.

A complex speciation–richness relationship in a simple neutral model

PubMed Central

Desjardins-Proulx, Philippe; Gravel, Dominique

2012-01-01

Speciation is the “elephant in the room” of community ecology. As the ultimate source of biodiversity, its integration in ecology's theoretical corpus is necessary to understand community assembly. Yet, speciation is often completely ignored or stripped of its spatial dimension. Recent approaches based on network theory have allowed ecologists to effectively model complex landscapes. In this study, we use this framework to model allopatric and parapatric speciation in networks of communities. We focus on the relationship between speciation, richness, and the spatial structure of communities. We find a strong opposition between speciation and local richness, with speciation being more common in isolated communities and local richness being higher in more connected communities. Unlike previous models, we also find a transition to a positive relationship between speciation and local richness when dispersal is low and the number of communities is small. We use several measures of centrality to characterize the effect of network structure on diversity. The degree, the simplest measure of centrality, is the best predictor of local richness and speciation, although it loses some of its predictive power as connectivity grows. Our framework shows how a simple neutral model can be combined with network theory to reveal complex relationships between speciation, richness, and the spatial organization of populations. PMID:22957181

An overview of crop growing condition monitoring in China agriculture remote sensing monitoring system

NASA Astrophysics Data System (ADS)

Huang, Qing; Zhou, Qing-bo; Zhang, Li

2009-07-01

China is a large agricultural country. To understand the agricultural production condition timely and accurately is related to government decision-making, agricultural production management and the general public concern. China Agriculture Remote Sensing Monitoring System (CHARMS) can monitor crop acreage changes, crop growing condition, agriculture disaster (drought, floods, frost damage, pest etc.) and predict crop yield etc. quickly and timely. The basic principles, methods and regular operation of crop growing condition monitoring in CHARMS are introduced in detail in the paper. CHARMS can monitor crop growing condition of wheat, corn, cotton, soybean and paddy rice with MODIS data. An improved NDVI difference model was used in crop growing condition monitoring in CHARMS. Firstly, MODIS data of every day were received and processed, and the max NDVI values of every fifteen days of main crop were generated, then, in order to assessment a certain crop growing condition in certain period (every fifteen days, mostly), the system compare the remote sensing index data (NDVI) of a certain period with the data of the period in the history (last five year, mostly), the difference between NDVI can indicate the spatial difference of crop growing condition at a certain period. Moreover, Meteorological data of temperature, precipitation and sunshine etc. as well as the field investigation data of 200 network counties were used to modify the models parameters. Last, crop growing condition was assessment at four different scales of counties, provinces, main producing areas and nation and spatial distribution maps of crop growing condition were also created.

Phone traffic as a measurement of agricultural events

NASA Astrophysics Data System (ADS)

Martín, Samuel; Borondo, Javier; Morales, Alfredo; Losada, Juan Carlos; Tarquis, Ana M.; Benito, Rosa Maria

2015-04-01

Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behaviour of these systems (1). However, it has been recently when global food system has been seen as a complex web of production, processing, storage and transportation opening new challenges in their analysis. Agricultural activities in developing countries remain as important today as in the 1950s implying seasonal workers mobilization. The proliferation of mobile phones (MPs) offers an unprecedented tool to analyze human activity mapping. We would like to mention that in developed countries, the number of MP subscribers has surpassed the total population, with a penetration rate now reaching 121%, whereas in developing countries, it is as high as 90% and continuing to rise (2). As an example, we have analyzed the impact that agricultural activities, such as the growing of groundnut, have on Senegal. To this end we have analyzed the Normalized Difference Vegetation Index (NDVI) time series of the whole of Senegal and spotted the regions where groundnut is grown to identify the time period when this crop growth. By analyzing phone calls at each region of the country we found that a significant fraction of antennas exhibit two well defined peaks of activity corresponding with the begging and end of the growing season. Antennas located on regions identified as growing regions present this pattern. However, other antennas, located in non growing regions, such as Dakar, also present the two peaks pattern pointing out the synchronization between growing regions and key points in cities that emerges from the agricultural activity. References 1. Marta C. González, César A. Hidalgo and Albert-László Barabási (2008) Understanding individual human mobility patterns. Nature 453, 779-78. 2. International Telecommunication Union (2014) World Telecommunication Development Conference (WTDC-2014): Final Report. (ITU, Dubai, United Arab Emirates).

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.

Building a Community of Practice for Researchers: The International Network for Simulation-Based Pediatric Innovation, Research and Education.

PubMed

Cheng, Adam; Auerbach, Marc; Calhoun, Aaron; Mackinnon, Ralph; Chang, Todd P; Nadkarni, Vinay; Hunt, Elizabeth A; Duval-Arnould, Jordan; Peiris, Nicola; Kessler, David

2018-06-01

The scope and breadth of simulation-based research is growing rapidly; however, few mechanisms exist for conducting multicenter, collaborative research. Failure to foster collaborative research efforts is a critical gap that lies in the path of advancing healthcare simulation. The 2017 Research Summit hosted by the Society for Simulation in Healthcare highlighted how simulation-based research networks can produce studies that positively impact the delivery of healthcare. In 2011, the International Network for Simulation-based Pediatric Innovation, Research and Education (INSPIRE) was formed to facilitate multicenter, collaborative simulation-based research with the aim of developing a community of practice for simulation researchers. Since its formation, the network has successfully completed and published numerous collaborative research projects. In this article, we describe INSPIRE's history, structure, and internal processes with the goal of highlighting the community of practice model for other groups seeking to form a simulation-based research network.

The spatial scaling of species interaction networks.

PubMed

Galiana, Nuria; Lurgi, Miguel; Claramunt-López, Bernat; Fortin, Marie-Josée; Leroux, Shawn; Cazelles, Kevin; Gravel, Dominique; Montoya, José M

2018-05-01

Species-area relationships (SARs) are pivotal to understand the distribution of biodiversity across spatial scales. We know little, however, about how the network of biotic interactions in which biodiversity is embedded changes with spatial extent. Here we develop a new theoretical framework that enables us to explore how different assembly mechanisms and theoretical models affect multiple properties of ecological networks across space. We present a number of testable predictions on network-area relationships (NARs) for multi-trophic communities. Network structure changes as area increases because of the existence of different SARs across trophic levels, the preferential selection of generalist species at small spatial extents and the effect of dispersal limitation promoting beta-diversity. Developing an understanding of NARs will complement the growing body of knowledge on SARs with potential applications in conservation ecology. Specifically, combined with further empirical evidence, NARs can generate predictions of potential effects on ecological communities of habitat loss and fragmentation in a changing world.

Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

NASA Astrophysics Data System (ADS)

Wu, Zikai; Hou, Baoyu; Zhang, Hongjuan; Jin, Feng

2014-04-01

Deterministic network models have been attractive media for discussing dynamical processes' dependence on network structural features. On the other hand, the heterogeneity of weights affect dynamical processes taking place on networks. In this paper, we present a family of weighted expanded Koch networks based on Koch networks. They originate from a r-polygon, and each node of current generation produces m r-polygons including the node and whose weighted edges are scaled by factor w in subsequent evolutionary step. We derive closed-form expressions for average weighted shortest path length (AWSP). In large network, AWSP stays bounded with network order growing (0 < w < 1). Then, we focus on a special random walks and trapping issue on the networks. In more detail, we calculate exactly the average receiving time (ART). ART exhibits a sub-linear dependence on network order (0 < w < 1), which implies that nontrivial weighted expanded Koch networks are more efficient than un-weighted expanded Koch networks in receiving information. Besides, efficiency of receiving information at hub nodes is also dependent on parameters m and r. These findings may pave the way for controlling information transportation on general weighted networks.

Genome-Scale Reconstruction and Analysis of the Metabolic Network in the Hyperthermophilic Archaeon Sulfolobus Solfataricus

PubMed Central

Ulas, Thomas; Riemer, S. Alexander; Zaparty, Melanie; Siebers, Bettina; Schomburg, Dietmar

2012-01-01

We describe the reconstruction of a genome-scale metabolic model of the crenarchaeon Sulfolobus solfataricus, a hyperthermoacidophilic microorganism. It grows in terrestrial volcanic hot springs with growth occurring at pH 2–4 (optimum 3.5) and a temperature of 75–80°C (optimum 80°C). The genome of Sulfolobus solfataricus P2 contains 2,992,245 bp on a single circular chromosome and encodes 2,977 proteins and a number of RNAs. The network comprises 718 metabolic and 58 transport/exchange reactions and 705 unique metabolites, based on the annotated genome and available biochemical data. Using the model in conjunction with constraint-based methods, we simulated the metabolic fluxes induced by different environmental and genetic conditions. The predictions were compared to experimental measurements and phenotypes of S. solfataricus. Furthermore, the performance of the network for 35 different carbon sources known for S. solfataricus from the literature was simulated. Comparing the growth on different carbon sources revealed that glycerol is the carbon source with the highest biomass flux per imported carbon atom (75% higher than glucose). Experimental data was also used to fit the model to phenotypic observations. In addition to the commonly known heterotrophic growth of S. solfataricus, the crenarchaeon is also able to grow autotrophically using the hydroxypropionate-hydroxybutyrate cycle for bicarbonate fixation. We integrated this pathway into our model and compared bicarbonate fixation with growth on glucose as sole carbon source. Finally, we tested the robustness of the metabolism with respect to gene deletions using the method of Minimization of Metabolic Adjustment (MOMA), which predicted that 18% of all possible single gene deletions would be lethal for the organism. PMID:22952675

The Role of Temporal Trends in Growing Networks

PubMed Central

Ruppin, Eytan; Shavitt, Yuval

2016-01-01

The rich get richer principle, manifested by the Preferential attachment (PA) mechanism, is widely considered one of the major factors in the growth of real-world networks. PA stipulates that popular nodes are bound to be more attractive than less popular nodes; for example, highly cited papers are more likely to garner further citations. However, it overlooks the transient nature of popularity, which is often governed by trends. Here, we show that in a wide range of real-world networks the recent popularity of a node, i.e., the extent by which it accumulated links recently, significantly influences its attractiveness and ability to accumulate further links. We proceed to model this observation with a natural extension to PA, named Trending Preferential Attachment (TPA), in which edges become less influential as they age. TPA quantitatively parametrizes a fundamental network property, namely the network’s tendency to trends. Through TPA, we find that real-world networks tend to be moderately to highly trendy. Networks are characterized by different susceptibilities to trends, which determine their structure to a large extent. Trendy networks display complex structural traits, such as modular community structure and degree-assortativity, occurring regularly in real-world networks. In summary, this work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment. PMID:27486847

Modular and hierarchical structure of social contact networks

NASA Astrophysics Data System (ADS)

Ge, Yuanzheng; Song, Zhichao; Qiu, Xiaogang; Song, Hongbin; Wang, Yong

2013-10-01

Social contact networks exhibit overlapping qualities of communities, hierarchical structure and spatial-correlated nature. We propose a mixing pattern of modular and growing hierarchical structures to reconstruct social contact networks by using an individual’s geospatial distribution information in the real world. The hierarchical structure of social contact networks is defined based on the spatial distance between individuals, and edges among individuals are added in turn from the modular layer to the highest layer. It is a gradual process to construct the hierarchical structure: from the basic modular model up to the global network. The proposed model not only shows hierarchically increasing degree distribution and large clustering coefficients in communities, but also exhibits spatial clustering features of individual distributions. As an evaluation of the method, we reconstruct a hierarchical contact network based on the investigation data of a university. Transmission experiments of influenza H1N1 are carried out on the generated social contact networks, and results show that the constructed network is efficient to reproduce the dynamic process of an outbreak and evaluate interventions. The reproduced spread process exhibits that the spatial clustering of infection is accordant with the clustering of network topology. Moreover, the effect of individual topological character on the spread of influenza is analyzed, and the experiment results indicate that the spread is limited by individual daily contact patterns and local clustering topology rather than individual degree.

Network architecture in a converged optical + IP network

NASA Astrophysics Data System (ADS)

Wakim, Walid; Zottmann, Harald

2012-01-01

As demands on Provider Networks continue to grow at exponential rates, providers are forced to evaluate how to continue to grow the network while increasing service velocity, enhancing resiliency while decreasing the total cost of ownership (TCO). The bandwidth growth that networks are experiencing is in the form packet based multimedia services such as video, video conferencing, gaming, etc... mixed with Over the Top (OTT) content providers such as Netflix, and the customer's expectations that best effort is not enough you end up with a situation that forces the provider to analyze how to gain more out of the network with less cost. In this paper we will discuss changes in the network that are driving us to a tighter integration between packet and optical layers and how to improve on today's multi - layer inefficiencies to drive down network TCO and provide for a fully integrated and dynamic network that will decrease time to revenue.

Stimuli Reduce the Dimensionality of Cortical Activity

PubMed Central

Mazzucato, Luca; Fontanini, Alfredo; La Camera, Giancarlo

2016-01-01

The activity of ensembles of simultaneously recorded neurons can be represented as a set of points in the space of firing rates. Even though the dimension of this space is equal to the ensemble size, neural activity can be effectively localized on smaller subspaces. The dimensionality of the neural space is an important determinant of the computational tasks supported by the neural activity. Here, we investigate the dimensionality of neural ensembles from the sensory cortex of alert rats during periods of ongoing (inter-trial) and stimulus-evoked activity. We find that dimensionality grows linearly with ensemble size, and grows significantly faster during ongoing activity compared to evoked activity. We explain these results using a spiking network model based on a clustered architecture. The model captures the difference in growth rate between ongoing and evoked activity and predicts a characteristic scaling with ensemble size that could be tested in high-density multi-electrode recordings. Moreover, we present a simple theory that predicts the existence of an upper bound on dimensionality. This upper bound is inversely proportional to the amount of pair-wise correlations and, compared to a homogeneous network without clusters, it is larger by a factor equal to the number of clusters. The empirical estimation of such bounds depends on the number and duration of trials and is well predicted by the theory. Together, these results provide a framework to analyze neural dimensionality in alert animals, its behavior under stimulus presentation, and its theoretical dependence on ensemble size, number of clusters, and correlations in spiking network models. PMID:26924968

Stimuli Reduce the Dimensionality of Cortical Activity.

PubMed

Mazzucato, Luca; Fontanini, Alfredo; La Camera, Giancarlo

2016-01-01

The activity of ensembles of simultaneously recorded neurons can be represented as a set of points in the space of firing rates. Even though the dimension of this space is equal to the ensemble size, neural activity can be effectively localized on smaller subspaces. The dimensionality of the neural space is an important determinant of the computational tasks supported by the neural activity. Here, we investigate the dimensionality of neural ensembles from the sensory cortex of alert rats during periods of ongoing (inter-trial) and stimulus-evoked activity. We find that dimensionality grows linearly with ensemble size, and grows significantly faster during ongoing activity compared to evoked activity. We explain these results using a spiking network model based on a clustered architecture. The model captures the difference in growth rate between ongoing and evoked activity and predicts a characteristic scaling with ensemble size that could be tested in high-density multi-electrode recordings. Moreover, we present a simple theory that predicts the existence of an upper bound on dimensionality. This upper bound is inversely proportional to the amount of pair-wise correlations and, compared to a homogeneous network without clusters, it is larger by a factor equal to the number of clusters. The empirical estimation of such bounds depends on the number and duration of trials and is well predicted by the theory. Together, these results provide a framework to analyze neural dimensionality in alert animals, its behavior under stimulus presentation, and its theoretical dependence on ensemble size, number of clusters, and correlations in spiking network models.

Morphogenesis in Plants: Modeling the Shoot Apical Meristem, and Possible Applications

NASA Technical Reports Server (NTRS)

Mjolsness, Eric; Gor, Victoria; Meyerowitz, Elliot; Mann, Tobias

1998-01-01

A key determinant of overall morphogenesis in flowering plants such as Arabidopsis thaliana is the shoot apical meristem (growing tip of a shoot). Gene regulation networks can be used to model this system. We exhibit a very preliminary two-dimensional model including gene regulation and intercellular signaling, but omitting cell division and dynamical geometry. The model can be trained to have three stable regions of gene expression corresponding to the central zone, peripheral zone, and rib meristem. We also discuss a space-engineering motivation for studying and controlling the morphogenesis of plants using such computational models.

A longitudinal social network analysis of the editorial boards of medical informatics and bioinformatics journals.

PubMed

Malin, Bradley; Carley, Kathleen

2007-01-01

The goal of this research is to learn how the editorial staffs of bioinformatics and medical informatics journals provide support for cross-community exposure. Models such as co-citation and co-author analysis measure the relationships between researchers; but they do not capture how environments that support knowledge transfer across communities are organized. In this paper, we propose a social network analysis model to study how editorial boards integrate researchers from disparate communities. We evaluate our model by building relational networks based on the editorial boards of approximately 40 journals that serve as research outlets in medical informatics and bioinformatics. We track the evolution of editorial relationships through a longitudinal investigation over the years 2000 through 2005. Our findings suggest that there are research journals that support the collocation of editorial board members from the bioinformatics and medical informatics communities. Network centrality metrics indicate that editorial board members are located in the intersection of the communities and that the number of individuals in the intersection is growing with time. Social network analysis methods provide insight into the relationships between the medical informatics and bioinformatics communities. The number of editorial board members facilitating the publication intersection of the communities has grown, but the intersection remains dependent on a small group of individuals and fragile.

Social contagions on time-varying community networks

NASA Astrophysics Data System (ADS)

Liu, Mian-Xin; Wang, Wei; Liu, Ying; Tang, Ming; Cai, Shi-Min; Zhang, Hai-Feng

2017-05-01

Time-varying community structures exist widely in real-world networks. However, previous studies on the dynamics of spreading seldom took this characteristic into account, especially those on social contagions. To study the effects of time-varying community structures on social contagions, we propose a non-Markovian social contagion model on time-varying community networks based on the activity-driven network model. A mean-field theory is developed to analyze the proposed model. Through theoretical analyses and numerical simulations, two hierarchical features of the behavior adoption processes are found. That is, when community strength is relatively large, the behavior can easily spread in one of the communities, while in the other community the spreading only occurs at higher behavioral information transmission rates. Meanwhile, in spatial-temporal evolution processes, hierarchical orders are observed for the behavior adoption. Moreover, under different information transmission rates, three distinctive patterns are demonstrated in the change of the whole network's final adoption proportion along with the growing community strength. Within a suitable range of transmission rate, an optimal community strength can be found that can maximize the final adoption proportion. Finally, compared with the average activity potential, the promoting or inhibiting of social contagions is much more influenced by the number of edges generated by active nodes.

A Computational Model of Major Depression: the Role of Glutamate Dysfunction on Cingulo-Frontal Network Dynamics

PubMed Central

Ramirez-Mahaluf, Juan P.; Roxin, Alexander; Mayberg, Helen S.; Compte, Albert

2017-01-01

Abstract Major depression disease (MDD) is associated with the dysfunction of multinode brain networks. However, converging evidence implicates the reciprocal interaction between midline limbic regions (typified by the ventral anterior cingulate cortex, vACC) and the dorso-lateral prefrontal cortex (dlPFC), reflecting interactions between emotions and cognition. Furthermore, growing evidence suggests a role for abnormal glutamate metabolism in the vACC, while serotonergic treatments (selective serotonin reuptake inhibitor, SSRI) effective for many patients implicate the serotonin system. Currently, no mechanistic framework describes how network dynamics, glutamate, and serotonin interact to explain MDD symptoms and treatments. Here, we built a biophysical computational model of 2 areas (vACC and dlPFC) that can switch between emotional and cognitive processing. MDD networks were simulated by slowing glutamate decay in vACC and demonstrated sustained vACC activation. This hyperactivity was not suppressed by concurrent dlPFC activation and interfered with expected dlPFC responses to cognitive signals, mimicking cognitive dysfunction seen in MDD. Simulation of clinical treatments (SSRI or deep brain stimulation) counteracted this aberrant vACC activity. Theta and beta/gamma oscillations correlated with network function, representing markers of switch-like operation in the network. The model shows how glutamate dysregulation can cause aberrant brain dynamics, respond to treatments, and be reflected in EEG rhythms as biomarkers of MDD. PMID:26514163

Reachability bounds for chemical reaction networks and strand displacement systems.

PubMed

Condon, Anne; Kirkpatrick, Bonnie; Maňuch, Ján

2014-01-01

Chemical reaction networks (CRNs) and DNA strand displacement systems (DSDs) are widely-studied and useful models of molecular programming. However, in order for some DSDs in the literature to behave in an expected manner, the initial number of copies of some reagents is required to be fixed. In this paper we show that, when multiple copies of all initial molecules are present, general types of CRNs and DSDs fail to work correctly if the length of the shortest sequence of reactions needed to produce any given molecule exceeds a threshold that grows polynomially with attributes of the system.

Slow crack growth: Models and experiments

NASA Astrophysics Data System (ADS)

Santucci, S.; Vanel, L.; Ciliberto, S.

2007-07-01

The properties of slow crack growth in brittle materials are analyzed both theoretically and experimentally. We propose a model based on a thermally activated rupture process. Considering a 2D spring network submitted to an external load and to thermal noise, we show that a preexisting crack in the network may slowly grow because of stress fluctuations. An analytical solution is found for the evolution of the crack length as a function of time, the time to rupture and the statistics of the crack jumps. These theoretical predictions are verified by studying experimentally the subcritical growth of a single crack in thin sheets of paper. A good agreement between the theoretical predictions and the experimental results is found. In particular, our model suggests that the statistical stress fluctuations trigger rupture events at a nanometric scale corresponding to the diameter of cellulose microfibrils.

The ART of representation: Memory reduction and noise tolerance in a neural network vision system

NASA Astrophysics Data System (ADS)

Langley, Christopher S.

The Feature Cerebellar Model Arithmetic Computer (FCMAC) is a multiple-input-single-output neural network that can provide three-degree-of-freedom (3-DOF) pose estimation for a robotic vision system. The FCMAC provides sufficient accuracy to enable a manipulator to grasp an object from an arbitrary pose within its workspace. The network learns an appearance-based representation of an object by storing coarsely quantized feature patterns. As all unique patterns are encoded, the network size grows uncontrollably. A new architecture is introduced herein, which combines the FCMAC with an Adaptive Resonance Theory (ART) network. The ART module categorizes patterns observed during training into a set of prototypes that are used to build the FCMAC. As a result, the network no longer grows without bound, but constrains itself to a user-specified size. Pose estimates remain accurate since the ART layer tends to discard the least relevant information first. The smaller network performs recall faster, and in some cases is better for generalization, resulting in a reduction of error at recall time. The ART-Under-Constraint (ART-C) algorithm is extended to include initial filling with randomly selected patterns (referred to as ART-F). In experiments using a real-world data set, the new network performed equally well using less than one tenth the number of coarse patterns as a regular FCMAC. The FCMAC is also extended to include real-valued input activations. As a result, the network can be tuned to reject a variety of types of noise in the image feature detection. A quantitative analysis of noise tolerance was performed using four synthetic noise algorithms, and a qualitative investigation was made using noisy real-world image data. In validation experiments, the FCMAC system outperformed Radial Basis Function (RBF) networks for the 3-DOF problem, and had accuracy comparable to that of Principal Component Analysis (PCA) and superior to that of Shape Context Matching (SCM), both of which estimate orientation only.

Evolutionary Space Communications Architectures for Human/Robotic Exploration and Science Missions

NASA Technical Reports Server (NTRS)

Bhasin, Kul; Hayden, Jeffrey L.

2004-01-01

NASA enterprises have growing needs for an advanced, integrated, communications infrastructure that will satisfy the capabilities needed for multiple human, robotic and scientific missions beyond 2015. Furthermore, the reliable, multipoint infrastructure is required to provide continuous, maximum coverage of areas of concentrated activities, such as around Earth and in the vicinity of the Moon or Mars, with access made available on demand of the human or robotic user. As a first step, the definitions of NASA's future space communications and networking architectures are underway. Architectures that describe the communications and networking needed between the nodal regions consisting of Earth, Moon, Lagrange points, Mars, and the places of interest within the inner and outer solar system have been laid out. These architectures will need the modular flexibility that must be included in the communication and networking technologies to enable the infrastructure to grow in capability with time and to transform from supporting robotic missions in the solar system to supporting human ventures to Mars, Jupiter, Jupiter's moons, and beyond. The protocol-based networking capability seamlessly connects the backbone, access, inter-spacecraft and proximity network elements of the architectures employed in the infrastructure. In this paper, we present the summary of NASA's near and long term needs and capability requirements that were gathered by participative methods. We describe an integrated architecture concept and model that will enable communications for evolutionary robotic and human science missions. We then define the communication nodes, their requirements, and various options to connect them.

Field Instrumentation With Bricks: Wireless Networks Built From Tough, Cheap, Reliable Field Computers

NASA Astrophysics Data System (ADS)

Fatland, D. R.; Anandakrishnan, S.; Heavner, M.

2004-12-01

We describe tough, cheap, reliable field computers configured as wireless networks for distributed high-volume data acquisition and low-cost data recovery. Running under the GNU/Linux open source model these network nodes ('Bricks') are intended for either autonomous or managed deployment for many months in harsh Arctic conditions. We present here results from Generation-1 Bricks used in 2004 for glacier seismology research in Alaska and Antarctica and describe future generation Bricks in terms of core capabilities and a growing list of field applications. Subsequent generations of Bricks will feature low-power embedded architecture, large data storage capacity (GB), long range telemetry (15 km+ up from 3 km currently), and robust operational software. The list of Brick applications is growing to include Geodetic GPS, Bioacoustics (bats to whales), volcano seismicity, tracking marine fauna, ice sounding via distributed microwave receivers and more. This NASA-supported STTR project capitalizes on advancing computer/wireless technology to get scientists more data per research budget dollar, solving system integration problems and thereby getting researchers out of the hardware lab and into the field. One exemplary scenario: An investigator can install a Brick network in a remote polar environment to collect data for several months and then fly over the site to recover the data via wireless telemetry. In the past year Brick networks have moved beyond proof-of-concept to the full-bore development and testing stage; they will be a mature and powerful tool available for IPY 2007-8.

Evolutionary Space Communications Architectures for Human/Robotic Exploration and Science Missions

NASA Astrophysics Data System (ADS)

Bhasin, Kul; Hayden, Jeffrey L.

2004-02-01

NASA enterprises have growing needs for an advanced, integrated, communications infrastructure that will satisfy the capabilities needed for multiple human, robotic and scientific missions beyond 2015. Furthermore, the reliable, multipoint infrastructure is required to provide continuous, maximum coverage of areas of concentrated activities, such as around Earth and in the vicinity of the Moon or Mars, with access made available on demand of the human or robotic user. As a first step, the definitions of NASA's future space communications and networking architectures are underway. Architectures that describe the communications and networking needed between the nodal regions consisting of Earth, Moon, Lagrange points, Mars, and the places of interest within the inner and outer solar system have been laid out. These architectures will need the modular flexibility that must be included in the communication and networking technologies to enable the infrastructure to grow in capability with time and to transform from supporting robotic missions in the solar system to supporting human ventures to Mars, Jupiter, Jupiter's moons, and beyond. The protocol-based networking capability seamlessly connects the backbone, access, inter-spacecraft and proximity network elements of the architectures employed in the infrastructure. In this paper, we present the summary of NASA's near and long term needs and capability requirements that were gathered by participative methods. We describe an integrated architecture concept and model that will enable communications for evolutionary robotic and human science missions. We then define the communication nodes, their requirements, and various options to connect them.

Associating Human-Centered Concepts with Social Networks Using Fuzzy Sets

NASA Astrophysics Data System (ADS)

Yager, Ronald R.

The rapidly growing global interconnectivity, brought about to a large extent by the Internet, has dramatically increased the importance and diversity of social networks. Modern social networks cut across a spectrum from benign recreational focused websites such as Facebook to occupationally oriented websites such as LinkedIn to criminally focused groups such as drug cartels to devastation and terror focused groups such as Al-Qaeda. Many organizations are interested in analyzing and extracting information related to these social networks. Among these are governmental police and security agencies as well marketing and sales organizations. To aid these organizations there is a need for technologies to model social networks and intelligently extract information from these models. While established technologies exist for the modeling of relational networks [1-7] few technologies exist to extract information from these, compatible with human perception and understanding. Data bases is an example of a technology in which we have tools for representing our information as well as tools for querying and extracting the information contained. Our goal is in some sense analogous. We want to use the relational network model to represent information, in this case about relationships and interconnections, and then be able to query the social network using intelligent human-centered concepts. To extend our capabilities to interact with social relational networks we need to associate with these network human concepts and ideas. Since human beings predominantly use linguistic terms in which to reason and understand we need to build bridges between human conceptualization and the formal mathematical representation of the social network. Consider for example a concept such as "leader". An analyst may be able to express, in linguistic terms, using a network relevant vocabulary, properties of a leader. Our task is to translate this linguistic description into a mathematical formalism that allows us to determine how true it is that a particular node is a leader. In this work we look at the use of fuzzy set methodologies [8-10] to provide a bridge between the human analyst and the formal model of the network.

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.

An improved spanning tree approach for the reliability analysis of supply chain collaborative network

NASA Astrophysics Data System (ADS)

Lam, C. Y.; Ip, W. H.

2012-11-01

A higher degree of reliability in the collaborative network can increase the competitiveness and performance of an entire supply chain. As supply chain networks grow more complex, the consequences of unreliable behaviour become increasingly severe in terms of cost, effort and time. Moreover, it is computationally difficult to calculate the network reliability of a Non-deterministic Polynomial-time hard (NP-hard) all-terminal network using state enumeration, as this may require a huge number of iterations for topology optimisation. Therefore, this paper proposes an alternative approach of an improved spanning tree for reliability analysis to help effectively evaluate and analyse the reliability of collaborative networks in supply chains and reduce the comparative computational complexity of algorithms. Set theory is employed to evaluate and model the all-terminal reliability of the improved spanning tree algorithm and present a case study of a supply chain used in lamp production to illustrate the application of the proposed approach.

Exploiting the Use of Social Networking to Facilitate Collaboration in the Scientific Community

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

Coppock, Edrick G.

The goal of this project was to exploit social networking to facilitate scientific collaboration. The project objective was to research and identify scientific collaboration styles that are best served by social networking applications and to model the most effective social networking applications to substantiate how social networking can support scientific collaboration. To achieve this goal and objective, the project was to develop an understanding of the types of collaborations conducted by scientific researchers, through classification, data analysis and identification of unique collaboration requirements. Another technical objective in support of this goal was to understand the current state of technology inmore » collaboration tools. In order to test hypotheses about which social networking applications effectively support scientific collaboration the project was to create a prototype scientific collaboration system. The ultimate goal for testing the hypotheses and research of the project was to refine the prototype into a functional application that could effectively facilitate and grow collaboration within the U.S. Department of Energy (DOE) research community.« less

States of mind: Emotions, body feelings, and thoughts share distributed neural networks

PubMed Central

Oosterwijk, Suzanne; Lindquist, Kristen A.; Anderson, Eric; Dautoff, Rebecca; Moriguchi, Yoshiya; Barrett, Lisa Feldman

2012-01-01

Scientists have traditionally assumed that different kinds of mental states (e.g., fear, disgust, love, memory, planning, concentration, etc.) correspond to different psychological faculties that have domain-specific correlates in the brain. Yet, growing evidence points to the constructionist hypothesis that mental states emerge from the combination of domain-general psychological processes that map to large-scale distributed brain networks. In this paper, we report a novel study testing a constructionist model of the mind in which participants generated three kinds of mental states (emotions, body feelings, or thoughts) while we measured activity within large-scale distributed brain networks using fMRI. We examined the similarity and differences in the pattern of network activity across these three classes of mental states. Consistent with a constructionist hypothesis, a combination of large-scale distributed networks contributed to emotions, thoughts, and body feelings, although these mental states differed in the relative contribution of those networks. Implications for a constructionist functional architecture of diverse mental states are discussed. PMID:22677148

Dynamics of epidemic diseases on a growing adaptive network

PubMed Central

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-01-01

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists. PMID:28186146

Dynamics of epidemic diseases on a growing adaptive network.

PubMed

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-02-10

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.

Dynamics of epidemic diseases on a growing adaptive network

NASA Astrophysics Data System (ADS)

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-02-01

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.

Enzymes and other agents that enhance cell wall extensibility

NASA Technical Reports Server (NTRS)

Cosgrove, D. J.

1999-01-01

Polysaccharides and proteins are secreted to the inner surface of the growing cell wall, where they assemble into a network that is mechanically strong, yet remains extensible until the cells cease growth. This review focuses on the agents that directly or indirectly enhance the extensibility properties of growing walls. The properties of expansins, endoglucanases, and xyloglucan transglycosylases are reviewed and their postulated roles in modulating wall extensibility are evaluated. A summary model for wall extension is presented, in which expansin is a primary agent of wall extension, whereas endoglucanases, xyloglucan endotransglycosylase, and other enzymes that alter wall structure act secondarily to modulate expansin action.

Internet Tomography in Support of Internet and Network Simulation and Emulation Modelling

NASA Astrophysics Data System (ADS)

Moloisane, A.; Ganchev, I.; O'Droma, M.

Internet performance measurement data extracted through Internet Tomography techniques and metrics and how it may be used to enhance the capacity of network simulation and emulation modelling is addressed in this paper. The advantages of network simulation and emulation as a means to aid design and develop the component networks, which make up the Internet and are fundamental to its ongoing evolution, are highlighted. The Internet's rapid growth has spurred development of new protocols and algorithms to meet changing operational requirements such as security, multicast delivery, mobile networking, policy management, and quality of service (QoS) support. Both the development and evaluation of these operational tools requires the answering of many design and operational questions. Creating the technical support required by network engineers and managers in their efforts to seek answers to these questions is in itself a major challenge. Within the Internet the number and range of services supported continues to grow exponentially, from legacy and client/server applications to VoIP, multimedia streaming services and interactive multimedia services. Services have their own distinctive requirements and idiosyncrasies. They respond differently to bandwidth limitations, latency and jitter problems. They generate different types of “conversations” between end-user terminals, back-end resources and middle-tier servers. To add to the complexity, each new or enhanced service introduced onto the network contends for available bandwidth with every other service. In an effort to ensure networking products and resources being designed and developed handling diverse conditions encountered in real Internet environments, network simulation and emulation modelling is a valuable tool, and becoming a critical element, in networking product and application design and development. The better these laboratory tools reflect real-world environment and conditions the more helpful to designers they will be.

Dynamic behavior of acrylic acid clusters as quasi-mobile nodes in a model of hydrogel network

NASA Astrophysics Data System (ADS)

Zidek, Jan; Milchev, Andrey; Vilgis, Thomas A.

2012-12-01

Using a molecular dynamics simulation, we study the thermo-mechanical behavior of a model hydrogel subject to deformation and change in temperature. The model is found to describe qualitatively poly-lactide-glycolide hydrogels in which acrylic acid (AA)-groups are believed to play the role of quasi-mobile nodes in the formation of a network. From our extensive analysis of the structure, formation, and disintegration of the AA-groups, we are able to elucidate the relationship between structure and viscous-elastic behavior of the model hydrogel. Thus, in qualitative agreement with observations, we find a softening of the mechanical response at large deformations, which is enhanced by growing temperature. Several observables as the non-affinity parameter A and the network rearrangement parameter V indicate the existence of a (temperature-dependent) threshold degree of deformation beyond which the quasi-elastic response of the model system turns over into plastic (ductile) one. The critical stretching when the affinity of the deformation is lost can be clearly located in terms of A and V as well as by analysis of the energy density of the system. The observed stress-strain relationship matches that of known experimental systems.

Test experience on an ultrareliable computer communication network

NASA Technical Reports Server (NTRS)

Abbott, L. W.

1984-01-01

The dispersed sensor processing mesh (DSPM) is an experimental, ultrareliable, fault-tolerant computer communications network that exhibits an organic-like ability to regenerate itself after suffering damage. The regeneration is accomplished by two routines - grow and repair. This paper discusses the DSPM concept for achieving fault tolerance and provides a brief description of the mechanization of both the experiment and the six-node experimental network. The main topic of this paper is the system performance of the growth algorithm contained in the grow routine. The characteristics imbued to DSPM by the growth algorithm are also discussed. Data from an experimental DSPM network and software simulation of larger DSPM-type networks are used to examine the inherent limitation on growth time by the growth algorithm and the relationship of growth time to network size and topology.

A study of the temporal robustness of the growing global container-shipping network

PubMed Central

Wang, Nuo; Wu, Nuan; Dong, Ling-ling; Yan, Hua-kun; Wu, Di

2016-01-01

Whether they thrive as they grow must be determined for all constantly expanding networks. However, few studies have focused on this important network feature or the development of quantitative analytical methods. Given the formation and growth of the global container-shipping network, we proposed the concept of network temporal robustness and quantitative method. As an example, we collected container liner companies’ data at two time points (2004 and 2014) and built a shipping network with ports as nodes and routes as links. We thus obtained a quantitative value of the temporal robustness. The temporal robustness is a significant network property because, for the first time, we can clearly recognize that the shipping network has become more vulnerable to damage over the last decade: When the node failure scale reached 50% of the entire network, the temporal robustness was approximately −0.51% for random errors and −12.63% for intentional attacks. The proposed concept and analytical method described in this paper are significant for other network studies. PMID:27713549

Scale-free effect of substitution networks

NASA Astrophysics Data System (ADS)

Li, Ziyu; Yu, Zhouyu; Xi, Lifeng

2018-02-01

In this paper, we construct the growing networks in terms of substitution rule. Roughly speaking, we replace edges of different colors with different initial graphs. Then the evolving networks are constructed. We obtained the free-scale effect of our substitution networks.

Characterizing and modeling an electoral campaign in the context of Twitter: 2011 Spanish Presidential election as a case study

NASA Astrophysics Data System (ADS)

Borondo, J.; Morales, A. J.; Losada, J. C.; Benito, R. M.

2012-06-01

Transmitting messages in the most efficient way as possible has always been one of politicians' main concerns during electoral processes. Due to the rapidly growing number of users, online social networks have become ideal platforms for politicians to interact with their potential voters. Exploiting the available potential of these tools to maximize their influence over voters is one of politicians' actual challenges. To step in this direction, we have analyzed the user activity in the online social network Twitter, during the 2011 Spanish Presidential electoral process, and found that such activity is correlated with the election results. We introduce a new measure to study political sentiment in Twitter, which we call the relative support. We have also characterized user behavior by analyzing the structural and dynamical patterns of the complex networks emergent from the mention and retweet networks. Our results suggest that the collective attention is driven by a very small fraction of users. Furthermore, we have analyzed the interactions taking place among politicians, observing a lack of debate. Finally, we develop a network growth model to reproduce the interactions taking place among politicians.

Characterizing and modeling an electoral campaign in the context of Twitter: 2011 Spanish Presidential election as a case study.

PubMed

Borondo, J; Morales, A J; Losada, J C; Benito, R M

2012-06-01

Transmitting messages in the most efficient way as possible has always been one of politicians' main concerns during electoral processes. Due to the rapidly growing number of users, online social networks have become ideal platforms for politicians to interact with their potential voters. Exploiting the available potential of these tools to maximize their influence over voters is one of politicians' actual challenges. To step in this direction, we have analyzed the user activity in the online social network Twitter, during the 2011 Spanish Presidential electoral process, and found that such activity is correlated with the election results. We introduce a new measure to study political sentiment in Twitter, which we call the relative support. We have also characterized user behavior by analyzing the structural and dynamical patterns of the complex networks emergent from the mention and retweet networks. Our results suggest that the collective attention is driven by a very small fraction of users. Furthermore, we have analyzed the interactions taking place among politicians, observing a lack of debate. Finally, we develop a network growth model to reproduce the interactions taking place among politicians.

Coevolution of Cooperation and Partner Rewiring Range in Spatial Social Networks

NASA Astrophysics Data System (ADS)

Khoo, Tommy; Fu, Feng; Pauls, Scott

2016-11-01

In recent years, there has been growing interest in the study of coevolutionary games on networks. Despite much progress, little attention has been paid to spatially embedded networks, where the underlying geographic distance, rather than the graph distance, is an important and relevant aspect of the partner rewiring process. It thus remains largely unclear how individual partner rewiring range preference, local vs. global, emerges and affects cooperation. Here we explicitly address this issue using a coevolutionary model of cooperation and partner rewiring range preference in spatially embedded social networks. In contrast to local rewiring, global rewiring has no distance restriction but incurs a one-time cost upon establishing any long range link. We find that under a wide range of model parameters, global partner switching preference can coevolve with cooperation. Moreover, the resulting partner network is highly degree-heterogeneous with small average shortest path length while maintaining high clustering, thereby possessing small-world properties. We also discover an optimum availability of reputation information for the emergence of global cooperators, who form distant partnerships at a cost to themselves. From the coevolutionary perspective, our work may help explain the ubiquity of small-world topologies arising alongside cooperation in the real world.

Cancer systems biology in the genome sequencing era: part 1, dissecting and modeling of tumor clones and their networks.

PubMed

Wang, Edwin; Zou, Jinfeng; Zaman, Naif; Beitel, Lenore K; Trifiro, Mark; Paliouras, Miltiadis

2013-08-01

Recent tumor genome sequencing confirmed that one tumor often consists of multiple cell subpopulations (clones) which bear different, but related, genetic profiles such as mutation and copy number variation profiles. Thus far, one tumor has been viewed as a whole entity in cancer functional studies. With the advances of genome sequencing and computational analysis, we are able to quantify and computationally dissect clones from tumors, and then conduct clone-based analysis. Emerging technologies such as single-cell genome sequencing and RNA-Seq could profile tumor clones. Thus, we should reconsider how to conduct cancer systems biology studies in the genome sequencing era. We will outline new directions for conducting cancer systems biology by considering that genome sequencing technology can be used for dissecting, quantifying and genetically characterizing clones from tumors. Topics discussed in Part 1 of this review include computationally quantifying of tumor subpopulations; clone-based network modeling, cancer hallmark-based networks and their high-order rewiring principles and the principles of cell survival networks of fast-growing clones. Crown Copyright © 2013. Published by Elsevier Ltd. All rights reserved.

Network-based machine learning and graph theory algorithms for precision oncology.

PubMed

Zhang, Wei; Chien, Jeremy; Yong, Jeongsik; Kuang, Rui

2017-01-01

Network-based analytics plays an increasingly important role in precision oncology. Growing evidence in recent studies suggests that cancer can be better understood through mutated or dysregulated pathways or networks rather than individual mutations and that the efficacy of repositioned drugs can be inferred from disease modules in molecular networks. This article reviews network-based machine learning and graph theory algorithms for integrative analysis of personal genomic data and biomedical knowledge bases to identify tumor-specific molecular mechanisms, candidate targets and repositioned drugs for personalized treatment. The review focuses on the algorithmic design and mathematical formulation of these methods to facilitate applications and implementations of network-based analysis in the practice of precision oncology. We review the methods applied in three scenarios to integrate genomic data and network models in different analysis pipelines, and we examine three categories of network-based approaches for repositioning drugs in drug-disease-gene networks. In addition, we perform a comprehensive subnetwork/pathway analysis of mutations in 31 cancer genome projects in the Cancer Genome Atlas and present a detailed case study on ovarian cancer. Finally, we discuss interesting observations, potential pitfalls and future directions in network-based precision oncology.

Investigating the Associations between Ethnic Networks, Community Social Capital, and Physical Health among Marriage Migrants in Korea.

PubMed

Kim, Harris Hyun-Soo

2018-01-17

This study examines factors associated with the physical health of Korea's growing immigrant population. Specifically, it focuses on the associations between ethnic networks, community social capital, and self-rated health (SRH) among female marriage migrants. For empirical testing, secondary analysis of a large nationally representative sample (NSMF 2009) is conducted. Given the clustered data structure (individuals nested in communities), a series of two-level random intercepts and slopes models are fitted to probe the relationships between SRH and interpersonal (bonding and bridging) networks among foreign-born wives in Korea. In addition to direct effects, cross-level interaction effects are investigated using hierarchical linear modeling. While adjusting for confounders, bridging (inter-ethnic) networks are significantly linked with better health. Bonding (co-ethnic) networks, to the contrary, are negatively associated with immigrant health. Net of individual-level covariates, living in a commuijnity with more aggregate bridging social capital is positively linked with health. Community-level bonding social capital, however, is not a significant predictor. Lastly, two cross-level interaction terms are found. First, the positive relationship between bridging network and health is stronger in residential contexts with more aggregate bridging social capital. Second, it is weaker in communities with more aggregate bonding social capital.

Programming biological models in Python using PySB.

PubMed

Lopez, Carlos F; Muhlich, Jeremy L; Bachman, John A; Sorger, Peter K

2013-01-01

Mathematical equations are fundamental to modeling biological networks, but as networks get large and revisions frequent, it becomes difficult to manage equations directly or to combine previously developed models. Multiple simultaneous efforts to create graphical standards, rule-based languages, and integrated software workbenches aim to simplify biological modeling but none fully meets the need for transparent, extensible, and reusable models. In this paper we describe PySB, an approach in which models are not only created using programs, they are programs. PySB draws on programmatic modeling concepts from little b and ProMot, the rule-based languages BioNetGen and Kappa and the growing library of Python numerical tools. Central to PySB is a library of macros encoding familiar biochemical actions such as binding, catalysis, and polymerization, making it possible to use a high-level, action-oriented vocabulary to construct detailed models. As Python programs, PySB models leverage tools and practices from the open-source software community, substantially advancing our ability to distribute and manage the work of testing biochemical hypotheses. We illustrate these ideas using new and previously published models of apoptosis.

Programming biological models in Python using PySB

PubMed Central

Lopez, Carlos F; Muhlich, Jeremy L; Bachman, John A; Sorger, Peter K

2013-01-01

Mathematical equations are fundamental to modeling biological networks, but as networks get large and revisions frequent, it becomes difficult to manage equations directly or to combine previously developed models. Multiple simultaneous efforts to create graphical standards, rule-based languages, and integrated software workbenches aim to simplify biological modeling but none fully meets the need for transparent, extensible, and reusable models. In this paper we describe PySB, an approach in which models are not only created using programs, they are programs. PySB draws on programmatic modeling concepts from little b and ProMot, the rule-based languages BioNetGen and Kappa and the growing library of Python numerical tools. Central to PySB is a library of macros encoding familiar biochemical actions such as binding, catalysis, and polymerization, making it possible to use a high-level, action-oriented vocabulary to construct detailed models. As Python programs, PySB models leverage tools and practices from the open-source software community, substantially advancing our ability to distribute and manage the work of testing biochemical hypotheses. We illustrate these ideas using new and previously published models of apoptosis. PMID:23423320

Deriving a light use efficiency model from eddy covariance flux data for predicting daily gross primary production across biomes

USGS Publications Warehouse

Yuan, W.; Liu, S.; Zhou, G.; Tieszen, L.L.; Baldocchi, D.; Bernhofer, C.; Gholz, H.; Goldstein, Allen H.; Goulden, M.L.; Hollinger, D.Y.; Hu, Y.; Law, B.E.; Stoy, Paul C.; Vesala, T.; Wofsy, S.C.

2007-01-01

The quantitative simulation of gross primary production (GPP) at various spatial and temporal scales has been a major challenge in quantifying the global carbon cycle. We developed a light use efficiency (LUE) daily GPP model from eddy covariance (EC) measurements. The model, called EC-LUE, is driven by only four variables: normalized difference vegetation index (NDVI), photosynthetically active radiation (PAR), air temperature, and the Bowen ratio of sensible to latent heat flux (used to calculate moisture stress). The EC-LUE model relies on two assumptions: First, that the fraction of absorbed PAR (fPAR) is a linear function of NDVI; Second, that the realized light use efficiency, calculated from a biome-independent invariant potential LUE, is controlled by air temperature or soil moisture, whichever is most limiting. The EC-LUE model was calibrated and validated using 24,349 daily GPP estimates derived from 28 eddy covariance flux towers from the AmeriFlux and EuroFlux networks, covering a variety of forests, grasslands and savannas. The model explained 85% and 77% of the observed variations of daily GPP for all the calibration and validation sites, respectively. A comparison with GPP calculated from the Moderate Resolution Imaging Spectroradiometer (MODIS) indicated that the EC-LUE model predicted GPP that better matched tower data across these sites. The realized LUE was predominantly controlled by moisture conditions throughout the growing season, and controlled by temperature only at the beginning and end of the growing season. The EC-LUE model is an alternative approach that makes it possible to map daily GPP over large areas because (1) the potential LUE is invariant across various land cover types and (2) all driving forces of the model can be derived from remote sensing data or existing climate observation networks.

Popularity versus similarity in growing networks

NASA Astrophysics Data System (ADS)

Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, Mariangeles; Boguna, Marian

2012-02-01

Preferential attachment is a powerful mechanism explaining the emergence of scaling in growing networks. If new connections are established preferentially to more popular nodes in a network, then the network is scale-free. Here we show that not only popularity but also similarity is a strong force shaping the network structure and dynamics. We develop a framework where new connections, instead of preferring popular nodes, optimize certain trade-offs between popularity and similarity. The framework admits a geometric interpretation, in which preferential attachment emerges from local optimization processes. As opposed to preferential attachment, the optimization framework accurately describes large-scale evolution of technological (Internet), social (web of trust), and biological (E.coli metabolic) networks, predicting the probability of new links in them with a remarkable precision. The developed framework can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.

Optimal Concentrations in Transport Networks

NASA Astrophysics Data System (ADS)

Jensen, Kaare; Savage, Jessica; Kim, Wonjung; Bush, John; Holbrook, N. Michele

2013-03-01

Biological and man-made systems rely on effective transport networks for distribution of material and energy. Mass flow in these networks is determined by the flow rate and the concentration of material. While the most concentrated solution offers the greatest potential for mass flow, impedance grows with concentration and thus makes it the most difficult to transport. The concentration at which mass flow is optimal depends on specific physical and physiological properties of the system. We derive a simple model which is able to predict optimal concentrations observed in blood flows, sugar transport in plants, and nectar feeding animals. Our model predicts that the viscosity at the optimal concentration μopt =2nμ0 is an integer power of two times the viscosity of the pure carrier medium μ0. We show how the observed powers 1 <= n <= 6 agree well with theory and discuss how n depends on biological constraints imposed on the transport process. The model provides a universal framework for studying flows impeded by concentration and provides hints of how to optimize engineered flow systems, such as congestion in traffic flows.

Exact model reduction of combinatorial reaction networks

PubMed Central

Conzelmann, Holger; Fey, Dirk; Gilles, Ernst D

2008-01-01

Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs) to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks. PMID:18755034

The emergence of spontaneous activity in neuronal cultures

NASA Astrophysics Data System (ADS)

Orlandi, J. G.; Alvarez-Lacalle, E.; Teller, S.; Soriano, J.; Casademunt, J.

2013-01-01

In vitro neuronal networks of dissociated hippocampal or cortical tissues are one of the most attractive model systems for the physics and neuroscience communities. Cultured neurons grow and mature, develop axons and dendrites, and quickly connect to their neighbors to establish a spontaneously active network within a week. The resulting neuronal network is characterized by a combination of excitatory and inhibitory neurons coupled through synaptic connections that interact in a highly nonlinear manner. The nonlinear behavior emerges from the dynamics of both the neurons' spiking activity and synaptic transmission, together with biological noise. These ingredients give rise to a rich repertoire of phenomena that are still poorly understood, including the emergence and maintenance of periodic spontaneous activity, avalanches, propagation of fronts and synchronization. In this work we present an overview on the rich activity of cultured neuronal networks, and detail the minimal theoretical considerations needed to describe experimental observations.

A novel framework of classical and quantum prisoner's dilemma games on coupled networks.

PubMed

Deng, Xinyang; Zhang, Qi; Deng, Yong; Wang, Zhen

2016-03-15

Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner's dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner's dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner's dilemma is greatly impacted by the combined effect of entanglement and coupling.

A novel framework of classical and quantum prisoner’s dilemma games on coupled networks

PubMed Central

Deng, Xinyang; Zhang, Qi; Deng, Yong; Wang, Zhen

2016-01-01

Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner’s dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner’s dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner’s dilemma is greatly impacted by the combined effect of entanglement and coupling. PMID:26975447

Stimulation-Based Control of Dynamic Brain Networks

PubMed Central

Pasqualetti, Fabio; Gu, Shi; Cieslak, Matthew

2016-01-01

The ability to modulate brain states using targeted stimulation is increasingly being employed to treat neurological disorders and to enhance human performance. Despite the growing interest in brain stimulation as a form of neuromodulation, much remains unknown about the network-level impact of these focal perturbations. To study the system wide impact of regional stimulation, we employ a data-driven computational model of nonlinear brain dynamics to systematically explore the effects of targeted stimulation. Validating predictions from network control theory, we uncover the relationship between regional controllability and the focal versus global impact of stimulation, and we relate these findings to differences in the underlying network architecture. Finally, by mapping brain regions to cognitive systems, we observe that the default mode system imparts large global change despite being highly constrained by structural connectivity. This work forms an important step towards the development of personalized stimulation protocols for medical treatment or performance enhancement. PMID:27611328

Multi-Agent Inference in Social Networks: A Finite Population Learning Approach.

PubMed

Fan, Jianqing; Tong, Xin; Zeng, Yao

When people in a society want to make inference about some parameter, each person may want to use data collected by other people. Information (data) exchange in social networks is usually costly, so to make reliable statistical decisions, people need to trade off the benefits and costs of information acquisition. Conflicts of interests and coordination problems will arise in the process. Classical statistics does not consider people's incentives and interactions in the data collection process. To address this imperfection, this work explores multi-agent Bayesian inference problems with a game theoretic social network model. Motivated by our interest in aggregate inference at the societal level, we propose a new concept, finite population learning , to address whether with high probability, a large fraction of people in a given finite population network can make "good" inference. Serving as a foundation, this concept enables us to study the long run trend of aggregate inference quality as population grows.

Characterizing the topology of probabilistic biological networks.

PubMed

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-01-01

Biological interactions are often uncertain events, that may or may not take place with some probability. This uncertainty leads to a massive number of alternative interaction topologies for each such network. The existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. In this paper, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. Using our mathematical representation, we develop a method that can accurately describe the degree distribution of such networks. We also take one more step and extend our method to accurately compute the joint-degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. Our method works quickly even for entire protein-protein interaction (PPI) networks. It also helps us find an adequate mathematical model using MLE. We perform a comparative study of node-degree and joint-degree distributions in two types of biological networks: the classical deterministic networks and the more flexible probabilistic networks. Our results confirm that power-law and log-normal models best describe degree distributions for both probabilistic and deterministic networks. Moreover, the inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected. We also show that probabilistic networks are more robust for node-degree distribution computation than the deterministic ones. all the data sets used, the software implemented and the alignments found in this paper are available at http://bioinformatics.cise.ufl.edu/projects/probNet/.

Complex quantum network geometries: Evolution and phase transitions

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

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

Complex quantum network geometries: Evolution and phase transitions.

PubMed

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

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

Test experience on an ultrareliable computer communication network

NASA Technical Reports Server (NTRS)

Abbott, L. W.

1984-01-01

The dispersed sensor processing mesh (DSPM) is an experimental, ultra-reliable, fault-tolerant computer communications network that exhibits an organic-like ability to regenerate itself after suffering damage. The regeneration is accomplished by two routines - grow and repair. This paper discusses the DSPM concept for achieving fault tolerance and provides a brief description of the mechanization of both the experiment and the six-node experimental network. The main topic of this paper is the system performance of the growth algorithm contained in the grow routine. The characteristics imbued to DSPM by the growth algorithm are also discussed. Data from an experimental DSPM network and software simulation of larger DSPM-type networks are used to examine the inherent limitation on growth time by the growth algorithm and the relationship of growth time to network size and topology.

Deciphering structural and temporal interplays during the architectural development of mango trees.

PubMed

Dambreville, Anaëlle; Lauri, Pierre-Éric; Trottier, Catherine; Guédon, Yann; Normand, Frédéric

2013-05-01

Plant architecture is commonly defined by the adjacency of organs within the structure and their properties. Few studies consider the effect of endogenous temporal factors, namely phenological factors, on the establishment of plant architecture. This study hypothesized that, in addition to the effect of environmental factors, the observed plant architecture results from both endogenous structural and temporal components, and their interplays. Mango tree, which is characterized by strong phenological asynchronisms within and between trees and by repeated vegetative and reproductive flushes during a growing cycle, was chosen as a plant model. During two consecutive growing cycles, this study described vegetative and reproductive development of 20 trees submitted to the same environmental conditions. Four mango cultivars were considered to assess possible cultivar-specific patterns. Integrative vegetative and reproductive development models incorporating generalized linear models as components were built. These models described the occurrence, intensity, and timing of vegetative and reproductive development at the growth unit scale. This study showed significant interplays between structural and temporal components of plant architectural development at two temporal scales. Within a growing cycle, earliness of bud burst was highly and positively related to earliness of vegetative development and flowering. Between growing cycles, flowering growth units delayed vegetative development compared to growth units that did not flower. These interplays explained how vegetative and reproductive phenological asynchronisms within and between trees were generated and maintained. It is suggested that causation networks involving structural and temporal components may give rise to contrasted tree architectures.

Growing optimal scale-free networks via likelihood

NASA Astrophysics Data System (ADS)

Small, Michael; Li, Yingying; Stemler, Thomas; Judd, Kevin

2015-04-01

Preferential attachment, by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree, has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree k is proportional to k-γ. However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that the optimal way to build a scale-free network is to attach most new links to nodes of low degree. Curiously, this leads to a scale-free network with a single dominant hub: a starlike structure we call a superstar network. Asymptotically, the optimal strategy is to attach each new node to one of the nodes of degree k with probability proportional to 1/N +ζ (γ ) (k+1 ) γ (in a N node network): a stronger bias toward high degree nodes than exhibited by standard preferential attachment. Our algorithm generates optimally scale-free networks (the superstar networks) as well as randomly sampling the space of all scale-free networks with a given degree exponent γ . We generate viable realization with finite N for 1 ≪γ <2 as well as γ >2 . We observe an apparently discontinuous transition at γ ≈2 between so-called superstar networks and more treelike realizations. Gradually increasing γ further leads to reemergence of a superstar hub. To quantify these structural features, we derive a new analytic expression for the expected degree exponent of a pure preferential attachment process and introduce alternative measures of network entropy. Our approach is generic and can also be applied to an arbitrary degree distribution.

Deconstructing the core dynamics from a complex time-lagged regulatory biological circuit.

PubMed

Eriksson, O; Brinne, B; Zhou, Y; Björkegren, J; Tegnér, J

2009-03-01

Complex regulatory dynamics is ubiquitous in molecular networks composed of genes and proteins. Recent progress in computational biology and its application to molecular data generate a growing number of complex networks. Yet, it has been difficult to understand the governing principles of these networks beyond graphical analysis or extensive numerical simulations. Here the authors exploit several simplifying biological circumstances which thereby enable to directly detect the underlying dynamical regularities driving periodic oscillations in a dynamical nonlinear computational model of a protein-protein network. System analysis is performed using the cell cycle, a mathematically well-described complex regulatory circuit driven by external signals. By introducing an explicit time delay and using a 'tearing-and-zooming' approach the authors reduce the system to a piecewise linear system with two variables that capture the dynamics of this complex network. A key step in the analysis is the identification of functional subsystems by identifying the relations between state-variables within the model. These functional subsystems are referred to as dynamical modules operating as sensitive switches in the original complex model. By using reduced mathematical representations of the subsystems the authors derive explicit conditions on how the cell cycle dynamics depends on system parameters, and can, for the first time, analyse and prove global conditions for system stability. The approach which includes utilising biological simplifying conditions, identification of dynamical modules and mathematical reduction of the model complexity may be applicable to other well-characterised biological regulatory circuits. [Includes supplementary material].

Applications of a formal approach to decipher discrete genetic networks.

PubMed

Corblin, Fabien; Fanchon, Eric; Trilling, Laurent

2010-07-20

A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant and applicable to address questions raised by biologists about such networks. The behaviour of these systems being complex, it is essential to exploit efficiently every bit of experimental information. In our approach, both the evolution rules and the partial knowledge about the structure and the behaviour of the network are formalized using a common constraint-based language. In this article our formal and declarative approach is applied to three biological applications. The software environment that we developed allows to specifically address each application through a new class of biologically relevant queries. We show that we can describe easily and in a formal manner the partial knowledge about a genetic network. Moreover we show that this environment, based on a constraint algorithmic approach, offers a wide variety of functionalities, going beyond simple simulations, such as proof of consistency, model revision, prediction of properties, search for minimal models relatively to specified criteria. The formal approach proposed here deeply changes the way to proceed in the exploration of genetic and biochemical networks, first by avoiding the usual trial-and-error procedure, and second by placing the emphasis on sets of solutions, rather than a single solution arbitrarily chosen among many others. Last, the constraint approach promotes an integration of model and experimental data in a single framework.

Toward domain-specific design environments: Some representation ideas from the telecommunications domain

NASA Technical Reports Server (NTRS)

Greenspan, Sol; Feblowitz, Mark

1992-01-01

ACME is an experimental environment for investigating new approaches to modeling and analysis of system requirements and designs. ACME is built on and extends object-oriented conceptual modeling techniques and knowledge representation and reasoning (KRR) tools. The most immediate intended use for ACME is to help represent, understand, and communicate system designs during the early stages of system planning and requirements engineering. While our research is ostensibly aimed at software systems in general, we are particularly motivated to make an impact in the telecommunications domain, especially in the area referred to as Intelligent Networks (IN's). IN systems contain the software to provide services to users of a telecommunications network (e.g., call processing services, information services, etc.) as well as the software that provides the internal infrastructure for providing the services (e.g., resource management, billing, etc.). The software includes not only systems developed by the network proprietors but also by a growing group of independent service software providers.

The improved business valuation model for RFID company based on the community mining method.

PubMed

Li, Shugang; Yu, Zhaoxu

2017-01-01

Nowadays, the appetite for the investment and mergers and acquisitions (M&A) activity in RFID companies is growing rapidly. Although the huge number of papers have addressed the topic of business valuation models based on statistical methods or neural network methods, only a few are dedicated to constructing a general framework for business valuation that improves the performance with network graph (NG) and the corresponding community mining (CM) method. In this study, an NG based business valuation model is proposed, where real options approach (ROA) integrating CM method is designed to predict the company's net profit as well as estimate the company value. Three improvements are made in the proposed valuation model: Firstly, our model figures out the credibility of the node belonging to each community and clusters the network according to the evolutionary Bayesian method. Secondly, the improved bacterial foraging optimization algorithm (IBFOA) is adopted to calculate the optimized Bayesian posterior probability function. Finally, in IBFOA, bi-objective method is used to assess the accuracy of prediction, and these two objectives are combined into one objective function using a new Pareto boundary method. The proposed method returns lower forecasting error than 10 well-known forecasting models on 3 different time interval valuing tasks for the real-life simulation of RFID companies.

The improved business valuation model for RFID company based on the community mining method

PubMed Central

Li, Shugang; Yu, Zhaoxu

2017-01-01

Nowadays, the appetite for the investment and mergers and acquisitions (M&A) activity in RFID companies is growing rapidly. Although the huge number of papers have addressed the topic of business valuation models based on statistical methods or neural network methods, only a few are dedicated to constructing a general framework for business valuation that improves the performance with network graph (NG) and the corresponding community mining (CM) method. In this study, an NG based business valuation model is proposed, where real options approach (ROA) integrating CM method is designed to predict the company’s net profit as well as estimate the company value. Three improvements are made in the proposed valuation model: Firstly, our model figures out the credibility of the node belonging to each community and clusters the network according to the evolutionary Bayesian method. Secondly, the improved bacterial foraging optimization algorithm (IBFOA) is adopted to calculate the optimized Bayesian posterior probability function. Finally, in IBFOA, bi-objective method is used to assess the accuracy of prediction, and these two objectives are combined into one objective function using a new Pareto boundary method. The proposed method returns lower forecasting error than 10 well-known forecasting models on 3 different time interval valuing tasks for the real-life simulation of RFID companies. PMID:28459815

A group evolving-based framework with perturbations for link prediction

NASA Astrophysics Data System (ADS)

Si, Cuiqi; Jiao, Licheng; Wu, Jianshe; Zhao, Jin

2017-06-01

Link prediction is a ubiquitous application in many fields which uses partially observed information to predict absence or presence of links between node pairs. The group evolving study provides reasonable explanations on the behaviors of nodes, relations between nodes and community formation in a network. Possible events in group evolution include continuing, growing, splitting, forming and so on. The changes discovered in networks are to some extent the result of these events. In this work, we present a group evolving-based characterization of node's behavioral patterns, and via which we can estimate the probability they tend to interact. In general, the primary aim of this paper is to offer a minimal toy model to detect missing links based on evolution of groups and give a simpler explanation on the rationality of the model. We first introduce perturbations into networks to obtain stable cluster structures, and the stable clusters determine the stability of each node. Then fluctuations, another node behavior, are assumed by the participation of each node to its own belonging group. Finally, we demonstrate that such characteristics allow us to predict link existence and propose a model for link prediction which outperforms many classical methods with a decreasing computational time in large scales. Encouraging experimental results obtained on real networks show that our approach can effectively predict missing links in network, and even when nearly 40% of the edges are missing, it also retains stationary performance.

A strawman SLR program plan for the 1990s

NASA Technical Reports Server (NTRS)

Degnan, John J.

1994-01-01

A series of programmatic and technical goals for the satellite laser ranging (SLR) network are presented. They are: (1) standardize the performance of the global SLR network; (2) improve the geographic distribution of stations; (3) reduce costs of field operations and data processing; (4) expand the 24 hour temporal coverage to better serve the growing constellation of satellites; (5) improve absolute range accuracy to 2 mm at key stations; (6) improve satellite force, radiative propagation, and station motion models and investigate alternative geodetic analysis techniques; (7) support technical intercomparison and the Terrestrial Reference Frame through global collocations; (8) investigate potential synergisms between GPS and SLR.

Measuring Long-Term Impact Based on Network Centrality: Unraveling Cinematic Citations

PubMed Central

Spitz, Andreas; Horvát, Emőke-Ágnes

2014-01-01

Traditional measures of success for film, such as box-office revenue and critical acclaim, lack the ability to quantify long-lasting impact and depend on factors that are largely external to the craft itself. With the growing number of films that are being created and large-scale data becoming available through crowd-sourced online platforms, an endogenous measure of success that is not reliant on manual appraisal is of increasing importance. In this article we propose such a ranking method based on a combination of centrality indices. We apply the method to a network that contains several types of citations between more than 40,000 international feature films. From this network we derive a list of milestone films, which can be considered to constitute the foundations of cinema. In a comparison to various existing lists of ‘greatest’ films, such as personal favourite lists, voting lists, lists of individual experts, and lists deduced from expert polls, the selection of milestone films is more diverse in terms of genres, actors, and main creators. Our results shed light on the potential of a systematic quantitative investigation based on cinematic influences in identifying the most inspiring creations in world cinema. In a broader perspective, we introduce a novel research question to large-scale citation analysis, one of the most intriguing topics that have been at the forefront of scientific enquiries for the past fifty years and have led to the development of various network analytic methods. In doing so, we transfer widely studied approaches from citation analysis to the the newly emerging field of quantification efforts in the arts. The specific contribution of this paper consists in modelling the multidimensional cinematic references as a growing multiplex network and in developing a methodology for the identification of central films in this network. PMID:25295877

Sustainable use of renewable resources in a stylized social-ecological network model under heterogeneous resource distribution

NASA Astrophysics Data System (ADS)

Barfuss, Wolfram; Donges, Jonathan F.; Wiedermann, Marc; Lucht, Wolfgang

2017-04-01

Human societies depend on the resources ecosystems provide. Particularly since the last century, human activities have transformed the relationship between nature and society at a global scale. We study this coevolutionary relationship by utilizing a stylized model of private resource use and social learning on an adaptive network. The latter process is based on two social key dynamics beyond economic paradigms: boundedly rational imitation of resource use strategies and homophily in the formation of social network ties. The private and logistically growing resources are harvested with either a sustainable (small) or non-sustainable (large) effort. We show that these social processes can have a profound influence on the environmental state, such as determining whether the private renewable resources collapse from overuse or not. Additionally, we demonstrate that heterogeneously distributed regional resource capacities shift the critical social parameters where this resource extraction system collapses. We make these points to argue that, in more advanced coevolutionary models of the planetary social-ecological system, such socio-cultural phenomena as well as regional resource heterogeneities should receive attention in addition to the processes represented in established Earth system and integrated assessment models.

Research on mixed network architecture collaborative application model

NASA Astrophysics Data System (ADS)

Jing, Changfeng; Zhao, Xi'an; Liang, Song

2009-10-01

When facing complex requirements of city development, ever-growing spatial data, rapid development of geographical business and increasing business complexity, collaboration between multiple users and departments is needed urgently, however conventional GIS software (such as Client/Server model or Browser/Server model) are not support this well. Collaborative application is one of the good resolutions. Collaborative application has four main problems to resolve: consistency and co-edit conflict, real-time responsiveness, unconstrained operation, spatial data recoverability. In paper, application model called AMCM is put forward based on agent and multi-level cache. AMCM can be used in mixed network structure and supports distributed collaborative. Agent is an autonomous, interactive, initiative and reactive computing entity in a distributed environment. Agent has been used in many fields such as compute science and automation. Agent brings new methods for cooperation and the access for spatial data. Multi-level cache is a part of full data. It reduces the network load and improves the access and handle of spatial data, especially, in editing the spatial data. With agent technology, we make full use of its characteristics of intelligent for managing the cache and cooperative editing that brings a new method for distributed cooperation and improves the efficiency.

Toward Petascale Biologically Plausible Neural Networks

NASA Astrophysics Data System (ADS)

Long, Lyle

This talk will describe an approach to achieving petascale neural networks. Artificial intelligence has been oversold for many decades. Computers in the beginning could only do about 16,000 operations per second. Computer processing power, however, has been doubling every two years thanks to Moore's law, and growing even faster due to massively parallel architectures. Finally, 60 years after the first AI conference we have computers on the order of the performance of the human brain (1016 operations per second). The main issues now are algorithms, software, and learning. We have excellent models of neurons, such as the Hodgkin-Huxley model, but we do not know how the human neurons are wired together. With careful attention to efficient parallel computing, event-driven programming, table lookups, and memory minimization massive scale simulations can be performed. The code that will be described was written in C + + and uses the Message Passing Interface (MPI). It uses the full Hodgkin-Huxley neuron model, not a simplified model. It also allows arbitrary network structures (deep, recurrent, convolutional, all-to-all, etc.). The code is scalable, and has, so far, been tested on up to 2,048 processor cores using 107 neurons and 109 synapses.

Impact of Vegetation Cover Fraction Parameterization schemes on Land Surface Temperature Simulation in the Tibetan Plateau

NASA Astrophysics Data System (ADS)

Lv, M.; Li, C.; Lu, H.; Yang, K.; Chen, Y.

2017-12-01

The parameterization of vegetation cover fraction (VCF) is an important component of land surface models. This paper investigates the impacts of three VCF parameterization schemes on land surface temperature (LST) simulation by the Common Land Model (CoLM) in the Tibetan Plateau (TP). The first scheme is a simple land cover (LC) based method; the second one is based on remote sensing observation (hereafter named as RNVCF) , in which multi-year climatology VCFs is derived from Moderate-resolution Imaging Spectroradiometer (MODIS) NDVI (Normalized Difference Vegetation Index); the third VCF parameterization scheme derives VCF from the LAI simulated by LSM and clump index at every model time step (hereafter named as SMVCF). Simulated land surface temperature(LST) and soil temperature by CoLM with three VCF parameterization schemes were evaluated by using satellite LST observation and in situ soil temperature observation, respectively, during the period of 2010 to 2013. The comparison against MODIS Aqua LST indicates that (1) CTL produces large biases for both four seasons in early afternoon (about 13:30, local solar time), while the mean bias in spring reach to 12.14K; (2) RNVCF and SMVCF reduce the mean bias significantly, especially in spring as such reduce is about 6.5K. Surface soil temperature observed at 5 cm depth from three soil moisture and temperature monitoring networks is also employed to assess the skill of three VCF schemes. The three networks, crossing TP from West to East, have different climate and vegetation conditions. In the Ngari network, located in the Western TP with an arid climate, there are not obvious differences among three schemes. In Naqu network, located in central TP with a semi-arid climate condition, CTL shows a severe overestimates (12.1 K), but such overestimations can be reduced by 79% by RNVCF and 87% by SMVCF. In the third humid network (Maqu in eastern TP), CoLM performs similar to Naqu. However, at both Naqu and Maqu networks, RNVCF shows significant overestimation in summer, perhaps due to RNVCF ignores the growing characteristics of vegetation (mainly grass) in these two regions. Our results demonstrate that VCF schemes have significant influence on LSM performance, and indicate that it is important to consider vegetation growing characteristics in VCF schemes for different LCs.

A network security monitor

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

Heberlein, L.T.; Dias, G.V.; Levitt, K.N.

1989-11-01

The study of security in computer networks is a rapidly growing area of interest because of the proliferation of networks and the paucity of security measures in most current networks. Since most networks consist of a collection of inter-connected local area networks (LANs), this paper concentrates on the security-related issues in a single broadcast LAN such as Ethernet. Specifically, we formalize various possible network attacks and outline methods of detecting them. Our basic strategy is to develop profiles of usage of network resources and then compare current usage patterns with the historical profile to determine possible security violations. Thus, ourmore » work is similar to the host-based intrusion-detection systems such as SRI's IDES. Different from such systems, however, is our use of a hierarchical model to refine the focus of the intrusion-detection mechanism. We also report on the development of our experimental LAN monitor currently under implementation. Several network attacks have been simulated and results on how the monitor has been able to detect these attacks are also analyzed. Initial results demonstrate that many network attacks are detectable with our monitor, although it can surely be defeated. Current work is focusing on the integration of network monitoring with host-based techniques. 20 refs., 2 figs.« less

Generalized synchronization between chimera states

NASA Astrophysics Data System (ADS)

Andrzejak, Ralph G.; Ruzzene, Giulia; Malvestio, Irene

2017-05-01

Networks of coupled oscillators in chimera states are characterized by an intriguing interplay of synchronous and asynchronous motion. While chimera states were initially discovered in mathematical model systems, there is growing experimental and conceptual evidence that they manifest themselves also in natural and man-made networks. In real-world systems, however, synchronization and desynchronization are not only important within individual networks but also across different interacting networks. It is therefore essential to investigate if chimera states can be synchronized across networks. To address this open problem, we use the classical setting of ring networks of non-locally coupled identical phase oscillators. We apply diffusive drive-response couplings between pairs of such networks that individually show chimera states when there is no coupling between them. The drive and response networks are either identical or they differ by a variable mismatch in their phase lag parameters. In both cases, already for weak couplings, the coherent domain of the response network aligns its position to the one of the driver networks. For identical networks, a sufficiently strong coupling leads to identical synchronization between the drive and response. For non-identical networks, we use the auxiliary system approach to demonstrate that generalized synchronization is established instead. In this case, the response network continues to show a chimera dynamics which however remains distinct from the one of the driver. Hence, segregated synchronized and desynchronized domains in individual networks congregate in generalized synchronization across networks.

Quantization and training of object detection networks with low-precision weights and activations

NASA Astrophysics Data System (ADS)

Yang, Bo; Liu, Jian; Zhou, Li; Wang, Yun; Chen, Jie

2018-01-01

As convolutional neural networks have demonstrated state-of-the-art performance in object recognition and detection, there is a growing need for deploying these systems on resource-constrained mobile platforms. However, the computational burden and energy consumption of inference for these networks are significantly higher than what most low-power devices can afford. To address these limitations, this paper proposes a method to train object detection networks with low-precision weights and activations. The probability density functions of weights and activations of each layer are first directly estimated using piecewise Gaussian models. Then, the optimal quantization intervals and step sizes for each convolution layer are adaptively determined according to the distribution of weights and activations. As the most computationally expensive convolutions can be replaced by effective fixed point operations, the proposed method can drastically reduce computation complexity and memory footprint. Performing on the tiny you only look once (YOLO) and YOLO architectures, the proposed method achieves comparable accuracy to their 32-bit counterparts. As an illustration, the proposed 4-bit and 8-bit quantized versions of the YOLO model achieve a mean average precision of 62.6% and 63.9%, respectively, on the Pascal visual object classes 2012 test dataset. The mAP of the 32-bit full-precision baseline model is 64.0%.

Bayesian switching factor analysis for estimating time-varying functional connectivity in fMRI.

PubMed

Taghia, Jalil; Ryali, Srikanth; Chen, Tianwen; Supekar, Kaustubh; Cai, Weidong; Menon, Vinod

2017-07-15

There is growing interest in understanding the dynamical properties of functional interactions between distributed brain regions. However, robust estimation of temporal dynamics from functional magnetic resonance imaging (fMRI) data remains challenging due to limitations in extant multivariate methods for modeling time-varying functional interactions between multiple brain areas. Here, we develop a Bayesian generative model for fMRI time-series within the framework of hidden Markov models (HMMs). The model is a dynamic variant of the static factor analysis model (Ghahramani and Beal, 2000). We refer to this model as Bayesian switching factor analysis (BSFA) as it integrates factor analysis into a generative HMM in a unified Bayesian framework. In BSFA, brain dynamic functional networks are represented by latent states which are learnt from the data. Crucially, BSFA is a generative model which estimates the temporal evolution of brain states and transition probabilities between states as a function of time. An attractive feature of BSFA is the automatic determination of the number of latent states via Bayesian model selection arising from penalization of excessively complex models. Key features of BSFA are validated using extensive simulations on carefully designed synthetic data. We further validate BSFA using fingerprint analysis of multisession resting-state fMRI data from the Human Connectome Project (HCP). Our results show that modeling temporal dependencies in the generative model of BSFA results in improved fingerprinting of individual participants. Finally, we apply BSFA to elucidate the dynamic functional organization of the salience, central-executive, and default mode networks-three core neurocognitive systems with central role in cognitive and affective information processing (Menon, 2011). Across two HCP sessions, we demonstrate a high level of dynamic interactions between these networks and determine that the salience network has the highest temporal flexibility among the three networks. Our proposed methods provide a novel and powerful generative model for investigating dynamic brain connectivity. Copyright © 2017 Elsevier Inc. All rights reserved.

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

PubMed

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

2017-06-06

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

The origin of the criticality in meme popularity distribution on complex networks.

PubMed

Kim, Yup; Park, Seokjong; Yook, Soon-Hyung

2016-03-24

Previous studies showed that the meme popularity distribution is described by a heavy-tailed distribution or a power-law, which is a characteristic feature of the criticality. Here, we study the origin of the criticality on non-growing and growing networks based on the competition induced criticality model. From the direct Mote Carlo simulations and the exact mapping into the position dependent biased random walk (PDBRW), we find that the meme popularity distribution satisfies a very robust power- law with exponent α = 3/2 if there is an innovation process. On the other hand, if there is no innovation, then we find that the meme popularity distribution is bounded and highly skewed for early transient time periods, while it satisfies a power-law with exponent α ≠ 3/2 for intermediate time periods. The exact mapping into PDBRW clearly shows that the balance between the creation of new memes by the innovation process and the extinction of old memes is the key factor for the criticality. We confirm that the balance for the criticality sustains for relatively small innovation rate. Therefore, the innovation processes with significantly influential memes should be the simple and fundamental processes which cause the critical distribution of the meme popularity in real social networks.

The origin of the criticality in meme popularity distribution on complex networks

PubMed Central

Kim, Yup; Park, Seokjong; Yook, Soon-Hyung

2016-01-01

Previous studies showed that the meme popularity distribution is described by a heavy-tailed distribution or a power-law, which is a characteristic feature of the criticality. Here, we study the origin of the criticality on non-growing and growing networks based on the competition induced criticality model. From the direct Mote Carlo simulations and the exact mapping into the position dependent biased random walk (PDBRW), we find that the meme popularity distribution satisfies a very robust power- law with exponent α = 3/2 if there is an innovation process. On the other hand, if there is no innovation, then we find that the meme popularity distribution is bounded and highly skewed for early transient time periods, while it satisfies a power-law with exponent α ≠ 3/2 for intermediate time periods. The exact mapping into PDBRW clearly shows that the balance between the creation of new memes by the innovation process and the extinction of old memes is the key factor for the criticality. We confirm that the balance for the criticality sustains for relatively small innovation rate. Therefore, the innovation processes with significantly influential memes should be the simple and fundamental processes which cause the critical distribution of the meme popularity in real social networks. PMID:27009399

The origin of the criticality in meme popularity distribution on complex networks

NASA Astrophysics Data System (ADS)

Kim, Yup; Park, Seokjong; Yook, Soon-Hyung

2016-03-01

Previous studies showed that the meme popularity distribution is described by a heavy-tailed distribution or a power-law, which is a characteristic feature of the criticality. Here, we study the origin of the criticality on non-growing and growing networks based on the competition induced criticality model. From the direct Mote Carlo simulations and the exact mapping into the position dependent biased random walk (PDBRW), we find that the meme popularity distribution satisfies a very robust power- law with exponent α = 3/2 if there is an innovation process. On the other hand, if there is no innovation, then we find that the meme popularity distribution is bounded and highly skewed for early transient time periods, while it satisfies a power-law with exponent α ≠ 3/2 for intermediate time periods. The exact mapping into PDBRW clearly shows that the balance between the creation of new memes by the innovation process and the extinction of old memes is the key factor for the criticality. We confirm that the balance for the criticality sustains for relatively small innovation rate. Therefore, the innovation processes with significantly influential memes should be the simple and fundamental processes which cause the critical distribution of the meme popularity in real social networks.

The Evolution and Expansion of Regional Disease Surveillance Networks and Their Role in Mitigating the Threat of Infectious Disease Outbreaks

PubMed Central

Bond, Katherine C.; Macfarlane, Sarah B.; Burke, Charlanne; Ungchusak, Kumnuan; Wibulpolprasert, Suwit

2013-01-01

We examine the emergence, development, and value of regional infectious disease surveillance networks that neighboring countries worldwide are organizing to control cross-border outbreaks at their source. The regional perspective represented in the paper is intended to serve as an instructive framework for others who decide to launch such networks as new technologies and emerging threats bring countries even closer together. Distinct from more formal networks in geographic regions designated by the World Health Organization (WHO), these networks usually involve groupings of fewer countries chosen by national governments to optimize surveillance efforts. Sometimes referred to as sub-regional, these “self-organizing” networks complement national and local government recognition with informal relationships across borders among epidemiologists, scientists, ministry officials, health workers, border officers, and community members. Their development over time reflects both incremental learning and growing connections among network actors; and changing disease patterns, with infectious disease threats shifting over time from local to regional to global levels. Not only has this regional disease surveillance network model expanded across the globe, it has also expanded from a mostly practitioner-based network model to one that covers training, capacity-building, and multidisciplinary research. Today, several of these networks are linked through Connecting Organizations for Regional Disease Surveillance (CORDS). We explore how regional disease surveillance networks add value to global disease detection and response by complementing other systems and efforts, by harnessing their power to achieve other goals such as health and human security, and by helping countries adapt to complex challenges via multi-sectoral solutions. We note that governmental commitment and trust among participating individuals are critical to the success of regional infectious disease surveillance networks. PMID:23362414

Inferring Broad Regulatory Biology from Time Course Data: Have We Reached an Upper Bound under Constraints Typical of In Vivo Studies?

PubMed Central

Craddock, Travis J. A.; Fletcher, Mary Ann; Klimas, Nancy G.

2015-01-01

There is a growing appreciation for the network biology that regulates the coordinated expression of molecular and cellular markers however questions persist regarding the identifiability of these networks. Here we explore some of the issues relevant to recovering directed regulatory networks from time course data collected under experimental constraints typical of in vivo studies. NetSim simulations of sparsely connected biological networks were used to evaluate two simple feature selection techniques used in the construction of linear Ordinary Differential Equation (ODE) models, namely truncation of terms versus latent vector projection. Performance was compared with ODE-based Time Series Network Identification (TSNI) integral, and the information-theoretic Time-Delay ARACNE (TD-ARACNE). Projection-based techniques and TSNI integral outperformed truncation-based selection and TD-ARACNE on aggregate networks with edge densities of 10-30%, i.e. transcription factor, protein-protein cliques and immune signaling networks. All were more robust to noise than truncation-based feature selection. Performance was comparable on the in silico 10-node DREAM 3 network, a 5-node Yeast synthetic network designed for In vivo Reverse-engineering and Modeling Assessment (IRMA) and a 9-node human HeLa cell cycle network of similar size and edge density. Performance was more sensitive to the number of time courses than to sample frequency and extrapolated better to larger networks by grouping experiments. In all cases performance declined rapidly in larger networks with lower edge density. Limited recovery and high false positive rates obtained overall bring into question our ability to generate informative time course data rather than the design of any particular reverse engineering algorithm. PMID:25984725

States of mind: emotions, body feelings, and thoughts share distributed neural networks.

PubMed

Oosterwijk, Suzanne; Lindquist, Kristen A; Anderson, Eric; Dautoff, Rebecca; Moriguchi, Yoshiya; Barrett, Lisa Feldman

2012-09-01

Scientists have traditionally assumed that different kinds of mental states (e.g., fear, disgust, love, memory, planning, concentration, etc.) correspond to different psychological faculties that have domain-specific correlates in the brain. Yet, growing evidence points to the constructionist hypothesis that mental states emerge from the combination of domain-general psychological processes that map to large-scale distributed brain networks. In this paper, we report a novel study testing a constructionist model of the mind in which participants generated three kinds of mental states (emotions, body feelings, or thoughts) while we measured activity within large-scale distributed brain networks using fMRI. We examined the similarity and differences in the pattern of network activity across these three classes of mental states. Consistent with a constructionist hypothesis, a combination of large-scale distributed networks contributed to emotions, thoughts, and body feelings, although these mental states differed in the relative contribution of those networks. Implications for a constructionist functional architecture of diverse mental states are discussed. Copyright © 2012 Elsevier Inc. All rights reserved.

Transforming GIS data into functional road models for large-scale traffic simulation.

PubMed

Wilkie, David; Sewall, Jason; Lin, Ming C

2012-06-01

There exists a vast amount of geographic information system (GIS) data that model road networks around the world as polylines with attributes. In this form, the data are insufficient for applications such as simulation and 3D visualization-tools which will grow in power and demand as sensor data become more pervasive and as governments try to optimize their existing physical infrastructure. In this paper, we propose an efficient method for enhancing a road map from a GIS database to create a geometrically and topologically consistent 3D model to be used in real-time traffic simulation, interactive visualization of virtual worlds, and autonomous vehicle navigation. The resulting representation provides important road features for traffic simulations, including ramps, highways, overpasses, legal merge zones, and intersections with arbitrary states, and it is independent of the simulation methodologies. We test the 3D models of road networks generated by our algorithm on real-time traffic simulation using both macroscopic and microscopic techniques.

The Impact of Heterogeneity and Awareness in Modeling Epidemic Spreading on Multiplex Networks

PubMed Central

Scatà, Marialisa; Di Stefano, Alessandro; Liò, Pietro; La Corte, Aurelio

2016-01-01

In the real world, dynamic processes involving human beings are not disjoint. To capture the real complexity of such dynamics, we propose a novel model of the coevolution of epidemic and awareness spreading processes on a multiplex network, also introducing a preventive isolation strategy. Our aim is to evaluate and quantify the joint impact of heterogeneity and awareness, under different socioeconomic conditions. Considering, as case study, an emerging public health threat, Zika virus, we introduce a data-driven analysis by exploiting multiple sources and different types of data, ranging from Big Five personality traits to Google Trends, related to different world countries where there is an ongoing epidemic outbreak. Our findings demonstrate how the proposed model allows delaying the epidemic outbreak and increasing the resilience of nodes, especially under critical economic conditions. Simulation results, using data-driven approach on Zika virus, which has a growing scientific research interest, are coherent with the proposed analytic model. PMID:27848978

Fiber Access Networks: Reliability Analysis and Swedish Broadband Market

NASA Astrophysics Data System (ADS)

Wosinska, Lena; Chen, Jiajia; Larsen, Claus Popp

Fiber access network architectures such as active optical networks (AONs) and passive optical networks (PONs) have been developed to support the growing bandwidth demand. Whereas particularly Swedish operators prefer AON, this may not be the case for operators in other countries. The choice depends on a combination of technical requirements, practical constraints, business models, and cost. Due to the increasing importance of reliable access to the network services, connection availability is becoming one of the most crucial issues for access networks, which should be reflected in the network owner's architecture decision. In many cases protection against failures is realized by adding backup resources. However, there is a trade off between the cost of protection and the level of service reliability since improving reliability performance by duplication of network resources (and capital expenditures CAPEX) may be too expensive. In this paper we present the evolution of fiber access networks and compare reliability performance in relation to investment and management cost for some representative cases. We consider both standard and novel architectures for deployment in both sparsely and densely populated areas. While some recent works focused on PON protection schemes with reduced CAPEX the current and future effort should be put on minimizing the operational expenditures (OPEX) during the access network lifetime.

Evolution of the global virtual water trade network.

PubMed

Dalin, Carole; Konar, Megan; Hanasaki, Naota; Rinaldo, Andrea; Rodriguez-Iturbe, Ignacio

2012-04-17

Global freshwater resources are under increasing pressure from economic development, population growth, and climate change. The international trade of water-intensive products (e.g., agricultural commodities) or virtual water trade has been suggested as a way to save water globally. We focus on the virtual water trade network associated with international food trade built with annual trade data and annual modeled virtual water content. The evolution of this network from 1986 to 2007 is analyzed and linked to trade policies, socioeconomic circumstances, and agricultural efficiency. We find that the number of trade connections and the volume of water associated with global food trade more than doubled in 22 years. Despite this growth, constant organizational features were observed in the network. However, both regional and national virtual water trade patterns significantly changed. Indeed, Asia increased its virtual water imports by more than 170%, switching from North America to South America as its main partner, whereas North America oriented to a growing intraregional trade. A dramatic rise in China's virtual water imports is associated with its increased soy imports after a domestic policy shift in 2000. Significantly, this shift has led the global soy market to save water on a global scale, but it also relies on expanding soy production in Brazil, which contributes to deforestation in the Amazon. We find that the international food trade has led to enhanced savings in global water resources over time, indicating its growing efficiency in terms of global water use.

Skilful rainfall forecasts from artificial neural networks with long duration series and single-month optimization

NASA Astrophysics Data System (ADS)

Abbot, John; Marohasy, Jennifer

2017-11-01

General circulation models, which forecast by first modelling actual conditions in the atmosphere and ocean, are used extensively for monthly rainfall forecasting. We show how more skilful monthly and seasonal rainfall forecasts can be achieved through the mining of historical climate data using artificial neural networks (ANNs). This technique is demonstrated for two agricultural regions of Australia: the wheat belt of Western Australia and the sugar growing region of coastal Queensland. The most skilful monthly rainfall forecasts measured in terms of Ideal Point Error (IPE), and a score relative to climatology, are consistently achieved through the use of ANNs optimized for each month individually, and also by choosing to input longer historical series of climate indices. Using the longer series restricts the number of climate indices that can be used.

Morphology, Growth, and Size Limit of Bacterial Cells

NASA Astrophysics Data System (ADS)

Jiang, Hongyuan; Sun, Sean X.

2010-07-01

Bacterial cells utilize a living peptidoglycan network (PG) to separate the cell interior from the surroundings. The shape of the cell is controlled by PG synthesis and cytoskeletal proteins that form bundles and filaments underneath the cell wall. The PG layer also resists turgor pressure and protects the cell from osmotic shock. We argue that mechanical influences alter the chemical equilibrium of the reversible PG assembly and determine the cell shape and cell size. Using a mechanochemical approach, we show that the cell shape can be regarded as a steady state of a growing network under the influence of turgor pressure and mechanical stress. Using simple elastic models, we predict the size of common spherical and rodlike bacteria. The influence of cytoskeletal bundles such as crescentin and MreB are discussed within the context of our model.

A formal protocol test procedure for the Survivable Adaptable Fiber Optic Embedded Network (SAFENET)

NASA Astrophysics Data System (ADS)

High, Wayne

1993-03-01

This thesis focuses upon a new method for verifying the correct operation of a complex, high speed fiber optic communication network. These networks are of growing importance to the military because of their increased connectivity, survivability, and reconfigurability. With the introduction and increased dependence on sophisticated software and protocols, it is essential that their operation be correct. Because of the speed and complexity of fiber optic networks being designed today, they are becoming increasingly difficult to test. Previously, testing was accomplished by application of conformance test methods which had little connection with an implementation's specification. The major goal of conformance testing is to ensure that the implementation of a profile is consistent with its specification. Formal specification is needed to ensure that the implementation performs its intended operations while exhibiting desirable behaviors. The new conformance test method presented is based upon the System of Communicating Machine model which uses a formal protocol specification to generate a test sequence. The major contribution of this thesis is the application of the System of Communicating Machine model to formal profile specifications of the Survivable Adaptable Fiber Optic Embedded Network (SAFENET) standard which results in the derivation of test sequences for a SAFENET profile. The results applying this new method to SAFENET's OSI and Lightweight profiles are presented.

Building Modelling Methodologies for Virtual District Heating and Cooling Networks

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

Saurav, Kumar; Choudhury, Anamitra R.; Chandan, Vikas

District heating and cooling systems (DHC) are a proven energy solution that has been deployed for many years in a growing number of urban areas worldwide. They comprise a variety of technologies that seek to develop synergies between the production and supply of heat, cooling, domestic hot water and electricity. Although the benefits of DHC systems are significant and have been widely acclaimed, yet the full potential of modern DHC systems remains largely untapped. There are several opportunities for development of energy efficient DHC systems, which will enable the effective exploitation of alternative renewable resources, waste heat recovery, etc., inmore » order to increase the overall efficiency and facilitate the transition towards the next generation of DHC systems. This motivated the need for modelling these complex systems. Large-scale modelling of DHC-networks is challenging, as it has several components interacting with each other. In this paper we present two building methodologies to model the consumer buildings. These models will be further integrated with network model and the control system layer to create a virtual test bed for the entire DHC system. The model is validated using data collected from a real life DHC system located at Lulea, a city on the coast of northern Sweden. The test bed will be then used for simulating various test cases such as peak energy reduction, overall demand reduction etc.« less

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

Multi-criteria anomaly detection in urban noise sensor networks.

PubMed

Dauwe, Samuel; Oldoni, Damiano; De Baets, Bernard; Van Renterghem, Timothy; Botteldooren, Dick; Dhoedt, Bart

2014-01-01

The growing concern of citizens about the quality of their living environment and the emergence of low-cost microphones and data acquisition systems triggered the deployment of numerous noise monitoring networks spread over large geographical areas. Due to the local character of noise pollution in an urban environment, a dense measurement network is needed in order to accurately assess the spatial and temporal variations. The use of consumer grade microphones in this context appears to be very cost-efficient compared to the use of measurement microphones. However, the lower reliability of these sensing units requires a strong quality control of the measured data. To automatically validate sensor (microphone) data, prior to their use in further processing, a multi-criteria measurement quality assessment model for detecting anomalies such as microphone breakdowns, drifts and critical outliers was developed. Each of the criteria results in a quality score between 0 and 1. An ordered weighted average (OWA) operator combines these individual scores into a global quality score. The model is validated on datasets acquired from a real-world, extensive noise monitoring network consisting of more than 50 microphones. Over a period of more than a year, the proposed approach successfully detected several microphone faults and anomalies.

Real-time identification of indoor pollutant source positions based on neural network locator of contaminant sources and optimized sensor networks.

PubMed

Vukovic, Vladimir; Tabares-Velasco, Paulo Cesar; Srebric, Jelena

2010-09-01

A growing interest in security and occupant exposure to contaminants revealed a need for fast and reliable identification of contaminant sources during incidental situations. To determine potential contaminant source positions in outdoor environments, current state-of-the-art modeling methods use computational fluid dynamic simulations on parallel processors. In indoor environments, current tools match accidental contaminant distributions with cases from precomputed databases of possible concentration distributions. These methods require intensive computations in pre- and postprocessing. On the other hand, neural networks emerged as a tool for rapid concentration forecasting of outdoor environmental contaminants such as nitrogen oxides or sulfur dioxide. All of these modeling methods depend on the type of sensors used for real-time measurements of contaminant concentrations. A review of the existing sensor technologies revealed that no perfect sensor exists, but intensity of work in this area provides promising results in the near future. The main goal of the presented research study was to extend neural network modeling from the outdoor to the indoor identification of source positions, making this technology applicable to building indoor environments. The developed neural network Locator of Contaminant Sources was also used to optimize number and allocation of contaminant concentration sensors for real-time prediction of indoor contaminant source positions. Such prediction should take place within seconds after receiving real-time contaminant concentration sensor data. For the purpose of neural network training, a multizone program provided distributions of contaminant concentrations for known source positions throughout a test building. Trained networks had an output indicating contaminant source positions based on measured concentrations in different building zones. A validation case based on a real building layout and experimental data demonstrated the ability of this method to identify contaminant source positions. Future research intentions are focused on integration with real sensor networks and model improvements for much more complicated contamination scenarios.

Atmospheric Mercury Deposition Monitoring – National Atmospheric Deposition Program (NADP)

EPA Science Inventory

The National Atmospheric Deposition Program (NADP) developed and operates a collaborative network of atmospheric mercury monitoring sites based in North America – the Atmospheric Mercury Network (AMNet). The justification for the network was growing interest and demand from many ...

DEFINING THE PLAYERS IN HIGHER-ORDER NETWORKS: PREDICTIVE MODELING FOR REVERSE ENGINEERING FUNCTIONAL INFLUENCE NETWORKS

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

McDermott, Jason E.; Costa, Michelle N.; Stevens, S.L.

A difficult problem that is currently growing rapidly due to the sharp increase in the amount of high-throughput data available for many systems is that of determining useful and informative causative influence networks. These networks can be used to predict behavior given observation of a small number of components, predict behavior at a future time point, or identify components that are critical to the functioning of the system under particular conditions. In these endeavors incorporating observations of systems from a wide variety of viewpoints can be particularly beneficial, but has often been undertaken with the objective of inferring networks thatmore » are generally applicable. The focus of the current work is to integrate both general observations and measurements taken for a particular pathology, that of ischemic stroke, to provide improved ability to produce useful predictions of systems behavior. A number of hybrid approaches have recently been proposed for network generation in which the Gene Ontology is used to filter or enrich network links inferred from gene expression data through reverse engineering methods. These approaches have been shown to improve the biological plausibility of the inferred relationships determined, but still treat knowledge-based and machine-learning inferences as incommensurable inputs. In this paper, we explore how further improvements may be achieved through a full integration of network inference insights achieved through application of the Gene Ontology and reverse engineering methods with specific reference to the construction of dynamic models of transcriptional regulatory networks. We show that integrating two approaches to network construction, one based on reverse-engineering from conditional transcriptional data, one based on reverse-engineering from in situ hybridization data, and another based on functional associations derived from Gene Ontology, using probabilities can improve results of clustering as evaluated by a predictive model of transcriptional expression levels.« less

Accelerating the Delivery of Home Performance Upgrades through a Synergistic Business Model

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

Schirber, Tom; Ojczyk, Cindy

Achieving Building America energy savings goals (40% by 2030) will require many existing homes to install energy upgrades. Engaging large numbers of homeowners in building science-guided upgrades during a single remodeling event has been difficult for a number of reasons. Performance upgrades in existing homes tend to occur over multiple years and usually result from component failures (furnace failure) and weather damage (ice dams, roofing, siding). This research attempted to: A) understand the homeowner's motivations regarding investing in building science based performance upgrades; B) determining a rapidly scalable approach to engage large numbers of homeowners directly through existing customer networks;more » and C) access a business model that will manage all aspects of the contractor-homeowner-performance professional interface to ensure good upgrade decisions over time. The solution results from a synergistic approach utilizing networks of suppliers merging with networks of homeowner customers. Companies in the $400 to $800 billion home services industry have proven direct marketing and sales proficiencies that have led to the development of vast customer networks. Companies such as pest control, lawn care, and security have nurtured these networks by successfully addressing the ongoing needs of homes. This long-term access to customers and trust established with consistent delivery has also provided opportunities for home service providers to grow by successfully introducing new products and services like attic insulation and air sealing. The most important component for success is a business model that will facilitate and manage the process. The team analyzes a group that developed a working model.« less

Building America Case Study: Accelerating the Delivery of Home-Performance Upgrades Using a Synergistic Business Model, Minneapolis, Minnesota

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

Achieving Building America energy savings goals (40 percent by 2030) will require many existing homes to install energy upgrades. Engaging large numbers of homeowners in building science-guided upgrades during a single remodeling event has been difficult for a number of reasons. Performance upgrades in existing homes tend to occur over multiple years and usually result from component failures (furnace failure) and weather damage (ice dams, roofing, siding). This research attempted to: A) Understand the homeowner's motivations regarding investing in building science based performance upgrades. B) Determining a rapidly scalable approach to engage large numbers of homeowners directly through existing customermore » networks. C) Access a business model that will manage all aspects of the contractor-homeowner-performance professional interface to ensure good upgrade decisions over time. The solution results from a synergistic approach utilizing networks of suppliers merging with networks of homeowner customers. Companies in the $400 to $800 billion home services industry have proven direct marketing and sales proficiencies that have led to the development of vast customer networks. Companies such as pest control, lawn care, and security have nurtured these networks by successfully addressing the ongoing needs of homes. This long-term access to customers and trust established with consistent delivery has also provided opportunities for home service providers to grow by successfully introducing new products and services like attic insulation and air sealing. The most important component for success is a business model that will facilitate and manage the process. The team analyzes a group that developed a working model.« less

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

PubMed

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

2015-08-06

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

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

PubMed Central

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

2015-01-01

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

The Applied Mathematics for Power Systems (AMPS)

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

Chertkov, Michael

2012-07-24

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

An overview of mesoscale aerosol processes, comparisons, and validation studies from DRAGON networks

NASA Astrophysics Data System (ADS)

Holben, Brent N.; Kim, Jhoon; Sano, Itaru; Mukai, Sonoyo; Eck, Thomas F.; Giles, David M.; Schafer, Joel S.; Sinyuk, Aliaksandr; Slutsker, Ilya; Smirnov, Alexander; Sorokin, Mikhail; Anderson, Bruce E.; Che, Huizheng; Choi, Myungje; Crawford, James H.; Ferrare, Richard A.; Garay, Michael J.; Jeong, Ukkyo; Kim, Mijin; Kim, Woogyung; Knox, Nichola; Li, Zhengqiang; Lim, Hwee S.; Liu, Yang; Maring, Hal; Nakata, Makiko; Pickering, Kenneth E.; Piketh, Stuart; Redemann, Jens; Reid, Jeffrey S.; Salinas, Santo; Seo, Sora; Tan, Fuyi; Tripathi, Sachchida N.; Toon, Owen B.; Xiao, Qingyang

2018-01-01

Over the past 24 years, the AErosol RObotic NETwork (AERONET) program has provided highly accurate remote-sensing characterization of aerosol optical and physical properties for an increasingly extensive geographic distribution including all continents and many oceanic island and coastal sites. The measurements and retrievals from the AERONET global network have addressed satellite and model validation needs very well, but there have been challenges in making comparisons to similar parameters from in situ surface and airborne measurements. Additionally, with improved spatial and temporal satellite remote sensing of aerosols, there is a need for higher spatial-resolution ground-based remote-sensing networks. An effort to address these needs resulted in a number of field campaign networks called Distributed Regional Aerosol Gridded Observation Networks (DRAGONs) that were designed to provide a database for in situ and remote-sensing comparison and analysis of local to mesoscale variability in aerosol properties. This paper describes the DRAGON deployments that will continue to contribute to the growing body of research related to meso- and microscale aerosol features and processes. The research presented in this special issue illustrates the diversity of topics that has resulted from the application of data from these networks.

Sparse short-distance connections enhance calcium wave propagation in a 3D model of astrocyte networks

PubMed Central

Lallouette, Jules; De Pittà, Maurizio; Ben-Jacob, Eshel; Berry, Hugues

2014-01-01

Traditionally, astrocytes have been considered to couple via gap-junctions into a syncytium with only rudimentary spatial organization. However, this view is challenged by growing experimental evidence that astrocytes organize as a proper gap-junction mediated network with more complex region-dependent properties. On the other hand, the propagation range of intercellular calcium waves (ICW) within astrocyte populations is as well highly variable, depending on the brain region considered. This suggests that the variability of the topology of gap-junction couplings could play a role in the variability of the ICW propagation range. Since this hypothesis is very difficult to investigate with current experimental approaches, we explore it here using a biophysically realistic model of three-dimensional astrocyte networks in which we varied the topology of the astrocyte network, while keeping intracellular properties and spatial cell distribution and density constant. Computer simulations of the model suggest that changing the topology of the network is indeed sufficient to reproduce the distinct ranges of ICW propagation reported experimentally. Unexpectedly, our simulations also predict that sparse connectivity and restriction of gap-junction couplings to short distances should favor propagation while long–distance or dense connectivity should impair it. Altogether, our results provide support to recent experimental findings that point toward a significant functional role of the organization of gap-junction couplings into proper astroglial networks. Dynamic control of this topology by neurons and signaling molecules could thus constitute a new type of regulation of neuron-glia and glia-glia interactions. PMID:24795613

Scaling of Average Weighted Receiving Time on Double-Weighted Koch Networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Ye, Dandan; Hou, Jie; Li, Xingyi

2015-03-01

In this paper, we introduce a model of the double-weighted Koch networks based on actual road networks depending on the two weight factors w,r ∈ (0, 1]. The double weights represent the capacity-flowing weight and the cost-traveling weight, respectively. Denote by wFij the capacity-flowing weight connecting the nodes i and j, and denote by wCij the cost-traveling weight connecting the nodes i and j. Let wFij be related to the weight factor w, and let wCij be related to the weight factor r. This paper assumes that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. We define the average weighted receiving time (AWRT) on the double-weighted Koch networks. The obtained result displays that in the large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(w,r) = ½ log2(1 + 3wr). We show that the AWRT exhibits a sublinear or linear dependence on network order. Thus, the double-weighted Koch networks are more efficient than classic Koch networks in receiving information.

Data-driven reverse engineering of signaling pathways using ensembles of dynamic models.

PubMed

Henriques, David; Villaverde, Alejandro F; Rocha, Miguel; Saez-Rodriguez, Julio; Banga, Julio R

2017-02-01

Despite significant efforts and remarkable progress, the inference of signaling networks from experimental data remains very challenging. The problem is particularly difficult when the objective is to obtain a dynamic model capable of predicting the effect of novel perturbations not considered during model training. The problem is ill-posed due to the nonlinear nature of these systems, the fact that only a fraction of the involved proteins and their post-translational modifications can be measured, and limitations on the technologies used for growing cells in vitro, perturbing them, and measuring their variations. As a consequence, there is a pervasive lack of identifiability. To overcome these issues, we present a methodology called SELDOM (enSEmbLe of Dynamic lOgic-based Models), which builds an ensemble of logic-based dynamic models, trains them to experimental data, and combines their individual simulations into an ensemble prediction. It also includes a model reduction step to prune spurious interactions and mitigate overfitting. SELDOM is a data-driven method, in the sense that it does not require any prior knowledge of the system: the interaction networks that act as scaffolds for the dynamic models are inferred from data using mutual information. We have tested SELDOM on a number of experimental and in silico signal transduction case-studies, including the recent HPN-DREAM breast cancer challenge. We found that its performance is highly competitive compared to state-of-the-art methods for the purpose of recovering network topology. More importantly, the utility of SELDOM goes beyond basic network inference (i.e. uncovering static interaction networks): it builds dynamic (based on ordinary differential equation) models, which can be used for mechanistic interpretations and reliable dynamic predictions in new experimental conditions (i.e. not used in the training). For this task, SELDOM's ensemble prediction is not only consistently better than predictions from individual models, but also often outperforms the state of the art represented by the methods used in the HPN-DREAM challenge.

Biological signatures of dynamic river networks from a coupled landscape evolution and neutral community model

NASA Astrophysics Data System (ADS)

Stokes, M.; Perron, J. T.

2017-12-01

Freshwater systems host exceptionally species-rich communities whose spatial structure is dictated by the topology of the river networks they inhabit. Over geologic time, river networks are dynamic; drainage basins shrink and grow, and river capture establishes new connections between previously separated regions. It has been hypothesized that these changes in river network structure influence the evolution of life by exchanging and isolating species, perhaps boosting biodiversity in the process. However, no general model exists to predict the evolutionary consequences of landscape change. We couple a neutral community model of freshwater organisms to a landscape evolution model in which the river network undergoes drainage divide migration and repeated river capture. Neutral community models are macro-ecological models that include stochastic speciation and dispersal to produce realistic patterns of biodiversity. We explore the consequences of three modes of speciation - point mutation, time-protracted, and vicariant (geographic) speciation - by tracking patterns of diversity in time and comparing the final result to an equilibrium solution of the neutral model on the final landscape. Under point mutation, a simple model of stochastic and instantaneous speciation, the results are identical to the equilibrium solution and indicate the dominance of the species-area relationship in forming patterns of diversity. The number of species in a basin is proportional to its area, and regional species richness reaches its maximum when drainage area is evenly distributed among sub-basins. Time-protracted speciation is also modeled as a stochastic process, but in order to produce more realistic rates of diversification, speciation is not assumed to be instantaneous. Rather, each new species must persist for a certain amount of time before it is considered to be established. When vicariance (geographic speciation) is included, there is a transient signature of increased regional diversity after river capture. The results indicate that the mode of speciation and the rate of speciation relative to the rate of divide migration determine the evolutionary signature of river capture.

Data-driven reverse engineering of signaling pathways using ensembles of dynamic models

PubMed Central

Henriques, David; Villaverde, Alejandro F.; Banga, Julio R.

2017-01-01

Despite significant efforts and remarkable progress, the inference of signaling networks from experimental data remains very challenging. The problem is particularly difficult when the objective is to obtain a dynamic model capable of predicting the effect of novel perturbations not considered during model training. The problem is ill-posed due to the nonlinear nature of these systems, the fact that only a fraction of the involved proteins and their post-translational modifications can be measured, and limitations on the technologies used for growing cells in vitro, perturbing them, and measuring their variations. As a consequence, there is a pervasive lack of identifiability. To overcome these issues, we present a methodology called SELDOM (enSEmbLe of Dynamic lOgic-based Models), which builds an ensemble of logic-based dynamic models, trains them to experimental data, and combines their individual simulations into an ensemble prediction. It also includes a model reduction step to prune spurious interactions and mitigate overfitting. SELDOM is a data-driven method, in the sense that it does not require any prior knowledge of the system: the interaction networks that act as scaffolds for the dynamic models are inferred from data using mutual information. We have tested SELDOM on a number of experimental and in silico signal transduction case-studies, including the recent HPN-DREAM breast cancer challenge. We found that its performance is highly competitive compared to state-of-the-art methods for the purpose of recovering network topology. More importantly, the utility of SELDOM goes beyond basic network inference (i.e. uncovering static interaction networks): it builds dynamic (based on ordinary differential equation) models, which can be used for mechanistic interpretations and reliable dynamic predictions in new experimental conditions (i.e. not used in the training). For this task, SELDOM’s ensemble prediction is not only consistently better than predictions from individual models, but also often outperforms the state of the art represented by the methods used in the HPN-DREAM challenge. PMID:28166222

Trading Speed and Accuracy by Coding Time: A Coupled-circuit Cortical Model

PubMed Central

Standage, Dominic; You, Hongzhi; Wang, Da-Hui; Dorris, Michael C.

2013-01-01

Our actions take place in space and time, but despite the role of time in decision theory and the growing acknowledgement that the encoding of time is crucial to behaviour, few studies have considered the interactions between neural codes for objects in space and for elapsed time during perceptual decisions. The speed-accuracy trade-off (SAT) provides a window into spatiotemporal interactions. Our hypothesis is that temporal coding determines the rate at which spatial evidence is integrated, controlling the SAT by gain modulation. Here, we propose that local cortical circuits are inherently suited to the relevant spatial and temporal coding. In simulations of an interval estimation task, we use a generic local-circuit model to encode time by ‘climbing’ activity, seen in cortex during tasks with a timing requirement. The model is a network of simulated pyramidal cells and inhibitory interneurons, connected by conductance synapses. A simple learning rule enables the network to quickly produce new interval estimates, which show signature characteristics of estimates by experimental subjects. Analysis of network dynamics formally characterizes this generic, local-circuit timing mechanism. In simulations of a perceptual decision task, we couple two such networks. Network function is determined only by spatial selectivity and NMDA receptor conductance strength; all other parameters are identical. To trade speed and accuracy, the timing network simply learns longer or shorter intervals, driving the rate of downstream decision processing by spatially non-selective input, an established form of gain modulation. Like the timing network's interval estimates, decision times show signature characteristics of those by experimental subjects. Overall, we propose, demonstrate and analyse a generic mechanism for timing, a generic mechanism for modulation of decision processing by temporal codes, and we make predictions for experimental verification. PMID:23592967

Post-conflict struggles as networks of problems: A network analysis of trauma, daily stressors and psychological distress among Sri Lankan war survivors.

PubMed

Jayawickreme, Nuwan; Mootoo, Candace; Fountain, Christine; Rasmussen, Andrew; Jayawickreme, Eranda; Bertuccio, Rebecca F

2017-10-01

A growing body of literature indicates that the mental distress experienced by survivors of war is a function of both experienced trauma and stressful life events. However, the majority of these studies are limited in that they 1) employ models of psychological distress that emphasize underlying latent constructs and do not allow researchers to examine the unique associations between particular symptoms and various stressors; and 2) use one or more measures that were not developed for that particular context and thus may exclude key traumas, stressful life events and symptoms of psychopathology. The current study addresses both these limitations by 1) using a novel conceptual model, network analysis, which assumes that symptoms covary with each other not because they stem from a latent construct, but rather because they represent meaningful relationships between the symptoms; and 2) employing a locally developed measure of experienced trauma, stressful life problems and symptoms of psychopathology. Over the course of 2009-2011, 337 survivors of the Sri Lankan civil war were administered the Penn-RESIST-Peradeniya War Problems Questionnaire (PRPWPQ). Network analysis revealed that symptoms of psychopathology, problems pertaining to lack of basic needs, and social problems were central to the network relative to experienced trauma and other types of problems. After controlling for shared associations, social problems in particular were the most central, significantly more so than traumatic events and family problems. Several particular traumatic events, stressful life events and symptoms of psychopathology that were central to the network were also identified. Discussion emphasizes the utility of such network models to researchers and practitioners determining how to spend limited resources in the most impactful way possible. Copyright © 2017 Elsevier Ltd. All rights reserved.

On Parallelizing Single Dynamic Simulation Using HPC Techniques and APIs of Commercial Software

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

Diao, Ruisheng; Jin, Shuangshuang; Howell, Frederic

Time-domain simulations are heavily used in today’s planning and operation practices to assess power system transient stability and post-transient voltage/frequency profiles following severe contingencies to comply with industry standards. Because of the increased modeling complexity, it is several times slower than real time for state-of-the-art commercial packages to complete a dynamic simulation for a large-scale model. With the growing stochastic behavior introduced by emerging technologies, power industry has seen a growing need for performing security assessment in real time. This paper presents a parallel implementation framework to speed up a single dynamic simulation by leveraging the existing stability model librarymore » in commercial tools through their application programming interfaces (APIs). Several high performance computing (HPC) techniques are explored such as parallelizing the calculation of generator current injection, identifying fast linear solvers for network solution, and parallelizing data outputs when interacting with APIs in the commercial package, TSAT. The proposed method has been tested on a WECC planning base case with detailed synchronous generator models and exhibits outstanding scalable performance with sufficient accuracy.« less

Dynamics of a nuclear invasion

NASA Astrophysics Data System (ADS)

Roper, Marcus; Simonin, Anna; Glass, N. Louise

2009-11-01

Filamentous fungi grow as a network of continuous interconnected tubes, containing nuclei that move freely through a shared cytoplasm. Wild fungi are frequently chimerical: two nuclei from the same physiological individual may be genetically different. Such internal diversity can arise either from spontaneous mutations during nuclear division, or by nuclear exchange when two individuals fuse, sharing their resources and organelles to become a single individual. This diversity is thought to be essential to adaptation in plant pathogens, allowing, for instance, an invading fungus to present many different genetic identities against its host's immune response. However, it is clear that the presence of multiple genetic lineages within the same physiological individual can also pose challenges - lineages that are present in growing hyphal tips will multiply preferentially. Nuclei must therefore be kept well mixed across a growing front. By applying models developed to describe mixing of fluids in microfluidic reactors to experimental observations of lineage mixing in a growing Neurospora crassa colony, we show how this mixing is achieved. In particular we analyze the individual contributions from interdigitation of hyphae and from nuclear transport.

A novel growth mode of Physarum polycephalum during starvation

NASA Astrophysics Data System (ADS)

Lee, Jonghyun; Oettmeier, Christina; Döbereiner, Hans-Günther

2018-06-01

Organisms are constantly looking to forage and respond to various environmental queues to maximize their chance of survival. This is reflected in the unicellular organism Physarum polycephalum, which is known to grow as an optimized network. Here, we describe a new growth pattern of Physarum mesoplasmodium, where sheet-like motile bodies termed ‘satellites’ are formed. This non-network pattern formation is induced only when nutrients are scarce, suggesting that it is a type of emergency response. Our goal is to construct a model to describe the behaviour of satellites based on negative chemotaxis. We conjecture a diffusion-based model which implements detection of a signal molecule above a threshold concentration. Then we calculate how far the satellites must travel until the concentration signal falls below the threshold. These calculated distances are in good agreement with the distances where satellites stop. Based on the Akaike weight analysis, our threshold model is at least 2.3 times more likely to be the better model than the others we have considered. Based on the model, we estimate the diffusion coefficient of this molecule, which corresponds to typical signalling molecules.

Detecting spatial ontogenetic niche shifts in complex dendritic ecological networks

USGS Publications Warehouse

Fields, William R.; Grant, Evan H. Campbell; Lowe, Winsor H.

2017-01-01

Ontogenetic niche shifts (ONS) are important drivers of population and community dynamics, but they can be difficult to identify for species with prolonged larval or juvenile stages, or for species that inhabit continuous habitats. Most studies of ONS focus on single transitions among discrete habitat patches at local scales. However, for species with long larval or juvenile periods, affinity for particular locations within connected habitat networks may differ among cohorts. The resulting spatial patterns of distribution can result from a combination of landscape-scale habitat structure, position of a habitat patch within a network, and local habitat characteristics—all of which may interact and change as individuals grow. We estimated such spatial ONS for spring salamanders (Gyrinophilus porphyriticus), which have a larval period that can last 4 years or more. Using mixture models to identify larval cohorts from size frequency data, we fit occupancy models for each age class using two measures of the branching structure of stream networks and three measures of stream network position. Larval salamander cohorts showed different preferences for the position of a site within the stream network, and the strength of these responses depended on the basin-wide spatial structure of the stream network. The isolation of a site had a stronger effect on occupancy in watersheds with more isolated headwater streams, while the catchment area, which is associated with gradients in stream habitat, had a stronger effect on occupancy in watersheds with more paired headwater streams. Our results show that considering the spatial structure of habitat networks can provide new insights on ONS in long-lived species.

Phase Transition for the Maki-Thompson Rumour Model on a Small-World Network

NASA Astrophysics Data System (ADS)

Agliari, Elena; Pachon, Angelica; Rodriguez, Pablo M.; Tavani, Flavia

2017-11-01

We consider the Maki-Thompson model for the stochastic propagation of a rumour within a population. In this model the population is made up of "spreaders", "ignorants" and "stiflers"; any spreader attempts to pass the rumour to the other individuals via pair-wise interactions and in case the other individual is an ignorant, it becomes a spreader, while in the other two cases the initiating spreader turns into a stifler. In a finite population the process will eventually reach an equilibrium situation where individuals are either stiflers or ignorants. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model, in such a way that interactions occur only between nearest-neighbours. This structure is realized starting from a k-regular ring and by inserting, in the average, c additional links in such a way that k and c are tuneable parameters for the population architecture. We prove that this system exhibits a transition between regimes of localization (where the final number of stiflers is at most logarithmic in the population size) and propagation (where the final number of stiflers grows algebraically with the population size) at a finite value of the network parameter c. A quantitative estimate for the critical value of c is obtained via extensive numerical simulations.

Engineering of functional, perfusable 3D microvascular networks on a chip.

PubMed

Kim, Sudong; Lee, Hyunjae; Chung, Minhwan; Jeon, Noo Li

2013-04-21

Generating perfusable 3D microvessels in vitro is an important goal for tissue engineering, as well as for reliable modelling of blood vessel function. To date, in vitro blood vessel models have not been able to accurately reproduce the dynamics and responses of endothelial cells to grow perfusable and functional 3D vascular networks. Here we describe a microfluidic-based platform whereby we model natural cellular programs found during normal development and angiogenesis to form perfusable networks of intact 3D microvessels as well as tumor vasculatures based on the spatially controlled co-culture of endothelial cells with stromal fibroblasts, pericytes or cancer cells. The microvessels possess the characteristic morphological and biochemical markers of in vivo blood vessels, and exhibit strong barrier function and long-term stability. An open, unobstructed microvasculature allows the delivery of nutrients, chemical compounds, biomolecules and cell suspensions, as well as flow-induced mechanical stimuli into the luminal space of the endothelium, and exhibits faithful responses to physiological shear stress as demonstrated by cytoskeleton rearrangement and increased nitric oxide synthesis. This simple and versatile platform provides a wide range of applications in vascular physiology studies as well as in developing vascularized organ-on-a-chip and human disease models for pharmaceutical screening.

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.

Rapid neutral-neutral reactions at low temperatures: a new network and first results for TMC-1

NASA Astrophysics Data System (ADS)

Smith, Ian W. M.; Herbst, Eric; Chang, Qiang

2004-05-01

There is now ample evidence from an assortment of experiments, especially those involving the CRESU (Cinétique de Réaction en Ecoulement Supersonique Uniforme) technique, that a variety of neutral-neutral reactions possess no activation energy barrier and are quite rapid at very low temperatures. These reactions include both radical-radical systems and, more surprisingly, systems involving an atom or a radical and one `stable' species. Generalizing from the small but growing number of systems studied in the laboratory, we estimate reaction rate coefficients for a larger number of such reactions and include these estimates in a new network of gas-phase reactions for use in low-temperature interstellar chemistry. Designated osu.2003, the new network is available on the World Wide Web and will be continually updated. A table of new results for molecular abundances in the dark cloud TMC-1 (CP) is provided and compared with results from an older (new standard model; nsm) network.

Hybrid multiphoton volumetric functional imaging of large-scale bioengineered neuronal networks

NASA Astrophysics Data System (ADS)

Dana, Hod; Marom, Anat; Paluch, Shir; Dvorkin, Roman; Brosh, Inbar; Shoham, Shy

2014-06-01

Planar neural networks and interfaces serve as versatile in vitro models of central nervous system physiology, but adaptations of related methods to three dimensions (3D) have met with limited success. Here, we demonstrate for the first time volumetric functional imaging in a bioengineered neural tissue growing in a transparent hydrogel with cortical cellular and synaptic densities, by introducing complementary new developments in nonlinear microscopy and neural tissue engineering. Our system uses a novel hybrid multiphoton microscope design combining a 3D scanning-line temporal-focusing subsystem and a conventional laser-scanning multiphoton microscope to provide functional and structural volumetric imaging capabilities: dense microscopic 3D sampling at tens of volumes per second of structures with mm-scale dimensions containing a network of over 1,000 developing cells with complex spontaneous activity patterns. These developments open new opportunities for large-scale neuronal interfacing and for applications of 3D engineered networks ranging from basic neuroscience to the screening of neuroactive substances.

Multi-Agent Inference in Social Networks: A Finite Population Learning Approach

PubMed Central

Tong, Xin; Zeng, Yao

2016-01-01

When people in a society want to make inference about some parameter, each person may want to use data collected by other people. Information (data) exchange in social networks is usually costly, so to make reliable statistical decisions, people need to trade off the benefits and costs of information acquisition. Conflicts of interests and coordination problems will arise in the process. Classical statistics does not consider people’s incentives and interactions in the data collection process. To address this imperfection, this work explores multi-agent Bayesian inference problems with a game theoretic social network model. Motivated by our interest in aggregate inference at the societal level, we propose a new concept, finite population learning, to address whether with high probability, a large fraction of people in a given finite population network can make “good” inference. Serving as a foundation, this concept enables us to study the long run trend of aggregate inference quality as population grows. PMID:27076691

Landscape genetics of high mountain frog metapopulations

USGS Publications Warehouse

Murphy, M.A.; Dezzani, R.; Pilliod, D.S.; Storfer, A.

2010-01-01

Explaining functional connectivity among occupied habitats is crucial for understanding metapopulation dynamics and species ecology. Landscape genetics has primarily focused on elucidating how ecological features between observations influence gene flow. Functional connectivity, however, may be the result of both these between-site (landscape resistance) landscape characteristics and at-site (patch quality) landscape processes that can be captured using network based models. We test hypotheses of functional connectivity that include both between-site and at-site landscape processes in metapopulations of Columbia spotted frogs (Rana luteiventris) by employing a novel justification of gravity models for landscape genetics (eight microsatellite loci, 37 sites, n = 441). Primarily used in transportation and economic geography, gravity models are a unique approach as flow (e.g. gene flow) is explained as a function of three basic components: distance between sites, production/attraction (e.g. at-site landscape process) and resistance (e.g. between-site landscape process). The study system contains a network of nutrient poor high mountain lakes where we hypothesized a short growing season and complex topography between sites limit R. luteiventris gene flow. In addition, we hypothesized production of offspring is limited by breeding site characteristics such as the introduction of predatory fish and inherent site productivity. We found that R. luteiventris connectivity was negatively correlated with distance between sites, presence of predatory fish (at-site) and topographic complexity (between-site). Conversely, site productivity (as measured by heat load index, at-site) and growing season (as measured by frost-free period between-sites) were positively correlated with gene flow. The negative effect of predation and positive effect of site productivity, in concert with bottleneck tests, support the presence of source-sink dynamics. In conclusion, gravity models provide a powerful new modelling approach for examining a wide range of both basic and applied questions in landscape genetics.

Adoption of Social Networking in Education: A Study of the Use of Social Networks by Higher Education Students in Oman

ERIC Educational Resources Information Center

Al-Mukhaini, Elham M.; Al-Qayoudhi, Wafa S.; Al-Badi, Ali H.

2014-01-01

The use of social networks is a growing phenomenon, being increasingly important in both private and academic life. Social networks are used as tools to enable users to have social interaction. The use of social networks (SNs) complements and enhances the teaching in traditional classrooms. For example, YouTube, Facebook, wikis, and blogs provide…

Uncovering collective listening habits and music genres in bipartite networks.

PubMed

Lambiotte, R; Ausloos, M

2005-12-01

In this paper, we analyze web-downloaded data on people sharing their music library, that we use as their individual musical signatures. The system is represented by a bipartite network, nodes being the music groups and the listeners. Music groups' audience size behaves like a power law, but the individual music library size is an exponential with deviations at small values. In order to extract structures from the network, we focus on correlation matrices, that we filter by removing the least correlated links. This percolation idea-based method reveals the emergence of social communities and music genres, that are visualized by a branching representation. Evidence of collective listening habits that do not fit the neat usual genres defined by the music industry indicates an alternative way of classifying listeners and music groups. The structure of the network is also studied by a more refined method, based upon a random walk exploration of its properties. Finally, a personal identification-community imitation model for growing bipartite networks is outlined, following Potts ingredients. Simulation results do reproduce quite well the empirical data.

Raspberry Shake- A World-Wide Citizen Seismograph Network

NASA Astrophysics Data System (ADS)

Christensen, B. C.; Blanco Chia, J. F.

2017-12-01

Raspberry Shake was conceived as an inexpensive plug-and-play solution to satisfy the need for universal, quick and accurate earthquake detections. First launched on Kickstarter's crowdfunding platform in July of 2016, the Raspberry Shake project was funded within hours of the launch date and, by the end of the campaign, reached more than 1000% of its initial funding goal. This demonstrated for the first time that there exists a strong interest among Makers, Hobbyists and Do It Yourselfers for personal seismographs. From here, a citizen scientist network was created and it has steadily been growing. The Raspberry Shake network is currently being used in conjunction with publicly available broadband data from the GSN and other state-run seismic networks available through the IRIS, Geoscope and GEOFON data centers to detect and locate earthquakes large and small around the globe. Raspberry Shake looks well positioned to improve local monitoring of earthquakes on a global scale, deepen community's understanding of earthquakes, and serve as a formidable teaching tool. We present the main results of the project, the current state of the network, and the new Raspberry Shake models that are being built.

Uncovering collective listening habits and music genres in bipartite networks

NASA Astrophysics Data System (ADS)

Lambiotte, R.; Ausloos, M.

2005-12-01

In this paper, we analyze web-downloaded data on people sharing their music library, that we use as their individual musical signatures. The system is represented by a bipartite network, nodes being the music groups and the listeners. Music groups’ audience size behaves like a power law, but the individual music library size is an exponential with deviations at small values. In order to extract structures from the network, we focus on correlation matrices, that we filter by removing the least correlated links. This percolation idea-based method reveals the emergence of social communities and music genres, that are visualized by a branching representation. Evidence of collective listening habits that do not fit the neat usual genres defined by the music industry indicates an alternative way of classifying listeners and music groups. The structure of the network is also studied by a more refined method, based upon a random walk exploration of its properties. Finally, a personal identification-community imitation model for growing bipartite networks is outlined, following Potts ingredients. Simulation results do reproduce quite well the empirical data.

Social Network Analysis Applied to a Historical Ethnographic Study Surrounding Home Birth.

PubMed

Andina-Diaz, Elena; Ovalle-Perandones, Mª Antonia; Ramos-Vidal, Ignacio; Camacho-Morell, Francisca; Siles-Gonzalez, Jose; Marques-Sanchez, Pilar

2018-04-24

Safety during birth has improved since hospital delivery became standard practice, but the process has also become increasingly medicalised. Hence, recent years have witnessed a growing interest in home births due to the advantages it offers to mothers and their newborn infants. The aims of the present study were to confirm the transition from a home birth model of care to a scenario in which deliveries began to occur almost exclusively in a hospital setting; to define the social networks surrounding home births; and to determine whether geography exerted any influence on the social networks surrounding home births. Adopting a qualitative approach, we recruited 19 women who had given birth at home in the mid 20th century in a rural area in Spain. We employed a social network analysis method. Our results revealed three essential aspects that remain relevant today: the importance of health professionals in home delivery care, the importance of the mother’s primary network, and the influence of the geographical location of the actors involved in childbirth. All of these factors must be taken into consideration when developing strategies for maternal health.

Small-world human brain networks: Perspectives and challenges.

PubMed

Liao, Xuhong; Vasilakos, Athanasios V; He, Yong

2017-06-01

Modelling the human brain as a complex network has provided a powerful mathematical framework to characterize the structural and functional architectures of the brain. In the past decade, the combination of non-invasive neuroimaging techniques and graph theoretical approaches enable us to map human structural and functional connectivity patterns (i.e., connectome) at the macroscopic level. One of the most influential findings is that human brain networks exhibit prominent small-world organization. Such a network architecture in the human brain facilitates efficient information segregation and integration at low wiring and energy costs, which presumably results from natural selection under the pressure of a cost-efficiency balance. Moreover, the small-world organization undergoes continuous changes during normal development and ageing and exhibits dramatic alterations in neurological and psychiatric disorders. In this review, we survey recent advances regarding the small-world architecture in human brain networks and highlight the potential implications and applications in multidisciplinary fields, including cognitive neuroscience, medicine and engineering. Finally, we highlight several challenging issues and areas for future research in this rapidly growing field. Copyright © 2017 Elsevier Ltd. All rights reserved.

Selective Narrowing of Social Networks across Adulthood is Associated with Improved Emotional Experience in Daily Life

ERIC Educational Resources Information Center

English, Tammy; Carstensen, Laura L.

2014-01-01

Past research has documented age differences in the size and composition of social networks that suggest that networks grow smaller with age and include an increasingly greater proportion of well-known social partners. According to socioemotional selectivity theory, such changes in social network composition serve an antecedent emotion regulatory…

Evolution of the Digital Society Reveals Balance between Viral and Mass Media Influence

NASA Astrophysics Data System (ADS)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2014-07-01

Online social networks (OSNs) enable researchers to study the social universe at a previously unattainable scale. The worldwide impact and the necessity to sustain the rapid growth of OSNs emphasize the importance of unraveling the laws governing their evolution. Empirical results show that, unlike many real-world growing networked systems, OSNs follow an intricate path that includes a dynamical percolation transition. In light of these results, we present a quantitative two-parameter model that reproduces the entire topological evolution of a quasi-isolated OSN with unprecedented precision from the birth of the network. This allows us to precisely gauge the fundamental macroscopic and microscopic mechanisms involved. Our findings suggest that the coupling between the real preexisting underlying social structure, a viral spreading mechanism, and mass media influence govern the evolution of OSNs. The empirical validation of our model, on a macroscopic scale, reveals that virality is 4-5 times stronger than mass media influence and, on a microscopic scale, individuals have a higher subscription probability if invited by weaker social contacts, in agreement with the "strength of weak ties" paradigm.

ADFNE: Open source software for discrete fracture network engineering, two and three dimensional applications

NASA Astrophysics Data System (ADS)

Fadakar Alghalandis, Younes

2017-05-01

Rapidly growing topic, the discrete fracture network engineering (DFNE), has already attracted many talents from diverse disciplines in academia and industry around the world to challenge difficult problems related to mining, geothermal, civil, oil and gas, water and many other projects. Although, there are few commercial software capable of providing some useful functionalities fundamental for DFNE, their costs, closed code (black box) distributions and hence limited programmability and tractability encouraged us to respond to this rising demand with a new solution. This paper introduces an open source comprehensive software package for stochastic modeling of fracture networks in two- and three-dimension in discrete formulation. Functionalities included are geometric modeling (e.g., complex polygonal fracture faces, and utilizing directional statistics), simulations, characterizations (e.g., intersection, clustering and connectivity analyses) and applications (e.g., fluid flow). The package is completely written in Matlab scripting language. Significant efforts have been made to bring maximum flexibility to the functions in order to solve problems in both two- and three-dimensions in an easy and united way that is suitable for beginners, advanced and experienced users.

Strategic parameter-driven routing models for multidestination traffic in telecommunication networks.

PubMed

Lee, Y; Tien, J M

2001-01-01

We present mathematical models that determine the optimal parameters for strategically routing multidestination traffic in an end-to-end network setting. Multidestination traffic refers to a traffic type that can be routed to any one of a multiple number of destinations. A growing number of communication services is based on multidestination routing. In this parameter-driven approach, a multidestination call is routed to one of the candidate destination nodes in accordance with predetermined decision parameters associated with each candidate node. We present three different approaches: (1) a link utilization (LU) approach, (2) a network cost (NC) approach, and (3) a combined parametric (CP) approach. The LU approach provides the solution that would result in an optimally balanced link utilization, whereas the NC approach provides the least expensive way to route traffic to destinations. The CP approach, on the other hand, provides multiple solutions that help leverage link utilization and cost. The LU approach has in fact been implemented by a long distance carrier resulting in a considerable efficiency improvement in its international direct services, as summarized.

Hybrid attacks on model-based social recommender systems

NASA Astrophysics Data System (ADS)

Yu, Junliang; Gao, Min; Rong, Wenge; Li, Wentao; Xiong, Qingyu; Wen, Junhao

2017-10-01

With the growing popularity of the online social platform, the social network based approaches to recommendation emerged. However, because of the open nature of rating systems and social networks, the social recommender systems are susceptible to malicious attacks. In this paper, we present a certain novel attack, which inherits characteristics of the rating attack and the relation attack, and term it hybrid attack. Furtherly, we explore the impact of the hybrid attack on model-based social recommender systems in multiple aspects. The experimental results show that, the hybrid attack is more destructive than the rating attack in most cases. In addition, users and items with fewer ratings will be influenced more when attacked. Last but not the least, the findings suggest that spammers do not depend on the feedback links from normal users to become more powerful, the unilateral links can make the hybrid attack effective enough. Since unilateral links are much cheaper, the hybrid attack will be a great threat to model-based social recommender systems.

Vulnerability to shocks in the global seafood trade network

NASA Astrophysics Data System (ADS)

Gephart, Jessica A.; Rovenskaya, Elena; Dieckmann, Ulf; Pace, Michael L.; Brännström, Åke

2016-03-01

Trade can allow countries to overcome local or regional losses (shocks) to their food supply, but reliance on international food trade also exposes countries to risks from external perturbations. Countries that are nutritionally or economically dependent on international trade of a commodity may be adversely affected by such shocks. While exposure to shocks has been studied in financial markets, communication networks, and some infrastructure systems, it has received less attention in food-trade networks. Here, we develop a forward shock-propagation model to quantify how trade flows are redistributed under a range of shock scenarios and assess the food-security outcomes by comparing changes in national fish supplies to indices of each country’s nutritional fish dependency. Shock propagation and distribution among regions are modeled on a network of historical bilateral seafood trade data from UN Comtrade using 205 reporting territories grouped into 18 regions. In our model exposure to shocks increases with total imports and the number of import partners. We find that Central and West Africa are the most vulnerable to shocks, with their vulnerability increasing when a willingness-to-pay proxy is included. These findings suggest that countries can reduce their overall vulnerability to shocks by reducing reliance on imports and diversifying food sources. As international seafood trade grows, identifying these types of potential risks and vulnerabilities is important to build a more resilient food system.

Lifelong learning of human actions with deep neural network self-organization.

PubMed

Parisi, German I; Tani, Jun; Weber, Cornelius; Wermter, Stefan

2017-12-01

Lifelong learning is fundamental in autonomous robotics for the acquisition and fine-tuning of knowledge through experience. However, conventional deep neural models for action recognition from videos do not account for lifelong learning but rather learn a batch of training data with a predefined number of action classes and samples. Thus, there is the need to develop learning systems with the ability to incrementally process available perceptual cues and to adapt their responses over time. We propose a self-organizing neural architecture for incrementally learning to classify human actions from video sequences. The architecture comprises growing self-organizing networks equipped with recurrent neurons for processing time-varying patterns. We use a set of hierarchically arranged recurrent networks for the unsupervised learning of action representations with increasingly large spatiotemporal receptive fields. Lifelong learning is achieved in terms of prediction-driven neural dynamics in which the growth and the adaptation of the recurrent networks are driven by their capability to reconstruct temporally ordered input sequences. Experimental results on a classification task using two action benchmark datasets show that our model is competitive with state-of-the-art methods for batch learning also when a significant number of sample labels are missing or corrupted during training sessions. Additional experiments show the ability of our model to adapt to non-stationary input avoiding catastrophic interference. Copyright © 2017 The Author(s). Published by Elsevier Ltd.. All rights reserved.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks.

PubMed

Sendiña-Nadal, I; Danziger, M M; Wang, Z; Havlin, S; Boccaletti, S

2016-02-18

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph's hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks

NASA Astrophysics Data System (ADS)

Sendiña-Nadal, I.; Danziger, M. M.; Wang, Z.; Havlin, S.; Boccaletti, S.

2016-02-01

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph’s hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Functional Topology of Evolving Urban Drainage Networks

NASA Astrophysics Data System (ADS)

Yang, Soohyun; Paik, Kyungrock; McGrath, Gavan S.; Urich, Christian; Krueger, Elisabeth; Kumar, Praveen; Rao, P. Suresh C.

2017-11-01

We investigated the scaling and topology of engineered urban drainage networks (UDNs) in two cities, and further examined UDN evolution over decades. UDN scaling was analyzed using two power law scaling characteristics widely employed for river networks: (1) Hack's law of length (L)-area (A) [L∝Ah] and (2) exceedance probability distribution of upstream contributing area (δ) [P>(A≥δ>)˜aδ-ɛ]. For the smallest UDNs (<2 km2), length-area scales linearly (h ˜ 1), but power law scaling (h ˜ 0.6) emerges as the UDNs grow. While P>(A≥δ>) plots for river networks are abruptly truncated, those for UDNs display exponential tempering [P>(A≥δ>)=aδ-ɛexp⁡>(-cδ>)]. The tempering parameter c decreases as the UDNs grow, implying that the distribution evolves in time to resemble those for river networks. However, the power law exponent ɛ for large UDNs tends to be greater than the range reported for river networks. Differences in generative processes and engineering design constraints contribute to observed differences in the evolution of UDNs and river networks, including subnet heterogeneity and nonrandom branching.

Research on the exponential growth effect on network topology: Theoretical and empirical analysis

NASA Astrophysics Data System (ADS)

Li, Shouwei; You, Zongjun

Integrated circuit (IC) industry network has been built in Yangtze River Delta with the constant expansion of IC industry. The IC industry network grows exponentially with the establishment of new companies and the establishment of contacts with old firms. Based on preferential attachment and exponential growth, the paper presents the analytical results in which the vertices degree of scale-free network follows power-law distribution p(k)˜k‑γ (γ=2β+1) and parameter β satisfies 0.5≤β≤1. At the same time, we find that the preferential attachment takes place in a dynamic local world and the size of the dynamic local world is in direct proportion to the size of whole networks. The paper also gives the analytical results of no-preferential attachment and exponential growth on random networks. The computer simulated results of the model illustrate these analytical results. Through some investigations on the enterprises, this paper at first presents the distribution of IC industry, composition of industrial chain and service chain firstly. Then, the correlative network and its analysis of industrial chain and service chain are presented. The correlative analysis of the whole IC industry is also presented at the same time. Based on the theory of complex network, the analysis and comparison of industrial chain network and service chain network in Yangtze River Delta are provided in the paper.

Chaos and Robustness in a Single Family of Genetic Oscillatory Networks

PubMed Central

Fu, Daniel; Tan, Patrick; Kuznetsov, Alexey; Molkov, Yaroslav I.

2014-01-01

Genetic oscillatory networks can be mathematically modeled with delay differential equations (DDEs). Interpreting genetic networks with DDEs gives a more intuitive understanding from a biological standpoint. However, it presents a problem mathematically, for DDEs are by construction infinitely-dimensional and thus cannot be analyzed using methods common for systems of ordinary differential equations (ODEs). In our study, we address this problem by developing a method for reducing infinitely-dimensional DDEs to two- and three-dimensional systems of ODEs. We find that the three-dimensional reductions provide qualitative improvements over the two-dimensional reductions. We find that the reducibility of a DDE corresponds to its robustness. For non-robust DDEs that exhibit high-dimensional dynamics, we calculate analytic dimension lines to predict the dependence of the DDEs’ correlation dimension on parameters. From these lines, we deduce that the correlation dimension of non-robust DDEs grows linearly with the delay. On the other hand, for robust DDEs, we find that the period of oscillation grows linearly with delay. We find that DDEs with exclusively negative feedback are robust, whereas DDEs with feedback that changes its sign are not robust. We find that non-saturable degradation damps oscillations and narrows the range of parameter values for which oscillations exist. Finally, we deduce that natural genetic oscillators with highly-regular periods likely have solely negative feedback. PMID:24667178

Genetic attack on neural cryptography.

PubMed

Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka; Kanter, Ido

2006-03-01

Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.

Genetic attack on neural cryptography

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

Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka

2006-03-15

Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold formore » the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.« less

Genetic attack on neural cryptography

NASA Astrophysics Data System (ADS)

Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka; Kanter, Ido

2006-03-01

Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.

Benefit of Complete State Monitoring For GPS Realtime Applications With Geo++ Gnsmart

NASA Astrophysics Data System (ADS)

Wübbena, G.; Schmitz, M.; Bagge, A.

Today, the demand for precise positioning at the cm-level in realtime is worldwide growing. An indication for this is the number of operational RTK network installa- tions, which use permanent reference station networks to derive corrections for dis- tance dependent GPS errors and to supply corrections to RTK users in realtime. Gen- erally, the inter-station distances in RTK networks are selected at several tens of km in range and operational installations cover areas of up to 50000 km x km. However, the separation of the permanent reference stations can be increased to sev- eral hundred km, while a correct modeling of all error components is applied. Such networks can be termed as sparse RTK networks, which cover larger areas with a reduced number of stations. The undifferenced GPS observable is best suited for this task estimating the complete state of a permanent GPS network in a dynamic recursive Kalman filter. A rigorous adjustment of all simultaneous reference station data is re- quired. The sparse network design essentially supports the state estimation through its large spatial extension. The benefit of the approach and its state modeling of all GPS error components is a successful ambiguity resolution in realtime over long distances. The above concepts are implemented in the operational GNSMART (GNSS State Monitoring and Representation Technique) software of Geo++. It performs a state monitoring of all error components at the mm-level, because for RTK networks this accuracy is required to sufficiently represent the distance dependent errors for kine- matic applications. One key issue of the modeling is the estimation of clocks and hard- ware delays in the undifferenced approach. This pre-requisite subsequently allows for the precise separation and modeling of all other error components. Generally most of the estimated parameters are considered as nuisance parameters with respect to pure positioning tasks. As the complete state vector of GPS errors is available in a GPS realtime network, additional information besides position can be derived e.g. regional precise satellite clocks, orbits, total ionospheric electron content, tropospheric water vapor distribution, and also dynamic reference station movements. The models of GNSMART are designed to work with regional, continental or even global data. Results from GNSMART realtime networks with inter-station distances of several hundred km are presented to demonstrate the benefits of the operational implemented concepts.

Energy challenges in optical access and aggregation networks.

PubMed

Kilper, Daniel C; Rastegarfar, Houman

2016-03-06

Scalability is a critical issue for access and aggregation networks as they must support the growth in both the size of data capacity demands and the multiplicity of access points. The number of connected devices, the Internet of Things, is growing to the tens of billions. Prevailing communication paradigms are reaching physical limitations that make continued growth problematic. Challenges are emerging in electronic and optical systems and energy increasingly plays a central role. With the spectral efficiency of optical systems approaching the Shannon limit, increasing parallelism is required to support higher capacities. For electronic systems, as the density and speed increases, the total system energy, thermal density and energy per bit are moving into regimes that become impractical to support-for example requiring single-chip processor powers above the 100 W limit common today. We examine communication network scaling and energy use from the Internet core down to the computer processor core and consider implications for optical networks. Optical switching in data centres is identified as a potential model from which scalable access and aggregation networks for the future Internet, with the application of integrated photonic devices and intelligent hybrid networking, will emerge. © 2016 The Author(s).

Diminished neural network dynamics after moderate and severe traumatic brain injury.

PubMed

Gilbert, Nicholas; Bernier, Rachel A; Calhoun, Vincent D; Brenner, Einat; Grossner, Emily; Rajtmajer, Sarah M; Hillary, Frank G

2018-01-01

Over the past decade there has been increasing enthusiasm in the cognitive neurosciences around using network science to understand the system-level changes associated with brain disorders. A growing literature has used whole-brain fMRI analysis to examine changes in the brain's subnetworks following traumatic brain injury (TBI). Much of network modeling in this literature has focused on static network mapping, which provides a window into gross inter-nodal relationships, but is insensitive to more subtle fluctuations in network dynamics, which may be an important predictor of neural network plasticity. In this study, we examine the dynamic connectivity with focus on state-level connectivity (state) and evaluate the reliability of dynamic network states over the course of two runs of intermittent task and resting data. The goal was to examine the dynamic properties of neural networks engaged periodically with task stimulation in order to determine: 1) the reliability of inter-nodal and network-level characteristics over time and 2) the transitions between distinct network states after traumatic brain injury. To do so, we enrolled 23 individuals with moderate and severe TBI at least 1-year post injury and 19 age- and education-matched healthy adults using functional MRI methods, dynamic connectivity modeling, and graph theory. The results reveal several distinct network "states" that were reliably evident when comparing runs; the overall frequency of dynamic network states are highly reproducible (r-values>0.8) for both samples. Analysis of movement between states resulted in fewer state transitions in the TBI sample and, in a few cases, brain injury resulted in the appearance of states not exhibited by the healthy control (HC) sample. Overall, the findings presented here demonstrate the reliability of observable dynamic mental states during periods of on-task performance and support emerging evidence that brain injury may result in diminished network dynamics.

Diminished neural network dynamics after moderate and severe traumatic brain injury

PubMed Central

Gilbert, Nicholas; Bernier, Rachel A.; Calhoun, Vincent D.; Brenner, Einat; Grossner, Emily; Rajtmajer, Sarah M.

2018-01-01

Over the past decade there has been increasing enthusiasm in the cognitive neurosciences around using network science to understand the system-level changes associated with brain disorders. A growing literature has used whole-brain fMRI analysis to examine changes in the brain’s subnetworks following traumatic brain injury (TBI). Much of network modeling in this literature has focused on static network mapping, which provides a window into gross inter-nodal relationships, but is insensitive to more subtle fluctuations in network dynamics, which may be an important predictor of neural network plasticity. In this study, we examine the dynamic connectivity with focus on state-level connectivity (state) and evaluate the reliability of dynamic network states over the course of two runs of intermittent task and resting data. The goal was to examine the dynamic properties of neural networks engaged periodically with task stimulation in order to determine: 1) the reliability of inter-nodal and network-level characteristics over time and 2) the transitions between distinct network states after traumatic brain injury. To do so, we enrolled 23 individuals with moderate and severe TBI at least 1-year post injury and 19 age- and education-matched healthy adults using functional MRI methods, dynamic connectivity modeling, and graph theory. The results reveal several distinct network “states” that were reliably evident when comparing runs; the overall frequency of dynamic network states are highly reproducible (r-values>0.8) for both samples. Analysis of movement between states resulted in fewer state transitions in the TBI sample and, in a few cases, brain injury resulted in the appearance of states not exhibited by the healthy control (HC) sample. Overall, the findings presented here demonstrate the reliability of observable dynamic mental states during periods of on-task performance and support emerging evidence that brain injury may result in diminished network dynamics. PMID:29883447

Modeling coexistence of oscillation and Delta/Notch-mediated lateral inhibition in pancreas development and neurogenesis.

PubMed

Tiedemann, Hendrik B; Schneltzer, Elida; Beckers, Johannes; Przemeck, Gerhard K H; Hrabě de Angelis, Martin

2017-10-07

During pancreas development, Neurog3 positive endocrine progenitors are specified by Delta/Notch (D/N) mediated lateral inhibition in the growing ducts. During neurogenesis, genes that determine the transition from the proneural state to neuronal or glial lineages are oscillating before their expression is sustained. Although the basic gene regulatory network is very similar, cycling gene expression in pancreatic development was not investigated yet, and previous simulations of lateral inhibition in pancreas development excluded by design the possibility of oscillations. To explore this possibility, we developed a dynamic model of a growing duct that results in an oscillatory phase before the determination of endocrine progenitors by lateral inhibition. The basic network (D/N + Hes1 + Neurog3) shows scattered, stable Neurog3 expression after displaying transient expression. Furthermore, we included the Hes1 negative feedback as previously discussed in neurogenesis and show the consequences for Neurog3 expression in pancreatic duct development. Interestingly, a weakened HES1 action on the Hes1 promoter allows the coexistence of stable patterning and oscillations. In conclusion, cycling gene expression and lateral inhibition are not mutually exclusive. In this way, we argue for a unified mode of D/N mediated lateral inhibition in neurogenic and pancreatic progenitor specification. Copyright © 2017 The Authors. Published by Elsevier Ltd.. All rights reserved.

Microbial interaction networks in soil and in silico

NASA Astrophysics Data System (ADS)

Vetsigian, Kalin

2012-02-01

Soil harbors a huge number of microbial species interacting through secretion of antibiotics and other chemicals. What patterns of species interactions allow for this astonishing biodiversity to be sustained, and how do these interactions evolve? I used a combined experimental-theoretical approach to tackle these questions. Focusing on bacteria from the genus Steptomyces, known for their diverse secondary metabolism, I isolated 64 natural strains from several individual grains of soil and systematically measured all pairwise interactions among them. Quantitative measurements on such scale were enabled by a novel experimental platform based on robotic handling, a custom scanner array and automatic image analysis. This unique platform allowed the simultaneous capturing of ˜15,000 time-lapse movies of growing colonies of each isolate on media conditioned by each of the other isolates. The data revealed a rich network of strong negative (inhibitory) and positive (stimulating) interactions. Analysis of this network and the phylogeny of the isolates, together with mathematical modeling of microbial communities, revealed that: 1) The network of interactions has three special properties: ``balance'', ``bi- modality'' and ``reciprocity''; 2) The interaction network is fast evolving; 3) Mathematical modeling explains how rapid evolution can give rise to the three special properties through an interplay between ecology and evolution. These properties are not a result of stable co-existence, but rather of continuous evolutionary turnover of strains with different production and resistance capabilities.

Reduced kernel recursive least squares algorithm for aero-engine degradation prediction

NASA Astrophysics Data System (ADS)

Zhou, Haowen; Huang, Jinquan; Lu, Feng

2017-10-01

Kernel adaptive filters (KAFs) generate a linear growing radial basis function (RBF) network with the number of training samples, thereby lacking sparseness. To deal with this drawback, traditional sparsification techniques select a subset of original training data based on a certain criterion to train the network and discard the redundant data directly. Although these methods curb the growth of the network effectively, it should be noted that information conveyed by these redundant samples is omitted, which may lead to accuracy degradation. In this paper, we present a novel online sparsification method which requires much less training time without sacrificing the accuracy performance. Specifically, a reduced kernel recursive least squares (RKRLS) algorithm is developed based on the reduced technique and the linear independency. Unlike conventional methods, our novel methodology employs these redundant data to update the coefficients of the existing network. Due to the effective utilization of the redundant data, the novel algorithm achieves a better accuracy performance, although the network size is significantly reduced. Experiments on time series prediction and online regression demonstrate that RKRLS algorithm requires much less computational consumption and maintains the satisfactory accuracy performance. Finally, we propose an enhanced multi-sensor prognostic model based on RKRLS and Hidden Markov Model (HMM) for remaining useful life (RUL) estimation. A case study in a turbofan degradation dataset is performed to evaluate the performance of the novel prognostic approach.

Meeting the Nine Essentials: Winthrop University-School Partnership Network

ERIC Educational Resources Information Center

Johnson, Lisa E.; Rakestraw, Jennie

2014-01-01

Johnson and Rakestraw describe the Winthrop University-School Partnership Network (WUSP) as a dynamic, diverse, and growing group of participants from nine school districts, thirty schools, multiple university programs, and community organizations. As a Network, they are working to emulate John Goodlad's (1984) vision "in order to improve…

The Buzz on Campus: Social Networking Takes Hold

ERIC Educational Resources Information Center

Violino, Bob

2009-01-01

This article talks about the latest trend in education, which is social networking. As this phenomenon continues to grow, community colleges are getting into the act, launching online initiatives and harnessing the technology to communicate, promote, and conduct important school business. School administrators believe that social networking can…

Sino-Austrian High-Tech Acupuncture Network: Annual Report 2017

PubMed Central

2018-01-01

The Sino-Austrian High-Tech Acupuncture Research Network was founded in 2005 and has been growing ever since. The network comprises many partners from China and is highly involved in research and education activities. This report introduces the network’s activities in the year 2017. PMID:29329241

Comparing Social Network Analysis of Posts with Counting of Posts as a Measurement of Learners' Participation in Facebook Discussions

ERIC Educational Resources Information Center

Lee, Hye Yeon; Lee, Hyeon Woo

2016-01-01

With the currently growing interest in social network services, many college courses use social network services as platforms for discussions, and a number of studies have been conducted on the use of social network analysis to measure students' participation in online discussions. This study aims to demonstrate the difference between counting…

How actin network dynamics control the onset of actin-based motility

PubMed Central

Kawska, Agnieszka; Carvalho, Kévin; Manzi, John; Boujemaa-Paterski, Rajaa; Blanchoin, Laurent; Martiel, Jean-Louis; Sykes, Cécile

2012-01-01

Cells use their dynamic actin network to control their mechanics and motility. These networks are made of branched actin filaments generated by the Arp2/3 complex. Here we study under which conditions the microscopic organization of branched actin networks builds up a sufficient stress to trigger sustained motility. In our experimental setup, dynamic actin networks or “gels” are grown on a hard bead in a controlled minimal protein system containing actin monomers, profilin, the Arp2/3 complex and capping protein. We vary protein concentrations and follow experimentally and through simulations the shape and mechanical properties of the actin gel growing around beads. Actin gel morphology is controlled by elementary steps including “primer” contact, growth of the network, entanglement, mechanical interaction and force production. We show that varying the biochemical orchestration of these steps can lead to the loss of network cohesion and the lack of effective force production. We propose a predictive phase diagram of actin gel fate as a function of protein concentrations. This work unveils how, in growing actin networks, a tight biochemical and physical coupling smoothens initial primer-caused heterogeneities and governs force buildup and cell motility. PMID:22908255

Criticality Is an Emergent Property of Genetic Networks that Exhibit Evolvability

PubMed Central

Torres-Sosa, Christian; Huang, Sui; Aldana, Maximino

2012-01-01

Accumulating experimental evidence suggests that the gene regulatory networks of living organisms operate in the critical phase, namely, at the transition between ordered and chaotic dynamics. Such critical dynamics of the network permits the coexistence of robustness and flexibility which are necessary to ensure homeostatic stability (of a given phenotype) while allowing for switching between multiple phenotypes (network states) as occurs in development and in response to environmental change. However, the mechanisms through which genetic networks evolve such critical behavior have remained elusive. Here we present an evolutionary model in which criticality naturally emerges from the need to balance between the two essential components of evolvability: phenotype conservation and phenotype innovation under mutations. We simulated the Darwinian evolution of random Boolean networks that mutate gene regulatory interactions and grow by gene duplication. The mutating networks were subjected to selection for networks that both (i) preserve all the already acquired phenotypes (dynamical attractor states) and (ii) generate new ones. Our results show that this interplay between extending the phenotypic landscape (innovation) while conserving the existing phenotypes (conservation) suffices to cause the evolution of all the networks in a population towards criticality. Furthermore, the networks produced by this evolutionary process exhibit structures with hubs (global regulators) similar to the observed topology of real gene regulatory networks. Thus, dynamical criticality and certain elementary topological properties of gene regulatory networks can emerge as a byproduct of the evolvability of the phenotypic landscape. PMID:22969419

Characterization of Adaptation by Morphology in a Planar Biological Network of Plasmodial Slime Mold

NASA Astrophysics Data System (ADS)

Ito, Masateru; Okamoto, Riki; Takamatsu, Atsuko

2011-07-01

Growth processes of a planar biological network of plasmodium of a true slime mold, Physarum polycephalum, were analyzed quantitatively. The plasmodium forms a transportation network through which protoplasm conveys nutrients, oxygen, and cellular organelles similarly to blood in a mammalian vascular network. To analyze the network structure, vertices were defined at tube bifurcation points. Then edges were defined for the tubes connecting both end vertices. Morphological analysis was attempted along with conventional topological analysis, revealing that the growth process of the plasmodial network structure depends on environmental conditions. In an attractive condition, the network is a polygonal lattice with more than six edges per vertex at the early stage and the hexagonal lattice at a later stage. Through all growing stages, the tube structure was not highly developed but an unstructured protoplasmic thin sheet was dominantly formed. The network size is small. In contrast, in the repulsive condition, the network is a mixture of polygonal lattice and tree-graph. More specifically, the polygonal lattice has more than six edges per vertex in the early stage, then a tree-graph structure is added to the lattice network at a later stage. The thick tube structure was highly developed. The network size, in the meaning of Euclidean distance but not topological one, grows considerably. Finally, the biological meaning of the environment-dependent network structure in the plasmodium is discussed.

Competition for popularity in bipartite networks.

PubMed

Díaz, Mariano Beguerisse; Porter, Mason A; Onnela, Jukka-Pekka

2010-12-01

We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its users to give ratings to the videos available in its catalog. We find that the distribution of the number of ratings given by users and that of the number of ratings received by videos both follow a power law with an exponential cutoff. We also examine the activity patterns of Netflix users and find bursts of intense video-rating activity followed by long periods of inactivity. We derive ordinary differential equations to model the acquisition of edges by the nodes over time and obtain the corresponding time-dependent degree distributions. We then compare our results with the Netflix data and find good agreement. We conclude with a discussion of how catalog models can be used to study systems in which agents are forced to choose, rate, or prioritize their interactions from a large set of options. © 2010 American Institute of Physics.

Competition for popularity in bipartite networks

NASA Astrophysics Data System (ADS)

Beguerisse Díaz, Mariano; Porter, Mason A.; Onnela, Jukka-Pekka

2010-12-01

We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its users to give ratings to the videos available in its catalog. We find that the distribution of the number of ratings given by users and that of the number of ratings received by videos both follow a power law with an exponential cutoff. We also examine the activity patterns of Netflix users and find bursts of intense video-rating activity followed by long periods of inactivity. We derive ordinary differential equations to model the acquisition of edges by the nodes over time and obtain the corresponding time-dependent degree distributions. We then compare our results with the Netflix data and find good agreement. We conclude with a discussion of how catalog models can be used to study systems in which agents are forced to choose, rate, or prioritize their interactions from a large set of options.

Autonomous mental development with selective attention, object perception, and knowledge representation

NASA Astrophysics Data System (ADS)

Ban, Sang-Woo; Lee, Minho

2008-04-01

Knowledge-based clustering and autonomous mental development remains a high priority research topic, among which the learning techniques of neural networks are used to achieve optimal performance. In this paper, we present a new framework that can automatically generate a relevance map from sensory data that can represent knowledge regarding objects and infer new knowledge about novel objects. The proposed model is based on understating of the visual what pathway in our brain. A stereo saliency map model can selectively decide salient object areas by additionally considering local symmetry feature. The incremental object perception model makes clusters for the construction of an ontology map in the color and form domains in order to perceive an arbitrary object, which is implemented by the growing fuzzy topology adaptive resonant theory (GFTART) network. Log-polar transformed color and form features for a selected object are used as inputs of the GFTART. The clustered information is relevant to describe specific objects, and the proposed model can automatically infer an unknown object by using the learned information. Experimental results with real data have demonstrated the validity of this approach.

Competition in the health system: good news and bad news.

PubMed

Miller, R H

1996-01-01

Competition among health plans, hospitals, and physicians has taken place in fifteen health care markets primarily on the basis of price and secondarily on network breadth and style of care. In most markets, competition resulted in lower (or slowly growing) premium prices. Within a type of plan product, competition was leading to similar prices and networks and was reducing product differentiation among health plans. Competition was not taking place on the basis of measured and reported quality of care, which limited the capacity of employers and enrollees to make informed health plan choices. As a result, there was a substantial gap between competition as envisioned by the architects of the managed competition model and competition as it is evolving today.

Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes

NASA Astrophysics Data System (ADS)

De Martino, Daniele

2017-12-01

In this work maximum entropy distributions in the space of steady states of metabolic networks are considered upon constraining the first and second moments of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux distributions, emerges upon considering control on the average growth (optimization) and its fluctuations (heterogeneity). This is applied to the carbon catabolic core of Escherichia coli where it quantifies the metabolic activity of slow growing phenotypes and it provides a quantitative map with metabolic fluxes, opening the possibility to detect coexistence from flux data. A preliminary analysis on data for E. coli cultures in standard conditions shows degeneracy for the inferred parameters that extend in the coexistence region.

Selective Narrowing of Social Networks Across Adulthood is Associated With Improved Emotional Experience in Daily Life.

PubMed

English, Tammy; Carstensen, Laura L

2014-03-01

Past research has documented age differences in the size and composition of social networks that suggest that networks grow smaller with age and include an increasingly greater proportion of well-known social partners. According to socioemotional selectivity theory, such changes in social network composition serve an antecedent emotion regulatory function that supports an age-related increase in the priority that people place on emotional well-being. The present study employed a longitudinal design with a sample that spanned the full adult age range to examine whether there is evidence of within-individual (developmental) change in social networks and whether the characteristics of relationships predict emotional experiences in daily life. Using growth curve analyses, social networks were found to increase in size in young adulthood and then decline steadily throughout later life. As postulated by socioemotional selectivity theory, reductions were observed primarily in the number of peripheral partners; the number of close partners was relatively stable over time. In addition, cross-sectional analyses revealed that older adults reported that social network members elicited less negative emotion and more positive emotion. The emotional tone of social networks, particularly when negative emotions were associated with network members, also predicted experienced emotion of participants. Overall, findings were robust after taking into account demographic variables and physical health. The implications of these findings are discussed in the context of socioemotional selectivity theory and related theoretical models.

Loopless nontrapping invasion-percolation model for fracking.

PubMed

Norris, J Quinn; Turcotte, Donald L; Rundle, John B

2014-02-01

Recent developments in hydraulic fracturing (fracking) have enabled the recovery of large quantities of natural gas and oil from old, low-permeability shales. These developments include a change from low-volume, high-viscosity fluid injection to high-volume, low-viscosity injection. The injected fluid introduces distributed damage that provides fracture permeability for the extraction of the gas and oil. In order to model this process, we utilize a loopless nontrapping invasion percolation previously introduced to model optimal polymers in a strongly disordered medium and for determining minimum energy spanning trees on a lattice. We performed numerical simulations on a two-dimensional square lattice and find significant differences from other percolation models. Additionally, we find that the growing fracture network satisfies both Horton-Strahler and Tokunaga network statistics. As with other invasion percolation models, our model displays burst dynamics, in which the cluster extends rapidly into a connected region. We introduce an alternative definition of bursts to be a consecutive series of opened bonds whose strengths are all below a specified value. Using this definition of bursts, we find good agreement with a power-law frequency-area distribution. These results are generally consistent with the observed distribution of microseismicity observed during a high-volume frack.

A Comprehensive and Cost-Effective Computer Infrastructure for K-12 Schools

NASA Technical Reports Server (NTRS)

Warren, G. P.; Seaton, J. M.

1996-01-01

Since 1993, NASA Langley Research Center has been developing and implementing a low-cost Internet connection model, including system architecture, training, and support, to provide Internet access for an entire network of computers. This infrastructure allows local area networks which exceed 50 machines per school to independently access the complete functionality of the Internet by connecting to a central site, using state-of-the-art commercial modem technology, through a single standard telephone line. By locating high-cost resources at this central site and sharing these resources and their costs among the school districts throughout a region, a practical, efficient, and affordable infrastructure for providing scale-able Internet connectivity has been developed. As the demand for faster Internet access grows, the model has a simple expansion path that eliminates the need to replace major system components and re-train personnel. Observations of optical Internet usage within an environment, particularly school classrooms, have shown that after an initial period of 'surfing,' the Internet traffic becomes repetitive. By automatically storing requested Internet information on a high-capacity networked disk drive at the local site (network based disk caching), then updating this information only when it changes, well over 80 percent of the Internet traffic that leaves a location can be eliminated by retrieving the information from the local disk cache.

Synchronized and mixed outbreaks of coupled recurrent epidemics.

PubMed

Zheng, Muhua; Zhao, Ming; Min, Byungjoon; Liu, Zonghua

2017-05-25

Epidemic spreading has been studied for a long time and most of them are focused on the growing aspect of a single epidemic outbreak. Recently, we extended the study to the case of recurrent epidemics (Sci. Rep. 5, 16010 (2015)) but limited only to a single network. We here report from the real data of coupled regions or cities that the recurrent epidemics in two coupled networks are closely related to each other and can show either synchronized outbreak pattern where outbreaks occur simultaneously in both networks or mixed outbreak pattern where outbreaks occur in one network but do not in another one. To reveal the underlying mechanism, we present a two-layered network model of coupled recurrent epidemics to reproduce the synchronized and mixed outbreak patterns. We show that the synchronized outbreak pattern is preferred to be triggered in two coupled networks with the same average degree while the mixed outbreak pattern is likely to show for the case with different average degrees. Further, we show that the coupling between the two layers tends to suppress the mixed outbreak pattern but enhance the synchronized outbreak pattern. A theoretical analysis based on microscopic Markov-chain approach is presented to explain the numerical results. This finding opens a new window for studying the recurrent epidemics in multi-layered networks.

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

PubMed

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

2014-01-01

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

A neural network technique for remeshing of bone microstructure.

PubMed

Fischer, Anath; Holdstein, Yaron

2012-01-01

Today, there is major interest within the biomedical community in developing accurate noninvasive means for the evaluation of bone microstructure and bone quality. Recent improvements in 3D imaging technology, among them development of micro-CT and micro-MRI scanners, allow in-vivo 3D high-resolution scanning and reconstruction of large specimens or even whole bone models. Thus, the tendency today is to evaluate bone features using 3D assessment techniques rather than traditional 2D methods. For this purpose, high-quality meshing methods are required. However, the 3D meshes produced from current commercial systems usually are of low quality with respect to analysis and rapid prototyping. 3D model reconstruction of bone is difficult due to the complexity of bone microstructure. The small bone features lead to a great deal of neighborhood ambiguity near each vertex. The relatively new neural network method for mesh reconstruction has the potential to create or remesh 3D models accurately and quickly. A neural network (NN), which resembles an artificial intelligence (AI) algorithm, is a set of interconnected neurons, where each neuron is capable of making an autonomous arithmetic calculation. Moreover, each neuron is affected by its surrounding neurons through the structure of the network. This paper proposes an extension of the growing neural gas (GNN) neural network technique for remeshing a triangular manifold mesh that represents bone microstructure. This method has the advantage of reconstructing the surface of a genus-n freeform object without a priori knowledge regarding the original object, its topology, or its shape.

Imbalance aware lithography hotspot detection: a deep learning approach

NASA Astrophysics Data System (ADS)

Yang, Haoyu; Luo, Luyang; Su, Jing; Lin, Chenxi; Yu, Bei

2017-07-01

With the advancement of very large scale integrated circuits (VLSI) technology nodes, lithographic hotspots become a serious problem that affects manufacture yield. Lithography hotspot detection at the post-OPC stage is imperative to check potential circuit failures when transferring designed patterns onto silicon wafers. Although conventional lithography hotspot detection methods, such as machine learning, have gained satisfactory performance, with the extreme scaling of transistor feature size and layout patterns growing in complexity, conventional methodologies may suffer from performance degradation. For example, manual or ad hoc feature extraction in a machine learning framework may lose important information when predicting potential errors in ultra-large-scale integrated circuit masks. We present a deep convolutional neural network (CNN) that targets representative feature learning in lithography hotspot detection. We carefully analyze the impact and effectiveness of different CNN hyperparameters, through which a hotspot-detection-oriented neural network model is established. Because hotspot patterns are always in the minority in VLSI mask design, the training dataset is highly imbalanced. In this situation, a neural network is no longer reliable, because a trained model with high classification accuracy may still suffer from a high number of false negative results (missing hotspots), which is fatal in hotspot detection problems. To address the imbalance problem, we further apply hotspot upsampling and random-mirror flipping before training the network. Experimental results show that our proposed neural network model achieves comparable or better performance on the ICCAD 2012 contest benchmark compared to state-of-the-art hotspot detectors based on deep or representative machine leaning.

Characterization of yield reduction in Ethiopia using a GIS-based crop water balance model

USGS Publications Warehouse

Senay, G.B.; Verdin, J.

2003-01-01

In many parts of sub-Saharan Africa, subsistence agriculture is characterized by significant fluctuations in yield and production due to variations in moisture availability to staple crops. Widespread drought can lead to crop failures, with associated deterioration in food security. Ground data collection networks are sparse, so methods using geospatial rainfall estimates derived from satellite and gauge observations, where available, have been developed to calculate seasonal crop water balances. Using conventional crop production data for 4 years in Ethiopia (1996-1999), it was found that water-limited and water-unlimited growing regions can be distinguished. Furthermore, maize growing conditions are also indicative of conditions for sorghum. However, another major staple, teff, was found to behave sufficiently differently from maize to warrant studies of its own.

Rule-based modeling: a computational approach for studying biomolecular site dynamics in cell signaling systems

PubMed Central

Chylek, Lily A.; Harris, Leonard A.; Tung, Chang-Shung; Faeder, James R.; Lopez, Carlos F.

2013-01-01

Rule-based modeling was developed to address the limitations of traditional approaches for modeling chemical kinetics in cell signaling systems. These systems consist of multiple interacting biomolecules (e.g., proteins), which themselves consist of multiple parts (e.g., domains, linear motifs, and sites of phosphorylation). Consequently, biomolecules that mediate information processing generally have the potential to interact in multiple ways, with the number of possible complexes and post-translational modification states tending to grow exponentially with the number of binary interactions considered. As a result, only large reaction networks capture all possible consequences of the molecular interactions that occur in a cell signaling system, which is problematic because traditional modeling approaches for chemical kinetics (e.g., ordinary differential equations) require explicit network specification. This problem is circumvented through representation of interactions in terms of local rules. With this approach, network specification is implicit and model specification is concise. Concise representation results in a coarse graining of chemical kinetics, which is introduced because all reactions implied by a rule inherit the rate law associated with that rule. Coarse graining can be appropriate if interactions are modular, and the coarseness of a model can be adjusted as needed. Rules can be specified using specialized model-specification languages, and recently developed tools designed for specification of rule-based models allow one to leverage powerful software engineering capabilities. A rule-based model comprises a set of rules, which can be processed by general-purpose simulation and analysis tools to achieve different objectives (e.g., to perform either a deterministic or stochastic simulation). PMID:24123887

Spatial-spectral flexible optical networking: enabling switching solutions for a simplified and efficient SDM network platform

NASA Astrophysics Data System (ADS)

Tomkos, I.; Zakynthinos, P.; Klonidis, D.; Marom, D.; Sygletos, S.; Ellis, A.; Salvadori, E.; Siracusa, D.; Angelou, M.; Papastergiou, G.; Psaila, N.; Ferran, J. F.; Ben-Ezra, S.; Jimenez, F.; Fernández-Palacios, J. P.

2013-12-01

The traffic carried by core optical networks grows at a steady but remarkable pace of 30-40% year-over-year. Optical transmissions and networking advancements continue to satisfy the traffic requirements by delivering the content over the network infrastructure in a cost and energy efficient manner. Such core optical networks serve the information traffic demands in a dynamic way, in response to requirements for shifting of traffics demands, both temporally (day/night) and spatially (business district/residential). However as we are approaching fundamental spectral efficiency limits of singlemode fibers, the scientific community is pursuing recently the development of an innovative, all-optical network architecture introducing the spatial degree of freedom when designing/operating future transport networks. Spacedivision- multiplexing through the use of bundled single mode fibers, and/or multi-core fibers and/or few-mode fibers can offer up to 100-fold capacity increase in future optical networks. The EU INSPACE project is working on the development of a complete spatial-spectral flexible optical networking solution, offering the network ultra-high capacity, flexibility and energy efficiency required to meet the challenges of delivering exponentially growing traffic demands in the internet over the next twenty years. In this paper we will present the motivation and main research activities of the INSPACE consortium towards the realization of the overall project solution.

Systematic Evaluation of Molecular Networks for Discovery of Disease Genes. | Office of Cancer Genomics

Cancer.gov

Gene networks are rapidly growing in size and number, raising the question of which networks are most appropriate for particular applications. Here, we evaluate 21 human genome-wide interaction networks for their ability to recover 446 disease gene sets identified through literature curation, gene expression profiling, or genome-wide association studies. While all networks have some ability to recover disease genes, we observe a wide range of performance with STRING, ConsensusPathDB, and GIANT networks having the best performance overall.

Climate Ocean Modeling on a Beowulf Class System

NASA Technical Reports Server (NTRS)

Cheng, B. N.; Chao, Y.; Wang, P.; Bondarenko, M.

2000-01-01

With the growing power and shrinking cost of personal computers. the availability of fast ethernet interconnections, and public domain software packages, it is now possible to combine them to build desktop parallel computers (named Beowulf or PC clusters) at a fraction of what it would cost to buy systems of comparable power front supercomputer companies. This led as to build and assemble our own sys tem. specifically for climate ocean modeling. In this article, we present our experience with such a system, discuss its network performance, and provide some performance comparison data with both HP SPP2000 and Cray T3E for an ocean Model used in present-day oceanographic research.

Neural Detection of Malicious Network Activities Using a New Direct Parsing and Feature Extraction Technique

DTIC Science & Technology

2015-09-01

intrusion detection systems , neural networks 15. NUMBER OF PAGES 75 16. PRICE CODE 17. SECURITY CLASSIFICATION OF... detection system (IDS) software, which learns to detect and classify network attacks and intrusions through prior training data. With the added criteria of...BACKGROUND The growing threat of malicious network activities and intrusion attempts makes intrusion detection systems (IDS) a

My Space or Yours?

ERIC Educational Resources Information Center

Barrett, Joanne

2006-01-01

Social networking is one of the latest trends to evolve out of the growing online community. Social networking sites gather data submitted by members that is then stored as user profiles. The data or profiles can then be shared among the members of the site. Membership can be free or fee-based. A typical social networking site provides members…

Beyond the Arcuate Fasciculus: Consensus and Controversy in the Connectional Anatomy of Language

ERIC Educational Resources Information Center

Dick, Anthony Steven; Tremblay, Pascale

2012-01-01

The growing consensus that language is distributed into large-scale cortical and subcortical networks has brought with it an increasing focus on the connectional anatomy of language, or how particular fibre pathways connect regions within the language network. Understanding connectivity of the language network could provide critical insights into…

Network Leadership's Balancing Act: Contrivance or Emergence?

ERIC Educational Resources Information Center

Kubiak, Chris; Bertram, Joan

2005-01-01

It is well understood that one learns much of what one knows through one's network of relationships and through shared discussion and activity. A logical extension of this idea is the growing prominence in the UK where formal school-to-school networking such as Education Action Zones and Excellence in Cities has been established. This article…

An Analysis of the Structure and Evolution of Networks

ERIC Educational Resources Information Center

Hua, Guangying

2011-01-01

As network research receives more and more attention from both academic researchers and practitioners, network analysis has become a fast growing field attracting many researchers from diverse fields such as physics, computer science, and sociology. This dissertation provides a review of theory and research on different real data sets from the…

Unraveling Appalachia's Rural Economy: The Case of a Flexible Manufacturing Network.

ERIC Educational Resources Information Center

Oberhauser, Ann M.; Pratt, Amy; Turnage, Anne-Marie

2001-01-01

The growing importance of multiple-income strategies in the changing rural Appalachian economy is discussed via a case study of a network of female home-based machine-knitters. Social networks are an important part of the knitters' recruitment and training process, promote leadership development, and help overcome some of women's economic…

CÆLIS: software for assimilation, management and processing data of an atmospheric measurement network

NASA Astrophysics Data System (ADS)

Fuertes, David; Toledano, Carlos; González, Ramiro; Berjón, Alberto; Torres, Benjamín; Cachorro, Victoria E.; de Frutos, Ángel M.

2018-02-01

Given the importance of the atmospheric aerosol, the number of instruments and measurement networks which focus on its characterization are growing. Many challenges are derived from standardization of protocols, monitoring of the instrument status to evaluate the network data quality and manipulation and distribution of large volume of data (raw and processed). CÆLIS is a software system which aims at simplifying the management of a network, providing tools by monitoring the instruments, processing the data in real time and offering the scientific community a new tool to work with the data. Since 2008 CÆLIS has been successfully applied to the photometer calibration facility managed by the University of Valladolid, Spain, in the framework of Aerosol Robotic Network (AERONET). Thanks to the use of advanced tools, this facility has been able to analyze a growing number of stations and data in real time, which greatly benefits the network management and data quality control. The present work describes the system architecture of CÆLIS and some examples of applications and data processing.

Testing Earth System Models with Earth System Data: using C isotopes in atmospheric CO2 to probe stomatal response to future climate change

NASA Astrophysics Data System (ADS)

Ballantyne, A. P.; Miller, J. B.; Bowling, D. R.; Tans, P. P.; Baker, I. T.

2013-12-01

The global cycles of water and carbon are inextricably linked through photosynthesis. This link is largely governed by stomatal conductance that regulates water loss to the atmosphere and carbon gain to the biosphere. Although extensive research has focused on the response of stomatal conductance to increased atmospheric CO2, much less research has focused on the response of stomatal conductance to concomitant climate change. Here we make use of intensive and extensive measurements of C isotopes in source CO2 to the atmosphere (del-bio) to make inferences about stomatal response to climatic factors at a single forest site and across a network of global observation sites. Based on intensive observations at the Niwot Ridge Ameriflux site we discover that del-bio is an excellent physical proxy of stomatal response during the growing season and this response is highly sensitive to atmospheric water vapor pressure deficit (VPD). We use these intensive single forest site observations to inform our analysis of the global observation network, focusing in on the growing season across an array of terrestrial sites. We find that stomatal response across most of these terrestrial sites is also highly sensitive to VPD. Lastly, we simulate the response of future climate change on stomatal response and discover that future increases in VPD may limit the biosphere's capacity to assimilate future CO2 emissions. These results have direct implications for the benchmarking of Earth System Models as stomatal conductance in many of these models does not vary as a function of VPD.

Death on the digital landscape: a preliminary investigation into the grief process and motivations behind participation in the online memoriam.

PubMed

Egnoto, Michael J; Sirianni, Joseph M; Ortega, Christopher R; Stefanone, Michael

2014-01-01

Increasingly, individuals are bonding and maintaining relationships online. These digital representations of ourselves allow us to connect with others in ways previously not possible. One behavior that is growing in online presentations of self is grieving after the death of an individual in our social network. This work investigates the outcomes of online grieving from a transcorporeal communication model perspective, and draws conclusions on the outcomes of online grief behaviors.

Linking knowledge and action through mental models of sustainable agriculture.

PubMed

Hoffman, Matthew; Lubell, Mark; Hillis, Vicken

2014-09-09

Linking knowledge to action requires understanding how decision-makers conceptualize sustainability. This paper empirically analyzes farmer "mental models" of sustainability from three winegrape-growing regions of California where local extension programs have focused on sustainable agriculture. The mental models are represented as networks where sustainability concepts are nodes, and links are established when a farmer mentions two concepts in their stated definition of sustainability. The results suggest that winegrape grower mental models of sustainability are hierarchically structured, relatively similar across regions, and strongly linked to participation in extension programs and adoption of sustainable farm practices. We discuss the implications of our findings for the debate over the meaning of sustainability, and the role of local extension programs in managing knowledge systems.

Optimal response to attacks on the open science grids.

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

Altunay, M.; Leyffer, S.; Linderoth, J. T.

2011-01-01

Cybersecurity is a growing concern, especially in open grids, where attack propagation is easy because of prevalent collaborations among thousands of users and hundreds of institutions. The collaboration rules that typically govern large science experiments as well as social networks of scientists span across the institutional security boundaries. A common concern is that the increased openness may allow malicious attackers to spread more readily around the grid. We consider how to optimally respond to attacks in open grid environments. To show how and why attacks spread more readily around the grid, we first discuss how collaborations manifest themselves in themore » grids and form the collaboration network graph, and how this collaboration network graph affects the security threat levels of grid participants. We present two mixed-integer program (MIP) models to find the optimal response to attacks in open grid environments, and also calculate the threat level associated with each grid participant. Given an attack scenario, our optimal response model aims to minimize the threat levels at unaffected participants while maximizing the uninterrupted scientific production (continuing collaborations). By adopting some of the collaboration rules (e.g., suspending a collaboration or shutting down a site), the model finds optimal response to subvert an attack scenario.« less

SCNS: a graphical tool for reconstructing executable regulatory networks from single-cell genomic data.

PubMed

Woodhouse, Steven; Piterman, Nir; Wintersteiger, Christoph M; Göttgens, Berthold; Fisher, Jasmin

2018-05-25

Reconstruction of executable mechanistic models from single-cell gene expression data represents a powerful approach to understanding developmental and disease processes. New ambitious efforts like the Human Cell Atlas will soon lead to an explosion of data with potential for uncovering and understanding the regulatory networks which underlie the behaviour of all human cells. In order to take advantage of this data, however, there is a need for general-purpose, user-friendly and efficient computational tools that can be readily used by biologists who do not have specialist computer science knowledge. The Single Cell Network Synthesis toolkit (SCNS) is a general-purpose computational tool for the reconstruction and analysis of executable models from single-cell gene expression data. Through a graphical user interface, SCNS takes single-cell qPCR or RNA-sequencing data taken across a time course, and searches for logical rules that drive transitions from early cell states towards late cell states. Because the resulting reconstructed models are executable, they can be used to make predictions about the effect of specific gene perturbations on the generation of specific lineages. SCNS should be of broad interest to the growing number of researchers working in single-cell genomics and will help further facilitate the generation of valuable mechanistic insights into developmental, homeostatic and disease processes.

Minimum complexity echo state network.

PubMed

Rodan, Ali; Tino, Peter

2011-01-01

Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the reservoir) and an adaptable readout form the state space. The reservoir is supposed to be sufficiently complex so as to capture a large number of features of the input stream that can be exploited by the reservoir-to-output readout mapping. The field of RC has been growing rapidly with many successful applications. However, RC has been criticized for not being principled enough. Reservoir construction is largely driven by a series of randomized model-building stages, with both researchers and practitioners having to rely on a series of trials and errors. To initialize a systematic study of the field, we concentrate on one of the most popular classes of RC methods, namely echo state network, and ask: What is the minimal complexity of reservoir construction for obtaining competitive models and what is the memory capacity (MC) of such simplified reservoirs? On a number of widely used time series benchmarks of different origin and characteristics, as well as by conducting a theoretical analysis we show that a simple deterministically constructed cycle reservoir is comparable to the standard echo state network methodology. The (short-term) MC of linear cyclic reservoirs can be made arbitrarily close to the proved optimal value.

Modularization of biochemical networks based on classification of Petri net t-invariants.

PubMed

Grafahrend-Belau, Eva; Schreiber, Falk; Heiner, Monika; Sackmann, Andrea; Junker, Björn H; Grunwald, Stefanie; Speer, Astrid; Winder, Katja; Koch, Ina

2008-02-08

Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from molecular biological networks promises a deeper understanding but confronts researchers with the problem of combinatorial explosion. The amount of qualitative network data is growing much faster than the amount of quantitative data, such as enzyme kinetics. In many cases it is even impossible to measure quantitative data because of limitations of experimental methods, or for ethical reasons. Thus, a huge amount of qualitative data, such as interaction data, is available, but it was not sufficiently used for modeling purposes, until now. New approaches have been developed, but the complexity of data often limits the application of many of the methods. Biochemical Petri nets make it possible to explore static and dynamic qualitative system properties. One Petri net approach is model validation based on the computation of the system's invariant properties, focusing on t-invariants. T-invariants correspond to subnetworks, which describe the basic system behavior.With increasing system complexity, the basic behavior can only be expressed by a huge number of t-invariants. According to our validation criteria for biochemical Petri nets, the necessary verification of the biological meaning, by interpreting each subnetwork (t-invariant) manually, is not possible anymore. Thus, an automated, biologically meaningful classification would be helpful in analyzing t-invariants, and supporting the understanding of the basic behavior of the considered biological system. Here, we introduce a new approach to automatically classify t-invariants to cope with network complexity. We apply clustering techniques such as UPGMA, Complete Linkage, Single Linkage, and Neighbor Joining in combination with different distance measures to get biologically meaningful clusters (t-clusters), which can be interpreted as modules. To find the optimal number of t-clusters to consider for interpretation, the cluster validity measure, Silhouette Width, is applied. We considered two different case studies as examples: a small signal transduction pathway (pheromone response pathway in Saccharomyces cerevisiae) and a medium-sized gene regulatory network (gene regulation of Duchenne muscular dystrophy). We automatically classified the t-invariants into functionally distinct t-clusters, which could be interpreted biologically as functional modules in the network. We found differences in the suitability of the various distance measures as well as the clustering methods. In terms of a biologically meaningful classification of t-invariants, the best results are obtained using the Tanimoto distance measure. Considering clustering methods, the obtained results suggest that UPGMA and Complete Linkage are suitable for clustering t-invariants with respect to the biological interpretability. We propose a new approach for the biological classification of Petri net t-invariants based on cluster analysis. Due to the biologically meaningful data reduction and structuring of network processes, large sets of t-invariants can be evaluated, allowing for model validation of qualitative biochemical Petri nets. This approach can also be applied to elementary mode analysis.

Modularization of biochemical networks based on classification of Petri net t-invariants

PubMed Central

Grafahrend-Belau, Eva; Schreiber, Falk; Heiner, Monika; Sackmann, Andrea; Junker, Björn H; Grunwald, Stefanie; Speer, Astrid; Winder, Katja; Koch, Ina

2008-01-01

Background Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from molecular biological networks promises a deeper understanding but confronts researchers with the problem of combinatorial explosion. The amount of qualitative network data is growing much faster than the amount of quantitative data, such as enzyme kinetics. In many cases it is even impossible to measure quantitative data because of limitations of experimental methods, or for ethical reasons. Thus, a huge amount of qualitative data, such as interaction data, is available, but it was not sufficiently used for modeling purposes, until now. New approaches have been developed, but the complexity of data often limits the application of many of the methods. Biochemical Petri nets make it possible to explore static and dynamic qualitative system properties. One Petri net approach is model validation based on the computation of the system's invariant properties, focusing on t-invariants. T-invariants correspond to subnetworks, which describe the basic system behavior. With increasing system complexity, the basic behavior can only be expressed by a huge number of t-invariants. According to our validation criteria for biochemical Petri nets, the necessary verification of the biological meaning, by interpreting each subnetwork (t-invariant) manually, is not possible anymore. Thus, an automated, biologically meaningful classification would be helpful in analyzing t-invariants, and supporting the understanding of the basic behavior of the considered biological system. Methods Here, we introduce a new approach to automatically classify t-invariants to cope with network complexity. We apply clustering techniques such as UPGMA, Complete Linkage, Single Linkage, and Neighbor Joining in combination with different distance measures to get biologically meaningful clusters (t-clusters), which can be interpreted as modules. To find the optimal number of t-clusters to consider for interpretation, the cluster validity measure, Silhouette Width, is applied. Results We considered two different case studies as examples: a small signal transduction pathway (pheromone response pathway in Saccharomyces cerevisiae) and a medium-sized gene regulatory network (gene regulation of Duchenne muscular dystrophy). We automatically classified the t-invariants into functionally distinct t-clusters, which could be interpreted biologically as functional modules in the network. We found differences in the suitability of the various distance measures as well as the clustering methods. In terms of a biologically meaningful classification of t-invariants, the best results are obtained using the Tanimoto distance measure. Considering clustering methods, the obtained results suggest that UPGMA and Complete Linkage are suitable for clustering t-invariants with respect to the biological interpretability. Conclusion We propose a new approach for the biological classification of Petri net t-invariants based on cluster analysis. Due to the biologically meaningful data reduction and structuring of network processes, large sets of t-invariants can be evaluated, allowing for model validation of qualitative biochemical Petri nets. This approach can also be applied to elementary mode analysis. PMID:18257938

A hybrid predictive model for acoustic noise in urban areas based on time series analysis and artificial neural network

NASA Astrophysics Data System (ADS)

Guarnaccia, Claudio; Quartieri, Joseph; Tepedino, Carmine

2017-06-01

The dangerous effect of noise on human health is well known. Both the auditory and non-auditory effects are largely documented in literature, and represent an important hazard in human activities. Particular care is devoted to road traffic noise, since it is growing according to the growth of residential, industrial and commercial areas. For these reasons, it is important to develop effective models able to predict the noise in a certain area. In this paper, a hybrid predictive model is presented. The model is based on the mixing of two different approach: the Time Series Analysis (TSA) and the Artificial Neural Network (ANN). The TSA model is based on the evaluation of trend and seasonality in the data, while the ANN model is based on the capacity of the network to "learn" the behavior of the data. The mixed approach will consist in the evaluation of noise levels by means of TSA and, once the differences (residuals) between TSA estimations and observed data have been calculated, in the training of a ANN on the residuals. This hybrid model will exploit interesting features and results, with a significant variation related to the number of steps forward in the prediction. It will be shown that the best results, in terms of prediction, are achieved predicting one step ahead in the future. Anyway, a 7 days prediction can be performed, with a slightly greater error, but offering a larger range of prediction, with respect to the single day ahead predictive model.

Systemic risk in a unifying framework for cascading processes on networks

NASA Astrophysics Data System (ADS)

Lorenz, J.; Battiston, S.; Schweitzer, F.

2009-10-01

We introduce a general framework for models of cascade and contagion processes on networks, to identify their commonalities and differences. In particular, models of social and financial cascades, as well as the fiber bundle model, the voter model, and models of epidemic spreading are recovered as special cases. To unify their description, we define the net fragility of a node, which is the difference between its fragility and the threshold that determines its failure. Nodes fail if their net fragility grows above zero and their failure increases the fragility of neighbouring nodes, thus possibly triggering a cascade. In this framework, we identify three classes depending on the way the fragility of a node is increased by the failure of a neighbour. At the microscopic level, we illustrate with specific examples how the failure spreading pattern varies with the node triggering the cascade, depending on its position in the network and its degree. At the macroscopic level, systemic risk is measured as the final fraction of failed nodes, X*, and for each of the three classes we derive a recursive equation to compute its value. The phase diagram of X* as a function of the initial conditions, thus allows for a prediction of the systemic risk as well as a comparison of the three different model classes. We could identify which model class leads to a first-order phase transition in systemic risk, i.e. situations where small changes in the initial conditions determine a global failure. Eventually, we generalize our framework to encompass stochastic contagion models. This indicates the potential for further generalizations.

Unified Simulation and Analysis Framework for Deep Space Navigation Design

NASA Technical Reports Server (NTRS)

Anzalone, Evan; Chuang, Jason; Olsen, Carrie

2013-01-01

As the technology that enables advanced deep space autonomous navigation continues to develop and the requirements for such capability continues to grow, there is a clear need for a modular expandable simulation framework. This tool's purpose is to address multiple measurement and information sources in order to capture system capability. This is needed to analyze the capability of competing navigation systems as well as to develop system requirements, in order to determine its effect on the sizing of the integrated vehicle. The development for such a framework is built upon Model-Based Systems Engineering techniques to capture the architecture of the navigation system and possible state measurements and observations to feed into the simulation implementation structure. These models also allow a common environment for the capture of an increasingly complex operational architecture, involving multiple spacecraft, ground stations, and communication networks. In order to address these architectural developments, a framework of agent-based modules is implemented to capture the independent operations of individual spacecraft as well as the network interactions amongst spacecraft. This paper describes the development of this framework, and the modeling processes used to capture a deep space navigation system. Additionally, a sample implementation describing a concept of network-based navigation utilizing digitally transmitted data packets is described in detail. This developed package shows the capability of the modeling framework, including its modularity, analysis capabilities, and its unification back to the overall system requirements and definition.

Networking for High Energy and Nuclear Physics

NASA Astrophysics Data System (ADS)

Newman, Harvey B.

2007-07-01

This report gives an overview of the status and outlook for the world's research networks and major international links used by the high energy physics and other scientific communities, network technology advances on which our community depends and in which we have an increasingly important role, and the problem of the Digital Divide, which is a primary focus of ICFA's Standing Committee on Inter-regional Connectivity (SCIC). Wide area networks of sufficient, and rapidly increasing end-to-end capability are vital for every phase of high energy physicists' work. Our bandwidth usage, and the typical capacity of the major national backbones and intercontinental links used by our field have progressed by a factor of more than 1000 over the past decade, and the outlook is for a similar increase over the next decade. This striking exponential growth trend, outstripping the growth rates in other areas of information technology, has continued in the past year, with many of the major national, continental and transoceanic networks supporting research and education progressing from a 10 Gigabits/sec (Gbps) backbone to multiple 10 Gbps links in their core. This is complemented by the use of point-to-point "light paths" to support the most demanding applications, including high energy physics, in a growing list of cases. As we approach the era of LHC physics, the growing need to access and transport Terabyte-scale and later 10 to 100 Terabyte datasets among more than 100 "Tier1" and "Tier2" centers at universities and laboratories spread throughout the world has brought the key role of networks, and the ongoing need for their development, sharply into focus. Bandwidth itself on an increasing scale is not enough. Realizing the scientific wealth of the LHC and our other major scientific programs depends crucially on our ability to use the bandwidth efficiently and reliably, with reliable high rates of data throughput, and effectively, where many parallel large-scale data transfers serving the community complete with high probability, often while coexisting with many other streams of network traffic. Responding to these needs, and to the scientific mission, physicists working with network engineers and computer scientists have made substantial progress in the development of protocols and systems that promise to meet these needs, placing our community among the world leaders in the development as well as use of large-scale networks. A great deal of work remains, and is continuing. As we advance in these areas, often (as in the past year) with great rapidity, there is a growing danger that we will leave behind our collaborators in regions with less-developed networks, or with regulatory frameworks or business models that put the required networks financially out of reach. This threatens to further open the Digital Divide that already exists among the regions of the world. In 2002, the SCIC recognized the threat that this Divide represents to our global scientific collaborations, and since that time has worked assiduously to reduce or eliminate it; both within our community, and more broadly in the world research community of which HEP is a part.

New Constraints on Upper Mantle Structure Underlying the Diamondiferous Central Slave Craton, Canada, from Teleseismic Body Wave Tomography

NASA Astrophysics Data System (ADS)

Esteve, C.; Schaeffer, A. J.; Audet, P.

2017-12-01

Over the past number of decades, the Slave Craton (Canada) has been extensively studied for its diamondiferous kimberlites. Not only are diamonds a valuable resource, but their kimberlitic host rocks provide an otherwise unique direct source of information on the deep upper mantle (and potentially transition zone). Many of the Canadian Diamond mines are located within the Slave Craton. As a result of the propensity for diamondiferous kimberlites, it is imperative to probe the deep mantle structure beneath the Slave Craton. This work is further motivated by the increase in high-quality broadband seismic data across the Northern Canadian Cordillera over the past decade. To this end we have generated a P and S body wave tomography model of the Slave Craton and its surroundings. Furthermore, tomographic inversion techniques are growing ever more capable of producing high resolution Earth models which capture detailed structure and dynamics across a range of scale lengths. Here, we present preliminary results on the structure of the upper mantle underlying the Slave Craton. These results are generated using data from eight different seismic networks such as the Canadian National Seismic Network (CNSN), Yukon Northwest Seismic Network (YNSN), older Portable Observatories for Lithospheric Analysis and Reseach Investigating Seismicity (POLARIS), Regional Alberta Observatory for Earthquake Studies Network (RV), USArray Transportable Array (TA), older Canadian Northwest Experiment (CANOE), Batholith Broadband (XY) and the Yukon Observatory (YO). This regional model brings new insights about the upper mantle structure beneath the Slave Craton, Canada.

Data Randomization and Cluster-Based Partitioning for Botnet Intrusion Detection.

PubMed

Al-Jarrah, Omar Y; Alhussein, Omar; Yoo, Paul D; Muhaidat, Sami; Taha, Kamal; Kim, Kwangjo

2016-08-01

Botnets, which consist of remotely controlled compromised machines called bots, provide a distributed platform for several threats against cyber world entities and enterprises. Intrusion detection system (IDS) provides an efficient countermeasure against botnets. It continually monitors and analyzes network traffic for potential vulnerabilities and possible existence of active attacks. A payload-inspection-based IDS (PI-IDS) identifies active intrusion attempts by inspecting transmission control protocol and user datagram protocol packet's payload and comparing it with previously seen attacks signatures. However, the PI-IDS abilities to detect intrusions might be incapacitated by packet encryption. Traffic-based IDS (T-IDS) alleviates the shortcomings of PI-IDS, as it does not inspect packet payload; however, it analyzes packet header to identify intrusions. As the network's traffic grows rapidly, not only the detection-rate is critical, but also the efficiency and the scalability of IDS become more significant. In this paper, we propose a state-of-the-art T-IDS built on a novel randomized data partitioned learning model (RDPLM), relying on a compact network feature set and feature selection techniques, simplified subspacing and a multiple randomized meta-learning technique. The proposed model has achieved 99.984% accuracy and 21.38 s training time on a well-known benchmark botnet dataset. Experiment results demonstrate that the proposed methodology outperforms other well-known machine-learning models used in the same detection task, namely, sequential minimal optimization, deep neural network, C4.5, reduced error pruning tree, and randomTree.

Overview of deep learning in medical imaging.

PubMed

Suzuki, Kenji

2017-09-01

The use of machine learning (ML) has been increasing rapidly in the medical imaging field, including computer-aided diagnosis (CAD), radiomics, and medical image analysis. Recently, an ML area called deep learning emerged in the computer vision field and became very popular in many fields. It started from an event in late 2012, when a deep-learning approach based on a convolutional neural network (CNN) won an overwhelming victory in the best-known worldwide computer vision competition, ImageNet Classification. Since then, researchers in virtually all fields, including medical imaging, have started actively participating in the explosively growing field of deep learning. In this paper, the area of deep learning in medical imaging is overviewed, including (1) what was changed in machine learning before and after the introduction of deep learning, (2) what is the source of the power of deep learning, (3) two major deep-learning models: a massive-training artificial neural network (MTANN) and a convolutional neural network (CNN), (4) similarities and differences between the two models, and (5) their applications to medical imaging. This review shows that ML with feature input (or feature-based ML) was dominant before the introduction of deep learning, and that the major and essential difference between ML before and after deep learning is the learning of image data directly without object segmentation or feature extraction; thus, it is the source of the power of deep learning, although the depth of the model is an important attribute. The class of ML with image input (or image-based ML) including deep learning has a long history, but recently gained popularity due to the use of the new terminology, deep learning. There are two major models in this class of ML in medical imaging, MTANN and CNN, which have similarities as well as several differences. In our experience, MTANNs were substantially more efficient in their development, had a higher performance, and required a lesser number of training cases than did CNNs. "Deep learning", or ML with image input, in medical imaging is an explosively growing, promising field. It is expected that ML with image input will be the mainstream area in the field of medical imaging in the next few decades.

Recent advances in modeling languages for pathway maps and computable biological networks.

PubMed

Slater, Ted

2014-02-01

As our theories of systems biology grow more sophisticated, the models we use to represent them become larger and more complex. Languages necessarily have the expressivity and flexibility required to represent these models in ways that support high-resolution annotation, and provide for simulation and analysis that are sophisticated enough to allow researchers to master their data in the proper context. These languages also need to facilitate model sharing and collaboration, which is currently best done by using uniform data structures (such as graphs) and language standards. In this brief review, we discuss three of the most recent systems biology modeling languages to appear: BEL, PySB and BCML, and examine how they meet these needs. Copyright © 2014 Elsevier Ltd. All rights reserved.

Social Network Analysis Applied to a Historical Ethnographic Study Surrounding Home Birth

PubMed Central

2018-01-01

Safety during birth has improved since hospital delivery became standard practice, but the process has also become increasingly medicalised. Hence, recent years have witnessed a growing interest in home births due to the advantages it offers to mothers and their newborn infants. The aims of the present study were to confirm the transition from a home birth model of care to a scenario in which deliveries began to occur almost exclusively in a hospital setting; to define the social networks surrounding home births; and to determine whether geography exerted any influence on the social networks surrounding home births. Adopting a qualitative approach, we recruited 19 women who had given birth at home in the mid 20th century in a rural area in Spain. We employed a social network analysis method. Our results revealed three essential aspects that remain relevant today: the importance of health professionals in home delivery care, the importance of the mother’s primary network, and the influence of the geographical location of the actors involved in childbirth. All of these factors must be taken into consideration when developing strategies for maternal health. PMID:29695089

Coupling root architecture and pore network modeling - an attempt towards better understanding root-soil interactions

NASA Astrophysics Data System (ADS)

Leitner, Daniel; Bodner, Gernot; Raoof, Amir

2013-04-01

Understanding root-soil interactions is of high importance for environmental and agricultural management. Root uptake is an essential component in water and solute transport modeling. The amount of groundwater recharge and solute leaching significantly depends on the demand based plant extraction via its root system. Plant uptake however not only responds to the potential demand, but in most situations is limited by supply form the soil. The ability of the plant to access water and solutes in the soil is governed mainly by root distribution. Particularly under conditions of heterogeneous distribution of water and solutes in the soil, it is essential to capture the interaction between soil and roots. Root architecture models allow studying plant uptake from soil by describing growth and branching of root axes in the soil. Currently root architecture models are able to respond dynamically to water and nutrient distribution in the soil by directed growth (tropism), modified branching and enhanced exudation. The porous soil medium as rooting environment in these models is generally described by classical macroscopic water retention and sorption models, average over the pore scale. In our opinion this simplified description of the root growth medium implies several shortcomings for better understanding root-soil interactions: (i) It is well known that roots grow preferentially in preexisting pores, particularly in more rigid/dry soil. Thus the pore network contributes to the architectural form of the root system; (ii) roots themselves can influence the pore network by creating preferential flow paths (biopores) which are an essential element of structural porosity with strong impact on transport processes; (iii) plant uptake depend on both the spatial location of water/solutes in the pore network as well as the spatial distribution of roots. We therefore consider that for advancing our understanding in root-soil interactions, we need not only to extend our root models, but also improve the description of the rooting environment. Until now there have been no attempts to couple root architecture and pore network models. In our work we present a first attempt to join both types of models using the root architecture model of Leitner et al., (2010) and a pore network model presented by Raoof et al. (2010). The two main objectives of coupling both models are: (i) Representing the effect of root induced biopores on flow and transport processes: For this purpose a fixed root architecture created by the root model is superimposed as a secondary root induced pore network to the primary soil network, thus influencing the final pore topology in the network generation. (ii) Representing the influence of pre-existing pores on root branching: Using a given network of (rigid) pores, the root architecture model allocates its root axes into these preexisting pores as preferential growth paths with thereby shape the final root architecture. The main objective of our study is to reveal the potential of using a pore scale description of the plant growth medium for an improved representation of interaction processes at the interface of root and soil. References Raoof, A., Hassanizadeh, S.M. 2010. A New Method for Generating Pore-Network Models. Transp. Porous Med. 81, 391-407. Leitner, D, Klepsch, S., Bodner, G., Schnepf, S. 2010. A dynamic root system growth model based on L-Systems. Tropisms and coupling to nutrient uptake from soil. Plant Soil 332, 177-192.

Data and Network Science for Noisy Heterogeneous Systems

ERIC Educational Resources Information Center

Rider, Andrew Kent

2013-01-01

Data in many growing fields has an underlying network structure that can be taken advantage of. In this dissertation we apply data and network science to problems in the domains of systems biology and healthcare. Data challenges in these fields include noisy, heterogeneous data, and a lack of ground truth. The primary thesis of this work is that…

Enterprise networks. Strategies for integrated delivery systems.

PubMed

Siwicki, B

1997-02-01

More integrated delivery systems are making progress toward building computer networks that link all their care delivery sites so they can efficiently and economically coordinate care. A growing number of these systems are turning to intranets--private computer networks that use Internet-derived protocols and technologies--to move information that's essential to managing scare health care resources.

Dealing with Disadvantage: Resilience and the Social Capital of Young People's Networks

ERIC Educational Resources Information Center

Bottrell, Dorothy

2009-01-01

This article analyzes how peer and extended networks provide young people with support and resources for dealing with disadvantage. Centering girls' accounts of growing up in the Glebe public housing estate, the difficulties they face, their critiques and aspirations are interpreted as resilience, supported by the social capital of their networks.…

A Cross Cultural Validation of Perceptions and Use of Social Network Service: An Exploratory Study

ERIC Educational Resources Information Center

Guo, Chengqi

2009-01-01

The rapid developments Social Network Service (SNS) have offered opportunities to re-visit many seminal theoretical assumptions of technology usage within socio-technical environment. Online social network is a rapidly growing field that imposes new questions to the existing IS research paradigm. It is argued that information systems research must…

Examining the Presence of Social Media on University Web Sites

ERIC Educational Resources Information Center

Greenwood, Grant

2012-01-01

Over the past few years, social networking has exploded into a massive medium that has captured the attention of a large portion of the American population. The ever-growing social networking site(s) (SNS) movement has filled a networking gap and thus, has presented higher education institutions with unique opportunities (Reid 2009) to further…

Productive Tensions in a Cross-Cultural Peer Mentoring Women's Network: A Social Capital Perspective

ERIC Educational Resources Information Center

Esnard, Talia; Cobb-Roberts, Deirdre; Agosto, Vonzell; Karanxha, Zorka; Beck, Makini; Wu, Ke; Unterreiner, Ann

2015-01-01

A growing body of researchers documents the unique barriers women face in their academic career progression and the significance of mentoring networks for advancement of their academic trajectories as faculty. However, few researchers explore the embedded tensions and conflicts in the social processes and relations of mentoring networks, and the…

Emergence of scale-free close-knit friendship structure in online social networks.

PubMed

Cui, Ai-Xiang; Zhang, Zi-Ke; Tang, Ming; Hui, Pak Ming; Fu, Yan

2012-01-01

Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four real networks. This work helps understand the interplay between structures on different scales in online social networks.

Emergence of Scale-Free Close-Knit Friendship Structure in Online Social Networks

PubMed Central

Cui, Ai-Xiang; Zhang, Zi-Ke; Tang, Ming; Hui, Pak Ming; Fu, Yan

2012-01-01

Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four real networks. This work helps understand the interplay between structures on different scales in online social networks. PMID:23272067

Diffusion Dynamics of Energy Saving Practices in Large Heterogeneous Online Networks

PubMed Central

Mohammadi, Neda; Wang, Qi; Taylor, John E.

2016-01-01

Online social networks are today’s fastest growing communications channel and a popular source of information for many, so understanding their contribution to building awareness and shaping public perceptions of climate change is of utmost importance. Today’s online social networks are composed of complex combinations of entities and communication channels and it is not clear which communicators are the most influential, what the patterns of communication flow are, or even whether the widely accepted two-step flow of communication model applies in this new arena. This study examines the diffusion of energy saving practices in a large online social network across organizations, opinion leaders, and the public by tracking 108,771 communications on energy saving practices among 1,084 communicators, then analyzing the flow of information and influence over a 28 day period. Our findings suggest that diffusion networks of messages advocating energy saving practices are predominantly led by the activities of dedicated organizations but their attempts do not result in substantial public awareness, as most of these communications are effectively trapped in organizational loops in which messages are simply shared between organizations. Despite their comparably significant influential values, opinion leaders played a weak role in diffusing energy saving practices to a wider audience. Thus, the two-step flow of communication model does not appear to describe the sharing of energy conservation practices in large online heterogeneous networks. These results shed new light on the underlying mechanisms driving the diffusion of important societal issues such as energy efficiency, particularly in the context of large online social media outlets. PMID:27736912

Diffusion Dynamics of Energy Saving Practices in Large Heterogeneous Online Networks.

PubMed

Mohammadi, Neda; Wang, Qi; Taylor, John E

2016-01-01

Online social networks are today's fastest growing communications channel and a popular source of information for many, so understanding their contribution to building awareness and shaping public perceptions of climate change is of utmost importance. Today's online social networks are composed of complex combinations of entities and communication channels and it is not clear which communicators are the most influential, what the patterns of communication flow are, or even whether the widely accepted two-step flow of communication model applies in this new arena. This study examines the diffusion of energy saving practices in a large online social network across organizations, opinion leaders, and the public by tracking 108,771 communications on energy saving practices among 1,084 communicators, then analyzing the flow of information and influence over a 28 day period. Our findings suggest that diffusion networks of messages advocating energy saving practices are predominantly led by the activities of dedicated organizations but their attempts do not result in substantial public awareness, as most of these communications are effectively trapped in organizational loops in which messages are simply shared between organizations. Despite their comparably significant influential values, opinion leaders played a weak role in diffusing energy saving practices to a wider audience. Thus, the two-step flow of communication model does not appear to describe the sharing of energy conservation practices in large online heterogeneous networks. These results shed new light on the underlying mechanisms driving the diffusion of important societal issues such as energy efficiency, particularly in the context of large online social media outlets.

The Atmospheric Mercury Network: measurement and initial examination of an ongoing atmospheric mercury record across North America

NASA Astrophysics Data System (ADS)

Gay, D. A.; Schmeltz, D.; Prestbo, E.; Olson, M.; Sharac, T.; Tordon, R.

2013-04-01

The National Atmospheric Deposition Program (NADP) developed and operates a collaborative network of atmospheric mercury monitoring sites based in North America - the Atmospheric Mercury Network (AMNet). The justification for the network was growing interest and demand from many scientists and policy makers for a robust database of measurements to improve model development, assess policies and programs, and improve estimates of mercury dry deposition. Many different agencies and groups support the network, including federal, state, tribal, and international governments, academic institutions, and private companies. AMNet has added two high elevation sites outside of continental North America in Hawaii and Taiwan because of new partnerships forged within NADP. Network sites measure concentrations of atmospheric mercury fractions using automated, continuous mercury speciation systems. The procedures that NADP developed for field operations, data management, and quality assurance ensure that the network makes scientifically valid and consistent measurements. AMNet reports concentrations of hourly gaseous elemental mercury (GEM), two-hour gaseous oxidized mercury (GOM), and two-hour particulate-bound mercury less than 2.5 microns in size (PBM2.5). As of January 2012, over 450 000 valid observations are available from 30 stations. The AMNet also collects ancillary meteorological data and information on land-use and vegetation, when available. We present atmospheric mercury data comparisons by time (3 yr) at 22 unique site locations. Highlighted are contrasting values for site locations across the network: urban versus rural, coastal versus high-elevation and the range of maximum observations. The data presented should catalyze the formation of many scientific questions that may be answered through further in-depth analysis and modeling studies of the AMNet database. All data and methods are publically available through an online database on the NADP website (http://nadp.isws.illinois.edu/amn/). Future network directions are to foster new network partnerships and continue to collect, quality assure, and post data, including dry deposition estimates, for each fraction.

The Atmospheric Mercury Network: measurement and initial examination of an ongoing atmospheric mercury record across North America

NASA Astrophysics Data System (ADS)

Gay, D. A.; Schmeltz, D.; Prestbo, E.; Olson, M.; Sharac, T.; Tordon, R.

2013-11-01

The National Atmospheric Deposition Program (NADP) developed and operates a collaborative network of atmospheric-mercury-monitoring sites based in North America - the Atmospheric Mercury Network (AMNet). The justification for the network was growing interest and demand from many scientists and policy makers for a robust database of measurements to improve model development, assess policies and programs, and improve estimates of mercury dry deposition. Many different agencies and groups support the network, including federal, state, tribal, and international governments, academic institutions, and private companies. AMNet has added two high-elevation sites outside of continental North America in Hawaii and Taiwan because of new partnerships forged within NADP. Network sites measure concentrations of atmospheric mercury fractions using automated, continuous mercury speciation systems. The procedures that NADP developed for field operations, data management, and quality assurance ensure that the network makes scientifically valid and consistent measurements. AMNet reports concentrations of hourly gaseous elemental mercury (GEM), two-hour gaseous oxidized mercury (GOM), and two-hour particulate-bound mercury less than 2.5 microns in size (PBM2.5). As of January 2012, over 450 000 valid observations are available from 30 stations. AMNet also collects ancillary meteorological data and information on land use and vegetation, when available. We present atmospheric mercury data comparisons by time (3 yr) at 21 individual sites and instruments. Highlighted are contrasting values for site locations across the network: urban versus rural, coastal versus high elevation and the range of maximum observations. The data presented should catalyze the formation of many scientific questions that may be answered through further in-depth analysis and modeling studies of the AMNet database. All data and methods are publically available through an online database on the NADP website (http://nadp.sws.uiuc.edu/amn/). Future network directions are to foster new network partnerships and continue to collect, quality assure, and post data, including dry deposition estimates, for each fraction.

The Effect of Farmers' Decisions on Pest Control with Bt Crops: A Billion Dollar Game of Strategy.

PubMed

Milne, Alice E; Bell, James R; Hutchison, William D; van den Bosch, Frank; Mitchell, Paul D; Crowder, David; Parnell, Stephen; Whitmore, Andrew P

2015-12-01

A farmer's decision on whether to control a pest is usually based on the perceived threat of the pest locally and the guidance of commercial advisors. Therefore, farmers in a region are often influenced by similar circumstances, and this can create a coordinated response for pest control that is effective at a landscape scale. This coordinated response is not intentional, but is an emergent property of the system. We propose a framework for understanding the intrinsic feedback mechanisms between the actions of humans and the dynamics of pest populations and demonstrate this framework using the European corn borer, a serious pest in maize crops. We link a model of the European corn borer and a parasite in a landscape with a model that simulates the decisions of individual farmers on what type of maize to grow. Farmers chose whether to grow Bt-maize, which is toxic to the corn borer, or conventional maize for which the seed is cheaper. The problem is akin to the snow-drift problem in game theory; that is to say, if enough farmers choose to grow Bt maize then because the pest is suppressed an individual may benefit from growing conventional maize. We show that the communication network between farmers' and their perceptions of profit and loss affects landscape scale patterns in pest dynamics. We found that although adoption of Bt maize often brings increased financial returns, these rewards oscillate in response to the prevalence of pests.

The Effect of Farmers’ Decisions on Pest Control with Bt Crops: A Billion Dollar Game of Strategy

PubMed Central

Hutchison, William D.; van den Bosch, Frank; Mitchell, Paul D.; Crowder, David; Parnell, Stephen; Whitmore, Andrew P.

2015-01-01

A farmer’s decision on whether to control a pest is usually based on the perceived threat of the pest locally and the guidance of commercial advisors. Therefore, farmers in a region are often influenced by similar circumstances, and this can create a coordinated response for pest control that is effective at a landscape scale. This coordinated response is not intentional, but is an emergent property of the system. We propose a framework for understanding the intrinsic feedback mechanisms between the actions of humans and the dynamics of pest populations and demonstrate this framework using the European corn borer, a serious pest in maize crops. We link a model of the European corn borer and a parasite in a landscape with a model that simulates the decisions of individual farmers on what type of maize to grow. Farmers chose whether to grow Bt-maize, which is toxic to the corn borer, or conventional maize for which the seed is cheaper. The problem is akin to the snow-drift problem in game theory; that is to say, if enough farmers choose to grow Bt maize then because the pest is suppressed an individual may benefit from growing conventional maize. We show that the communication network between farmers’ and their perceptions of profit and loss affects landscape scale patterns in pest dynamics. We found that although adoption of Bt maize often brings increased financial returns, these rewards oscillate in response to the prevalence of pests. PMID:26720851

Computer Simulations of the Tumor Vasculature: Applications to Interstitial Fluid Flow, Drug Delivery, and Oxygen Supply.

PubMed

Welter, Michael; Rieger, Heiko

2016-01-01

Tumor vasculature, the blood vessel network supplying a growing tumor with nutrients such as oxygen or glucose, is in many respects different from the hierarchically organized arterio-venous blood vessel network in normal tissues. Angiogenesis (the formation of new blood vessels), vessel cooption (the integration of existing blood vessels into the tumor vasculature), and vessel regression remodel the healthy vascular network into a tumor-specific vasculature. Integrative models, based on detailed experimental data and physical laws, implement, in silico, the complex interplay of molecular pathways, cell proliferation, migration, and death, tissue microenvironment, mechanical and hydrodynamic forces, and the fine structure of the host tissue vasculature. With the help of computer simulations high-precision information about blood flow patterns, interstitial fluid flow, drug distribution, oxygen and nutrient distribution can be obtained and a plethora of therapeutic protocols can be tested before clinical trials. This chapter provides an overview over the current status of computer simulations of vascular remodeling during tumor growth including interstitial fluid flow, drug delivery, and oxygen supply within the tumor. The model predictions are compared with experimental and clinical data and a number of longstanding physiological paradigms about tumor vasculature and intratumoral solute transport are critically scrutinized.

Structured Set Intra Prediction With Discriminative Learning in a Max-Margin Markov Network for High Efficiency Video Coding

PubMed Central

Dai, Wenrui; Xiong, Hongkai; Jiang, Xiaoqian; Chen, Chang Wen

2014-01-01

This paper proposes a novel model on intra coding for High Efficiency Video Coding (HEVC), which simultaneously predicts blocks of pixels with optimal rate distortion. It utilizes the spatial statistical correlation for the optimal prediction based on 2-D contexts, in addition to formulating the data-driven structural interdependences to make the prediction error coherent with the probability distribution, which is desirable for successful transform and coding. The structured set prediction model incorporates a max-margin Markov network (M3N) to regulate and optimize multiple block predictions. The model parameters are learned by discriminating the actual pixel value from other possible estimates to maximize the margin (i.e., decision boundary bandwidth). Compared to existing methods that focus on minimizing prediction error, the M3N-based model adaptively maintains the coherence for a set of predictions. Specifically, the proposed model concurrently optimizes a set of predictions by associating the loss for individual blocks to the joint distribution of succeeding discrete cosine transform coefficients. When the sample size grows, the prediction error is asymptotically upper bounded by the training error under the decomposable loss function. As an internal step, we optimize the underlying Markov network structure to find states that achieve the maximal energy using expectation propagation. For validation, we integrate the proposed model into HEVC for optimal mode selection on rate-distortion optimization. The proposed prediction model obtains up to 2.85% bit rate reduction and achieves better visual quality in comparison to the HEVC intra coding. PMID:25505829

SpineCreator: a Graphical User Interface for the Creation of Layered Neural Models.

PubMed

Cope, A J; Richmond, P; James, S S; Gurney, K; Allerton, D J

2017-01-01

There is a growing requirement in computational neuroscience for tools that permit collaborative model building, model sharing, combining existing models into a larger system (multi-scale model integration), and are able to simulate models using a variety of simulation engines and hardware platforms. Layered XML model specification formats solve many of these problems, however they are difficult to write and visualise without tools. Here we describe a new graphical software tool, SpineCreator, which facilitates the creation and visualisation of layered models of point spiking neurons or rate coded neurons without requiring the need for programming. We demonstrate the tool through the reproduction and visualisation of published models and show simulation results using code generation interfaced directly into SpineCreator. As a unique application for the graphical creation of neural networks, SpineCreator represents an important step forward for neuronal modelling.

Evolution of Linux operating system network

NASA Astrophysics Data System (ADS)

Xiao, Guanping; Zheng, Zheng; Wang, Haoqin

2017-01-01

Linux operating system (LOS) is a sophisticated man-made system and one of the most ubiquitous operating systems. However, there is little research on the structure and functionality evolution of LOS from the prospective of networks. In this paper, we investigate the evolution of the LOS network. 62 major releases of LOS ranging from versions 1.0 to 4.1 are modeled as directed networks in which functions are denoted by nodes and function calls are denoted by edges. It is found that the size of the LOS network grows almost linearly, while clustering coefficient monotonically decays. The degree distributions are almost the same: the out-degree follows an exponential distribution while both in-degree and undirected degree follow power-law distributions. We further explore the functionality evolution of the LOS network. It is observed that the evolution of functional modules is shown as a sequence of seven events (changes) succeeding each other, including continuing, growth, contraction, birth, splitting, death and merging events. By means of a statistical analysis of these events in the top 4 largest components (i.e., arch, drivers, fs and net), it is shown that continuing, growth and contraction events occupy more than 95% events. Our work exemplifies a better understanding and describing of the dynamics of LOS evolution.

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.

A Markov chain model for image ranking system in social networks

NASA Astrophysics Data System (ADS)

Zin, Thi Thi; Tin, Pyke; Toriu, Takashi; Hama, Hiromitsu

2014-03-01

In today world, different kinds of networks such as social, technological, business and etc. exist. All of the networks are similar in terms of distributions, continuously growing and expanding in large scale. Among them, many social networks such as Facebook, Twitter, Flickr and many others provides a powerful abstraction of the structure and dynamics of diverse kinds of inter personal connection and interaction. Generally, the social network contents are created and consumed by the influences of all different social navigation paths that lead to the contents. Therefore, identifying important and user relevant refined structures such as visual information or communities become major factors in modern decision making world. Moreover, the traditional method of information ranking systems cannot be successful due to their lack of taking into account the properties of navigation paths driven by social connections. In this paper, we propose a novel image ranking system in social networks by using the social data relational graphs from social media platform jointly with visual data to improve the relevance between returned images and user intentions (i.e., social relevance). Specifically, we propose a Markov chain based Social-Visual Ranking algorithm by taking social relevance into account. By using some extensive experiments, we demonstrated the significant and effectiveness of the proposed social-visual ranking method.

Detecting and analyzing research communities in longitudinal scientific networks.

PubMed

Leone Sciabolazza, Valerio; Vacca, Raffaele; Kennelly Okraku, Therese; McCarty, Christopher

2017-01-01

A growing body of evidence shows that collaborative teams and communities tend to produce the highest-impact scientific work. This paper proposes a new method to (1) Identify collaborative communities in longitudinal scientific networks, and (2) Evaluate the impact of specific research institutes, services or policies on the interdisciplinary collaboration between these communities. First, we apply community-detection algorithms to cross-sectional scientific collaboration networks and analyze different types of co-membership in the resulting subgroups over time. This analysis summarizes large amounts of longitudinal network data to extract sets of research communities whose members have consistently collaborated or shared collaborators over time. Second, we construct networks of cross-community interactions and estimate Exponential Random Graph Models to predict the formation of interdisciplinary collaborations between different communities. The method is applied to longitudinal data on publication and grant collaborations at the University of Florida. Results show that similar institutional affiliation, spatial proximity, transitivity effects, and use of the same research services predict higher degree of interdisciplinary collaboration between research communities. Our application also illustrates how the identification of research communities in longitudinal data and the analysis of cross-community network formation can be used to measure the growth of interdisciplinary team science at a research university, and to evaluate its association with research policies, services or institutes.

The Continuing Growth of Global Cooperation Networks in Research: A Conundrum for National Governments

PubMed Central

Wagner, Caroline S.; Park, Han Woo; Leydesdorff, Loet

2015-01-01

Global collaboration continues to grow as a share of all scientific cooperation, measured as coauthorships of peer-reviewed, published papers. The percent of all scientific papers that are internationally coauthored has more than doubled in 20 years, and they account for all the growth in output among the scientifically advanced countries. Emerging countries, particularly China, have increased their participation in global science, in part by doubling their spending on R&D; they are increasingly likely to appear as partners on internationally coauthored scientific papers. Given the growth of connections at the international level, it is helpful to examine the phenomenon as a communications network and to consider the network as a new organization on the world stage that adds to and complements national systems. When examined as interconnections across the globe over two decades, a global network has grown denser but not more clustered, meaning there are many more connections but they are not grouping into exclusive ‘cliques’. This suggests that power relationships are not reproducing those of the political system. The network has features an open system, attracting productive scientists to participate in international projects. National governments could gain efficiencies and influence by developing policies and strategies designed to maximize network benefits—a model different from those designed for national systems. PMID:26196296

Detecting and analyzing research communities in longitudinal scientific networks

PubMed Central

Vacca, Raffaele; Kennelly Okraku, Therese; McCarty, Christopher

2017-01-01

A growing body of evidence shows that collaborative teams and communities tend to produce the highest-impact scientific work. This paper proposes a new method to (1) Identify collaborative communities in longitudinal scientific networks, and (2) Evaluate the impact of specific research institutes, services or policies on the interdisciplinary collaboration between these communities. First, we apply community-detection algorithms to cross-sectional scientific collaboration networks and analyze different types of co-membership in the resulting subgroups over time. This analysis summarizes large amounts of longitudinal network data to extract sets of research communities whose members have consistently collaborated or shared collaborators over time. Second, we construct networks of cross-community interactions and estimate Exponential Random Graph Models to predict the formation of interdisciplinary collaborations between different communities. The method is applied to longitudinal data on publication and grant collaborations at the University of Florida. Results show that similar institutional affiliation, spatial proximity, transitivity effects, and use of the same research services predict higher degree of interdisciplinary collaboration between research communities. Our application also illustrates how the identification of research communities in longitudinal data and the analysis of cross-community network formation can be used to measure the growth of interdisciplinary team science at a research university, and to evaluate its association with research policies, services or institutes. PMID:28797047

Toward the automated generation of genome-scale metabolic networks in the SEED.

PubMed

DeJongh, Matthew; Formsma, Kevin; Boillot, Paul; Gould, John; Rycenga, Matthew; Best, Aaron

2007-04-26

Current methods for the automated generation of genome-scale metabolic networks focus on genome annotation and preliminary biochemical reaction network assembly, but do not adequately address the process of identifying and filling gaps in the reaction network, and verifying that the network is suitable for systems level analysis. Thus, current methods are only sufficient for generating draft-quality networks, and refinement of the reaction network is still largely a manual, labor-intensive process. We have developed a method for generating genome-scale metabolic networks that produces substantially complete reaction networks, suitable for systems level analysis. Our method partitions the reaction space of central and intermediary metabolism into discrete, interconnected components that can be assembled and verified in isolation from each other, and then integrated and verified at the level of their interconnectivity. We have developed a database of components that are common across organisms, and have created tools for automatically assembling appropriate components for a particular organism based on the metabolic pathways encoded in the organism's genome. This focuses manual efforts on that portion of an organism's metabolism that is not yet represented in the database. We have demonstrated the efficacy of our method by reverse-engineering and automatically regenerating the reaction network from a published genome-scale metabolic model for Staphylococcus aureus. Additionally, we have verified that our method capitalizes on the database of common reaction network components created for S. aureus, by using these components to generate substantially complete reconstructions of the reaction networks from three other published metabolic models (Escherichia coli, Helicobacter pylori, and Lactococcus lactis). We have implemented our tools and database within the SEED, an open-source software environment for comparative genome annotation and analysis. Our method sets the stage for the automated generation of substantially complete metabolic networks for over 400 complete genome sequences currently in the SEED. With each genome that is processed using our tools, the database of common components grows to cover more of the diversity of metabolic pathways. This increases the likelihood that components of reaction networks for subsequently processed genomes can be retrieved from the database, rather than assembled and verified manually.

Modeling of matter-wave solitons in a nonlinear inductor-capacitor network through a Gross-Pitaevskii equation with time-dependent linear potential

NASA Astrophysics Data System (ADS)

Kengne, E.; Lakhssassi, A.; Liu, W. M.

2017-08-01

A lossless nonlinear L C transmission network is considered. With the use of the reductive perturbation method in the semidiscrete limit, we show that the dynamics of matter-wave solitons in the network can be modeled by a one-dimensional Gross-Pitaevskii (GP) equation with a time-dependent linear potential in the presence of a chemical potential. An explicit expression for the growth rate of a purely growing modulational instability (MI) is presented and analyzed. We find that the potential parameter of the GP equation of the system does not affect the different regions of the MI. Neglecting the chemical potential in the GP equation, we derive exact analytical solutions which describe the propagation of both bright and dark solitary waves on continuous-wave (cw) backgrounds. Using the found exact analytical solutions of the GP equation, we investigate numerically the transmission of both bright and dark solitary voltage signals in the network. Our numerical studies show that the amplitude of a bright solitary voltage signal and the depth of a dark solitary voltage signal as well as their width, their motion, and their behavior depend on (i) the propagation frequencies, (ii) the potential parameter, and (iii) the amplitude of the cw background. The GP equation derived in this paper with a time-dependent linear potential opens up different ideas that may be of considerable theoretical interest for the management of matter-wave solitons in nonlinear L C transmission networks.

Evaluation of multisectional and two-section particulate matter photochemical grid models in the Western United States.

PubMed

Morris, Ralph; Koo, Bonyoung; Yarwood, Greg

2005-11-01

Version 4.10s of the comprehensive air-quality model with extensions (CAMx) photochemical grid model has been developed, which includes two options for representing particulate matter (PM) size distribution: (1) a two-section representation that consists of fine (PM2.5) and coarse (PM2.5-10) modes that has no interactions between the sections and assumes all of the secondary PM is fine; and (2) a multisectional representation that divides the PM size distribution into N sections (e.g., N = 10) and simulates the mass transfer between sections because of coagulation, accumulation, evaporation, and other processes. The model was applied to Southern California using the two-section and multisection representation of PM size distribution, and we found that allowing secondary PM to grow into the coarse mode had a substantial effect on PM concentration estimates. CAMx was then applied to the Western United States for the 1996 annual period with a 36-km grid resolution using both the two-section and multisection PM representation. The Community Multiscale Air Quality (CMAQ) and Regional Modeling for Aerosol and Deposition (REMSAD) models were also applied to the 1996 annual period. Similar model performance was exhibited by the four models across the Interagency Monitoring of Protected Visual Environments (IMPROVE) and Clean Air Status and Trends Network monitoring networks. All four of the models exhibited fairly low annual bias for secondary PM sulfate and nitrate but with a winter overestimation and summer underestimation bias. The CAMx multisectional model estimated that coarse mode secondary sulfate and nitrate typically contribute <10% of the total sulfate and nitrate when averaged across the more rural IMPROVE monitoring network.

Physical activity in Latinas: social and environmental influences

PubMed Central

Larsen, Britta A; Pekmezi, Dorothy; Marquez, Becky; Benitez, Tanya J; Marcus, Bess H

2013-01-01

Latinas are the largest, fastest growing female ethnic minority group in the USA, and also report the lowest levels of physical activity. Following the framework of the social ecological model, this review examines unique social and environmental factors that influence physical activity in Latinas. Research shows that Latinas receive little social support for activity despite having large, close-knit social networks. Interventions incorporating social support components are generally effcacious. Latinas also face many environmental barriers, including crime, heat, traffic, lack of facilities and a fear of immigration enforcement, and there have been few attempts to address environmental barriers in Latino communities. Successful future interventions will need to consider unique social and environmental barriers affecting Latinas, and help Latinas learn to incorporate social networks into physical activity participation. PMID:23477325

Resources for startup and growing businesses in the science and engineering sectors

NASA Astrophysics Data System (ADS)

Sabol, Joseph

2013-03-01

The American Chemical Society provides resources for members involved in forming startup and growing small businesses in the chemical and related sectors. In particular, the ACS Division of Small Chemical Businesses SCHB provides member benefits, informative programming at national and regional meetings, and networking opportunities for entrepreneurs. SCHB member benefits include listing in a directory of members' products and services, discounted expo booth rental at ACS national meetings, sponsorship to attend ACS leadership development courses, volunteer opportunities to shape and direct SCHB's operations, multiple social networking platforms, and professional networking opportunities with like-minded and similarly situated small business principals. SCHB's mission is ``To aid in the formation, development and growth of small chemical businesses.'' SCHB collaborates with other units in ACS, including local sections, the Chemical Entrepreneurship Council, the Division of Business Development & Management, Entrepreneurial Initiative, and Career Services. SCHB helps chemists gain skills to translate research into commercially successful products; build strong, growing companies that create jobs; and collaborate with professionals outside the chemical community. American Chemical Society, Division of Small Chemical Businesses

Membrane related dynamics and the formation of actin in cells growing on micro-topographies: a spatial computational model.

PubMed

Bittig, Arne T; Matschegewski, Claudia; Nebe, J Barbara; Stählke, Susanne; Uhrmacher, Adelinde M

2014-09-09

Intra-cellular processes of cells at the interface to an implant surface are influenced significantly by their extra-cellular surrounding. Specifically, when growing osteoblasts on titanium surfaces with regular micro-ranged geometry, filaments are shorter, less aligned and they concentrate at the top of the geometric structures. Changes to the cytoskeleton network, i. e., its localization, alignment, orientation, and lengths of the filaments, as well as the overall concentration and distribution of key-actors are induced. For example, integrin is distributed homogeneously, whereas integrin in activated state and vinculin, both components of focal adhesions, have been found clustered on the micro-ranged geometries. Also, the concentration of Rho, an intracellular signaling protein related to focal adhesion regulation, was significantly lower. To explore whether regulations associated with the focal adhesion complex can be responsible for the changed actin filament patterns, a spatial computational model has been developed using ML-Space, a rule-based model description language, and its associated Brownian-motion-based simulator. The focus has been on the deactivation of cofilin in the vicinity of the focal adhesion complex. The results underline the importance of sensing mechanisms to support a clustering of actin filament nucleations on the micro-ranged geometries, and of intracellular diffusion processes, which lead to spatially heterogeneous distributions of active (dephosphorylated) cofilin, which in turn influences the organization of the actin network. We find, for example, that the spatial heterogeneity of key molecular actors can explain the difference in filament lengths in cells on different micro-geometries partly, but to explain the full extent, further model assumptions need to be added and experimentally validated. In particular, our findings and hypothesis referring to the role, distribution, and amount of active cofilin have still to be verified in wet-lab experiments. Letting cells grow on surface structures is a possibility to shed new light on the intricate mechanisms that relate membrane and actin related dynamics in the cell. Our results demonstrate the need for declarative expressive spatial modeling approaches that allow probing different hypotheses, and the central role of the focal adhesion complex not only for nucleating actin filaments, but also for regulating possible severing agents locally.

Membrane related dynamics and the formation of actin in cells growing on micro-topographies: a spatial computational model

PubMed Central

2014-01-01

Background Intra-cellular processes of cells at the interface to an implant surface are influenced significantly by their extra-cellular surrounding. Specifically, when growing osteoblasts on titanium surfaces with regular micro-ranged geometry, filaments are shorter, less aligned and they concentrate at the top of the geometric structures. Changes to the cytoskeleton network, i. e., its localization, alignment, orientation, and lengths of the filaments, as well as the overall concentration and distribution of key-actors are induced. For example, integrin is distributed homogeneously, whereas integrin in activated state and vinculin, both components of focal adhesions, have been found clustered on the micro-ranged geometries. Also, the concentration of Rho, an intracellular signaling protein related to focal adhesion regulation, was significantly lower. Results To explore whether regulations associated with the focal adhesion complex can be responsible for the changed actin filament patterns, a spatial computational model has been developed using ML-Space, a rule-based model description language, and its associated Brownian-motion-based simulator. The focus has been on the deactivation of cofilin in the vicinity of the focal adhesion complex. The results underline the importance of sensing mechanisms to support a clustering of actin filament nucleations on the micro-ranged geometries, and of intracellular diffusion processes, which lead to spatially heterogeneous distributions of active (dephosphorylated) cofilin, which in turn influences the organization of the actin network. We find, for example, that the spatial heterogeneity of key molecular actors can explain the difference in filament lengths in cells on different micro-geometries partly, but to explain the full extent, further model assumptions need to be added and experimentally validated. In particular, our findings and hypothesis referring to the role, distribution, and amount of active cofilin have still to be verified in wet-lab experiments. Conclusion Letting cells grow on surface structures is a possibility to shed new light on the intricate mechanisms that relate membrane and actin related dynamics in the cell. Our results demonstrate the need for declarative expressive spatial modeling approaches that allow probing different hypotheses, and the central role of the focal adhesion complex not only for nucleating actin filaments, but also for regulating possible severing agents locally. PMID:25200251

A hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty

NASA Astrophysics Data System (ADS)

Mehrbod, Mehrdad; Tu, Nan; Miao, Lixin

2015-06-01

The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location-allocation problem, which more closely approximates real-world conditions. A multi-objective mixed integer nonlinear programming formulation is linearized by defining new variables and adding new constraints to the model. By considering the aforementioned model under uncertainty, this paper develops a hybrid solution approach by combining an interactive fuzzy goal programming approach and robust counterpart optimization based on three well-known robust counterpart optimization formulations. Finally, this paper compares the results of the three formulations using different test scenarios and parameter-sensitive analysis in terms of the quality of the final solution, CPU time, the level of conservatism, the degree of closeness to the ideal solution, the degree of balance involved in developing a compromise solution, and satisfaction degree.

Using Discrete Event Simulation to Model Attacker Interactions with Cyber and Physical Security Systems

DOE PAGES

Perkins, Casey; Muller, George

2015-10-08

The number of connections between physical and cyber security systems is rapidly increasing due to centralized control from automated and remotely connected means. As the number of interfaces between systems continues to grow, the interactions and interdependencies between them cannot be ignored. Historically, physical and cyber vulnerability assessments have been performed independently. This independent evaluation omits important aspects of the integrated system, where the impacts resulting from malicious or opportunistic attacks are not easily known or understood. Here, we describe a discrete event simulation model that uses information about integrated physical and cyber security systems, attacker characteristics and simple responsemore » rules to identify key safeguards that limit an attacker's likelihood of success. Key features of the proposed model include comprehensive data generation to support a variety of sophisticated analyses, and full parameterization of safeguard performance characteristics and attacker behaviours to evaluate a range of scenarios. Lastly, we also describe the core data requirements and the network of networks that serves as the underlying simulation structure.« less

Triphasic spike-timing-dependent plasticity organizes networks to produce robust sequences of neural activity

PubMed Central

Waddington, Amelia; Appleby, Peter A.; De Kamps, Marc; Cohen, Netta

2012-01-01

Synfire chains have long been proposed to generate precisely timed sequences of neural activity. Such activity has been linked to numerous neural functions including sensory encoding, cognitive and motor responses. In particular, it has been argued that synfire chains underlie the precise spatiotemporal firing patterns that control song production in a variety of songbirds. Previous studies have suggested that the development of synfire chains requires either initial sparse connectivity or strong topological constraints, in addition to any synaptic learning rules. Here, we show that this necessity can be removed by using a previously reported but hitherto unconsidered spike-timing-dependent plasticity (STDP) rule and activity-dependent excitability. Under this rule the network develops stable synfire chains that possess a non-trivial, scalable multi-layer structure, in which relative layer sizes appear to follow a universal function. Using computational modeling and a coarse grained random walk model, we demonstrate the role of the STDP rule in growing, molding and stabilizing the chain, and link model parameters to the resulting structure. PMID:23162457

Using Discrete Event Simulation to Model Attacker Interactions with Cyber and Physical Security Systems

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

Perkins, Casey; Muller, George

The number of connections between physical and cyber security systems is rapidly increasing due to centralized control from automated and remotely connected means. As the number of interfaces between systems continues to grow, the interactions and interdependencies between them cannot be ignored. Historically, physical and cyber vulnerability assessments have been performed independently. This independent evaluation omits important aspects of the integrated system, where the impacts resulting from malicious or opportunistic attacks are not easily known or understood. Here, we describe a discrete event simulation model that uses information about integrated physical and cyber security systems, attacker characteristics and simple responsemore » rules to identify key safeguards that limit an attacker's likelihood of success. Key features of the proposed model include comprehensive data generation to support a variety of sophisticated analyses, and full parameterization of safeguard performance characteristics and attacker behaviours to evaluate a range of scenarios. Lastly, we also describe the core data requirements and the network of networks that serves as the underlying simulation structure.« less

Modelling pathogen log10 reduction values achieved by activated sludge treatment using naïve and semi naïve Bayes network models.

PubMed

Carvajal, Guido; Roser, David J; Sisson, Scott A; Keegan, Alexandra; Khan, Stuart J

2015-11-15

Risk management for wastewater treatment and reuse have led to growing interest in understanding and optimising pathogen reduction during biological treatment processes. However, modelling pathogen reduction is often limited by poor characterization of the relationships between variables and incomplete knowledge of removal mechanisms. The aim of this paper was to assess the applicability of Bayesian belief network models to represent associations between pathogen reduction, and operating conditions and monitoring parameters and predict AS performance. Naïve Bayes and semi-naïve Bayes networks were constructed from an activated sludge dataset including operating and monitoring parameters, and removal efficiencies for two pathogens (native Giardia lamblia and seeded Cryptosporidium parvum) and five native microbial indicators (F-RNA bacteriophage, Clostridium perfringens, Escherichia coli, coliforms and enterococci). First we defined the Bayesian network structures for the two pathogen log10 reduction values (LRVs) class nodes discretized into two states (< and ≥ 1 LRV) using two different learning algorithms. Eight metrics, such as Prediction Accuracy (PA) and Area Under the receiver operating Curve (AUC), provided a comparison of model prediction performance, certainty and goodness of fit. This comparison was used to select the optimum models. The optimum Tree Augmented naïve models predicted removal efficiency with high AUC when all system parameters were used simultaneously (AUCs for C. parvum and G. lamblia LRVs of 0.95 and 0.87 respectively). However, metrics for individual system parameters showed only the C. parvum model was reliable. By contrast individual parameters for G. lamblia LRV prediction typically obtained low AUC scores (AUC < 0.81). Useful predictors for C. parvum LRV included solids retention time, turbidity and total coliform LRV. The methodology developed appears applicable for predicting pathogen removal efficiency in water treatment systems generally. Copyright © 2015 Elsevier Ltd. All rights reserved.

A Survey on Next-Generation Mixed Line Rate (MLR) and Energy-Driven Wavelength-Division Multiplexed (WDM) Optical Networks

NASA Astrophysics Data System (ADS)

Iyer, Sridhar

2015-06-01

With the ever-increasing traffic demands, infrastructure of the current 10 Gbps optical network needs to be enhanced. Further, since the energy crisis is gaining increasing concerns, new research topics need to be devised and technological solutions for energy conservation need to be investigated. In all-optical mixed line rate (MLR) network, feasibility of a lightpath is determined by the physical layer impairment (PLI) accumulation. Contrary to PLI-aware routing and wavelength assignment (PLIA-RWA) algorithm applicable for a 10 Gbps wavelength-division multiplexed (WDM) network, a new Routing, Wavelength, Modulation format assignment (RWMFA) algorithm is required for the MLR optical network. With the rapid growth of energy consumption in Information and Communication Technologies (ICT), recently, lot of attention is being devoted toward "green" ICT solutions. This article presents a review of different RWMFA (PLIA-RWA) algorithms for MLR networks, and surveys the most relevant research activities aimed at minimizing energy consumption in optical networks. In essence, this article presents a comprehensive and timely survey on a growing field of research, as it covers most aspects of MLR and energy-driven optical networks. Hence, the author aims at providing a comprehensive reference for the growing base of researchers who will work on MLR and energy-driven optical networks in the upcoming years. Finally, the article also identifies several open problems for future research.

Adverse Outcome Pathway Network Analyses: Techniques and benchmarking the AOPwiki

EPA Science Inventory

Abstract: As the community of toxicological researchers, risk assessors, and risk managers adopt the adverse outcome pathway (AOP) paradigm for organizing toxicological knowledge, the number and diversity of adverse outcome pathways and AOP networks are continuing to grow. This ...

Ant colony optimization algorithm for signal coordination of oversaturated traffic networks.

DOT National Transportation Integrated Search

2010-05-01

Traffic congestion is a daily and growing problem of the modern era in mostly all major cities in the world. : Increasing traffic demand strains the existing transportation system, leading to oversaturated network : conditions, especially at peak hou...

Selective Narrowing of Social Networks Across Adulthood is Associated With Improved Emotional Experience in Daily Life

PubMed Central

English, Tammy; Carstensen, Laura L.

2014-01-01

Past research has documented age differences in the size and composition of social networks that suggest that networks grow smaller with age and include an increasingly greater proportion of well-known social partners. According to socioemotional selectivity theory, such changes in social network composition serve an antecedent emotion regulatory function that supports an age-related increase in the priority that people place on emotional well-being. The present study employed a longitudinal design with a sample that spanned the full adult age range to examine whether there is evidence of within-individual (developmental) change in social networks and whether the characteristics of relationships predict emotional experiences in daily life. Using growth curve analyses, social networks were found to increase in size in young adulthood and then decline steadily throughout later life. As postulated by socioemotional selectivity theory, reductions were observed primarily in the number of peripheral partners; the number of close partners was relatively stable over time. In addition, cross-sectional analyses revealed that older adults reported that social network members elicited less negative emotion and more positive emotion. The emotional tone of social networks, particularly when negative emotions were associated with network members, also predicted experienced emotion of participants. Overall, findings were robust after taking into account demographic variables and physical health. The implications of these findings are discussed in the context of socioemotional selectivity theory and related theoretical models. PMID:24910483

Universality in survivor distributions: Characterizing the winners of competitive dynamics

NASA Astrophysics Data System (ADS)

Luck, J. M.; Mehta, A.

2015-11-01

We investigate the survivor distributions of a spatially extended model of competitive dynamics in different geometries. The model consists of a deterministic dynamical system of individual agents at specified nodes, which might or might not survive the predatory dynamics: all stochasticity is brought in by the initial state. Every such initial state leads to a unique and extended pattern of survivors and nonsurvivors, which is known as an attractor of the dynamics. We show that the number of such attractors grows exponentially with system size, so that their exact characterization is limited to only very small systems. Given this, we construct an analytical approach based on inhomogeneous mean-field theory to calculate survival probabilities for arbitrary networks. This powerful (albeit approximate) approach shows how universality arises in survivor distributions via a key concept—the dynamical fugacity. Remarkably, in the large-mass limit, the survivor probability of a node becomes independent of network geometry and assumes a simple form which depends only on its mass and degree.

Topological self-organization and prediction learning support both action and lexical chains in the brain.

PubMed

Chersi, Fabian; Ferro, Marcello; Pezzulo, Giovanni; Pirrelli, Vito

2014-07-01

A growing body of evidence in cognitive psychology and neuroscience suggests a deep interconnection between sensory-motor and language systems in the brain. Based on recent neurophysiological findings on the anatomo-functional organization of the fronto-parietal network, we present a computational model showing that language processing may have reused or co-developed organizing principles, functionality, and learning mechanisms typical of premotor circuit. The proposed model combines principles of Hebbian topological self-organization and prediction learning. Trained on sequences of either motor or linguistic units, the network develops independent neuronal chains, formed by dedicated nodes encoding only context-specific stimuli. Moreover, neurons responding to the same stimulus or class of stimuli tend to cluster together to form topologically connected areas similar to those observed in the brain cortex. Simulations support a unitary explanatory framework reconciling neurophysiological motor data with established behavioral evidence on lexical acquisition, access, and recall. Copyright © 2014 Cognitive Science Society, Inc.

Tracking Effects of Problematic Social Networking on Adolescent Psychopathology: The Mediating Role of Sleep Disruptions.

PubMed

Vernon, Lynette; Modecki, Kathryn L; Barber, Bonnie L

2017-01-01

Concerns are growing about adolescents' problematic social networking and possible links to depressed mood and externalizing behavior. Yet there remains little understanding of underlying processes that may account for these associations, including the mediating role of sleep disruption. This study tests this putative mediating process and examines change in problematic social networking investment and disrupted sleep, in relation to change in depressed mood and externalizing behavior. A sample of 874 students (41% male; 57.2% Caucasian; baseline M age = 14.4 years) from 27 high schools were surveyed. Participants' problematic social networking, sleep disruption, and psychopathology (depressed mood, externalizing behaviors) were measured annually over 3 years. Longitudinal mediation was tested using latent trajectories of problematic social networking use, sleep disruption, and psychopathology. Both problematic social networking and sleep disruption underwent positive linear growth over time. Adolescents who increasingly invested in social networking reported increased depressed mood, with around 53% of this association explained by the indirect effect of increased sleep disruptions. Further, adolescents who increasingly invested in social networking also reported increased externalizing behavior; some of this relation was explained (13%) via increased sleep disruptions. However an alternative model in which increased externalizing was associated with increased social networking, mediated by sleep disruptions, indicated a reciprocal relation of similar magnitude. It is important for parents, teachers, and psychologists to minimize the negative effects of social networking on adolescents' psychopathology. Interventions should potentially target promoting healthy sleep habits through reductions in social networking investment and rescheduling usage away from bedtime.

Estimation of oxygen isotope in source water of tree-ring cellulose in Indonesia using tree-ring oxygen isotope model

NASA Astrophysics Data System (ADS)

Hisamochi, R.; Watanabe, Y.; Kurita, N.; Sano, M.; Nakatsuka, T.; Matsuo, M.; Yamamoto, H.; Sugiyama, J.; Tsuda, T.; Tagami, T.

2016-12-01

Oxygen isotope composition (δ18O) of tree-ring cellulose has been used as paleoclimate proxy because its origin is atmospheric precipitation. However, interpretation of tree-ring cellulose δ18O is not simple because source water of tree-ring cellulose (the water took up by tree) is not atmospheric precipitation but soil water or ground water in growing season, precisely. In this study, we investigate the relationship between source water of tree-ring cellulose and precipitation in order to improve interpretation of tree-ring cellulose δ18O as paleoclimate proxy. We collected ten teak (Tectona grandis) plantation samples in Java Island, Indonesia. Teak is deciduous tree and grows in rainy season. Samples were cut into annual rings after cellulose extraction. δ18O of individual rings were measured by TCEA-IRMS at the Research Institute of Humanity and Nature. We calculatedδ18O of source water by means of tree-ring oxygen isotope model and then comparedδ18O of source water and that of monthly atmospheric precipitation at Jakarta (GNIP; Global Network of isotopes in Precipitation). Source waterδ18O shows two types of significant correlation withδ18O in atmospheric precipitation. One is positive correlation withδ18O of atmospheric precipitation in previous rainy season. Another is negative correlation with δ18O of atmospheric precipitation in beginning of the growing season. The former indicates that soil water in growing season contains rainfall in previous rainy season and teak mainly takes it up. The latter is difficult to interpret. It may be related to soil moisutre in beginning of growing season.

Network geometry with flavor: From complexity to quantum geometry

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

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

Network geometry with flavor: From complexity to quantum geometry.

PubMed

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

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

Can Social Network Analysis Help Address the High Rates of Bacterial Sexually Transmitted Infections in Saskatchewan?

PubMed

Trecker, Molly A; Dillon, Jo-Anne R; Lloyd, Kathy; Hennink, Maurice; Jolly, Ann; Waldner, Cheryl

2017-06-01

Saskatchewan has one of the highest rates of gonorrhea among the Canadian provinces-more than double the national rate. In light of these high rates, and the growing threat of untreatable infections, improved understanding of gonorrhea transmission dynamics in the province and evaluation of the current system and tools for disease control are important. We extracted data from a cross-sectional sample of laboratory-confirmed gonorrhea cases between 2003 and 2012 from the notifiable disease files of the Regina Qu'Appelle Health Region. The database was stratified by calendar year, and social network analysis combined with statistical modeling was used to identify associations between measures of connection within the network and the odds of repeat gonorrhea and risk of coinfection with chlamydia at the time of diagnosis. Networks were highly fragmented. Younger age and component size were positively associated with being coinfected with chlamydia. Being coinfected, reporting sex trade involvement, and component size were all positively associated with repeat infection. This is the first study to apply social network analysis to gonorrhea transmission in Saskatchewan and contributes important information about the relationship of network connections to gonorrhea/chlamydia coinfection and repeat gonorrhea. This study also suggests several areas for change of systems-related factors that could greatly increase understanding of social networks and enhance the potential for bacterial sexually transmitted infection control in Saskatchewan.

Reciprocity and the Emergence of Power Laws in Social Networks

NASA Astrophysics Data System (ADS)

Schnegg, Michael

Research in network science has shown that many naturally occurring and technologically constructed networks are scale free, that means a power law degree distribution emerges from a growth model in which each new node attaches to the existing network with a probability proportional to its number of links (= degree). Little is known about whether the same principles of local attachment and global properties apply to societies as well. Empirical evidence from six ethnographic case studies shows that complex social networks have significantly lower scaling exponents γ ~ 1 than have been assumed in the past. Apparently humans do not only look for the most prominent players to play with. Moreover cooperation in humans is characterized through reciprocity, the tendency to give to those from whom one has received in the past. Both variables — reciprocity and the scaling exponent — are negatively correlated (r = -0.767, sig = 0.075). If we include this effect in simulations of growing networks, degree distributions emerge that are much closer to those empirically observed. While the proportion of nodes with small degrees decreases drastically as we introduce reciprocity, the scaling exponent is more robust and changes only when a relatively large proportion of attachment decisions follow this rule. If social networks are less scale free than previously assumed this has far reaching implications for policy makers, public health programs and marketing alike.

Nationwide Network of TalentPoints: The Hungarian Approach to Talent Support

ERIC Educational Resources Information Center

Csermely, Peter; Rajnai, Gabor; Sulyok, Katalin

2013-01-01

In 2006 a novel approach to talent support was promoted by several talent support programmes in Hungary. The new idea was a network approach. The nationwide network of so-called TalentPoints and its framework, the Hungarian Genius Program, gained substantial European Union funding in 2009, and today it is growing rapidly. A novel concept of talent…

Modeling inter-signal arrival times for accurate detection of CAN bus signal injection attacks

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

Moore, Michael Roy; Bridges, Robert A; Combs, Frank L

Modern vehicles rely on hundreds of on-board electronic control units (ECUs) communicating over in-vehicle networks. As external interfaces to the car control networks (such as the on-board diagnostic (OBD) port, auxiliary media ports, etc.) become common, and vehicle-to-vehicle / vehicle-to-infrastructure technology is in the near future, the attack surface for vehicles grows, exposing control networks to potentially life-critical attacks. This paper addresses the need for securing the CAN bus by detecting anomalous traffic patterns via unusual refresh rates of certain commands. While previous works have identified signal frequency as an important feature for CAN bus intrusion detection, this paper providesmore » the first such algorithm with experiments on five attack scenarios. Our data-driven anomaly detection algorithm requires only five seconds of training time (on normal data) and achieves true positive / false discovery rates of 0.9998/0.00298, respectively (micro-averaged across the five experimental tests).« less

Do Convolutional Neural Networks Learn Class Hierarchy?

PubMed

Bilal, Alsallakh; Jourabloo, Amin; Ye, Mao; Liu, Xiaoming; Ren, Liu

2018-01-01

Convolutional Neural Networks (CNNs) currently achieve state-of-the-art accuracy in image classification. With a growing number of classes, the accuracy usually drops as the possibilities of confusion increase. Interestingly, the class confusion patterns follow a hierarchical structure over the classes. We present visual-analytics methods to reveal and analyze this hierarchy of similar classes in relation with CNN-internal data. We found that this hierarchy not only dictates the confusion patterns between the classes, it furthermore dictates the learning behavior of CNNs. In particular, the early layers in these networks develop feature detectors that can separate high-level groups of classes quite well, even after a few training epochs. In contrast, the latter layers require substantially more epochs to develop specialized feature detectors that can separate individual classes. We demonstrate how these insights are key to significant improvement in accuracy by designing hierarchy-aware CNNs that accelerate model convergence and alleviate overfitting. We further demonstrate how our methods help in identifying various quality issues in the training data.

The role of a bus network in access to primary health care in Metropolitan Auckland, New Zealand.

PubMed

Rocha, C M; McGuire, S; Whyman, R; Kruger, E; Tennant, M

2015-09-01

Background: This study examined the spatial accessibility of the population of metropolitan Auckland, New Zealand to the bus network, to connect them to primary health providers, in this case doctors (GP) and dentists. Analysis of accessibility by ethnic identity and socio-economic status were also carried out, because of existing health inequalities along these dimensions. The underlying hypothesis was that most people would live within easy reach of primary health providers, or easy bus transport to such providers. An integrated geographic model of bus transport routes and stops, with population and primary health providers (medical. and dental practices) was developed and analysed. Although the network of buses in metropolitan Auckland is substantial and robust it was evident that many people live more than 150 metres from a stop. Improving the access to bus stops, particularly in areas of high primary health care need (doctors and dentists), would certainly be an opportunity to enhance spatial access in a growing metropolitan area.

Popularity versus similarity in growing networks.

PubMed

Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M Ángeles; Boguñá, Marián; Krioukov, Dmitri

2012-09-27

The principle that 'popularity is attractive' underlies preferential attachment, which is a common explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections possessed by nodes follows power laws, as observed in many real networks. Preferential attachment has been directly validated for some real networks (including the Internet), and can be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks or duplication. Here we show that popularity is just one dimension of attractiveness; another dimension is similarity. We develop a framework in which new connections optimize certain trade-offs between popularity and similarity, instead of simply preferring popular nodes. The framework has a geometric interpretation in which popularity preference emerges from local optimization. As opposed to preferential attachment, our optimization framework accurately describes the large-scale evolution of technological (the Internet), social (trust relationships between people) and biological (Escherichia coli metabolic) networks, predicting the probability of new links with high precision. The framework that we have developed can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.

An historical overview of the National Network of Libraries of Medicine, 1985-2015.

PubMed

Speaker, Susan L

2018-04-01

The National Network of Libraries of Medicine (NNLM), established as the Regional Medical Library Program in 1965, has a rich and remarkable history. The network's first twenty years were documented in a detailed 1987 history by Alison Bunting, AHIP, FMLA. This article traces the major trends in the network's development since then: reconceiving the Regional Medical Library staff as a "field force" for developing, marketing, and distributing a growing number of National Library of Medicine (NLM) products and services; subsequent expansion of outreach to health professionals who are unaffiliated with academic medical centers, particularly those in public health; the advent of the Internet during the 1990s, which brought the migration of NLM and NNLM resources and services to the World Wide Web, and a mandate to encourage and facilitate Internet connectivity in the network; and the further expansion of the NLM and NNLM mission to include providing consumer health resources to satisfy growing public demand. The concluding section discusses the many challenges that NNLM staff faced as they transformed the network from a system that served mainly academic medical researchers to a larger, denser organization that offers health information resources to everyone.

Linking knowledge and action through mental models of sustainable agriculture

PubMed Central

Hoffman, Matthew; Lubell, Mark; Hillis, Vicken

2014-01-01

Linking knowledge to action requires understanding how decision-makers conceptualize sustainability. This paper empirically analyzes farmer “mental models” of sustainability from three winegrape-growing regions of California where local extension programs have focused on sustainable agriculture. The mental models are represented as networks where sustainability concepts are nodes, and links are established when a farmer mentions two concepts in their stated definition of sustainability. The results suggest that winegrape grower mental models of sustainability are hierarchically structured, relatively similar across regions, and strongly linked to participation in extension programs and adoption of sustainable farm practices. We discuss the implications of our findings for the debate over the meaning of sustainability, and the role of local extension programs in managing knowledge systems. PMID:25157158

Specification and evaluation of a regional PACS in the SaxTeleMed project

NASA Astrophysics Data System (ADS)

Lemke, Heinz U.; Niederlag, W.; Heuser, H.

2002-05-01

During the early development phase of PACS, its implementation was mainly a matter of the radiological department of a hospital. This is changing rapidly and PACS planning and realization is increasingly seen in the context of a hospital-wide approach. With a growth of networking amongst healthcare institutions and the growing relevance of teleradiological scenarios, new strategies must be followed which take not only local but also regional and global aspects of PACS into consideration. One such regional PACS project was initiated by the Ministry of Social Welfare of the Free State of Saxony in Germany. This 'reference model program for the digitization of imaging procedures and communication of images between hospitals in the free state of Saxony' (SaxTeleMed) covers seven regional projects distributed throughout Saxony. Each regional project is organized around so called lead hospitals, which network with other cooperating hospitals and medical practices. The regional reference projects are designed to be largely independent from one another. In some instances, however, a network connection between reference projects is also considered. Altogether, 39 hospitals and medical centers are involved in the model program. The aim of this program is to test the technical, organizational, legal and economic problems in the area of digitization and networking within the free State of Saxony. With the knowledge gained it is expected to improve future investment decisions in healthcare and above all to implement secure systems.

Biocharts: a visual formalism for complex biological systems

PubMed Central

Kugler, Hillel; Larjo, Antti; Harel, David

2010-01-01

We address one of the central issues in devising languages, methods and tools for the modelling and analysis of complex biological systems, that of linking high-level (e.g. intercellular) information with lower-level (e.g. intracellular) information. Adequate ways of dealing with this issue are crucial for understanding biological networks and pathways, which typically contain huge amounts of data that continue to grow as our knowledge and understanding of a system increases. Trying to comprehend such data using the standard methods currently in use is often virtually impossible. We propose a two-tier compound visual language, which we call Biocharts, that is geared towards building fully executable models of biological systems. One of the main goals of our approach is to enable biologists to actively participate in the computational modelling effort, in a natural way. The high-level part of our language is a version of statecharts, which have been shown to be extremely successful in software and systems engineering. The statecharts can be combined with any appropriately well-defined language (preferably a diagrammatic one) for specifying the low-level dynamics of the pathways and networks. We illustrate the language and our general modelling approach using the well-studied process of bacterial chemotaxis. PMID:20022895

NAN--a national voice for community-based services to persons with AIDS.

PubMed Central

Kawata, P A; Andriote, J M

1988-01-01

Because of the variety of needs engendered by AIDS, a broadbased response to the epidemic is warranted. The traditional medical model, with its emphasis on inpatient hospital care, is expensive and fails to address other needs of people with AIDS (PWAs). This paper outlines an alternative model: the community-based response, or continuum-of-care model. It builds on earlier community models of an integrated network of service providers who can better meet a range of needs of PWAs outside the hospital. Although the model may include a designated hospital AIDS unit that supplies inpatient services, the continuum-of-care model incorporates other nonacute and psychosocial services offered through community-based providers, and these services rely to a large extent on volunteers. Nationwide, more than 400 community-based AIDS service organizations have been formed in response to the growing AIDS epidemic, or have evolved from existing organizations. The National AIDS Network (NAN) was formed in 1985 by five such organizations to represent at the national level the vision of community-based AIDS care. As the nexus for a national community-based response, NAN acts as a conduit for service providers to share experience as well as a clearinghouse for information and programs. PMID:3131822

Growing an Emerging Research University

ERIC Educational Resources Information Center

Birx, Donald L.; Anderson-Fletcher, Elizabeth; Whitney, Elizabeth

2013-01-01

The emerging research college or university is one of the most formidable resources a region has to reinvent and grow its economy. This paper is the first of two that outlines a process of building research universities that enhance regional technology development and facilitate flexible networks of collaboration and resource sharing. Although the…

A likely-universal model of fracture density and scaling justified by both data and theory. Consequences for crustal hydro-mechanics

NASA Astrophysics Data System (ADS)

Davy, P.; Darcel, C.; Le Goc, R.; Bour, O.

2011-12-01

We discuss the parameters that control fracture density on the Earth. We argue that most of fracture systems are spatially organized according to two main regimes. The smallest fractures can grow independently of each others, defining a "dilute" regime controlled by nuclei occurrence rate and individual fracture growth law. Above a certain length, fractures stop growing due to mechanical interactions between fractures. For this "dense" regime, we derive the fracture density distribution by acknowledging that, statistically, fractures do not cross a larger one. This very crude rule, which expresses the inhibiting role of large fractures against smaller ones but not the reverse, actually appears be a very strong control on the eventual fracture density distribution since it results in a self-similar distribution whose exponents and density term are fully determined by the fractal dimension D and a dimensionless parameter γ that encompasses the details of fracture correlations and orientations. The range of values for D and γ appears to be extremely limited, which makes this model quite universal. This theory is supported by quantitative data on either fault or joint networks. The transition between the dilute and dense regimes occurs at about a few tenths of kilometers for faults systems, and a few meters for joints. This remarkable difference between both processes is likely due to a large-scale control (localization) of the fracture growth for faulting that does not exist for jointing. Finally, we discuss the consequences of this model on both flow and mechanical properties. In the dense regime, networks appears to be very close to a critical state.

Bigdata Driven Cloud Security: A Survey

NASA Astrophysics Data System (ADS)

Raja, K.; Hanifa, Sabibullah Mohamed

2017-08-01

Cloud Computing (CC) is a fast-growing technology to perform massive-scale and complex computing. It eliminates the need to maintain expensive computing hardware, dedicated space, and software. Recently, it has been observed that massive growth in the scale of data or big data generated through cloud computing. CC consists of a front-end, includes the users’ computers and software required to access the cloud network, and back-end consists of various computers, servers and database systems that create the cloud. In SaaS (Software as-a-Service - end users to utilize outsourced software), PaaS (Platform as-a-Service-platform is provided) and IaaS (Infrastructure as-a-Service-physical environment is outsourced), and DaaS (Database as-a-Service-data can be housed within a cloud), where leading / traditional cloud ecosystem delivers the cloud services become a powerful and popular architecture. Many challenges and issues are in security or threats, most vital barrier for cloud computing environment. The main barrier to the adoption of CC in health care relates to Data security. When placing and transmitting data using public networks, cyber attacks in any form are anticipated in CC. Hence, cloud service users need to understand the risk of data breaches and adoption of service delivery model during deployment. This survey deeply covers the CC security issues (covering Data Security in Health care) so as to researchers can develop the robust security application models using Big Data (BD) on CC (can be created / deployed easily). Since, BD evaluation is driven by fast-growing cloud-based applications developed using virtualized technologies. In this purview, MapReduce [12] is a good example of big data processing in a cloud environment, and a model for Cloud providers.

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

Thaule, S.B.; Postvoll, W.

Installation by den norske stats oljeselskap A.S. (Statoil) of a powerful pipeline-modeling system on Zeepipe has allowed this major North Sea gas pipeline to meet the growing demands and seasonal variations of the European gas market. The Troll gas-sales agreement (TGSA) in 1986 called for large volumes of Norwegian gas to begin arriving from the North Sea Sleipner East field in october 1993. It is important to Statoil to maintain regular gas delivers from its integrated transport network. In addition, high utilization of transport capacity maximizes profits. In advance of operations, Statoil realized that state-of-the-art supervisory control and data acquisitionmore » (scada) and pipeline-modeling systems (PMS) would be necessary to meet its goals and to remain the most efficient North Sea operator. The paper describes the linking of Troll and Zeebrugge, contractual issues, the supervisory system, the scada module, pipeline modeling, real-time model, look-ahead model, predictive model, and model performance.« less

Near-Road Air Quality Monitoring: Factors Affecting Network Design and Interpretation of Data

EPA Science Inventory

The growing number of health studies identifying adverse health effects for populations spending significant amounts of time near large roadways has increased the interest in monitoring air quality in this microenvironment. Designing near-road air monitoring networks or interpret...

Local Area Networks.

ERIC Educational Resources Information Center

Nasatir, Marilyn; And Others

1990-01-01

Four papers discuss LANs (local area networks) and library applications: (1) "Institute for Electrical and Electronic Engineers Standards..." (Charles D. Brown); (2) "Facilities Planning for LANs..." (Gail Persky); (3) "Growing up with the Alumni Library: LAN..." (Russell Buchanan); and (4) "Implementing a LAN...at the Health Sciences Library"…

Network patterns in exponentially growing two-dimensional biofilms

NASA Astrophysics Data System (ADS)

Zachreson, Cameron; Yap, Xinhui; Gloag, Erin S.; Shimoni, Raz; Whitchurch, Cynthia B.; Toth, Milos

2017-10-01

Anisotropic collective patterns occur frequently in the morphogenesis of two-dimensional biofilms. These patterns are often attributed to growth regulation mechanisms and differentiation based on gradients of diffusing nutrients and signaling molecules. Here, we employ a model of bacterial growth dynamics to show that even in the absence of growth regulation or differentiation, confinement by an enclosing medium such as agar can itself lead to stable pattern formation over time scales that are employed in experiments. The underlying mechanism relies on path formation through physical deformation of the enclosing environment.

The small world of osteocytes: connectomics of the lacuno-canalicular network in bone

NASA Astrophysics Data System (ADS)

Kollmannsberger, Philip; Kerschnitzki, Michael; Repp, Felix; Wagermaier, Wolfgang; Weinkamer, Richard; Fratzl, Peter

2017-07-01

Osteocytes and their cell processes reside in a large, interconnected network of voids pervading the mineralized bone matrix of most vertebrates. This osteocyte lacuno-canalicular network (OLCN) is believed to play important roles in mechanosensing, mineral homeostasis, and for the mechanical properties of bone. While the extracellular matrix structure of bone is extensively studied on ultrastructural and macroscopic scales, there is a lack of quantitative knowledge on how the cellular network is organized. Using a recently introduced imaging and quantification approach, we analyze the OLCN in different bone types from mouse and sheep that exhibit different degrees of structural organization not only of the cell network but also of the fibrous matrix deposited by the cells. We define a number of robust, quantitative measures that are derived from the theory of complex networks. These measures enable us to gain insights into how efficient the network is organized with regard to intercellular transport and communication. Our analysis shows that the cell network in regularly organized, slow-growing bone tissue from sheep is less connected, but more efficiently organized compared to irregular and fast-growing bone tissue from mice. On the level of statistical topological properties (edges per node, edge length and degree distribution), both network types are indistinguishable, highlighting that despite pronounced differences at the tissue level, the topological architecture of the osteocyte canalicular network at the subcellular level may be independent of species and bone type. Our results suggest a universal mechanism underlying the self-organization of individual cells into a large, interconnected network during bone formation and mineralization.

From loss to loneliness: The relationship between bereavement and depressive symptoms.

PubMed

Fried, Eiko I; Bockting, Claudi; Arjadi, Retha; Borsboom, Denny; Amshoff, Maximilian; Cramer, Angélique O J; Epskamp, Sacha; Tuerlinckx, Francis; Carr, Deborah; Stroebe, Margaret

2015-05-01

Spousal bereavement can cause a rise in depressive symptoms. This study empirically evaluates 2 competing explanations concerning how this causal effect is brought about: (a) a traditional latent variable explanation, in which loss triggers depression which then leads to symptoms; and (b) a novel network explanation, in which bereavement directly affects particular depression symptoms which then activate other symptoms. We used data from the Changing Lives of Older Couples (CLOC) study and compared depressive symptomatology, assessed via the 11-item Center for Epidemiologic Studies Depression Scale (CES-D), among those who lost their partner (N = 241) with a still-married control group (N = 274). We modeled the effect of partner loss on depressive symptoms either as an indirect effect through a latent variable, or as a direct effect in a network constructed through a causal search algorithm. Compared to the control group, widow(er)s' scores were significantly higher for symptoms of loneliness, sadness, depressed mood, and appetite loss, and significantly lower for happiness and enjoyed life. The effect of partner loss on these symptoms was not mediated by a latent variable. The network model indicated that bereavement mainly affected loneliness, which in turn activated other depressive symptoms. The direct effects of spousal loss on particular symptoms are inconsistent with the predictions of latent variable models, but can be explained from a network perspective. The findings support a growing body of literature showing that specific adverse life events differentially affect depressive symptomatology, and suggest that future studies should examine interventions that directly target such symptoms. (c) 2015 APA, all rights reserved).

Natural Gas Pipeline Network: Changing and Growing

EIA Publications

1996-01-01

This chapter focuses upon the capabilities of the national natural gas pipeline network, examining how it has expanded during this decade and how it may expand further over the coming years. It also looks at some of the costs of this expansion, including the environmental costs which may be extensive. Changes in the network as a result of recent regional market shifts are also discussed.

The Role of Social Support and Social Networks in Health Information Seeking Behavior among Korean Americans

ERIC Educational Resources Information Center

Kim, Wonsun

2013-01-01

Access to health information appears to be a crucial piece of the racial and ethnic health disparities puzzle among immigrants. There are a growing number of scholars who are investigating the role of social networks that have shown that the number and even types of social networks among minorities and lower income groups differ (Chatman, 1991;…

Community-Based Social Networks: Generation of Power Law Degree Distribution and IP Solutions to the KPP

ERIC Educational Resources Information Center

Wu, Wentao

2012-01-01

The objective of this thesis is two-fold: (1) to investigate the degree distribution property of community-based social networks (CSNs) and (2) to provide solutions to a pertinent problem, the Key Player Problem. In the first part of this thesis, we consider a growing community-based network in which the ability of nodes competing for links to new…

A network architecture for International Business Satellite communications

NASA Astrophysics Data System (ADS)

Takahata, Fumio; Nohara, Mitsuo; Takeuchi, Yoshio

Demand Assignment (DA) control is expected to be introduced in the International Business Satellte communications (IBS) network in order to cope with a growing international business traffic. The paper discusses the DA/IBS network from the viewpoints of network configuration, satellite channel configuration and DA control. The network configuration proposed here consists of one Central Station with network management function and several Network Coordination Stations with user management function. A satellite channel configuration is also presented along with a tradeoff study on transmission bit rate, high power amplifier output power requirement, and service quality. The DA control flow and protocol based on CCITT Signalling System No. 7 are also proposed.

The advanced qualtiy control techniques planned for the Internation Soil Moisture Network

NASA Astrophysics Data System (ADS)

Xaver, A.; Gruber, A.; Hegiova, A.; Sanchis-Dufau, A. D.; Dorigo, W. A.

2012-04-01

In situ soil moisture observations are essential to evaluate and calibrate modeled and remotely sensed soil moisture products. Although a number of meteorological networks and field campaigns measuring soil moisture exist on a global and long-term scale, their observations are not easily accessible and lack standardization of both technique and protocol. Thus, handling and especially comparing these datasets with satellite products or land surface models is a demanding issue. To overcome these limitations the International Soil Moisture Network (ISMN; http://www.ipf.tuwien.ac.at/insitu/) has been initiated to act as a centralized data hosting facility. One advantage of the ISMN is that users are able to access the harmonized datasets easily through a web portal. Another advantage is the fully automated processing chain including the data harmonization in terms of units and sampling interval, but even more important is the advanced quality control system each measurement has to run through. The quality of in situ soil moisture measurements is crucial for the validation of satellite- and model-based soil moisture retrievals; therefore a sophisticated quality control system was developed. After a check for plausibility and geophysical limits a quality flag is added to each measurement. An enhanced flagging mechanism was recently defined using a spectrum based approach to detect spurious spikes, jumps and plateaus. The International Soil Moisture Network has already evolved to one of the most important distribution platforms for in situ soil moisture observations and is still growing. Currently, data from 27 networks in total covering more than 800 stations in Europe, North America, Australia, Asia and Africa is hosted by the ISMN. Available datasets also include historical datasets as well as near real-time measurements. The improved quality control system will provide important information for satellite-based as well as land surface model-based validation studies.

Simulations, Imaging, and Modeling: A Unique Theme for an Undergraduate Research Program in Biomechanics.

PubMed

George, Stephanie M; Domire, Zachary J

2017-07-01

As the reliance on computational models to inform experiments and evaluate medical devices grows, the demand for students with modeling experience will grow. In this paper, we report on the 3-yr experience of a National Science Foundation (NSF) funded Research Experiences for Undergraduates (REU) based on the theme simulations, imaging, and modeling in biomechanics. While directly applicable to REU sites, our findings also apply to those creating other types of summer undergraduate research programs. The objective of the paper is to examine if a theme of simulations, imaging, and modeling will improve students' understanding of the important topic of modeling, provide an overall positive research experience, and provide an interdisciplinary experience. The structure of the program and the evaluation plan are described. We report on the results from 25 students over three summers from 2014 to 2016. Overall, students reported significant gains in the knowledge of modeling, research process, and graduate school based on self-reported mastery levels and open-ended qualitative responses. This theme provides students with a skill set that is adaptable to other applications illustrating the interdisciplinary nature of modeling in biomechanics. Another advantage is that students may also be able to continue working on their project following the summer experience through network connections. In conclusion, we have described the successful implementation of the theme simulation, imaging, and modeling for an REU site and the overall positive response of the student participants.

Multi-Spacecraft Autonomous Positioning System

NASA Technical Reports Server (NTRS)

Anzalone, Evan

2015-01-01

As the number of spacecraft in simultaneous operation continues to grow, there is an increased dependency on ground-based navigation support. The current baseline system for deep space navigation utilizes Earth-based radiometric tracking, requiring long-duration observations to perform orbit determination and generate a state update. The age, complexity, and high utilization of the ground assets pose a risk to spacecraft navigation performance. In order to perform complex operations at large distances from Earth, such as extraterrestrial landing and proximity operations, autonomous systems are required. With increasingly complex mission operations, the need for frequent and Earth-independent navigation capabilities is further reinforced. The Multi-spacecraft Autonomous Positioning System (MAPS) takes advantage of the growing interspacecraft communication network and infrastructure to allow for Earth-autonomous state measurements to enable network-based space navigation. A notional concept of operations is given in figure 1. This network is already being implemented and routinely used in Martian communications through the use of the Mars Reconnaissance Orbiter and Mars Odyssey spacecraft as relays for surface assets. The growth of this communications architecture is continued through MAVEN, and future potential commercial Mars telecom orbiters. This growing network provides an initial Marslocal capability for inter-spacecraft communication and navigation. These navigation updates are enabled by cross-communication between assets in the network, coupled with onboard navigation estimation routines to integrate packet travel time to generate ranging measurements. Inter-spacecraft communication allows for frequent state broadcasts and time updates from trusted references. The architecture is a software-based solution, enabling its implementation on a wide variety of current assets, with the operational constraints and measurement accuracy determined by onboard systems.

Airport Flight Departure Delay Model on Improved BN Structure Learning

NASA Astrophysics Data System (ADS)

Cao, Weidong; Fang, Xiangnong

An high score prior genetic simulated annealing Bayesian network structure learning algorithm (HSPGSA) by combining genetic algorithm(GA) with simulated annealing algorithm(SAA) is developed. The new algorithm provides not only with strong global search capability of GA, but also with strong local hill climb search capability of SAA. The structure with the highest score is prior selected. In the mean time, structures with lower score are also could be choice. It can avoid efficiently prematurity problem by higher score individual wrong direct growing population. Algorithm is applied to flight departure delays analysis in a large hub airport. Based on the flight data a BN model is created. Experiments show that parameters learning can reflect departure delay.

Big data mining powers fungal research: recent advances in fission yeast systems biology approaches.

PubMed

Wang, Zhe

2017-06-01

Biology research has entered into big data era. Systems biology approaches therefore become the powerful tools to obtain the whole landscape of how cell separate, grow, and resist the stresses. Fission yeast Schizosaccharomyces pombe is wonderful unicellular eukaryote model, especially studying its division and metabolism can facilitate to understanding the molecular mechanism of cancer and discovering anticancer agents. In this perspective, we discuss the recent advanced fission yeast systems biology tools, mainly focus on metabolomics profiling and metabolic modeling, protein-protein interactome and genetic interaction network, DNA sequencing and applications, and high-throughput phenotypic screening. We therefore hope this review can be useful for interested fungal researchers as well as bioformaticians.

Structural and Functional Alterations in Neocortical Circuits after Mild Traumatic Brain Injury

NASA Astrophysics Data System (ADS)

Vascak, Michal

National concern over traumatic brain injury (TBI) is growing rapidly. Recent focus is on mild TBI (mTBI), which is the most prevalent injury level in both civilian and military demographics. A preeminent sequelae of mTBI is cognitive network disruption. Advanced neuroimaging of mTBI victims supports this premise, revealing alterations in activation and structure-function of excitatory and inhibitory neuronal systems, which are essential for network processing. However, clinical neuroimaging cannot resolve the cellular and molecular substrates underlying such changes. Therefore, to understand the full scope of mTBI-induced alterations it is necessary to study cortical networks on the microscopic level, where neurons form local networks that are the fundamental computational modules supporting cognition. Recently, in a well-controlled animal model of mTBI, we demonstrated in the excitatory pyramidal neuron system, isolated diffuse axonal injury (DAI), in concert with electrophysiological abnormalities in nearby intact (non-DAI) neurons. These findings were consistent with altered axon initial segment (AIS) intrinsic activity functionally associated with structural plasticity, and/or disturbances in extrinsic systems related to parvalbumin (PV)-expressing interneurons that form GABAergic synapses along the pyramidal neuron perisomatic/AIS domains. The AIS and perisomatic GABAergic synapses are domains critical for regulating neuronal activity and E-I balance. In this dissertation, we focus on the neocortical excitatory pyramidal neuron/inhibitory PV+ interneuron local network following mTBI. Our central hypothesis is that mTBI disrupts neuronal network structure and function causing imbalance of excitatory and inhibitory systems. To address this hypothesis we exploited transgenic and cre/lox mouse models of mTBI, employing approaches that couple state-of-the-art bioimaging with electrophysiology to determine the structuralfunctional alterations of excitatory and inhibitory systems in the neocortex.

Understanding Knowledge Network, Learning and Connectivism

ERIC Educational Resources Information Center

AlDahdouh, Alaa A.; Osório, António J.; Caires, Susana

2015-01-01

Behaviorism, Cognitivism, Constructivism and other growing theories such as Actor-Network and Connectivism are circulating in the educational field. For each, there are allies who stand behind research evidence and consistency of observation. Meantime, those existing theories dominate the field until the background is changed or new concrete…

Simulated juvenile salmon growth and phenology respond to altered thermal regimes and stream network shape

EPA Science Inventory

Context. Thermally diverse habitats may afford fish protection from climate change by providing opportunities to behaviorally optimize growing conditions. However, it is unclear what role the spatial properties of river networks will play in determining risk. Objectives. We hypot...

Dial-in flow cytometry data analysis.

PubMed

Battye, Francis L

2002-02-01

As listmode data files continue to grow larger, access via any kind of network connections becomes more and more trouble because of the enormous traffic generated. The limited speed of transmission via modem makes analysis almost impossible. This unit presents a solution to these problems, one that involves installation at the central storage facility of a small computer program called a Web servlet. Operating in concert with a Web server, the servlet assists the analysis by extracting the display array from the data file and organizing its transmission over the network to a remote client program that creates the data display. The author discusses a recent implementation of this solution and the results for model transmission of two typical data files. The system greatly speeds access to remotely stored data yet retains the flexibility of manipulation expected with local access.

Experimental observations of root growth in a controlled photoelastic granular material

NASA Astrophysics Data System (ADS)

Barés, Jonathan; Mora, Serge; Delenne, Jean-Yves; Fourcaud, Thierry

2017-06-01

We present a novel root observation apparatus capable of measuring the mechanical evolution of both the root network and the surrounding granular medium. The apparatus consists of 11 parallel growth frames, two of them being shearable, where the roots grow inside a photo-elastic or glass granular medium sandwiched between two pieces of glass. An automated system waters the plant and image each frame periodically in white light and between crossed polarisers. This makes it possible to follow (i) the root tips and (ii) the grain displacements as well as (iii) their inner pressure. We show how a root networks evolve in a granular medium and how it can mechanically stabilize it. This constitutes a model experiment to move forward in the understanding of the complex interaction between root growth and surrounding soil mechanical evolution.

Hybrid Percolation Transition in Cluster Merging Processes: Continuously Varying Exponents

NASA Astrophysics Data System (ADS)

Cho, Y. S.; Lee, J. S.; Herrmann, H. J.; Kahng, B.

2016-01-01

Consider growing a network, in which every new connection is made between two disconnected nodes. At least one node is chosen randomly from a subset consisting of g fraction of the entire population in the smallest clusters. Here we show that this simple strategy for improving connection exhibits a more unusual phase transition, namely a hybrid percolation transition exhibiting the properties of both first-order and second-order phase transitions. The cluster size distribution of finite clusters at a transition point exhibits power-law behavior with a continuously varying exponent τ in the range 2 <τ (g )≤2.5 . This pattern reveals a necessary condition for a hybrid transition in cluster aggregation processes, which is comparable to the power-law behavior of the avalanche size distribution arising in models with link-deleting processes in interdependent networks.

Integrated workflows for spiking neuronal network simulations

PubMed Central

Antolík, Ján; Davison, Andrew P.

2013-01-01

The increasing availability of computational resources is enabling more detailed, realistic modeling in computational neuroscience, resulting in a shift toward more heterogeneous models of neuronal circuits, and employment of complex experimental protocols. This poses a challenge for existing tool chains, as the set of tools involved in a typical modeler's workflow is expanding concomitantly, with growing complexity in the metadata flowing between them. For many parts of the workflow, a range of tools is available; however, numerous areas lack dedicated tools, while integration of existing tools is limited. This forces modelers to either handle the workflow manually, leading to errors, or to write substantial amounts of code to automate parts of the workflow, in both cases reducing their productivity. To address these issues, we have developed Mozaik: a workflow system for spiking neuronal network simulations written in Python. Mozaik integrates model, experiment and stimulation specification, simulation execution, data storage, data analysis and visualization into a single automated workflow, ensuring that all relevant metadata are available to all workflow components. It is based on several existing tools, including PyNN, Neo, and Matplotlib. It offers a declarative way to specify models and recording configurations using hierarchically organized configuration files. Mozaik automatically records all data together with all relevant metadata about the experimental context, allowing automation of the analysis and visualization stages. Mozaik has a modular architecture, and the existing modules are designed to be extensible with minimal programming effort. Mozaik increases the productivity of running virtual experiments on highly structured neuronal networks by automating the entire experimental cycle, while increasing the reliability of modeling studies by relieving the user from manual handling of the flow of metadata between the individual workflow stages. PMID:24368902

Integrated workflows for spiking neuronal network simulations.

PubMed

Antolík, Ján; Davison, Andrew P

2013-01-01

The increasing availability of computational resources is enabling more detailed, realistic modeling in computational neuroscience, resulting in a shift toward more heterogeneous models of neuronal circuits, and employment of complex experimental protocols. This poses a challenge for existing tool chains, as the set of tools involved in a typical modeler's workflow is expanding concomitantly, with growing complexity in the metadata flowing between them. For many parts of the workflow, a range of tools is available; however, numerous areas lack dedicated tools, while integration of existing tools is limited. This forces modelers to either handle the workflow manually, leading to errors, or to write substantial amounts of code to automate parts of the workflow, in both cases reducing their productivity. To address these issues, we have developed Mozaik: a workflow system for spiking neuronal network simulations written in Python. Mozaik integrates model, experiment and stimulation specification, simulation execution, data storage, data analysis and visualization into a single automated workflow, ensuring that all relevant metadata are available to all workflow components. It is based on several existing tools, including PyNN, Neo, and Matplotlib. It offers a declarative way to specify models and recording configurations using hierarchically organized configuration files. Mozaik automatically records all data together with all relevant metadata about the experimental context, allowing automation of the analysis and visualization stages. Mozaik has a modular architecture, and the existing modules are designed to be extensible with minimal programming effort. Mozaik increases the productivity of running virtual experiments on highly structured neuronal networks by automating the entire experimental cycle, while increasing the reliability of modeling studies by relieving the user from manual handling of the flow of metadata between the individual workflow stages.

Integrated groundwater data management

USGS Publications Warehouse

Fitch, Peter; Brodaric, Boyan; Stenson, Matt; Booth, Nathaniel; Jakeman, Anthony J.; Barreteau, Olivier; Hunt, Randall J.; Rinaudo, Jean-Daniel; Ross, Andrew

2016-01-01

The goal of a data manager is to ensure that data is safely stored, adequately described, discoverable and easily accessible. However, to keep pace with the evolution of groundwater studies in the last decade, the associated data and data management requirements have changed significantly. In particular, there is a growing recognition that management questions cannot be adequately answered by single discipline studies. This has led a push towards the paradigm of integrated modeling, where diverse parts of the hydrological cycle and its human connections are included. This chapter describes groundwater data management practices, and reviews the current state of the art with enterprise groundwater database management systems. It also includes discussion on commonly used data management models, detailing typical data management lifecycles. We discuss the growing use of web services and open standards such as GWML and WaterML2.0 to exchange groundwater information and knowledge, and the need for national data networks. We also discuss cross-jurisdictional interoperability issues, based on our experience sharing groundwater data across the US/Canadian border. Lastly, we present some future trends relating to groundwater data management.

Anadromous salmonids in the Delta: New science 2006–2016

USGS Publications Warehouse

Perry, Russell W.; Buchanan, Rebecca A.; Brandes, Patricia L.; Burau, Jon R.; Israel, Joshua A

2016-01-01

As juvenile salmon enter the Sacramento–SanJoaquin River Delta (“the Delta”) they disperse among its complex channel network where they are subject to channel-specific processes that affect their rate of migration, vulnerability to predation, feeding success, growth rates, and ultimately, survival. In the decades before 2006, tools available to quantify growth, dispersal, and survival of juvenile salmon in this complex channel network were limited.Fortunately, thanks to technological advances such as acoustic telemetry and chemical and structural otolith analysis, much has been learned over the past decade about the role of the Delta in the life cycle of juvenile salmon. Here, we review new science between 2006and 2016 that sheds light on how different life stages and runs of juvenile salmon grow, move, and survive in the complex channel network of the Delta. One of the most important advances during the past decade has been the widespread adoption of acoustic telemetry techniques. Use of telemetry has shed light on how survival varies among alternative migration routes and the proportion of fish that use each migration route. Chemical and structural analysis of otoliths has provided insights about when juveniles left their natal river and provided evidence of extended rearing in the brackish or saltwater regions of the Delta. New advancements in genetics now allow individuals captured by trawls to be assigned to specific runs. Detailed information about movement and survival in the Delta has spurred development of agent-based models of juvenile salmon that are coupled to hydrodynamic models. Although much has been learned, knowledge gaps remain about how very small juvenile salmon (fry and parr) use the Delta. Understanding how all life stages of juvenile salmon grow, rear, and survive in the Delta is critical for devising management strategies that support a diversity of life history strategies.

An adaptable toolkit to assess commercial fishery costs and benefits related to marine protected area network design.

PubMed

Daigle, Rémi M; Monaco, Cristián J; Elgin, Ashley K

2015-01-01

Around the world, governments are establishing Marine Protected Area (MPA) networks to meet their commitments to the United Nations Convention on Biological Diversity. MPAs are often used in an effort to conserve biodiversity and manage fisheries stocks. However, their efficacy and effect on fisheries yields remain unclear. We conducted a case-study on the economic impact of different MPA network design strategies on the Atlantic cod ( Gadus morhua ) fisheries in Canada. The open-source R package that we developed to analyze this case study can be customized to conduct similar analyses for other systems. We used a spatially-explicit individual-based model of population growth and dispersal coupled with a fisheries management and harvesting component. We found that MPA networks that both protect the target species' habitat and were spatially optimized to improve population connectivity had the highest net present value (i.e., were most profitable for the fishing industry). These higher profits were achieved primarily by reducing the distance travelled for fishing and reducing the probability of a moratorium event. These findings add to a growing body of knowledge demonstrating the importance of incorporating population connectivity in the MPA planning process, as well as the ability of this R package to explore ecological and economic consequences of alternative MPA network designs.

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

Altered Resting State Effective Connectivity of Anterior Insula in Depression.

PubMed

Kandilarova, Sevdalina; Stoyanov, Drozdstoy; Kostianev, Stefan; Specht, Karsten

2018-01-01

Depression has been associated with changes in both functional and effective connectivity of large scale brain networks, including the default mode network, executive network, and salience network. However, studies of effective connectivity by means of spectral dynamic causal modeling (spDCM) are still rare and the interaction between the different resting state networks has not been investigated in detail. Thus, we aimed at exploring differences in effective connectivity among eight right hemisphere brain areas-anterior insula, inferior frontal gyrus, middle frontal gyrus (MFG), frontal eye field, anterior cingulate cortex, superior parietal lobe, amygdala, and hippocampus, between a group of healthy controls ( N  = 20) and medicated depressed patients ( N  = 20). We found that patients not only had significantly reduced strength of the connection from the anterior insula to the MFG (i.e., dorsolateral prefrontal cortex) but also a significant connection between the amygdala and the anterior insula. Moreover, depression severity correlated with connectivity of the hippocampal node. In conclusion, the results from this resting state spDCM study support and enrich previous data on the role of the right anterior insula in the pathophysiology of depression. Furthermore, our findings add to the growing evidence of an association between depression severity and disturbances of the hippocampal function in terms of impaired connectivity with other brain regions.

Altered Resting State Effective Connectivity of Anterior Insula in Depression

PubMed Central

Kandilarova, Sevdalina; Stoyanov, Drozdstoy; Kostianev, Stefan; Specht, Karsten

2018-01-01

Depression has been associated with changes in both functional and effective connectivity of large scale brain networks, including the default mode network, executive network, and salience network. However, studies of effective connectivity by means of spectral dynamic causal modeling (spDCM) are still rare and the interaction between the different resting state networks has not been investigated in detail. Thus, we aimed at exploring differences in effective connectivity among eight right hemisphere brain areas—anterior insula, inferior frontal gyrus, middle frontal gyrus (MFG), frontal eye field, anterior cingulate cortex, superior parietal lobe, amygdala, and hippocampus, between a group of healthy controls (N = 20) and medicated depressed patients (N = 20). We found that patients not only had significantly reduced strength of the connection from the anterior insula to the MFG (i.e., dorsolateral prefrontal cortex) but also a significant connection between the amygdala and the anterior insula. Moreover, depression severity correlated with connectivity of the hippocampal node. In conclusion, the results from this resting state spDCM study support and enrich previous data on the role of the right anterior insula in the pathophysiology of depression. Furthermore, our findings add to the growing evidence of an association between depression severity and disturbances of the hippocampal function in terms of impaired connectivity with other brain regions. PMID:29599728

Network integration modelling of feeder and BRT(bus rapid transit) to reduce the usage of private vehicles in Palembang’s suburban area

NASA Astrophysics Data System (ADS)

Nur'afalia, D.; Afifa, F.; Rubianto, L.; Handayeni, K. D. M. E.

2018-01-01

The aim of this research is to determine the optimal feeder network route that integrates with BRT (Bus Rapid Transit). Palembang, a high growing population city with unresolved transportation demand sector. BRT as main public transportation could not fulfill people’s demand in transportation, especially in Alang-Alang Lebar sub-district. As an impact, the usage of private vehicles increases along the movement toward the city center. The concept of Network Integration that integrates feeder network with BRT is expected to be a solution to suppress the rate of private vehicles’ usage and to improve public transportation service, so that the use of BRT will be increased in the suburban area of Palembang. The method used to identifying the optimal route using Route Analysis method is route analysis using Tranetsim 0.4. The best route is obtained based on 156 movement samples. The result is 58,7% from 199 mobility’s potency of private vehicle usage’s can be reduced if there is a feeder network’s route in Alang-Alang Lebar’s sub-district. From the result, the existance of integration between feeder network and BRT is potential enough to reduce the usage of private vehicles and supports the sustainability of transportation mobility in Palembang City.

Remote Autonomous Sensor Networks: A Study in Redundancy and Life Cycle Costs

NASA Astrophysics Data System (ADS)

Ahlrichs, M.; Dotson, A.; Cenek, M.

2017-12-01

The remote nature of the United States and Canada border and their extreme seasonal shifts has made monitoring much of the area impossible using conventional monitoring techniques. Currently, the United States has large gaps in its ability to detect movement on an as-needed-basis in remote areas. The proposed autonomous sensor network aims to meet that need by developing a product that is low cost, robust, and can be deployed on an as-needed-basis for short term monitoring events. This is accomplished by identifying radio frequency disturbance and acoustic disturbance. This project aims to validate the proposed design and offer optimization strategies by conducting a redundancy model as well as performing a Life Cycle Assessment (LCA). The model will incorporate topological, meteorological, and land cover datasets to estimate sensor loss over a three-month period, ensuring that the remaining network does not have significant gaps in coverage which preclude being able to receive and transmit data. The LCA will investigate the materials used to create the sensor to generate an estimate of the total environmental energy that is utilized to create the network and offer alternative materials and distribution methods that can lower this cost. This platform can function as a stand-alone monitoring network or provide additional spatial and temporal resolution to existing monitoring networks. This study aims to create the framework to determine if a sensor's design and distribution is appropriate for the target environment. The incorporation of a LCA will seek to answer if the data a proposed sensor network will collect outweighs the environmental damage that will result from its deployment. Furthermore, as the arctic continues to thaw and economic development grows, the methodology described in paper will function as a guidance document to ensure that future sensor networks have a minimal impact on these pristine areas.

The challenge of sustaining effectiveness over time: the case of the global network to stop tuberculosis

PubMed Central

Quissell, Kathryn; Walt, Gill

2016-01-01

Where once global health decisions were largely the domain of national governments and the World Health Organization, today networks of international organizations, governments, private philanthropies and other entities are actively shaping public policy. However, there is still limited understanding of how global networks form, how they create institutions, how they promote and sustain collective action, and how they adapt to changes in the policy environment. Understanding these processes is crucial to understanding their effectiveness: whether and how global networks influence policy and public health outcomes. This study seeks to address these gaps through the examination of the global network to stop tuberculosis (TB) and the factors influencing its effectiveness over time. Drawing from ∼200 document sources and 16 interviews with key informants, we trace the development of the Global Partnership to Stop TB and its work over the past decade. We find that having a centralized core group and a strategic brand helped the network to coalesce around a primary intervention strategy, directly observed treatment short course. This strategy was created before the network was formalized, and helped bring in donors, ministries of health and other organizations committed to fighting TB—growing the network. Adaptations to this strategy, the creation of a consensus-based Global Plan, and the creation of a variety of participatory venues for discussion, helped to expand and sustain the network. Presently, however, tensions have become more apparent within the network as it struggles with changing internal political dynamics and the evolution of the disease. While centralization and stability helped to launch and grow the network, the institutionalization of governance and strategy may have constrained adaptation. Institutionalization and centralization may, therefore, facilitate short-term success for networks, but may end up complicating longer-term effectiveness. PMID:26282859

DynaSim: A MATLAB Toolbox for Neural Modeling and Simulation

PubMed Central

Sherfey, Jason S.; Soplata, Austin E.; Ardid, Salva; Roberts, Erik A.; Stanley, David A.; Pittman-Polletta, Benjamin R.; Kopell, Nancy J.

2018-01-01

DynaSim is an open-source MATLAB/GNU Octave toolbox for rapid prototyping of neural models and batch simulation management. It is designed to speed up and simplify the process of generating, sharing, and exploring network models of neurons with one or more compartments. Models can be specified by equations directly (similar to XPP or the Brian simulator) or by lists of predefined or custom model components. The higher-level specification supports arbitrarily complex population models and networks of interconnected populations. DynaSim also includes a large set of features that simplify exploring model dynamics over parameter spaces, running simulations in parallel using both multicore processors and high-performance computer clusters, and analyzing and plotting large numbers of simulated data sets in parallel. It also includes a graphical user interface (DynaSim GUI) that supports full functionality without requiring user programming. The software has been implemented in MATLAB to enable advanced neural modeling using MATLAB, given its popularity and a growing interest in modeling neural systems. The design of DynaSim incorporates a novel schema for model specification to facilitate future interoperability with other specifications (e.g., NeuroML, SBML), simulators (e.g., NEURON, Brian, NEST), and web-based applications (e.g., Geppetto) outside MATLAB. DynaSim is freely available at http://dynasimtoolbox.org. This tool promises to reduce barriers for investigating dynamics in large neural models, facilitate collaborative modeling, and complement other tools being developed in the neuroinformatics community. PMID:29599715

DynaSim: A MATLAB Toolbox for Neural Modeling and Simulation.

PubMed

Sherfey, Jason S; Soplata, Austin E; Ardid, Salva; Roberts, Erik A; Stanley, David A; Pittman-Polletta, Benjamin R; Kopell, Nancy J

2018-01-01

DynaSim is an open-source MATLAB/GNU Octave toolbox for rapid prototyping of neural models and batch simulation management. It is designed to speed up and simplify the process of generating, sharing, and exploring network models of neurons with one or more compartments. Models can be specified by equations directly (similar to XPP or the Brian simulator) or by lists of predefined or custom model components. The higher-level specification supports arbitrarily complex population models and networks of interconnected populations. DynaSim also includes a large set of features that simplify exploring model dynamics over parameter spaces, running simulations in parallel using both multicore processors and high-performance computer clusters, and analyzing and plotting large numbers of simulated data sets in parallel. It also includes a graphical user interface (DynaSim GUI) that supports full functionality without requiring user programming. The software has been implemented in MATLAB to enable advanced neural modeling using MATLAB, given its popularity and a growing interest in modeling neural systems. The design of DynaSim incorporates a novel schema for model specification to facilitate future interoperability with other specifications (e.g., NeuroML, SBML), simulators (e.g., NEURON, Brian, NEST), and web-based applications (e.g., Geppetto) outside MATLAB. DynaSim is freely available at http://dynasimtoolbox.org. This tool promises to reduce barriers for investigating dynamics in large neural models, facilitate collaborative modeling, and complement other tools being developed in the neuroinformatics community.

Human factors for capacity building: lessons learned from the OpenMRS implementers network.

PubMed

Seebregts, C J; Mamlin, B W; Biondich, P G; Fraser, H S F; Wolfe, B A; Jazayeri, D; Miranda, J; Blaya, J; Sinha, C; Bailey, C T; Kanter, A S

2010-01-01

The overall objective of this project was to investigate ways to strengthen the OpenMRS community by (i) developing capacity and implementing a network focusing specifically on the needs of OpenMRS implementers, (ii) strengthening community-driven aspects of OpenMRS and providing a dedicated forum for implementation-specific issues, and; (iii) providing regional support for OpenMRS implementations as well as mentorship and training. The methods used included (i) face-to-face networking using meetings and workshops; (ii) online collaboration tools, peer support and mentorship programmes; (iii) capacity and community development programmes, and; (iv) community outreach programmes. The community-driven approach, combined with a few simple interventions, has been a key factor in the growth and success of the OpenMRS Implementers Network. It has contributed to implementations in at least twenty-three different countries using basic online tools; and provided mentorship and peer support through an annual meeting, workshops and an internship program. The OpenMRS Implementers Network has formed collaborations with several other open source networks and is evolving regional OpenMRS Centres of Excellence to provide localized support for OpenMRS development and implementation. These initiatives are increasing the range of functionality and sustainability of open source software in the health domain, resulting in improved adoption and enterprise-readiness. Social organization and capacity development activities are important in growing a successful community-driven open source software model.

Development of Low Noise-Broadband Raman Amplification Systems Based on Photonic Crystal Fibers for High Capacity DWDM Networks

NASA Astrophysics Data System (ADS)

Elgamri, Abdelghafor

The increased demand from IP traffic, video application and cell backhaul has placed fiber routes under severe stains. The high demands for large bandwidth from enormous numbers from cell sites on a network made the capacity of yesterday's networks not adequate for today's bandwidth demand. Carries considered Dense Wavelength Division Multiplexing (DWDM) network to overcome this issue. Recently, there has been growing interest in fiber Raman amplifiers due to their capability to upgrade the wavelength-division-multiplexing bandwidth, arbitrary gain bandwidth. In addition, photonic crystal fibers have been widely modeled, studied, and fabricated due to their peculiar properties that cannot be achieved with conventional fibers. The focus of this thesis is to develop a low-noise broadband Raman amplification system based on photonic crystal Fiber that can be implemented in high capacity DWDM network successfully. The design a module of photonic crystal fiber Raman amplifier is based on the knowledge of the fiber cross-sectional characteristics i.e. the geometric parameters and the Germania concentration in the dope area. The module allows to study different air-hole dimension and disposition, with or without a central doped area. In addition the design integrates distributed Raman amplifier and nonlinear optical loop mirror to improve the signal to noise ratio and overall gain in large capacity DWDM networks.

Role of Unchannelized Flow in Determining Bifurcation Angle in Distributary Channel Networks

NASA Astrophysics Data System (ADS)

Coffey, T.

2016-02-01

Distributary channel bifurcations on river deltas are important features in both actively prograding river deltas and in lithified deltas within the stratigraphic record. Attributes of distributary channels have long been thought to be defined by flow velocity, grain size and channel aspect ratio where the channel enters the basin. Interestingly, bifurcations in groundwater-fed tributary networks have been shown to grow and bifurcate independent of flow within the exposed channel network. These networks possess a characteristic bifurcation angle of 72°, based on Laplacian flow (water surface concavity equals zero) in the groundwater flow field near tributary channel tips. Based on the tributary channel model, we develop and test the hypothesis that bifurcation angles in distributary channels are likewise dictated by the external flow field, in this case the surface water surrounding the subaqueous portion of distributary channel tips in a deltaic setting. We measured 64 unique distributary bifurcations in an experimental delta, yielding a characteristic angle of 70.2°±2.2° (95% confidence interval), in line with the theoretical prediction for tributary channels. This similarity between bifurcation angles suggests that (A) flow directly outside of the distributary network is Laplacian, (B) the external flow field controls the bifurcation dynamics of distributary channels, and (C) that flow within the channel plays a secondary role in network dynamics.