Tool wear modeling using abductive networks

NASA Astrophysics Data System (ADS)

Masory, Oren

1992-09-01

A tool wear model based on Abductive Networks, which consists of a network of `polynomial' nodes, is described. The model relates the cutting parameters, components of the cutting force, and machining time to flank wear. Thus real time measurements of the cutting force can be used to monitor the machining process. The model is obtained by a training process in which the connectivity between the network's nodes and the polynomial coefficients of each node are determined by optimizing a performance criteria. Actual wear measurements of coated and uncoated carbide inserts were used for training and evaluating the established model.

A last updating evolution model for online social networks

NASA Astrophysics Data System (ADS)

Bu, Zhan; Xia, Zhengyou; Wang, Jiandong; Zhang, Chengcui

2013-05-01

As information technology has advanced, people are turning to electronic media more frequently for communication, and social relationships are increasingly found on online channels. However, there is very limited knowledge about the actual evolution of the online social networks. In this paper, we propose and study a novel evolution network model with the new concept of “last updating time”, which exists in many real-life online social networks. The last updating evolution network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks. What is more, we also found that it has the “small-world effect”, which is the inherent property of most social networks. Simulation experiment based on this model show that the results and the real-life data are consistent, which means that our model is valid.

Neural network modelling of the influence of channelopathies on reflex visual attention.

PubMed

Gravier, Alexandre; Quek, Chai; Duch, Włodzisław; Wahab, Abdul; Gravier-Rymaszewska, Joanna

2016-02-01

This paper introduces a model of Emergent Visual Attention in presence of calcium channelopathy (EVAC). By modelling channelopathy, EVAC constitutes an effort towards identifying the possible causes of autism. The network structure embodies the dual pathways model of cortical processing of visual input, with reflex attention as an emergent property of neural interactions. EVAC extends existing work by introducing attention shift in a larger-scale network and applying a phenomenological model of channelopathy. In presence of a distractor, the channelopathic network's rate of failure to shift attention is lower than the control network's, but overall, the control network exhibits a lower classification error rate. The simulation results also show differences in task-relative reaction times between control and channelopathic networks. The attention shift timings inferred from the model are consistent with studies of attention shift in autistic children.

An artificial network model for estimating the network structure underlying partially observed neuronal signals.

PubMed

Komatsu, Misako; Namikawa, Jun; Chao, Zenas C; Nagasaka, Yasuo; Fujii, Naotaka; Nakamura, Kiyohiko; Tani, Jun

2014-01-01

Many previous studies have proposed methods for quantifying neuronal interactions. However, these methods evaluated the interactions between recorded signals in an isolated network. In this study, we present a novel approach for estimating interactions between observed neuronal signals by theorizing that those signals are observed from only a part of the network that also includes unobserved structures. We propose a variant of the recurrent network model that consists of both observable and unobservable units. The observable units represent recorded neuronal activity, and the unobservable units are introduced to represent activity from unobserved structures in the network. The network structures are characterized by connective weights, i.e., the interaction intensities between individual units, which are estimated from recorded signals. We applied this model to multi-channel brain signals recorded from monkeys, and obtained robust network structures with physiological relevance. Furthermore, the network exhibited common features that portrayed cortical dynamics as inversely correlated interactions between excitatory and inhibitory populations of neurons, which are consistent with the previous view of cortical local circuits. Our results suggest that the novel concept of incorporating an unobserved structure into network estimations has theoretical advantages and could provide insights into brain dynamics beyond what can be directly observed. Copyright © 2014 Elsevier Ireland Ltd and the Japan Neuroscience Society. All rights reserved.

A coevolving model based on preferential triadic closure for social media networks

PubMed Central

Li, Menghui; Zou, Hailin; Guan, Shuguang; Gong, Xiaofeng; Li, Kun; Di, Zengru; Lai, Choy-Heng

2013-01-01

The dynamical origin of complex networks, i.e., the underlying principles governing network evolution, is a crucial issue in network study. In this paper, by carrying out analysis to the temporal data of Flickr and Epinions–two typical social media networks, we found that the dynamical pattern in neighborhood, especially the formation of triadic links, plays a dominant role in the evolution of networks. We thus proposed a coevolving dynamical model for such networks, in which the evolution is only driven by the local dynamics–the preferential triadic closure. Numerical experiments verified that the model can reproduce global properties which are qualitatively consistent with the empirical observations. PMID:23979061

Percolation on bipartite scale-free networks

NASA Astrophysics Data System (ADS)

Hooyberghs, H.; Van Schaeybroeck, B.; Indekeu, J. O.

2010-08-01

Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of unlike type. Such bipartite graphs appear in many social networks, for instance in affiliation networks and in sexual-contact networks in which both types of nodes show the scale-free characteristic for the degree distribution. During the depreciation process, an edge between nodes with degrees k and q is retained with a probability proportional to (, where α is positive so that links between hubs are more prone to failure. The removal process is studied analytically by introducing a generating functions theory. We deduce exact self-consistent equations describing the system at a macroscopic level and discuss the percolation transition. Critical exponents are obtained by exploiting the Fortuin-Kasteleyn construction which provides a link between our model and a limit of the Potts model.

Numerical Modeling of Saturated Boiling in a Heated Tube

NASA Technical Reports Server (NTRS)

Majumdar, Alok; LeClair, Andre; Hartwig, Jason

2017-01-01

This paper describes a mathematical formulation and numerical solution of boiling in a heated tube. The mathematical formulation involves a discretization of the tube into a flow network consisting of fluid nodes and branches and a thermal network consisting of solid nodes and conductors. In the fluid network, the mass, momentum and energy conservation equations are solved and in the thermal network, the energy conservation equation of solids is solved. A pressure-based, finite-volume formulation has been used to solve the equations in the fluid network. The system of equations is solved by a hybrid numerical scheme which solves the mass and momentum conservation equations by a simultaneous Newton-Raphson method and the energy conservation equation by a successive substitution method. The fluid network and thermal network are coupled through heat transfer between the solid and fluid nodes which is computed by Chen's correlation of saturated boiling heat transfer. The computer model is developed using the Generalized Fluid System Simulation Program and the numerical predictions are compared with test data.

Modeling fluctuations in default-mode brain network using a spiking neural network.

PubMed

Yamanishi, Teruya; Liu, Jian-Qin; Nishimura, Haruhiko

2012-08-01

Recently, numerous attempts have been made to understand the dynamic behavior of complex brain systems using neural network models. The fluctuations in blood-oxygen-level-dependent (BOLD) brain signals at less than 0.1 Hz have been observed by functional magnetic resonance imaging (fMRI) for subjects in a resting state. This phenomenon is referred to as a "default-mode brain network." In this study, we model the default-mode brain network by functionally connecting neural communities composed of spiking neurons in a complex network. Through computational simulations of the model, including transmission delays and complex connectivity, the network dynamics of the neural system and its behavior are discussed. The results show that the power spectrum of the modeled fluctuations in the neuron firing patterns is consistent with the default-mode brain network's BOLD signals when transmission delays, a characteristic property of the brain, have finite values in a given range.

Decoding of finger trajectory from ECoG using deep learning.

PubMed

Xie, Ziqian; Schwartz, Odelia; Prasad, Abhishek

2018-06-01

Conventional decoding pipeline for brain-machine interfaces (BMIs) consists of chained different stages of feature extraction, time-frequency analysis and statistical learning models. Each of these stages uses a different algorithm trained in a sequential manner, which makes it difficult to make the whole system adaptive. The goal was to create an adaptive online system with a single objective function and a single learning algorithm so that the whole system can be trained in parallel to increase the decoding performance. Here, we used deep neural networks consisting of convolutional neural networks (CNN) and a special kind of recurrent neural network (RNN) called long short term memory (LSTM) to address these needs. We used electrocorticography (ECoG) data collected by Kubanek et al. The task consisted of individual finger flexions upon a visual cue. Our model combined a hierarchical feature extractor CNN and a RNN that was able to process sequential data and recognize temporal dynamics in the neural data. CNN was used as the feature extractor and LSTM was used as the regression algorithm to capture the temporal dynamics of the signal. We predicted the finger trajectory using ECoG signals and compared results for the least angle regression (LARS), CNN-LSTM, random forest, LSTM model (LSTM_HC, for using hard-coded features) and a decoding pipeline consisting of band-pass filtering, energy extraction, feature selection and linear regression. The results showed that the deep learning models performed better than the commonly used linear model. The deep learning models not only gave smoother and more realistic trajectories but also learned the transition between movement and rest state. This study demonstrated a decoding network for BMI that involved a convolutional and recurrent neural network model. It integrated the feature extraction pipeline into the convolution and pooling layer and used LSTM layer to capture the state transitions. The discussed network eliminated the need to separately train the model at each step in the decoding pipeline. The whole system can be jointly optimized using stochastic gradient descent and is capable of online learning.

Decoding of finger trajectory from ECoG using deep learning

NASA Astrophysics Data System (ADS)

Xie, Ziqian; Schwartz, Odelia; Prasad, Abhishek

2018-06-01

Objective. Conventional decoding pipeline for brain-machine interfaces (BMIs) consists of chained different stages of feature extraction, time-frequency analysis and statistical learning models. Each of these stages uses a different algorithm trained in a sequential manner, which makes it difficult to make the whole system adaptive. The goal was to create an adaptive online system with a single objective function and a single learning algorithm so that the whole system can be trained in parallel to increase the decoding performance. Here, we used deep neural networks consisting of convolutional neural networks (CNN) and a special kind of recurrent neural network (RNN) called long short term memory (LSTM) to address these needs. Approach. We used electrocorticography (ECoG) data collected by Kubanek et al. The task consisted of individual finger flexions upon a visual cue. Our model combined a hierarchical feature extractor CNN and a RNN that was able to process sequential data and recognize temporal dynamics in the neural data. CNN was used as the feature extractor and LSTM was used as the regression algorithm to capture the temporal dynamics of the signal. Main results. We predicted the finger trajectory using ECoG signals and compared results for the least angle regression (LARS), CNN-LSTM, random forest, LSTM model (LSTM_HC, for using hard-coded features) and a decoding pipeline consisting of band-pass filtering, energy extraction, feature selection and linear regression. The results showed that the deep learning models performed better than the commonly used linear model. The deep learning models not only gave smoother and more realistic trajectories but also learned the transition between movement and rest state. Significance. This study demonstrated a decoding network for BMI that involved a convolutional and recurrent neural network model. It integrated the feature extraction pipeline into the convolution and pooling layer and used LSTM layer to capture the state transitions. The discussed network eliminated the need to separately train the model at each step in the decoding pipeline. The whole system can be jointly optimized using stochastic gradient descent and is capable of online learning.

Pattern classification and recognition of invertebrate functional groups using self-organizing neural networks.

PubMed

Zhang, WenJun

2007-07-01

Self-organizing neural networks can be used to mimic non-linear systems. The main objective of this study is to make pattern classification and recognition on sampling information using two self-organizing neural network models. Invertebrate functional groups sampled in the irrigated rice field were classified and recognized using one-dimensional self-organizing map and self-organizing competitive learning neural networks. Comparisons between neural network models, distance (similarity) measures, and number of neurons were conducted. The results showed that self-organizing map and self-organizing competitive learning neural network models were effective in pattern classification and recognition of sampling information. Overall the performance of one-dimensional self-organizing map neural network was better than self-organizing competitive learning neural network. The number of neurons could determine the number of classes in the classification. Different neural network models with various distance (similarity) measures yielded similar classifications. Some differences, dependent upon the specific network structure, would be found. The pattern of an unrecognized functional group was recognized with the self-organizing neural network. A relative consistent classification indicated that the following invertebrate functional groups, terrestrial blood sucker; terrestrial flyer; tourist (nonpredatory species with no known functional role other than as prey in ecosystem); gall former; collector (gather, deposit feeder); predator and parasitoid; leaf miner; idiobiont (acarine ectoparasitoid), were classified into the same group, and the following invertebrate functional groups, external plant feeder; terrestrial crawler, walker, jumper or hunter; neustonic (water surface) swimmer (semi-aquatic), were classified into another group. It was concluded that reliable conclusions could be drawn from comparisons of different neural network models that use different distance (similarity) measures. Results with the larger consistency will be more reliable.

How Structure Shapes Dynamics: Knowledge Development in Wikipedia - A Network Multilevel Modeling Approach

PubMed Central

Halatchliyski, Iassen; Cress, Ulrike

2014-01-01

Using a longitudinal network analysis approach, we investigate the structural development of the knowledge base of Wikipedia in order to explain the appearance of new knowledge. The data consists of the articles in two adjacent knowledge domains: psychology and education. We analyze the development of networks of knowledge consisting of interlinked articles at seven snapshots from 2006 to 2012 with an interval of one year between them. Longitudinal data on the topological position of each article in the networks is used to model the appearance of new knowledge over time. Thus, the structural dimension of knowledge is related to its dynamics. Using multilevel modeling as well as eigenvector and betweenness measures, we explain the significance of pivotal articles that are either central within one of the knowledge domains or boundary-crossing between the two domains at a given point in time for the future development of new knowledge in the knowledge base. PMID:25365319

Precise Network Modeling of Systems Genetics Data Using the Bayesian Network Webserver.

PubMed

Ziebarth, Jesse D; Cui, Yan

2017-01-01

The Bayesian Network Webserver (BNW, http://compbio.uthsc.edu/BNW ) is an integrated platform for Bayesian network modeling of biological datasets. It provides a web-based network modeling environment that seamlessly integrates advanced algorithms for probabilistic causal modeling and reasoning with Bayesian networks. BNW is designed for precise modeling of relatively small networks that contain less than 20 nodes. The structure learning algorithms used by BNW guarantee the discovery of the best (most probable) network structure given the data. To facilitate network modeling across multiple biological levels, BNW provides a very flexible interface that allows users to assign network nodes into different tiers and define the relationships between and within the tiers. This function is particularly useful for modeling systems genetics datasets that often consist of multiscalar heterogeneous genotype-to-phenotype data. BNW enables users to, within seconds or minutes, go from having a simply formatted input file containing a dataset to using a network model to make predictions about the interactions between variables and the potential effects of experimental interventions. In this chapter, we will introduce the functions of BNW and show how to model systems genetics datasets with BNW.

Self-consistent core-pedestal transport simulations with neural network accelerated models

DOE PAGES

Meneghini, Orso; Smith, Sterling P.; Snyder, Philip B.; ...

2017-07-12

Fusion whole device modeling simulations require comprehensive models that are simultaneously physically accurate, fast, robust, and predictive. In this paper we describe the development of two neural-network (NN) based models as a means to perform a snon-linear multivariate regression of theory-based models for the core turbulent transport fluxes, and the pedestal structure. Specifically, we find that a NN-based approach can be used to consistently reproduce the results of the TGLF and EPED1 theory-based models over a broad range of plasma regimes, and with a computational speedup of several orders of magnitudes. These models are then integrated into a predictive workflowmore » that allows prediction with self-consistent core-pedestal coupling of the kinetic profiles within the last closed flux surface of the plasma. Finally, the NN paradigm is capable of breaking the speed-accuracy trade-off that is expected of traditional numerical physics models, and can provide the missing link towards self-consistent coupled core-pedestal whole device modeling simulations that are physically accurate and yet take only seconds to run.« less

Self-consistent core-pedestal transport simulations with neural network accelerated models

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

Meneghini, Orso; Smith, Sterling P.; Snyder, Philip B.

Fusion whole device modeling simulations require comprehensive models that are simultaneously physically accurate, fast, robust, and predictive. In this paper we describe the development of two neural-network (NN) based models as a means to perform a snon-linear multivariate regression of theory-based models for the core turbulent transport fluxes, and the pedestal structure. Specifically, we find that a NN-based approach can be used to consistently reproduce the results of the TGLF and EPED1 theory-based models over a broad range of plasma regimes, and with a computational speedup of several orders of magnitudes. These models are then integrated into a predictive workflowmore » that allows prediction with self-consistent core-pedestal coupling of the kinetic profiles within the last closed flux surface of the plasma. Finally, the NN paradigm is capable of breaking the speed-accuracy trade-off that is expected of traditional numerical physics models, and can provide the missing link towards self-consistent coupled core-pedestal whole device modeling simulations that are physically accurate and yet take only seconds to run.« less

Self-consistent core-pedestal transport simulations with neural network accelerated models

NASA Astrophysics Data System (ADS)

Meneghini, O.; Smith, S. P.; Snyder, P. B.; Staebler, G. M.; Candy, J.; Belli, E.; Lao, L.; Kostuk, M.; Luce, T.; Luda, T.; Park, J. M.; Poli, F.

2017-08-01

Fusion whole device modeling simulations require comprehensive models that are simultaneously physically accurate, fast, robust, and predictive. In this paper we describe the development of two neural-network (NN) based models as a means to perform a snon-linear multivariate regression of theory-based models for the core turbulent transport fluxes, and the pedestal structure. Specifically, we find that a NN-based approach can be used to consistently reproduce the results of the TGLF and EPED1 theory-based models over a broad range of plasma regimes, and with a computational speedup of several orders of magnitudes. These models are then integrated into a predictive workflow that allows prediction with self-consistent core-pedestal coupling of the kinetic profiles within the last closed flux surface of the plasma. The NN paradigm is capable of breaking the speed-accuracy trade-off that is expected of traditional numerical physics models, and can provide the missing link towards self-consistent coupled core-pedestal whole device modeling simulations that are physically accurate and yet take only seconds to run.

Modeling Music Emotion Judgments Using Machine Learning Methods

PubMed Central

Vempala, Naresh N.; Russo, Frank A.

2018-01-01

Emotion judgments and five channels of physiological data were obtained from 60 participants listening to 60 music excerpts. Various machine learning (ML) methods were used to model the emotion judgments inclusive of neural networks, linear regression, and random forests. Input for models of perceived emotion consisted of audio features extracted from the music recordings. Input for models of felt emotion consisted of physiological features extracted from the physiological recordings. Models were trained and interpreted with consideration of the classic debate in music emotion between cognitivists and emotivists. Our models supported a hybrid position wherein emotion judgments were influenced by a combination of perceived and felt emotions. In comparing the different ML approaches that were used for modeling, we conclude that neural networks were optimal, yielding models that were flexible as well as interpretable. Inspection of a committee machine, encompassing an ensemble of networks, revealed that arousal judgments were predominantly influenced by felt emotion, whereas valence judgments were predominantly influenced by perceived emotion. PMID:29354080

Modeling Music Emotion Judgments Using Machine Learning Methods.

PubMed

Vempala, Naresh N; Russo, Frank A

2017-01-01

Emotion judgments and five channels of physiological data were obtained from 60 participants listening to 60 music excerpts. Various machine learning (ML) methods were used to model the emotion judgments inclusive of neural networks, linear regression, and random forests. Input for models of perceived emotion consisted of audio features extracted from the music recordings. Input for models of felt emotion consisted of physiological features extracted from the physiological recordings. Models were trained and interpreted with consideration of the classic debate in music emotion between cognitivists and emotivists. Our models supported a hybrid position wherein emotion judgments were influenced by a combination of perceived and felt emotions. In comparing the different ML approaches that were used for modeling, we conclude that neural networks were optimal, yielding models that were flexible as well as interpretable. Inspection of a committee machine, encompassing an ensemble of networks, revealed that arousal judgments were predominantly influenced by felt emotion, whereas valence judgments were predominantly influenced by perceived emotion.

Multiscale approach for the construction of equilibrated all-atom models of a poly(ethylene glycol)-based hydrogel

PubMed Central

Li, Xianfeng; Murthy, N. Sanjeeva; Becker, Matthew L.; Latour, Robert A.

2016-01-01

A multiscale modeling approach is presented for the efficient construction of an equilibrated all-atom model of a cross-linked poly(ethylene glycol) (PEG)-based hydrogel using the all-atom polymer consistent force field (PCFF). The final equilibrated all-atom model was built with a systematic simulation toolset consisting of three consecutive parts: (1) building a global cross-linked PEG-chain network at experimentally determined cross-link density using an on-lattice Monte Carlo method based on the bond fluctuation model, (2) recovering the local molecular structure of the network by transitioning from the lattice model to an off-lattice coarse-grained (CG) model parameterized from PCFF, followed by equilibration using high performance molecular dynamics methods, and (3) recovering the atomistic structure of the network by reverse mapping from the equilibrated CG structure, hydrating the structure with explicitly represented water, followed by final equilibration using PCFF parameterization. The developed three-stage modeling approach has application to a wide range of other complex macromolecular hydrogel systems, including the integration of peptide, protein, and/or drug molecules as side-chains within the hydrogel network for the incorporation of bioactivity for tissue engineering, regenerative medicine, and drug delivery applications. PMID:27013229

Scale-free models for the structure of business firm networks.

PubMed

Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H Eugene

2010-03-01

We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a "nucleus," which is a small well-connected subgraph, "tendrils," which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a "bulk body," which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution lambda increases, and disappear for lambda>or=3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

Capacity of Heterogeneous Mobile Wireless Networks with D-Delay Transmission Strategy.

PubMed

Wu, Feng; Zhu, Jiang; Xi, Zhipeng; Gao, Kai

2016-03-25

This paper investigates the capacity problem of heterogeneous wireless networks in mobility scenarios. A heterogeneous network model which consists of n normal nodes and m helping nodes is proposed. Moreover, we propose a D-delay transmission strategy to ensure that every packet can be delivered to its destination nodes with limited delay. Different from most existing network schemes, our network model has a novel two-tier architecture. The existence of helping nodes greatly improves the network capacity. Four types of mobile networks are studied in this paper: i.i.d. fast mobility model and slow mobility model in two-dimensional space, i.i.d. fast mobility model and slow mobility model in three-dimensional space. Using the virtual channel model, we present an intuitive analysis of the capacity of two-dimensional mobile networks and three-dimensional mobile networks, respectively. Given a delay constraint D, we derive the asymptotic expressions for the capacity of the four types of mobile networks. Furthermore, the impact of D and m to the capacity of the whole network is analyzed. Our findings provide great guidance for the future design of the next generation of networks.

Consistent initial conditions for the Saint-Venant equations in river network modeling

NASA Astrophysics Data System (ADS)

Yu, Cheng-Wei; Liu, Frank; Hodges, Ben R.

2017-09-01

Initial conditions for flows and depths (cross-sectional areas) throughout a river network are required for any time-marching (unsteady) solution of the one-dimensional (1-D) hydrodynamic Saint-Venant equations. For a river network modeled with several Strahler orders of tributaries, comprehensive and consistent synoptic data are typically lacking and synthetic starting conditions are needed. Because of underlying nonlinearity, poorly defined or inconsistent initial conditions can lead to convergence problems and long spin-up times in an unsteady solver. Two new approaches are defined and demonstrated herein for computing flows and cross-sectional areas (or depths). These methods can produce an initial condition data set that is consistent with modeled landscape runoff and river geometry boundary conditions at the initial time. These new methods are (1) the pseudo time-marching method (PTM) that iterates toward a steady-state initial condition using an unsteady Saint-Venant solver and (2) the steady-solution method (SSM) that makes use of graph theory for initial flow rates and solution of a steady-state 1-D momentum equation for the channel cross-sectional areas. The PTM is shown to be adequate for short river reaches but is significantly slower and has occasional non-convergent behavior for large river networks. The SSM approach is shown to provide a rapid solution of consistent initial conditions for both small and large networks, albeit with the requirement that additional code must be written rather than applying an existing unsteady Saint-Venant solver.

Modularity Induced Gating and Delays in Neuronal Networks

PubMed Central

Shein-Idelson, Mark; Cohen, Gilad; Hanein, Yael

2016-01-01

Neural networks, despite their highly interconnected nature, exhibit distinctly localized and gated activation. Modularity, a distinctive feature of neural networks, has been recently proposed as an important parameter determining the manner by which networks support activity propagation. Here we use an engineered biological model, consisting of engineered rat cortical neurons, to study the role of modular topology in gating the activity between cell populations. We show that pairs of connected modules support conditional propagation (transmitting stronger bursts with higher probability), long delays and propagation asymmetry. Moreover, large modular networks manifest diverse patterns of both local and global activation. Blocking inhibition decreased activity diversity and replaced it with highly consistent transmission patterns. By independently controlling modularity and disinhibition, experimentally and in a model, we pose that modular topology is an important parameter affecting activation localization and is instrumental for population-level gating by disinhibition. PMID:27104350

T-cell movement on the reticular network.

PubMed

Donovan, Graham M; Lythe, Grant

2012-02-21

The idea that the apparently random motion of T cells in lymph nodes is a result of movement on a reticular network (RN) has received support from dynamic imaging experiments and theoretical studies. We present a mathematical representation of the RN consisting of edges connecting vertices that are randomly distributed in three-dimensional space, and models of lymphocyte movement on such networks including constant speed motion along edges and Brownian motion, not in three-dimensions, but only along edges. The simplest model, in which a cell moves with a constant speed along edges, is consistent with mean-squared displacement proportional to time over intervals long enough to include several changes of direction. A non-random distribution of turning angles is one consequence of motion on a preformed network. Confining cell movement to a network does not, in itself, increase the frequency of cell-cell encounters. Copyright © 2011 Elsevier Ltd. All rights reserved.

Network model of chemical-sensing system inspired by mouse taste buds.

PubMed

Tateno, Katsumi; Igarashi, Jun; Ohtubo, Yoshitaka; Nakada, Kazuki; Miki, Tsutomu; Yoshii, Kiyonori

2011-07-01

Taste buds endure extreme changes in temperature, pH, osmolarity, so on. Even though taste bud cells are replaced in a short span, they contribute to consistent taste reception. Each taste bud consists of about 50 cells whose networks are assumed to process taste information, at least preliminarily. In this article, we describe a neural network model inspired by the taste bud cells of mice. It consists of two layers. In the first layer, the chemical stimulus is transduced into an irregular spike train. The synchronization of the output impulses is induced by the irregular spike train at the second layer. These results show that the intensity of the chemical stimulus is encoded as the degree of the synchronization of output impulses. The present algorithms for signal processing result in a robust chemical-sensing system.

Communications network design and costing model technical manual

NASA Technical Reports Server (NTRS)

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

1983-01-01

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

The Energy Coding of a Structural Neural Network Based on the Hodgkin-Huxley Model.

PubMed

Zhu, Zhenyu; Wang, Rubin; Zhu, Fengyun

2018-01-01

Based on the Hodgkin-Huxley model, the present study established a fully connected structural neural network to simulate the neural activity and energy consumption of the network by neural energy coding theory. The numerical simulation result showed that the periodicity of the network energy distribution was positively correlated to the number of neurons and coupling strength, but negatively correlated to signal transmitting delay. Moreover, a relationship was established between the energy distribution feature and the synchronous oscillation of the neural network, which showed that when the proportion of negative energy in power consumption curve was high, the synchronous oscillation of the neural network was apparent. In addition, comparison with the simulation result of structural neural network based on the Wang-Zhang biophysical model of neurons showed that both models were essentially consistent.

High Assurance Models for Secure Systems

ERIC Educational Resources Information Center

Almohri, Hussain M. J.

2013-01-01

Despite the recent advances in systems and network security, attacks on large enterprise networks consistently impose serious challenges to maintaining data privacy and software service integrity. We identify two main problems that contribute to increasing the security risk in a networked environment: (i) vulnerable servers, workstations, and…

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

Requirements for data integration platforms in biomedical research networks: a reference model.

PubMed

Ganzinger, Matthias; Knaup, Petra

2015-01-01

Biomedical research networks need to integrate research data among their members and with external partners. To support such data sharing activities, an adequate information technology infrastructure is necessary. To facilitate the establishment of such an infrastructure, we developed a reference model for the requirements. The reference model consists of five reference goals and 15 reference requirements. Using the Unified Modeling Language, the goals and requirements are set into relation to each other. In addition, all goals and requirements are described textually in tables. This reference model can be used by research networks as a basis for a resource efficient acquisition of their project specific requirements. Furthermore, a concrete instance of the reference model is described for a research network on liver cancer. The reference model is transferred into a requirements model of the specific network. Based on this concrete requirements model, a service-oriented information technology architecture is derived and also described in this paper.

Interactions of the Salience Network and Its Subsystems with the Default-Mode and the Central-Executive Networks in Normal Aging and Mild Cognitive Impairment.

PubMed

Chand, Ganesh B; Wu, Junjie; Hajjar, Ihab; Qiu, Deqiang

2017-09-01

Previous functional magnetic resonance imaging (fMRI) investigations suggest that the intrinsically organized large-scale networks and the interaction between them might be crucial for cognitive activities. A triple network model, which consists of the default-mode network, salience network, and central-executive network, has been recently used to understand the connectivity patterns of the cognitively normal brains versus the brains with disorders. This model suggests that the salience network dynamically controls the default-mode and central-executive networks in healthy young individuals. However, the patterns of interactions have remained largely unknown in healthy aging or those with cognitive decline. In this study, we assess the patterns of interactions between the three networks using dynamical causal modeling in resting state fMRI data and compare them between subjects with normal cognition and mild cognitive impairment (MCI). In healthy elderly subjects, our analysis showed that the salience network, especially its dorsal subnetwork, modulates the interaction between the default-mode network and the central-executive network (Mann-Whitney U test; p < 0.05), which was consistent with the pattern of interaction reported in young adults. In contrast, this pattern of modulation by salience network was disrupted in MCI (p < 0.05). Furthermore, the degree of disruption in salience network control correlated significantly with lower overall cognitive performance measured by Montreal Cognitive Assessment (r = 0.295; p < 0.05). This study suggests that a disruption of the salience network control, especially the dorsal salience network, over other networks provides a neuronal basis for cognitive decline and may be a candidate neuroimaging biomarker of cognitive impairment.

Spin-glass phase in a neutral network with asymmetric couplings

NASA Astrophysics Data System (ADS)

Kree, R.; Widmaier, D.; Zippelius, A.

1988-12-01

The author studies the phase diagram of a neural network model which has learnt with the ADALINE algorithm, starting from tabula non rasa conditions. The resulting synaptic efficacies are not symmetric under an exchange of the pre- and post-synaptic neuron. In contrast to several other models which have been discussed in the literature, he finds a spin-glass phase in the asymmetrically coupled network. The main difference compared with the other models consists of long-ranged Gaussian correlations in the ensemble of couplings.

A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

PubMed Central

Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry

2015-01-01

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701

Using RDF to Model the Structure and Process of Systems

NASA Astrophysics Data System (ADS)

Rodriguez, Marko A.; Watkins, Jennifer H.; Bollen, Johan; Gershenson, Carlos

Many systems can be described in terms of networks of discrete elements and their various relationships to one another. A semantic network, or multi-relational network, is a directed labeled graph consisting of a heterogeneous set of entities connected by a heterogeneous set of relationships. Semantic networks serve as a promising general-purpose modeling substrate for complex systems. Various standardized formats and tools are now available to support practical, large-scale semantic network models. First, the Resource Description Framework (RDF) offers a standardized semantic network data model that can be further formalized by ontology modeling languages such as RDF Schema (RDFS) and the Web Ontology Language (OWL). Second, the recent introduction of highly performant triple-stores (i.e. semantic network databases) allows semantic network models on the order of 109 edges to be efficiently stored and manipulated. RDF and its related technologies are currently used extensively in the domains of computer science, digital library science, and the biological sciences. This article will provide an introduction to RDF/RDFS/OWL and an examination of its suitability to model discrete element complex systems.

Egocentric Network and Condom Use Among Mid-Age Female Sex Workers in China: A Multilevel Modeling Analysis.

PubMed

Liu, Hongjie

2016-04-01

The epidemics of sexually transmitted infections (STIs) have spread among older adults in the world, including China. This study addresses the deficiency of studies about the multiple contextual influences on condom use among mid-age female sex workers (FSWs) over 35 years old. A combination of an egocentric network design and multilevel modeling was used to investigate factors of condom use over mid-age FSWs (egos) particular relationships with sexual partners (alters). Of the 1245 mid-age FSWs interviewed, 73% (907) reported having at least one sexual partner who would provide social support to egos. This generated a total of 1300 ego-alter sex ties in egos' support networks. Condoms were consistently used among one-third of sex ties. At the ego level, condoms were more likely to be used consistently if egos received a middle school education or above, had stronger perceived behavioral control for condom use, or consistently used condoms with other sex clients who were not in their support networks. At the alter level, condoms were not consistently used over spousal ties compared to other ties. Condoms were less likely to be used among alters whom ego trusted and provided emotional support. Cross-level factors (egos' attitudes toward condom use and emotional support from alters) documented a significant positive interaction on consistent condom use. Given the low frequency of condom use, future interventions should focus on mid-age FSWs and their partners within and beyond their support networks.

Egocentric Network and Condom Use Among Mid-Age Female Sex Workers in China: A Multilevel Modeling Analysis

PubMed Central

2016-01-01

Abstract The epidemics of sexually transmitted infections (STIs) have spread among older adults in the world, including China. This study addresses the deficiency of studies about the multiple contextual influences on condom use among mid-age female sex workers (FSWs) over 35 years old. A combination of an egocentric network design and multilevel modeling was used to investigate factors of condom use over mid-age FSWs (egos) particular relationships with sexual partners (alters). Of the 1245 mid-age FSWs interviewed, 73% (907) reported having at least one sexual partner who would provide social support to egos. This generated a total of 1300 ego–alter sex ties in egos' support networks. Condoms were consistently used among one-third of sex ties. At the ego level, condoms were more likely to be used consistently if egos received a middle school education or above, had stronger perceived behavioral control for condom use, or consistently used condoms with other sex clients who were not in their support networks. At the alter level, condoms were not consistently used over spousal ties compared to other ties. Condoms were less likely to be used among alters whom ego trusted and provided emotional support. Cross-level factors (egos' attitudes toward condom use and emotional support from alters) documented a significant positive interaction on consistent condom use. Given the low frequency of condom use, future interventions should focus on mid-age FSWs and their partners within and beyond their support networks. PMID:27028182

DeepQA: improving the estimation of single protein model quality with deep belief networks.

PubMed

Cao, Renzhi; Bhattacharya, Debswapna; Hou, Jie; Cheng, Jianlin

2016-12-05

Protein quality assessment (QA) useful for ranking and selecting protein models has long been viewed as one of the major challenges for protein tertiary structure prediction. Especially, estimating the quality of a single protein model, which is important for selecting a few good models out of a large model pool consisting of mostly low-quality models, is still a largely unsolved problem. We introduce a novel single-model quality assessment method DeepQA based on deep belief network that utilizes a number of selected features describing the quality of a model from different perspectives, such as energy, physio-chemical characteristics, and structural information. The deep belief network is trained on several large datasets consisting of models from the Critical Assessment of Protein Structure Prediction (CASP) experiments, several publicly available datasets, and models generated by our in-house ab initio method. Our experiments demonstrate that deep belief network has better performance compared to Support Vector Machines and Neural Networks on the protein model quality assessment problem, and our method DeepQA achieves the state-of-the-art performance on CASP11 dataset. It also outperformed two well-established methods in selecting good outlier models from a large set of models of mostly low quality generated by ab initio modeling methods. DeepQA is a useful deep learning tool for protein single model quality assessment and protein structure prediction. The source code, executable, document and training/test datasets of DeepQA for Linux is freely available to non-commercial users at http://cactus.rnet.missouri.edu/DeepQA/ .

Toward a formalized account of attitudes: The Causal Attitude Network (CAN) model.

PubMed

Dalege, Jonas; Borsboom, Denny; van Harreveld, Frenk; van den Berg, Helma; Conner, Mark; van der Maas, Han L J

2016-01-01

This article introduces the Causal Attitude Network (CAN) model, which conceptualizes attitudes as networks consisting of evaluative reactions and interactions between these reactions. Relevant evaluative reactions include beliefs, feelings, and behaviors toward the attitude object. Interactions between these reactions arise through direct causal influences (e.g., the belief that snakes are dangerous causes fear of snakes) and mechanisms that support evaluative consistency between related contents of evaluative reactions (e.g., people tend to align their belief that snakes are useful with their belief that snakes help maintain ecological balance). In the CAN model, the structure of attitude networks conforms to a small-world structure: evaluative reactions that are similar to each other form tight clusters, which are connected by a sparser set of "shortcuts" between them. We argue that the CAN model provides a realistic formalized measurement model of attitudes and therefore fills a crucial gap in the attitude literature. Furthermore, the CAN model provides testable predictions for the structure of attitudes and how they develop, remain stable, and change over time. Attitude strength is conceptualized in terms of the connectivity of attitude networks and we show that this provides a parsimonious account of the differences between strong and weak attitudes. We discuss the CAN model in relation to possible extensions, implication for the assessment of attitudes, and possibilities for further study. (c) 2015 APA, all rights reserved).

Scale-free models for the structure of business firm networks

NASA Astrophysics Data System (ADS)

Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H. Eugene

2010-03-01

We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a “nucleus,” which is a small well-connected subgraph, “tendrils,” which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a “bulk body,” which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution λ increases, and disappear for λ≥3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

Toward link predictability of complex networks

PubMed Central

Lü, Linyuan; Pan, Liming; Zhou, Tao; Zhang, Yi-Cheng; Stanley, H. Eugene

2015-01-01

The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate real-world networks demonstrate that (i) structural consistency is a good estimation of link predictability and (ii) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners. PMID:25659742

Analysis and Reduction of Complex Networks Under Uncertainty.

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

Ghanem, Roger G

2014-07-31

This effort was a collaboration with Youssef Marzouk of MIT, Omar Knio of Duke University (at the time at Johns Hopkins University) and Habib Najm of Sandia National Laboratories. The objective of this effort was to develop the mathematical and algorithmic capacity to analyze complex networks under uncertainty. Of interest were chemical reaction networks and smart grid networks. The statements of work for USC focused on the development of stochastic reduced models for uncertain networks. The USC team was led by Professor Roger Ghanem and consisted of one graduate student and a postdoc. The contributions completed by the USC teammore » consisted of 1) methodology and algorithms to address the eigenvalue problem, a problem of significance in the stability of networks under stochastic perturbations, 2) methodology and algorithms to characterize probability measures on graph structures with random flows. This is an important problem in characterizing random demand (encountered in smart grid) and random degradation (encountered in infrastructure systems), as well as modeling errors in Markov Chains (with ubiquitous relevance !). 3) methodology and algorithms for treating inequalities in uncertain systems. This is an important problem in the context of models for material failure and network flows under uncertainty where conditions of failure or flow are described in the form of inequalities between the state variables.« less

A structural equation model analysis of relationships among ENSO, seasonal descriptors and wildfires.

PubMed

Slocum, Matthew G; Orzell, Steve L

2013-01-01

Seasonality drives ecological processes through networks of forcings, and the resultant complexity requires creative approaches for modeling to be successful. Recently ecologists and climatologists have developed sophisticated methods for fully describing seasons. However, to date the relationships among the variables produced by these methods have not been analyzed as networks, but rather with simple univariate statistics. In this manuscript we used structural equation modeling (SEM) to analyze a proposed causal network describing seasonality of rainfall for a site in south-central Florida. We also described how this network was influenced by the El Niño-Southern Oscillation (ENSO), and how the network in turn affected the site's wildfire regime. Our models indicated that wet and dry seasons starting later in the year (or ending earlier) were shorter and had less rainfall. El Niño conditions increased dry season rainfall, and via this effect decreased the consistency of that season's drying trend. El Niño conditions also negatively influenced how consistent the moistening trend was during the wet season, but in this case the effect was direct and did not route through rainfall. In modeling wildfires, our models showed that area burned was indirectly influenced by ENSO via its effect on dry season rainfall. Area burned was also indirectly reduced when the wet season had consistent rainfall, as such wet seasons allowed fewer wildfires in subsequent fire seasons. Overall area burned at the study site was estimated with high accuracy (R (2) score = 0.63). In summary, we found that by using SEMs, we were able to clearly describe causal patterns involving seasonal climate, ENSO and wildfire. We propose that similar approaches could be effectively applied to other sites where seasonality exerts strong and complex forcings on ecological processes.

A Structural Equation Model Analysis of Relationships among ENSO, Seasonal Descriptors and Wildfires

PubMed Central

Slocum, Matthew G.; Orzell, Steve L.

2013-01-01

Seasonality drives ecological processes through networks of forcings, and the resultant complexity requires creative approaches for modeling to be successful. Recently ecologists and climatologists have developed sophisticated methods for fully describing seasons. However, to date the relationships among the variables produced by these methods have not been analyzed as networks, but rather with simple univariate statistics. In this manuscript we used structural equation modeling (SEM) to analyze a proposed causal network describing seasonality of rainfall for a site in south-central Florida. We also described how this network was influenced by the El Niño-Southern Oscillation (ENSO), and how the network in turn affected the site’s wildfire regime. Our models indicated that wet and dry seasons starting later in the year (or ending earlier) were shorter and had less rainfall. El Niño conditions increased dry season rainfall, and via this effect decreased the consistency of that season’s drying trend. El Niño conditions also negatively influenced how consistent the moistening trend was during the wet season, but in this case the effect was direct and did not route through rainfall. In modeling wildfires, our models showed that area burned was indirectly influenced by ENSO via its effect on dry season rainfall. Area burned was also indirectly reduced when the wet season had consistent rainfall, as such wet seasons allowed fewer wildfires in subsequent fire seasons. Overall area burned at the study site was estimated with high accuracy (R 2 score = 0.63). In summary, we found that by using SEMs, we were able to clearly describe causal patterns involving seasonal climate, ENSO and wildfire. We propose that similar approaches could be effectively applied to other sites where seasonality exerts strong and complex forcings on ecological processes. PMID:24086670

Cortical network models of impulse firing in the resting and active states predict cortical energetics

PubMed Central

Bennett, Maxwell R.; Farnell, Les; Gibson, William G.; Lagopoulos, Jim

2015-01-01

Measurements of the cortical metabolic rate of glucose oxidation [CMRglc(ox)] have provided a number of interesting and, in some cases, surprising observations. One is the decline in CMRglc(ox) during anesthesia and non-rapid eye movement (NREM) sleep, and another, the inverse relationship between the resting-state CMRglc(ox) and the transient following input from the thalamus. The recent establishment of a quantitative relationship between synaptic and action potential activity on the one hand and CMRglc(ox) on the other allows neural network models of such activity to probe for possible mechanistic explanations of these phenomena. We have carried out such investigations using cortical models consisting of networks of modules with excitatory and inhibitory neurons, each receiving excitatory inputs from outside the network in addition to intermodular connections. Modules may be taken as regions of cortical interest, the inputs from outside the network as arising from the thalamus, and the intermodular connections as long associational fibers. The model shows that the impulse frequency of different modules can differ from each other by less than 10%, consistent with the relatively uniform CMRglc(ox) observed across different regions of cortex. The model also shows that, if correlations of the average impulse rate between different modules decreases, there is a concomitant decrease in the average impulse rate in the modules, consistent with the observed drop in CMRglc(ox) in NREM sleep and under anesthesia. The model also explains why a transient thalamic input to sensory cortex gives rise to responses with amplitudes inversely dependent on the resting-state frequency, and therefore resting-state CMRglc(ox). PMID:25775588

Reciprocity of weighted networks

PubMed Central

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation. PMID:24056721

Reciprocity of weighted networks.

PubMed

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection

NASA Astrophysics Data System (ADS)

Li, Ping; Zhao, Qingzhen; Wang, Haitang

2013-05-01

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.

Structure and mechanism of diet specialisation: testing models of individual variation in resource use with sea otters

USGS Publications Warehouse

Tinker, M. Tim; Guimarães, Paulo R.; Novak, Mark; Marquitti, Flavia Maria Darcie; Bodkin, James L.; Staedler, Michelle; Bentall, Gena B.; Estes, James A.

2012-01-01

Studies of consumer-resource interactions suggest that individual diet specialisation is empirically widespread and theoretically important to the organisation and dynamics of populations and communities. We used weighted networks to analyze the resource use by sea otters, testing three alternative models for how individual diet specialisation may arise. As expected, individual specialisation was absent when otter density was low, but increased at high-otter density. A high-density emergence of nested resource-use networks was consistent with the model assuming individuals share preference ranks. However, a density-dependent emergence of a non-nested modular network for ‘core’ resources was more consistent with the ‘competitive refuge’ model. Individuals from different diet modules showed predictable variation in rank-order prey preferences and handling times of core resources, further supporting the competitive refuge model. Our findings support a hierarchical organisation of diet specialisation and suggest individual use of core and marginal resources may be driven by different selective pressures.

An approximation method for improving dynamic network model fitting.

PubMed

Carnegie, Nicole Bohme; Krivitsky, Pavel N; Hunter, David R; Goodreau, Steven M

There has been a great deal of interest recently in the modeling and simulation of dynamic networks, i.e., networks that change over time. One promising model is the separable temporal exponential-family random graph model (ERGM) of Krivitsky and Handcock, which treats the formation and dissolution of ties in parallel at each time step as independent ERGMs. However, the computational cost of fitting these models can be substantial, particularly for large, sparse networks. Fitting cross-sectional models for observations of a network at a single point in time, while still a non-negligible computational burden, is much easier. This paper examines model fitting when the available data consist of independent measures of cross-sectional network structure and the duration of relationships under the assumption of stationarity. We introduce a simple approximation to the dynamic parameters for sparse networks with relationships of moderate or long duration and show that the approximation method works best in precisely those cases where parameter estimation is most likely to fail-networks with very little change at each time step. We consider a variety of cases: Bernoulli formation and dissolution of ties, independent-tie formation and Bernoulli dissolution, independent-tie formation and dissolution, and dependent-tie formation models.

An Implementation of Wireless Body Area Networks for Improving Priority Data Transmission Delay.

PubMed

Gündoğdu, Köksal; Çalhan, Ali

2016-03-01

The rapid growth of wireless sensor networks has enabled the human health monitoring of patients using body sensor nodes that gather and evaluate human body parameters and movements. This study describes both simulation model and implementation of a new traffic sensitive wireless body area network by using non-preemptive priority queue discipline. A wireless body area network implementation employing TDMA is designed with three different priorities of data traffics. Besides, a coordinator node having the non-preemptive priority queue is performed in this study. We have also developed, modeled and simulated example network scenarios by using the Riverbed Modeler simulation software with the purpose of verifying the implementation results. The simulation results obtained under various network load conditions are consistent with the implementation results.

Construction of multi-scale consistent brain networks: methods and applications.

PubMed

Ge, Bao; Tian, Yin; Hu, Xintao; Chen, Hanbo; Zhu, Dajiang; Zhang, Tuo; Han, Junwei; Guo, Lei; Liu, Tianming

2015-01-01

Mapping human brain networks provides a basis for studying brain function and dysfunction, and thus has gained significant interest in recent years. However, modeling human brain networks still faces several challenges including constructing networks at multiple spatial scales and finding common corresponding networks across individuals. As a consequence, many previous methods were designed for a single resolution or scale of brain network, though the brain networks are multi-scale in nature. To address this problem, this paper presents a novel approach to constructing multi-scale common structural brain networks from DTI data via an improved multi-scale spectral clustering applied on our recently developed and validated DICCCOLs (Dense Individualized and Common Connectivity-based Cortical Landmarks). Since the DICCCOL landmarks possess intrinsic structural correspondences across individuals and populations, we employed the multi-scale spectral clustering algorithm to group the DICCCOL landmarks and their connections into sub-networks, meanwhile preserving the intrinsically-established correspondences across multiple scales. Experimental results demonstrated that the proposed method can generate multi-scale consistent and common structural brain networks across subjects, and its reproducibility has been verified by multiple independent datasets. As an application, these multi-scale networks were used to guide the clustering of multi-scale fiber bundles and to compare the fiber integrity in schizophrenia and healthy controls. In general, our methods offer a novel and effective framework for brain network modeling and tract-based analysis of DTI data.

Network integration and limits to social inheritance in vervet monkeys.

PubMed

Jarrett, Jonathan D; Bonnell, Tyler R; Young, Christopher; Barrett, Louise; Henzi, S Peter

2018-04-11

Social networks can be adaptive for members and a recent model (Ilany and Akçay 2016 Nat. Comm. 7 , 12084 (doi:10.1038/ncomms12084)) has demonstrated that network structure can be maintained by a simple process of social inheritance. Here, we ask how juvenile vervet monkeys integrate into their adult grooming networks, using the model to test whether observed grooming patterns replicate network structure. Female juveniles, who are philopatric, increased their grooming effort towards adults more than males, although this was not reciprocated by the adults themselves. While more consistent maternal grooming networks, together with maternal network strength, predicted increasing similarity in the patterning of mother-daughter grooming allocations, daughters' grooming networks generally did not match closely those of their mothers. However, maternal networks themselves were not very consistent across time, thus presenting youngsters with a moving target that may be difficult to match. Observed patterns of juvenile female grooming did not replicate the adult network, for which increased association with adults not groomed by their mothers would be necessary. These results suggest that network flexibility, not stability, characterizes our groups and that juveniles are exposed to, and must learn to cope with, temporal shifts in network structure. We hypothesize that this may lead to individual variation in behavioural flexibility, which in turn may help explain why and how variation in sociability influences fitness. © 2018 The Author(s).

Dynamic Neural Networks Supporting Memory Retrieval

PubMed Central

St. Jacques, Peggy L.; Kragel, Philip A.; Rubin, David C.

2011-01-01

How do separate neural networks interact to support complex cognitive processes such as remembrance of the personal past? Autobiographical memory (AM) retrieval recruits a consistent pattern of activation that potentially comprises multiple neural networks. However, it is unclear how such large-scale neural networks interact and are modulated by properties of the memory retrieval process. In the present functional MRI (fMRI) study, we combined independent component analysis (ICA) and dynamic causal modeling (DCM) to understand the neural networks supporting AM retrieval. ICA revealed four task-related components consistent with the previous literature: 1) Medial Prefrontal Cortex (PFC) Network, associated with self-referential processes, 2) Medial Temporal Lobe (MTL) Network, associated with memory, 3) Frontoparietal Network, associated with strategic search, and 4) Cingulooperculum Network, associated with goal maintenance. DCM analysis revealed that the medial PFC network drove activation within the system, consistent with the importance of this network to AM retrieval. Additionally, memory accessibility and recollection uniquely altered connectivity between these neural networks. Recollection modulated the influence of the medial PFC on the MTL network during elaboration, suggesting that greater connectivity among subsystems of the default network supports greater re-experience. In contrast, memory accessibility modulated the influence of frontoparietal and MTL networks on the medial PFC network, suggesting that ease of retrieval involves greater fluency among the multiple networks contributing to AM. These results show the integration between neural networks supporting AM retrieval and the modulation of network connectivity by behavior. PMID:21550407

The Laplacian spectrum of neural networks

PubMed Central

de Lange, Siemon C.; de Reus, Marcel A.; van den Heuvel, Martijn P.

2014-01-01

The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these “conventional” graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks. PMID:24454286

Requirements for data integration platforms in biomedical research networks: a reference model

PubMed Central

Knaup, Petra

2015-01-01

Biomedical research networks need to integrate research data among their members and with external partners. To support such data sharing activities, an adequate information technology infrastructure is necessary. To facilitate the establishment of such an infrastructure, we developed a reference model for the requirements. The reference model consists of five reference goals and 15 reference requirements. Using the Unified Modeling Language, the goals and requirements are set into relation to each other. In addition, all goals and requirements are described textually in tables. This reference model can be used by research networks as a basis for a resource efficient acquisition of their project specific requirements. Furthermore, a concrete instance of the reference model is described for a research network on liver cancer. The reference model is transferred into a requirements model of the specific network. Based on this concrete requirements model, a service-oriented information technology architecture is derived and also described in this paper. PMID:25699205

Parameter inference in small world network disease models with approximate Bayesian Computational methods

NASA Astrophysics Data System (ADS)

Walker, David M.; Allingham, David; Lee, Heung Wing Joseph; Small, Michael

2010-02-01

Small world network models have been effective in capturing the variable behaviour of reported case data of the SARS coronavirus outbreak in Hong Kong during 2003. Simulations of these models have previously been realized using informed “guesses” of the proposed model parameters and tested for consistency with the reported data by surrogate analysis. In this paper we attempt to provide statistically rigorous parameter distributions using Approximate Bayesian Computation sampling methods. We find that such sampling schemes are a useful framework for fitting parameters of stochastic small world network models where simulation of the system is straightforward but expressing a likelihood is cumbersome.

Optimal control of epidemic information dissemination over networks.

PubMed

Chen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng

2014-12-01

Information dissemination control is of crucial importance to facilitate reliable and efficient data delivery, especially in networks consisting of time-varying links or heterogeneous links. Since the abstraction of information dissemination much resembles the spread of epidemics, epidemic models are utilized to characterize the collective dynamics of information dissemination over networks. From a systematic point of view, we aim to explore the optimal control policy for information dissemination given that the control capability is a function of its distribution time, which is a more realistic model in many applications. The main contributions of this paper are to provide an analytically tractable model for information dissemination over networks, to solve the optimal control signal distribution time for minimizing the accumulated network cost via dynamic programming, and to establish a parametric plug-in model for information dissemination control. In particular, we evaluate its performance in mobile and generalized social networks as typical examples.

International Network of Passive Correlation Ranging for Orbit Determination of a Geostationary Satellite

NASA Astrophysics Data System (ADS)

Kaliuzhnyi, Mykola; Bushuev, Felix; Shulga, Oleksandr; Sybiryakova, Yevgeniya; Shakun, Leonid; Bezrukovs, Vladislavs; Moskalenko, Sergiy; Kulishenko, Vladislav; Malynovskyi, Yevgen

2016-12-01

An international network of passive correlation ranging of a geostationary telecommunication satellite is considered in the article. The network is developed by the RI "MAO". The network consists of five spatially separated stations of synchronized reception of DVB-S signals of digital satellite TV. The stations are located in Ukraine and Latvia. The time difference of arrival (TDOA) on the network stations of the DVB-S signals, radiated by the satellite, is a measured parameter. The results of TDOA estimation obtained by the network in May-August 2016 are presented in the article. Orbital parameters of the tracked satellite are determined using measured values of the TDOA and two models of satellite motion: the analytical model SGP4/SDP4 and the model of numerical integration of the equations of satellite motion. Both models are realized using the free low-level space dynamics library OREKIT (ORbit Extrapolation KIT).

The performance evaluation of a new neural network based traffic management scheme for a satellite communication network

NASA Technical Reports Server (NTRS)

Ansari, Nirwan; Liu, Dequan

1991-01-01

A neural-network-based traffic management scheme for a satellite communication network is described. The scheme consists of two levels of management. The front end of the scheme is a derivation of Kohonen's self-organization model to configure maps for the satellite communication network dynamically. The model consists of three stages. The first stage is the pattern recognition task, in which an exemplar map that best meets the current network requirements is selected. The second stage is the analysis of the discrepancy between the chosen exemplar map and the state of the network, and the adaptive modification of the chosen exemplar map to conform closely to the network requirement (input data pattern) by means of Kohonen's self-organization. On the basis of certain performance criteria, whether a new map is generated to replace the original chosen map is decided in the third stage. A state-dependent routing algorithm, which arranges the incoming call to some proper path, is used to make the network more efficient and to lower the call block rate. Simulation results demonstrate that the scheme, which combines self-organization and the state-dependent routing mechanism, provides better performance in terms of call block rate than schemes that only have either the self-organization mechanism or the routing mechanism.

Network Receptive Field Modeling Reveals Extensive Integration and Multi-feature Selectivity in Auditory Cortical Neurons.

PubMed

Harper, Nicol S; Schoppe, Oliver; Willmore, Ben D B; Cui, Zhanfeng; Schnupp, Jan W H; King, Andrew J

2016-11-01

Cortical sensory neurons are commonly characterized using the receptive field, the linear dependence of their response on the stimulus. In primary auditory cortex neurons can be characterized by their spectrotemporal receptive fields, the spectral and temporal features of a sound that linearly drive a neuron. However, receptive fields do not capture the fact that the response of a cortical neuron results from the complex nonlinear network in which it is embedded. By fitting a nonlinear feedforward network model (a network receptive field) to cortical responses to natural sounds, we reveal that primary auditory cortical neurons are sensitive over a substantially larger spectrotemporal domain than is seen in their standard spectrotemporal receptive fields. Furthermore, the network receptive field, a parsimonious network consisting of 1-7 sub-receptive fields that interact nonlinearly, consistently better predicts neural responses to auditory stimuli than the standard receptive fields. The network receptive field reveals separate excitatory and inhibitory sub-fields with different nonlinear properties, and interaction of the sub-fields gives rise to important operations such as gain control and conjunctive feature detection. The conjunctive effects, where neurons respond only if several specific features are present together, enable increased selectivity for particular complex spectrotemporal structures, and may constitute an important stage in sound recognition. In conclusion, we demonstrate that fitting auditory cortical neural responses with feedforward network models expands on simple linear receptive field models in a manner that yields substantially improved predictive power and reveals key nonlinear aspects of cortical processing, while remaining easy to interpret in a physiological context.

Network Receptive Field Modeling Reveals Extensive Integration and Multi-feature Selectivity in Auditory Cortical Neurons

PubMed Central

Willmore, Ben D. B.; Cui, Zhanfeng; Schnupp, Jan W. H.; King, Andrew J.

2016-01-01

Cortical sensory neurons are commonly characterized using the receptive field, the linear dependence of their response on the stimulus. In primary auditory cortex neurons can be characterized by their spectrotemporal receptive fields, the spectral and temporal features of a sound that linearly drive a neuron. However, receptive fields do not capture the fact that the response of a cortical neuron results from the complex nonlinear network in which it is embedded. By fitting a nonlinear feedforward network model (a network receptive field) to cortical responses to natural sounds, we reveal that primary auditory cortical neurons are sensitive over a substantially larger spectrotemporal domain than is seen in their standard spectrotemporal receptive fields. Furthermore, the network receptive field, a parsimonious network consisting of 1–7 sub-receptive fields that interact nonlinearly, consistently better predicts neural responses to auditory stimuli than the standard receptive fields. The network receptive field reveals separate excitatory and inhibitory sub-fields with different nonlinear properties, and interaction of the sub-fields gives rise to important operations such as gain control and conjunctive feature detection. The conjunctive effects, where neurons respond only if several specific features are present together, enable increased selectivity for particular complex spectrotemporal structures, and may constitute an important stage in sound recognition. In conclusion, we demonstrate that fitting auditory cortical neural responses with feedforward network models expands on simple linear receptive field models in a manner that yields substantially improved predictive power and reveals key nonlinear aspects of cortical processing, while remaining easy to interpret in a physiological context. PMID:27835647

Performance Evaluation Modeling of Network Sensors

NASA Technical Reports Server (NTRS)

Clare, Loren P.; Jennings, Esther H.; Gao, Jay L.

2003-01-01

Substantial benefits are promised by operating many spatially separated sensors collectively. Such systems are envisioned to consist of sensor nodes that are connected by a communications network. A simulation tool is being developed to evaluate the performance of networked sensor systems, incorporating such metrics as target detection probabilities, false alarms rates, and classification confusion probabilities. The tool will be used to determine configuration impacts associated with such aspects as spatial laydown, and mixture of different types of sensors (acoustic, seismic, imaging, magnetic, RF, etc.), and fusion architecture. The QualNet discrete-event simulation environment serves as the underlying basis for model development and execution. This platform is recognized for its capabilities in efficiently simulating networking among mobile entities that communicate via wireless media. We are extending QualNet's communications modeling constructs to capture the sensing aspects of multi-target sensing (analogous to multiple access communications), unimodal multi-sensing (broadcast), and multi-modal sensing (multiple channels and correlated transmissions). Methods are also being developed for modeling the sensor signal sources (transmitters), signal propagation through the media, and sensors (receivers) that are consistent with the discrete event paradigm needed for performance determination of sensor network systems. This work is supported under the Microsensors Technical Area of the Army Research Laboratory (ARL) Advanced Sensors Collaborative Technology Alliance.

Reducing a cortical network to a Potts model yields storage capacity estimates

NASA Astrophysics Data System (ADS)

Naim, Michelangelo; Boboeva, Vezha; Kang, Chol Jun; Treves, Alessandro

2018-04-01

An autoassociative network of Potts units, coupled via tensor connections, has been proposed and analysed as an effective model of an extensive cortical network with distinct short- and long-range synaptic connections, but it has not been clarified in what sense it can be regarded as an effective model. We draw here the correspondence between the two, which indicates the need to introduce a local feedback term in the reduced model, i.e. in the Potts network. An effective model allows the study of phase transitions. As an example, we study the storage capacity of the Potts network with this additional term, the local feedback w, which contributes to drive the activity of the network towards one of the stored patterns. The storage capacity calculation, performed using replica tools, is limited to fully connected networks, for which a Hamiltonian can be defined. To extend the results to the case of intermediate partial connectivity, we also derive the self-consistent signal-to-noise analysis for the Potts network; and finally we discuss the implications for semantic memory in humans.

Emergence of clustering in an acquaintance model without homophily

NASA Astrophysics Data System (ADS)

Bhat, Uttam; Krapivsky, P. L.; Redner, S.

2014-11-01

We introduce an agent-based acquaintance model in which social links are created by processes in which there is no explicit homophily. In spite of the homogeneous nature of the social interactions, highly-clustered social networks can arise. The crucial feature of our model is that of variable transitive interactions. Namely, when an agent introduces two unconnected friends, the rate at which a connection actually occurs between them depends on the number of their mutual acquaintances. As this transitive interaction rate is varied, the social network undergoes a dramatic clustering transition. Close to the transition, the network consists of a collection of well-defined communities. As a function of time, the network can also undergo an incomplete gelation transition, in which the gel, or giant cluster, does not constitute the entire network, even at infinite time. Some of the clustering properties of our model also arise, but in a more gradual manner, in Facebook networks. Finally, we discuss a more realistic variant of our original model in which network realizations can be constructed that quantitatively match Facebook networks.

Real-time simulation of a spiking neural network model of the basal ganglia circuitry using general purpose computing on graphics processing units.

PubMed

Igarashi, Jun; Shouno, Osamu; Fukai, Tomoki; Tsujino, Hiroshi

2011-11-01

Real-time simulation of a biologically realistic spiking neural network is necessary for evaluation of its capacity to interact with real environments. However, the real-time simulation of such a neural network is difficult due to its high computational costs that arise from two factors: (1) vast network size and (2) the complicated dynamics of biologically realistic neurons. In order to address these problems, mainly the latter, we chose to use general purpose computing on graphics processing units (GPGPUs) for simulation of such a neural network, taking advantage of the powerful computational capability of a graphics processing unit (GPU). As a target for real-time simulation, we used a model of the basal ganglia that has been developed according to electrophysiological and anatomical knowledge. The model consists of heterogeneous populations of 370 spiking model neurons, including computationally heavy conductance-based models, connected by 11,002 synapses. Simulation of the model has not yet been performed in real-time using a general computing server. By parallelization of the model on the NVIDIA Geforce GTX 280 GPU in data-parallel and task-parallel fashion, faster-than-real-time simulation was robustly realized with only one-third of the GPU's total computational resources. Furthermore, we used the GPU's full computational resources to perform faster-than-real-time simulation of three instances of the basal ganglia model; these instances consisted of 1100 neurons and 33,006 synapses and were synchronized at each calculation step. Finally, we developed software for simultaneous visualization of faster-than-real-time simulation output. These results suggest the potential power of GPGPU techniques in real-time simulation of realistic neural networks. Copyright © 2011 Elsevier Ltd. All rights reserved.

Implications for Post-processing Nucleosynthesis of Core-collapse Supernova Models with Lagrangian Particles

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

Harris, J. Austin; Hix, W. Raphael; Chertkow, Merek A.

In this paper, we investigate core-collapse supernova (CCSN) nucleosynthesis with self-consistent, axisymmetric (2D) simulations performed using the neutrino hydrodynamics code Chimera. Computational costs have traditionally constrained the evolution of the nuclear composition within multidimensional CCSN models to, at best, a 14-species α-network capable of tracking onlymore » $$(\\alpha ,\\gamma )$$ reactions from 4He to 60Zn. Such a simplified network limits the ability to accurately evolve detailed composition and neutronization or calculate the nuclear energy generation rate. Lagrangian tracer particles are commonly used to extend the nuclear network evolution by incorporating more realistic networks into post-processing nucleosynthesis calculations. However, limitations such as poor spatial resolution of the tracer particles; inconsistent thermodynamic evolution, including misestimation of expansion timescales; and uncertain determination of the multidimensional mass cut at the end of the simulation impose uncertainties inherent to this approach. Finally, we present a detailed analysis of the impact of such uncertainties for four self-consistent axisymmetric CCSN models initiated from solar-metallicity, nonrotating progenitors of 12, 15, 20, and 25 $${M}_{\\odot }$$ and evolved with the smaller α-network to more than 1 s after the launch of an explosion.« less

Implications for Post-processing Nucleosynthesis of Core-collapse Supernova Models with Lagrangian Particles

NASA Astrophysics Data System (ADS)

Harris, J. Austin; Hix, W. Raphael; Chertkow, Merek A.; Lee, C. T.; Lentz, Eric J.; Messer, O. E. Bronson

2017-07-01

We investigate core-collapse supernova (CCSN) nucleosynthesis with self-consistent, axisymmetric (2D) simulations performed using the neutrino hydrodynamics code Chimera. Computational costs have traditionally constrained the evolution of the nuclear composition within multidimensional CCSN models to, at best, a 14-species α-network capable of tracking only (α ,γ ) reactions from 4He to 60Zn. Such a simplified network limits the ability to accurately evolve detailed composition and neutronization or calculate the nuclear energy generation rate. Lagrangian tracer particles are commonly used to extend the nuclear network evolution by incorporating more realistic networks into post-processing nucleosynthesis calculations. However, limitations such as poor spatial resolution of the tracer particles inconsistent thermodynamic evolution, including misestimation of expansion timescales and uncertain determination of the multidimensional mass cut at the end of the simulation impose uncertainties inherent to this approach. We present a detailed analysis of the impact of such uncertainties for four self-consistent axisymmetric CCSN models initiated from solar-metallicity, nonrotating progenitors of 12, 15, 20, and 25 {M}⊙ and evolved with the smaller α-network to more than 1 s after the launch of an explosion.

Implications for Post-processing Nucleosynthesis of Core-collapse Supernova Models with Lagrangian Particles

DOE PAGES

Harris, J. Austin; Hix, W. Raphael; Chertkow, Merek A.; ...

2017-06-26

In this paper, we investigate core-collapse supernova (CCSN) nucleosynthesis with self-consistent, axisymmetric (2D) simulations performed using the neutrino hydrodynamics code Chimera. Computational costs have traditionally constrained the evolution of the nuclear composition within multidimensional CCSN models to, at best, a 14-species α-network capable of tracking onlymore » $$(\\alpha ,\\gamma )$$ reactions from 4He to 60Zn. Such a simplified network limits the ability to accurately evolve detailed composition and neutronization or calculate the nuclear energy generation rate. Lagrangian tracer particles are commonly used to extend the nuclear network evolution by incorporating more realistic networks into post-processing nucleosynthesis calculations. However, limitations such as poor spatial resolution of the tracer particles; inconsistent thermodynamic evolution, including misestimation of expansion timescales; and uncertain determination of the multidimensional mass cut at the end of the simulation impose uncertainties inherent to this approach. Finally, we present a detailed analysis of the impact of such uncertainties for four self-consistent axisymmetric CCSN models initiated from solar-metallicity, nonrotating progenitors of 12, 15, 20, and 25 $${M}_{\\odot }$$ and evolved with the smaller α-network to more than 1 s after the launch of an explosion.« less

Quantum-Like Bayesian Networks for Modeling Decision Making

PubMed Central

Moreira, Catarina; Wichert, Andreas

2016-01-01

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

Multiscale modelling and nonlinear simulation of vascular tumour growth

PubMed Central

Macklin, Paul; Anderson, Alexander R. A.; Chaplain, Mark A. J.; Cristini, Vittorio

2011-01-01

In this article, we present a new multiscale mathematical model for solid tumour growth which couples an improved model of tumour invasion with a model of tumour-induced angiogenesis. We perform nonlinear simulations of the multi-scale model that demonstrate the importance of the coupling between the development and remodeling of the vascular network, the blood flow through the network and the tumour progression. Consistent with clinical observations, the hydrostatic stress generated by tumour cell proliferation shuts down large portions of the vascular network dramatically affecting the flow, the subsequent network remodeling, the delivery of nutrients to the tumour and the subsequent tumour progression. In addition, extracellular matrix degradation by tumour cells is seen to have a dramatic affect on both the development of the vascular network and the growth response of the tumour. In particular, the newly developing vessels tend to encapsulate, rather than penetrate, the tumour and are thus less effective in delivering nutrients. PMID:18781303

Prediction of Aerodynamic Coefficients for Wind Tunnel Data using a Genetic Algorithm Optimized Neural Network

NASA Technical Reports Server (NTRS)

Rajkumar, T.; Aragon, Cecilia; Bardina, Jorge; Britten, Roy

2002-01-01

A fast, reliable way of predicting aerodynamic coefficients is produced using a neural network optimized by a genetic algorithm. Basic aerodynamic coefficients (e.g. lift, drag, pitching moment) are modelled as functions of angle of attack and Mach number. The neural network is first trained on a relatively rich set of data from wind tunnel tests of numerical simulations to learn an overall model. Most of the aerodynamic parameters can be well-fitted using polynomial functions. A new set of data, which can be relatively sparse, is then supplied to the network to produce a new model consistent with the previous model and the new data. Because the new model interpolates realistically between the sparse test data points, it is suitable for use in piloted simulations. The genetic algorithm is used to choose a neural network architecture to give best results, avoiding over-and under-fitting of the test data.

Familiarity Detection is an Intrinsic Property of Cortical Microcircuits with Bidirectional Synaptic Plasticity.

PubMed

Zhang, Xiaoyu; Ju, Han; Penney, Trevor B; VanDongen, Antonius M J

2017-01-01

Humans instantly recognize a previously seen face as "familiar." To deepen our understanding of familiarity-novelty detection, we simulated biologically plausible neural network models of generic cortical microcircuits consisting of spiking neurons with random recurrent synaptic connections. NMDA receptor (NMDAR)-dependent synaptic plasticity was implemented to allow for unsupervised learning and bidirectional modifications. Network spiking activity evoked by sensory inputs consisting of face images altered synaptic efficacy, which resulted in the network responding more strongly to a previously seen face than a novel face. Network size determined how many faces could be accurately recognized as familiar. When the simulated model became sufficiently complex in structure, multiple familiarity traces could be retained in the same network by forming partially-overlapping subnetworks that differ slightly from each other, thereby resulting in a high storage capacity. Fisher's discriminant analysis was applied to identify critical neurons whose spiking activity predicted familiar input patterns. Intriguingly, as sensory exposure was prolonged, the selected critical neurons tended to appear at deeper layers of the network model, suggesting recruitment of additional circuits in the network for incremental information storage. We conclude that generic cortical microcircuits with bidirectional synaptic plasticity have an intrinsic ability to detect familiar inputs. This ability does not require a specialized wiring diagram or supervision and can therefore be expected to emerge naturally in developing cortical circuits.

Familiarity Detection is an Intrinsic Property of Cortical Microcircuits with Bidirectional Synaptic Plasticity

PubMed Central

2017-01-01

Abstract Humans instantly recognize a previously seen face as “familiar.” To deepen our understanding of familiarity-novelty detection, we simulated biologically plausible neural network models of generic cortical microcircuits consisting of spiking neurons with random recurrent synaptic connections. NMDA receptor (NMDAR)-dependent synaptic plasticity was implemented to allow for unsupervised learning and bidirectional modifications. Network spiking activity evoked by sensory inputs consisting of face images altered synaptic efficacy, which resulted in the network responding more strongly to a previously seen face than a novel face. Network size determined how many faces could be accurately recognized as familiar. When the simulated model became sufficiently complex in structure, multiple familiarity traces could be retained in the same network by forming partially-overlapping subnetworks that differ slightly from each other, thereby resulting in a high storage capacity. Fisher’s discriminant analysis was applied to identify critical neurons whose spiking activity predicted familiar input patterns. Intriguingly, as sensory exposure was prolonged, the selected critical neurons tended to appear at deeper layers of the network model, suggesting recruitment of additional circuits in the network for incremental information storage. We conclude that generic cortical microcircuits with bidirectional synaptic plasticity have an intrinsic ability to detect familiar inputs. This ability does not require a specialized wiring diagram or supervision and can therefore be expected to emerge naturally in developing cortical circuits. PMID:28534043

A mixing evolution model for bidirectional microblog user networks

NASA Astrophysics Data System (ADS)

Yuan, Wei-Guo; Liu, Yun

2015-08-01

Microblogs have been widely used as a new form of online social networking. Based on the user profile data collected from Sina Weibo, we find that the number of microblog user bidirectional friends approximately corresponds with the lognormal distribution. We then build two microblog user networks with real bidirectional relationships, both of which have not only small-world and scale-free but also some special properties, such as double power-law degree distribution, disassortative network, hierarchical and rich-club structure. Moreover, by detecting the community structures of the two real networks, we find both of their community scales follow an exponential distribution. Based on the empirical analysis, we present a novel evolution network model with mixed connection rules, including lognormal fitness preferential and random attachment, nearest neighbor interconnected in the same community, and global random associations in different communities. The simulation results show that our model is consistent with real network in many topology features.

A Neural Network Architecture For Rapid Model Indexing In Computer Vision Systems

NASA Astrophysics Data System (ADS)

Pawlicki, Ted

1988-03-01

Models of objects stored in memory have been shown to be useful for guiding the processing of computer vision systems. A major consideration in such systems, however, is how stored models are initially accessed and indexed by the system. As the number of stored models increases, the time required to search memory for the correct model becomes high. Parallel distributed, connectionist, neural networks' have been shown to have appealing content addressable memory properties. This paper discusses an architecture for efficient storage and reference of model memories stored as stable patterns of activity in a parallel, distributed, connectionist, neural network. The emergent properties of content addressability and resistance to noise are exploited to perform indexing of the appropriate object centered model from image centered primitives. The system consists of three network modules each of which represent information relative to a different frame of reference. The model memory network is a large state space vector where fields in the vector correspond to ordered component objects and relative, object based spatial relationships between the component objects. The component assertion network represents evidence about the existence of object primitives in the input image. It establishes local frames of reference for object primitives relative to the image based frame of reference. The spatial relationship constraint network is an intermediate representation which enables the association between the object based and the image based frames of reference. This intermediate level represents information about possible object orderings and establishes relative spatial relationships from the image based information in the component assertion network below. It is also constrained by the lawful object orderings in the model memory network above. The system design is consistent with current psychological theories of recognition by component. It also seems to support Marr's notions of hierarchical indexing. (i.e. the specificity, adjunct, and parent indices) It supports the notion that multiple canonical views of an object may have to be stored in memory to enable its efficient identification. The use of variable fields in the state space vectors appears to keep the number of required nodes in the network down to a tractable number while imposing a semantic value on different areas of the state space. This semantic imposition supports an interface between the analogical aspects of neural networks and the propositional paradigms of symbolic processing.

Cascading failures in interconnected networks with dynamical redistribution of loads

NASA Astrophysics Data System (ADS)

Zhao, Zhuang; Zhang, Peng; Yang, Hujiang

2015-09-01

Cascading failures of loads in isolated networks and coupled networks have been studied in the past few years. In most of the corresponding results, the topologies of the networks are destroyed. Here, we present an interconnected network model considering cascading failures based on the dynamic redistribution of flow in the networks. Compared with the results of single scale-free networks, we find that interconnected scale-free networks have higher vulnerability. Additionally, the network heterogeneity plays an important role in the robustness of interconnected networks under intentional attacks. Considering the effects of various coupling preferences, the results show that there are almost no differences. Finally, the application of our model to the Beijing interconnected traffic network, which consists of a subway network and a bus network, shows that the subway network suffers more damage under the attack. Moreover, the interconnected traffic network may be more exposed to damage after initial attacks on the bus network. These discussions are important for the design and optimization of interconnected networks.

Hybrid methods for simulating hydrodynamics and heat transfer in multiscale (1D-3D) models

NASA Astrophysics Data System (ADS)

Filimonov, S. A.; Mikhienkova, E. I.; Dekterev, A. A.; Boykov, D. V.

2017-09-01

The work is devoted to application of different-scale models in the simulation of hydrodynamics and heat transfer of large and/or complex systems, which can be considered as a combination of extended and “compact” elements. The model consisting of simultaneously existing three-dimensional and network (one-dimensional) elements is called multiscale. The paper examines the relevance of building such models and considers three main options for their implementation: the spatial and the network parts of the model are calculated separately; spatial and network parts are calculated simultaneously (hydraulically unified model); network elements “penetrate” the spatial part and are connected through the integral characteristics at the tube/channel walls (hydraulically disconnected model). Each proposed method is analyzed in terms of advantages and disadvantages. The paper presents a number of practical examples demonstrating the application of multiscale models.

SAINT: A combined simulation language for modeling man-machine systems

NASA Technical Reports Server (NTRS)

Seifert, D. J.

1979-01-01

SAINT (Systems Analysis of Integrated Networks of Tasks) is a network modeling and simulation technique for design and analysis of complex man machine systems. SAINT provides the conceptual framework for representing systems that consist of discrete task elements, continuous state variables, and interactions between them. It also provides a mechanism for combining human performance models and dynamic system behaviors in a single modeling structure. The SAINT technique is described and applications of the SAINT are discussed.

A pairwise maximum entropy model accurately describes resting-state human brain networks

PubMed Central

Watanabe, Takamitsu; Hirose, Satoshi; Wada, Hiroyuki; Imai, Yoshio; Machida, Toru; Shirouzu, Ichiro; Konishi, Seiki; Miyashita, Yasushi; Masuda, Naoki

2013-01-01

The resting-state human brain networks underlie fundamental cognitive functions and consist of complex interactions among brain regions. However, the level of complexity of the resting-state networks has not been quantified, which has prevented comprehensive descriptions of the brain activity as an integrative system. Here, we address this issue by demonstrating that a pairwise maximum entropy model, which takes into account region-specific activity rates and pairwise interactions, can be robustly and accurately fitted to resting-state human brain activities obtained by functional magnetic resonance imaging. Furthermore, to validate the approximation of the resting-state networks by the pairwise maximum entropy model, we show that the functional interactions estimated by the pairwise maximum entropy model reflect anatomical connexions more accurately than the conventional functional connectivity method. These findings indicate that a relatively simple statistical model not only captures the structure of the resting-state networks but also provides a possible method to derive physiological information about various large-scale brain networks. PMID:23340410

Scale-dependent genetic structure of the Idaho giant salamander (Dicamptodon aterrimus) in stream networks

Treesearch

Lindy B. Mullen; H. Arthur Woods; Michael K. Schwartz; Adam J. Sepulveda; Winsor H. Lowe

2010-01-01

The network architecture of streams and rivers constrains evolutionary, demographic and ecological processes of freshwater organisms. This consistent architecture also makes stream networks useful for testing general models of population genetic structure and the scaling of gene flow. We examined genetic structure and gene flow in the facultatively paedomorphic Idaho...

Connecting the dots between genes, biochemistry, and disease susceptibility: systems biology modeling in human genetics.

PubMed

Moore, Jason H; Boczko, Erik M; Summar, Marshall L

2005-02-01

Understanding how DNA sequence variations impact human health through a hierarchy of biochemical and physiological systems is expected to improve the diagnosis, prevention, and treatment of common, complex human diseases. We have previously developed a hierarchical dynamic systems approach based on Petri nets for generating biochemical network models that are consistent with genetic models of disease susceptibility. This modeling approach uses an evolutionary computation approach called grammatical evolution as a search strategy for optimal Petri net models. We have previously demonstrated that this approach routinely identifies biochemical network models that are consistent with a variety of genetic models in which disease susceptibility is determined by nonlinear interactions between two or more DNA sequence variations. We review here this approach and then discuss how it can be used to model biochemical and metabolic data in the context of genetic studies of human disease susceptibility.

Egocentric networks of Chinese men who have sex with men: network components, condom use norms, and safer sex.

PubMed

Liu, Hongjie; Feng, Tiejian; Liu, Hui; Feng, Hucang; Cai, Yumao; Rhodes, Anne G; Grusky, Oscar

2009-10-01

Research on risk behaviors among men who have sex with men (MSM) is often based on individualistic models of health behavior, but sexual behavior is inherently social in nature and often determined by constituents of social networks. The objective of this study was to examine relationships among social networks, network norms of condom use, and safer sex. A respondent-driven sampling study recruited 350 MSM in the Shenzhen region of China between November and December 2007 and collected information on network components (relations, structures, and functions) and HIV risk behavior among egos (those interviewed) and their network alters. A total of 2385 alters were nominated by the 350 egos. Egos reported an average of 4 nonsexual relation alters and 2 sexual-partner alters. Egos perceived receiving more tangible and emotional support from nonsexual relation alters than from sexual-partner alters. Two thirds (69%) of egos consistently used condoms. Sixty-seven percent of egos reported having 1 or more alters who always encouraged egos to use condoms, 84% had 1 or more alters who consistently used condoms, and 55% had 1 or more alters who insisted on condom use. Both subjective and descriptive norms were positively associated with consistent condom use. Network components were associated with the levels of the two norms. These findings suggest that social network components may activate or strengthen condom use norms within networks, which, in turn, determine consistent condom use among MSM. HIV behavioral interventions need to target the promotion of safer sex practices through enhancing peer norms of condom use within networks.

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.

General Dynamics of Topology and Traffic on Weighted Technological Networks

NASA Astrophysics Data System (ADS)

Wang, Wen-Xu; Wang, Bing-Hong; Hu, Bo; Yan, Gang; Ou, Qing

2005-05-01

For most technical networks, the interplay of dynamics, traffic, and topology is assumed crucial to their evolution. In this Letter, we propose a traffic-driven evolution model of weighted technological networks. By introducing a general strength-coupling mechanism under which the traffic and topology mutually interact, the model gives power-law distributions of degree, weight, and strength, as confirmed in many real networks. Particularly, depending on a parameter W that controls the total weight growth of the system, the nontrivial clustering coefficient C, degree assortativity coefficient r, and degree-strength correlation are all consistent with empirical evidence.

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

PubMed

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

1997-01-01

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

Data-driven inference of network connectivity for modeling the dynamics of neural codes in the insect antennal lobe

PubMed Central

Shlizerman, Eli; Riffell, Jeffrey A.; Kutz, J. Nathan

2014-01-01

The antennal lobe (AL), olfactory processing center in insects, is able to process stimuli into distinct neural activity patterns, called olfactory neural codes. To model their dynamics we perform multichannel recordings from the projection neurons in the AL driven by different odorants. We then derive a dynamic neuronal network from the electrophysiological data. The network consists of lateral-inhibitory neurons and excitatory neurons (modeled as firing-rate units), and is capable of producing unique olfactory neural codes for the tested odorants. To construct the network, we (1) design a projection, an odor space, for the neural recording from the AL, which discriminates between distinct odorants trajectories (2) characterize scent recognition, i.e., decision-making based on olfactory signals and (3) infer the wiring of the neural circuit, the connectome of the AL. We show that the constructed model is consistent with biological observations, such as contrast enhancement and robustness to noise. The study suggests a data-driven approach to answer a key biological question in identifying how lateral inhibitory neurons can be wired to excitatory neurons to permit robust activity patterns. PMID:25165442

Analysis and synthesis of distributed-lumped-active networks by digital computer

NASA Technical Reports Server (NTRS)

1973-01-01

The use of digital computational techniques in the analysis and synthesis of DLA (distributed lumped active) networks is considered. This class of networks consists of three distinct types of elements, namely, distributed elements (modeled by partial differential equations), lumped elements (modeled by algebraic relations and ordinary differential equations), and active elements (modeled by algebraic relations). Such a characterization is applicable to a broad class of circuits, especially including those usually referred to as linear integrated circuits, since the fabrication techniques for such circuits readily produce elements which may be modeled as distributed, as well as the more conventional lumped and active ones.

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.

Logical Modeling and Dynamical Analysis of Cellular Networks

PubMed Central

Abou-Jaoudé, Wassim; Traynard, Pauline; Monteiro, Pedro T.; Saez-Rodriguez, Julio; Helikar, Tomáš; Thieffry, Denis; Chaouiya, Claudine

2016-01-01

The logical (or logic) formalism is increasingly used to model regulatory and signaling networks. Complementing these applications, several groups contributed various methods and tools to support the definition and analysis of logical models. After an introduction to the logical modeling framework and to several of its variants, we review here a number of recent methodological advances to ease the analysis of large and intricate networks. In particular, we survey approaches to determine model attractors and their reachability properties, to assess the dynamical impact of variations of external signals, and to consistently reduce large models. To illustrate these developments, we further consider several published logical models for two important biological processes, namely the differentiation of T helper cells and the control of mammalian cell cycle. PMID:27303434

Simulation studies of a wide area health care network.

PubMed Central

McDaniel, J. G.

1994-01-01

There is an increasing number of efforts to install wide area health care networks. Some of these networks are being built to support several applications over a wide user base consisting primarily of medical practices, hospitals, pharmacies, medical laboratories, payors, and suppliers. Although on-line, multi-media telecommunication is desirable for some purposes such as cardiac monitoring, store-and-forward messaging is adequate for many common, high-volume applications. Laboratory test results and payment claims, for example, can be distributed using electronic messaging networks. Several network prototypes have been constructed to determine the technical problems and to assess the effectiveness of electronic messaging in wide area health care networks. Our project, Health Link, developed prototype software that was able to use the public switched telephone network to exchange messages automatically, reliably and securely. The network could be configured to accommodate the many different traffic patterns and cost constraints of its users. Discrete event simulations were performed on several network models. Canonical star and mesh networks, that were composed of nodes operating at steady state under equal loads, were modeled. Both topologies were found to support the throughput of a generic wide area health care network. The mean message delivery time of the mesh network was found to be less than that of the star network. Further simulations were conducted for a realistic large-scale health care network consisting of 1,553 doctors, 26 hospitals, four medical labs, one provincial lab and one insurer. Two network topologies were investigated: one using predominantly peer-to-peer communication, the other using client-server communication.(ABSTRACT TRUNCATED AT 250 WORDS) PMID:7949966

Dynamics of pulsatile flow in fractal models of vascular branching networks.

PubMed

Bui, Anh; Sutalo, Ilija D; Manasseh, Richard; Liffman, Kurt

2009-07-01

Efficient regulation of blood flow is critically important to the normal function of many organs, especially the brain. To investigate the circulation of blood in complex, multi-branching vascular networks, a computer model consisting of a virtual fractal model of the vasculature and a mathematical model describing the transport of blood has been developed. Although limited by some constraints, in particular, the use of simplistic, uniformly distributed model for cerebral vasculature and the omission of anastomosis, the proposed computer model was found to provide insights into blood circulation in the cerebral vascular branching network plus the physiological and pathological factors which may affect its functionality. The numerical study conducted on a model of the middle cerebral artery region signified the important effects of vessel compliance, blood viscosity variation as a function of the blood hematocrit, and flow velocity profile on the distributions of flow and pressure in the vascular network.

Inclusion of tank configurations as a variable in the cost optimization of branched piped-water networks

NASA Astrophysics Data System (ADS)

Hooda, Nikhil; Damani, Om

2017-06-01

The classic problem of the capital cost optimization of branched piped networks consists of choosing pipe diameters for each pipe in the network from a discrete set of commercially available pipe diameters. Each pipe in the network can consist of multiple segments of differing diameters. Water networks also consist of intermediate tanks that act as buffers between incoming flow from the primary source and the outgoing flow to the demand nodes. The network from the primary source to the tanks is called the primary network, and the network from the tanks to the demand nodes is called the secondary network. During the design stage, the primary and secondary networks are optimized separately, with the tanks acting as demand nodes for the primary network. Typically the choice of tank locations, their elevations, and the set of demand nodes to be served by different tanks is manually made in an ad hoc fashion before any optimization is done. It is desirable therefore to include this tank configuration choice in the cost optimization process itself. In this work, we explain why the choice of tank configuration is important to the design of a network and describe an integer linear program model that integrates the tank configuration to the standard pipe diameter selection problem. In order to aid the designers of piped-water networks, the improved cost optimization formulation is incorporated into our existing network design system called JalTantra.

An optimization method for speech enhancement based on deep neural network

NASA Astrophysics Data System (ADS)

Sun, Haixia; Li, Sikun

2017-06-01

Now, this document puts forward a deep neural network (DNN) model with more credible data set and more robust structure. First, we take two regularization skills, dropout and sparsity constraint to strengthen the generalization ability of the model. In this way, not only the model is able to reach the consistency between the pre-training model and the fine-tuning model, but also it reduce resource consumption. Then network compression by weights sharing and quantization is allowed to reduce storage cost. In the end, we evaluate the quality of the reconstructed speech according to different criterion. The result proofs that the improved framework has good performance on speech enhancement and meets the requirement of speech processing.

The application of neural networks to the SSME startup transient

NASA Technical Reports Server (NTRS)

Meyer, Claudia M.; Maul, William A.

1991-01-01

Feedforward neural networks were used to model three parameters during the Space Shuttle Main Engine startup transient. The three parameters were the main combustion chamber pressure, a controlled parameter, the high pressure oxidizer turbine discharge temperature, a redlined parameter, and the high pressure fuel pump discharge pressure, a failure-indicating performance parameter. Network inputs consisted of time windows of data from engine measurements that correlated highly to the modeled parameter. A standard backpropagation algorithm was used to train the feedforward networks on two nominal firings. Each trained network was validated with four additional nominal firings. For all three parameters, the neural networks were able to accurately predict the data in the validation sets as well as the training set.

An integrate-and-fire model for synchronized bursting in a network of cultured cortical neurons.

PubMed

French, D A; Gruenstein, E I

2006-12-01

It has been suggested that spontaneous synchronous neuronal activity is an essential step in the formation of functional networks in the central nervous system. The key features of this type of activity consist of bursts of action potentials with associated spikes of elevated cytoplasmic calcium. These features are also observed in networks of rat cortical neurons that have been formed in culture. Experimental studies of these cultured networks have led to several hypotheses for the mechanisms underlying the observed synchronized oscillations. In this paper, bursting integrate-and-fire type mathematical models for regular spiking (RS) and intrinsic bursting (IB) neurons are introduced and incorporated through a small-world connection scheme into a two-dimensional excitatory network similar to those in the cultured network. This computer model exhibits spontaneous synchronous activity through mechanisms similar to those hypothesized for the cultured experimental networks. Traces of the membrane potential and cytoplasmic calcium from the model closely match those obtained from experiments. We also consider the impact on network behavior of the IB neurons, the geometry and the small world connection scheme.

A Network Based Theory of Health Systems and Cycles of Well-being

PubMed Central

Rhodes, Michael Grant

2013-01-01

There are two dominant approaches to describe and understand the anatomy of complete health and well-being systems internationally. Yet, neither approach has been able to either predict or explain occasional but dramatic crises in health and well-being systems around the world and in developed emerging market or developing country contexts. As the impacts of such events can be measured not simply in terms of their social and economic consequences but also public health crises, there is a clear need to look for and formulate an alternative approach. This paper examines multi-disciplinary theoretical evidence to suggest that health systems exhibit natural and observable systemic and long cycle characteristics that can be modelled. A health and well-being system model of two slowly evolving anthropological network sub-systems is defined. The first network sub-system consists of organised professional networks of exclusive suppliers of health and well-being services. The second network sub-system consists of communities organising themselves to resource those exclusive services. Together these two network sub-systems interact to form the specific (sovereign) health and well-being systems we know today. But the core of a truly ‘complex adaptive system’ can also be identified and a simplified two sub-system model of recurring Lotka-Volterra predator-prey cycles is specified. The implications of such an adaptive and evolving model of system anatomy for effective public health, social security insurance and well-being systems governance could be considerable. PMID:24596831

Oscillatory network with self-organized dynamical connections for synchronization-based image segmentation.

PubMed

Kuzmina, Margarita; Manykin, Eduard; Surina, Irina

2004-01-01

An oscillatory network of columnar architecture located in 3D spatial lattice was recently designed by the authors as oscillatory model of the brain visual cortex. Single network oscillator is a relaxational neural oscillator with internal dynamics tunable by visual image characteristics - local brightness and elementary bar orientation. It is able to demonstrate either activity state (stable undamped oscillations) or "silence" (quickly damped oscillations). Self-organized nonlocal dynamical connections of oscillators depend on oscillator activity levels and orientations of cortical receptive fields. Network performance consists in transfer into a state of clusterized synchronization. At current stage grey-level image segmentation tasks are carried out by 2D oscillatory network, obtained as a limit version of the source model. Due to supplemented network coupling strength control the 2D reduced network provides synchronization-based image segmentation. New results on segmentation of brightness and texture images presented in the paper demonstrate accurate network performance and informative visualization of segmentation results, inherent in the model.

Modeling the coevolution of topology and traffic on weighted technological networks

NASA Astrophysics Data System (ADS)

Xie, Yan-Bo; Wang, Wen-Xu; Wang, Bing-Hong

2007-02-01

For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.

Adaptive Network Dynamics - Modeling and Control of Time-Dependent Social Contacts

PubMed Central

Schwartz, Ira B.; Shaw, Leah B.; Shkarayev, Maxim S.

2013-01-01

Real networks consisting of social contacts do not possess static connections. That is, social connections may be time dependent due to a variety of individual behavioral decisions based on current network connections. Examples of adaptive networks occur in epidemics, where information about infectious individuals may change the rewiring of healthy people, or in the recruitment of individuals to a cause or fad, where rewiring may optimize recruitment of susceptible individuals. In this paper, we will review some of the dynamical properties of adaptive networks, and show how they predict novel phenomena as well as yield insight into new controls. The applications will be control of epidemic outbreaks and terrorist recruitment modeling. PMID:25414913

Maintaining Consistency of Spatial Information in the Hippocampal Network: A Combinatorial Geometry Model.

PubMed

Dabaghian, Y

2016-06-01

Place cells in the rat hippocampus play a key role in creating the animal's internal representation of the world. During active navigation, these cells spike only in discrete locations, together encoding a map of the environment. Electrophysiological recordings have shown that the animal can revisit this map mentally during both sleep and awake states, reactivating the place cells that fired during its exploration in the same sequence in which they were originally activated. Although consistency of place cell activity during active navigation is arguably enforced by sensory and proprioceptive inputs, it remains unclear how a consistent representation of space can be maintained during spontaneous replay. We propose a model that can account for this phenomenon and suggest that a spatially consistent replay requires a number of constraints on the hippocampal network that affect its synaptic architecture and the statistics of synaptic connection strengths.

Modeling of axonal endoplasmic reticulum network by spastic paraplegia proteins.

PubMed

Yalçın, Belgin; Zhao, Lu; Stofanko, Martin; O'Sullivan, Niamh C; Kang, Zi Han; Roost, Annika; Thomas, Matthew R; Zaessinger, Sophie; Blard, Olivier; Patto, Alex L; Sohail, Anood; Baena, Valentina; Terasaki, Mark; O'Kane, Cahir J

2017-07-25

Axons contain a smooth tubular endoplasmic reticulum (ER) network that is thought to be continuous with ER throughout the neuron; the mechanisms that form this axonal network are unknown. Mutations affecting reticulon or REEP proteins, with intramembrane hairpin domains that model ER membranes, cause an axon degenerative disease, hereditary spastic paraplegia (HSP). We show that Drosophila axons have a dynamic axonal ER network, which these proteins help to model. Loss of HSP hairpin proteins causes ER sheet expansion, partial loss of ER from distal motor axons, and occasional discontinuities in axonal ER. Ultrastructural analysis reveals an extensive ER network in axons, which shows larger and fewer tubules in larvae that lack reticulon and REEP proteins, consistent with loss of membrane curvature. Therefore HSP hairpin-containing proteins are required for shaping and continuity of axonal ER, thus suggesting roles for ER modeling in axon maintenance and function.

Classification of Company Performance using Weighted Probabilistic Neural Network

NASA Astrophysics Data System (ADS)

Yasin, Hasbi; Waridi Basyiruddin Arifin, Adi; Warsito, Budi

2018-05-01

Classification of company performance can be judged by looking at its financial status, whether good or bad state. Classification of company performance can be achieved by some approach, either parametric or non-parametric. Neural Network is one of non-parametric methods. One of Artificial Neural Network (ANN) models is Probabilistic Neural Network (PNN). PNN consists of four layers, i.e. input layer, pattern layer, addition layer, and output layer. The distance function used is the euclidean distance and each class share the same values as their weights. In this study used PNN that has been modified on the weighting process between the pattern layer and the addition layer by involving the calculation of the mahalanobis distance. This model is called the Weighted Probabilistic Neural Network (WPNN). The results show that the company's performance modeling with the WPNN model has a very high accuracy that reaches 100%.

A review of active learning approaches to experimental design for uncovering biological networks

PubMed Central

2017-01-01

Various types of biological knowledge describe networks of interactions among elementary entities. For example, transcriptional regulatory networks consist of interactions among proteins and genes. Current knowledge about the exact structure of such networks is highly incomplete, and laboratory experiments that manipulate the entities involved are conducted to test hypotheses about these networks. In recent years, various automated approaches to experiment selection have been proposed. Many of these approaches can be characterized as active machine learning algorithms. Active learning is an iterative process in which a model is learned from data, hypotheses are generated from the model to propose informative experiments, and the experiments yield new data that is used to update the model. This review describes the various models, experiment selection strategies, validation techniques, and successful applications described in the literature; highlights common themes and notable distinctions among methods; and identifies likely directions of future research and open problems in the area. PMID:28570593

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.

Numerical simulation of coherent resonance in a model network of Rulkov neurons

NASA Astrophysics Data System (ADS)

Andreev, Andrey V.; Runnova, Anastasia E.; Pisarchik, Alexander N.

2018-04-01

In this paper we study the spiking behaviour of a neuronal network consisting of Rulkov elements. We find that the regularity of this behaviour maximizes at a certain level of environment noise. This effect referred to as coherence resonance is demonstrated in a random complex network of Rulkov neurons. An external stimulus added to some of neurons excites them, and then activates other neurons in the network. The network coherence is also maximized at the certain stimulus amplitude.

Likelihood-based gene annotations for gap filling and quality assessment in genome-scale metabolic models

DOE PAGES

Benedict, Matthew N.; Mundy, Michael B.; Henry, Christopher S.; ...

2014-10-16

Genome-scale metabolic models provide a powerful means to harness information from genomes to deepen biological insights. With exponentially increasing sequencing capacity, there is an enormous need for automated reconstruction techniques that can provide more accurate models in a short time frame. Current methods for automated metabolic network reconstruction rely on gene and reaction annotations to build draft metabolic networks and algorithms to fill gaps in these networks. However, automated reconstruction is hampered by database inconsistencies, incorrect annotations, and gap filling largely without considering genomic information. Here we develop an approach for applying genomic information to predict alternative functions for genesmore » and estimate their likelihoods from sequence homology. We show that computed likelihood values were significantly higher for annotations found in manually curated metabolic networks than those that were not. We then apply these alternative functional predictions to estimate reaction likelihoods, which are used in a new gap filling approach called likelihood-based gap filling to predict more genomically consistent solutions. To validate the likelihood-based gap filling approach, we applied it to models where essential pathways were removed, finding that likelihood-based gap filling identified more biologically relevant solutions than parsimony-based gap filling approaches. We also demonstrate that models gap filled using likelihood-based gap filling provide greater coverage and genomic consistency with metabolic gene functions compared to parsimony-based approaches. Interestingly, despite these findings, we found that likelihoods did not significantly affect consistency of gap filled models with Biolog and knockout lethality data. This indicates that the phenotype data alone cannot necessarily be used to discriminate between alternative solutions for gap filling and therefore, that the use of other information is necessary to obtain a more accurate network. All described workflows are implemented as part of the DOE Systems Biology Knowledgebase (KBase) and are publicly available via API or command-line web interface.« less

Likelihood-Based Gene Annotations for Gap Filling and Quality Assessment in Genome-Scale Metabolic Models

PubMed Central

Benedict, Matthew N.; Mundy, Michael B.; Henry, Christopher S.; Chia, Nicholas; Price, Nathan D.

2014-01-01

Genome-scale metabolic models provide a powerful means to harness information from genomes to deepen biological insights. With exponentially increasing sequencing capacity, there is an enormous need for automated reconstruction techniques that can provide more accurate models in a short time frame. Current methods for automated metabolic network reconstruction rely on gene and reaction annotations to build draft metabolic networks and algorithms to fill gaps in these networks. However, automated reconstruction is hampered by database inconsistencies, incorrect annotations, and gap filling largely without considering genomic information. Here we develop an approach for applying genomic information to predict alternative functions for genes and estimate their likelihoods from sequence homology. We show that computed likelihood values were significantly higher for annotations found in manually curated metabolic networks than those that were not. We then apply these alternative functional predictions to estimate reaction likelihoods, which are used in a new gap filling approach called likelihood-based gap filling to predict more genomically consistent solutions. To validate the likelihood-based gap filling approach, we applied it to models where essential pathways were removed, finding that likelihood-based gap filling identified more biologically relevant solutions than parsimony-based gap filling approaches. We also demonstrate that models gap filled using likelihood-based gap filling provide greater coverage and genomic consistency with metabolic gene functions compared to parsimony-based approaches. Interestingly, despite these findings, we found that likelihoods did not significantly affect consistency of gap filled models with Biolog and knockout lethality data. This indicates that the phenotype data alone cannot necessarily be used to discriminate between alternative solutions for gap filling and therefore, that the use of other information is necessary to obtain a more accurate network. All described workflows are implemented as part of the DOE Systems Biology Knowledgebase (KBase) and are publicly available via API or command-line web interface. PMID:25329157

A fusion network for semantic segmentation using RGB-D data

NASA Astrophysics Data System (ADS)

Yuan, Jiahui; Zhang, Kun; Xia, Yifan; Qi, Lin; Dong, Junyu

2018-04-01

Semantic scene parsing is considerable in many intelligent field, including perceptual robotics. For the past few years, pixel-wise prediction tasks like semantic segmentation with RGB images has been extensively studied and has reached very remarkable parsing levels, thanks to convolutional neural networks (CNNs) and large scene datasets. With the development of stereo cameras and RGBD sensors, it is expected that additional depth information will help improving accuracy. In this paper, we propose a semantic segmentation framework incorporating RGB and complementary depth information. Motivated by the success of fully convolutional networks (FCN) in semantic segmentation field, we design a fully convolutional networks consists of two branches which extract features from both RGB and depth data simultaneously and fuse them as the network goes deeper. Instead of aggregating multiple model, our goal is to utilize RGB data and depth data more effectively in a single model. We evaluate our approach on the NYU-Depth V2 dataset, which consists of 1449 cluttered indoor scenes, and achieve competitive results with the state-of-the-art methods.

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

Harris, J. Austin; Hix, W. Raphael; Chertkow, Merek A.

In this paper, we investigate core-collapse supernova (CCSN) nucleosynthesis with self-consistent, axisymmetric (2D) simulations performed using the neutrino hydrodynamics code Chimera. Computational costs have traditionally constrained the evolution of the nuclear composition within multidimensional CCSN models to, at best, a 14-species α-network capable of tracking onlymore » $$(\\alpha ,\\gamma )$$ reactions from 4He to 60Zn. Such a simplified network limits the ability to accurately evolve detailed composition and neutronization or calculate the nuclear energy generation rate. Lagrangian tracer particles are commonly used to extend the nuclear network evolution by incorporating more realistic networks into post-processing nucleosynthesis calculations. However, limitations such as poor spatial resolution of the tracer particles; inconsistent thermodynamic evolution, including misestimation of expansion timescales; and uncertain determination of the multidimensional mass cut at the end of the simulation impose uncertainties inherent to this approach. Finally, we present a detailed analysis of the impact of such uncertainties for four self-consistent axisymmetric CCSN models initiated from solar-metallicity, nonrotating progenitors of 12, 15, 20, and 25 $${M}_{\\odot }$$ and evolved with the smaller α-network to more than 1 s after the launch of an explosion.« less

Hybrid modeling and empirical analysis of automobile supply chain network

NASA Astrophysics Data System (ADS)

Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying

2017-05-01

Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.

A Hybrid 3D Indoor Space Model

NASA Astrophysics Data System (ADS)

Jamali, Ali; Rahman, Alias Abdul; Boguslawski, Pawel

2016-10-01

GIS integrates spatial information and spatial analysis. An important example of such integration is for emergency response which requires route planning inside and outside of a building. Route planning requires detailed information related to indoor and outdoor environment. Indoor navigation network models including Geometric Network Model (GNM), Navigable Space Model, sub-division model and regular-grid model lack indoor data sources and abstraction methods. In this paper, a hybrid indoor space model is proposed. In the proposed method, 3D modeling of indoor navigation network is based on surveying control points and it is less dependent on the 3D geometrical building model. This research proposes a method of indoor space modeling for the buildings which do not have proper 2D/3D geometrical models or they lack semantic or topological information. The proposed hybrid model consists of topological, geometrical and semantical space.

Human connectome module pattern detection using a new multi-graph MinMax cut model.

PubMed

De, Wang; Wang, Yang; Nie, Feiping; Yan, Jingwen; Cai, Weidong; Saykin, Andrew J; Shen, Li; Huang, Heng

2014-01-01

Many recent scientific efforts have been devoted to constructing the human connectome using Diffusion Tensor Imaging (DTI) data for understanding the large-scale brain networks that underlie higher-level cognition in human. However, suitable computational network analysis tools are still lacking in human connectome research. To address this problem, we propose a novel multi-graph min-max cut model to detect the consistent network modules from the brain connectivity networks of all studied subjects. A new multi-graph MinMax cut model is introduced to solve this challenging computational neuroscience problem and the efficient optimization algorithm is derived. In the identified connectome module patterns, each network module shows similar connectivity patterns in all subjects, which potentially associate to specific brain functions shared by all subjects. We validate our method by analyzing the weighted fiber connectivity networks. The promising empirical results demonstrate the effectiveness of our method.

Multiple tipping points and optimal repairing in interacting networks

PubMed Central

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

2016-01-01

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

Introduction of a new laboratory test: an econometric approach with the use of neural network analysis.

PubMed

Jabor, A; Vlk, T; Boril, P

1996-04-15

We designed a simulation model for the assessment of the financial risks involved when a new diagnostic test is introduced in the laboratory. The model is based on a neural network consisting of ten neurons and assumes that input entities can have assigned appropriate uncertainty. Simulations are done on a 1-day interval basis. Risk analysis completes the model and the financial effects are evaluated for a selected time period. The basic output of the simulation consists of total expenses and income during the simulation time, net present value of the project at the end of simulation, total number of control samples during simulation, total number of patients evaluated and total number of used kits.

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

NASA Technical Reports Server (NTRS)

Zander, Carol S.

1988-01-01

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

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

PubMed

Astakhov, Vadim

2009-01-01

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

Analysis and Modeling of DIII-D Experiments With OMFIT and Neural Networks

NASA Astrophysics Data System (ADS)

Meneghini, O.; Luna, C.; Smith, S. P.; Lao, L. L.; GA Theory Team

2013-10-01

The OMFIT integrated modeling framework is designed to facilitate experimental data analysis and enable integrated simulations. This talk introduces this framework and presents a selection of its applications to the DIII-D experiment. Examples include kinetic equilibrium reconstruction analysis; evaluation of MHD stability in the core and in the edge; and self-consistent predictive steady-state transport modeling. The OMFIT framework also provides the platform for an innovative approach based on neural networks to predict electron and ion energy fluxes. In our study a multi-layer feed-forward back-propagation neural network is built and trained over a database of DIII-D data. It is found that given the same parameters that the highest fidelity models use, the neural network model is able to predict to a large degree the heat transport profiles observed in the DIII-D experiments. Once the network is built, the numerical cost of evaluating the transport coefficients is virtually nonexistent, thus making the neural network model particularly well suited for plasma control and quick exploration of operational scenarios. The implementation of the neural network model and benchmark with experimental results and gyro-kinetic models will be discussed. Work supported in part by the US DOE under DE-FG02-95ER54309.

Deffuant model of opinion formation in one-dimensional multiplex networks

NASA Astrophysics Data System (ADS)

Shang, Yilun

2015-10-01

Complex systems in the real world often operate through multiple kinds of links connecting their constituents. In this paper we propose an opinion formation model under bounded confidence over multiplex networks, consisting of edges at different topological and temporal scales. We determine rigorously the critical confidence threshold by exploiting probability theory and network science when the nodes are arranged on the integers, {{Z}}, evolving in continuous time. It is found that the existence of ‘multiplexity’ impedes the convergence, and that working with the aggregated or summarized simplex network is inaccurate since it misses vital information. Analytical calculations are confirmed by extensive numerical simulations.

Epidemics and dimensionality in hierarchical networks

NASA Astrophysics Data System (ADS)

Zheng, Da-Fang; Hui, P. M.; Trimper, Steffen; Zheng, Bo

2005-07-01

Epidemiological processes are studied within a recently proposed hierarchical network model using the susceptible-infected-refractory dynamics of an epidemic. Within the network model, a population may be characterized by H independent hierarchies or dimensions, each of which consists of groupings of individuals into layers of subgroups. Detailed numerical simulations reveal that for H>1, global spreading results regardless of the degree of homophily of the individuals forming a social circle. For H=1, a transition from global to local spread occurs as the population becomes decomposed into increasingly homophilous groups. Multiple dimensions in classifying individuals (nodes) thus make a society (computer network) highly susceptible to large-scale outbreaks of infectious diseases (viruses).

Social Protocols for Agile Virtual Teams

NASA Astrophysics Data System (ADS)

Picard, Willy

Despite many works on collaborative networked organizations (CNOs), CSCW, groupware, workflow systems and social networks, computer support for virtual teams is still insufficient, especially support for agility, i.e. the capability of virtual team members to rapidly and cost efficiently adapt the way they interact to changes. In this paper, requirements for computer support for agile virtual teams are presented. Next, an extension of the concept of social protocol is proposed as a novel model supporting agile interactions within virtual teams. The extended concept of social protocol consists of an extended social network and a workflow model.

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

PubMed

Xia, Kelin

2018-05-16

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

redGEM: Systematic reduction and analysis of genome-scale metabolic reconstructions for development of consistent core metabolic models

PubMed Central

Ataman, Meric

2017-01-01

Genome-scale metabolic reconstructions have proven to be valuable resources in enhancing our understanding of metabolic networks as they encapsulate all known metabolic capabilities of the organisms from genes to proteins to their functions. However the complexity of these large metabolic networks often hinders their utility in various practical applications. Although reduced models are commonly used for modeling and in integrating experimental data, they are often inconsistent across different studies and laboratories due to different criteria and detail, which can compromise transferability of the findings and also integration of experimental data from different groups. In this study, we have developed a systematic semi-automatic approach to reduce genome-scale models into core models in a consistent and logical manner focusing on the central metabolism or subsystems of interest. The method minimizes the loss of information using an approach that combines graph-based search and optimization methods. The resulting core models are shown to be able to capture key properties of the genome-scale models and preserve consistency in terms of biomass and by-product yields, flux and concentration variability and gene essentiality. The development of these “consistently-reduced” models will help to clarify and facilitate integration of different experimental data to draw new understanding that can be directly extendable to genome-scale models. PMID:28727725

Analysis of Network Topologies Underlying Ethylene Growth Response Kinetics

PubMed Central

Prescott, Aaron M.; McCollough, Forest W.; Eldreth, Bryan L.; Binder, Brad M.; Abel, Steven M.

2016-01-01

Most models for ethylene signaling involve a linear pathway. However, measurements of seedling growth kinetics when ethylene is applied and removed have resulted in more complex network models that include coherent feedforward, negative feedback, and positive feedback motifs. The dynamical responses of the proposed networks have not been explored in a quantitative manner. Here, we explore (i) whether any of the proposed models are capable of producing growth-response behaviors consistent with experimental observations and (ii) what mechanistic roles various parts of the network topologies play in ethylene signaling. To address this, we used computational methods to explore two general network topologies: The first contains a coherent feedforward loop that inhibits growth and a negative feedback from growth onto itself (CFF/NFB). In the second, ethylene promotes the cleavage of EIN2, with the product of the cleavage inhibiting growth and promoting the production of EIN2 through a positive feedback loop (PFB). Since few network parameters for ethylene signaling are known in detail, we used an evolutionary algorithm to explore sets of parameters that produce behaviors similar to experimental growth response kinetics of both wildtype and mutant seedlings. We generated a library of parameter sets by independently running the evolutionary algorithm many times. Both network topologies produce behavior consistent with experimental observations, and analysis of the parameter sets allows us to identify important network interactions and parameter constraints. We additionally screened these parameter sets for growth recovery in the presence of sub-saturating ethylene doses, which is an experimentally-observed property that emerges in some of the evolved parameter sets. Finally, we probed simplified networks maintaining key features of the CFF/NFB and PFB topologies. From this, we verified observations drawn from the larger networks about mechanisms underlying ethylene signaling. Analysis of each network topology results in predictions about changes that occur in network components that can be experimentally tested to give insights into which, if either, network underlies ethylene responses. PMID:27625669

Modeling the Metabolism of Arabidopsis thaliana: Application of Network Decomposition and Network Reduction in the Context of Petri Nets.

PubMed

Koch, Ina; Nöthen, Joachim; Schleiff, Enrico

2017-01-01

Motivation: Arabidopsis thaliana is a well-established model system for the analysis of the basic physiological and metabolic pathways of plants. Nevertheless, the system is not yet fully understood, although many mechanisms are described, and information for many processes exists. However, the combination and interpretation of the large amount of biological data remain a big challenge, not only because data sets for metabolic paths are still incomplete. Moreover, they are often inconsistent, because they are coming from different experiments of various scales, regarding, for example, accuracy and/or significance. Here, theoretical modeling is powerful to formulate hypotheses for pathways and the dynamics of the metabolism, even if the biological data are incomplete. To develop reliable mathematical models they have to be proven for consistency. This is still a challenging task because many verification techniques fail already for middle-sized models. Consequently, new methods, like decomposition methods or reduction approaches, are developed to circumvent this problem. Methods: We present a new semi-quantitative mathematical model of the metabolism of Arabidopsis thaliana . We used the Petri net formalism to express the complex reaction system in a mathematically unique manner. To verify the model for correctness and consistency we applied concepts of network decomposition and network reduction such as transition invariants, common transition pairs, and invariant transition pairs. Results: We formulated the core metabolism of Arabidopsis thaliana based on recent knowledge from literature, including the Calvin cycle, glycolysis and citric acid cycle, glyoxylate cycle, urea cycle, sucrose synthesis, and the starch metabolism. By applying network decomposition and reduction techniques at steady-state conditions, we suggest a straightforward mathematical modeling process. We demonstrate that potential steady-state pathways exist, which provide the fixed carbon to nearly all parts of the network, especially to the citric acid cycle. There is a close cooperation of important metabolic pathways, e.g., the de novo synthesis of uridine-5-monophosphate, the γ-aminobutyric acid shunt, and the urea cycle. The presented approach extends the established methods for a feasible interpretation of biological network models, in particular of large and complex models.

Modeling the Metabolism of Arabidopsis thaliana: Application of Network Decomposition and Network Reduction in the Context of Petri Nets

PubMed Central

Koch, Ina; Nöthen, Joachim; Schleiff, Enrico

2017-01-01

Motivation: Arabidopsis thaliana is a well-established model system for the analysis of the basic physiological and metabolic pathways of plants. Nevertheless, the system is not yet fully understood, although many mechanisms are described, and information for many processes exists. However, the combination and interpretation of the large amount of biological data remain a big challenge, not only because data sets for metabolic paths are still incomplete. Moreover, they are often inconsistent, because they are coming from different experiments of various scales, regarding, for example, accuracy and/or significance. Here, theoretical modeling is powerful to formulate hypotheses for pathways and the dynamics of the metabolism, even if the biological data are incomplete. To develop reliable mathematical models they have to be proven for consistency. This is still a challenging task because many verification techniques fail already for middle-sized models. Consequently, new methods, like decomposition methods or reduction approaches, are developed to circumvent this problem. Methods: We present a new semi-quantitative mathematical model of the metabolism of Arabidopsis thaliana. We used the Petri net formalism to express the complex reaction system in a mathematically unique manner. To verify the model for correctness and consistency we applied concepts of network decomposition and network reduction such as transition invariants, common transition pairs, and invariant transition pairs. Results: We formulated the core metabolism of Arabidopsis thaliana based on recent knowledge from literature, including the Calvin cycle, glycolysis and citric acid cycle, glyoxylate cycle, urea cycle, sucrose synthesis, and the starch metabolism. By applying network decomposition and reduction techniques at steady-state conditions, we suggest a straightforward mathematical modeling process. We demonstrate that potential steady-state pathways exist, which provide the fixed carbon to nearly all parts of the network, especially to the citric acid cycle. There is a close cooperation of important metabolic pathways, e.g., the de novo synthesis of uridine-5-monophosphate, the γ-aminobutyric acid shunt, and the urea cycle. The presented approach extends the established methods for a feasible interpretation of biological network models, in particular of large and complex models. PMID:28713420

A selection model for accounting for publication bias in a full network meta-analysis.

PubMed

Mavridis, Dimitris; Welton, Nicky J; Sutton, Alex; Salanti, Georgia

2014-12-30

Copas and Shi suggested a selection model to explore the potential impact of publication bias via sensitivity analysis based on assumptions for the probability of publication of trials conditional on the precision of their results. Chootrakool et al. extended this model to three-arm trials but did not fully account for the implications of the consistency assumption, and their model is difficult to generalize for complex network structures with more than three treatments. Fitting these selection models within a frequentist setting requires maximization of a complex likelihood function, and identification problems are common. We have previously presented a Bayesian implementation of the selection model when multiple treatments are compared with a common reference treatment. We now present a general model suitable for complex, full network meta-analysis that accounts for consistency when adjusting results for publication bias. We developed a design-by-treatment selection model to describe the mechanism by which studies with different designs (sets of treatments compared in a trial) and precision may be selected for publication. We fit the model in a Bayesian setting because it avoids the numerical problems encountered in the frequentist setting, it is generalizable with respect to the number of treatments and study arms, and it provides a flexible framework for sensitivity analysis using external knowledge. Our model accounts for the additional uncertainty arising from publication bias more successfully compared to the standard Copas model or its previous extensions. We illustrate the methodology using a published triangular network for the failure of vascular graft or arterial patency. Copyright © 2014 John Wiley & Sons, Ltd.

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.

Study of mobile satellite network based on GEO/LEO satellite constellation

NASA Astrophysics Data System (ADS)

Hu, Xiulin; Zeng, Yujiang; Wang, Ying; Wang, Xianhui

2005-11-01

Mobile satellite network with Inter Satellite Links (ISLs), which consists of non-geostationary satellites, has the characteristic of network topology's variability. This is a great challenge to the design and management of mobile satellite network. This paper analyzes the characteristics of mobile satellite network, takes multimedia Quality of Service (QoS) as the chief object and presents a reference model based on Geostationary Earth Orbit (GEO)/ Low Earth Orbit (LEO) satellite constellation which adapts to the design and management of mobile satellite network. In the reference model, LEO satellites constitute service subnet with responsibility for the access, transmission and switch of the multimedia services for mobile users, while GEO satellites constitute management subnet taking on the centralized management to service subnet. Additionally ground control centre realizes the whole monitoring and control via management subnet. Comparing with terrestrial network, the above reference model physically separates management subnet from service subnet, which not only enhances the advantage of centralized management but also overcomes the shortcoming of low reliability in terrestrial network. Routing of mobile satellite network based on GEO/LEO satellite constellation is also discussed in this paper.

A Network-Individual-Resource Model for HIV Prevention

PubMed Central

Johnson, Blair T.; Redding, Colleen A.; DiClemente, Ralph J.; Mustanski, Brian S.; Dodge, Brian M.; Sheeran, Paschal; Warren, Michelle R.; Zimmerman, Rick S.; Fisher, William A.; Conner, Mark T.; Carey, Michael P.; Fisher, Jeffrey D.; Stall, Ronald D.; Fishbein, Martin

2014-01-01

HIV is transmitted through dyadic exchanges of individuals linked in transitory or permanent networks of varying sizes. To optimize prevention efficacy, a complementary theoretical perspective that bridges key individual level elements with important network elements can be a foundation for developing and implementing HIV interventions with outcomes that are more sustainable over time and have greater dissemination potential. Toward that end, we introduce a Network-Individual-Resource (NIR) model for HIV prevention that recognizes how exchanges of resources between individuals and their networks underlies and sustains HIV-risk behaviors. Individual behavior change for HIV prevention, then, may be dependent on increasing the supportiveness of that individual's relevant networks for such change. Among other implications, an NIR model predicts that the success of prevention efforts depends on whether the prevention efforts (1) prompt behavior changes that can be sustained by the resources the individual or their networks possess; (2) meet individual and network needs and are consistent with the individual's current situation/developmental stage; (3) are trusted and valued; and (4) target high HIV-prevalence networks. PMID:20862606

Constitutive modelling of composite biopolymer networks.

PubMed

Fallqvist, B; Kroon, M

2016-04-21

The mechanical behaviour of biopolymer networks is to a large extent determined at a microstructural level where the characteristics of individual filaments and the interactions between them determine the response at a macroscopic level. Phenomena such as viscoelasticity and strain-hardening followed by strain-softening are observed experimentally in these networks, often due to microstructural changes (such as filament sliding, rupture and cross-link debonding). Further, composite structures can also be formed with vastly different mechanical properties as compared to the individual networks. In this present paper, we present a constitutive model presented in a continuum framework aimed at capturing these effects. Special care is taken to formulate thermodynamically consistent evolution laws for dissipative effects. This model, incorporating possible anisotropic network properties, is based on a strain energy function, split into an isochoric and a volumetric part. Generalisation to three dimensions is performed by numerical integration over the unit sphere. Model predictions indicate that the constitutive model is well able to predict the elastic and viscoelastic response of biological networks, and to an extent also composite structures. Copyright © 2016 Elsevier Ltd. All rights reserved.

Combining inferred regulatory and reconstructed metabolic networks enhances phenotype prediction in yeast.

PubMed

Wang, Zhuo; Danziger, Samuel A; Heavner, Benjamin D; Ma, Shuyi; Smith, Jennifer J; Li, Song; Herricks, Thurston; Simeonidis, Evangelos; Baliga, Nitin S; Aitchison, John D; Price, Nathan D

2017-05-01

Gene regulatory and metabolic network models have been used successfully in many organisms, but inherent differences between them make networks difficult to integrate. Probabilistic Regulation Of Metabolism (PROM) provides a partial solution, but it does not incorporate network inference and underperforms in eukaryotes. We present an Integrated Deduced And Metabolism (IDREAM) method that combines statistically inferred Environment and Gene Regulatory Influence Network (EGRIN) models with the PROM framework to create enhanced metabolic-regulatory network models. We used IDREAM to predict phenotypes and genetic interactions between transcription factors and genes encoding metabolic activities in the eukaryote, Saccharomyces cerevisiae. IDREAM models contain many fewer interactions than PROM and yet produce significantly more accurate growth predictions. IDREAM consistently outperformed PROM using any of three popular yeast metabolic models and across three experimental growth conditions. Importantly, IDREAM's enhanced accuracy makes it possible to identify subtle synthetic growth defects. With experimental validation, these novel genetic interactions involving the pyruvate dehydrogenase complex suggested a new role for fatty acid-responsive factor Oaf1 in regulating acetyl-CoA production in glucose grown cells.

Dynamic social networks based on movement

USGS Publications Warehouse

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

2016-01-01

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

Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks

PubMed Central

2011-01-01

Background Network inference methods reconstruct mathematical models of molecular or genetic networks directly from experimental data sets. We have previously reported a mathematical method which is exclusively data-driven, does not involve any heuristic decisions within the reconstruction process, and deliveres all possible alternative minimal networks in terms of simple place/transition Petri nets that are consistent with a given discrete time series data set. Results We fundamentally extended the previously published algorithm to consider catalysis and inhibition of the reactions that occur in the underlying network. The results of the reconstruction algorithm are encoded in the form of an extended Petri net involving control arcs. This allows the consideration of processes involving mass flow and/or regulatory interactions. As a non-trivial test case, the phosphate regulatory network of enterobacteria was reconstructed using in silico-generated time-series data sets on wild-type and in silico mutants. Conclusions The new exact algorithm reconstructs extended Petri nets from time series data sets by finding all alternative minimal networks that are consistent with the data. It suggested alternative molecular mechanisms for certain reactions in the network. The algorithm is useful to combine data from wild-type and mutant cells and may potentially integrate physiological, biochemical, pharmacological, and genetic data in the form of a single model. PMID:21762503

Gaussian Graphical Models Identify Networks of Dietary Intake in a German Adult Population.

PubMed

Iqbal, Khalid; Buijsse, Brian; Wirth, Janine; Schulze, Matthias B; Floegel, Anna; Boeing, Heiner

2016-03-01

Data-reduction methods such as principal component analysis are often used to derive dietary patterns. However, such methods do not assess how foods are consumed in relation to each other. Gaussian graphical models (GGMs) are a set of novel methods that can address this issue. We sought to apply GGMs to derive sex-specific dietary intake networks representing consumption patterns in a German adult population. Dietary intake data from 10,780 men and 16,340 women of the European Prospective Investigation into Cancer and Nutrition (EPIC)-Potsdam cohort were cross-sectionally analyzed to construct dietary intake networks. Food intake for each participant was estimated using a 148-item food-frequency questionnaire that captured the intake of 49 food groups. GGMs were applied to log-transformed intakes (grams per day) of 49 food groups to construct sex-specific food networks. Semiparametric Gaussian copula graphical models (SGCGMs) were used to confirm GGM results. In men, GGMs identified 1 major dietary network that consisted of intakes of red meat, processed meat, cooked vegetables, sauces, potatoes, cabbage, poultry, legumes, mushrooms, soup, and whole-grain and refined breads. For women, a similar network was identified with the addition of fried potatoes. Other identified networks consisted of dairy products and sweet food groups. SGCGMs yielded results comparable to those of GGMs. GGMs are a powerful exploratory method that can be used to construct dietary networks representing dietary intake patterns that reveal how foods are consumed in relation to each other. GGMs indicated an apparent major role of red meat intake in a consumption pattern in the studied population. In the future, identified networks might be transformed into pattern scores for investigating their associations with health outcomes. © 2016 American Society for Nutrition.

Bayesian network modelling of upper gastrointestinal bleeding

NASA Astrophysics Data System (ADS)

Aisha, Nazziwa; Shohaimi, Shamarina; Adam, Mohd Bakri

2013-09-01

Bayesian networks are graphical probabilistic models that represent causal and other relationships between domain variables. In the context of medical decision making, these models have been explored to help in medical diagnosis and prognosis. In this paper, we discuss the Bayesian network formalism in building medical support systems and we learn a tree augmented naive Bayes Network (TAN) from gastrointestinal bleeding data. The accuracy of the TAN in classifying the source of gastrointestinal bleeding into upper or lower source is obtained. The TAN achieves a high classification accuracy of 86% and an area under curve of 92%. A sensitivity analysis of the model shows relatively high levels of entropy reduction for color of the stool, history of gastrointestinal bleeding, consistency and the ratio of blood urea nitrogen to creatinine. The TAN facilitates the identification of the source of GIB and requires further validation.

Comment on "Asymmetric coevolutionary networks facilitate biodiversity maintenance"

USGS Publications Warehouse

Holland, J. Nathaniel; Okuyama, Toshinori; DeAngelis, Donald L.

2006-01-01

Bascompte et al. (Reports, 21 April 2006, p. 431) used network asymmetries to explain mathematical conditions necessary for stability in historic models of mutualism. The Lotka-Volterra equations they used artificially created conditions in which some factor, such as asymmetric interaction strengths, is necessary for community coexistence. We show that a more realistic model incorporating nonlinear functional responses requires no such condition and is consistent with their data.

Maintaining the confidentiality of plot locations by exploiting the low sensitivity of forest structure models to different spectral extraction kernels

Treesearch

Sean P. Healey; Elizabeth Lapoint; Gretchen G. Moisen; Scott L. Powell

2011-01-01

The United States Forest Service Forest Inventory and Analysis (FIA) unit maintains a large national network of inventory plots.While the consistency and extent of this network make FIA data attractive for ecological modelling, the FIA is charged by statute not to publicly reveal inventory plot locations. However, use of FIA plot data by the remote sensing community...

Non-invasive continuous blood pressure measurement based on mean impact value method, BP neural network, and genetic algorithm.

PubMed

Tan, Xia; Ji, Zhong; Zhang, Yadan

2018-04-25

Non-invasive continuous blood pressure monitoring can provide an important reference and guidance for doctors wishing to analyze the physiological and pathological status of patients and to prevent and diagnose cardiovascular diseases in the clinical setting. Therefore, it is very important to explore a more accurate method of non-invasive continuous blood pressure measurement. To address the shortcomings of existing blood pressure measurement models based on pulse wave transit time or pulse wave parameters, a new method of non-invasive continuous blood pressure measurement - the GA-MIV-BP neural network model - is presented. The mean impact value (MIV) method is used to select the factors that greatly influence blood pressure from the extracted pulse wave transit time and pulse wave parameters. These factors are used as inputs, and the actual blood pressure values as outputs, to train the BP neural network model. The individual parameters are then optimized using a genetic algorithm (GA) to establish the GA-MIV-BP neural network model. Bland-Altman consistency analysis indicated that the measured and predicted blood pressure values were consistent and interchangeable. Therefore, this algorithm is of great significance to promote the clinical application of a non-invasive continuous blood pressure monitoring method.

Neural Schematics as a unified formal graphical representation of large-scale Neural Network Structures.

PubMed

Ehrlich, Matthias; Schüffny, René

2013-01-01

One of the major outcomes of neuroscientific research are models of Neural Network Structures (NNSs). Descriptions of these models usually consist of a non-standardized mixture of text, figures, and other means of visual information communication in print media. However, as neuroscience is an interdisciplinary domain by nature, a standardized way of consistently representing models of NNSs is required. While generic descriptions of such models in textual form have recently been developed, a formalized way of schematically expressing them does not exist to date. Hence, in this paper we present Neural Schematics as a concept inspired by similar approaches from other disciplines for a generic two dimensional representation of said structures. After introducing NNSs in general, a set of current visualizations of models of NNSs is reviewed and analyzed for what information they convey and how their elements are rendered. This analysis then allows for the definition of general items and symbols to consistently represent these models as Neural Schematics on a two dimensional plane. We will illustrate the possibilities an agreed upon standard can yield on sampled diagrams transformed into Neural Schematics and an example application for the design and modeling of large-scale NNSs.

A Mathematical Model to study the Dynamics of Epithelial Cellular Networks

PubMed Central

Abate, Alessandro; Vincent, Stéphane; Dobbe, Roel; Silletti, Alberto; Master, Neal; Axelrod, Jeffrey D.; Tomlin, Claire J.

2013-01-01

Epithelia are sheets of connected cells that are essential across the animal kingdom. Experimental observations suggest that the dynamical behavior of many single-layered epithelial tissues has strong analogies with that of specific mechanical systems, namely large networks consisting of point masses connected through spring-damper elements and undergoing the influence of active and dissipating forces. Based on this analogy, this work develops a modeling framework to enable the study of the mechanical properties and of the dynamic behavior of large epithelial cellular networks. The model is built first by creating a network topology that is extracted from the actual cellular geometry as obtained from experiments, then by associating a mechanical structure and dynamics to the network via spring-damper elements. This scalable approach enables running simulations of large network dynamics: the derived modeling framework in particular is predisposed to be tailored to study general dynamics (for example, morphogenesis) of various classes of single-layered epithelial cellular networks. In this contribution we test the model on a case study of the dorsal epithelium of the Drosophila melanogaster embryo during early dorsal closure (and, less conspicuously, germband retraction). PMID:23221083

Elements of Engagement: A Model of Teacher Interactions via Professional Learning Networks

ERIC Educational Resources Information Center

Krutka, Daniel G.; Carpenter, Jeffrey P.; Trust, Torrey

2016-01-01

In recent years, many educators have turned to participatory online affinity spaces for professional growth with peers who are more accessible because of reduced temporal and spatial constraints. Specifically, professional learning networks (PLNs) are "uniquely personalized, complex systems of interactions consisting of people, resources, and…

Effective Network Size Predicted From Simulations of Pathogen Outbreaks Through Social Networks Provides a Novel Measure of Structure-Standardized Group Size.

PubMed

McCabe, Collin M; Nunn, Charles L

2018-01-01

The transmission of infectious disease through a population is often modeled assuming that interactions occur randomly in groups, with all individuals potentially interacting with all other individuals at an equal rate. However, it is well known that pairs of individuals vary in their degree of contact. Here, we propose a measure to account for such heterogeneity: effective network size (ENS), which refers to the size of a maximally complete network (i.e., unstructured, where all individuals interact with all others equally) that corresponds to the outbreak characteristics of a given heterogeneous, structured network. We simulated susceptible-infected (SI) and susceptible-infected-recovered (SIR) models on maximally complete networks to produce idealized outbreak duration distributions for a disease on a network of a given size. We also simulated the transmission of these same diseases on random structured networks and then used the resulting outbreak duration distributions to predict the ENS for the group or population. We provide the methods to reproduce these analyses in a public R package, "enss." Outbreak durations of simulations on randomly structured networks were more variable than those on complete networks, but tended to have similar mean durations of disease spread. We then applied our novel metric to empirical primate networks taken from the literature and compared the information represented by our ENSs to that by other established social network metrics. In AICc model comparison frameworks, group size and mean distance proved to be the metrics most consistently associated with ENS for SI simulations, while group size, centralization, and modularity were most consistently associated with ENS for SIR simulations. In all cases, ENS was shown to be associated with at least two other independent metrics, supporting its use as a novel metric. Overall, our study provides a proof of concept for simulation-based approaches toward constructing metrics of ENS, while also revealing the conditions under which this approach is most promising.

Single- and two-phase flow in microfluidic porous media analogs based on Voronoi tessellation

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

Wu, Mengjie; Xiao, Feng; Johnson-Paben, Rebecca

2012-01-01

The objective of this study was to create a microfluidic model of complex porous media for studying single and multiphase flows. Most experimental porous media models consist of periodic geometries that lend themselves to comparison with well-developed theoretical predictions. However, most real porous media such as geological formations and biological tissues contain a degree of randomness and complexity that is not adequately represented in periodic geometries. To design an experimental tool to study these complex geometries, we created microfluidic models of random homogeneous and heterogeneous networks based on Voronoi tessellations. These networks consisted of approximately 600 grains separated by amore » highly connected network of channels with an overall porosity of 0.11 0.20. We found that introducing heterogeneities in the form of large cavities within the network changed the permeability in a way that cannot be predicted by the classical porosity-permeability relationship known as the Kozeny equation. The values of permeability found in experiments were in excellent agreement with those calculated from three-dimensional lattice Boltzmann simulations. In two-phase flow experiments of oil displacement with water we found that the surface energy of channel walls determined the pattern of water invasion, while the network topology determined the residual oil saturation. These results suggest that complex network topologies lead to fluid flow behavior that is difficult to predict based solely on porosity. The microfluidic models developed in this study using a novel geometry generation algorithm based on Voronoi tessellation are a new experimental tool for studying fluid and solute transport problems within complex porous media.« less

A cognitive-consistency based model of population wide attitude change.

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

Lakkaraju, Kiran; Speed, Ann Elizabeth

Attitudes play a significant role in determining how individuals process information and behave. In this paper we have developed a new computational model of population wide attitude change that captures the social level: how individuals interact and communicate information, and the cognitive level: how attitudes and concept interact with each other. The model captures the cognitive aspect by representing each individuals as a parallel constraint satisfaction network. The dynamics of this model are explored through a simple attitude change experiment where we vary the social network and distribution of attitudes in a population.

The SLH framework for modeling quantum input-output networks

DOE PAGES

Combes, Joshua; Kerckhoff, Joseph; Sarovar, Mohan

2017-09-04

Here, many emerging quantum technologies demand precise engineering and control over networks consisting of quantum mechanical degrees of freedom connected by propagating electromagnetic fields, or quantum input-output networks. Here we review recent progress in theory and experiment related to such quantum input-output networks, with a focus on the SLH framework, a powerful modeling framework for networked quantum systems that is naturally endowed with properties such as modularity and hierarchy. We begin by explaining the physical approximations required to represent any individual node of a network, e.g. atoms in cavity or a mechanical oscillator, and its coupling to quantum fields bymore » an operator triple ( S,L,H). Then we explain how these nodes can be composed into a network with arbitrary connectivity, including coherent feedback channels, using algebraic rules, and how to derive the dynamics of network components and output fields. The second part of the review discusses several extensions to the basic SLH framework that expand its modeling capabilities, and the prospects for modeling integrated implementations of quantum input-output networks. In addition to summarizing major results and recent literature, we discuss the potential applications and limitations of the SLH framework and quantum input-output networks, with the intention of providing context to a reader unfamiliar with the field.« less

The SLH framework for modeling quantum input-output networks

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

Combes, Joshua; Kerckhoff, Joseph; Sarovar, Mohan

Here, many emerging quantum technologies demand precise engineering and control over networks consisting of quantum mechanical degrees of freedom connected by propagating electromagnetic fields, or quantum input-output networks. Here we review recent progress in theory and experiment related to such quantum input-output networks, with a focus on the SLH framework, a powerful modeling framework for networked quantum systems that is naturally endowed with properties such as modularity and hierarchy. We begin by explaining the physical approximations required to represent any individual node of a network, e.g. atoms in cavity or a mechanical oscillator, and its coupling to quantum fields bymore » an operator triple ( S,L,H). Then we explain how these nodes can be composed into a network with arbitrary connectivity, including coherent feedback channels, using algebraic rules, and how to derive the dynamics of network components and output fields. The second part of the review discusses several extensions to the basic SLH framework that expand its modeling capabilities, and the prospects for modeling integrated implementations of quantum input-output networks. In addition to summarizing major results and recent literature, we discuss the potential applications and limitations of the SLH framework and quantum input-output networks, with the intention of providing context to a reader unfamiliar with the field.« less

Model based inference from microvascular measurements: Combining experimental measurements and model predictions using a Bayesian probabilistic approach

PubMed Central

Rasmussen, Peter M.; Smith, Amy F.; Sakadžić, Sava; Boas, David A.; Pries, Axel R.; Secomb, Timothy W.; Østergaard, Leif

2017-01-01

Objective In vivo imaging of the microcirculation and network-oriented modeling have emerged as powerful means of studying microvascular function and understanding its physiological significance. Network-oriented modeling may provide the means of summarizing vast amounts of data produced by high-throughput imaging techniques in terms of key, physiological indices. To estimate such indices with sufficient certainty, however, network-oriented analysis must be robust to the inevitable presence of uncertainty due to measurement errors as well as model errors. Methods We propose the Bayesian probabilistic data analysis framework as a means of integrating experimental measurements and network model simulations into a combined and statistically coherent analysis. The framework naturally handles noisy measurements and provides posterior distributions of model parameters as well as physiological indices associated with uncertainty. Results We applied the analysis framework to experimental data from three rat mesentery networks and one mouse brain cortex network. We inferred distributions for more than five hundred unknown pressure and hematocrit boundary conditions. Model predictions were consistent with previous analyses, and remained robust when measurements were omitted from model calibration. Conclusion Our Bayesian probabilistic approach may be suitable for optimizing data acquisition and for analyzing and reporting large datasets acquired as part of microvascular imaging studies. PMID:27987383

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.

Detection of generalized synchronization using echo state networks

NASA Astrophysics Data System (ADS)

Ibáñez-Soria, D.; Garcia-Ojalvo, J.; Soria-Frisch, A.; Ruffini, G.

2018-03-01

Generalized synchronization between coupled dynamical systems is a phenomenon of relevance in applications that range from secure communications to physiological modelling. Here, we test the capabilities of reservoir computing and, in particular, echo state networks for the detection of generalized synchronization. A nonlinear dynamical system consisting of two coupled Rössler chaotic attractors is used to generate temporal series consisting of time-locked generalized synchronized sequences interleaved with unsynchronized ones. Correctly tuned, echo state networks are able to efficiently discriminate between unsynchronized and synchronized sequences even in the presence of relatively high levels of noise. Compared to other state-of-the-art techniques of synchronization detection, the online capabilities of the proposed Echo State Network based methodology make it a promising choice for real-time applications aiming to monitor dynamical synchronization changes in continuous signals.

Reconstructing the regulatory network controlling commitment and sporulation in Physarum polycephalum based on hierarchical Petri Net modelling and simulation.

PubMed

Marwan, Wolfgang; Sujatha, Arumugam; Starostzik, Christine

2005-10-21

We reconstruct the regulatory network controlling commitment and sporulation of Physarum polycephalum from experimental results using a hierarchical Petri Net-based modelling and simulation framework. The stochastic Petri Net consistently describes the structure and simulates the dynamics of the molecular network as analysed by genetic, biochemical and physiological experiments within a single coherent model. The Petri Net then is extended to simulate time-resolved somatic complementation experiments performed by mixing the cytoplasms of mutants altered in the sporulation response, to systematically explore the network structure and to probe its dynamics. This reverse engineering approach presumably can be employed to explore other molecular or genetic signalling systems where the activity of genes or their products can be experimentally controlled in a time-resolved manner.

Spiking neural networks on high performance computer clusters

NASA Astrophysics Data System (ADS)

Chen, Chong; Taha, Tarek M.

2011-09-01

In this paper we examine the acceleration of two spiking neural network models on three clusters of multicore processors representing three categories of processors: x86, STI Cell, and NVIDIA GPGPUs. The x86 cluster utilized consists of 352 dualcore AMD Opterons, the Cell cluster consists of 320 Sony Playstation 3s, while the GPGPU cluster contains 32 NVIDIA Tesla S1070 systems. The results indicate that the GPGPU platform can dominate in performance compared to the Cell and x86 platforms examined. From a cost perspective, the GPGPU is more expensive in terms of neuron/s throughput. If the cost of GPGPUs go down in the future, this platform will become very cost effective for these models.

Consistency Analysis of Genome-Scale Models of Bacterial Metabolism: A Metamodel Approach

PubMed Central

Ponce-de-Leon, Miguel; Calle-Espinosa, Jorge; Peretó, Juli; Montero, Francisco

2015-01-01

Genome-scale metabolic models usually contain inconsistencies that manifest as blocked reactions and gap metabolites. With the purpose to detect recurrent inconsistencies in metabolic models, a large-scale analysis was performed using a previously published dataset of 130 genome-scale models. The results showed that a large number of reactions (~22%) are blocked in all the models where they are present. To unravel the nature of such inconsistencies a metamodel was construed by joining the 130 models in a single network. This metamodel was manually curated using the unconnected modules approach, and then, it was used as a reference network to perform a gap-filling on each individual genome-scale model. Finally, a set of 36 models that had not been considered during the construction of the metamodel was used, as a proof of concept, to extend the metamodel with new biochemical information, and to assess its impact on gap-filling results. The analysis performed on the metamodel allowed to conclude: 1) the recurrent inconsistencies found in the models were already present in the metabolic database used during the reconstructions process; 2) the presence of inconsistencies in a metabolic database can be propagated to the reconstructed models; 3) there are reactions not manifested as blocked which are active as a consequence of some classes of artifacts, and; 4) the results of an automatic gap-filling are highly dependent on the consistency and completeness of the metamodel or metabolic database used as the reference network. In conclusion the consistency analysis should be applied to metabolic databases in order to detect and fill gaps as well as to detect and remove artifacts and redundant information. PMID:26629901

Network-based model of the growth of termite nests

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Perception Evolution Network Based on Cognition Deepening Model--Adapting to the Emergence of New Sensory Receptor.

PubMed

Xing, Youlu; Shen, Furao; Zhao, Jinxi

2016-03-01

The proposed perception evolution network (PEN) is a biologically inspired neural network model for unsupervised learning and online incremental learning. It is able to automatically learn suitable prototypes from learning data in an incremental way, and it does not require the predefined prototype number or the predefined similarity threshold. Meanwhile, being more advanced than the existing unsupervised neural network model, PEN permits the emergence of a new dimension of perception in the perception field of the network. When a new dimension of perception is introduced, PEN is able to integrate the new dimensional sensory inputs with the learned prototypes, i.e., the prototypes are mapped to a high-dimensional space, which consists of both the original dimension and the new dimension of the sensory inputs. In the experiment, artificial data and real-world data are used to test the proposed PEN, and the results show that PEN can work effectively.

Modeling Dynamic Evolution of Online Friendship Network

NASA Astrophysics Data System (ADS)

Wu, Lian-Ren; Yan, Qiang

2012-10-01

In this paper, we study the dynamic evolution of friendship network in SNS (Social Networking Site). Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community, but also on the friendship network generated by those friends. In addition, we propose a model which is based on two processes: first, connecting nearest neighbors; second, strength driven attachment mechanism. The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes which have larger weights and interactions, a phenomenon called strength driven attachment (also called weight driven attachment). From the simulation results, we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data.

Synchronizability of random rectangular graphs

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

Estrada, Ernesto, E-mail: ernesto.estrada@strath.ac.uk; Chen, Guanrong

2015-08-15

Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.

A computational approach to extinction events in chemical reaction networks with discrete state spaces.

PubMed

Johnston, Matthew D

2017-12-01

Recent work of Johnston et al. has produced sufficient conditions on the structure of a chemical reaction network which guarantee that the corresponding discrete state space system exhibits an extinction event. The conditions consist of a series of systems of equalities and inequalities on the edges of a modified reaction network called a domination-expanded reaction network. In this paper, we present a computational implementation of these conditions written in Python and apply the program on examples drawn from the biochemical literature. We also run the program on 458 models from the European Bioinformatics Institute's BioModels Database and report our results. Copyright © 2017 Elsevier Inc. All rights reserved.

The artificial neural network modelling of the piezoelectric actuator vibrations using laser displacement sensor

NASA Astrophysics Data System (ADS)

Paralı, Levent; Sarı, Ali; Kılıç, Ulaş; Şahin, Özge; Pěchoušek, Jiří

2017-09-01

We report an improvement of the artificial neural network (ANN) modelling of a piezoelectric actuator vibration based on the experimental data. The controlled vibrations of an actuator were obtained by utilizing the swept-sine signal excitation. The peak value in the displacement signal response was measured by a laser displacement sensor. The piezoelectric actuator was modelled in both linear and nonlinear operating range. A consistency from 90.3 up to 98.9% of ANN modelled output values and experimental ones was reached. The obtained results clearly demonstrate exact linear relationship between the ANN model and experimental values.

Scale-dependent genetic structure of the Idaho giant salamander (Dicamptodon aterrimus) in stream networks.

PubMed

Mullen, Lindy B; Arthur Woods, H; Schwartz, Michael K; Sepulveda, Adam J; Lowe, Winsor H

2010-03-01

The network architecture of streams and rivers constrains evolutionary, demographic and ecological processes of freshwater organisms. This consistent architecture also makes stream networks useful for testing general models of population genetic structure and the scaling of gene flow. We examined genetic structure and gene flow in the facultatively paedomorphic Idaho giant salamander, Dicamptodon aterrimus, in stream networks of Idaho and Montana, USA. We used microsatellite data to test population structure models by (i) examining hierarchical partitioning of genetic variation in stream networks; and (ii) testing for genetic isolation by distance along stream corridors vs. overland pathways. Replicated sampling of streams within catchments within three river basins revealed that hierarchical scale had strong effects on genetic structure and gene flow. amova identified significant structure at all hierarchical scales (among streams, among catchments, among basins), but divergence among catchments had the greatest structural influence. Isolation by distance was detected within catchments, and in-stream distance was a strong predictor of genetic divergence. Patterns of genetic divergence suggest that differentiation among streams within catchments was driven by limited migration, consistent with a stream hierarchy model of population structure. However, there was no evidence of migration among catchments within basins, or among basins, indicating that gene flow only counters the effects of genetic drift at smaller scales (within rather than among catchments). These results show the strong influence of stream networks on population structure and genetic divergence of a salamander, with contrasting effects at different hierarchical scales.

Modeling of axonal endoplasmic reticulum network by spastic paraplegia proteins

PubMed Central

Yalçın, Belgin; Zhao, Lu; Stofanko, Martin; O'Sullivan, Niamh C; Kang, Zi Han; Roost, Annika; Thomas, Matthew R; Zaessinger, Sophie; Blard, Olivier; Patto, Alex L; Sohail, Anood; Baena, Valentina; Terasaki, Mark; O'Kane, Cahir J

2017-01-01

Axons contain a smooth tubular endoplasmic reticulum (ER) network that is thought to be continuous with ER throughout the neuron; the mechanisms that form this axonal network are unknown. Mutations affecting reticulon or REEP proteins, with intramembrane hairpin domains that model ER membranes, cause an axon degenerative disease, hereditary spastic paraplegia (HSP). We show that Drosophila axons have a dynamic axonal ER network, which these proteins help to model. Loss of HSP hairpin proteins causes ER sheet expansion, partial loss of ER from distal motor axons, and occasional discontinuities in axonal ER. Ultrastructural analysis reveals an extensive ER network in axons, which shows larger and fewer tubules in larvae that lack reticulon and REEP proteins, consistent with loss of membrane curvature. Therefore HSP hairpin-containing proteins are required for shaping and continuity of axonal ER, thus suggesting roles for ER modeling in axon maintenance and function. DOI: http://dx.doi.org/10.7554/eLife.23882.001 PMID:28742022

Non-parametric model selection for subject-specific topological organization of resting-state functional connectivity.

PubMed

Ferrarini, Luca; Veer, Ilya M; van Lew, Baldur; Oei, Nicole Y L; van Buchem, Mark A; Reiber, Johan H C; Rombouts, Serge A R B; Milles, J

2011-06-01

In recent years, graph theory has been successfully applied to study functional and anatomical connectivity networks in the human brain. Most of these networks have shown small-world topological characteristics: high efficiency in long distance communication between nodes, combined with highly interconnected local clusters of nodes. Moreover, functional studies performed at high resolutions have presented convincing evidence that resting-state functional connectivity networks exhibits (exponentially truncated) scale-free behavior. Such evidence, however, was mostly presented qualitatively, in terms of linear regressions of the degree distributions on log-log plots. Even when quantitative measures were given, these were usually limited to the r(2) correlation coefficient. However, the r(2) statistic is not an optimal estimator of explained variance, when dealing with (truncated) power-law models. Recent developments in statistics have introduced new non-parametric approaches, based on the Kolmogorov-Smirnov test, for the problem of model selection. In this work, we have built on this idea to statistically tackle the issue of model selection for the degree distribution of functional connectivity at rest. The analysis, performed at voxel level and in a subject-specific fashion, confirmed the superiority of a truncated power-law model, showing high consistency across subjects. Moreover, the most highly connected voxels were found to be consistently part of the default mode network. Our results provide statistically sound support to the evidence previously presented in literature for a truncated power-law model of resting-state functional connectivity. Copyright © 2010 Elsevier Inc. All rights reserved.

The TENCompetence Infrastructure: A Learning Network Implementation

NASA Astrophysics Data System (ADS)

Vogten, Hubert; Martens, Harrie; Lemmers, Ruud

The TENCompetence project developed a first release of a Learning Network infrastructure to support individuals, groups and organisations in professional competence development. This infrastructure Learning Network infrastructure was released as open source to the community thereby allowing users and organisations to use and contribute to this development as they see fit. The infrastructure consists of client applications providing the user experience and server components that provide the services to these clients. These services implement the domain model (Koper 2006) by provisioning the entities of the domain model (see also Sect. 18.4) and henceforth will be referenced as domain entity services.

Particle Interactions Mediated by Dynamical Networks: Assessment of Macroscopic Descriptions

NASA Astrophysics Data System (ADS)

Barré, J.; Carrillo, J. A.; Degond, P.; Peurichard, D.; Zatorska, E.

2018-02-01

We provide a numerical study of the macroscopic model of Barré et al. (Multiscale Model Simul, 2017, to appear) derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodeling process is very fast, the macroscopic model takes the form of a single aggregation-diffusion equation for the density of particles. The theoretical study of the macroscopic model gives precise criteria for the phase transitions of the steady states, and in the one-dimensional case, we show numerically that the stationary solutions of the microscopic model undergo the same phase transitions and bifurcation types as the macroscopic model. In the two-dimensional case, we show that the numerical simulations of the macroscopic model are in excellent agreement with the predicted theoretical values. This study provides a partial validation of the formal derivation of the macroscopic model from a microscopic formulation and shows that the former is a consistent approximation of an underlying particle dynamics, making it a powerful tool for the modeling of dynamical networks at a large scale.

Particle Interactions Mediated by Dynamical Networks: Assessment of Macroscopic Descriptions.

PubMed

Barré, J; Carrillo, J A; Degond, P; Peurichard, D; Zatorska, E

2018-01-01

We provide a numerical study of the macroscopic model of Barré et al. (Multiscale Model Simul, 2017, to appear) derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodeling process is very fast, the macroscopic model takes the form of a single aggregation-diffusion equation for the density of particles. The theoretical study of the macroscopic model gives precise criteria for the phase transitions of the steady states, and in the one-dimensional case, we show numerically that the stationary solutions of the microscopic model undergo the same phase transitions and bifurcation types as the macroscopic model. In the two-dimensional case, we show that the numerical simulations of the macroscopic model are in excellent agreement with the predicted theoretical values. This study provides a partial validation of the formal derivation of the macroscopic model from a microscopic formulation and shows that the former is a consistent approximation of an underlying particle dynamics, making it a powerful tool for the modeling of dynamical networks at a large scale.

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.

An object-oriented framework for distributed hydrologic and geomorphic modeling using triangulated irregular networks

NASA Astrophysics Data System (ADS)

Tucker, Gregory E.; Lancaster, Stephen T.; Gasparini, Nicole M.; Bras, Rafael L.; Rybarczyk, Scott M.

2001-10-01

We describe a new set of data structures and algorithms for dynamic terrain modeling using a triangulated irregular network (TINs). The framework provides an efficient method for storing, accessing, and updating a Delaunay triangulation and its associated Voronoi diagram. The basic data structure consists of three interconnected data objects: triangles, nodes, and directed edges. Encapsulating each of these geometric elements within a data object makes it possible to essentially decouple the TIN representation from the modeling applications that make use of it. Both the triangulation and its corresponding Voronoi diagram can be rapidly retrieved or updated, making these methods well suited to adaptive remeshing schemes. We develop a set of algorithms for defining drainage networks and identifying closed depressions (e.g., lakes) for hydrologic and geomorphic modeling applications. We also outline simple numerical algorithms for solving network routing and 2D transport equations within the TIN framework. The methods are illustrated with two example applications, a landscape evolution model and a distributed rainfall-runoff model.

Experimental Determination of Operating and Maximum Power Transfer Efficiencies at Resonant Frequency in a Wireless Power Transfer System using PP Network Topology with Top Coupling

NASA Astrophysics Data System (ADS)

Ramachandran, Hema; Pillai, K. P. P.; Bindu, G. R.

2017-08-01

A two-port network model for a wireless power transfer system taking into account the distributed capacitances using PP network topology with top coupling is developed in this work. The operating and maximum power transfer efficiencies are determined analytically in terms of S-parameters. The system performance predicted by the model is verified with an experiment consisting of a high power home light load of 230 V, 100 W and is tested for two forced resonant frequencies namely, 600 kHz and 1.2 MHz. The experimental results are in close agreement with the proposed model.

A large deformation viscoelastic model for double-network hydrogels

NASA Astrophysics Data System (ADS)

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

2017-03-01

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

On the sufficiency of pairwise interactions in maximum entropy models of networks

NASA Astrophysics Data System (ADS)

Nemenman, Ilya; Merchan, Lina

Biological information processing networks consist of many components, which are coupled by an even larger number of complex multivariate interactions. However, analyses of data sets from fields as diverse as neuroscience, molecular biology, and behavior have reported that observed statistics of states of some biological networks can be approximated well by maximum entropy models with only pairwise interactions among the components. Based on simulations of random Ising spin networks with p-spin (p > 2) interactions, here we argue that this reduction in complexity can be thought of as a natural property of some densely interacting networks in certain regimes, and not necessarily as a special property of living systems. This work was supported in part by James S. McDonnell Foundation Grant No. 220020321.

Comparison of Intelligent Systems in Detecting a Child's Mathematical Gift

ERIC Educational Resources Information Center

Pavlekovic, Margita; Zekic-Susac, Marijana; Djurdjevic, Ivana

2009-01-01

This paper compares the efficiency of two intelligent methods: expert systems and neural networks, in detecting children's mathematical gift at the fourth grade of elementary school. The input space for the expert system and the neural network model consisted of 60 variables describing five basic components of a child's mathematical gift…

A Mechanistic Model of Human Recall of Social Network Structure and Relationship Affect.

PubMed

Omodei, Elisa; Brashears, Matthew E; Arenas, Alex

2017-12-07

The social brain hypothesis argues that the need to deal with social challenges was key to our evolution of high intelligence. Research with non-human primates as well as experimental and fMRI studies in humans produce results consistent with this claim, leading to an estimate that human primary groups should consist of roughly 150 individuals. Gaps between this prediction and empirical observations can be partially accounted for using "compression heuristics", or schemata that simplify the encoding and recall of social information. However, little is known about the specific algorithmic processes used by humans to store and recall social information. We describe a mechanistic model of human network recall and demonstrate its sufficiency for capturing human recall behavior observed in experimental contexts. We find that human recall is predicated on accurate recall of a small number of high degree network nodes and the application of heuristics for both structural and affective information. This provides new insight into human memory, social network evolution, and demonstrates a novel approach to uncovering human cognitive operations.

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

LATENT SPACE MODELS FOR MULTIVIEW NETWORK DATA

PubMed Central

Salter-Townshend, Michael; McCormick, Tyler H.

2018-01-01

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

LATENT SPACE MODELS FOR MULTIVIEW NETWORK DATA.

PubMed

Salter-Townshend, Michael; McCormick, Tyler H

2017-09-01

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

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

NASA Astrophysics Data System (ADS)

Zeng, Y.

2017-09-01

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

A new model of the spinal locomotor networks of a salamander and its properties.

PubMed

Liu, Qiang; Yang, Huizhen; Zhang, Jinxue; Wang, Jingzhuo

2018-05-22

A salamander is an ideal animal for studying the spinal locomotor network mechanism of vertebrates from an evolutionary perspective since it represents the transition from an aquatic to a terrestrial animal. However, little is known about the spinal locomotor network of a salamander. A spinal locomotor network model is a useful tool for exploring the working mechanism of the spinal networks of salamanders. A new spinal locomotor network model for a salamander is built for a three-dimensional (3D) biomechanical model of the salamander using a novel locomotion-controlled neural network model. Based on recent experimental data on the spinal circuitry and observational results of gaits of vertebrates, we assume that different interneuron sets recruited for mediating the frequency of spinal circuits are also related to the generation of different gaits. The spinal locomotor networks of salamanders are divided into low-frequency networks for walking and high-frequency networks for swimming. Additionally, a new topological structure between the body networks and limb networks is built, which only uses the body networks to coordinate the motion of limbs. There are no direct synaptic connections among limb networks. These techniques differ from existing salamander spinal locomotor network models. A simulation is performed and analyzed to validate the properties of the new spinal locomotor networks of salamanders. The simulation results show that the new spinal locomotor networks can generate a forward walking gait, a backward walking gait, a swimming gait, and a turning gait during swimming and walking. These gaits can be switched smoothly by changing external inputs from the brainstem. These properties are consistent with those of a real salamander. However, it is still difficult for the new spinal locomotor networks to generate highly efficient turning during walking, 3D swimming, nonrhythmic movements, and so on. New experimental data are required for further validation.

Relationship between Pulmonary Airflow and Resistance in Patients with Airway Narrowing Using An 1-D Network Resistance and Compliance Model

NASA Astrophysics Data System (ADS)

Choi, Sanghun; Choi, Jiwoong; Hoffman, Eric; Lin, Ching-Long

2016-11-01

To predict the proper relationship between airway resistance and regional airflow, we proposed a novel 1-D network model for airway resistance and acinar compliance. First, we extracted 1-D skeletons at inspiration images, and generated 1-D trees of CT unresolved airways with a volume filling method. We used Horsfield order with random heterogeneity to create diameters of the generated 1-D trees. We employed a resistance model that accounts for kinetic energy and viscous dissipation (Model A). The resistance model is further coupled with a regional compliance model estimated from two static images (Model B). For validation, we applied both models to a healthy subject. The results showed that Model A failed to provide airflows consistent with air volume change, whereas Model B provided airflows consistent with air volume change. Since airflows shall be regionally consistent with air volume change in patients with normal airways, Model B was validated. Then, we applied Model B to severe asthmatic subjects. The results showed that regional airflows were significantly deviated from air volume change due to airway narrowing. This implies that airway resistance plays a major role in determining regional airflows of patients with airway narrowing. Support for this study was provided, in part, by NIH Grants U01 HL114494, R01 HL094315, R01 HL112986, and S10 RR022421.

Spatial effects in real networks: Measures, null models, and applications

NASA Astrophysics Data System (ADS)

Ruzzenenti, Franco; Picciolo, Francesco; Basosi, Riccardo; Garlaschelli, Diego

2012-12-01

Spatially embedded networks are shaped by a combination of purely topological (space-independent) and space-dependent formation rules. While it is quite easy to artificially generate networks where the relative importance of these two factors can be varied arbitrarily, it is much more difficult to disentangle these two architectural effects in real networks. Here we propose a solution to this problem, by introducing global and local measures of spatial effects that, through a comparison with adequate null models, effectively filter out the spurious contribution of nonspatial constraints. Our filtering allows us to consistently compare different embedded networks or different historical snapshots of the same network. As a challenging application we analyze the World Trade Web, whose topology is known to depend on geographic distances but is also strongly determined by nonspatial constraints (degree sequence or gross domestic product). Remarkably, we are able to detect weak but significant spatial effects both locally and globally in the network, showing that our method succeeds in retrieving spatial information even when nonspatial factors dominate. We finally relate our results to the economic literature on gravity models and trade globalization.

Synchrony-optimized networks of Kuramoto oscillators with inertia

NASA Astrophysics Data System (ADS)

Pinto, Rafael S.; Saa, Alberto

2016-12-01

We investigate synchronization in networks of Kuramoto oscillators with inertia. More specifically, we introduce a rewiring algorithm consisting basically in a hill climb scheme in which the edges of the network are swapped in order to enhance its synchronization capacity. We show that the synchrony-optimized networks generated by our algorithm have some interesting topological and dynamical properties. In particular, they typically exhibit an anticipation of the synchronization onset and are more robust against certain types of perturbations. We consider synthetic random networks and also a network with a topology based on an approximated model of the (high voltage) power grid of Spain, since networks of Kuramoto oscillators with inertia have been used recently as simplified models for power grids, for which synchronization is obviously a crucial issue. Despite the extreme simplifications adopted in these models, our results, among others recently obtained in the literature, may provide interesting principles to guide the future growth and development of real-world grids, specially in the case of a change of the current paradigm of centralized towards distributed generation power grids.

Deep Neural Network Detects Quantum Phase Transition

NASA Astrophysics Data System (ADS)

Arai, Shunta; Ohzeki, Masayuki; Tanaka, Kazuyuki

2018-03-01

We detect the quantum phase transition of a quantum many-body system by mapping the observed results of the quantum state onto a neural network. In the present study, we utilized the simplest case of a quantum many-body system, namely a one-dimensional chain of Ising spins with the transverse Ising model. We prepared several spin configurations, which were obtained using repeated observations of the model for a particular strength of the transverse field, as input data for the neural network. Although the proposed method can be employed using experimental observations of quantum many-body systems, we tested our technique with spin configurations generated by a quantum Monte Carlo simulation without initial relaxation. The neural network successfully identified the strength of transverse field only from the spin configurations, leading to consistent estimations of the critical point of our model Γc = J.

Social networks and spreading of epidemics

NASA Astrophysics Data System (ADS)

Trimper, Steffen; Zheng, Dafang; Brandau, Marian

2004-05-01

Epidemiological processes are studied within a recently proposed social network model using the susceptible-infected-refractory dynamics (SIR) of an epidemic. Within the network model, a population of individuals may be characterized by H independent hierarchies or dimensions, each of which consists of groupings of individuals into layers of subgroups. Detailed numerical simulations reveals that for H > 1, the global spreading results regardless of the degree of homophily α of the individuals forming a social circle. For H = 1, a transition from a global to a local spread occurs as the population becomes decomposed into increasingly homophilous groups. Multiple dimensions in classifying individuals (nodes) thus make a society (computer network) highly susceptible to large scale outbreaks of infectious diseases (viruses). The SIR-model can be extended by the inclusion of waiting times resulting in modified distribution function of the recovered.

The stationary flow in a heterogeneous compliant vessel network

NASA Astrophysics Data System (ADS)

Filoche, Marcel; Florens, Magali

2011-09-01

We introduce a mathematical model of the hydrodynamic transport into systems consisting in a network of connected flexible pipes. In each pipe of the network, the flow is assumed to be steady and one-dimensional. The fluid-structure interaction is described through tube laws which relate the pipe diameter to the pressure difference across the pipe wall. We show that the resulting one-dimensional differential equation describing the flow in the pipe can be exactly integrated if one is able to estimate averages of the Reynolds number along the pipe. The differential equation is then transformed into a non linear scalar equation relating pressures at both ends of the pipe and the flow rate in the pipe. These equations are coupled throughout the network with mass conservation equations for the flow and zero pressure losses at the branching points of the network. This allows us to derive a general model for the computation of the flow into very large inhomogeneous networks consisting of several thousands of flexible pipes. This model is then applied to perform numerical simulations of the human lung airway system at exhalation. The topology of the system and the tube laws are taken from morphometric and physiological data in the literature. We find good qualitative and quantitative agreement between the simulation results and flow-volume loops measured in real patients. In particular, expiratory flow limitation which is an essential characteristic of forced expiration is found to be well reproduced by our simulations. Finally, a mathematical model of a pathology (Chronic Obstructive Pulmonary Disease) is introduced which allows us to quantitatively assess the influence of a moderate or severe alteration of the airway compliances.

Smart Collision Avoidance and Hazard Routing Mechanism for Intelligent Transport Network

NASA Astrophysics Data System (ADS)

Singh, Gurpreet; Gupta, Pooja; Wahab, Mohd Helmy Abd

2017-08-01

The smart vehicular ad-hoc network is the network that consists of vehicles for smooth movement and better management of the vehicular connectivity across the given network. This research paper aims to propose a set of solution for the VANETs consisting of the automatic driven vehicles, also called as the autonomous car. Such vehicular networks are always prone to collision due to the natural or un-natural reasons which must be solved before the large-scale deployment of the autonomous transport systems. The newly designed intelligent transport movement control mechanism is based upon the intelligent data propagation along with the vehicle collision and traffic jam prevention schema [8], which may help the future designs of smart cities to become more robust and less error-prone. In the proposed model, the focus is on designing a new dynamic and robust hazard routing protocol for intelligent vehicular networks for improvement of the overall performance in various aspects. It is expected to improve the overall transmission delay as well as the number of collisions or adversaries across the vehicular network zone.

A TDMA Broadcast Satellite/Ground Architecture for the Aeronautical Telecommunications Network

NASA Technical Reports Server (NTRS)

Shamma, Mohammed A.; Raghavan, Rajesh S.

2003-01-01

An initial evaluation of a TDMA satellite broadcast architecture with an integrated ground network is proposed in this study as one option for the Aeronautical Telecommunications Network (ATN). The architecture proposed consists of a ground based network that is dedicated to the reception and transmissions of Automatic Dependent Surveillance Broadcast (ADS-B) messages from Mode-S or UAT type systems, along with tracks from primary and secondary surveillance radars. Additionally, the ground network could contain VHF Digital Link Mode 2, 3 or 4 transceivers for the reception and transmissions of Controller-Pilot Data Link Communications (CPDLC) messages and for voice. The second part of the ATN network consists of a broadcast satellite based system that is mainly dedicated for the transmission of surveillance data as well as En-route Flight Information Service Broadcast (FIS-B) to all aircraft. The system proposed integrates those two network to provide a nation wide comprehensive service utilizing near term or existing technologies and hence keeping the economic factor in prospective. The next few sections include a background introduction, the ground subnetwork, the satellite subnetwork, modeling and simulations, and conclusion and recommendations.

Review of pore network modelling of porous media: Experimental characterisations, network constructions and applications to reactive transport.

PubMed

Xiong, Qingrong; Baychev, Todor G; Jivkov, Andrey P

2016-09-01

Pore network models have been applied widely for simulating a variety of different physical and chemical processes, including phase exchange, non-Newtonian displacement, non-Darcy flow, reactive transport and thermodynamically consistent oil layers. The realism of such modelling, i.e. the credibility of their predictions, depends to a large extent on the quality of the correspondence between the pore space of a given medium and the pore network constructed as its representation. The main experimental techniques for pore space characterisation, including direct imaging, mercury intrusion porosimetry and gas adsorption, are firstly summarised. A review of the main pore network construction techniques is then presented. Particular focus is given on how such constructions are adapted to the data from experimentally characterised pore systems. Current applications of pore network models are considered, with special emphasis on the effects of adsorption, dissolution and precipitation, as well as biomass growth, on transport coefficients. Pore network models are found to be a valuable tool for understanding and predicting meso-scale phenomena, linking single pore processes, where other techniques are more accurate, and the homogenised continuum porous media, used by engineering community. Copyright © 2016 The Authors. Published by Elsevier B.V. All rights reserved.

The effects of noise on binocular rivalry waves: a stochastic neural field model

NASA Astrophysics Data System (ADS)

Webber, Matthew A.; Bressloff, Paul C.

2013-03-01

We analyze the effects of extrinsic noise on traveling waves of visual perception in a competitive neural field model of binocular rivalry. The model consists of two one-dimensional excitatory neural fields, whose activity variables represent the responses to left-eye and right-eye stimuli, respectively. The two networks mutually inhibit each other, and slow adaptation is incorporated into the model by taking the network connections to exhibit synaptic depression. We first show how, in the absence of any noise, the system supports a propagating composite wave consisting of an invading activity front in one network co-moving with a retreating front in the other network. Using a separation of time scales and perturbation methods previously developed for stochastic reaction-diffusion equations, we then show how extrinsic noise in the activity variables leads to a diffusive-like displacement (wandering) of the composite wave from its uniformly translating position at long time scales, and fluctuations in the wave profile around its instantaneous position at short time scales. We use our analysis to calculate the first-passage-time distribution for a stochastic rivalry wave to travel a fixed distance, which we find to be given by an inverse Gaussian. Finally, we investigate the effects of noise in the depression variables, which under an adiabatic approximation lead to quenched disorder in the neural fields during propagation of a wave.

Testing a model of facilitated reflection on network feedback: a mixed method study on integration of rural mental healthcare services for older people.

PubMed

Fuller, Jeffrey; Oster, Candice; Muir Cochrane, Eimear; Dawson, Suzanne; Lawn, Sharon; Henderson, Julie; O'Kane, Deb; Gerace, Adam; McPhail, Ruth; Sparkes, Deb; Fuller, Michelle; Reed, Richard L

2015-11-11

To test a management model of facilitated reflection on network feedback as a means to engage services in problem solving the delivery of integrated primary mental healthcare to older people. Participatory mixed methods case study evaluating the impact of a network management model using organisational network feedback (through social network analysis, key informant interviews and policy review). A model of facilitated network reflection using network theory and methods. A rural community in South Australia. 32 staff from 24 services and 12 senior service managers from mental health, primary care and social care services. Health and social care organisations identified that they operated in clustered self-managed networks within sectors, with no overarching purposive older people's mental healthcare network. The model of facilitated reflection revealed service goal and role conflicts. These discussions helped local services to identify as a network, and begin the problem-solving communication and referral links. A Governance Group assisted this process. Barriers to integrated servicing through a network included service funding tied to performance of direct care tasks and the lack of a clear lead network administration organisation. A model of facilitated reflection helped organisations to identify as a network, but revealed sensitivity about organisational roles and goals, which demonstrated that conflict should be expected. Networked servicing needed a neutral network administration organisation with cross-sectoral credibility, a mandate and the resources to monitor the network, to deal with conflict, negotiate commitment among the service managers, and provide opportunities for different sectors to meet and problem solve. This requires consistency and sustained intersectoral policies that include strategies and funding to facilitate and maintain health and social care networks in rural communities. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

PubMed

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-08-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses

PubMed Central

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-01-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure. PMID:26291697

Heterogeneous network promotes species coexistence: metapopulation model for rock-paper-scissors game.

PubMed

Nagatani, Takashi; Ichinose, Genki; Tainaka, Kei-Ichi

2018-05-04

Understanding mechanisms of biodiversity has been a central question in ecology. The coexistence of three species in rock-paper-scissors (RPS) systems are discussed by many authors; however, the relation between coexistence and network structure is rarely discussed. Here we present a metapopulation model for RPS game. The total population is assumed to consist of three subpopulations (nodes). Each individual migrates by random walk; the destination of migration is randomly determined. From reaction-migration equations, we obtain the population dynamics. It is found that the dynamic highly depends on network structures. When a network is homogeneous, the dynamics are neutrally stable: each node has a periodic solution, and the oscillations synchronize in all nodes. However, when a network is heterogeneous, the dynamics approach stable focus and all nodes reach equilibriums with different densities. Hence, the heterogeneity of the network promotes biodiversity.

Multiple regimes of robust patterns between network structure and biodiversity

NASA Astrophysics Data System (ADS)

Jover, Luis F.; Flores, Cesar O.; Cortez, Michael H.; Weitz, Joshua S.

2015-12-01

Ecological networks such as plant-pollinator and host-parasite networks have structured interactions that define who interacts with whom. The structure of interactions also shapes ecological and evolutionary dynamics. Yet, there is significant ongoing debate as to whether certain structures, e.g., nestedness, contribute positively, negatively or not at all to biodiversity. We contend that examining variation in life history traits is key to disentangling the potential relationship between network structure and biodiversity. Here, we do so by analyzing a dynamic model of virus-bacteria interactions across a spectrum of network structures. Consistent with prior studies, we find plausible parameter domains exhibiting strong, positive relationships between nestedness and biodiversity. Yet, the same model can exhibit negative relationships between nestedness and biodiversity when examined in a distinct, plausible region of parameter space. We discuss steps towards identifying when network structure could, on its own, drive the resilience, sustainability, and even conservation of ecological communities.

Information Diffusion in Facebook-Like Social Networks Under Information Overload

NASA Astrophysics Data System (ADS)

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

2013-07-01

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

Multiple regimes of robust patterns between network structure and biodiversity

PubMed Central

Jover, Luis F.; Flores, Cesar O.; Cortez, Michael H.; Weitz, Joshua S.

2015-01-01

Ecological networks such as plant-pollinator and host-parasite networks have structured interactions that define who interacts with whom. The structure of interactions also shapes ecological and evolutionary dynamics. Yet, there is significant ongoing debate as to whether certain structures, e.g., nestedness, contribute positively, negatively or not at all to biodiversity. We contend that examining variation in life history traits is key to disentangling the potential relationship between network structure and biodiversity. Here, we do so by analyzing a dynamic model of virus-bacteria interactions across a spectrum of network structures. Consistent with prior studies, we find plausible parameter domains exhibiting strong, positive relationships between nestedness and biodiversity. Yet, the same model can exhibit negative relationships between nestedness and biodiversity when examined in a distinct, plausible region of parameter space. We discuss steps towards identifying when network structure could, on its own, drive the resilience, sustainability, and even conservation of ecological communities. PMID:26632996

Emergent behaviors of the Schrödinger-Lohe model on cooperative-competitive networks

NASA Astrophysics Data System (ADS)

Huh, Hyungjin; Ha, Seung-Yeal; Kim, Dohyun

2017-12-01

We present several sufficient frameworks leading to the emergent behaviors of the coupled Schrödinger-Lohe (S-L) model under the same one-body external potential on cooperative-competitive networks. The S-L model was first introduced as a possible phenomenological model exhibiting quantum synchronization and its emergent dynamics on all-to-all cooperative networks has been treated via two distinct approaches, Lyapunov functional approach and the finite-dimensional reduction based on pairwise correlations. In this paper, we further generalize the finite-dimensional dynamical systems approach for pairwise correlation functions on cooperative-competitive networks and provide several sufficient frameworks leading to the collective exponential synchronization. For small systems consisting of three and four quantum subsystem, we also show that the system for pairwise correlations can be reduced to the Lotka-Volterra model with cooperative and competitive interactions, in which lots of interesting dynamical patterns appear, e.g., existence of closed orbits and limit-cycles.

A solution to neural field equations by a recurrent neural network method

NASA Astrophysics Data System (ADS)

Alharbi, Abir

2012-09-01

Neural field equations (NFE) are used to model the activity of neurons in the brain, it is introduced from a single neuron 'integrate-and-fire model' starting point. The neural continuum is spatially discretized for numerical studies, and the governing equations are modeled as a system of ordinary differential equations. In this article the recurrent neural network approach is used to solve this system of ODEs. This consists of a technique developed by combining the standard numerical method of finite-differences with the Hopfield neural network. The architecture of the net, energy function, updating equations, and algorithms are developed for the NFE model. A Hopfield Neural Network is then designed to minimize the energy function modeling the NFE. Results obtained from the Hopfield-finite-differences net show excellent performance in terms of accuracy and speed. The parallelism nature of the Hopfield approaches may make them easier to implement on fast parallel computers and give them the speed advantage over the traditional methods.

Stability of a giant connected component in a complex network

NASA Astrophysics Data System (ADS)

Kitsak, Maksim; Ganin, Alexander A.; Eisenberg, Daniel A.; Krapivsky, Pavel L.; Krioukov, Dmitri; Alderson, David L.; Linkov, Igor

2018-01-01

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.

Use of an Artificial Neural Network to Construct a Model of Predicting Deep Fungal Infection in Lung Cancer Patients.

PubMed

Chen, Jian; Chen, Jie; Ding, Hong-Yan; Pan, Qin-Shi; Hong, Wan-Dong; Xu, Gang; Yu, Fang-You; Wang, Yu-Min

2015-01-01

The statistical methods to analyze and predict the related dangerous factors of deep fungal infection in lung cancer patients were several, such as logic regression analysis, meta-analysis, multivariate Cox proportional hazards model analysis, retrospective analysis, and so on, but the results are inconsistent. A total of 696 patients with lung cancer were enrolled. The factors were compared employing Student's t-test or the Mann-Whitney test or the Chi-square test and variables that were significantly related to the presence of deep fungal infection selected as candidates for input into the final artificial neural network analysis (ANN) model. The receiver operating characteristic (ROC) and area under curve (AUC) were used to evaluate the performance of the artificial neural network (ANN) model and logistic regression (LR) model. The prevalence of deep fungal infection from lung cancer in this entire study population was 32.04%(223/696), deep fungal infections occur in sputum specimens 44.05% (200/454). The ratio of candida albicans was 86.99% (194/223) in the total fungi. It was demonstrated that older (≥65 years), use of antibiotics, low serum albumin concentrations (≤37.18 g /L), radiotherapy, surgery, low hemoglobin hyperlipidemia (≤93.67 g /L), long time of hospitalization (≥14 days) were apt to deep fungal infection and the ANN model consisted of the seven factors. The AUC of ANN model (0.829±0.019) was higher than that of LR model (0.756±0.021). The artificial neural network model with variables consisting of age, use of antibiotics, serum albumin concentrations, received radiotherapy, received surgery, hemoglobin, time of hospitalization should be useful for predicting the deep fungal infection in lung cancer.

Evaluation of axial pile bearing capacity based on pile driving analyzer (PDA) test using Neural Network

NASA Astrophysics Data System (ADS)

Maizir, H.; Suryanita, R.

2018-01-01

A few decades, many methods have been developed to predict and evaluate the bearing capacity of driven piles. The problem of the predicting and assessing the bearing capacity of the pile is very complicated and not yet established, different soil testing and evaluation produce a widely different solution. However, the most important thing is to determine methods used to predict and evaluate the bearing capacity of the pile to the required degree of accuracy and consistency value. Accurate prediction and evaluation of axial bearing capacity depend on some variables, such as the type of soil, diameter, and length of pile, etc. The aims of the study of Artificial Neural Networks (ANNs) are utilized to obtain more accurate and consistent axial bearing capacity of a driven pile. ANNs can be described as mapping an input to the target output data. The method using the ANN model developed to predict and evaluate the axial bearing capacity of the pile based on the pile driving analyzer (PDA) test data for more than 200 selected data. The results of the predictions obtained by the ANN model and the PDA test were then compared. This research as the neural network models give a right prediction and evaluation of the axial bearing capacity of piles using neural networks.

CADAT network translator

NASA Technical Reports Server (NTRS)

Pitts, E. R.

1981-01-01

Program converts cell-net data into logic-gate models for use in test and simulation programs. Input consists of either Place, Route, and Fold (PRF) or Place-and-Route-in-Two-Dimensions (PR2D) layout data deck. Output consists of either Test Pattern Generator (TPG) or Logic-Simulation (LOGSIM) logic circuitry data deck. Designer needs to build only logic-gate-model circuit description since program acts as translator. Language is FORTRAN IV.

Modelling and temporal performances evaluation of networked control systems using (max, +) algebra

NASA Astrophysics Data System (ADS)

Ammour, R.; Amari, S.

2015-01-01

In this paper, we address the problem of temporal performances evaluation of producer/consumer networked control systems. The aim is to develop a formal method for evaluating the response time of this type of control systems. Our approach consists on modelling, using Petri nets classes, the behaviour of the whole architecture including the switches that support multicast communications used by this protocol. (max, +) algebra formalism is then exploited to obtain analytical formulas of the response time and the maximal and minimal bounds. The main novelty is that our approach takes into account all delays experienced at the different stages of networked automation systems. Finally, we show how to apply the obtained results through an example of networked control system.

Phenomenological network models: Lessons for epilepsy surgery.

PubMed

Hebbink, Jurgen; Meijer, Hil; Huiskamp, Geertjan; van Gils, Stephan; Leijten, Frans

2017-10-01

The current opinion in epilepsy surgery is that successful surgery is about removing pathological cortex in the anatomic sense. This contrasts with recent developments in epilepsy research, where epilepsy is seen as a network disease. Computational models offer a framework to investigate the influence of networks, as well as local tissue properties, and to explore alternative resection strategies. Here we study, using such a model, the influence of connections on seizures and how this might change our traditional views of epilepsy surgery. We use a simple network model consisting of four interconnected neuronal populations. One of these populations can be made hyperexcitable, modeling a pathological region of cortex. Using model simulations, the effect of surgery on the seizure rate is studied. We find that removal of the hyperexcitable population is, in most cases, not the best approach to reduce the seizure rate. Removal of normal populations located at a crucial spot in the network, the "driver," is typically more effective in reducing seizure rate. This work strengthens the idea that network structure and connections may be more important than localizing the pathological node. This can explain why lesionectomy may not always be sufficient. © 2017 The Authors. Epilepsia published by Wiley Periodicals, Inc. on behalf of International League Against Epilepsy.

Modeling and performance analysis using extended fuzzy-timing Petri nets for networked virtual environments.

PubMed

Zhou, Y; Murata, T; Defanti, T A

2000-01-01

Despite their attractive properties, networked virtual environments (net-VEs) are notoriously difficult to design, implement, and test due to the concurrency, real-time and networking features in these systems. Net-VEs demand high quality-of-service (QoS) requirements on the network to maintain natural and real-time interactions among users. The current practice for net-VE design is basically trial and error, empirical, and totally lacks formal methods. This paper proposes to apply a Petri net formal modeling technique to a net-VE-NICE (narrative immersive constructionist/collaborative environment), predict the net-VE performance based on simulation, and improve the net-VE performance. NICE is essentially a network of collaborative virtual reality systems called the CAVE-(CAVE automatic virtual environment). First, we introduce extended fuzzy-timing Petri net (EFTN) modeling and analysis techniques. Then, we present EFTN models of the CAVE, NICE, and transport layer protocol used in NICE: transmission control protocol (TCP). We show the possibility analysis based on the EFTN model for the CAVE. Then, by using these models and design/CPN as the simulation tool, we conducted various simulations to study real-time behavior, network effects and performance (latencies and jitters) of NICE. Our simulation results are consistent with experimental data.

The QKD network: model and routing scheme

NASA Astrophysics Data System (ADS)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

A strategy for prediction of the elastic properties of epoxy-cellulose nanocrystal-reinforced fiber networks

Treesearch

Johnathan E. Goodsell; Robert J. Moon; Alionso Huizar; R. Byron Pipes

2014-01-01

The reinforcement potential of cellulose nanocrystal (CNC) additions on an idealized 2-dirmensional (2-D) fiber network structure consisting of micron sized fiber elements was investigated. The reinforcement mechanism considered in this study was through the stiffening of the micron sized fiber elements via a CNC-epoxy coating. A hierarchical analytical modeling...

A Bayesian approach to landscape ecological risk assessment applied to the upper Grande Ronde watershed, Oregon

Treesearch

Kimberley K. Ayre; Wayne G. Landis

2012-01-01

We present a Bayesian network model based on the ecological risk assessment framework to evaluate potential impacts to habitats and resources resulting from wildfire, grazing, forest management activities, and insect outbreaks in a forested landscape in northeastern Oregon. The Bayesian network structure consisted of three tiers of nodes: landscape disturbances,...

78 FR 26269 - Connect America Fund; High-Cost Universal Service Support

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-06

... the model platform, which is the basic framework for the model consisting of key assumptions about the... combination of competitive bidding and a new forward-looking model of the cost of constructing modern multi-purpose networks.'' Using the cost model to ``estimate the support necessary to serve areas where costs...

Understanding sexual harassment using aggregate construct models.

PubMed

Nye, Christopher D; Brummel, Bradley J; Drasgow, Fritz

2014-11-01

Sexual harassment has received a substantial amount of empirical attention over the past few decades, and this research has consistently shown that experiencing these behaviors has a detrimental effect on employees' well-being, job attitudes, and behaviors at work. However, these findings, and the conclusions that are drawn from them, make the implicit assumption that the empirical models used to examine sexual harassment are properly specified. This article presents evidence that properly specified aggregate construct models are more consistent with theoretical structures and definitions of sexual harassment and can result in different conclusions about the nomological network of harassment. Results from 3 large samples, 2 military and 1 from a civilian population, are used to illustrate the differences between aggregate construct and reflective indicator models of sexual harassment. These analyses suggested that the factor structure and the nomological network of sexual harassment differ when modeling harassment as an aggregate construct. The implications of these results for the continued study of sexual harassment are discussed. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Modelling the control of interceptive actions.

PubMed Central

Beek, P J; Dessing, J C; Peper, C E; Bullock, D

2003-01-01

In recent years, several phenomenological dynamical models have been formulated that describe how perceptual variables are incorporated in the control of motor variables. We call these short-route models as they do not address how perception-action patterns might be constrained by the dynamical properties of the sensory, neural and musculoskeletal subsystems of the human action system. As an alternative, we advocate a long-route modelling approach in which the dynamics of these subsystems are explicitly addressed and integrated to reproduce interceptive actions. The approach is exemplified through a discussion of a recently developed model for interceptive actions consisting of a neural network architecture for the online generation of motor outflow commands, based on time-to-contact information and information about the relative positions and velocities of hand and ball. This network is shown to be consistent with both behavioural and neurophysiological data. Finally, some problems are discussed with regard to the question of how the motor outflow commands (i.e. the intended movement) might be modulated in view of the musculoskeletal dynamics. PMID:14561342

Predicting Essential Components of Signal Transduction Networks: A Dynamic Model of Guard Cell Abscisic Acid Signaling

PubMed Central

Li, Song; Assmann, Sarah M; Albert, Réka

2006-01-01

Plants both lose water and take in carbon dioxide through microscopic stomatal pores, each of which is regulated by a surrounding pair of guard cells. During drought, the plant hormone abscisic acid (ABA) inhibits stomatal opening and promotes stomatal closure, thereby promoting water conservation. Dozens of cellular components have been identified to function in ABA regulation of guard cell volume and thus of stomatal aperture, but a dynamic description is still not available for this complex process. Here we synthesize experimental results into a consistent guard cell signal transduction network for ABA-induced stomatal closure, and develop a dynamic model of this process. Our model captures the regulation of more than 40 identified network components, and accords well with previous experimental results at both the pathway and whole-cell physiological level. By simulating gene disruptions and pharmacological interventions we find that the network is robust against a significant fraction of possible perturbations. Our analysis reveals the novel predictions that the disruption of membrane depolarizability, anion efflux, actin cytoskeleton reorganization, cytosolic pH increase, the phosphatidic acid pathway, or K+ efflux through slowly activating K+ channels at the plasma membrane lead to the strongest reduction in ABA responsiveness. Initial experimental analysis assessing ABA-induced stomatal closure in the presence of cytosolic pH clamp imposed by the weak acid butyrate is consistent with model prediction. Simulations of stomatal response as derived from our model provide an efficient tool for the identification of candidate manipulations that have the best chance of conferring increased drought stress tolerance and for the prioritization of future wet bench analyses. Our method can be readily applied to other biological signaling networks to identify key regulatory components in systems where quantitative information is limited. PMID:16968132

Gas Classification Using Deep Convolutional Neural Networks.

PubMed

Peng, Pai; Zhao, Xiaojin; Pan, Xiaofang; Ye, Wenbin

2018-01-08

In this work, we propose a novel Deep Convolutional Neural Network (DCNN) tailored for gas classification. Inspired by the great success of DCNN in the field of computer vision, we designed a DCNN with up to 38 layers. In general, the proposed gas neural network, named GasNet, consists of: six convolutional blocks, each block consist of six layers; a pooling layer; and a fully-connected layer. Together, these various layers make up a powerful deep model for gas classification. Experimental results show that the proposed DCNN method is an effective technique for classifying electronic nose data. We also demonstrate that the DCNN method can provide higher classification accuracy than comparable Support Vector Machine (SVM) methods and Multiple Layer Perceptron (MLP).

Gas Classification Using Deep Convolutional Neural Networks

PubMed Central

Peng, Pai; Zhao, Xiaojin; Pan, Xiaofang; Ye, Wenbin

2018-01-01

In this work, we propose a novel Deep Convolutional Neural Network (DCNN) tailored for gas classification. Inspired by the great success of DCNN in the field of computer vision, we designed a DCNN with up to 38 layers. In general, the proposed gas neural network, named GasNet, consists of: six convolutional blocks, each block consist of six layers; a pooling layer; and a fully-connected layer. Together, these various layers make up a powerful deep model for gas classification. Experimental results show that the proposed DCNN method is an effective technique for classifying electronic nose data. We also demonstrate that the DCNN method can provide higher classification accuracy than comparable Support Vector Machine (SVM) methods and Multiple Layer Perceptron (MLP). PMID:29316723

Inference of Vohradský's Models of Genetic Networks by Solving Two-Dimensional Function Optimization Problems

PubMed Central

Kimura, Shuhei; Sato, Masanao; Okada-Hatakeyama, Mariko

2013-01-01

The inference of a genetic network is a problem in which mutual interactions among genes are inferred from time-series of gene expression levels. While a number of models have been proposed to describe genetic networks, this study focuses on a mathematical model proposed by Vohradský. Because of its advantageous features, several researchers have proposed the inference methods based on Vohradský's model. When trying to analyze large-scale networks consisting of dozens of genes, however, these methods must solve high-dimensional non-linear function optimization problems. In order to resolve the difficulty of estimating the parameters of the Vohradský's model, this study proposes a new method that defines the problem as several two-dimensional function optimization problems. Through numerical experiments on artificial genetic network inference problems, we showed that, although the computation time of the proposed method is not the shortest, the method has the ability to estimate parameters of Vohradský's models more effectively with sufficiently short computation times. This study then applied the proposed method to an actual inference problem of the bacterial SOS DNA repair system, and succeeded in finding several reasonable regulations. PMID:24386175

Constitutive flow behaviour of austenitic stainless steels under hot deformation: artificial neural network modelling to understand, evaluate and predict

NASA Astrophysics Data System (ADS)

Mandal, Sumantra; Sivaprasad, P. V.; Venugopal, S.; Murthy, K. P. N.

2006-09-01

An artificial neural network (ANN) model is developed to predict the constitutive flow behaviour of austenitic stainless steels during hot deformation. The input parameters are alloy composition and process variables whereas flow stress is the output. The model is based on a three-layer feed-forward ANN with a back-propagation learning algorithm. The neural network is trained with an in-house database obtained from hot compression tests on various grades of austenitic stainless steels. The performance of the model is evaluated using a wide variety of statistical indices. Good agreement between experimental and predicted data is obtained. The correlation between individual alloying elements and high temperature flow behaviour is investigated by employing the ANN model. The results are found to be consistent with the physical phenomena. The model can be used as a guideline for new alloy development.

Generic, network schema agnostic sparse tensor factorization for single-pass clustering of heterogeneous information networks

PubMed Central

Meng, Qinggang; Deng, Su; Huang, Hongbin; Wu, Yahui; Badii, Atta

2017-01-01

Heterogeneous information networks (e.g. bibliographic networks and social media networks) that consist of multiple interconnected objects are ubiquitous. Clustering analysis is an effective method to understand the semantic information and interpretable structure of the heterogeneous information networks, and it has attracted the attention of many researchers in recent years. However, most studies assume that heterogeneous information networks usually follow some simple schemas, such as bi-typed networks or star network schema, and they can only cluster one type of object in the network each time. In this paper, a novel clustering framework is proposed based on sparse tensor factorization for heterogeneous information networks, which can cluster multiple types of objects simultaneously in a single pass without any network schema information. The types of objects and the relations between them in the heterogeneous information networks are modeled as a sparse tensor. The clustering issue is modeled as an optimization problem, which is similar to the well-known Tucker decomposition. Then, an Alternating Least Squares (ALS) algorithm and a feasible initialization method are proposed to solve the optimization problem. Based on the tensor factorization, we simultaneously partition different types of objects into different clusters. The experimental results on both synthetic and real-world datasets have demonstrated that our proposed clustering framework, STFClus, can model heterogeneous information networks efficiently and can outperform state-of-the-art clustering algorithms as a generally applicable single-pass clustering method for heterogeneous network which is network schema agnostic. PMID:28245222

Generic, network schema agnostic sparse tensor factorization for single-pass clustering of heterogeneous information networks.

PubMed

Wu, Jibing; Meng, Qinggang; Deng, Su; Huang, Hongbin; Wu, Yahui; Badii, Atta

2017-01-01

Heterogeneous information networks (e.g. bibliographic networks and social media networks) that consist of multiple interconnected objects are ubiquitous. Clustering analysis is an effective method to understand the semantic information and interpretable structure of the heterogeneous information networks, and it has attracted the attention of many researchers in recent years. However, most studies assume that heterogeneous information networks usually follow some simple schemas, such as bi-typed networks or star network schema, and they can only cluster one type of object in the network each time. In this paper, a novel clustering framework is proposed based on sparse tensor factorization for heterogeneous information networks, which can cluster multiple types of objects simultaneously in a single pass without any network schema information. The types of objects and the relations between them in the heterogeneous information networks are modeled as a sparse tensor. The clustering issue is modeled as an optimization problem, which is similar to the well-known Tucker decomposition. Then, an Alternating Least Squares (ALS) algorithm and a feasible initialization method are proposed to solve the optimization problem. Based on the tensor factorization, we simultaneously partition different types of objects into different clusters. The experimental results on both synthetic and real-world datasets have demonstrated that our proposed clustering framework, STFClus, can model heterogeneous information networks efficiently and can outperform state-of-the-art clustering algorithms as a generally applicable single-pass clustering method for heterogeneous network which is network schema agnostic.

Effects in the network topology due to node aggregation: Empirical evidence from the domestic maritime transportation in Greece

NASA Astrophysics Data System (ADS)

Tsiotas, Dimitrios; Polyzos, Serafeim

2018-02-01

This article studies the topological consistency of spatial networks due to node aggregation, examining the changes captured between different network representations that result from nodes' grouping and they refer to the same socioeconomic system. The main purpose of this study is to evaluate what kind of topological information remains unalterable due to node aggregation and, further, to develop a framework for linking the data of an empirical network with data of its socioeconomic environment, when the latter are available for hierarchically higher levels of aggregation, in an effort to promote the interdisciplinary research in the field of complex network analysis. The research question is empirically tested on topological and socioeconomic data extracted from the Greek Maritime Network (GMN) that is modeled as a non-directed multilayer (bilayer) graph consisting of a port-layer, where nodes represent ports, and a prefecture-layer, where nodes represent coastal and insular prefectural groups of ports. The analysis highlights that the connectivity (degree) of the GMN is the most consistent aspect of this multilayer network, which preserves both the topological and the socioeconomic information through node aggregation. In terms of spatial analysis and regional science, such effects illustrate the effectiveness of the prefectural administrative division for the functionality of the Greek maritime transportation system. Overall, this approach proposes a methodological framework that can enjoy further applications about the grouping effects induced on the network topology, providing physical, technical, socioeconomic, strategic or political insights.

The Everglades Depth Estimation Network (EDEN) for Support of Ecological and Biological Assessments

USGS Publications Warehouse

Telis, Pamela A.

2006-01-01

The Everglades Depth Estimation Network (EDEN) is an integrated network of real-time water-level monitoring, ground-elevation modeling, and water-surface modeling that provides scientists and managers with current (1999-present), online water-depth information for the entire freshwater portion of the Greater Everglades. Presented on a 400-square-meter grid spacing, EDEN offers a consistent and documented dataset that can be used by scientists and managers to (1) guide large-scale field operations, (2) integrate hydrologic and ecological responses, and (3) support biological and ecological assessments that measure ecosystem responses to the implementation of the Comprehensive Everglades Restoration Plan.

Prototype of NASA's Global Precipitation Measurement Mission Ground Validation System

NASA Technical Reports Server (NTRS)

Schwaller, M. R.; Morris, K. R.; Petersen, W. A.

2007-01-01

NASA is developing a Ground Validation System (GVS) as one of its contributions to the Global Precipitation Mission (GPM). The GPM GVS provides an independent means for evaluation, diagnosis, and ultimately improvement of GPM spaceborne measurements and precipitation products. NASA's GPM GVS consists of three elements: field campaigns/physical validation, direct network validation, and modeling and simulation. The GVS prototype of direct network validation compares Tropical Rainfall Measuring Mission (TRMM) satellite-borne radar data to similar measurements from the U.S. national network of operational weather radars. A prototype field campaign has also been conducted; modeling and simulation prototypes are under consideration.

An Optimization Approach to Coexistence of Bluetooth and Wi-Fi Networks Operating in ISM Environment

NASA Astrophysics Data System (ADS)

Klajbor, Tomasz; Rak, Jacek; Wozniak, Jozef

Unlicensed ISM band is used by various wireless technologies. Therefore, issues related to ensuring the required efficiency and quality of operation of coexisting networks become essential. The paper addresses the problem of mutual interferences between IEEE 802.11b transmitters (commercially named Wi-Fi) and Bluetooth (BT) devices.An optimization approach to modeling the topology of BT scatternets is introduced, resulting in more efficient utilization of ISM environment consisting of BT and Wi-Fi networks. To achieve it, the Integer Linear Programming approach has been proposed. Example results presented in the paper illustrate significant benefits of using the proposed modeling strategy.

Experimental models for Murray’s law

NASA Astrophysics Data System (ADS)

Akita, Dai; Kunita, Itsuki; Fricker, Mark D.; Kuroda, Shigeru; Sato, Katsuhiko; Nakagaki, Toshiyuki

2017-01-01

Transport networks are ubiquitous in multicellular organisms and include leaf veins, fungal mycelia and blood vessels. While transport of materials and signals through the network plays a crucial role in maintaining the living system, the transport capacity of the network can best be understood in terms of hydrodynamics. We report here that plasmodium from the large, single-celled amoeboid Physarum was able to construct a hydrodynamically optimized vein-network when evacuating biomass from confined arenas of various shapes through a narrow exit. Increasingly thick veins developed towards the exit, and the network spanned the arena via repetitive bifurcations to give a branching tree. The Hausdorff distance from all parts of the plasmodium to the vein network was kept low, whilst the hydrodynamic conductivity from distal parts of the network to the exit was equivalent, irrespective of the arena shape. This combination of spatial patterning and differential vein thickening served to evacuate biomass at an equivalent rate across the entire arena. The scaling relationship at the vein branches was determined experimentally to be 2.53-3.29, consistent with predictions from Murray’s law. Furthermore, we show that mathematical models for self-organised, adaptive transport in Physarum simulate the experimental network organisation well if the scaling coefficient of the current-reinforcement rule is set to 3. In simulations, this resulted in rapid development of an optimal network that minimised the combined volume and frictional energy in comparison with other scaling coefficients. This would predict that the boundary shear forces within each vein are constant throughout the network, and would be consistent with a feedback mechanism based on a sensing a threshold shear at the vein wall.

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

PubMed

Schwalger, Tilo; Deger, Moritz; Gerstner, Wulfram

2017-04-01

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

Analytical Modeling of Medium Access Control Protocols in Wireless Networks

DTIC Science & Technology

2006-03-01

Rician-fading channels. However, no provision was made to consider a multihop ad hoc network and the interdependencies among the nodes. Gitman [54...published what is arguably the first paper that actually dealt with a mul- tihop system. Gitman considered a two-hop centralized network consisting of a...of MIMO space-time coded wireless systems. IEEE Journal on Selected Areas in Communications, 21(3):281–302, April 2003. [54] I. Gitman . On the

A Markov model for the temporal dynamics of balanced random networks of finite size

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2014-01-01

The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between neuronal populations also opens new doors to analyze the joint dynamics of multiple interacting networks. PMID:25520644

fMRI evidence for strategic decision-making during resolution of pronoun reference

PubMed Central

McMillan, Corey T.; Clark, Robin; Gunawardena, Delani; Ryant, Neville; Grossman, Murray

2012-01-01

Pronouns are extraordinarily common in daily language yet little is known about the neural mechanisms that support decisions about pronoun reference. We propose a large-scale neural network for resolving pronoun reference that consists of two components. First, a core language network in peri-Sylvian cortex supports syntactic and semantic resources for interpreting pronoun meaning in sentences. Second, a frontal-parietal network that supports strategic decision-making is recruited to support probabilistic and risk-related components of resolving a pronoun’s referent. In an fMRI study of healthy young adults, we observed activation of left inferior frontal and superior temporal cortex, consistent with a language network. We also observed activation of brain regions not associated with traditional language areas. By manipulating the context of the pronoun, we were able to demonstrate recruitment of dorsolateral prefrontal cortex during probabilistic evaluation of a pronoun’s reference, and orbital frontal activation when a pronoun must adopt a risky referent. Together, these findings are consistent with a two-component model for resolving a pronoun’s reference that includes neuroanatomic regions supporting core linguistic and decision-making mechanisms. PMID:22245014

discovery toolset for Emulytics v. 1.0

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

Fritz, David; Crussell, Jonathan

The discovery toolset for Emulytics enables the construction of high-fidelity emulation models of systems. The toolset consists of a set of tools and techniques to automatically go from network discovery of operational systems to emulating those complex systems. Our toolset combines data from host discovery and network mapping tools into an intermediate representation that can then be further refined. Once the intermediate representation reaches the desired state, our toolset supports emitting the Emulytics models with varying levels of specificity based on experiment needs.

Convolutional networks for vehicle track segmentation

NASA Astrophysics Data System (ADS)

Quach, Tu-Thach

2017-10-01

Existing methods to detect vehicle tracks in coherent change detection images, a product of combining two synthetic aperture radar images taken at different times of the same scene, rely on simple and fast models to label track pixels. These models, however, are unable to capture natural track features, such as continuity and parallelism. More powerful but computationally expensive models can be used in offline settings. We present an approach that uses dilated convolutional networks consisting of a series of 3×3 convolutions to segment vehicle tracks. The design of our networks considers the fact that remote sensing applications tend to operate in low power and have limited training data. As a result, we aim for small and efficient networks that can be trained end-to-end to learn natural track features entirely from limited training data. We demonstrate that our six-layer network, trained on just 90 images, is computationally efficient and improves the F-score on a standard dataset to 0.992, up from 0.959 obtained by the current state-of-the-art method.

Using i2b2 to Bootstrap Rural Health Analytics and Learning Networks

PubMed Central

Harris, Daniel R.; Baus, Adam D.; Harper, Tamela J.; Jarrett, Traci D.; Pollard, Cecil R.; Talbert, Jeffery C.

2017-01-01

We demonstrate that the open-source i2b2 (Informatics for Integrating Biology and the Bedside) data model can be used to bootstrap rural health analytics and learning networks. These networks promote communication and research initiatives by providing the infrastructure necessary for sharing data and insights across a group of healthcare and research partners. Data integration remains a crucial challenge in connecting rural healthcare sites with a common data sharing and learning network due to the lack of interoperability and standards within electronic health records. The i2b2 data model acts as a point of convergence for disparate data from multiple healthcare sites. A consistent and natural data model for healthcare data is essential for overcoming integration issues, but challenges such as those caused by weak data standardization must still be addressed. We describe our experience in the context of building the West Virginia/Kentucky Health Analytics and Learning Network, a collaborative, multi-state effort connecting rural healthcare sites. PMID:28261006

Using i2b2 to Bootstrap Rural Health Analytics and Learning Networks.

PubMed

Harris, Daniel R; Baus, Adam D; Harper, Tamela J; Jarrett, Traci D; Pollard, Cecil R; Talbert, Jeffery C

2016-08-01

We demonstrate that the open-source i2b2 (Informatics for Integrating Biology and the Bedside) data model can be used to bootstrap rural health analytics and learning networks. These networks promote communication and research initiatives by providing the infrastructure necessary for sharing data and insights across a group of healthcare and research partners. Data integration remains a crucial challenge in connecting rural healthcare sites with a common data sharing and learning network due to the lack of interoperability and standards within electronic health records. The i2b2 data model acts as a point of convergence for disparate data from multiple healthcare sites. A consistent and natural data model for healthcare data is essential for overcoming integration issues, but challenges such as those caused by weak data standardization must still be addressed. We describe our experience in the context of building the West Virginia/Kentucky Health Analytics and Learning Network, a collaborative, multi-state effort connecting rural healthcare sites.

Exploring the evolution of London's street network in the information space: A dual approach

NASA Astrophysics Data System (ADS)

Masucci, A. Paolo; Stanilov, Kiril; Batty, Michael

2014-01-01

We study the growth of London's street network in its dual representation, as the city has evolved over the past 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the planar graph and represents a transportation unit in the so-called information space, i.e., the space where information is handled in order to navigate through the city. First, we discuss a novel hybrid technique to extract dual graphs from planar graphs, called the hierarchical intersection continuity negotiation principle. Then we show that the growth of the network can be analytically described by logistic laws and that the topological properties of the network are governed by robust log-normal distributions characterizing the network's connectivity and small-world properties that are consistent over time. Moreover, we find that the double-Pareto-like distributions for the connectivity emerge for major roads and can be modeled via a stochastic content-based network model using simple space-filling principles.

Competition between global and local online social networks

NASA Astrophysics Data System (ADS)

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

2016-04-01

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

Competition between global and local online social networks.

PubMed

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

2016-04-27

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

Therapeutic target discovery using Boolean network attractors: improvements of kali

PubMed Central

Guziolowski, Carito

2018-01-01

In a previous article, an algorithm for identifying therapeutic targets in Boolean networks modelling pathological mechanisms was introduced. In the present article, the improvements made on this algorithm, named kali, are described. These improvements are (i) the possibility to work on asynchronous Boolean networks, (ii) a finer assessment of therapeutic targets and (iii) the possibility to use multivalued logic. kali assumes that the attractors of a dynamical system, such as a Boolean network, are associated with the phenotypes of the modelled biological system. Given a logic-based model of pathological mechanisms, kali searches for therapeutic targets able to reduce the reachability of the attractors associated with pathological phenotypes, thus reducing their likeliness. kali is illustrated on an example network and used on a biological case study. The case study is a published logic-based model of bladder tumorigenesis from which kali returns consistent results. However, like any computational tool, kali can predict but cannot replace human expertise: it is a supporting tool for coping with the complexity of biological systems in the field of drug discovery. PMID:29515890

Propagation Modeling and Defending of a Mobile Sensor Worm in Wireless Sensor and Actuator Networks.

PubMed

Wang, Tian; Wu, Qun; Wen, Sheng; Cai, Yiqiao; Tian, Hui; Chen, Yonghong; Wang, Baowei

2017-01-13

WSANs (Wireless Sensor and Actuator Networks) are derived from traditional wireless sensor networks by introducing mobile actuator elements. Previous studies indicated that mobile actuators can improve network performance in terms of data collection, energy supplementation, etc. However, according to our experimental simulations, the actuator's mobility also causes the sensor worm to spread faster if an attacker launches worm attacks on an actuator and compromises it successfully. Traditional worm propagation models and defense strategies did not consider the diffusion with a mobile worm carrier. To address this new problem, we first propose a microscopic mathematical model to describe the propagation dynamics of the sensor worm. Then, a two-step local defending strategy (LDS) with a mobile patcher (a mobile element which can distribute patches) is designed to recover the network. In LDS, all recovering operations are only taken in a restricted region to minimize the cost. Extensive experimental results demonstrate that our model estimations are rather accurate and consistent with the actual spreading scenario of the mobile sensor worm. Moreover, on average, the LDS outperforms other algorithms by approximately 50% in terms of the cost.

Reliability of Wireless Sensor Networks

PubMed Central

Dâmaso, Antônio; Rosa, Nelson; Maciel, Paulo

2014-01-01

Wireless Sensor Networks (WSNs) consist of hundreds or thousands of sensor nodes with limited processing, storage, and battery capabilities. There are several strategies to reduce the power consumption of WSN nodes (by increasing the network lifetime) and increase the reliability of the network (by improving the WSN Quality of Service). However, there is an inherent conflict between power consumption and reliability: an increase in reliability usually leads to an increase in power consumption. For example, routing algorithms can send the same packet though different paths (multipath strategy), which it is important for reliability, but they significantly increase the WSN power consumption. In this context, this paper proposes a model for evaluating the reliability of WSNs considering the battery level as a key factor. Moreover, this model is based on routing algorithms used by WSNs. In order to evaluate the proposed models, three scenarios were considered to show the impact of the power consumption on the reliability of WSNs. PMID:25157553

Development of a Dynamic Traffic Assignment Model for Northern Nevada

DOT National Transportation Integrated Search

2014-06-01

The objective of this research is to build and calibrate a DTA model for Northern Nevada (RenoSparks Area) based on the network profile and travel demand information updated to date. The critical procedures include development of consistent and readi...

Gain Modulation by an Urgency Signal Controls the Speed–Accuracy Trade-Off in a Network Model of a Cortical Decision Circuit

PubMed Central

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

2011-01-01

The speed–accuracy trade-off (SAT) is ubiquitous in decision tasks. While the neural mechanisms underlying decisions are generally well characterized, the application of decision-theoretic methods to the SAT has been difficult to reconcile with experimental data suggesting that decision thresholds are inflexible. Using a network model of a cortical decision circuit, we demonstrate the SAT in a manner consistent with neural and behavioral data and with mathematical models that optimize speed and accuracy with respect to one another. In simulations of a reaction time task, we modulate the gain of the network with a signal encoding the urgency to respond. As the urgency signal builds up, the network progresses through a series of processing stages supporting noise filtering, integration of evidence, amplification of integrated evidence, and choice selection. Analysis of the network's dynamics formally characterizes this progression. Slower buildup of urgency increases accuracy by slowing down the progression. Faster buildup has the opposite effect. Because the network always progresses through the same stages, decision-selective firing rates are stereotyped at decision time. PMID:21415911

Gain modulation by an urgency signal controls the speed-accuracy trade-off in a network model of a cortical decision circuit.

PubMed

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

2011-01-01

The speed-accuracy trade-off (SAT) is ubiquitous in decision tasks. While the neural mechanisms underlying decisions are generally well characterized, the application of decision-theoretic methods to the SAT has been difficult to reconcile with experimental data suggesting that decision thresholds are inflexible. Using a network model of a cortical decision circuit, we demonstrate the SAT in a manner consistent with neural and behavioral data and with mathematical models that optimize speed and accuracy with respect to one another. In simulations of a reaction time task, we modulate the gain of the network with a signal encoding the urgency to respond. As the urgency signal builds up, the network progresses through a series of processing stages supporting noise filtering, integration of evidence, amplification of integrated evidence, and choice selection. Analysis of the network's dynamics formally characterizes this progression. Slower buildup of urgency increases accuracy by slowing down the progression. Faster buildup has the opposite effect. Because the network always progresses through the same stages, decision-selective firing rates are stereotyped at decision time.

THE CHOICE OF OPTIMAL STRUCTURE OF ARTIFICIAL NEURAL NETWORK CLASSIFIER INTENDED FOR CLASSIFICATION OF WELDING FLAWS

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

Sikora, R.; Chady, T.; Baniukiewicz, P.

2010-02-22

Nondestructive testing and evaluation are under continuous development. Currently researches are concentrated on three main topics: advancement of existing methods, introduction of novel methods and development of artificial intelligent systems for automatic defect recognition (ADR). Automatic defect classification algorithm comprises of two main tasks: creating a defect database and preparing a defect classifier. Here, the database was built using defect features that describe all geometrical and texture properties of the defect. Almost twenty carefully selected features calculated for flaws extracted from real radiograms were used. The radiograms were obtained from shipbuilding industry and they were verified by qualified operator. Twomore » weld defect's classifiers based on artificial neural networks were proposed and compared. First model consisted of one neural network model, where each output neuron corresponded to different defect group. The second model contained five neural networks. Each neural network had one neuron on output and was responsible for detection of defects from one group. In order to evaluate the effectiveness of the neural networks classifiers, the mean square errors were calculated for test radiograms and compared.« less

The Choice of Optimal Structure of Artificial Neural Network Classifier Intended for Classification of Welding Flaws

NASA Astrophysics Data System (ADS)

Sikora, R.; Chady, T.; Baniukiewicz, P.; Caryk, M.; Piekarczyk, B.

2010-02-01

Nondestructive testing and evaluation are under continuous development. Currently researches are concentrated on three main topics: advancement of existing methods, introduction of novel methods and development of artificial intelligent systems for automatic defect recognition (ADR). Automatic defect classification algorithm comprises of two main tasks: creating a defect database and preparing a defect classifier. Here, the database was built using defect features that describe all geometrical and texture properties of the defect. Almost twenty carefully selected features calculated for flaws extracted from real radiograms were used. The radiograms were obtained from shipbuilding industry and they were verified by qualified operator. Two weld defect's classifiers based on artificial neural networks were proposed and compared. First model consisted of one neural network model, where each output neuron corresponded to different defect group. The second model contained five neural networks. Each neural network had one neuron on output and was responsible for detection of defects from one group. In order to evaluate the effectiveness of the neural networks classifiers, the mean square errors were calculated for test radiograms and compared.

Improving Earth/Prediction Models to Improve Network Processing

NASA Astrophysics Data System (ADS)

Wagner, G. S.

2017-12-01

The United States Atomic Energy Detection System (USAEDS) primaryseismic network consists of a relatively small number of arrays andthree-component stations. The relatively small number of stationsin the USAEDS primary network make it both necessary and feasibleto optimize both station and network processing.Station processing improvements include detector tuning effortsthat use Receiver Operator Characteristic (ROC) curves to helpjudiciously set acceptable Type 1 (false) vs. Type 2 (miss) errorrates. Other station processing improvements include the use ofempirical/historical observations and continuous background noisemeasurements to compute time-varying, maximum likelihood probabilityof detection thresholds.The USAEDS network processing software makes extensive use of theazimuth and slowness information provided by frequency-wavenumberanalysis at array sites, and polarization analysis at three-componentsites. Most of the improvements in USAEDS network processing aredue to improvements in the models used to predict azimuth, slowness,and probability of detection. Kriged travel-time, azimuth andslowness corrections-and associated uncertainties-are computedusing a ground truth database. Improvements in station processingand the use of improved models for azimuth, slowness, and probabilityof detection have led to significant improvements in USADES networkprocessing.

Effect of resource constraints on intersimilar coupled networks.

PubMed

Shai, S; Dobson, S

2012-12-01

Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.

Effect of resource constraints on intersimilar coupled networks

NASA Astrophysics Data System (ADS)

Shai, S.; Dobson, S.

2012-12-01

Most real-world networks do not live in isolation but are often coupled together within a larger system. Recent studies have shown that intersimilarity between coupled networks increases the connectivity of the overall system. However, unlike connected nodes in a single network, coupled nodes often share resources, like time, energy, and memory, which can impede flow processes through contention when intersimilarly coupled. We study a model of a constrained susceptible-infected-recovered (SIR) process on a system consisting of two random networks sharing the same set of nodes, where nodes are limited to interact with (and therefore infect) a maximum number of neighbors at each epidemic time step. We obtain that, in agreement with previous studies, when no limit exists (regular SIR model), positively correlated (intersimilar) coupling results in a lower epidemic threshold than negatively correlated (interdissimilar) coupling. However, in the case of the constrained SIR model, the obtained epidemic threshold is lower with negatively correlated coupling. The latter finding differentiates our work from previous studies and provides another step towards revealing the qualitative differences between single and coupled networks.

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

NASA Astrophysics Data System (ADS)

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

2016-09-01

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

Integration Processes Compared: Cortical Differences for Consistency Evaluation and Passive Comprehension in Local and Global Coherence.

PubMed

Egidi, Giovanna; Caramazza, Alfonso

2016-10-01

This research studies the neural systems underlying two integration processes that take place during natural discourse comprehension: consistency evaluation and passive comprehension. Evaluation was operationalized with a consistency judgment task and passive comprehension with a passive listening task. Using fMRI, the experiment examined the integration of incoming sentences with more recent, local context and with more distal, global context in these two tasks. The stimuli were stories in which we manipulated the consistency of the endings with the local context and the relevance of the global context for the integration of the endings. A whole-brain analysis revealed several differences between the two tasks. Two networks previously associated with semantic processing and attention orienting showed more activation during the judgment than the passive listening task. A network previously associated with episodic memory retrieval and construction of mental scenes showed greater activity when global context was relevant, but only during the judgment task. This suggests that evaluation, more than passive listening, triggers the reinstantiation of global context and the construction of a rich mental model for the story. Finally, a network previously linked to fluent updating of a knowledge base showed greater activity for locally consistent endings than inconsistent ones, but only during passive listening, suggesting a mode of comprehension that relies on a local scope approach to language processing. Taken together, these results show that consistency evaluation and passive comprehension weigh differently on distal and local information and are implemented, in part, by different brain networks.

Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights.

PubMed

Wang, Jin-Liang; Wu, Huai-Ning; Huang, Tingwen; Ren, Shun-Yan; Wu, Jigang

2017-08-01

A complex dynamical network consisting of N identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.

Impacts of clustering on interacting epidemics.

PubMed

Wang, Bing; Cao, Lang; Suzuki, Hideyuki; Aihara, Kazuyuki

2012-07-07

Since community structures in real networks play a major role for the epidemic spread, we therefore explore two interacting diseases spreading in networks with community structures. As a network model with community structures, we propose a random clique network model composed of different orders of cliques. We further assume that each disease spreads only through one type of cliques; this assumption corresponds to the issue that two diseases spread inside communities and outside them. Considering the relationship between the susceptible-infected-recovered (SIR) model and the bond percolation theory, we apply this theory to clique random networks under the assumption that the occupation probability is clique-type dependent, which is consistent with the observation that infection rates inside a community and outside it are different, and obtain a number of statistical properties for this model. Two interacting diseases that compete the same hosts are also investigated, which leads to a natural generalization of analyzing an arbitrary number of infectious diseases. For two-disease dynamics, the clustering effect is hypersensitive to the cohesiveness and concentration of cliques; this illustrates the impacts of clustering and the composition of subgraphs in networks on epidemic behavior. The analysis of coexistence/bistability regions provides significant insight into the relationship between the network structure and the potential epidemic prevalence. Copyright © 2012 Elsevier Ltd. All rights reserved.

NetFlow Dynamics

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

Corbet Jr., Thomas F; Beyeler, Walter E; Vanwestrienen, Dirk

NetFlow Dynamics is a web-accessible analysis environment for simulating dynamic flows of materials on model networks. Performing a simulation requires both the NetFlow Dynamics application and a network model which is a description of the structure of the nodes and edges of a network including the flow capacity of each edge and the storage capacity of each node, and the sources and sinks of the material flowing on the network. NetFlow Dynamics consists of databases for storing network models, algorithms to calculate flows on networks, and a GIS-based graphical interface for performing simulations and viewing simulation results. Simulated flows aremore » dynamic in the sense that flows on each edge of the network and inventories at each node change with time and can be out of equilibrium with boundary conditions. Any number of network models could be simulated using Net Flow Dynamics. To date, the models simulated have been models of petroleum infrastructure. The main model has been the National Transportation Fuels Model (NTFM), a network of U.S. oil fields, transmission pipelines, rail lines, refineries, tank farms, and distribution terminals. NetFlow Dynamics supports two different flow algorithms, the Gradient Flow algorithm and the Inventory Control algorithm, that were developed specifically for the NetFlow Dynamics application. The intent is to add additional algorithms in the future as needed. The ability to select from multiple algorithms is desirable because a single algorithm never covers all analysis needs. The current algorithms use a demand-driven capacity-constrained formulation which means that the algorithms strive to use all available capacity and stored inventory to meet desired flows to sinks, subject to the capacity constraints of each network component. The current flow algorithms are best suited for problems in which a material flows on a capacity-constrained network representing a supply chain in which the material supplied can be stored at each node of the network. In the petroleum models, the flowing materials are crude oil and refined products that can be stored at tank farms, refineries, or terminals (i.e. the nodes of the network). Examples of other network models that could be simulated are currency flowing in a financial network, agricultural products moving to market, or natural gas flowing on a pipeline network.« less

Synchronization in neural nets

NASA Technical Reports Server (NTRS)

Vidal, Jacques J.; Haggerty, John

1988-01-01

The paper presents an artificial neural network concept (the Synchronizable Oscillator Networks) where the instants of individual firings in the form of point processes constitute the only form of information transmitted between joining neurons. In the model, neurons fire spontaneously and regularly in the absence of perturbation. When interaction is present, the scheduled firings are advanced or delayed by the firing of neighboring neurons. Networks of such neurons become global oscillators which exhibit multiple synchronizing attractors. From arbitrary initial states, energy minimization learning procedures can make the network converge to oscillatory modes that satisfy multi-dimensional constraints. Such networks can directly represent routing and scheduling problems that consist of ordering sequences of events.

Estimation of dew point temperature using neuro-fuzzy and neural network techniques

NASA Astrophysics Data System (ADS)

Kisi, Ozgur; Kim, Sungwon; Shiri, Jalal

2013-11-01

This study investigates the ability of two different artificial neural network (ANN) models, generalized regression neural networks model (GRNNM) and Kohonen self-organizing feature maps neural networks model (KSOFM), and two different adaptive neural fuzzy inference system (ANFIS) models, ANFIS model with sub-clustering identification (ANFIS-SC) and ANFIS model with grid partitioning identification (ANFIS-GP), for estimating daily dew point temperature. The climatic data that consisted of 8 years of daily records of air temperature, sunshine hours, wind speed, saturation vapor pressure, relative humidity, and dew point temperature from three weather stations, Daego, Pohang, and Ulsan, in South Korea were used in the study. The estimates of ANN and ANFIS models were compared according to the three different statistics, root mean square errors, mean absolute errors, and determination coefficient. Comparison results revealed that the ANFIS-SC, ANFIS-GP, and GRNNM models showed almost the same accuracy and they performed better than the KSOFM model. Results also indicated that the sunshine hours, wind speed, and saturation vapor pressure have little effect on dew point temperature. It was found that the dew point temperature could be successfully estimated by using T mean and R H variables.

The transmission process: A combinatorial stochastic process for the evolution of transmission trees over networks.

PubMed

Sainudiin, Raazesh; Welch, David

2016-12-07

We derive a combinatorial stochastic process for the evolution of the transmission tree over the infected vertices of a host contact network in a susceptible-infected (SI) model of an epidemic. Models of transmission trees are crucial to understanding the evolution of pathogen populations. We provide an explicit description of the transmission process on the product state space of (rooted planar ranked labelled) binary transmission trees and labelled host contact networks with SI-tags as a discrete-state continuous-time Markov chain. We give the exact probability of any transmission tree when the host contact network is a complete, star or path network - three illustrative examples. We then develop a biparametric Beta-splitting model that directly generates transmission trees with exact probabilities as a function of the model parameters, but without explicitly modelling the underlying contact network, and show that for specific values of the parameters we can recover the exact probabilities for our three example networks through the Markov chain construction that explicitly models the underlying contact network. We use the maximum likelihood estimator (MLE) to consistently infer the two parameters driving the transmission process based on observations of the transmission trees and use the exact MLE to characterize equivalence classes over the space of contact networks with a single initial infection. An exploratory simulation study of the MLEs from transmission trees sampled from three other deterministic and four random families of classical contact networks is conducted to shed light on the relation between the MLEs of these families with some implications for statistical inference along with pointers to further extensions of our models. The insights developed here are also applicable to the simplest models of "meme" evolution in online social media networks through transmission events that can be distilled from observable actions such as "likes", "mentions", "retweets" and "+1s" along with any concomitant comments. Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

Construction of pore network models for Berea and Fontainebleau sandstones using non-linear programing and optimization techniques

NASA Astrophysics Data System (ADS)

Sharqawy, Mostafa H.

2016-12-01

Pore network models (PNM) of Berea and Fontainebleau sandstones were constructed using nonlinear programming (NLP) and optimization methods. The constructed PNMs are considered as a digital representation of the rock samples which were based on matching the macroscopic properties of the porous media and used to conduct fluid transport simulations including single and two-phase flow. The PNMs consisted of cubic networks of randomly distributed pores and throats sizes and with various connectivity levels. The networks were optimized such that the upper and lower bounds of the pore sizes are determined using the capillary tube bundle model and the Nelder-Mead method instead of guessing them, which reduces the optimization computational time significantly. An open-source PNM framework was employed to conduct transport and percolation simulations such as invasion percolation and Darcian flow. The PNM model was subsequently used to compute the macroscopic properties; porosity, absolute permeability, specific surface area, breakthrough capillary pressure, and primary drainage curve. The pore networks were optimized to allow for the simulation results of the macroscopic properties to be in excellent agreement with the experimental measurements. This study demonstrates that non-linear programming and optimization methods provide a promising method for pore network modeling when computed tomography imaging may not be readily available.

Computational models of airway branching morphogenesis.

PubMed

Varner, Victor D; Nelson, Celeste M

2017-07-01

The bronchial network of the mammalian lung consists of millions of dichotomous branches arranged in a highly complex, space-filling tree. Recent computational models of branching morphogenesis in the lung have helped uncover the biological mechanisms that construct this ramified architecture. In this review, we focus on three different theoretical approaches - geometric modeling, reaction-diffusion modeling, and continuum mechanical modeling - and discuss how, taken together, these models have identified the geometric principles necessary to build an efficient bronchial network, as well as the patterning mechanisms that specify airway geometry in the developing embryo. We emphasize models that are integrated with biological experiments and suggest how recent progress in computational modeling has advanced our understanding of airway branching morphogenesis. Copyright © 2016 Elsevier Ltd. All rights reserved.

Examining Pseudotsuga menziesii biomass change dynamics through succession using a regional forest inventory system

Treesearch

David M. Bell; Andrew N. Gray

2015-01-01

Models of forest succession provide an appealing conceptual framework for understanding forest dynamics, but uncertainty in the degree to which patterns are regionally consistent might limit the application of successional theory in forest management. Remeasurements of forest inventory networks provide an opportunity to assess this consistency, improving our...

Adaptive online inverse control of a shape memory alloy wire actuator using a dynamic neural network

NASA Astrophysics Data System (ADS)

Mai, Huanhuan; Song, Gangbing; Liao, Xiaofeng

2013-01-01

Shape memory alloy (SMA) actuators exhibit severe hysteresis, a nonlinear behavior, which complicates control strategies and limits their applications. This paper presents a new approach to controlling an SMA actuator through an adaptive inverse model based controller that consists of a dynamic neural network (DNN) identifier, a copy dynamic neural network (CDNN) feedforward term and a proportional (P) feedback action. Unlike fixed hysteresis models used in most inverse controllers, the proposed one uses a DNN to identify online the relationship between the applied voltage to the actuator and the displacement (the inverse model). Even without a priori knowledge of the SMA hysteresis and without pre-training, the proposed controller can precisely control the SMA wire actuator in various tracking tasks by identifying online the inverse model of the SMA actuator. Experiments were conducted, and experimental results demonstrated real-time modeling capabilities of DNN and the performance of the adaptive inverse controller.

Multilane Traffic Flow Modeling Using Cellular Automata Theory

NASA Astrophysics Data System (ADS)

Chechina, Antonina; Churbanova, Natalia; Trapeznikova, Marina

2018-02-01

The paper deals with the mathematical modeling of traffic flows on urban road networks using microscopic approach. The model is based on the cellular automata theory and presents a generalization of the Nagel-Schreckenberg model to a multilane case. The created program package allows to simulate traffic on various types of road fragments (T or X type intersection, strait road elements, etc.) and on road networks that consist of these elements. Besides that, it allows to predict the consequences of various decisions regarding road infrastructure changes, such as: number of lanes increasing/decreasing, putting new traffic lights into operation, building new roads, entrances/exits, road junctions.

A model for characterizing residential ground current and magnetic field fluctuations.

PubMed

Mader, D L; Peralta, S B; Sherar, M D

1994-01-01

The current through the residential grounding circuit is an important source for magnetic fields; field variations near the grounding circuit accurately track fluctuations in this ground current. In this paper, a model is presented which permits calculation of the range of these fluctuations. A discrete network model is used to simulate a local distribution system for a single street, and a statistical model to simulate unbalanced currents in the system. Simulations of three-house and ten-house networks show that random appliance operation leads to ground current fluctuations which can be quite large, on the order of 600%. This is consistent with measured fluctuations in an actual house.

A three-stage heuristic for harvest scheduling with access road network development

Treesearch

Mark M. Clark; Russell D. Meller; Timothy P. McDonald

2000-01-01

In this article we present a new model for the scheduling of forest harvesting with spatial and temporal constraints. Our approach is unique in that we incorporate access road network development into the harvest scheduling selection process. Due to the difficulty of solving the problem optimally, we develop a heuristic that consists of a solution construction stage...

Interplay of ICP and IXP over the Internet with power-law features

NASA Astrophysics Data System (ADS)

Fan, Zhongyan; Tang, Wallace Kit-Sang

The Internet is the largest artificial network consisting of billions of IP devices, managed by tens of thousands of autonomous systems (ASes). Due to its importance, the Internet has received much attention and its topological features, mainly in AS-level, have been widely explored from the complex network perspective. However, most of the previous studies assume a homogeneous model in which nodes are indistinguishable in nature. It may be good for a general study of topological structure, but unfortunately it fails to reflect the functionality. The Internet ecology is in fact heterogeneous and highly complex. It consists of various elements such as Internet Exchange Points (IXPs), Internet Content Providers (ICPs), and normal Autonomous System (ASes), realizing different roles in the Internet. In this paper, we propose level-structured network models for investigating how ICP performs under the AS-topology with power-law features and how IXP enhances its performance from a complex network perspective. Based on real data, our results reveal that the power-law nature of the Internet facilitates content delivery not only in efficiency but also in path redundancy. Moreover, the proposed multi-level framework is able to clearly illustrate the significant benefits gained by ICP from IXP peerings.

A big data pipeline: Identifying dynamic gene regulatory networks from time-course Gene Expression Omnibus data with applications to influenza infection.

PubMed

Carey, Michelle; Ramírez, Juan Camilo; Wu, Shuang; Wu, Hulin

2018-07-01

A biological host response to an external stimulus or intervention such as a disease or infection is a dynamic process, which is regulated by an intricate network of many genes and their products. Understanding the dynamics of this gene regulatory network allows us to infer the mechanisms involved in a host response to an external stimulus, and hence aids the discovery of biomarkers of phenotype and biological function. In this article, we propose a modeling/analysis pipeline for dynamic gene expression data, called Pipeline4DGEData, which consists of a series of statistical modeling techniques to construct dynamic gene regulatory networks from the large volumes of high-dimensional time-course gene expression data that are freely available in the Gene Expression Omnibus repository. This pipeline has a consistent and scalable structure that allows it to simultaneously analyze a large number of time-course gene expression data sets, and then integrate the results across different studies. We apply the proposed pipeline to influenza infection data from nine studies and demonstrate that interesting biological findings can be discovered with its implementation.

Experimental and computational analysis of a large protein network that controls fat storage reveals the design principles of a signaling network.

PubMed

Al-Anzi, Bader; Arpp, Patrick; Gerges, Sherif; Ormerod, Christopher; Olsman, Noah; Zinn, Kai

2015-05-01

An approach combining genetic, proteomic, computational, and physiological analysis was used to define a protein network that regulates fat storage in budding yeast (Saccharomyces cerevisiae). A computational analysis of this network shows that it is not scale-free, and is best approximated by the Watts-Strogatz model, which generates "small-world" networks with high clustering and short path lengths. The network is also modular, containing energy level sensing proteins that connect to four output processes: autophagy, fatty acid synthesis, mRNA processing, and MAP kinase signaling. The importance of each protein to network function is dependent on its Katz centrality score, which is related both to the protein's position within a module and to the module's relationship to the network as a whole. The network is also divisible into subnetworks that span modular boundaries and regulate different aspects of fat metabolism. We used a combination of genetics and pharmacology to simultaneously block output from multiple network nodes. The phenotypic results of this blockage define patterns of communication among distant network nodes, and these patterns are consistent with the Watts-Strogatz model.

A feedback control model for network flow with multiple pure time delays

NASA Technical Reports Server (NTRS)

Press, J.

1972-01-01

A control model describing a network flow hindered by multiple pure time (or transport) delays is formulated. Feedbacks connect each desired output with a single control sector situated at the origin. The dynamic formulation invokes the use of differential difference equations. This causes the characteristic equation of the model to consist of transcendental functions instead of a common algebraic polynomial. A general graphical criterion is developed to evaluate the stability of such a problem. A digital computer simulation confirms the validity of such criterion. An optimal decision making process with multiple delays is presented.

A Networks Approach to Modeling Enzymatic Reactions.

PubMed

Imhof, P

2016-01-01

Modeling enzymatic reactions is a demanding task due to the complexity of the system, the many degrees of freedom involved and the complex, chemical, and conformational transitions associated with the reaction. Consequently, enzymatic reactions are not determined by precisely one reaction pathway. Hence, it is beneficial to obtain a comprehensive picture of possible reaction paths and competing mechanisms. By combining individually generated intermediate states and chemical transition steps a network of such pathways can be constructed. Transition networks are a discretized representation of a potential energy landscape consisting of a multitude of reaction pathways connecting the end states of the reaction. The graph structure of the network allows an easy identification of the energetically most favorable pathways as well as a number of alternative routes. © 2016 Elsevier Inc. All rights reserved.

Predicting clinical outcome of neuroblastoma patients using an integrative network-based approach.

PubMed

Tranchevent, Léon-Charles; Nazarov, Petr V; Kaoma, Tony; Schmartz, Georges P; Muller, Arnaud; Kim, Sang-Yoon; Rajapakse, Jagath C; Azuaje, Francisco

2018-06-07

One of the main current challenges in computational biology is to make sense of the huge amounts of multidimensional experimental data that are being produced. For instance, large cohorts of patients are often screened using different high-throughput technologies, effectively producing multiple patient-specific molecular profiles for hundreds or thousands of patients. We propose and implement a network-based method that integrates such patient omics data into Patient Similarity Networks. Topological features derived from these networks were then used to predict relevant clinical features. As part of the 2017 CAMDA challenge, we have successfully applied this strategy to a neuroblastoma dataset, consisting of genomic and transcriptomic data. In particular, we observe that models built on our network-based approach perform at least as well as state of the art models. We furthermore explore the effectiveness of various topological features and observe, for instance, that redundant centrality metrics can be combined to build more powerful models. We demonstrate that the networks inferred from omics data contain clinically relevant information and that patient clinical outcomes can be predicted using only network topological data. This article was reviewed by Yang-Yu Liu, Tomislav Smuc and Isabel Nepomuceno.

Craniofacial reconstruction evaluation by geodesic network.

PubMed

Zhao, Junli; Liu, Cuiting; Wu, Zhongke; Duan, Fuqing; Wang, Kang; Jia, Taorui; Liu, Quansheng

2014-01-01

Craniofacial reconstruction is to estimate an individual's face model from its skull. It has a widespread application in forensic medicine, archeology, medical cosmetic surgery, and so forth. However, little attention is paid to the evaluation of craniofacial reconstruction. This paper proposes an objective method to evaluate globally and locally the reconstructed craniofacial faces based on the geodesic network. Firstly, the geodesic networks of the reconstructed craniofacial face and the original face are built, respectively, by geodesics and isogeodesics, whose intersections are network vertices. Then, the absolute value of the correlation coefficient of the features of all corresponding geodesic network vertices between two models is taken as the holistic similarity, where the weighted average of the shape index values in a neighborhood is defined as the feature of each network vertex. Moreover, the geodesic network vertices of each model are divided into six subareas, that is, forehead, eyes, nose, mouth, cheeks, and chin, and the local similarity is measured for each subarea. Experiments using 100 pairs of reconstructed craniofacial faces and their corresponding original faces show that the evaluation by our method is roughly consistent with the subjective evaluation derived from thirty-five persons in five groups.

Measuring the Evolutionary Rewiring of Biological Networks

PubMed Central

Shou, Chong; Bhardwaj, Nitin; Lam, Hugo Y. K.; Yan, Koon-Kiu; Kim, Philip M.; Snyder, Michael; Gerstein, Mark B.

2011-01-01

We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or “rewire”, at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of “commonplace” networks such as family trees, co-authorships and linux-kernel function dependencies. PMID:21253555

Bidirectional selection between two classes in complex social networks.

PubMed

Zhou, Bin; He, Zhe; Jiang, Luo-Luo; Wang, Nian-Xin; Wang, Bing-Hong

2014-12-19

The bidirectional selection between two classes widely emerges in various social lives, such as commercial trading and mate choosing. Until now, the discussions on bidirectional selection in structured human society are quite limited. We demonstrated theoretically that the rate of successfully matching is affected greatly by individuals' neighborhoods in social networks, regardless of the type of networks. Furthermore, it is found that the high average degree of networks contributes to increasing rates of successful matches. The matching performance in different types of networks has been quantitatively investigated, revealing that the small-world networks reinforces the matching rate more than scale-free networks at given average degree. In addition, our analysis is consistent with the modeling result, which provides the theoretical understanding of underlying mechanisms of matching in complex networks.

REGIONAL OXIDANT MODEL (ROM) USER'S GUIDE, PART 2: THE ROM PREPROCESSOR NETWORK

EPA Science Inventory

The Regional Oxidant Model (ROM) determines hourly concentrations and fates of zone and 34 other chemical species over a scale of 1000 km x 1000 km for ozone "episodes" of up to one month's duration. he model structure, based on phenomenological concepts, consists of 3 1/2 layers...

Imbedded-Fracture Formulation of THMC Processes in Fractured Media

NASA Astrophysics Data System (ADS)

Yeh, G. T.; Tsai, C. H.; Sung, R.

2016-12-01

Fractured media consist of porous materials and fracture networks. There exist four approaches to mathematically formulating THMC (Thermal-Hydrology-Mechanics-Chemistry) processes models in the system: (1) Equivalent Porous Media, (2) Dual Porosity or Dual Continuum, (3) Heterogeneous Media, and (4) Discrete Fracture Network. The first approach cannot explicitly explore the interactions between porous materials and fracture networks. The second approach introduces too many extra parameters (namely, exchange coefficients) between two media. The third approach may make the problems too stiff because the order of material heterogeneity may be too much. The fourth approach ignore the interaction between porous materials and fracture networks. This talk presents an alternative approach in which fracture networks are modeled with a lower dimension than the surrounding porous materials. Theoretical derivation of mathematical formulations will be given. An example will be illustrated to show the feasibility of this approach.

Transformational leadership and group interaction as climate antecedents: a social network analysis.

PubMed

Zohar, Dov; Tenne-Gazit, Orly

2008-07-01

In order to test the social mechanisms through which organizational climate emerges, this article introduces a model that combines transformational leadership and social interaction as antecedents of climate strength (i.e., the degree of within-unit agreement about climate perceptions). Despite their longstanding status as primary variables, both antecedents have received limited empirical research. The sample consisted of 45 platoons of infantry soldiers from 5 different brigades, using safety climate as the exemplar. Results indicate a partially mediated model between transformational leadership and climate strength, with density of group communication network as the mediating variable. In addition, the results showed independent effects for group centralization of the communication and friendship networks, which exerted incremental effects on climate strength over transformational leadership. Whereas centralization of the communication network was found to be negatively related to climate strength, centralization of the friendship network was positively related to it. Theoretical and practical implications are discussed.

Disordered configurations of the Glauber model in two-dimensional networks

NASA Astrophysics Data System (ADS)

Bačić, Iva; Franović, Igor; Perc, Matjaž

2017-12-01

We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics fails to reach the ordered state in the thermodynamic limit. Due to the interplay of the perturbed regular topology and the energy neutral stochastic state transitions, the stationary state consists of two intertwined domains, manifested as multiclustered states on the original lattice. Moreover, for intermediate rewiring probabilities, one finds an additional source of disorder due to the low connectivity degree, which gives rise to small isolated droplets of spins. We also examine the ordering process in paradigmatic two-layer networks with heterogeneous rewiring probabilities. Comparing the cases of a multiplex network and the corresponding network with random inter-layer connectivity, we demonstrate that the character of the final state qualitatively depends on the type of inter-layer connections.

Definition and evaluation of the data-link layer of PACnet

NASA Astrophysics Data System (ADS)

Alsafadi, Yasser H.; Martinez, Ralph; Sanders, William H.

1991-07-01

PACnet is a 200-500 Mbps dual-ring fiber optic network designed to implement a picture archiving and communication system (PACS) in a hospital environment. The network consists of three channels: an image transfer channel, a command and control channel, and a real-time data channel. An initial network interface unit (NIU) design for PACnet consisted of a functional description of the protocols and NIU major components. In order to develop a demonstration prototype, additional definition of protocol algorithms of each channel is necessary. Using the International Standards Organization/Open Systems Interconnection (ISO/OSI) reference model as a guide, the definition of the data link layer is extended. This definition covers interface service specifications for the two constituent sublayers: logical link control (LLC) and medium access control (MAC). Furthermore, it describes procedures for data transfer, mechanisms of error detection and fault recovery. A performance evaluation study was then made to determine how the network performs under various application scenarios. The performance evaluation study was performed using stochastic activity networks, which can formally describe the network behavior. The results of the study demonstrate the feasibility of PACnet as an integrated image, data, and voice network for PACS.

A brain-region-based meta-analysis method utilizing the Apriori algorithm.

PubMed

Niu, Zhendong; Nie, Yaoxin; Zhou, Qian; Zhu, Linlin; Wei, Jieyao

2016-05-18

Brain network connectivity modeling is a crucial method for studying the brain's cognitive functions. Meta-analyses can unearth reliable results from individual studies. Meta-analytic connectivity modeling is a connectivity analysis method based on regions of interest (ROIs) which showed that meta-analyses could be used to discover brain network connectivity. In this paper, we propose a new meta-analysis method that can be used to find network connectivity models based on the Apriori algorithm, which has the potential to derive brain network connectivity models from activation information in the literature, without requiring ROIs. This method first extracts activation information from experimental studies that use cognitive tasks of the same category, and then maps the activation information to corresponding brain areas by using the automatic anatomical label atlas, after which the activation rate of these brain areas is calculated. Finally, using these brain areas, a potential brain network connectivity model is calculated based on the Apriori algorithm. The present study used this method to conduct a mining analysis on the citations in a language review article by Price (Neuroimage 62(2):816-847, 2012). The results showed that the obtained network connectivity model was consistent with that reported by Price. The proposed method is helpful to find brain network connectivity by mining the co-activation relationships among brain regions. Furthermore, results of the co-activation relationship analysis can be used as a priori knowledge for the corresponding dynamic causal modeling analysis, possibly achieving a significant dimension-reducing effect, thus increasing the efficiency of the dynamic causal modeling analysis.

How Accurate Is A Hydraulic Model? | Science Inventory | US ...

EPA Pesticide Factsheets

Symposium paper Network hydraulic models are widely used, but their overall accuracy is often unknown. Models are developed to give utilities better insight into system hydraulic behavior, and increasingly the ability to predict the fate and transport of chemicals. Without an accessible and consistent means of validating a given model against the system it is meant to represent, the value of those supposed benefits should be questioned. Supervisory Control And Data Acquisition (SCADA) databases, though ubiquitous, are underused data sources for this type of task. Integrating a network model with a measurement database would offer professionals the ability to assess the model’s assumptions in an automated fashion by leveraging enormous amounts of data.

A network architecture supporting consistent rich behavior in collaborative interactive applications.

PubMed

Marsh, James; Glencross, Mashhuda; Pettifer, Steve; Hubbold, Roger

2006-01-01

Network architectures for collaborative virtual reality have traditionally been dominated by client-server and peer-to-peer approaches, with peer-to-peer strategies typically being favored where minimizing latency is a priority, and client-server where consistency is key. With increasingly sophisticated behavior models and the demand for better support for haptics, we argue that neither approach provides sufficient support for these scenarios and, thus, a hybrid architecture is required. We discuss the relative performance of different distribution strategies in the face of real network conditions and illustrate the problems they face. Finally, we present an architecture that successfully meets many of these challenges and demonstrate its use in a distributed virtual prototyping application which supports simultaneous collaboration for assembly, maintenance, and training applications utilizing haptics.

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

PubMed

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

Transportation and dynamic networks: Models, theory, and applications to supply chains, electric power, and financial networks

NASA Astrophysics Data System (ADS)

Liu, Zugang

Network systems, including transportation and logistic systems, electric power generation and distribution networks as well as financial networks, provide the critical infrastructure for the functioning of our societies and economies. The understanding of the dynamic behavior of such systems is also crucial to national security and prosperity. The identification of new connections between distinct network systems is the inspiration for the research in this dissertation. In particular, I answer two questions raised by Beckmann, McGuire, and Winsten (1956) and Copeland (1952) over half a century ago, which are, respectively, how are electric power flows related to transportation flows and does money flow like water or electricity? In addition, in this dissertation, I achieve the following: (1) I establish the relationships between transportation networks and three other classes of complex network systems: supply chain networks, electric power generation and transmission networks, and financial networks with intermediation. The establishment of such connections provides novel theoretical insights as well as new pricing mechanisms, and efficient computational methods. (2) I develop new modeling frameworks based on evolutionary variational inequality theory that capture the dynamics of such network systems in terms of the time-varying flows and incurred costs, prices, and, where applicable, profits. This dissertation studies the dynamics of such network systems by addressing both internal competition and/or cooperation, and external changes, such as varying costs and demands. (3) I focus, in depth, on electric power supply chains. By exploiting the relationships between transportation networks and electric power supply chains, I develop a large-scale network model that integrates electric power supply chains and fuel supply markets. The model captures both the economic transactions as well as the physical transmission constraints. The model is then applied to the New England electric power supply chain consisting of 6 states, 5 fuel types, 82 power generators, with a total of 573 generating units, and 10 demand markets. The empirical case study demonstrates that the regional electricity prices simulated by the model match very well the actual electricity prices in New England. I also utilize the model to study interactions between electric power supply chains and energy fuel markets.

Heteroclinic dynamics of coupled semiconductor lasers with optoelectronic feedback.

PubMed

Shahin, S; Vallini, F; Monifi, F; Rabinovich, M; Fainman, Y

2016-11-15

Generalized Lotka-Volterra (GLV) equations are important equations used in various areas of science to describe competitive dynamics among a population of N interacting nodes in a network topology. In this Letter, we introduce a photonic network consisting of three optoelectronically cross-coupled semiconductor lasers to realize a GLV model. In such a network, the interaction of intensity and carrier inversion rates, as well as phases of laser oscillator nodes, result in various dynamics. We study the influence of asymmetric coupling strength and frequency detuning between semiconductor lasers and show that inhibitory asymmetric coupling is required to achieve consecutive amplitude oscillations of the laser nodes. These studies were motivated primarily by the dynamical models used to model brain cognitive activities and their correspondence with dynamics obtained among coupled laser oscillators.

Identification of infection- and defense-related genes via a dynamic host-pathogen interaction network using a Candida albicans-zebrafish infection model.

PubMed

Kuo, Zong-Yu; Chuang, Yung-Jen; Chao, Chun-Cheih; Liu, Fu-Chen; Lan, Chung-Yu; Chen, Bor-Sen

2013-01-01

Candida albicans infections and candidiasis are difficult to treat and create very serious therapeutic challenges. In this study, based on interactive time profile microarray data of C. albicans and zebrafish during infection, the infection-related protein-protein interaction (PPI) networks of the two species and the intercellular PPI network between host and pathogen were simultaneously constructed by a dynamic interaction model, modeled as an integrated network consisting of intercellular invasion and cellular defense processes during infection. The signal transduction pathways in regulating morphogenesis and hyphal growth of C. albicans were further investigated based on significant interactions found in the intercellular PPI network. Two cellular networks were also developed corresponding to the different infection stages (adhesion and invasion), and then compared with each other to identify proteins from which we can gain more insight into the pathogenic role of hyphal development in the C. albicans infection process. Important defense-related proteins in zebrafish were predicted using the same approach. The hyphal growth PPI network, zebrafish PPI network and host-pathogen intercellular PPI network were combined to form an integrated infectious PPI network that helps us understand the systematic mechanisms underlying the pathogenicity of C. albicans and the immune response of the host, and may help improve medical therapies and facilitate the development of new antifungal drugs. Copyright © 2013 S. Karger AG, Basel.

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

Bidirectional influence: A longitudinal analysis of size of drug network and depression among inner-city residents in Baltimore, Maryland

PubMed Central

Yang, Jingyan; Latkin, Carl A.; Davey-Rothwell, Melissa

2015-01-01

BACKGROUND The prevalence of depression among drug users is high. It has been recognized that drug use behaviors can be influenced and spread through social networks. OBJECTIVES We investigated the directional relationship between social network factors and depressive symptoms among a sample of inner-city residents in Baltimore, MD. METHODS We performed a longitudinal study of four-wave data collected from a network-based HIV/STI prevention intervention for women and network members, consisting of both men and women. Our primary outcome and exposure were depression using CESD scale and social network characteristics, respectively. Linear mixed model with clustering adjustment was used to account for both repeated measurement and network design. RESULTS Of the 746 participants, those who had high levels of depression tended to be female, less educated, homeless, smokers, and did not have a main partner. In the univariate longitudinal model, larger size of drug network was significantly associated with depression (OR=1.38, p<0.001). This relationship held after controlling for age, gender, homeless in the past six months, college education, having a main partner, cigarette smoking, perceived health, and social support network (aOR=1.19, p=0.001). In the univariate mixed model using depression to predict size of drug network, the data suggested that depression was associated with larger size of drug network (coef.=1.23, p<0.001) and the same relation held in multivariate model (adjusted coef.=1.08, p=0.001). CONCLUSIONS The results suggest that larger size of drug network is a risk factor for depression, and vice versa. Further intervention strategies to reduce depression should address social networks factors. PMID:26584046

NCC Simulation Model: Simulating the operations of the network control center, phase 2

NASA Technical Reports Server (NTRS)

Benjamin, Norman M.; Paul, Arthur S.; Gill, Tepper L.

1992-01-01

The simulation of the network control center (NCC) is in the second phase of development. This phase seeks to further develop the work performed in phase one. Phase one concentrated on the computer systems and interconnecting network. The focus of phase two will be the implementation of the network message dialogues and the resources controlled by the NCC. These resources are requested, initiated, monitored and analyzed via network messages. In the NCC network messages are presented in the form of packets that are routed across the network. These packets are generated, encoded, decoded and processed by the network host processors that generate and service the message traffic on the network that connects these hosts. As a result, the message traffic is used to characterize the work done by the NCC and the connected network. Phase one of the model development represented the NCC as a network of bi-directional single server queues and message generating sources. The generators represented the external segment processors. The served based queues represented the host processors. The NCC model consists of the internal and external processors which generate message traffic on the network that links these hosts. To fully realize the objective of phase two it is necessary to identify and model the processes in each internal processor. These processes live in the operating system of the internal host computers and handle tasks such as high speed message exchanging, ISN and NFE interface, event monitoring, network monitoring, and message logging. Inter process communication is achieved through the operating system facilities. The overall performance of the host is determined by its ability to service messages generated by both internal and external processors.

Disrupted Brain Functional Organization in Epilepsy Revealed by Graph Theory Analysis.

PubMed

Song, Jie; Nair, Veena A; Gaggl, Wolfgang; Prabhakaran, Vivek

2015-06-01

The human brain is a complex and dynamic system that can be modeled as a large-scale brain network to better understand the reorganizational changes secondary to epilepsy. In this study, we developed a brain functional network model using graph theory methods applied to resting-state fMRI data acquired from a group of epilepsy patients and age- and gender-matched healthy controls. A brain functional network model was constructed based on resting-state functional connectivity. A minimum spanning tree combined with proportional thresholding approach was used to obtain sparse connectivity matrices for each subject, which formed the basis of brain networks. We examined the brain reorganizational changes in epilepsy thoroughly at the level of the whole brain, the functional network, and individual brain regions. At the whole-brain level, local efficiency was significantly decreased in epilepsy patients compared with the healthy controls. However, global efficiency was significantly increased in epilepsy due to increased number of functional connections between networks (although weakly connected). At the functional network level, there were significant proportions of newly formed connections between the default mode network and other networks and between the subcortical network and other networks. There was a significant proportion of decreasing connections between the cingulo-opercular task control network and other networks. Individual brain regions from different functional networks, however, showed a distinct pattern of reorganizational changes in epilepsy. These findings suggest that epilepsy alters brain efficiency in a consistent pattern at the whole-brain level, yet alters brain functional networks and individual brain regions differently.

Detection and localization of change points in temporal networks with the aid of stochastic block models

NASA Astrophysics Data System (ADS)

De Ridder, Simon; Vandermarliere, Benjamin; Ryckebusch, Jan

2016-11-01

A framework based on generalized hierarchical random graphs (GHRGs) for the detection of change points in the structure of temporal networks has recently been developed by Peel and Clauset (2015 Proc. 29th AAAI Conf. on Artificial Intelligence). We build on this methodology and extend it to also include the versatile stochastic block models (SBMs) as a parametric family for reconstructing the empirical networks. We use five different techniques for change point detection on prototypical temporal networks, including empirical and synthetic ones. We find that none of the considered methods can consistently outperform the others when it comes to detecting and locating the expected change points in empirical temporal networks. With respect to the precision and the recall of the results of the change points, we find that the method based on a degree-corrected SBM has better recall properties than other dedicated methods, especially for sparse networks and smaller sliding time window widths.

Tutorial: Neural networks and their potential application in nuclear power plants

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

Uhrig, R.E.

A neural network is a data processing system consisting of a number of simple, highly interconnected processing elements in an architecture inspired by the structure of the cerebral cortex portion of the brain. Hence, neural networks are often capable of doing things which humans or animals do well but which conventional computers often do poorly. Neural networks have emerged in the past few years as an area of unusual opportunity for research, development and application to a variety of real world problems. Indeed, neural networks exhibit characteristics and capabilities not provided by any other technology. Examples include reading Japanese Kanjimore » characters and human handwriting, reading a typewritten manuscript aloud, compensating for alignment errors in robots, interpreting very noise'' signals (e.g. electroencephalograms), modeling complex systems that cannot be modelled mathematically, and predicting whether proposed loans will be good or fail. This paper presents a brief tutorial on neural networks and describes research on the potential applications to nuclear power plants.« less

Measuring the value of accurate link prediction for network seeding.

PubMed

Wei, Yijin; Spencer, Gwen

2017-01-01

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

Progression of Diabetic Capillary Occlusion: A Model

PubMed Central

Gens, John Scott; Glazier, James A.; Burns, Stephen A.; Gast, Thomas J.

2016-01-01

An explanatory computational model is developed of the contiguous areas of retinal capillary loss which play a large role in diabetic maculapathy and diabetic retinal neovascularization. Strictly random leukocyte mediated capillary occlusion cannot explain the occurrence of large contiguous areas of retinal ischemia. Therefore occlusion of an individual capillary must increase the probability of occlusion of surrounding capillaries. A retinal perifoveal vascular sector as well as a peripheral retinal capillary network and a deleted hexagonal capillary network are modelled using Compucell3D. The perifoveal modelling produces a pattern of spreading capillary loss with associated macular edema. In the peripheral network, spreading ischemia results from the progressive loss of the ladder capillaries which connect peripheral arterioles and venules. System blood flow was elevated in the macular model before a later reduction in flow in cases with progression of capillary occlusions. Simulations differing only in initial vascular network structures but with identical dynamics for oxygen, growth factors and vascular occlusions, replicate key clinical observations of ischemia and macular edema in the posterior pole and ischemia in the retinal periphery. The simulation results also seem consistent with quantitative data on macular blood flow and qualitative data on venous oxygenation. One computational model applied to distinct capillary networks in different retinal regions yielded results comparable to clinical observations in those regions. PMID:27300722

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

PubMed

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

2004-03-08

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

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

PubMed

Ponzi, Adam; Wickens, Jeff

2010-04-28

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

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

PubMed Central

Gerstner, Wulfram

2017-01-01

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

Drug drug interaction extraction from the literature using a recursive neural network

PubMed Central

Lim, Sangrak; Lee, Kyubum

2018-01-01

Detecting drug-drug interactions (DDI) is important because information on DDIs can help prevent adverse effects from drug combinations. Since there are many new DDI-related papers published in the biomedical domain, manually extracting DDI information from the literature is a laborious task. However, text mining can be used to find DDIs in the biomedical literature. Among the recently developed neural networks, we use a Recursive Neural Network to improve the performance of DDI extraction. Our recursive neural network model uses a position feature, a subtree containment feature, and an ensemble method to improve the performance of DDI extraction. Compared with the state-of-the-art models, the DDI detection and type classifiers of our model performed 4.4% and 2.8% better, respectively, on the DDIExtraction Challenge’13 test data. We also validated our model on the PK DDI corpus that consists of two types of DDIs data: in vivo DDI and in vitro DDI. Compared with the existing model, our detection classifier performed 2.3% and 6.7% better on in vivo and in vitro data respectively. The results of our validation demonstrate that our model can automatically extract DDIs better than existing models. PMID:29373599

A Spiking Neural Simulator Integrating Event-Driven and Time-Driven Computation Schemes Using Parallel CPU-GPU Co-Processing: A Case Study.

PubMed

Naveros, Francisco; Luque, Niceto R; Garrido, Jesús A; Carrillo, Richard R; Anguita, Mancia; Ros, Eduardo

2015-07-01

Time-driven simulation methods in traditional CPU architectures perform well and precisely when simulating small-scale spiking neural networks. Nevertheless, they still have drawbacks when simulating large-scale systems. Conversely, event-driven simulation methods in CPUs and time-driven simulation methods in graphic processing units (GPUs) can outperform CPU time-driven methods under certain conditions. With this performance improvement in mind, we have developed an event-and-time-driven spiking neural network simulator suitable for a hybrid CPU-GPU platform. Our neural simulator is able to efficiently simulate bio-inspired spiking neural networks consisting of different neural models, which can be distributed heterogeneously in both small layers and large layers or subsystems. For the sake of efficiency, the low-activity parts of the neural network can be simulated in CPU using event-driven methods while the high-activity subsystems can be simulated in either CPU (a few neurons) or GPU (thousands or millions of neurons) using time-driven methods. In this brief, we have undertaken a comparative study of these different simulation methods. For benchmarking the different simulation methods and platforms, we have used a cerebellar-inspired neural-network model consisting of a very dense granular layer and a Purkinje layer with a smaller number of cells (according to biological ratios). Thus, this cerebellar-like network includes a dense diverging neural layer (increasing the dimensionality of its internal representation and sparse coding) and a converging neural layer (integration) similar to many other biologically inspired and also artificial neural networks.

Capacity Analysis of Multihop Packet Radio Networks under a General Class of Channel Access Protocols and Capture Models

DTIC Science & Technology

1987-03-01

Gitman in [Gitm75]. The system considered consisted of a set of clusters (each with an infinite popula- tion of users) that communicate with a central...30, no. 5, pp. 985-995, May 1982. [Gitm75] I. Gitman , "On the Capacity of Slotted ALOHA Networks and Some Design Problems," IEEE Trans. Comm., vol

Classification capacity of a modular neural network implementing neurally inspired architecture and training rules.

PubMed

Poirazi, Panayiota; Neocleous, Costas; Pattichis, Costantinos S; Schizas, Christos N

2004-05-01

A three-layer neural network (NN) with novel adaptive architecture has been developed. The hidden layer of the network consists of slabs of single neuron models, where neurons within a slab--but not between slabs--have the same type of activation function. The network activation functions in all three layers have adaptable parameters. The network was trained using a biologically inspired, guided-annealing learning rule on a variety of medical data. Good training/testing classification performance was obtained on all data sets tested. The performance achieved was comparable to that of SVM classifiers. It was shown that the adaptive network architecture, inspired from the modular organization often encountered in the mammalian cerebral cortex, can benefit classification performance.

Global terrestrial water storage connectivity revealed using complex climate network analyses

NASA Astrophysics Data System (ADS)

Sun, A. Y.; Chen, J.; Donges, J.

2015-07-01

Terrestrial water storage (TWS) exerts a key control in global water, energy, and biogeochemical cycles. Although certain causal relationship exists between precipitation and TWS, the latter quantity also reflects impacts of anthropogenic activities. Thus, quantification of the spatial patterns of TWS will not only help to understand feedbacks between climate dynamics and the hydrologic cycle, but also provide new insights and model calibration constraints for improving the current land surface models. This work is the first attempt to quantify the spatial connectivity of TWS using the complex network theory, which has received broad attention in the climate modeling community in recent years. Complex networks of TWS anomalies are built using two global TWS data sets, a remote sensing product that is obtained from the Gravity Recovery and Climate Experiment (GRACE) satellite mission, and a model-generated data set from the global land data assimilation system's NOAH model (GLDAS-NOAH). Both data sets have 1° × 1° grid resolutions and cover most global land areas except for permafrost regions. TWS networks are built by first quantifying pairwise correlation among all valid TWS anomaly time series, and then applying a cutoff threshold derived from the edge-density function to retain only the most important features in the network. Basinwise network connectivity maps are used to illuminate connectivity of individual river basins with other regions. The constructed network degree centrality maps show the TWS anomaly hotspots around the globe and the patterns are consistent with recent GRACE studies. Parallel analyses of networks constructed using the two data sets reveal that the GLDAS-NOAH model captures many of the spatial patterns shown by GRACE, although significant discrepancies exist in some regions. Thus, our results provide further measures for constraining the current land surface models, especially in data sparse regions.

Numerical Modeling of Interstitial Fluid Flow Coupled with Blood Flow through a Remodeled Solid Tumor Microvascular Network

PubMed Central

Soltani, M.; Chen, P.

2013-01-01

Modeling of interstitial fluid flow involves processes such as fluid diffusion, convective transport in extracellular matrix, and extravasation from blood vessels. To date, majority of microvascular flow modeling has been done at different levels and scales mostly on simple tumor shapes with their capillaries. However, with our proposed numerical model, more complex and realistic tumor shapes and capillary networks can be studied. Both blood flow through a capillary network, which is induced by a solid tumor, and fluid flow in tumor’s surrounding tissue are formulated. First, governing equations of angiogenesis are implemented to specify the different domains for the network and interstitium. Then, governing equations for flow modeling are introduced for different domains. The conservation laws for mass and momentum (including continuity equation, Darcy’s law for tissue, and simplified Navier–Stokes equation for blood flow through capillaries) are used for simulating interstitial and intravascular flows and Starling’s law is used for closing this system of equations and coupling the intravascular and extravascular flows. This is the first study of flow modeling in solid tumors to naturalistically couple intravascular and extravascular flow through a network. This network is generated by sprouting angiogenesis and consisting of one parent vessel connected to the network while taking into account the non-continuous behavior of blood, adaptability of capillary diameter to hemodynamics and metabolic stimuli, non-Newtonian blood flow, and phase separation of blood flow in capillary bifurcation. The incorporation of the outlined components beyond the previous models provides a more realistic prediction of interstitial fluid flow pattern in solid tumors and surrounding tissues. Results predict higher interstitial pressure, almost two times, for realistic model compared to the simplified model. PMID:23840579

Examining Food Risk in the Large using a Complex, Networked System-of-sytems Approach

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

Ambrosiano, John; Newkirk, Ryan; Mc Donald, Mark P

2010-12-03

The food production infrastructure is a highly complex system of systems. Characterizing the risks of intentional contamination in multi-ingredient manufactured foods is extremely challenging because the risks depend on the vulnerabilities of food processing facilities and on the intricacies of the supply-distribution networks that link them. A pure engineering approach to modeling the system is impractical because of the overall system complexity and paucity of data. A methodology is needed to assess food contamination risk 'in the large', based on current, high-level information about manufacturing facilities, corrunodities and markets, that will indicate which food categories are most at risk ofmore » intentional contamination and warrant deeper analysis. The approach begins by decomposing the system for producing a multi-ingredient food into instances of two subsystem archetypes: (1) the relevant manufacturing and processing facilities, and (2) the networked corrunodity flows that link them to each other and consumers. Ingredient manufacturing subsystems are modeled as generic systems dynamics models with distributions of key parameters that span the configurations of real facilities. Networks representing the distribution systems are synthesized from general information about food corrunodities. This is done in a series of steps. First, probability networks representing the aggregated flows of food from manufacturers to wholesalers, retailers, other manufacturers, and direct consumers are inferred from high-level approximate information. This is followed by disaggregation of the general flows into flows connecting 'large' and 'small' categories of manufacturers, wholesalers, retailers, and consumers. Optimization methods are then used to determine the most likely network flows consistent with given data. Vulnerability can be assessed for a potential contamination point using a modified CARVER + Shock model. Once the facility and corrunodity flow models are instantiated, a risk consequence analysis can be performed by injecting contaminant at chosen points in the system and propagating the event through the overarching system to arrive at morbidity and mortality figures. A generic chocolate snack cake model, consisting of fluid milk, liquid eggs, and cocoa, is described as an intended proof of concept for multi-ingredient food systems. We aim for an eventual tool that can be used directly by policy makers and planners.« less

Two classes of ODE models with switch-like behavior.

PubMed

Just, Winfried; Korb, Mason; Elbert, Ben; Young, Todd

2013-12-01

In cases where the same real-world system can be modeled both by an ODE system ⅅ and a Boolean system , it is of interest to identify conditions under which the two systems will be consistent, that is, will make qualitatively equivalent predictions. In this note we introduce two broad classes of relatively simple models that provide a convenient framework for studying such questions. In contrast to the widely known class of Glass networks, the right-hand sides of our ODEs are Lipschitz-continuous. We prove that if has certain structures, consistency between ⅅ and is implied by sufficient separation of time scales in one class of our models. Namely, if the trajectories of are "one-stepping" then we prove a strong form of consistency and if has a certain monotonicity property then there is a weaker consistency between ⅅ and . These results appear to point to more general structure properties that favor consistency between ODE and Boolean models.

Investigation on changes of modularity and robustness by edge-removal mutations in signaling networks.

PubMed

Truong, Cong-Doan; Kwon, Yung-Keun

2017-12-21

Biological networks consisting of molecular components and interactions are represented by a graph model. There have been some studies based on that model to analyze a relationship between structural characteristics and dynamical behaviors in signaling network. However, little attention has been paid to changes of modularity and robustness in mutant networks. In this paper, we investigated the changes of modularity and robustness by edge-removal mutations in three signaling networks. We first observed that both the modularity and robustness increased on average in the mutant network by the edge-removal mutations. However, the modularity change was negatively correlated with the robustness change. This implies that it is unlikely that both the modularity and the robustness values simultaneously increase by the edge-removal mutations. Another interesting finding is that the modularity change was positively correlated with the degree, the number of feedback loops, and the edge betweenness of the removed edges whereas the robustness change was negatively correlated with them. We note that these results were consistently observed in randomly structure networks. Additionally, we identified two groups of genes which are incident to the highly-modularity-increasing and the highly-robustness-decreasing edges with respect to the edge-removal mutations, respectively, and observed that they are likely to be central by forming a connected component of a considerably large size. The gene-ontology enrichment of each of these gene groups was significantly different from the rest of genes. Finally, we showed that the highly-robustness-decreasing edges can be promising edgetic drug-targets, which validates the usefulness of our analysis. Taken together, the analysis of changes of robustness and modularity against edge-removal mutations can be useful to unravel novel dynamical characteristics underlying in signaling networks.

A Neural Network Model to Learn Multiple Tasks under Dynamic Environments

NASA Astrophysics Data System (ADS)

Tsumori, Kenji; Ozawa, Seiichi

When environments are dynamically changed for agents, the knowledge acquired in an environment might be useless in future. In such dynamic environments, agents should be able to not only acquire new knowledge but also modify old knowledge in learning. However, modifying all knowledge acquired before is not efficient because the knowledge once acquired may be useful again when similar environment reappears and some knowledge can be shared among different environments. To learn efficiently in such environments, we propose a neural network model that consists of the following modules: resource allocating network, long-term & short-term memory, and environment change detector. We evaluate the model under a class of dynamic environments where multiple function approximation tasks are sequentially given. The experimental results demonstrate that the proposed model possesses stable incremental learning, accurate environmental change detection, proper association and recall of old knowledge, and efficient knowledge transfer.

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

Franović, Igor, E-mail: franovic@ipb.ac.rs; Todorović, Kristina; Burić, Nikola

We use the mean-field approach to analyze the collective dynamics in macroscopic networks of stochastic Fitzhugh-Nagumo units with delayed couplings. The conditions for validity of the two main approximations behind the model, called the Gaussian approximation and the Quasi-independence approximation, are examined. It is shown that the dynamics of the mean-field model may indicate in a self-consistent fashion the parameter domains where the Quasi-independence approximation fails. Apart from a network of globally coupled units, we also consider the paradigmatic setup of two interacting assemblies to demonstrate how our framework may be extended to hierarchical and modular networks. In both cases,more » the mean-field model can be used to qualitatively analyze the stability of the system, as well as the scenarios for the onset and the suppression of the collective mode. In quantitative terms, the mean-field model is capable of predicting the average oscillation frequency corresponding to the global variables of the exact system.« less

Prediction of U-Mo dispersion nuclear fuels with Al-Si alloy using artificial neural network

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

Susmikanti, Mike, E-mail: mike@batan.go.id; Sulistyo, Jos, E-mail: soj@batan.go.id

2014-09-30

Dispersion nuclear fuels, consisting of U-Mo particles dispersed in an Al-Si matrix, are being developed as fuel for research reactors. The equilibrium relationship for a mixture component can be expressed in the phase diagram. It is important to analyze whether a mixture component is in equilibrium phase or another phase. The purpose of this research it is needed to built the model of the phase diagram, so the mixture component is in the stable or melting condition. Artificial neural network (ANN) is a modeling tool for processes involving multivariable non-linear relationships. The objective of the present work is to developmore » code based on artificial neural network models of system equilibrium relationship of U-Mo in Al-Si matrix. This model can be used for prediction of type of resulting mixture, and whether the point is on the equilibrium phase or in another phase region. The equilibrium model data for prediction and modeling generated from experimentally data. The artificial neural network with resilient backpropagation method was chosen to predict the dispersion of nuclear fuels U-Mo in Al-Si matrix. This developed code was built with some function in MATLAB. For simulations using ANN, the Levenberg-Marquardt method was also used for optimization. The artificial neural network is able to predict the equilibrium phase or in the phase region. The develop code based on artificial neural network models was built, for analyze equilibrium relationship of U-Mo in Al-Si matrix.« less

fMRI evidence for strategic decision-making during resolution of pronoun reference.

PubMed

McMillan, Corey T; Clark, Robin; Gunawardena, Delani; Ryant, Neville; Grossman, Murray

2012-04-01

Pronouns are extraordinarily common in daily language yet little is known about the neural mechanisms that support decisions about pronoun reference. We propose a large-scale neural network for resolving pronoun reference that consists of two components. First, a core language network in peri-Sylvian cortex supports syntactic and semantic resources for interpreting pronoun meaning in sentences. Second, a frontal-parietal network that supports strategic decision-making is recruited to support probabilistic and risk-related components of resolving a pronoun's referent. In an fMRI study of healthy young adults, we observed activation of left inferior frontal and superior temporal cortex, consistent with a language network. We also observed activation of brain regions not associated with traditional language areas. By manipulating the context of the pronoun, we were able to demonstrate recruitment of dorsolateral prefrontal cortex during probabilistic evaluation of a pronoun's reference, and orbital frontal activation when a pronoun must adopt a risky referent. Together, these findings are consistent with a two-component model for resolving a pronoun's reference that includes neuroanatomic regions supporting core linguistic and decision-making mechanisms. Copyright © 2012 Elsevier Ltd. All rights reserved.

A Continuum Model of Actin Waves in Dictyostelium discoideum

PubMed Central

Khamviwath, Varunyu; Hu, Jifeng; Othmer, Hans G.

2013-01-01

Actin waves are complex dynamical patterns of the dendritic network of filamentous actin in eukaryotes. We developed a model of actin waves in PTEN-deficient Dictyostelium discoideum by deriving an approximation of the dynamics of discrete actin filaments and combining it with a signaling pathway that controls filament branching. This signaling pathway, together with the actin network, contains a positive feedback loop that drives the actin waves. Our model predicts the structure, composition, and dynamics of waves that are consistent with existing experimental evidence, as well as the biochemical dependence on various protein partners. Simulation suggests that actin waves are initiated when local actin network activity, caused by an independent process, exceeds a certain threshold. Moreover, diffusion of proteins that form a positive feedback loop with the actin network alone is sufficient for propagation of actin waves at the observed speed of . Decay of the wave back can be caused by scarcity of network components, and the shape of actin waves is highly dependent on the filament disassembly rate. The model allows retraction of actin waves and captures formation of new wave fronts in broken waves. Our results demonstrate that a delicate balance between a positive feedback, filament disassembly, and local availability of network components is essential for the complex dynamics of actin waves. PMID:23741312

Scalability Analysis and Use of Compression at the Goddard DAAC and End-to-End MODIS Transfers

NASA Technical Reports Server (NTRS)

Menasce, Daniel A.

1998-01-01

The goal of this task is to analyze the performance of single and multiple FTP transfer between SCF's and the Goddard DAAC. We developed an analytic model to compute the performance of FTP sessions as a function of various key parameters, implemented the model as a program called FTP Analyzer, and carried out validations with real data obtained by running single and multiple FTP transfer between GSFC and the Miami SCF. The input parameters to the model include the mix to FTP sessions (scenario), and for each FTP session, the file size. The network parameters include the round trip time, packet loss rate, the limiting bandwidth of the network connecting the SCF to a DAAC, TCP's basic timeout, TCP's Maximum Segment Size, and TCP's Maximum Receiver's Window Size. The modeling approach used consisted of modeling TCP's overall throughput, computing TCP's delay per FTP transfer, and then solving a queuing network model that includes the FTP clients and servers.

Spatially continuous interpolation of water stage and water depths using the Everglades depth estimation network (EDEN)

USGS Publications Warehouse

Pearlstine, Leonard; Higer, Aaron; Palaseanu, Monica; Fujisaki, Ikuko; Mazzotti, Frank

2007-01-01

The Everglades Depth Estimation Network (EDEN) is an integrated network of real-time water-level monitoring, ground-elevation modeling, and water-surface modeling that provides scientists and managers with current (2000-present), online water-stage and water-depth information for the entire freshwater portion of the Greater Everglades. Continuous daily spatial interpolations of the EDEN network stage data are presented on a 400-square-meter grid spacing. EDEN offers a consistent and documented dataset that can be used by scientists and managers to (1) guide large-scale field operations, (2) integrate hydrologic and ecological responses, and (3) support biological and ecological assessments that measure ecosystem responses to the implementation of the Comprehensive Everglades Restoration Plan (CERP) The target users are biologists and ecologists examining trophic level responses to hydrodynamic changes in the Everglades.

GIS and Transportation Planning

DOT National Transportation Integrated Search

1998-09-16

Two main objectives of transportation planning are to simulate the current : traffic volume and to forecast the future traffic volume on a transportation : network. Traffic demand modeling typically consists of the following : tasks (1)defining traff...

GDTN: Genome-Based Delay Tolerant Network Formation in Heterogeneous 5G Using Inter-UA Collaboration.

PubMed

You, Ilsun; Sharma, Vishal; Atiquzzaman, Mohammed; Choo, Kim-Kwang Raymond

2016-01-01

With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment.

GDTN: Genome-Based Delay Tolerant Network Formation in Heterogeneous 5G Using Inter-UA Collaboration

PubMed Central

2016-01-01

With a more Internet-savvy and sophisticated user base, there are more demands for interactive applications and services. However, it is a challenge for existing radio access networks (e.g. 3G and 4G) to cope with the increasingly demanding requirements such as higher data rates and wider coverage area. One potential solution is the inter-collaborative deployment of multiple radio devices in a 5G setting designed to meet exacting user demands, and facilitate the high data rate requirements in the underlying networks. These heterogeneous 5G networks can readily resolve the data rate and coverage challenges. Networks established using the hybridization of existing networks have diverse military and civilian applications. However, there are inherent limitations in such networks such as irregular breakdown, node failures, and halts during speed transmissions. In recent years, there have been attempts to integrate heterogeneous 5G networks with existing ad hoc networks to provide a robust solution for delay-tolerant transmissions in the form of packet switched networks. However, continuous connectivity is still required in these networks, in order to efficiently regulate the flow to allow the formation of a robust network. Therefore, in this paper, we present a novel network formation consisting of nodes from different network maneuvered by Unmanned Aircraft (UA). The proposed model utilizes the features of a biological aspect of genomes and forms a delay tolerant network with existing network models. This allows us to provide continuous and robust connectivity. We then demonstrate that the proposed network model has an efficient data delivery, lower overheads and lesser delays with high convergence rate in comparison to existing approaches, based on evaluations in both real-time testbed and simulation environment. PMID:27973618

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

Simulation of Code Spectrum and Code Flow of Cultured Neuronal Networks.

PubMed

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime

2016-01-01

It has been shown that, in cultured neuronal networks on a multielectrode, pseudorandom-like sequences (codes) are detected, and they flow with some spatial decay constant. Each cultured neuronal network is characterized by a specific spectrum curve. That is, we may consider the spectrum curve as a "signature" of its associated neuronal network that is dependent on the characteristics of neurons and network configuration, including the weight distribution. In the present study, we used an integrate-and-fire model of neurons with intrinsic and instantaneous fluctuations of characteristics for performing a simulation of a code spectrum from multielectrodes on a 2D mesh neural network. We showed that it is possible to estimate the characteristics of neurons such as the distribution of number of neurons around each electrode and their refractory periods. Although this process is a reverse problem and theoretically the solutions are not sufficiently guaranteed, the parameters seem to be consistent with those of neurons. That is, the proposed neural network model may adequately reflect the behavior of a cultured neuronal network. Furthermore, such prospect is discussed that code analysis will provide a base of communication within a neural network that will also create a base of natural intelligence.

A performance study of unmanned aerial vehicle-based sensor networks under cyber attack

NASA Astrophysics Data System (ADS)

Puchaty, Ethan M.

In UAV-based sensor networks, an emerging area of interest is the performance of these networks under cyber attack. This study seeks to evaluate the performance trade-offs from a System-of-Systems (SoS) perspective between various UAV communications architecture options in the context two missions: tracking ballistic missiles and tracking insurgents. An agent-based discrete event simulation is used to model a sensor communication network consisting of UAVs, military communications satellites, ground relay stations, and a mission control center. Network susceptibility to cyber attack is modeled with probabilistic failures and induced data variability, with performance metrics focusing on information availability, latency, and trustworthiness. Results demonstrated that using UAVs as routers increased network availability with a minimal latency penalty and communications satellite networks were best for long distance operations. Redundancy in the number of links between communication nodes helped mitigate cyber-caused link failures and add robustness in cases of induced data variability by an adversary. However, when failures were not independent, redundancy and UAV routing were detrimental in some cases to network performance. Sensitivity studies indicated that long cyber-caused downtimes and increasing failure dependencies resulted in build-ups of failures and caused significant degradations in network performance.

Incorporating networks in a probabilistic graphical model to find drivers for complex human diseases.

PubMed

Mezlini, Aziz M; Goldenberg, Anna

2017-10-01

Discovering genetic mechanisms driving complex diseases is a hard problem. Existing methods often lack power to identify the set of responsible genes. Protein-protein interaction networks have been shown to boost power when detecting gene-disease associations. We introduce a Bayesian framework, Conflux, to find disease associated genes from exome sequencing data using networks as a prior. There are two main advantages to using networks within a probabilistic graphical model. First, networks are noisy and incomplete, a substantial impediment to gene discovery. Incorporating networks into the structure of a probabilistic models for gene inference has less impact on the solution than relying on the noisy network structure directly. Second, using a Bayesian framework we can keep track of the uncertainty of each gene being associated with the phenotype rather than returning a fixed list of genes. We first show that using networks clearly improves gene detection compared to individual gene testing. We then show consistently improved performance of Conflux compared to the state-of-the-art diffusion network-based method Hotnet2 and a variety of other network and variant aggregation methods, using randomly generated and literature-reported gene sets. We test Hotnet2 and Conflux on several network configurations to reveal biases and patterns of false positives and false negatives in each case. Our experiments show that our novel Bayesian framework Conflux incorporates many of the advantages of the current state-of-the-art methods, while offering more flexibility and improved power in many gene-disease association scenarios.

Propagation Modeling and Defending of a Mobile Sensor Worm in Wireless Sensor and Actuator Networks

PubMed Central

Wang, Tian; Wu, Qun; Wen, Sheng; Cai, Yiqiao; Tian, Hui; Chen, Yonghong; Wang, Baowei

2017-01-01

WSANs (Wireless Sensor and Actuator Networks) are derived from traditional wireless sensor networks by introducing mobile actuator elements. Previous studies indicated that mobile actuators can improve network performance in terms of data collection, energy supplementation, etc. However, according to our experimental simulations, the actuator’s mobility also causes the sensor worm to spread faster if an attacker launches worm attacks on an actuator and compromises it successfully. Traditional worm propagation models and defense strategies did not consider the diffusion with a mobile worm carrier. To address this new problem, we first propose a microscopic mathematical model to describe the propagation dynamics of the sensor worm. Then, a two-step local defending strategy (LDS) with a mobile patcher (a mobile element which can distribute patches) is designed to recover the network. In LDS, all recovering operations are only taken in a restricted region to minimize the cost. Extensive experimental results demonstrate that our model estimations are rather accurate and consistent with the actual spreading scenario of the mobile sensor worm. Moreover, on average, the LDS outperforms other algorithms by approximately 50% in terms of the cost. PMID:28098748

Modeling constitutive behavior of a 15Cr-15Ni-2.2Mo-Ti modified austenitic stainless steel under hot compression using artificial neural network

NASA Astrophysics Data System (ADS)

Mandal, Sumantra

2006-11-01

ABSTRACT In this paper, an artificial neural network (ANN) model has been suggested to predict the constitutive flow behavior of a 15Cr-15Ni-2.2Mo-Ti modified austenitic stainless steel under hot deformation. Hot compression tests in the temperature range 850°C- 1250°C and strain rate range 10-3-102 s-1 were carried out. These tests provided the required data for training the neural network and for subsequent testing. The inputs of the neural network are strain, log strain rate and temperature while flow stress is obtained as output. A three layer feed-forward network with ten neurons in a single hidden layer and back-propagation learning algorithm has been employed. A very good correlation between experimental and predicted result has been obtained. The effect of temperature and strain rate on flow behavior has been simulated employing the ANN model. The results have been found to be consistent with the metallurgical trend. Finally, a monte carlo analiysis has been carried out to find out the noise sensitivity of the developed model.

Convolutional networks for vehicle track segmentation

DOE PAGES

Quach, Tu-Thach

2017-08-19

Existing methods to detect vehicle tracks in coherent change detection images, a product of combining two synthetic aperture radar images taken at different times of the same scene, rely on simple, fast models to label track pixels. These models, however, are unable to capture natural track features such as continuity and parallelism. More powerful, but computationally expensive models can be used in offline settings. We present an approach that uses dilated convolutional networks consisting of a series of 3-by-3 convolutions to segment vehicle tracks. The design of our networks considers the fact that remote sensing applications tend to operate inmore » low power and have limited training data. As a result, we aim for small, efficient networks that can be trained end-to-end to learn natural track features entirely from limited training data. We demonstrate that our 6-layer network, trained on just 90 images, is computationally efficient and improves the F-score on a standard dataset to 0.992, up from 0.959 obtained by the current state-of-the-art method.« less

Unwinding the hairball graph: Pruning algorithms for weighted complex networks

NASA Astrophysics Data System (ADS)

Dianati, Navid

2016-01-01

Empirical networks of weighted dyadic relations often contain "noisy" edges that alter the global characteristics of the network and obfuscate the most important structures therein. Graph pruning is the process of identifying the most significant edges according to a generative null model and extracting the subgraph consisting of those edges. Here, we focus on integer-weighted graphs commonly arising when weights count the occurrences of an "event" relating the nodes. We introduce a simple and intuitive null model related to the configuration model of network generation and derive two significance filters from it: the marginal likelihood filter (MLF) and the global likelihood filter (GLF). The former is a fast algorithm assigning a significance score to each edge based on the marginal distribution of edge weights, whereas the latter is an ensemble approach which takes into account the correlations among edges. We apply these filters to the network of air traffic volume between US airports and recover a geographically faithful representation of the graph. Furthermore, compared with thresholding based on edge weight, we show that our filters extract a larger and significantly sparser giant component.

Convolutional networks for vehicle track segmentation

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

Quach, Tu-Thach

Existing methods to detect vehicle tracks in coherent change detection images, a product of combining two synthetic aperture radar images taken at different times of the same scene, rely on simple, fast models to label track pixels. These models, however, are unable to capture natural track features such as continuity and parallelism. More powerful, but computationally expensive models can be used in offline settings. We present an approach that uses dilated convolutional networks consisting of a series of 3-by-3 convolutions to segment vehicle tracks. The design of our networks considers the fact that remote sensing applications tend to operate inmore » low power and have limited training data. As a result, we aim for small, efficient networks that can be trained end-to-end to learn natural track features entirely from limited training data. We demonstrate that our 6-layer network, trained on just 90 images, is computationally efficient and improves the F-score on a standard dataset to 0.992, up from 0.959 obtained by the current state-of-the-art method.« less

A simplified memory network model based on pattern formations

NASA Astrophysics Data System (ADS)

Xu, Kesheng; Zhang, Xiyun; Wang, Chaoqing; Liu, Zonghua

2014-12-01

Many experiments have evidenced the transition with different time scales from short-term memory (STM) to long-term memory (LTM) in mammalian brains, while its theoretical understanding is still under debate. To understand its underlying mechanism, it has recently been shown that it is possible to have a long-period rhythmic synchronous firing in a scale-free network, provided the existence of both the high-degree hubs and the loops formed by low-degree nodes. We here present a simplified memory network model to show that the self-sustained synchronous firing can be observed even without these two necessary conditions. This simplified network consists of two loops of coupled excitable neurons with different synaptic conductance and with one node being the sensory neuron to receive an external stimulus signal. This model can be further used to show how the diversity of firing patterns can be selectively formed by varying the signal frequency, duration of the stimulus and network topology, which corresponds to the patterns of STM and LTM with different time scales. A theoretical analysis is presented to explain the underlying mechanism of firing patterns.

A spatially resolved network spike in model neuronal cultures reveals nucleation centers, circular traveling waves and drifting spiral waves.

PubMed

Paraskevov, A V; Zendrikov, D K

2017-03-23

We show that in model neuronal cultures, where the probability of interneuronal connection formation decreases exponentially with increasing distance between the neurons, there exists a small number of spatial nucleation centers of a network spike, from where the synchronous spiking activity starts propagating in the network typically in the form of circular traveling waves. The number of nucleation centers and their spatial locations are unique and unchanged for a given realization of neuronal network but are different for different networks. In contrast, if the probability of interneuronal connection formation is independent of the distance between neurons, then the nucleation centers do not arise and the synchronization of spiking activity during a network spike occurs spatially uniform throughout the network. Therefore one can conclude that spatial proximity of connections between neurons is important for the formation of nucleation centers. It is also shown that fluctuations of the spatial density of neurons at their random homogeneous distribution typical for the experiments in vitro do not determine the locations of the nucleation centers. The simulation results are qualitatively consistent with the experimental observations.

Experimental Study of Quantum Graphs With and Without Time-Reversal Invariance

NASA Astrophysics Data System (ADS)

Anlage, Steven Mark; Fu, Ziyuan; Koch, Trystan; Antonsen, Thomas; Ott, Edward

An experimental setup consisting of a microwave network is used to simulate quantum graphs. The random coupling model (RCM) is applied to describe the universal statistical properties of the system with and without time-reversal invariance. The networks which are large compared to the wavelength, are constructed from coaxial cables connected by T junctions, and by making nodes with circulators time-reversal invariance for microwave propagation in the networks can be broken. The results of experimental study of microwave networks with and without time-reversal invariance are presented both in frequency domain and time domain. With the measured S-parameter data of two-port networks, the impedance statistics and the nearest-neighbor spacing statistics are examined. Moreover, the experiments of time reversal mirrors for networks demonstrate that the reconstruction quality can be used to quantify the degree of the time-reversal invariance for wave propagation. Numerical models of networks are also presented to verify the time domain experiments. We acknowledge support under contract AFOSR COE Grant FA9550-15-1-0171 and the ONR Grant N000141512134.

A Game-Theoretic Response Strategy for Coordinator Attack in Wireless Sensor Networks

PubMed Central

Liu, Jianhua; Yue, Guangxue; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security. PMID:25105171

A spatially resolved network spike in model neuronal cultures reveals nucleation centers, circular traveling waves and drifting spiral waves

NASA Astrophysics Data System (ADS)

Paraskevov, A. V.; Zendrikov, D. K.

2017-04-01

We show that in model neuronal cultures, where the probability of interneuronal connection formation decreases exponentially with increasing distance between the neurons, there exists a small number of spatial nucleation centers of a network spike, from where the synchronous spiking activity starts propagating in the network typically in the form of circular traveling waves. The number of nucleation centers and their spatial locations are unique and unchanged for a given realization of neuronal network but are different for different networks. In contrast, if the probability of interneuronal connection formation is independent of the distance between neurons, then the nucleation centers do not arise and the synchronization of spiking activity during a network spike occurs spatially uniform throughout the network. Therefore one can conclude that spatial proximity of connections between neurons is important for the formation of nucleation centers. It is also shown that fluctuations of the spatial density of neurons at their random homogeneous distribution typical for the experiments in vitro do not determine the locations of the nucleation centers. The simulation results are qualitatively consistent with the experimental observations.

A game-theoretic response strategy for coordinator attack in wireless sensor networks.

PubMed

Liu, Jianhua; Yue, Guangxue; Shen, Shigen; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security.

Information-geometric measures as robust estimators of connection strengths and external inputs.

PubMed

Tatsuno, Masami; Fellous, Jean-Marc; Amari, Shun-Ichi

2009-08-01

Information geometry has been suggested to provide a powerful tool for analyzing multineuronal spike trains. Among several advantages of this approach, a significant property is the close link between information-geometric measures and neural network architectures. Previous modeling studies established that the first- and second-order information-geometric measures corresponded to the number of external inputs and the connection strengths of the network, respectively. This relationship was, however, limited to a symmetrically connected network, and the number of neurons used in the parameter estimation of the log-linear model needed to be known. Recently, simulation studies of biophysical model neurons have suggested that information geometry can estimate the relative change of connection strengths and external inputs even with asymmetric connections. Inspired by these studies, we analytically investigated the link between the information-geometric measures and the neural network structure with asymmetrically connected networks of N neurons. We focused on the information-geometric measures of orders one and two, which can be derived from the two-neuron log-linear model, because unlike higher-order measures, they can be easily estimated experimentally. Considering the equilibrium state of a network of binary model neurons that obey stochastic dynamics, we analytically showed that the corrected first- and second-order information-geometric measures provided robust and consistent approximation of the external inputs and connection strengths, respectively. These results suggest that information-geometric measures provide useful insights into the neural network architecture and that they will contribute to the study of system-level neuroscience.

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

PubMed

Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

2016-11-01

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Modeling genome-wide dynamic regulatory network in mouse lungs with influenza infection using high-dimensional ordinary differential equations.

PubMed

Wu, Shuang; Liu, Zhi-Ping; Qiu, Xing; Wu, Hulin

2014-01-01

The immune response to viral infection is regulated by an intricate network of many genes and their products. The reverse engineering of gene regulatory networks (GRNs) using mathematical models from time course gene expression data collected after influenza infection is key to our understanding of the mechanisms involved in controlling influenza infection within a host. A five-step pipeline: detection of temporally differentially expressed genes, clustering genes into co-expressed modules, identification of network structure, parameter estimate refinement, and functional enrichment analysis, is developed for reconstructing high-dimensional dynamic GRNs from genome-wide time course gene expression data. Applying the pipeline to the time course gene expression data from influenza-infected mouse lungs, we have identified 20 distinct temporal expression patterns in the differentially expressed genes and constructed a module-based dynamic network using a linear ODE model. Both intra-module and inter-module annotations and regulatory relationships of our inferred network show some interesting findings and are highly consistent with existing knowledge about the immune response in mice after influenza infection. The proposed method is a computationally efficient, data-driven pipeline bridging experimental data, mathematical modeling, and statistical analysis. The application to the influenza infection data elucidates the potentials of our pipeline in providing valuable insights into systematic modeling of complicated biological processes.

The Canarian Seismic Monitoring Network: design, development and first result

NASA Astrophysics Data System (ADS)

D'Auria, Luca; Barrancos, José; Padilla, Germán D.; García-Hernández, Rubén; Pérez, Aaron; Pérez, Nemesio M.

2017-04-01

Tenerife is an active volcanic island which experienced several eruptions of moderate intensity in historical times, and few explosive eruptions in the Holocene. The increasing population density and the consistent number of tourists are constantly raising the volcanic risk. In June 2016 Instituto Volcanologico de Canarias started the deployment of a seismological volcano monitoring network consisting of 15 broadband seismic stations. The network began its full operativity in November 2016. The aim of the network are both volcano monitoring and scientific research. Currently data are continuously recorded and processed in real-time. Seismograms, hypocentral parameters, statistical informations about the seismicity and other data are published on a web page. We show the technical characteristics of the network and an estimate of its detection threshold and earthquake location performances. Furthermore we present other near-real time procedures on the data: analysis of the ambient noise for determining the shallow velocity model and temporal velocity variations, detection of earthquake multiplets through massive data mining of the seismograms and automatic relocation of events through double-difference location.

A simulation-based approach for designing effective field-sampling programs to evaluate contamination risk of groundwater supplies

USGS Publications Warehouse

Nordqvist, R.; Voss, C.I.

1996-01-01

An approach to model discrimination and network design for evaluation of groundwater contamination risk is proposed and demonstrated by application to a site in a glaciofluvial aquifer in Sweden. The approach consists of first hypothesizing alternative conceptual models of hydrogeology at the site on the basis of both quantitative data and qualitative information. The conceptual models are then expressed as two-dimensional numerical models of groundwater flow and solute transport, and model attributes controlling risk to the water supply are determined by simulation. Model predictions of response to a specific field test are made with each model that affects risk. Regions for effective measurement networks are then identified. Effective networks are those that capture sufficient information to determine which of the hypothesized models best describes the system with a minimum of measurement points. For the example site in Sweden, the network is designed such that important system parameters may be accurately estimated at the same time as model discrimination is carried out. The site in Vansbro, Sweden, consists of a water-supply well in an esker separated (by 300m) from a wood preservation and treatment area on the esker flank by only a narrow inlet of a bordering stream. Application of the above-described risk analysis shows that, of all the hydrologic controls and parameters in the groundwater system, the only factor that controls the potential migration of wood-treatment contaminants to the well is whether the inlet's bed is pervious, creating a hydraulic barrier to lateral contaminant transport. Furthermore, the analysis localizes an area near the end of the inlet wherein the most effective measurements of drawdown would be made to discriminate between a permeable and impermeable bed. The location of this optimal area is not obvious prior to application of the above methodology.

Artificial neural network analysis based on genetic algorithm to predict the performance characteristics of a cross flow cooling tower

NASA Astrophysics Data System (ADS)

Wu, Jiasheng; Cao, Lin; Zhang, Guoqiang

2018-02-01

Cooling tower of air conditioning has been widely used as cooling equipment, and there will be broad application prospect if it can be reversibly used as heat source under heat pump heating operation condition. In view of the complex non-linear relationship of each parameter in the process of heat and mass transfer inside tower, In this paper, the BP neural network model based on genetic algorithm optimization (GABP neural network model) is established for the reverse use of cross flow cooling tower. The model adopts the structure of 6 inputs, 13 hidden nodes and 8 outputs. With this model, the outlet air dry bulb temperature, wet bulb temperature, water temperature, heat, sensible heat ratio and heat absorbing efficiency, Lewis number, a total of 8 the proportion of main performance parameters were predicted. Furthermore, the established network model is used to predict the water temperature and heat absorption of the tower at different inlet temperatures. The mean relative error MRE between BP predicted value and experimental value are 4.47%, 3.63%, 2.38%, 3.71%, 6.35%,3.14%, 13.95% and 6.80% respectively; the mean relative error MRE between GABP predicted value and experimental value are 2.66%, 3.04%, 2.27%, 3.02%, 6.89%, 3.17%, 11.50% and 6.57% respectively. The results show that the prediction results of GABP network model are better than that of BP network model; the simulation results are basically consistent with the actual situation. The GABP network model can well predict the heat and mass transfer performance of the cross flow cooling tower.

Probing Intrinsic Resting-State Networks in the Infant Rat Brain

PubMed Central

Bajic, Dusica; Craig, Michael M.; Borsook, David; Becerra, Lino

2016-01-01

Resting-state functional magnetic resonance imaging (rs-fMRI) measures spontaneous fluctuations in blood oxygenation level-dependent (BOLD) signal in the absence of external stimuli. It has become a powerful tool for mapping large-scale brain networks in humans and animal models. Several rs-fMRI studies have been conducted in anesthetized and awake adult rats, reporting consistent patterns of brain activity at the systems level. However, the evolution to adult patterns of resting-state activity has not yet been evaluated and quantified in the developing rat brain. In this study, we hypothesized that large-scale intrinsic networks would be easily detectable but not fully established as specific patterns of activity in lightly anesthetized 2-week-old rats (N = 11). Independent component analysis (ICA) identified 8 networks in 2-week-old-rats. These included Default mode, Sensory (Exteroceptive), Salience (Interoceptive), Basal Ganglia-Thalamic-Hippocampal, Basal Ganglia, Autonomic, Cerebellar, as well as Thalamic-Brainstem networks. Many of these networks consisted of more than one component, possibly indicative of immature, underdeveloped networks at this early time point. Except for the Autonomic network, infant rat networks showed reduced connectivity with subcortical structures in comparison to previously published adult networks. Reported slow fluctuations in the BOLD signal that correspond to functionally relevant resting-state networks in 2-week-old rats can serve as an important tool for future studies of brain development in the settings of different pharmacological applications or disease. PMID:27803653

The dynamical analysis of modified two-compartment neuron model and FPGA implementation

NASA Astrophysics Data System (ADS)

Lin, Qianjin; Wang, Jiang; Yang, Shuangming; Yi, Guosheng; Deng, Bin; Wei, Xile; Yu, Haitao

2017-10-01

The complexity of neural models is increasing with the investigation of larger biological neural network, more various ionic channels and more detailed morphologies, and the implementation of biological neural network is a task with huge computational complexity and power consumption. This paper presents an efficient digital design using piecewise linearization on field programmable gate array (FPGA), to succinctly implement the reduced two-compartment model which retains essential features of more complicated models. The design proposes an approximate neuron model which is composed of a set of piecewise linear equations, and it can reproduce different dynamical behaviors to depict the mechanisms of a single neuron model. The consistency of hardware implementation is verified in terms of dynamical behaviors and bifurcation analysis, and the simulation results including varied ion channel characteristics coincide with the biological neuron model with a high accuracy. Hardware synthesis on FPGA demonstrates that the proposed model has reliable performance and lower hardware resource compared with the original two-compartment model. These investigations are conducive to scalability of biological neural network in reconfigurable large-scale neuromorphic system.

Cutting the Wires: Modularization of Cellular Networks for Experimental Design

PubMed Central

Lang, Moritz; Summers, Sean; Stelling, Jörg

2014-01-01

Understanding naturally evolved cellular networks requires the consecutive identification and revision of the interactions between relevant molecular species. In this process, initially often simplified and incomplete networks are extended by integrating new reactions or whole subnetworks to increase consistency between model predictions and new measurement data. However, increased consistency with experimental data alone is not sufficient to show the existence of biomolecular interactions, because the interplay of different potential extensions might lead to overall similar dynamics. Here, we present a graph-based modularization approach to facilitate the design of experiments targeted at independently validating the existence of several potential network extensions. Our method is based on selecting the outputs to measure during an experiment, such that each potential network extension becomes virtually insulated from all others during data analysis. Each output defines a module that only depends on one hypothetical network extension, and all other outputs act as virtual inputs to achieve insulation. Given appropriate experimental time-series measurements of the outputs, our modules can be analyzed, simulated, and compared to the experimental data separately. Our approach exemplifies the close relationship between structural systems identification and modularization, an interplay that promises development of related approaches in the future. PMID:24411264

SCOUT: simultaneous time segmentation and community detection in dynamic networks

PubMed Central

Hulovatyy, Yuriy; Milenković, Tijana

2016-01-01

Many evolving complex real-world systems can be modeled via dynamic networks. An important problem in dynamic network research is community detection, which finds groups of topologically related nodes. Typically, this problem is approached by assuming either that each time point has a distinct community organization or that all time points share a single community organization. The reality likely lies between these two extremes. To find the compromise, we consider community detection in the context of the problem of segment detection, which identifies contiguous time periods with consistent network structure. Consequently, we formulate a combined problem of segment community detection (SCD), which simultaneously partitions the network into contiguous time segments with consistent community organization and finds this community organization for each segment. To solve SCD, we introduce SCOUT, an optimization framework that explicitly considers both segmentation quality and partition quality. SCOUT addresses limitations of existing methods that can be adapted to solve SCD, which consider only one of segmentation quality or partition quality. In a thorough evaluation, SCOUT outperforms the existing methods in terms of both accuracy and computational complexity. We apply SCOUT to biological network data to study human aging. PMID:27881879

Distributed run of a one-dimensional model in a regional application using SOAP-based web services

NASA Astrophysics Data System (ADS)

Smiatek, Gerhard

This article describes the setup of a distributed computing system in Perl. It facilitates the parallel run of a one-dimensional environmental model on a number of simple network PC hosts. The system uses Simple Object Access Protocol (SOAP) driven web services offering the model run on remote hosts and a multi-thread environment distributing the work and accessing the web services. Its application is demonstrated in a regional run of a process-oriented biogenic emission model for the area of Germany. Within a network consisting of up to seven web services implemented on Linux and MS-Windows hosts, a performance increase of approximately 400% has been reached compared to a model run on the fastest single host.

Enhancing social networks: a qualitative study of health and social care practice in UK mental health services.

PubMed

Webber, Martin; Reidy, Hannah; Ansari, David; Stevens, Martin; Morris, David

2015-03-01

People with severe mental health problems such as psychosis have access to less social capital, defined as resources within social networks, than members of the general population. However, a lack of theoretically and empirically informed models hampers the development of social interventions which seek to enhance an individual's social networks. This paper reports the findings of a qualitative study, which used ethnographic field methods in six sites in England to investigate how workers helped people recovering from psychosis to enhance their social networks. This study drew upon practice wisdom and lived experience to provide data for intervention modelling. Data were collected from 73 practitioners and 51 people who used their services in two phases. Data were selected and coded using a grounded theory approach to depict the key themes that appeared to underpin the generation of social capital within networks. Findings are presented in four over-arching themes - worker skills, attitudes and roles; connecting people processes; role of the agency; and barriers to network development. The sub-themes which were identified included worker attitudes; person-centred approach; equality of worker-individual relationship; goal setting; creating new networks and relationships; engagement through activities; practical support; existing relationships; the individual taking responsibility; identifying and overcoming barriers; and moving on. Themes were consistent with recovery models used within mental health services and will provide the basis for the development of an intervention model to enhance individuals' access to social capital within networks. © 2014 John Wiley & Sons Ltd.

Artificial neural networks for modeling time series of beach litter in the southern North Sea.

PubMed

Schulz, Marcus; Matthies, Michael

2014-07-01

In European marine waters, existing monitoring programs of beach litter need to be improved concerning litter items used as indicators of pollution levels, efficiency, and effectiveness. In order to ease and focus future monitoring of beach litter on few important litter items, feed-forward neural networks consisting of three layers were developed to relate single litter items to general categories of marine litter. The neural networks developed were applied to seven beaches in the southern North Sea and modeled time series of five general categories of marine litter, such as litter from fishing, shipping, and tourism. Results of regression analyses show that general categories were predicted significantly moderately to well. Measured and modeled data were in the same order of magnitude, and minima and maxima overlapped well. Neural networks were found to be eligible tools to deliver reliable predictions of marine litter with low computational effort and little input of information. Copyright © 2014 Elsevier Ltd. All rights reserved.

Modeling of information diffusion in Twitter-like social networks under information overload.

PubMed

Li, Pei; Li, Wei; Wang, Hui; Zhang, Xin

2014-01-01

Due to the existence of information overload in social networks, it becomes increasingly difficult for users to find useful information according to their interests. This paper takes Twitter-like social networks into account and proposes models to characterize the process of information diffusion under information overload. Users are classified into different types according to their in-degrees and out-degrees, and user behaviors are generalized into two categories: generating and forwarding. View scope is introduced to model the user information-processing capability under information overload, and the average number of times a message appears in view scopes after it is generated by a given type user is adopted to characterize the information diffusion efficiency, which is calculated theoretically. To verify the accuracy of theoretical analysis results, we conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of importance to understand the diffusion dynamics in social networks, and this analysis framework can be extended to consider more realistic situations.

Cyber-Physical Test Platform for Microgrids: Combining Hardware, Hardware-in-the-Loop, and Network-Simulator-in-the-Loop

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

Nelson, Austin; Chakraborty, Sudipta; Wang, Dexin

This paper presents a cyber-physical testbed, developed to investigate the complex interactions between emerging microgrid technologies such as grid-interactive power sources, control systems, and a wide variety of communication platforms and bandwidths. The cyber-physical testbed consists of three major components for testing and validation: real time models of a distribution feeder model with microgrid assets that are integrated into the National Renewable Energy Laboratory's (NREL) power hardware-in-the-loop (PHIL) platform; real-time capable network-simulator-in-the-loop (NSIL) models; and physical hardware including inverters and a simple system controller. Several load profiles and microgrid configurations were tested to examine the effect on system performance withmore » increasing channel delays and router processing delays in the network simulator. Testing demonstrated that the controller's ability to maintain a target grid import power band was severely diminished with increasing network delays and laid the foundation for future testing of more complex cyber-physical systems.« less

A multi-agent intelligent environment for medical knowledge.

PubMed

Vicari, Rosa M; Flores, Cecilia D; Silvestre, André M; Seixas, Louise J; Ladeira, Marcelo; Coelho, Helder

2003-03-01

AMPLIA is a multi-agent intelligent learning environment designed to support training of diagnostic reasoning and modelling of domains with complex and uncertain knowledge. AMPLIA focuses on the medical area. It is a system that deals with uncertainty under the Bayesian network approach, where learner-modelling tasks will consist of creating a Bayesian network for a problem the system will present. The construction of a network involves qualitative and quantitative aspects. The qualitative part concerns the network topology, that is, causal relations among the domain variables. After it is ready, the quantitative part is specified. It is composed of the distribution of conditional probability of the variables represented. A negotiation process (managed by an intelligent MediatorAgent) will treat the differences of topology and probability distribution between the model the learner built and the one built-in in the system. That negotiation process occurs between the agents that represent the expert knowledge domain (DomainAgent) and the agent that represents the learner knowledge (LearnerAgent).

Computing by robust transience: How the fronto-parietal network performs sequential category-based decisions

PubMed Central

Chaisangmongkon, Warasinee; Swaminathan, Sruthi K.; Freedman, David J.; Wang, Xiao-Jing

2017-01-01

Summary Decision making involves dynamic interplay between internal judgements and external perception, which has been investigated in delayed match-to-category (DMC) experiments. Our analysis of neural recordings shows that, during DMC tasks, LIP and PFC neurons demonstrate mixed, time-varying, and heterogeneous selectivity, but previous theoretical work has not established the link between these neural characteristics and population-level computations. We trained a recurrent network model to perform DMC tasks and found that the model can remarkably reproduce key features of neuronal selectivity at the single-neuron and population levels. Analysis of the trained networks elucidates that robust transient trajectories of the neural population are the key driver of sequential categorical decisions. The directions of trajectories are governed by network self-organized connectivity, defining a ‘neural landscape’, consisting of a task-tailored arrangement of slow states and dynamical tunnels. With this model, we can identify functionally-relevant circuit motifs and generalize the framework to solve other categorization tasks. PMID:28334612

An artificial neural network model for periodic trajectory generation

NASA Astrophysics Data System (ADS)

Shankar, S.; Gander, R. E.; Wood, H. C.

A neural network model based on biological systems was developed for potential robotic application. The model consists of three interconnected layers of artificial neurons or units: an input layer subdivided into state and plan units, an output layer, and a hidden layer between the two outer layers which serves to implement nonlinear mappings between the input and output activation vectors. Weighted connections are created between the three layers, and learning is effected by modifying these weights. Feedback connections between the output and the input state serve to make the network operate as a finite state machine. The activation vector of the plan units of the input layer emulates the supraspinal commands in biological central pattern generators in that different plan activation vectors correspond to different sequences or trajectories being recalled, even with different frequencies. Three trajectories were chosen for implementation, and learning was accomplished in 10,000 trials. The fault tolerant behavior, adaptiveness, and phase maintenance of the implemented network are discussed.

Modeling of Information Diffusion in Twitter-Like Social Networks under Information Overload

PubMed Central

Li, Wei

2014-01-01

Due to the existence of information overload in social networks, it becomes increasingly difficult for users to find useful information according to their interests. This paper takes Twitter-like social networks into account and proposes models to characterize the process of information diffusion under information overload. Users are classified into different types according to their in-degrees and out-degrees, and user behaviors are generalized into two categories: generating and forwarding. View scope is introduced to model the user information-processing capability under information overload, and the average number of times a message appears in view scopes after it is generated by a given type user is adopted to characterize the information diffusion efficiency, which is calculated theoretically. To verify the accuracy of theoretical analysis results, we conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of importance to understand the diffusion dynamics in social networks, and this analysis framework can be extended to consider more realistic situations. PMID:24795541

Target recognition and scene interpretation in image/video understanding systems based on network-symbolic models

NASA Astrophysics Data System (ADS)

Kuvich, Gary

2004-08-01

Vision is only a part of a system that converts visual information into knowledge structures. These structures drive the vision process, resolving ambiguity and uncertainty via feedback, and provide image understanding, which is an interpretation of visual information in terms of these knowledge models. These mechanisms provide a reliable recognition if the object is occluded or cannot be recognized as a whole. It is hard to split the entire system apart, and reliable solutions to the target recognition problems are possible only within the solution of a more generic Image Understanding Problem. Brain reduces informational and computational complexities, using implicit symbolic coding of features, hierarchical compression, and selective processing of visual information. Biologically inspired Network-Symbolic representation, where both systematic structural/logical methods and neural/statistical methods are parts of a single mechanism, is the most feasible for such models. It converts visual information into relational Network-Symbolic structures, avoiding artificial precise computations of 3-dimensional models. Network-Symbolic Transformations derive abstract structures, which allows for invariant recognition of an object as exemplar of a class. Active vision helps creating consistent models. Attention, separation of figure from ground and perceptual grouping are special kinds of network-symbolic transformations. Such Image/Video Understanding Systems will be reliably recognizing targets.

The time course of auditory-visual processing of speech and body actions: evidence for the simultaneous activation of an extended neural network for semantic processing.

PubMed

Meyer, Georg F; Harrison, Neil R; Wuerger, Sophie M

2013-08-01

An extensive network of cortical areas is involved in multisensory object and action recognition. This network draws on inferior frontal, posterior temporal, and parietal areas; activity is modulated by familiarity and the semantic congruency of auditory and visual component signals even if semantic incongruences are created by combining visual and auditory signals representing very different signal categories, such as speech and whole body actions. Here we present results from a high-density ERP study designed to examine the time-course and source location of responses to semantically congruent and incongruent audiovisual speech and body actions to explore whether the network involved in action recognition consists of a hierarchy of sequentially activated processing modules or a network of simultaneously active processing sites. We report two main results:1) There are no significant early differences in the processing of congruent and incongruent audiovisual action sequences. The earliest difference between congruent and incongruent audiovisual stimuli occurs between 240 and 280 ms after stimulus onset in the left temporal region. Between 340 and 420 ms, semantic congruence modulates responses in central and right frontal areas. Late differences (after 460 ms) occur bilaterally in frontal areas.2) Source localisation (dipole modelling and LORETA) reveals that an extended network encompassing inferior frontal, temporal, parasaggital, and superior parietal sites are simultaneously active between 180 and 420 ms to process auditory–visual action sequences. Early activation (before 120 ms) can be explained by activity in mainly sensory cortices. . The simultaneous activation of an extended network between 180 and 420 ms is consistent with models that posit parallel processing of complex action sequences in frontal, temporal and parietal areas rather than models that postulate hierarchical processing in a sequence of brain regions. Copyright © 2013 Elsevier Ltd. All rights reserved.

A modular network for legged locomotion

NASA Astrophysics Data System (ADS)

Golubitsky, Martin; Stewart, Ian; Buono, Pietro-Luciano; Collins, J. J.

1998-04-01

In this paper we use symmetry methods to study networks of coupled cells, which are models for central pattern generators (CPGs). In these models the cells obey identical systems of differential equations and the network specifies how cells are coupled. Previously, Collins and Stewart showed that the phase relations of many of the standard gaits of quadrupeds and hexapods can be obtained naturally via Hopf bifurcation in small networks. For example, the networks they used to study quadrupeds all had four cells, with the understanding that each cell determined the phase of the motion of one leg. However, in their work it seemed necessary to employ several different four-oscillator networks to obtain all of the standard quadrupedal gaits. We show that this difficulty with four-oscillator networks is unavoidable, but that the problems can be overcome by using a larger network. Specifically, we show that the standard gaits of a quadruped, including walk, trot and pace, cannot all be realized by a single four-cell network without introducing unwanted conjugacies between trot and pace - conjugacies that imply a dynamic equivalence between these gaits that seems inconsistent with observations. In this sense a single network with four cells cannot model the CPG of a quadruped. We also introduce a single eight-cell network that can model all of the primary gaits of quadrupeds without these unwanted conjugacies. Moreover, this network is modular in that it naturally generalizes to provide models of gaits in hexapods, centipedes, and millipedes. The analysis of models for many-legged animals shows that wave-like motions, similar to those obtained by Kopell and Ermentrout, can be expected. However, our network leads to a prediction that the wavelength of the wave motion will divide twice the length of the animal. Indeed, we reproduce illustrations of wave-like motions in centipedes where the animal is approximately one-and-a-half wavelength long - motions that are consistent with this prediction. We discuss the implications of these results for the development of modular control networks for adaptive legged robots.

Bayesian network models for error detection in radiotherapy plans

NASA Astrophysics Data System (ADS)

Kalet, Alan M.; Gennari, John H.; Ford, Eric C.; Phillips, Mark H.

2015-04-01

The purpose of this study is to design and develop a probabilistic network for detecting errors in radiotherapy plans for use at the time of initial plan verification. Our group has initiated a multi-pronged approach to reduce these errors. We report on our development of Bayesian models of radiotherapy plans. Bayesian networks consist of joint probability distributions that define the probability of one event, given some set of other known information. Using the networks, we find the probability of obtaining certain radiotherapy parameters, given a set of initial clinical information. A low probability in a propagated network then corresponds to potential errors to be flagged for investigation. To build our networks we first interviewed medical physicists and other domain experts to identify the relevant radiotherapy concepts and their associated interdependencies and to construct a network topology. Next, to populate the network’s conditional probability tables, we used the Hugin Expert software to learn parameter distributions from a subset of de-identified data derived from a radiation oncology based clinical information database system. These data represent 4990 unique prescription cases over a 5 year period. Under test case scenarios with approximately 1.5% introduced error rates, network performance produced areas under the ROC curve of 0.88, 0.98, and 0.89 for the lung, brain and female breast cancer error detection networks, respectively. Comparison of the brain network to human experts performance (AUC of 0.90 ± 0.01) shows the Bayes network model performs better than domain experts under the same test conditions. Our results demonstrate the feasibility and effectiveness of comprehensive probabilistic models as part of decision support systems for improved detection of errors in initial radiotherapy plan verification procedures.

Descriptive vs. mechanistic network models in plant development in the post-genomic era.

PubMed

Davila-Velderrain, J; Martinez-Garcia, J C; Alvarez-Buylla, E R

2015-01-01

Network modeling is now a widespread practice in systems biology, as well as in integrative genomics, and it constitutes a rich and diverse scientific research field. A conceptually clear understanding of the reasoning behind the main existing modeling approaches, and their associated technical terminologies, is required to avoid confusions and accelerate the transition towards an undeniable necessary more quantitative, multidisciplinary approach to biology. Herein, we focus on two main network-based modeling approaches that are commonly used depending on the information available and the intended goals: inference-based methods and system dynamics approaches. As far as data-based network inference methods are concerned, they enable the discovery of potential functional influences among molecular components. On the other hand, experimentally grounded network dynamical models have been shown to be perfectly suited for the mechanistic study of developmental processes. How do these two perspectives relate to each other? In this chapter, we describe and compare both approaches and then apply them to a given specific developmental module. Along with the step-by-step practical implementation of each approach, we also focus on discussing their respective goals, utility, assumptions, and associated limitations. We use the gene regulatory network (GRN) involved in Arabidopsis thaliana Root Stem Cell Niche patterning as our illustrative example. We show that descriptive models based on functional genomics data can provide important background information consistent with experimentally supported functional relationships integrated in mechanistic GRN models. The rationale of analysis and modeling can be applied to any other well-characterized functional developmental module in multicellular organisms, like plants and animals.

Scalable Track Detection in SAR CCD Images

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

Chow, James G; Quach, Tu-Thach

Existing methods to detect vehicle tracks in coherent change detection images, a product of combining two synthetic aperture radar images ta ken at different times of the same scene, rely on simple, fast models to label track pixels. These models, however, are often too simple to capture natural track features such as continuity and parallelism. We present a simple convolutional network architecture consisting of a series of 3-by-3 convolutions to detect tracks. The network is trained end-to-end to learn natural track features entirely from data. The network is computationally efficient and improves the F-score on a standard dataset to 0.988,more » up fr om 0.907 obtained by the current state-of-the-art method.« less

Geopolitical model of investment power station construction project implementation

NASA Astrophysics Data System (ADS)

Malafeyev, Oleg; Farvazov, Konstantin; Zenovich, Olga; Zaitseva, Irina; Kostyukov, Konstantin; Svechinskaya, Tatiana

2018-04-01

Two geopolitical actors implement a geopolitical project that involves transportaion and storage of some commodities. They interact with each other through a transport network. The network consists of several interconnected vertices. Some of the vetrices are trading hubs, storage spaces, production hubs and goods buyers. Actors wish to satify the demand of buyers and recieve the highest possible profit subject to compromise solution principle. A numerical example is given.

Functional connectivity dynamically evolves on multiple time-scales over a static structural connectome: Models and mechanisms.

PubMed

Cabral, Joana; Kringelbach, Morten L; Deco, Gustavo

2017-10-15

Over the last decade, we have observed a revolution in brain structural and functional Connectomics. On one hand, we have an ever-more detailed characterization of the brain's white matter structural connectome. On the other, we have a repertoire of consistent functional networks that form and dissipate over time during rest. Despite the evident spatial similarities between structural and functional connectivity, understanding how different time-evolving functional networks spontaneously emerge from a single structural network requires analyzing the problem from the perspective of complex network dynamics and dynamical system's theory. In that direction, bottom-up computational models are useful tools to test theoretical scenarios and depict the mechanisms at the genesis of resting-state activity. Here, we provide an overview of the different mechanistic scenarios proposed over the last decade via computational models. Importantly, we highlight the need of incorporating additional model constraints considering the properties observed at finer temporal scales with MEG and the dynamical properties of FC in order to refresh the list of candidate scenarios. Copyright © 2017 Elsevier Inc. All rights reserved.

GeNN: a code generation framework for accelerated brain simulations

NASA Astrophysics Data System (ADS)

Yavuz, Esin; Turner, James; Nowotny, Thomas

2016-01-01

Large-scale numerical simulations of detailed brain circuit models are important for identifying hypotheses on brain functions and testing their consistency and plausibility. An ongoing challenge for simulating realistic models is, however, computational speed. In this paper, we present the GeNN (GPU-enhanced Neuronal Networks) framework, which aims to facilitate the use of graphics accelerators for computational models of large-scale neuronal networks to address this challenge. GeNN is an open source library that generates code to accelerate the execution of network simulations on NVIDIA GPUs, through a flexible and extensible interface, which does not require in-depth technical knowledge from the users. We present performance benchmarks showing that 200-fold speedup compared to a single core of a CPU can be achieved for a network of one million conductance based Hodgkin-Huxley neurons but that for other models the speedup can differ. GeNN is available for Linux, Mac OS X and Windows platforms. The source code, user manual, tutorials, Wiki, in-depth example projects and all other related information can be found on the project website http://genn-team.github.io/genn/.

GeNN: a code generation framework for accelerated brain simulations.

PubMed

Yavuz, Esin; Turner, James; Nowotny, Thomas

2016-01-07

Large-scale numerical simulations of detailed brain circuit models are important for identifying hypotheses on brain functions and testing their consistency and plausibility. An ongoing challenge for simulating realistic models is, however, computational speed. In this paper, we present the GeNN (GPU-enhanced Neuronal Networks) framework, which aims to facilitate the use of graphics accelerators for computational models of large-scale neuronal networks to address this challenge. GeNN is an open source library that generates code to accelerate the execution of network simulations on NVIDIA GPUs, through a flexible and extensible interface, which does not require in-depth technical knowledge from the users. We present performance benchmarks showing that 200-fold speedup compared to a single core of a CPU can be achieved for a network of one million conductance based Hodgkin-Huxley neurons but that for other models the speedup can differ. GeNN is available for Linux, Mac OS X and Windows platforms. The source code, user manual, tutorials, Wiki, in-depth example projects and all other related information can be found on the project website http://genn-team.github.io/genn/.

GeNN: a code generation framework for accelerated brain simulations

PubMed Central

Yavuz, Esin; Turner, James; Nowotny, Thomas

2016-01-01

Large-scale numerical simulations of detailed brain circuit models are important for identifying hypotheses on brain functions and testing their consistency and plausibility. An ongoing challenge for simulating realistic models is, however, computational speed. In this paper, we present the GeNN (GPU-enhanced Neuronal Networks) framework, which aims to facilitate the use of graphics accelerators for computational models of large-scale neuronal networks to address this challenge. GeNN is an open source library that generates code to accelerate the execution of network simulations on NVIDIA GPUs, through a flexible and extensible interface, which does not require in-depth technical knowledge from the users. We present performance benchmarks showing that 200-fold speedup compared to a single core of a CPU can be achieved for a network of one million conductance based Hodgkin-Huxley neurons but that for other models the speedup can differ. GeNN is available for Linux, Mac OS X and Windows platforms. The source code, user manual, tutorials, Wiki, in-depth example projects and all other related information can be found on the project website http://genn-team.github.io/genn/. PMID:26740369

Equilibria of perceptrons for simple contingency problems.

PubMed

Dawson, Michael R W; Dupuis, Brian

2012-08-01

The contingency between cues and outcomes is fundamentally important to theories of causal reasoning and to theories of associative learning. Researchers have computed the equilibria of Rescorla-Wagner models for a variety of contingency problems, and have used these equilibria to identify situations in which the Rescorla-Wagner model is consistent, or inconsistent, with normative models of contingency. Mathematical analyses that directly compare artificial neural networks to contingency theory have not been performed, because of the assumed equivalence between the Rescorla-Wagner learning rule and the delta rule training of artificial neural networks. However, recent results indicate that this equivalence is not as straightforward as typically assumed, suggesting a strong need for mathematical accounts of how networks deal with contingency problems. One such analysis is presented here, where it is proven that the structure of the equilibrium for a simple network trained on a basic contingency problem is quite different from the structure of the equilibrium for a Rescorla-Wagner model faced with the same problem. However, these structural differences lead to functionally equivalent behavior. The implications of this result for the relationships between associative learning, contingency theory, and connectionism are discussed.

Measuring partner choice in plant-pollinator networks: using null models to separate rewiring and fidelity from chance.

PubMed

MacLeod, Molly; Genung, Mark A; Ascher, John S; Winfree, Rachael

2016-11-01

Recent studies of mutualistic networks show that interactions between partners change across years. Both biological mechanisms and chance could drive these patterns, but the relative importance of these factors has not been separated. We established a field experiment consisting of 102 monospecific plots of 17 native plant species, from which we collected 6713 specimens of 52 bee species over four years. We used these data and a null model to determine whether bee species' foraging choices varied more or less over time beyond the variation expected by chance. Thus we provide the first quantitative definition of rewiring and fidelity as these terms are used in the literature on interaction networks. All 52 bee species varied in plant partner choice across years, but for 27 species this variation was indistinguishable from random partner choice. Another 11 species showed rewiring, varying more across years than expected by chance, while 14 species showed fidelity, indicating that they both prefer certain plant species and are consistent in those preferences across years. Our study shows that rewiring and fidelity both exist in mutualist networks, but that once sampling effects have been accounted for, they are less common than has been reported in the ecological literature. © 2016 by the Ecological Society of America.

Cortical Spiking Network Interfaced with Virtual Musculoskeletal Arm and Robotic Arm.

PubMed

Dura-Bernal, Salvador; Zhou, Xianlian; Neymotin, Samuel A; Przekwas, Andrzej; Francis, Joseph T; Lytton, William W

2015-01-01

Embedding computational models in the physical world is a critical step towards constraining their behavior and building practical applications. Here we aim to drive a realistic musculoskeletal arm model using a biomimetic cortical spiking model, and make a robot arm reproduce the same trajectories in real time. Our cortical model consisted of a 3-layered cortex, composed of several hundred spiking model-neurons, which display physiologically realistic dynamics. We interconnected the cortical model to a two-joint musculoskeletal model of a human arm, with realistic anatomical and biomechanical properties. The virtual arm received muscle excitations from the neuronal model, and fed back proprioceptive information, forming a closed-loop system. The cortical model was trained using spike timing-dependent reinforcement learning to drive the virtual arm in a 2D reaching task. Limb position was used to simultaneously control a robot arm using an improved network interface. Virtual arm muscle activations responded to motoneuron firing rates, with virtual arm muscles lengths encoded via population coding in the proprioceptive population. After training, the virtual arm performed reaching movements which were smoother and more realistic than those obtained using a simplistic arm model. This system provided access to both spiking network properties and to arm biophysical properties, including muscle forces. The use of a musculoskeletal virtual arm and the improved control system allowed the robot arm to perform movements which were smoother than those reported in our previous paper using a simplistic arm. This work provides a novel approach consisting of bidirectionally connecting a cortical model to a realistic virtual arm, and using the system output to drive a robotic arm in real time. Our techniques are applicable to the future development of brain neuroprosthetic control systems, and may enable enhanced brain-machine interfaces with the possibility for finer control of limb prosthetics.

Hopf bifurcation of an (n + 1) -neuron bidirectional associative memory neural network model with delays.

PubMed

Xiao, Min; Zheng, Wei Xing; Cao, Jinde

2013-01-01

Recent studies on Hopf bifurcations of neural networks with delays are confined to simplified neural network models consisting of only two, three, four, five, or six neurons. It is well known that neural networks are complex and large-scale nonlinear dynamical systems, so the dynamics of the delayed neural networks are very rich and complicated. Although discussing the dynamics of networks with a few neurons may help us to understand large-scale networks, there are inevitably some complicated problems that may be overlooked if simplified networks are carried over to large-scale networks. In this paper, a general delayed bidirectional associative memory neural network model with n + 1 neurons is considered. By analyzing the associated characteristic equation, the local stability of the trivial steady state is examined, and then the existence of the Hopf bifurcation at the trivial steady state is established. By applying the normal form theory and the center manifold reduction, explicit formulae are derived to determine the direction and stability of the bifurcating periodic solution. Furthermore, the paper highlights situations where the Hopf bifurcations are particularly critical, in the sense that the amplitude and the period of oscillations are very sensitive to errors due to tolerances in the implementation of neuron interconnections. It is shown that the sensitivity is crucially dependent on the delay and also significantly influenced by the feature of the number of neurons. Numerical simulations are carried out to illustrate the main results.

Optimization of an electromagnetic linear actuator using a network and a finite element model

NASA Astrophysics Data System (ADS)

Neubert, Holger; Kamusella, Alfred; Lienig, Jens

2011-03-01

Model based design optimization leads to robust solutions only if the statistical deviations of design, load and ambient parameters from nominal values are considered. We describe an optimization methodology that involves these deviations as stochastic variables for an exemplary electromagnetic actuator used to drive a Braille printer. A combined model simulates the dynamic behavior of the actuator and its non-linear load. It consists of a dynamic network model and a stationary magnetic finite element (FE) model. The network model utilizes lookup tables of the magnetic force and the flux linkage computed by the FE model. After a sensitivity analysis using design of experiment (DoE) methods and a nominal optimization based on gradient methods, a robust design optimization is performed. Selected design variables are involved in form of their density functions. In order to reduce the computational effort we use response surfaces instead of the combined system model obtained in all stochastic analysis steps. Thus, Monte-Carlo simulations can be applied. As a result we found an optimum system design meeting our requirements with regard to function and reliability.

Deep learning for computational chemistry.

PubMed

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

2017-06-15

The rise and fall of artificial neural networks is well documented in the scientific literature of both 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 multilayer neural networks. Within the last few years, we have seen the transformative impact of deep learning in many domains, particularly in speech recognition and computer vision, to the extent that the majority of expert practitioners in those field are now regularly eschewing prior established models in favor of deep learning models. In this review, we provide an introductory overview into the theory of deep neural networks and their unique properties that distinguish them from 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 quantitative structure activity relationship, virtual screening, protein structure prediction, quantum chemistry, materials design, 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 valuable tool for computational chemistry. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Weighting for sex acts to understand the spread of STI on networks.

PubMed

Moslonka-Lefebvre, Mathieu; Bonhoeffer, Sebastian; Alizon, Samuel

2012-10-21

Human sexual networks exhibit a heterogeneous structure where few individuals have many partners and many individuals have few partners. Network theory predicts that the spread of sexually transmitted infections (STI) on such networks should exhibit striking properties (e.g. rapid spread). However, these properties cannot be found in epidemiological data. Current network models typically assume a constant STI transmission risk per partnership, which is unrealistic because it implies that sexual activity is proportional to the number of partners and that individuals have the same activity with each partner. We develop a framework that allows us to weight any sexual network based on biological assumptions. Our results indicate that STI spreading on the resulting weighted networks do not have heterogeneous-related properties, which is consistent with data and earlier studies. Copyright © 2012 Elsevier Ltd. All rights reserved.

Using structural equation modeling for network meta-analysis.

PubMed

Tu, Yu-Kang; Wu, Yun-Chun

2017-07-14

Network meta-analysis overcomes the limitations of traditional pair-wise meta-analysis by incorporating all available evidence into a general statistical framework for simultaneous comparisons of several treatments. Currently, network meta-analyses are undertaken either within the Bayesian hierarchical linear models or frequentist generalized linear mixed models. Structural equation modeling (SEM) is a statistical method originally developed for modeling causal relations among observed and latent variables. As random effect is explicitly modeled as a latent variable in SEM, it is very flexible for analysts to specify complex random effect structure and to make linear and nonlinear constraints on parameters. The aim of this article is to show how to undertake a network meta-analysis within the statistical framework of SEM. We used an example dataset to demonstrate the standard fixed and random effect network meta-analysis models can be easily implemented in SEM. It contains results of 26 studies that directly compared three treatment groups A, B and C for prevention of first bleeding in patients with liver cirrhosis. We also showed that a new approach to network meta-analysis based on the technique of unrestricted weighted least squares (UWLS) method can also be undertaken using SEM. For both the fixed and random effect network meta-analysis, SEM yielded similar coefficients and confidence intervals to those reported in the previous literature. The point estimates of two UWLS models were identical to those in the fixed effect model but the confidence intervals were greater. This is consistent with results from the traditional pairwise meta-analyses. Comparing to UWLS model with common variance adjusted factor, UWLS model with unique variance adjusted factor has greater confidence intervals when the heterogeneity was larger in the pairwise comparison. The UWLS model with unique variance adjusted factor reflects the difference in heterogeneity within each comparison. SEM provides a very flexible framework for univariate and multivariate meta-analysis, and its potential as a powerful tool for advanced meta-analysis is still to be explored.

Small Modifications to Network Topology Can Induce Stochastic Bistable Spiking Dynamics in a Balanced Cortical Model

PubMed Central

McDonnell, Mark D.; Ward, Lawrence M.

2014-01-01

Abstract Directed random graph models frequently are used successfully in modeling the population dynamics of networks of cortical neurons connected by chemical synapses. Experimental results consistently reveal that neuronal network topology is complex, however, in the sense that it differs statistically from a random network, and differs for classes of neurons that are physiologically different. This suggests that complex network models whose subnetworks have distinct topological structure may be a useful, and more biologically realistic, alternative to random networks. Here we demonstrate that the balanced excitation and inhibition frequently observed in small cortical regions can transiently disappear in otherwise standard neuronal-scale models of fluctuation-driven dynamics, solely because the random network topology was replaced by a complex clustered one, whilst not changing the in-degree of any neurons. In this network, a small subset of cells whose inhibition comes only from outside their local cluster are the cause of bistable population dynamics, where different clusters of these cells irregularly switch back and forth from a sparsely firing state to a highly active state. Transitions to the highly active state occur when a cluster of these cells spikes sufficiently often to cause strong unbalanced positive feedback to each other. Transitions back to the sparsely firing state rely on occasional large fluctuations in the amount of non-local inhibition received. Neurons in the model are homogeneous in their intrinsic dynamics and in-degrees, but differ in the abundance of various directed feedback motifs in which they participate. Our findings suggest that (i) models and simulations should take into account complex structure that varies for neuron and synapse classes; (ii) differences in the dynamics of neurons with similar intrinsic properties may be caused by their membership in distinctive local networks; (iii) it is important to identify neurons that share physiological properties and location, but differ in their connectivity. PMID:24743633

Stimulus-induced transitions between spike-wave discharges and spindles with the modulation of thalamic reticular nucleus.

PubMed

Fan, Denggui; Wang, Qingyun; Su, Jianzhong; Xi, Hongguang

2017-12-01

It is believed that thalamic reticular nucleus (TRN) controls spindles and spike-wave discharges (SWD) in seizure or sleeping processes. The dynamical mechanisms of spatiotemporal evolutions between these two types of activity, however, are not well understood. In light of this, we first use a single-compartment thalamocortical neural field model to investigate the effects of TRN on occurrence of SWD and its transition. Results show that the increasing inhibition from TRN to specific relay nuclei (SRN) can lead to the transition of system from SWD to slow-wave oscillation. Specially, it is shown that stimulations applied in the cortical neuronal populations can also initiate the SWD and slow-wave oscillation from the resting states under the typical inhibitory intensity from TRN to SRN. Then, we expand into a 3-compartment coupled thalamocortical model network in linear and circular structures, respectively, to explore the spatiotemporal evolutions of wave states in different compartments. The main results are: (i) for the open-ended model network, SWD induced by stimulus in the first compartment can be transformed into sleep-like slow UP-DOWN and spindle states as it propagates into the downstream compartments; (ii) for the close-ended model network, weak stimulations performed in the first compartment can result in the consistent experimentally observed spindle oscillations in all three compartments; in contrast, stronger periodic single-pulse stimulations applied in the first compartment can induce periodic transitions between SWD and spindle oscillations. Detailed investigations reveal that multi-attractor coexistence mechanism composed of SWD, spindles and background state underlies these state evolutions. What's more, in order to demonstrate the state evolution stability with respect to the topological structures of neural network, we further expand the 3-compartment coupled network into 10-compartment coupled one, with linear and circular structures, and nearest-neighbor (NN) coupled network as well as its realization of small-world (SW) topology via random rewiring, respectively. Interestingly, for the cases of linear and circular connetivities, qualitatively similar results were obtained in addition to the more irregularity of firings. However, SWD can be eventually transformed into the consistent low-amplitude oscillations for both NN and SW networks. In particular, SWD evolves into the slow spindling oscillations and background tonic oscillations within the NN and SW network, respectively. Our modeling and simulation studies highlight the effect of network topology in the evolutions of SWD and spindling oscillations, which provides new insights into the mechanisms of cortical seizures development.

Surveying traffic congestion based on the concept of community structure of complex networks

NASA Astrophysics Data System (ADS)

Ma, Lili; Zhang, Zhanli; Li, Meng

2016-07-01

In this paper, taking the traffic of Beijing city as an instance, we study city traffic states, especially traffic congestion, based on the concept of network community structure. Concretely, using the floating car data (FCD) information of vehicles gained from the intelligent transport system (ITS) of the city, we construct a new traffic network model which is with floating cars as network nodes and time-varying. It shows that this traffic network has Gaussian degree distributions at different time points. Furthermore, compared with free traffic situations, our simulations show that the traffic network generally has more obvious community structures with larger values of network fitness for congested traffic situations, and through the GPSspg web page, we show that all of our results are consistent with the reality. Then, it indicates that network community structure should be an available way for investigating city traffic congestion problems.

Master stability functions reveal diffusion-driven pattern formation in networks

NASA Astrophysics Data System (ADS)

Brechtel, Andreas; Gramlich, Philipp; Ritterskamp, Daniel; Drossel, Barbara; Gross, Thilo

2018-03-01

We study diffusion-driven pattern formation in networks of networks, a class of multilayer systems, where different layers have the same topology, but different internal dynamics. Agents are assumed to disperse within a layer by undergoing random walks, while they can be created or destroyed by reactions between or within a layer. We show that the stability of homogeneous steady states can be analyzed with a master stability function approach that reveals a deep analogy between pattern formation in networks and pattern formation in continuous space. For illustration, we consider a generalized model of ecological meta-food webs. This fairly complex model describes the dispersal of many different species across a region consisting of a network of individual habitats while subject to realistic, nonlinear predator-prey interactions. In this example, the method reveals the intricate dependence of the dynamics on the spatial structure. The ability of the proposed approach to deal with this fairly complex system highlights it as a promising tool for ecology and other applications.

Epidemic spreading and immunization strategy in multiplex networks

NASA Astrophysics Data System (ADS)

Alvarez Zuzek, Lucila G.; Buono, Camila; Braunstein, Lidia A.

2015-09-01

A more connected world has brought major consequences such as facilitate the spread of diseases all over the world to quickly become epidemics, reason why researchers are concentrated in modeling the propagation of epidemics and outbreaks in multilayer networks. In this networks all nodes interact in different layers with different type of links. However, in many scenarios such as in the society, a multiplex network framework is not completely suitable since not all individuals participate in all layers. In this paper, we use a partially overlapped, multiplex network where only a fraction of the individuals are shared by the layers. We develop a mitigation strategy for stopping a disease propagation, considering the Susceptible-Infected- Recover model, in a system consisted by two layers. We consider a random immunization in one of the layers and study the effect of the overlapping fraction in both, the propagation of the disease and the immunization strategy. Using branching theory, we study this scenario theoretically and via simulations and find a lower epidemic threshold than in the case without strategy.

General solution of the chemical master equation and modality of marginal distributions for hierarchic first-order reaction networks.

PubMed

Reis, Matthias; Kromer, Justus A; Klipp, Edda

2018-01-20

Multimodality is a phenomenon which complicates the analysis of statistical data based exclusively on mean and variance. Here, we present criteria for multimodality in hierarchic first-order reaction networks, consisting of catalytic and splitting reactions. Those networks are characterized by independent and dependent subnetworks. First, we prove the general solvability of the Chemical Master Equation (CME) for this type of reaction network and thereby extend the class of solvable CME's. Our general solution is analytical in the sense that it allows for a detailed analysis of its statistical properties. Given Poisson/deterministic initial conditions, we then prove the independent species to be Poisson/binomially distributed, while the dependent species exhibit generalized Poisson/Khatri Type B distributions. Generalized Poisson/Khatri Type B distributions are multimodal for an appropriate choice of parameters. We illustrate our criteria for multimodality by several basic models, as well as the well-known two-stage transcription-translation network and Bateman's model from nuclear physics. For both examples, multimodality was previously not reported.

Predicting economic growth with stock networks

NASA Astrophysics Data System (ADS)

Heiberger, Raphael H.

2018-01-01

Networks derived from stock prices are often used to model developments on financial markets and are tightly intertwined with crises. Yet, the influence of changing market topologies on the broader economy (i.e. GDP) is unclear. In this paper, we propose a Bayesian approach that utilizes individual-level network measures of companies as lagged probabilistic features to predict national economic growth. We use a comprehensive data set consisting of Standard and Poor's 500 corporations from January 1988 until October 2016. The final model forecasts correctly all major recession and prosperity phases of the U.S. economy up to one year ahead. By employing different network measures on the level of corporations, we can also identify which companies' stocks possess a key role in a changing economic environment and may be used as indication of critical (and prosperous) developments. More generally, the proposed approach allows to predict probabilities for different overall states of social entities by using local network positions and could be applied on various phenomena.

Diffusion in random networks

DOE PAGES

Zhang, Duan Z.; Padrino, Juan C.

2017-06-01

The ensemble averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of pockets connected by tortuous channels. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pocket mass density. The so-called dual-porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem,more » we consider the one-dimensional mass diffusion in a semi-infinite domain. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt $-$1/4 rather than xt $-$1/2 as in the traditional theory. We found this early time similarity can be explained by random walk theory through the network.« less

A Web Service-Based Framework Model for People-Centric Sensing Applications Applied to Social Networking

PubMed Central

Nunes, David; Tran, Thanh-Dien; Raposo, Duarte; Pinto, André; Gomes, André; Silva, Jorge Sá

2012-01-01

As the Internet evolved, social networks (such as Facebook) have bloomed and brought together an astonishing number of users. Mashing up mobile phones and sensors with these social environments enables the creation of people-centric sensing systems which have great potential for expanding our current social networking usage. However, such systems also have many associated technical challenges, such as privacy concerns, activity detection mechanisms or intermittent connectivity, as well as limitations due to the heterogeneity of sensor nodes and networks. Considering the openness of the Web 2.0, good technical solutions for these cases consist of frameworks that expose sensing data and functionalities as common Web-Services. This paper presents our RESTful Web Service-based model for people-centric sensing frameworks, which uses sensors and mobile phones to detect users’ activities and locations, sharing this information amongst the user’s friends within a social networking site. We also present some screenshot results of our experimental prototype. PMID:22438732

A Web Service-based framework model for people-centric sensing applications applied to social networking.

PubMed

Nunes, David; Tran, Thanh-Dien; Raposo, Duarte; Pinto, André; Gomes, André; Silva, Jorge Sá

2012-01-01

As the Internet evolved, social networks (such as Facebook) have bloomed and brought together an astonishing number of users. Mashing up mobile phones and sensors with these social environments enables the creation of people-centric sensing systems which have great potential for expanding our current social networking usage. However, such systems also have many associated technical challenges, such as privacy concerns, activity detection mechanisms or intermittent connectivity, as well as limitations due to the heterogeneity of sensor nodes and networks. Considering the openness of the Web 2.0, good technical solutions for these cases consist of frameworks that expose sensing data and functionalities as common Web-Services. This paper presents our RESTful Web Service-based model for people-centric sensing frameworks, which uses sensors and mobile phones to detect users' activities and locations, sharing this information amongst the user's friends within a social networking site. We also present some screenshot results of our experimental prototype.

Automated riverine landscape characterization: GIS-based tools for watershed-scale research, assessment, and management.

PubMed

Williams, Bradley S; D'Amico, Ellen; Kastens, Jude H; Thorp, James H; Flotemersch, Joseph E; Thoms, Martin C

2013-09-01

River systems consist of hydrogeomorphic patches (HPs) that emerge at multiple spatiotemporal scales. Functional process zones (FPZs) are HPs that exist at the river valley scale and are important strata for framing whole-watershed research questions and management plans. Hierarchical classification procedures aid in HP identification by grouping sections of river based on their hydrogeomorphic character; however, collecting data required for such procedures with field-based methods is often impractical. We developed a set of GIS-based tools that facilitate rapid, low cost riverine landscape characterization and FPZ classification. Our tools, termed RESonate, consist of a custom toolbox designed for ESRI ArcGIS®. RESonate automatically extracts 13 hydrogeomorphic variables from readily available geospatial datasets and datasets derived from modeling procedures. An advanced 2D flood model, FLDPLN, designed for MATLAB® is used to determine valley morphology by systematically flooding river networks. When used in conjunction with other modeling procedures, RESonate and FLDPLN can assess the character of large river networks quickly and at very low costs. Here we describe tool and model functions in addition to their benefits, limitations, and applications.

Mechanical behavior in living cells consistent with the tensegrity model

NASA Technical Reports Server (NTRS)

Wang, N.; Naruse, K.; Stamenovic, D.; Fredberg, J. J.; Mijailovich, S. M.; Tolic-Norrelykke, I. M.; Polte, T.; Mannix, R.; Ingber, D. E.

2001-01-01

Alternative models of cell mechanics depict the living cell as a simple mechanical continuum, porous filament gel, tensed cortical membrane, or tensegrity network that maintains a stabilizing prestress through incorporation of discrete structural elements that bear compression. Real-time microscopic analysis of cells containing GFP-labeled microtubules and associated mitochondria revealed that living cells behave like discrete structures composed of an interconnected network of actin microfilaments and microtubules when mechanical stresses are applied to cell surface integrin receptors. Quantitation of cell tractional forces and cellular prestress by using traction force microscopy confirmed that microtubules bear compression and are responsible for a significant portion of the cytoskeletal prestress that determines cell shape stability under conditions in which myosin light chain phosphorylation and intracellular calcium remained unchanged. Quantitative measurements of both static and dynamic mechanical behaviors in cells also were consistent with specific a priori predictions of the tensegrity model. These findings suggest that tensegrity represents a unified model of cell mechanics that may help to explain how mechanical behaviors emerge through collective interactions among different cytoskeletal filaments and extracellular adhesions in living cells.

Stochastic competitive learning in complex networks.

PubMed

Silva, Thiago Christiano; Zhao, Liang

2012-03-01

Competitive learning is an important machine learning approach which is widely employed in artificial neural networks. In this paper, we present a rigorous definition of a new type of competitive learning scheme realized on large-scale networks. The model consists of several particles walking within the network and competing with each other to occupy as many nodes as possible, while attempting to reject intruder particles. The particle's walking rule is composed of a stochastic combination of random and preferential movements. The model has been applied to solve community detection and data clustering problems. Computer simulations reveal that the proposed technique presents high precision of community and cluster detections, as well as low computational complexity. Moreover, we have developed an efficient method for estimating the most likely number of clusters by using an evaluator index that monitors the information generated by the competition process itself. We hope this paper will provide an alternative way to the study of competitive learning..

The Airspace Concepts Evaluation System Architecture and System Plant

NASA Technical Reports Server (NTRS)

Windhorst, Robert; Meyn, Larry; Manikonda, Vikram; Carlos, Patrick; Capozzi, Brian

2006-01-01

The Airspace Concepts Evaluation System is a simulation of the National Airspace System. It includes models of flights, airports, airspaces, air traffic controls, traffic flow managements, and airline operation centers operating throughout the United States. It is used to predict system delays in response to future capacity and demand scenarios and perform benefits assessments of current and future airspace technologies and operational concepts. Facilitation of these studies requires that the simulation architecture supports plug and play of different air traffic control, traffic flow management, and airline operation center models and multi-fidelity modeling of flights, airports, and airspaces. The simulation is divided into two parts that are named, borrowing from classical control theory terminology, control and plant. The control consists of air traffic control, traffic flow management, and airline operation center models, and the plant consists of flight, airport, and airspace models. The plant can run open loop, in the absence of the control. However, undesired affects, such as conflicts and over congestions in the airspaces and airports, can occur. Different controls are applied, "plug and played", to the plant. A particular control is evaluated by analyzing how well it managed conflicts and congestions. Furthermore, the terminal area plants consist of models of airports and terminal airspaces. Each model consists of a set of nodes and links which are connected by the user to form a network. Nodes model runways, fixes, taxi intersections, gates, and/or other points of interest, and links model taxiways, departure paths, and arrival paths. Metering, flow distribution, and sequencing functions can be applied at nodes. Different fidelity model of how a flight transits are can be used by links. The fidelity of the model can be adjusted by the user by either changing the complexity of the node/link network-or the way that the link models how the flights transit from one node to the other.

Nonlinear aeroacoustic characterization of Helmholtz resonators with a local-linear neuro-fuzzy network model

NASA Astrophysics Data System (ADS)

Förner, K.; Polifke, W.

2017-10-01

The nonlinear acoustic behavior of Helmholtz resonators is characterized by a data-based reduced-order model, which is obtained by a combination of high-resolution CFD simulation and system identification. It is shown that even in the nonlinear regime, a linear model is capable of describing the reflection behavior at a particular amplitude with quantitative accuracy. This observation motivates to choose a local-linear model structure for this study, which consists of a network of parallel linear submodels. A so-called fuzzy-neuron layer distributes the input signal over the linear submodels, depending on the root mean square of the particle velocity at the resonator surface. The resulting model structure is referred to as an local-linear neuro-fuzzy network. System identification techniques are used to estimate the free parameters of this model from training data. The training data are generated by CFD simulations of the resonator, with persistent acoustic excitation over a wide range of frequencies and sound pressure levels. The estimated nonlinear, reduced-order models show good agreement with CFD and experimental data over a wide range of amplitudes for several test cases.

Patient Data Synchronization Process in a Continuity of Care Environment

PubMed Central

Haras, Consuela; Sauquet, Dominique; Ameline, Philippe; Jaulent, Marie-Christine; Degoulet, Patrice

2005-01-01

In a distributed patient record environment, we analyze the processes needed to ensure exchange and access to EHR data. We propose an adapted method and the tools for data synchronization. Our study takes into account the issues of user rights management for data access and of decreasing the amount of data exchanged over the network. We describe a XML-based synchronization model that is portable and independent of specific medical data models. The implemented platform consists of several servers, of local network clients, of workstations running user’s interfaces and of data exchange and synchronization tools. PMID:16779049

Integrating probabilistic models of perception and interactive neural networks: a historical and tutorial review

PubMed Central

McClelland, James L.

2013-01-01

This article seeks to establish a rapprochement between explicitly Bayesian models of contextual effects in perception and neural network models of such effects, particularly the connectionist interactive activation (IA) model of perception. The article is in part an historical review and in part a tutorial, reviewing the probabilistic Bayesian approach to understanding perception and how it may be shaped by context, and also reviewing ideas about how such probabilistic computations may be carried out in neural networks, focusing on the role of context in interactive neural networks, in which both bottom-up and top-down signals affect the interpretation of sensory inputs. It is pointed out that connectionist units that use the logistic or softmax activation functions can exactly compute Bayesian posterior probabilities when the bias terms and connection weights affecting such units are set to the logarithms of appropriate probabilistic quantities. Bayesian concepts such the prior, likelihood, (joint and marginal) posterior, probability matching and maximizing, and calculating vs. sampling from the posterior are all reviewed and linked to neural network computations. Probabilistic and neural network models are explicitly linked to the concept of a probabilistic generative model that describes the relationship between the underlying target of perception (e.g., the word intended by a speaker or other source of sensory stimuli) and the sensory input that reaches the perceiver for use in inferring the underlying target. It is shown how a new version of the IA model called the multinomial interactive activation (MIA) model can sample correctly from the joint posterior of a proposed generative model for perception of letters in words, indicating that interactive processing is fully consistent with principled probabilistic computation. Ways in which these computations might be realized in real neural systems are also considered. PMID:23970868

Integrating probabilistic models of perception and interactive neural networks: a historical and tutorial review.

PubMed

McClelland, James L

2013-01-01

This article seeks to establish a rapprochement between explicitly Bayesian models of contextual effects in perception and neural network models of such effects, particularly the connectionist interactive activation (IA) model of perception. The article is in part an historical review and in part a tutorial, reviewing the probabilistic Bayesian approach to understanding perception and how it may be shaped by context, and also reviewing ideas about how such probabilistic computations may be carried out in neural networks, focusing on the role of context in interactive neural networks, in which both bottom-up and top-down signals affect the interpretation of sensory inputs. It is pointed out that connectionist units that use the logistic or softmax activation functions can exactly compute Bayesian posterior probabilities when the bias terms and connection weights affecting such units are set to the logarithms of appropriate probabilistic quantities. Bayesian concepts such the prior, likelihood, (joint and marginal) posterior, probability matching and maximizing, and calculating vs. sampling from the posterior are all reviewed and linked to neural network computations. Probabilistic and neural network models are explicitly linked to the concept of a probabilistic generative model that describes the relationship between the underlying target of perception (e.g., the word intended by a speaker or other source of sensory stimuli) and the sensory input that reaches the perceiver for use in inferring the underlying target. It is shown how a new version of the IA model called the multinomial interactive activation (MIA) model can sample correctly from the joint posterior of a proposed generative model for perception of letters in words, indicating that interactive processing is fully consistent with principled probabilistic computation. Ways in which these computations might be realized in real neural systems are also considered.

Reverse-engineering of gene networks for regulating early blood development from single-cell measurements.

PubMed

Wei, Jiangyong; Hu, Xiaohua; Zou, Xiufen; Tian, Tianhai

2017-12-28

Recent advances in omics technologies have raised great opportunities to study large-scale regulatory networks inside the cell. In addition, single-cell experiments have measured the gene and protein activities in a large number of cells under the same experimental conditions. However, a significant challenge in computational biology and bioinformatics is how to derive quantitative information from the single-cell observations and how to develop sophisticated mathematical models to describe the dynamic properties of regulatory networks using the derived quantitative information. This work designs an integrated approach to reverse-engineer gene networks for regulating early blood development based on singel-cell experimental observations. The wanderlust algorithm is initially used to develop the pseudo-trajectory for the activities of a number of genes. Since the gene expression data in the developed pseudo-trajectory show large fluctuations, we then use Gaussian process regression methods to smooth the gene express data in order to obtain pseudo-trajectories with much less fluctuations. The proposed integrated framework consists of both bioinformatics algorithms to reconstruct the regulatory network and mathematical models using differential equations to describe the dynamics of gene expression. The developed approach is applied to study the network regulating early blood cell development. A graphic model is constructed for a regulatory network with forty genes and a dynamic model using differential equations is developed for a network of nine genes. Numerical results suggests that the proposed model is able to match experimental data very well. We also examine the networks with more regulatory relations and numerical results show that more regulations may exist. We test the possibility of auto-regulation but numerical simulations do not support the positive auto-regulation. In addition, robustness is used as an importantly additional criterion to select candidate networks. The research results in this work shows that the developed approach is an efficient and effective method to reverse-engineer gene networks using single-cell experimental observations.

Functional networks inference from rule-based machine learning models.

PubMed

Lazzarini, Nicola; Widera, Paweł; Williamson, Stuart; Heer, Rakesh; Krasnogor, Natalio; Bacardit, Jaume

2016-01-01

Functional networks play an important role in the analysis of biological processes and systems. The inference of these networks from high-throughput (-omics) data is an area of intense research. So far, the similarity-based inference paradigm (e.g. gene co-expression) has been the most popular approach. It assumes a functional relationship between genes which are expressed at similar levels across different samples. An alternative to this paradigm is the inference of relationships from the structure of machine learning models. These models are able to capture complex relationships between variables, that often are different/complementary to the similarity-based methods. We propose a protocol to infer functional networks from machine learning models, called FuNeL. It assumes, that genes used together within a rule-based machine learning model to classify the samples, might also be functionally related at a biological level. The protocol is first tested on synthetic datasets and then evaluated on a test suite of 8 real-world datasets related to human cancer. The networks inferred from the real-world data are compared against gene co-expression networks of equal size, generated with 3 different methods. The comparison is performed from two different points of view. We analyse the enriched biological terms in the set of network nodes and the relationships between known disease-associated genes in a context of the network topology. The comparison confirms both the biological relevance and the complementary character of the knowledge captured by the FuNeL networks in relation to similarity-based methods and demonstrates its potential to identify known disease associations as core elements of the network. Finally, using a prostate cancer dataset as a case study, we confirm that the biological knowledge captured by our method is relevant to the disease and consistent with the specialised literature and with an independent dataset not used in the inference process. The implementation of our network inference protocol is available at: http://ico2s.org/software/funel.html.

Ion track based tunable device as humidity sensor: a neural network approach

NASA Astrophysics Data System (ADS)

Sharma, Mamta; Sharma, Anuradha; Bhattacherjee, Vandana

2013-01-01

Artificial Neural Network (ANN) has been applied in statistical model development, adaptive control system, pattern recognition in data mining, and decision making under uncertainty. The nonlinear dependence of any sensor output on the input physical variable has been the motivation for many researchers to attempt unconventional modeling techniques such as neural networks and other machine learning approaches. Artificial neural network (ANN) is a computational tool inspired by the network of neurons in biological nervous system. It is a network consisting of arrays of artificial neurons linked together with different weights of connection. The states of the neurons as well as the weights of connections among them evolve according to certain learning rules.. In the present work we focus on the category of sensors which respond to electrical property changes such as impedance or capacitance. Recently, sensor materials have been embedded in etched tracks due to their nanometric dimensions and high aspect ratio which give high surface area available for exposure to sensing material. Various materials can be used for this purpose to probe physical (light intensity, temperature etc.), chemical (humidity, ammonia gas, alcohol etc.) or biological (germs, hormones etc.) parameters. The present work involves the application of TEMPOS structures as humidity sensors. The sample to be studied was prepared using the polymer electrolyte (PEO/NH4ClO4) with CdS nano-particles dispersed in the polymer electrolyte. In the present research we have attempted to correlate the combined effects of voltage and frequency on impedance of humidity sensors using a neural network model and results have indicated that the mean absolute error of the ANN Model for the training data was 3.95% while for the validation data it was 4.65%. The corresponding values for the LR model were 8.28% and 8.35% respectively. It was also demonstrated the percentage improvement of the ANN Model with respect to the linear regression model. This demonstrates the suitability of neural networks to perform such modeling.

Managing biological networks by using text mining and computer-aided curation

NASA Astrophysics Data System (ADS)

Yu, Seok Jong; Cho, Yongseong; Lee, Min-Ho; Lim, Jongtae; Yoo, Jaesoo

2015-11-01

In order to understand a biological mechanism in a cell, a researcher should collect a huge number of protein interactions with experimental data from experiments and the literature. Text mining systems that extract biological interactions from papers have been used to construct biological networks for a few decades. Even though the text mining of literature is necessary to construct a biological network, few systems with a text mining tool are available for biologists who want to construct their own biological networks. We have developed a biological network construction system called BioKnowledge Viewer that can generate a biological interaction network by using a text mining tool and biological taggers. It also Boolean simulation software to provide a biological modeling system to simulate the model that is made with the text mining tool. A user can download PubMed articles and construct a biological network by using the Multi-level Knowledge Emergence Model (KMEM), MetaMap, and A Biomedical Named Entity Recognizer (ABNER) as a text mining tool. To evaluate the system, we constructed an aging-related biological network that consist 9,415 nodes (genes) by using manual curation. With network analysis, we found that several genes, including JNK, AP-1, and BCL-2, were highly related in aging biological network. We provide a semi-automatic curation environment so that users can obtain a graph database for managing text mining results that are generated in the server system and can navigate the network with BioKnowledge Viewer, which is freely available at http://bioknowledgeviewer.kisti.re.kr.

Efficient Mining and Detection of Sequential Intrusion Patterns for Network Intrusion Detection Systems

NASA Astrophysics Data System (ADS)

Shyu, Mei-Ling; Huang, Zifang; Luo, Hongli

In recent years, pervasive computing infrastructures have greatly improved the interaction between human and system. As we put more reliance on these computing infrastructures, we also face threats of network intrusion and/or any new forms of undesirable IT-based activities. Hence, network security has become an extremely important issue, which is closely connected with homeland security, business transactions, and people's daily life. Accurate and efficient intrusion detection technologies are required to safeguard the network systems and the critical information transmitted in the network systems. In this chapter, a novel network intrusion detection framework for mining and detecting sequential intrusion patterns is proposed. The proposed framework consists of a Collateral Representative Subspace Projection Modeling (C-RSPM) component for supervised classification, and an inter-transactional association rule mining method based on Layer Divided Modeling (LDM) for temporal pattern analysis. Experiments on the KDD99 data set and the traffic data set generated by a private LAN testbed show promising results with high detection rates, low processing time, and low false alarm rates in mining and detecting sequential intrusion detections.

In-silico studies of neutral drift for functional protein interaction networks

NASA Astrophysics Data System (ADS)

Ali, Md Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

We have developed a minimal physically-motivated model of protein-protein interaction networks. Our system consists of two classes of enzymes, activators (e.g. kinases) and deactivators (e.g. phosphatases), and the enzyme-mediated activation/deactivation rates are determined by sequence-dependent binding strengths between enzymes and their targets. The network is evolved by introducing random point mutations in the binding sequences where we assume that each new mutation is either fixed or entirely lost. We apply this model to studies of neutral drift in networks that yield oscillatory dynamics, where we start, for example, with a relatively simple network and allow it to evolve by adding nodes and connections while requiring that dynamics be conserved. Our studies demonstrate both the importance of employing a sequence-based evolutionary scheme and the relative rapidity (in evolutionary time) for the redistribution of function over new nodes via neutral drift. Surprisingly, in addition to this redistribution time we discovered another much slower timescale for network evolution, reflecting hidden order in sequence space that we interpret in terms of sparsely connected domains.

Consistent earthquake catalog derived from changing network configurations: Application to the Rawil Depression in the southwestern Helvetic Alps

NASA Astrophysics Data System (ADS)

Lee, Timothy; Diehl, Tobias; Kissling, Edi; Wiemer, Stefan

2017-04-01

Earthquake catalogs derived from several decades of observations are often biased by network geometries, location procedures, and data quality changing with time. To study the long-term spatio-temporal behavior of seismogenic fault zones at high-resolution, a consistent homogenization and improvement of earthquake catalogs is required. Assuming that data quality and network density generally improves with time, procedures are needed, which use the best available data to homogeneously solve the coupled hypocenter - velocity structure problem and can be as well applied to earlier network configurations in the same region. A common approach to uniformly relocate earthquake catalogs is the calculation of a so-called "minimum 1D" model, which is derived from the simultaneous inversion for hypocenters and 1D velocity structure, including station specific delay-time corrections. In this work, we will present strategies using the principles of the "minimum 1D" model to consistently relocate hypocenters recorded by the Swiss Seismological Service (SED) in the Swiss Alps over a period of 17 years in a region, which is characterized by significant changes in network configurations. The target region of this study is the Rawil depression, which is located between the Aar and Mont Blanc massifs in southwestern Switzerland. The Rhone-Simplon Fault is located to the south of the Rawil depression and is considered as a dextral strike-slip fault representing the dominant tectonic boundary between Helvetic nappes to the north and Penninic nappes to the south. Current strike-slip earthquakes, however, occur predominantly in a narrow, east-west striking cluster located in the Rawil depression north of the Rhone-Simplon Fault. Recent earthquake swarms near Sion and Sierre in 2011 and 2016, on the other hand, indicate seismically active dextral faults close to the Rhone valley. The region north and south of the Rhone-Simplon Fault is one of the most seismically active regions in Switzerland and therefore a prime target to study the mechanics of active fault zones in the Swiss Alps. In the presented study, existing travel-time data from the SED bulletin from the entire instrumental era (1984-today) are used to calculate a "minimum 1D" model for the region. The dataset is complemented by data of three broadband stations, recently installed to further densify the seismic network of the SED in the Rawil area. The new model is compared to previous local and regional 1D and 3D models. The derived model is used for systematic relocation of the seismicity in the Rawil region and will be used as reference model for high-resolution 3D models imaging the velocity structure of the Rawil fault zone in a next step. The presented procedure is of relevance for similar studies planned in other regions of the Alps, which have been densified by AlpArray stations.

Minimum spanning tree analysis of the human connectome

PubMed Central

Sommer, Iris E.; Bohlken, Marc M.; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A.; Douw, Linda; Otte, Willem M.; Mandl, René C.W.; Stam, Cornelis J.

2018-01-01

Abstract One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion‐weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null‐model. The MST of individual subjects matched this reference MST for a mean 58%–88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so‐called rich club nodes (a subset of high‐degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical–subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. PMID:29468769

iAK692: A genome-scale metabolic model of Spirulina platensis C1

PubMed Central

2012-01-01

Background Spirulina (Arthrospira) platensis is a well-known filamentous cyanobacterium used in the production of many industrial products, including high value compounds, healthy food supplements, animal feeds, pharmaceuticals and cosmetics, for example. It has been increasingly studied around the world for scientific purposes, especially for its genome, biology, physiology, and also for the analysis of its small-scale metabolic network. However, the overall description of the metabolic and biotechnological capabilities of S. platensis requires the development of a whole cellular metabolism model. Recently, the S. platensis C1 (Arthrospira sp. PCC9438) genome sequence has become available, allowing systems-level studies of this commercial cyanobacterium. Results In this work, we present the genome-scale metabolic network analysis of S. platensis C1, iAK692, its topological properties, and its metabolic capabilities and functions. The network was reconstructed from the S. platensis C1 annotated genomic sequence using Pathway Tools software to generate a preliminary network. Then, manual curation was performed based on a collective knowledge base and a combination of genomic, biochemical, and physiological information. The genome-scale metabolic model consists of 692 genes, 837 metabolites, and 875 reactions. We validated iAK692 by conducting fermentation experiments and simulating the model under autotrophic, heterotrophic, and mixotrophic growth conditions using COBRA toolbox. The model predictions under these growth conditions were consistent with the experimental results. The iAK692 model was further used to predict the unique active reactions and essential genes for each growth condition. Additionally, the metabolic states of iAK692 during autotrophic and mixotrophic growths were described by phenotypic phase plane (PhPP) analysis. Conclusions This study proposes the first genome-scale model of S. platensis C1, iAK692, which is a predictive metabolic platform for a global understanding of physiological behaviors and metabolic engineering. This platform could accelerate the integrative analysis of various “-omics” data, leading to strain improvement towards a diverse range of desired industrial products from Spirulina. PMID:22703714

iAK692: a genome-scale metabolic model of Spirulina platensis C1.

PubMed

Klanchui, Amornpan; Khannapho, Chiraphan; Phodee, Atchara; Cheevadhanarak, Supapon; Meechai, Asawin

2012-06-15

Spirulina (Arthrospira) platensis is a well-known filamentous cyanobacterium used in the production of many industrial products, including high value compounds, healthy food supplements, animal feeds, pharmaceuticals and cosmetics, for example. It has been increasingly studied around the world for scientific purposes, especially for its genome, biology, physiology, and also for the analysis of its small-scale metabolic network. However, the overall description of the metabolic and biotechnological capabilities of S. platensis requires the development of a whole cellular metabolism model. Recently, the S. platensis C1 (Arthrospira sp. PCC9438) genome sequence has become available, allowing systems-level studies of this commercial cyanobacterium. In this work, we present the genome-scale metabolic network analysis of S. platensis C1, iAK692, its topological properties, and its metabolic capabilities and functions. The network was reconstructed from the S. platensis C1 annotated genomic sequence using Pathway Tools software to generate a preliminary network. Then, manual curation was performed based on a collective knowledge base and a combination of genomic, biochemical, and physiological information. The genome-scale metabolic model consists of 692 genes, 837 metabolites, and 875 reactions. We validated iAK692 by conducting fermentation experiments and simulating the model under autotrophic, heterotrophic, and mixotrophic growth conditions using COBRA toolbox. The model predictions under these growth conditions were consistent with the experimental results. The iAK692 model was further used to predict the unique active reactions and essential genes for each growth condition. Additionally, the metabolic states of iAK692 during autotrophic and mixotrophic growths were described by phenotypic phase plane (PhPP) analysis. This study proposes the first genome-scale model of S. platensis C1, iAK692, which is a predictive metabolic platform for a global understanding of physiological behaviors and metabolic engineering. This platform could accelerate the integrative analysis of various "-omics" data, leading to strain improvement towards a diverse range of desired industrial products from Spirulina.

Influence of Chirality in Ordered Block Copolymer Phases

NASA Astrophysics Data System (ADS)

Prasad, Ishan; Grason, Gregory

2015-03-01

Block copolymers are known to assemble into rich spectrum of ordered phases, with many complex phases driven by asymmetry in copolymer architecture. Despite decades of study, the influence of intrinsic chirality on equilibrium mesophase assembly of block copolymers is not well understood and largely unexplored. Self-consistent field theory has played a major role in prediction of physical properties of polymeric systems. Only recently, a polar orientational self-consistent field (oSCF) approach was adopted to model chiral BCP having a thermodynamic preference for cholesteric ordering in chiral segments. We implement oSCF theory for chiral nematic copolymers, where segment orientations are characterized by quadrupolar chiral interactions, and focus our study on the thermodynamic stability of bi-continuous network morphologies, and the transfer of molecular chirality to mesoscale chirality of networks. Unique photonic properties observed in butterfly wings have been attributed to presence of chiral single-gyroid networks, this has made it an attractive target for chiral metamaterial design.

Experimental and Computational Studies of Sound Transmission in a Branching Airway Network Embedded in a Compliant Viscoelastic Medium

PubMed Central

Dai, Zoujun; Peng, Ying; Mansy, Hansen A.; Sandler, Richard H.; Royston, Thomas J.

2015-01-01

Breath sounds are often used to aid in the diagnosis of pulmonary disease. Mechanical and numerical models could be used to enhance our understanding of relevant sound transmission phenomena. Sound transmission in an airway mimicking phantom was investigated using a mechanical model with a branching airway network embedded in a compliant viscoelastic medium. The Horsfield self-consistent model for the bronchial tree was adopted to topologically couple the individual airway segments into the branching airway network. The acoustics of the bifurcating airway segments were measured by microphones and calculated analytically. Airway phantom surface motion was measured using scanning laser Doppler vibrometry. Finite element simulations of sound transmission in the airway phantom were performed. Good agreement was achieved between experiments and simulations. The validated computational approach can provide insight into sound transmission simulations in real lungs. PMID:26097256

Experimental and computational studies of sound transmission in a branching airway network embedded in a compliant viscoelastic medium

NASA Astrophysics Data System (ADS)

Dai, Zoujun; Peng, Ying; Mansy, Hansen A.; Sandler, Richard H.; Royston, Thomas J.

2015-03-01

Breath sounds are often used to aid in the diagnosis of pulmonary disease. Mechanical and numerical models could be used to enhance our understanding of relevant sound transmission phenomena. Sound transmission in an airway mimicking phantom was investigated using a mechanical model with a branching airway network embedded in a compliant viscoelastic medium. The Horsfield self-consistent model for the bronchial tree was adopted to topologically couple the individual airway segments into the branching airway network. The acoustics of the bifurcating airway segments were measured by microphones and calculated analytically. Airway phantom surface motion was measured using scanning laser Doppler vibrometry. Finite element simulations of sound transmission in the airway phantom were performed. Good agreement was achieved between experiments and simulations. The validated computational approach can provide insight into sound transmission simulations in real lungs.

A (very) Simple Model for the Aspect Ratio of High-Order River Basins

NASA Astrophysics Data System (ADS)

Shelef, E.

2017-12-01

The structure of river networks dictates the distribution of elevation, water, and sediments across Earth's surface. Despite its intricate shape, the structure of high-order river networks displays some surprising regularities such as the consistent aspect ratio (i.e., basin's width over length) of river basins along linear mountain fronts. This ratio controls the spacing between high-order channels as well as the spacing between the depositional bodies they form. It is generally independent of tectonic and climatic conditions and is often attributed to the initial topography over which the network was formed. This study shows that a simple, cross-like channel model explains this ratio via a requirement for equal elevation gain between the outlets and drainage-divides of adjacent channels at topographic steady state. This model also explains the dependence of aspect ratio on channel concavity and the location of the widest point on a drainage divide.

Empirical modeling for intelligent, real-time manufacture control

NASA Technical Reports Server (NTRS)

Xu, Xiaoshu

1994-01-01

Artificial neural systems (ANS), also known as neural networks, are an attempt to develop computer systems that emulate the neural reasoning behavior of biological neural systems (e.g. the human brain). As such, they are loosely based on biological neural networks. The ANS consists of a series of nodes (neurons) and weighted connections (axons) that, when presented with a specific input pattern, can associate specific output patterns. It is essentially a highly complex, nonlinear, mathematical relationship or transform. These constructs have two significant properties that have proven useful to the authors in signal processing and process modeling: noise tolerance and complex pattern recognition. Specifically, the authors have developed a new network learning algorithm that has resulted in the successful application of ANS's to high speed signal processing and to developing models of highly complex processes. Two of the applications, the Weld Bead Geometry Control System and the Welding Penetration Monitoring System, are discussed in the body of this paper.

Real-tiem Adaptive Control Scheme for Superior Plasma Confinement

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

Alexander Trunov, Ph.D.

2001-06-01

During this Phase I project, IOS, in collaboration with our subcontractors at General Atomics, Inc., acquired and analyzed measurement data on various plasma equilibrium modes. We developed a Matlab-based toolbox consisting of linear and neural network approximators that are capable of learning and predicting, with accuracy, the behavior of plasma parameters. We also began development of the control algorithm capable of using the model of the plasma obtained by the neural network approximator.

Using soft computing techniques to predict corrected air permeability using Thomeer parameters, air porosity and grain density

NASA Astrophysics Data System (ADS)

Nooruddin, Hasan A.; Anifowose, Fatai; Abdulraheem, Abdulazeez

2014-03-01

Soft computing techniques are recently becoming very popular in the oil industry. A number of computational intelligence-based predictive methods have been widely applied in the industry with high prediction capabilities. Some of the popular methods include feed-forward neural networks, radial basis function network, generalized regression neural network, functional networks, support vector regression and adaptive network fuzzy inference system. A comparative study among most popular soft computing techniques is presented using a large dataset published in literature describing multimodal pore systems in the Arab D formation. The inputs to the models are air porosity, grain density, and Thomeer parameters obtained using mercury injection capillary pressure profiles. Corrected air permeability is the target variable. Applying developed permeability models in recent reservoir characterization workflow ensures consistency between micro and macro scale information represented mainly by Thomeer parameters and absolute permeability. The dataset was divided into two parts with 80% of data used for training and 20% for testing. The target permeability variable was transformed to the logarithmic scale as a pre-processing step and to show better correlations with the input variables. Statistical and graphical analysis of the results including permeability cross-plots and detailed error measures were created. In general, the comparative study showed very close results among the developed models. The feed-forward neural network permeability model showed the lowest average relative error, average absolute relative error, standard deviations of error and root means squares making it the best model for such problems. Adaptive network fuzzy inference system also showed very good results.

Video Salient Object Detection via Fully Convolutional Networks.

PubMed

Wang, Wenguan; Shen, Jianbing; Shao, Ling

This paper proposes a deep learning model to efficiently detect salient regions in videos. It addresses two important issues: 1) deep video saliency model training with the absence of sufficiently large and pixel-wise annotated video data and 2) fast video saliency training and detection. The proposed deep video saliency network consists of two modules, for capturing the spatial and temporal saliency information, respectively. The dynamic saliency model, explicitly incorporating saliency estimates from the static saliency model, directly produces spatiotemporal saliency inference without time-consuming optical flow computation. We further propose a novel data augmentation technique that simulates video training data from existing annotated image data sets, which enables our network to learn diverse saliency information and prevents overfitting with the limited number of training videos. Leveraging our synthetic video data (150K video sequences) and real videos, our deep video saliency model successfully learns both spatial and temporal saliency cues, thus producing accurate spatiotemporal saliency estimate. We advance the state-of-the-art on the densely annotated video segmentation data set (MAE of .06) and the Freiburg-Berkeley Motion Segmentation data set (MAE of .07), and do so with much improved speed (2 fps with all steps).This paper proposes a deep learning model to efficiently detect salient regions in videos. It addresses two important issues: 1) deep video saliency model training with the absence of sufficiently large and pixel-wise annotated video data and 2) fast video saliency training and detection. The proposed deep video saliency network consists of two modules, for capturing the spatial and temporal saliency information, respectively. The dynamic saliency model, explicitly incorporating saliency estimates from the static saliency model, directly produces spatiotemporal saliency inference without time-consuming optical flow computation. We further propose a novel data augmentation technique that simulates video training data from existing annotated image data sets, which enables our network to learn diverse saliency information and prevents overfitting with the limited number of training videos. Leveraging our synthetic video data (150K video sequences) and real videos, our deep video saliency model successfully learns both spatial and temporal saliency cues, thus producing accurate spatiotemporal saliency estimate. We advance the state-of-the-art on the densely annotated video segmentation data set (MAE of .06) and the Freiburg-Berkeley Motion Segmentation data set (MAE of .07), and do so with much improved speed (2 fps with all steps).

Ferromagnetic transition in a simple variant of the Ising model on multiplex networks

NASA Astrophysics Data System (ADS)

Krawiecki, A.

2018-02-01

Multiplex networks consist of a fixed set of nodes connected by several sets of edges which are generated separately and correspond to different networks ("layers"). Here, a simple variant of the Ising model on multiplex networks with two layers is considered, with spins located in the nodes and edges corresponding to ferromagnetic interactions between them. Critical temperatures for the ferromagnetic transition are evaluated for the layers in the form of random Erdös-Rényi graphs or heterogeneous scale-free networks using the mean-field approximation and the replica method, from the replica symmetric solution. Both methods require the use of different "partial" magnetizations, associated with different layers of the multiplex network, and yield qualitatively similar results. If the layers are strongly heterogeneous the critical temperature differs noticeably from that for the Ising model on a network being a superposition of the two layers, evaluated in the mean-field approximation neglecting the effect of the underlying multiplex structure on the correlations between the degrees of nodes. The critical temperature evaluated from the replica symmetric solution depends sensitively on the correlations between the degrees of nodes in different layers and shows satisfactory quantitative agreement with that obtained from Monte Carlo simulations. The critical behavior of the magnetization for the model with strongly heterogeneous layers can depend on the distributions of the degrees of nodes and is then determined by the properties of the most heterogeneous layer.

Methods for network meta-analysis of continuous outcomes using individual patient data: a case study in acupuncture for chronic pain.

PubMed

Saramago, Pedro; Woods, Beth; Weatherly, Helen; Manca, Andrea; Sculpher, Mark; Khan, Kamran; Vickers, Andrew J; MacPherson, Hugh

2016-10-06

Network meta-analysis methods, which are an extension of the standard pair-wise synthesis framework, allow for the simultaneous comparison of multiple interventions and consideration of the entire body of evidence in a single statistical model. There are well-established advantages to using individual patient data to perform network meta-analysis and methods for network meta-analysis of individual patient data have already been developed for dichotomous and time-to-event data. This paper describes appropriate methods for the network meta-analysis of individual patient data on continuous outcomes. This paper introduces and describes network meta-analysis of individual patient data models for continuous outcomes using the analysis of covariance framework. Comparisons are made between this approach and change score and final score only approaches, which are frequently used and have been proposed in the methodological literature. A motivating example on the effectiveness of acupuncture for chronic pain is used to demonstrate the methods. Individual patient data on 28 randomised controlled trials were synthesised. Consistency of endpoints across the evidence base was obtained through standardisation and mapping exercises. Individual patient data availability avoided the use of non-baseline-adjusted models, allowing instead for analysis of covariance models to be applied and thus improving the precision of treatment effect estimates while adjusting for baseline imbalance. The network meta-analysis of individual patient data using the analysis of covariance approach is advocated to be the most appropriate modelling approach for network meta-analysis of continuous outcomes, particularly in the presence of baseline imbalance. Further methods developments are required to address the challenge of analysing aggregate level data in the presence of baseline imbalance.

An egalitarian network model for the emergence of simple and complex cells in visual cortex

PubMed Central

Tao, Louis; Shelley, Michael; McLaughlin, David; Shapley, Robert

2004-01-01

We explain how simple and complex cells arise in a large-scale neuronal network model of the primary visual cortex of the macaque. Our model consists of ≈4,000 integrate-and-fire, conductance-based point neurons, representing the cells in a small, 1-mm2 patch of an input layer of the primary visual cortex. In the model the local connections are isotropic and nonspecific, and convergent input from the lateral geniculate nucleus confers cortical cells with orientation and spatial phase preference. The balance between lateral connections and lateral geniculate nucleus drive determines whether individual neurons in this recurrent circuit are simple or complex. The model reproduces qualitatively the experimentally observed distributions of both extracellular and intracellular measures of simple and complex response. PMID:14695891

Telecom Modeling with ChatterBell.

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

Jrad, Ahmad M.; Kelic, Andjelka

This document provides a description and user manual for the ChatterBell voice telecom modeling and simulation capability. The intended audience consists of network planners and practitioners who wish to use the tool to model a particular voice network and analyze its behavior under varying assumptions and possible failure conditions. ChatterBell is built on top of the N-SMART voice simulation and visualization suite that was developed through collaboration between Sandia National Laboratories and Bell Laboratories of Lucent Technologies. The new and improved modeling and simulation tool has been modified and modernized to incorporate the latest development in the telecom world includingmore » the widespread use of VoIP technology. In addition, ChatterBell provides new commands and modeling capabilities that were not available in the N-SMART application.« less

A kinetic Monte Carlo approach to study fluid transport in pore networks

NASA Astrophysics Data System (ADS)

Apostolopoulou, M.; Day, R.; Hull, R.; Stamatakis, M.; Striolo, A.

2017-10-01

The mechanism of fluid migration in porous networks continues to attract great interest. Darcy's law (phenomenological continuum theory), which is often used to describe macroscopically fluid flow through a porous material, is thought to fail in nano-channels. Transport through heterogeneous and anisotropic systems, characterized by a broad distribution of pores, occurs via a contribution of different transport mechanisms, all of which need to be accounted for. The situation is likely more complicated when immiscible fluid mixtures are present. To generalize the study of fluid transport through a porous network, we developed a stochastic kinetic Monte Carlo (KMC) model. In our lattice model, the pore network is represented as a set of connected finite volumes (voxels), and transport is simulated as a random walk of molecules, which "hop" from voxel to voxel. We simulated fluid transport along an effectively 1D pore and we compared the results to those expected by solving analytically the diffusion equation. The KMC model was then implemented to quantify the transport of methane through hydrated micropores, in which case atomistic molecular dynamic simulation results were reproduced. The model was then used to study flow through pore networks, where it was able to quantify the effect of the pore length and the effect of the network's connectivity. The results are consistent with experiments but also provide additional physical insights. Extension of the model will be useful to better understand fluid transport in shale rocks.

Off-lexicon online Arabic handwriting recognition using neural network

NASA Astrophysics Data System (ADS)

Yahia, Hamdi; Chaabouni, Aymen; Boubaker, Houcine; Alimi, Adel M.

2017-03-01

This paper highlights a new method for online Arabic handwriting recognition based on graphemes segmentation. The main contribution of our work is to explore the utility of Beta-elliptic model in segmentation and features extraction for online handwriting recognition. Indeed, our method consists in decomposing the input signal into continuous part called graphemes based on Beta-Elliptical model, and classify them according to their position in the pseudo-word. The segmented graphemes are then described by the combination of geometric features and trajectory shape modeling. The efficiency of the considered features has been evaluated using feed forward neural network classifier. Experimental results using the benchmarking ADAB Database show the performance of the proposed method.

Concept Model on Topological Learning

NASA Astrophysics Data System (ADS)

Ae, Tadashi; Kioi, Kazumasa

2010-11-01

We discuss a new model for concept based on topological learning, where the learning process on the neural network is represented by mathematical topology. The topological learning of neural networks is summarized by a quotient of input space and the hierarchical step induces a tree where each node corresponds to a quotient. In general, the concept acquisition is a difficult problem, but the emotion for a subject is represented by providing the questions to a person. Therefore, a kind of concept is captured by such data and the answer sheet can be mapped into a topology consisting of trees. In this paper, we will discuss a way of mapping the emotional concept to a topological learning model.

Two classes of ODE models with switch-like behavior

PubMed Central

Just, Winfried; Korb, Mason; Elbert, Ben; Young, Todd

2013-01-01

In cases where the same real-world system can be modeled both by an ODE system ⅅ and a Boolean system 𝔹, it is of interest to identify conditions under which the two systems will be consistent, that is, will make qualitatively equivalent predictions. In this note we introduce two broad classes of relatively simple models that provide a convenient framework for studying such questions. In contrast to the widely known class of Glass networks, the right-hand sides of our ODEs are Lipschitz-continuous. We prove that if 𝔹 has certain structures, consistency between ⅅ and 𝔹 is implied by sufficient separation of time scales in one class of our models. Namely, if the trajectories of 𝔹 are “one-stepping” then we prove a strong form of consistency and if 𝔹 has a certain monotonicity property then there is a weaker consistency between ⅅ and 𝔹. These results appear to point to more general structure properties that favor consistency between ODE and Boolean models. PMID:24244061

A scoping review of indirect comparison methods and applications using individual patient data.

PubMed

Veroniki, Areti Angeliki; Straus, Sharon E; Soobiah, Charlene; Elliott, Meghan J; Tricco, Andrea C

2016-04-27

Several indirect comparison methods, including network meta-analyses (NMAs), using individual patient data (IPD) have been developed to synthesize evidence from a network of trials. Although IPD indirect comparisons are published with increasing frequency in health care literature, there is no guidance on selecting the appropriate methodology and on reporting the methods and results. In this paper we examine the methods and reporting of indirect comparison methods using IPD. We searched MEDLINE, Embase, the Cochrane Library, and CINAHL from inception until October 2014. We included published and unpublished studies reporting a method, application, or review of indirect comparisons using IPD and at least three interventions. We identified 37 papers, including a total of 33 empirical networks. Of these, only 9 (27 %) IPD-NMAs reported the existence of a study protocol, whereas 3 (9 %) studies mentioned that protocols existed without providing a reference. The 33 empirical networks included 24 (73 %) IPD-NMAs and 9 (27 %) matching adjusted indirect comparisons (MAICs). Of the 21 (64 %) networks with at least one closed loop, 19 (90 %) were IPD-NMAs, 13 (68 %) of which evaluated the prerequisite consistency assumption, and only 5 (38 %) of the 13 IPD-NMAs used statistical approaches. The median number of trials included per network was 10 (IQR 4-19) (IPD-NMA: 15 [IQR 8-20]; MAIC: 2 [IQR 3-5]), and the median number of IPD trials included in a network was 3 (IQR 1-9) (IPD-NMA: 6 [IQR 2-11]; MAIC: 2 [IQR 1-2]). Half of the networks (17; 52 %) applied Bayesian hierarchical models (14 one-stage, 1 two-stage, 1 used IPD as an informative prior, 1 unclear-stage), including either IPD alone or with aggregated data (AD). Models for dichotomous and continuous outcomes were available (IPD alone or combined with AD), as were models for time-to-event data (IPD combined with AD). One in three indirect comparison methods modeling IPD adjusted results from different trials to estimate effects as if they had come from the same, randomized, population. Key methodological and reporting elements (e.g., evaluation of consistency, existence of study protocol) were often missing from an indirect comparison paper.

Cognitive components of a mathematical processing network in 9-year-old children.

PubMed

Szűcs, Dénes; Devine, Amy; Soltesz, Fruzsina; Nobes, Alison; Gabriel, Florence

2014-07-01

We determined how various cognitive abilities, including several measures of a proposed domain-specific number sense, relate to mathematical competence in nearly 100 9-year-old children with normal reading skill. Results are consistent with an extended number processing network and suggest that important processing nodes of this network are phonological processing, verbal knowledge, visuo-spatial short-term and working memory, spatial ability and general executive functioning. The model was highly specific to predicting arithmetic performance. There were no strong relations between mathematical achievement and verbal short-term and working memory, sustained attention, response inhibition, finger knowledge and symbolic number comparison performance. Non-verbal intelligence measures were also non-significant predictors when added to our model. Number sense variables were non-significant predictors in the model and they were also non-significant predictors when entered into regression analysis with only a single visuo-spatial WM measure. Number sense variables were predicted by sustained attention. Results support a network theory of mathematical competence in primary school children and falsify the importance of a proposed modular 'number sense'. We suggest an 'executive memory function centric' model of mathematical processing. Mapping a complex processing network requires that studies consider the complex predictor space of mathematics rather than just focusing on a single or a few explanatory factors.

Cognitive components of a mathematical processing network in 9-year-old children

PubMed Central

Szűcs, Dénes; Devine, Amy; Soltesz, Fruzsina; Nobes, Alison; Gabriel, Florence

2014-01-01

We determined how various cognitive abilities, including several measures of a proposed domain-specific number sense, relate to mathematical competence in nearly 100 9-year-old children with normal reading skill. Results are consistent with an extended number processing network and suggest that important processing nodes of this network are phonological processing, verbal knowledge, visuo-spatial short-term and working memory, spatial ability and general executive functioning. The model was highly specific to predicting arithmetic performance. There were no strong relations between mathematical achievement and verbal short-term and working memory, sustained attention, response inhibition, finger knowledge and symbolic number comparison performance. Non-verbal intelligence measures were also non-significant predictors when added to our model. Number sense variables were non-significant predictors in the model and they were also non-significant predictors when entered into regression analysis with only a single visuo-spatial WM measure. Number sense variables were predicted by sustained attention. Results support a network theory of mathematical competence in primary school children and falsify the importance of a proposed modular ‘number sense’. We suggest an ‘executive memory function centric’ model of mathematical processing. Mapping a complex processing network requires that studies consider the complex predictor space of mathematics rather than just focusing on a single or a few explanatory factors. PMID:25089322

Modeling shifts in the rate and pattern of subthalamopallidal network activity during deep brain stimulation.

PubMed

Hahn, Philip J; McIntyre, Cameron C

2010-06-01

Deep brain stimulation (DBS) of the subthlamic nucleus (STN) represents an effective treatment for medically refractory Parkinson's disease; however, understanding of its effects on basal ganglia network activity remains limited. We constructed a computational model of the subthalamopallidal network, trained it to fit in vivo recordings from parkinsonian monkeys, and evaluated its response to STN DBS. The network model was created with synaptically connected single compartment biophysical models of STN and pallidal neurons, and stochastically defined inputs driven by cortical beta rhythms. A least mean square error training algorithm was developed to parameterize network connections and minimize error when compared to experimental spike and burst rates in the parkinsonian condition. The output of the trained network was then compared to experimental data not used in the training process. We found that reducing the influence of the cortical beta input on the model generated activity that agreed well with recordings from normal monkeys. Further, during STN DBS in the parkinsonian condition the simulations reproduced the reduction in GPi bursting found in existing experimental data. The model also provided the opportunity to greatly expand analysis of GPi bursting activity, generating three major predictions. First, its reduction was proportional to the volume of STN activated by DBS. Second, GPi bursting decreased in a stimulation frequency dependent manner, saturating at values consistent with clinically therapeutic DBS. And third, ablating STN neurons, reported to generate similar therapeutic outcomes as STN DBS, also reduced GPi bursting. Our theoretical analysis of stimulation induced network activity suggests that regularization of GPi firing is dependent on the volume of STN tissue activated and a threshold level of burst reduction may be necessary for therapeutic effect.

Self-organizing neural network models for visual pattern recognition.

PubMed

Fukushima, K

1987-01-01

Two neural network models for visual pattern recognition are discussed. The first model, called a "neocognitron", is a hierarchical multilayered network which has only afferent synaptic connections. It can acquire the ability to recognize patterns by "learning-without-a-teacher": the repeated presentation of a set of training patterns is sufficient, and no information about the categories of the patterns is necessary. The cells of the highest stage eventually become "gnostic cells", whose response shows the final result of the pattern-recognition of the network. Pattern recognition is performed on the basis of similarity in shape between patterns, and is not affected by deformation, nor by changes in size, nor by shifts in the position of the stimulus pattern. The second model has not only afferent but also efferent synaptic connections, and is endowed with the function of selective attention. The afferent and the efferent signals interact with each other in the hierarchical network: the efferent signals, that is, the signals for selective attention, have a facilitating effect on the afferent signals, and at the same time, the afferent signals gate efferent signal flow. When a complex figure, consisting of two patterns or more, is presented to the model, it is segmented into individual patterns, and each pattern is recognized separately. Even if one of the patterns to which the models is paying selective attention is affected by noise or defects, the model can "recall" the complete pattern from which the noise has been eliminated and the defects corrected.

Criticism of generally accepted fundamentals and methodologies of traffic and transportation theory

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

Kerner, Boris S.

It is explained why the set of the fundamental empirical features of traffic breakdown (a transition from free flow to congested traffic) should be the empirical basis for any traffic and transportation theory that can be reliable used for control and optimization in traffic networks. It is shown that generally accepted fundamentals and methodologies of traffic and transportation theory are not consistent with the set of the fundamental empirical features of traffic breakdown at a highway bottleneck. To these fundamentals and methodologies of traffic and transportation theory belong (i) Lighthill-Whitham-Richards (LWR) theory, (ii) the General Motors (GM) model class (formore » example, Herman, Gazis et al. GM model, Gipps’s model, Payne’s model, Newell’s optimal velocity (OV) model, Wiedemann’s model, Bando et al. OV model, Treiber’s IDM, Krauß’s model), (iii) the understanding of highway capacity as a particular stochastic value, and (iv) principles for traffic and transportation network optimization and control (for example, Wardrop’s user equilibrium (UE) and system optimum (SO) principles). Alternatively to these generally accepted fundamentals and methodologies of traffic and transportation theory, we discuss three-phase traffic theory as the basis for traffic flow modeling as well as briefly consider the network breakdown minimization (BM) principle for the optimization of traffic and transportation networks with road bottlenecks.« less

Rainfall, streamflow, and peak stage data collected at the Murfreesboro, Tennessee, gaging network, March 1989 through July 1992

USGS Publications Warehouse

Outlaw, G.S.; Butner, D.E.; Kemp, R.L.; Oaks, A.T.; Adams, G.S.

1992-01-01

Rainfall, stage, and streamflow data in the Murfreesboro area, Middle Tennessee, were collected from March 1989 through July 1992 from a network of 68 gaging stations. The network consists of 10 tipping-bucket rain gages, 2 continuous-record streamflow gages, 4 partial-record flood hydrograph gages, and 72 crest-stage gages. Data collected by the gages includes 5minute time-step rainfall hyetographs, 15-minute time-step flood hydrographs, and peak-stage elevations. Data are stored in a computer data base and are available for many computer modeling and engineering applications.

The framework for simulation of bioinspired security mechanisms against network infrastructure attacks.

PubMed

Shorov, Andrey; Kotenko, Igor

2014-01-01

The paper outlines a bioinspired approach named "network nervous system" and methods of simulation of infrastructure attacks and protection mechanisms based on this approach. The protection mechanisms based on this approach consist of distributed procedures of information collection and processing, which coordinate the activities of the main devices of a computer network, identify attacks, and determine necessary countermeasures. Attacks and protection mechanisms are specified as structural models using a set-theoretic approach. An environment for simulation of protection mechanisms based on the biological metaphor is considered; the experiments demonstrating the effectiveness of the protection mechanisms are described.

Development of a system dynamics model for financially sustainable management of municipal watermain networks.

PubMed

Rehan, R; Knight, M A; Unger, A J A; Haas, C T

2013-12-15

This paper develops causal loop diagrams and a system dynamics model for financially sustainable management of urban water distribution networks. The developed causal loop diagrams are a novel contribution in that it illustrates the unique characteristics and feedback loops for financially self-sustaining water distribution networks. The system dynamics model is a mathematical realization of the developed interactions among system variables over time and is comprised of three sectors namely watermains network, consumer, and finance. This is the first known development of a water distribution network system dynamics model. The watermains network sector accounts for the unique characteristics of watermain pipes such as service life, deterioration progression, pipe breaks, and water leakage. The finance sector allows for cash reserving by the utility in addition to the pay-as-you-go and borrowing strategies. The consumer sector includes controls to model water fee growth as a function of service performance and a household's financial burden due to water fees. A series of policy levers are provided that allow the impact of various financing strategies to be evaluated in terms of financial sustainability and household affordability. The model also allows for examination of the impact of different management strategies on the water fee in terms of consistency and stability over time. The paper concludes with a discussion on how the developed system dynamics water model can be used by water utilities to achieve a variety of utility short and long-term objectives and to establish realistic and defensible water utility policies. It also discusses how the model can be used by regulatory bodies, government agencies, the financial industry, and researchers. Crown Copyright © 2013. Published by Elsevier Ltd. All rights reserved.

Artificial Neural Network L* from different magnetospheric field models

NASA Astrophysics Data System (ADS)

Yu, Y.; Koller, J.; Zaharia, S. G.; Jordanova, V. K.

2011-12-01

The third adiabatic invariant L* plays an important role in modeling and understanding the radiation belt dynamics. The popular way to numerically obtain the L* value follows the recipe described by Roederer [1970], which is, however, slow and computational expensive. This work focuses on a new technique, which can compute the L* value in microseconds without losing much accuracy: artificial neural networks. Since L* is related to the magnetic flux enclosed by a particle drift shell, global magnetic field information needed to trace the drift shell is required. A series of currently popular empirical magnetic field models are applied to create the L* data pool using 1 million data samples which are randomly selected within a solar cycle and within the global magnetosphere. The networks, trained from the above L* data pool, can thereby be used for fairly efficient L* calculation given input parameters valid within the trained temporal and spatial range. Besides the empirical magnetospheric models, a physics-based self-consistent inner magnetosphere model (RAM-SCB) developed at LANL is also utilized to calculate L* values and then to train the L* neural network. This model better predicts the magnetospheric configuration and therefore can significantly improve the L*. The above neural network L* technique will enable, for the first time, comprehensive solar-cycle long studies of radiation belt processes. However, neural networks trained from different magnetic field models can result in different L* values, which could cause mis-interpretation of radiation belt dynamics, such as where the source of the radiation belt charged particle is and which mechanism is dominant in accelerating the particles. Such a fact calls for attention to cautiously choose a magnetospheric field model for the L* calculation.

Characterizing and modeling the dynamics of activity and popularity.

PubMed

Zhang, Peng; Li, Menghui; Gao, Liang; Fan, Ying; Di, Zengru

2014-01-01

Social media, regarded as two-layer networks consisting of users and items, turn out to be the most important channels for access to massive information in the era of Web 2.0. The dynamics of human activity and item popularity is a crucial issue in social media networks. In this paper, by analyzing the growth of user activity and item popularity in four empirical social media networks, i.e., Amazon, Flickr, Delicious and Wikipedia, it is found that cross links between users and items are more likely to be created by active users and to be acquired by popular items, where user activity and item popularity are measured by the number of cross links associated with users and items. This indicates that users generally trace popular items, overall. However, it is found that the inactive users more severely trace popular items than the active users. Inspired by empirical analysis, we propose an evolving model for such networks, in which the evolution is driven only by two-step random walk. Numerical experiments verified that the model can qualitatively reproduce the distributions of user activity and item popularity observed in empirical networks. These results might shed light on the understandings of micro dynamics of activity and popularity in social media networks.

Characterizing and Modeling the Dynamics of Activity and Popularity

PubMed Central

Zhang, Peng; Li, Menghui; Gao, Liang; Fan, Ying; Di, Zengru

2014-01-01

Social media, regarded as two-layer networks consisting of users and items, turn out to be the most important channels for access to massive information in the era of Web 2.0. The dynamics of human activity and item popularity is a crucial issue in social media networks. In this paper, by analyzing the growth of user activity and item popularity in four empirical social media networks, i.e., Amazon, Flickr, Delicious and Wikipedia, it is found that cross links between users and items are more likely to be created by active users and to be acquired by popular items, where user activity and item popularity are measured by the number of cross links associated with users and items. This indicates that users generally trace popular items, overall. However, it is found that the inactive users more severely trace popular items than the active users. Inspired by empirical analysis, we propose an evolving model for such networks, in which the evolution is driven only by two-step random walk. Numerical experiments verified that the model can qualitatively reproduce the distributions of user activity and item popularity observed in empirical networks. These results might shed light on the understandings of micro dynamics of activity and popularity in social media networks. PMID:24586586

Oscillations and chaos in neural networks: an exactly solvable model.

PubMed Central

Wang, L P; Pichler, E E; Ross, J

1990-01-01

We consider a randomly diluted higher-order network with noise, consisting of McCulloch-Pitts neurons that interact by Hebbian-type connections. For this model, exact dynamical equations are derived and solved for both parallel and random sequential updating algorithms. For parallel dynamics, we find a rich spectrum of different behaviors including static retrieving and oscillatory and chaotic phenomena in different parts of the parameter space. The bifurcation parameters include first- and second-order neuronal interaction coefficients and a rescaled noise level, which represents the combined effects of the random synaptic dilution, interference between stored patterns, and additional background noise. We show that a marked difference in terms of the occurrence of oscillations or chaos exists between neural networks with parallel and random sequential dynamics. Images PMID:2251287

Monitoring of the orbital position of geostationary satellite by spatially separated reception of signals of digital satellite television

NASA Astrophysics Data System (ADS)

Kaliuzhnyi, M. P.; Bushuev, F. I.; Sibiriakova, Ye. S.; Shulga, O. V.; Shakun, L. S.; Bezrukovs, V.; Kulishenko, V. F.; Moskalenko, S. S.; Malynovsky, Ye. V.; Balagura, O. A.

2017-02-01

The results of the determination of the geostationary satellite "Eutelsat-13B" orbital position obtained during 2015-2016 years using European stations' network for reception of DVB-S signals from the satellite are presented. The network consists of five stations located in Ukraine and Latvia. The stations are equipped with a radio engineering complex developed by the RI "MAO". The measured parameter is a time difference of arrival (TDOA) of the DVB-S signals to the stations of the network. The errors of TDOA determination and satellite coordinates, obtained using a numerical model of satellite motion, are equal ±2.6 m and ±35 m respectively. Software implementation of the numerical model is taken from the free space dynamics library OREKIT.

Modeling of synchronization behavior of bursting neurons at nonlinearly coupled dynamical networks.

PubMed

Çakir, Yüksel

2016-01-01

Synchronization behaviors of bursting neurons coupled through electrical and dynamic chemical synapses are investigated. The Izhikevich model is used with random and small world network of bursting neurons. Various currents which consist of diffusive electrical and time-delayed dynamic chemical synapses are used in the simulations to investigate the influences of synaptic currents and couplings on synchronization behavior of bursting neurons. The effects of parameters, such as time delay, inhibitory synaptic strengths, and decay time on synchronization behavior are investigated. It is observed that in random networks with no delay, bursting synchrony is established with the electrical synapse alone, single spiking synchrony is observed with hybrid coupling. In small world network with no delay, periodic bursting behavior with multiple spikes is observed when only chemical and only electrical synapse exist. Single-spike and multiple-spike bursting are established with hybrid couplings. A decrease in the synchronization measure is observed with zero time delay, as the decay time is increased in random network. For synaptic delays which are above active phase period, synchronization measure increases with an increase in synaptic strength and time delay in small world network. However, in random network, it increases with only an increase in synaptic strength.

Scaling Properties of Dimensionality Reduction for Neural Populations and Network Models

PubMed Central

Cowley, Benjamin R.; Doiron, Brent; Kohn, Adam

2016-01-01

Recent studies have applied dimensionality reduction methods to understand how the multi-dimensional structure of neural population activity gives rise to brain function. It is unclear, however, how the results obtained from dimensionality reduction generalize to recordings with larger numbers of neurons and trials or how these results relate to the underlying network structure. We address these questions by applying factor analysis to recordings in the visual cortex of non-human primates and to spiking network models that self-generate irregular activity through a balance of excitation and inhibition. We compared the scaling trends of two key outputs of dimensionality reduction—shared dimensionality and percent shared variance—with neuron and trial count. We found that the scaling properties of networks with non-clustered and clustered connectivity differed, and that the in vivo recordings were more consistent with the clustered network. Furthermore, recordings from tens of neurons were sufficient to identify the dominant modes of shared variability that generalize to larger portions of the network. These findings can help guide the interpretation of dimensionality reduction outputs in regimes of limited neuron and trial sampling and help relate these outputs to the underlying network structure. PMID:27926936

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

PubMed

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

2015-12-01

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

Ontology based standardization of Petri net modeling for signaling pathways.

PubMed

Takai-Igarashi, Takako

2005-01-01

Taking account of the great availability of Petri nets in modeling and analyzing large complicated signaling networks, semantics of Petri nets is in need of systematization for the purpose of consistency and reusability of the models. This paper reports on standardization of units of Petri nets on the basis of an ontology that gives an intrinsic definition to the process of signaling in signaling pathways.

Ontology based standardization of petri net modeling for signaling pathways.

PubMed

Takai-Igarashi, Takako

2011-01-01

Taking account of the great availability of Petri nets in modeling and analyzing large complicated signaling networks, semantics of Petri nets is in need of systematization for the purpose of consistency and reusability of the models. This paper reports on standardization of units of Petri nets on the basis of an ontology that gives an intrinsic definition to the process of signaling in signaling pathways.

Topology Counts: Force Distributions in Circular Spring Networks.

PubMed

Heidemann, Knut M; Sageman-Furnas, Andrew O; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F; Wardetzky, Max

2018-02-09

Filamentous polymer networks govern the mechanical properties of many biological materials. Force distributions within these networks are typically highly inhomogeneous, and, although the importance of force distributions for structural properties is well recognized, they are far from being understood quantitatively. Using a combination of probabilistic and graph-theoretical techniques, we derive force distributions in a model system consisting of ensembles of random linear spring networks on a circle. We show that characteristic quantities, such as the mean and variance of the force supported by individual springs, can be derived explicitly in terms of only two parameters: (i) average connectivity and (ii) number of nodes. Our analysis shows that a classical mean-field approach fails to capture these characteristic quantities correctly. In contrast, we demonstrate that network topology is a crucial determinant of force distributions in an elastic spring network. Our results for 1D linear spring networks readily generalize to arbitrary dimensions.

Integration of Online Parameter Identification and Neural Network for In-Flight Adaptive Control

NASA Technical Reports Server (NTRS)

Hageman, Jacob J.; Smith, Mark S.; Stachowiak, Susan

2003-01-01

An indirect adaptive system has been constructed for robust control of an aircraft with uncertain aerodynamic characteristics. This system consists of a multilayer perceptron pre-trained neural network, online stability and control derivative identification, a dynamic cell structure online learning neural network, and a model following control system based on the stochastic optimal feedforward and feedback technique. The pre-trained neural network and model following control system have been flight-tested, but the online parameter identification and online learning neural network are new additions used for in-flight adaptation of the control system model. A description of the modification and integration of these two stand-alone software packages into the complete system in preparation for initial flight tests is presented. Open-loop results using both simulation and flight data, as well as closed-loop performance of the complete system in a nonlinear, six-degree-of-freedom, flight validated simulation, are analyzed. Results show that this online learning system, in contrast to the nonlearning system, has the ability to adapt to changes in aerodynamic characteristics in a real-time, closed-loop, piloted simulation, resulting in improved flying qualities.

Development of dynamic Bayesian models for web application test management

NASA Astrophysics Data System (ADS)

Azarnova, T. V.; Polukhin, P. V.; Bondarenko, Yu V.; Kashirina, I. L.

2018-03-01

The mathematical apparatus of dynamic Bayesian networks is an effective and technically proven tool that can be used to model complex stochastic dynamic processes. According to the results of the research, mathematical models and methods of dynamic Bayesian networks provide a high coverage of stochastic tasks associated with error testing in multiuser software products operated in a dynamically changing environment. Formalized representation of the discrete test process as a dynamic Bayesian model allows us to organize the logical connection between individual test assets for multiple time slices. This approach gives an opportunity to present testing as a discrete process with set structural components responsible for the generation of test assets. Dynamic Bayesian network-based models allow us to combine in one management area individual units and testing components with different functionalities and a direct influence on each other in the process of comprehensive testing of various groups of computer bugs. The application of the proposed models provides an opportunity to use a consistent approach to formalize test principles and procedures, methods used to treat situational error signs, and methods used to produce analytical conclusions based on test results.

Kernel spectral clustering with memory effect

NASA Astrophysics Data System (ADS)

Langone, Rocco; Alzate, Carlos; Suykens, Johan A. K.

2013-05-01

Evolving graphs describe many natural phenomena changing over time, such as social relationships, trade markets, metabolic networks etc. In this framework, performing community detection and analyzing the cluster evolution represents a critical task. Here we propose a new model for this purpose, where the smoothness of the clustering results over time can be considered as a valid prior knowledge. It is based on a constrained optimization formulation typical of Least Squares Support Vector Machines (LS-SVM), where the objective function is designed to explicitly incorporate temporal smoothness. The latter allows the model to cluster the current data well and to be consistent with the recent history. We also propose new model selection criteria in order to carefully choose the hyper-parameters of our model, which is a crucial issue to achieve good performances. We successfully test the model on four toy problems and on a real world network. We also compare our model with Evolutionary Spectral Clustering, which is a state-of-the-art algorithm for community detection of evolving networks, illustrating that the kernel spectral clustering with memory effect can achieve better or equal performances.

Percolation mechanism drives actin gels to the critically connected state

NASA Astrophysics Data System (ADS)

Lee, Chiu Fan; Pruessner, Gunnar

2016-05-01

Cell motility and tissue morphogenesis depend crucially on the dynamic remodeling of actomyosin networks. An actomyosin network consists of an actin polymer network connected by cross-linker proteins and motor protein myosins that generate internal stresses on the network. A recent discovery shows that for a range of experimental parameters, actomyosin networks contract to clusters with a power-law size distribution [J. Alvarado, Nat. Phys. 9, 591 (2013), 10.1038/nphys2715]. Here, we argue that actomyosin networks can exhibit a robust critical signature without fine-tuning because the dynamics of the system can be mapped onto a modified version of percolation with trapping (PT), which is known to show critical behavior belonging to the static percolation universality class without the need for fine-tuning of a control parameter. We further employ our PT model to generate experimentally testable predictions.

A network approach to decentralized coordination of energy production-consumption grids.

PubMed

Omodei, Elisa; Arenas, Alex

2018-01-01

Energy grids are facing a relatively new paradigm consisting in the formation of local distributed energy sources and loads that can operate in parallel independently from the main power grid (usually called microgrids). One of the main challenges in microgrid-like networks management is that of self-adapting to the production and demands in a decentralized coordinated way. Here, we propose a stylized model that allows to analytically predict the coordination of the elements in the network, depending on the network topology. Surprisingly, almost global coordination is attained when users interact locally, with a small neighborhood, instead of the obvious but more costly all-to-all coordination. We compute analytically the optimal value of coordinated users in random homogeneous networks. The methodology proposed opens a new way of confronting the analysis of energy demand-side management in networked systems.

SmallTool - a toolkit for realizing shared virtual environments on the Internet

NASA Astrophysics Data System (ADS)

Broll, Wolfgang

1998-09-01

With increasing graphics capabilities of computers and higher network communication speed, networked virtual environments have become available to a large number of people. While the virtual reality modelling language (VRML) provides users with the ability to exchange 3D data, there is still a lack of appropriate support to realize large-scale multi-user applications on the Internet. In this paper we will present SmallTool, a toolkit to support shared virtual environments on the Internet. The toolkit consists of a VRML-based parsing and rendering library, a device library, and a network library. This paper will focus on the networking architecture, provided by the network library - the distributed worlds transfer and communication protocol (DWTP). DWTP provides an application-independent network architecture to support large-scale multi-user environments on the Internet.

The Ising Decision Maker: a binary stochastic network for choice response time.

PubMed

Verdonck, Stijn; Tuerlinckx, Francis

2014-07-01

The Ising Decision Maker (IDM) is a new formal model for speeded two-choice decision making derived from the stochastic Hopfield network or dynamic Ising model. On a microscopic level, it consists of 2 pools of binary stochastic neurons with pairwise interactions. Inside each pool, neurons excite each other, whereas between pools, neurons inhibit each other. The perceptual input is represented by an external excitatory field. Using methods from statistical mechanics, the high-dimensional network of neurons (microscopic level) is reduced to a two-dimensional stochastic process, describing the evolution of the mean neural activity per pool (macroscopic level). The IDM can be seen as an abstract, analytically tractable multiple attractor network model of information accumulation. In this article, the properties of the IDM are studied, the relations to existing models are discussed, and it is shown that the most important basic aspects of two-choice response time data can be reproduced. In addition, the IDM is shown to predict a variety of observed psychophysical relations such as Piéron's law, the van der Molen-Keuss effect, and Weber's law. Using Bayesian methods, the model is fitted to both simulated and real data, and its performance is compared to the Ratcliff diffusion model. (c) 2014 APA, all rights reserved.

Traffic protection in MPLS networks using an off-line flow optimization model

NASA Astrophysics Data System (ADS)

Krzesinski, Anthony E.; Muller, Karen E.

2002-07-01

MPLS-based recovery is intended to effect rapid and complete restoration of traffic affected by a fault in an MPLS network. Two MPLS-based recovery models have been proposed: IP re-routing which establishes recovery paths on demand, and protection switching which works with pre-established recovery paths. IP re-routing is robust and frugal since no resources are pre-committed but is inherently slower than protection switching which is intended to offer high reliability to premium services where fault recovery takes place at the 100 ms time scale. We present a model of protection switching in MPLS networks. A variant of the flow deviation method is used to find and capacitate a set of optimal label switched paths. The traffic is routed over a set of working LSPs. Global repair is implemented by reserving a set of pre-established recovery LSPs. An analytic model is used to evaluate the MPLS-based recovery mechanisms in response to bi-directional link failures. A simulation model is used to evaluate the MPLS recovery cycle in terms of the time needed to restore the traffic after a uni-directional link failure. The models are applied to evaluate the effectiveness of protection switching in networks consisting of between 20 and 100 nodes.

A biophysical model of dynamic balancing of excitation and inhibition in fast oscillatory large-scale networks

PubMed Central

Sotiropoulos, Stamatios N.; Brookes, Matthew J.; Woolrich, Mark W.

2018-01-01

Over long timescales, neuronal dynamics can be robust to quite large perturbations, such as changes in white matter connectivity and grey matter structure through processes including learning, aging, development and certain disease processes. One possible explanation is that robust dynamics are facilitated by homeostatic mechanisms that can dynamically rebalance brain networks. In this study, we simulate a cortical brain network using the Wilson-Cowan neural mass model with conduction delays and noise, and use inhibitory synaptic plasticity (ISP) to dynamically achieve a spatially local balance between excitation and inhibition. Using MEG data from 55 subjects we find that ISP enables us to simultaneously achieve high correlation with multiple measures of functional connectivity, including amplitude envelope correlation and phase locking. Further, we find that ISP successfully achieves local E/I balance, and can consistently predict the functional connectivity computed from real MEG data, for a much wider range of model parameters than is possible with a model without ISP. PMID:29474352

Multiscale virtual particle based elastic network model (MVP-ENM) for normal mode analysis of large-sized biomolecules.

PubMed

Xia, Kelin

2017-12-20

In this paper, a multiscale virtual particle based elastic network model (MVP-ENM) is proposed for the normal mode analysis of large-sized biomolecules. The multiscale virtual particle (MVP) model is proposed for the discretization of biomolecular density data. With this model, large-sized biomolecular structures can be coarse-grained into virtual particles such that a balance between model accuracy and computational cost can be achieved. An elastic network is constructed by assuming "connections" between virtual particles. The connection is described by a special harmonic potential function, which considers the influence from both the mass distributions and distance relations of the virtual particles. Two independent models, i.e., the multiscale virtual particle based Gaussian network model (MVP-GNM) and the multiscale virtual particle based anisotropic network model (MVP-ANM), are proposed. It has been found that in the Debye-Waller factor (B-factor) prediction, the results from our MVP-GNM with a high resolution are as good as the ones from GNM. Even with low resolutions, our MVP-GNM can still capture the global behavior of the B-factor very well with mismatches predominantly from the regions with large B-factor values. Further, it has been demonstrated that the low-frequency eigenmodes from our MVP-ANM are highly consistent with the ones from ANM even with very low resolutions and a coarse grid. Finally, the great advantage of MVP-ANM model for large-sized biomolecules has been demonstrated by using two poliovirus virus structures. The paper ends with a conclusion.

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

NASA Astrophysics Data System (ADS)

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

2010-12-01

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

Neural network modelling of thermal stratification in a solar DHW storage

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

Geczy-Vig, P.; Farkas, I.

2010-05-15

In this study an artificial neural network (ANN) model is introduced for modelling the layer temperatures in a storage tank of a solar thermal system. The model is based on the measured data of a domestic hot water system. The temperatures distribution in the storage tank divided in 8 equal parts in vertical direction were calculated every 5 min using the average 5 min data of solar radiation, ambient temperature, mass flow rate of collector loop, load and the temperature of the layers in previous time steps. The introduced ANN model consists of two parts describing the load periods andmore » the periods between the loads. The identified model gives acceptable results inside the training interval as the average deviation was 0.22 C during the training and 0.24 C during the validation. (author)« less

Integration of Spatial and Social Network Analysis in Disease Transmission Studies.

PubMed

Emch, Michael; Root, Elisabeth D; Giebultowicz, Sophia; Ali, Mohammad; Perez-Heydrich, Carolina; Yunus, Mohammad

2012-01-01

This study presents a case study of how social network and spatial analytical methods can be used simultaneously for disease transmission modeling. The paper first reviews strategies employed in previous studies and then offers the example of transmission of two bacterial diarrheal diseases in rural Bangladesh. The goal is to understand how diseases vary socially above and beyond the effects of the local neighborhood context. Patterns of cholera and shigellosis incidence are analyzed in space and within kinship-based social networks in Matlab, Bangladesh. Data include a spatially referenced longitudinal demographic database which consists of approximately 200,000 people and laboratory-confirmed cholera and shigellosis cases from 1983 to 2003. Matrices are created of kinship ties between households using a complete network design and distance matrices are also created to model spatial relationships. Moran's I statistics are calculated to measure clustering within both social and spatial matrices. Combined spatial effects-spatial disturbance models are built to simultaneously analyze spatial and social effects while controlling for local environmental context. Results indicate that cholera and shigellosis always clusters in space and only sometimes within social networks. This suggests that the local environment is most important for understanding transmission of both diseases however kinship-based social networks also influence their transmission. Simultaneous spatial and social network analysis can help us better understand disease transmission and this study has offered several strategies on how.

Integration of Spatial and Social Network Analysis in Disease Transmission Studies

PubMed Central

Root, Elisabeth D; Giebultowicz, Sophia; Ali, Mohammad; Perez-Heydrich, Carolina; Yunus, Mohammad

2013-01-01

This study presents a case study of how social network and spatial analytical methods can be used simultaneously for disease transmission modeling. The paper first reviews strategies employed in previous studies and then offers the example of transmission of two bacterial diarrheal diseases in rural Bangladesh. The goal is to understand how diseases vary socially above and beyond the effects of the local neighborhood context. Patterns of cholera and shigellosis incidence are analyzed in space and within kinship-based social networks in Matlab, Bangladesh. Data include a spatially referenced longitudinal demographic database which consists of approximately 200,000 people and laboratory-confirmed cholera and shigellosis cases from 1983 to 2003. Matrices are created of kinship ties between households using a complete network design and distance matrices are also created to model spatial relationships. Moran's I statistics are calculated to measure clustering within both social and spatial matrices. Combined spatial effects-spatial disturbance models are built to simultaneously analyze spatial and social effects while controlling for local environmental context. Results indicate that cholera and shigellosis always clusters in space and only sometimes within social networks. This suggests that the local environment is most important for understanding transmission of both diseases however kinship-based social networks also influence their transmission. Simultaneous spatial and social network analysis can help us better understand disease transmission and this study has offered several strategies on how. PMID:24163443

Cutting the wires: modularization of cellular networks for experimental design.

PubMed

Lang, Moritz; Summers, Sean; Stelling, Jörg

2014-01-07

Understanding naturally evolved cellular networks requires the consecutive identification and revision of the interactions between relevant molecular species. In this process, initially often simplified and incomplete networks are extended by integrating new reactions or whole subnetworks to increase consistency between model predictions and new measurement data. However, increased consistency with experimental data alone is not sufficient to show the existence of biomolecular interactions, because the interplay of different potential extensions might lead to overall similar dynamics. Here, we present a graph-based modularization approach to facilitate the design of experiments targeted at independently validating the existence of several potential network extensions. Our method is based on selecting the outputs to measure during an experiment, such that each potential network extension becomes virtually insulated from all others during data analysis. Each output defines a module that only depends on one hypothetical network extension, and all other outputs act as virtual inputs to achieve insulation. Given appropriate experimental time-series measurements of the outputs, our modules can be analyzed, simulated, and compared to the experimental data separately. Our approach exemplifies the close relationship between structural systems identification and modularization, an interplay that promises development of related approaches in the future. Copyright © 2014 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Scaling relationships and concavity of small valley networks on Mars

NASA Astrophysics Data System (ADS)

Penido, Julita C.; Fassett, Caleb I.; Som, Sanjoy M.

2013-01-01

Valley networks are widely interpreted as the preserved erosional record of water flowing across the martian surface. The manner in which valley morphometric properties scale with drainage area has been widely examined on Earth. Earlier studies assessing these properties on Mars have suggested that martian valleys are morphometrically distinct from those on Earth. However, these earlier measurements were generally made on large valley systems because of the limited topographic data available. In this study, we determine the scaling properties of valley networks at smaller scales than have been previously assessed, using digital elevation models from the High Resolution Stereo Camera (HRSC). We find a Hack's law exponent of 0.74, larger than on Earth, and our measurements also reveal that individual small valleys have concave up, concave down, and quasi-linear longitudinal profiles, consistent with earlier studies of dissected terrain on Mars. However, for many valleys, widths are observed to increase downstream similarly to how they scale in terrestrial channels. The similarities and differences between valley networks on Mars and Earth are consistent with the idea that valleys on Mars are comparatively immature, and precipitation was a likely mechanism for delivering water to these networks.

Signalling Network Construction for Modelling Plant Defence Response

PubMed Central

Miljkovic, Dragana; Stare, Tjaša; Mozetič, Igor; Podpečan, Vid; Petek, Marko; Witek, Kamil; Dermastia, Marina; Lavrač, Nada; Gruden, Kristina

2012-01-01

Plant defence signalling response against various pathogens, including viruses, is a complex phenomenon. In resistant interaction a plant cell perceives the pathogen signal, transduces it within the cell and performs a reprogramming of the cell metabolism leading to the pathogen replication arrest. This work focuses on signalling pathways crucial for the plant defence response, i.e., the salicylic acid, jasmonic acid and ethylene signal transduction pathways, in the Arabidopsis thaliana model plant. The initial signalling network topology was constructed manually by defining the representation formalism, encoding the information from public databases and literature, and composing a pathway diagram. The manually constructed network structure consists of 175 components and 387 reactions. In order to complement the network topology with possibly missing relations, a new approach to automated information extraction from biological literature was developed. This approach, named Bio3graph, allows for automated extraction of biological relations from the literature, resulting in a set of (component1, reaction, component2) triplets and composing a graph structure which can be visualised, compared to the manually constructed topology and examined by the experts. Using a plant defence response vocabulary of components and reaction types, Bio3graph was applied to a set of 9,586 relevant full text articles, resulting in 137 newly detected reactions between the components. Finally, the manually constructed topology and the new reactions were merged to form a network structure consisting of 175 components and 524 reactions. The resulting pathway diagram of plant defence signalling represents a valuable source for further computational modelling and interpretation of omics data. The developed Bio3graph approach, implemented as an executable language processing and graph visualisation workflow, is publically available at http://ropot.ijs.si/bio3graph/and can be utilised for modelling other biological systems, given that an adequate vocabulary is provided. PMID:23272172

By land, sea and air (and space): Verifying UK methane emissions at a range of scales by integrating multiple measurement platforms

NASA Astrophysics Data System (ADS)

Rigby, M. L.; Lunt, M. F.; Ganesan, A.

2015-12-01

The Greenhouse gAs Uk and Global Emissions (GAUGE) programme and Department of Energy and Climate Change (DECC) network aim to quantify the magnitude and uncertainty of UK greenhouse gas (GHG) emissions at a resolution and accuracy higher than has previously been possible. The on going DECC tall tower network consists of three sites, and an eastern background site in Ireland. The GAUGE project includes instruments at two additional tall tower sites, a high-density measurement network over agricultural land in eastern England, a ferry that performs near-daily transects along the east coast of the UK, and a research aircraft that has been deployed on a campaign basis. Together with data collected by the GOSAT satellite, these data represent the GAUGE/DECC GHG measurement network that is being used to quantify UK GHG fluxes. As part of the wider GAUGE modelling efforts, we have derived methane flux estimates for the UK and northwest Europe using the UK Met Office NAME atmospheric transport model and a novel hierarchical Bayesian "trans-dimensional" inversion framework. We will show that our estimated fluxes for the UK as a whole are largely consistent between individual measurement platforms, albeit with very different uncertainties. Our novel inversion approach uses the data to objectively determine the extent to which we can further refine our national estimates to the level of large urban areas, major hotspots or larger sub-national regions. In this talk, we will outline some initial findings of the GAUGE project, tackling questions such as: At what spatial scale can we effectively derive greenhouse gas fluxes with a dense, multi-platform national network? Can we resolve individual metropolitan areas or major hotspots? What is relative impact of individual stations, platforms and network configurations on flux estimates for a country of the size of the UK? How can we effectively use multi-platform observations to cross-validate flux estimates and determine likely errors in model transport?

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.

Interdependent Multi-Layer Networks: Modeling and Survivability Analysis with Applications to Space-Based Networks

PubMed Central

Castet, Jean-Francois; Saleh, Joseph H.

2013-01-01

This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs) allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats) of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also examined, and the results highlight the importance of the reliability of the wireless links between spacecraft (nodes) to enable any survivability improvements for space-based networks. PMID:23599835

Interdependent multi-layer networks: modeling and survivability analysis with applications to space-based networks.

PubMed

Castet, Jean-Francois; Saleh, Joseph H

2013-01-01

This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs) allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats) of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also examined, and the results highlight the importance of the reliability of the wireless links between spacecraft (nodes) to enable any survivability improvements for space-based networks.

Mechanical Behavior of Collagen-Fibrin Co-Gels Reflects Transition From Series to Parallel Interactions With Increasing Collagen Content

PubMed Central

Lai, Victor K.; Lake, Spencer P.; Frey, Christina R.; Tranquillo, Robert T.; Barocas, Victor H.

2012-01-01

Fibrin and collagen, biopolymers occurring naturally in the body, are biomaterials commonly-used as scaffolds for tissue engineering. How collagen and fibrin interact to confer macroscopic mechanical properties in collagen-fibrin composite systems remains poorly understood. In this study, we formulated collagen-fibrin co-gels at different collagen-tofibrin ratios to observe changes in the overall mechanical behavior and microstructure. A modeling framework of a two-network system was developed by modifying our micro-scale model, considering two forms of interaction between the networks: (a) two interpenetrating but noninteracting networks (“parallel”), and (b) a single network consisting of randomly alternating collagen and fibrin fibrils (“series”). Mechanical testing of our gels show that collagen-fibrin co-gels exhibit intermediate properties (UTS, strain at failure, tangent modulus) compared to those of pure collagen and fibrin. The comparison with model predictions show that the parallel and series model cases provide upper and lower bounds, respectively, for the experimental data, suggesting that a combination of such interactions exists between the collagen and fibrin in co-gels. A transition from the series model to the parallel model occurs with increasing collagen content, with the series model best describing predominantly fibrin co-gels, and the parallel model best describing predominantly collagen co-gels. PMID:22482659

Competitive game theoretic optimal routing in optical networks

NASA Astrophysics Data System (ADS)

Yassine, Abdulsalam; Kabranov, Ognian; Makrakis, Dimitrios

2002-09-01

Optical transport service providers need control and optimization strategies for wavelength management, network provisioning, restoration and protection, allowing them to define and deploy new services and maintain competitiveness. In this paper, we investigate a game theory based model for wavelength and flow assignment in multi wavelength optical networks, consisting of several backbone long-haul optical network transport service providers (TSPs) who are offering their services -in terms of bandwidth- to Internet service providers (ISPs). The ISPs act as brokers or agents between the TSP and end user. The agent (ISP) buys services (bandwidth) from the TSP. The TSPs compete among themselves to sell their services and maintain profitability. We present a case study, demonstrating the impact of different bandwidth broker demands on the supplier's profit and the price paid by the network broker.

A Data Driven Model for Predicting RNA-Protein Interactions based on Gradient Boosting Machine.

PubMed

Jain, Dharm Skandh; Gupte, Sanket Rajan; Aduri, Raviprasad

2018-06-22

RNA protein interactions (RPI) play a pivotal role in the regulation of various biological processes. Experimental validation of RPI has been time-consuming, paving the way for computational prediction methods. The major limiting factor of these methods has been the accuracy and confidence of the predictions, and our in-house experiments show that they fail to accurately predict RPI involving short RNA sequences such as TERRA RNA. Here, we present a data-driven model for RPI prediction using a gradient boosting classifier. Amino acids and nucleotides are classified based on the high-resolution structural data of RNA protein complexes. The minimum structural unit consisting of five residues is used as the descriptor. Comparative analysis of existing methods shows the consistently higher performance of our method irrespective of the length of RNA present in the RPI. The method has been successfully applied to map RPI networks involving both long noncoding RNA as well as TERRA RNA. The method is also shown to successfully predict RNA and protein hubs present in RPI networks of four different organisms. The robustness of this method will provide a way for predicting RPI networks of yet unknown interactions for both long noncoding RNA and microRNA.

Torsional vibration measurements on rotating shaft system using laser doppler vibrometer

NASA Astrophysics Data System (ADS)

Xiang, Ling; Yang, Shixi; Gan, Chunbiao

2012-11-01

In this work, a laser torsional vibrameter was used to measure the torsion vibration of a rotating shaft system under electrical network impact. Based on the principles of laser Doppler velocimetry, the laser torsional vibrometer (LTV) are non-contact measurement of torsional oscillation of rotating shafts, offering significant advantages over conventional techniques. Furthermore, a highly complex shafting system is analyzed by a modified Riccati torsional transfer matrix. The system is modeled as a chain consisting of an elastic spring with concentrated mass points, and the multi-segments lumped mass model is established for this shafting system. By the modified Riccati torsional transfer matrix method, an accumulated calculation is effectively eliminated to obtain the natural frequencies. The electrical network impacts can activize the torsional vibration of shaft system, and the activized torsion vibration frequencies contained the natural frequencies of shaft system. The torsional vibrations of the shaft system were measured under electrical network impacts in laser Doppler torsional vibrometer. By comparisons, the natural frequencies by measurement were consistent with the values by calculation. The results verify the instrument is robust, user friendly and can be calibrated in situ. The laser torsional vibrometer represents a significant step forward in rotating machinery diagnostics.

Mechanics of a two-fiber model with one nested fiber network, as applied to the collagen-fibrin system.

PubMed

Nedrelow, David S; Bankwala, Danesh; Hyypio, Jeffrey D; Lai, Victor K; Barocas, Victor H

2018-05-01

The mechanical behavior of collagen-fibrin (col-fib) co-gels is both scientifically interesting and clinically relevant. Collagen-fibrin networks are a staple of tissue engineering research, but the mechanical consequences of changes in co-gel composition have remained difficult to predict or even explain. We previously observed fundamental differences in failure behavior between collagen-rich and fibrin-rich co-gels, suggesting an essential change in how the two components interact as the co-gel's composition changes. In this work, we explored the hypothesis that the co-gel behavior is due to a lack of percolation by the dilute component. We generated a series of computational models based on interpenetrating fiber networks. In these models, the major network component percolated the model space but the minor component did not, instead occupying a small island embedded within the larger network. Each component was assigned properties based on a fit of single-component gel data. Island size was varied to match the relative concentrations of the two components. The model predicted that networks rich in collagen, the stiffer component, would roughly match pure-collagen gel behavior with little additional stress due to the fibrin, as seen experimentally. For fibrin-rich gels, however, the model predicted a smooth increase in the overall network strength with added collagen, as seen experimentally but not consistent with an additive parallel model. We thus conclude that incomplete percolation by the low-concentration component of a co-gel is a major determinant of its macroscopic properties, especially if the low-concentration component is the stiffer component. Models for the behavior of fibrous networks have useful applications in many different fields, including polymer science, textiles, and tissue engineering. In addition to being important structural components in soft tissues and blood clots, these protein networks can serve as scaffolds for bioartificial tissues. Thus, their mechanical behavior, especially in co-gels, is both interesting from a materials science standpoint and significant with regard to tissue engineering. Copyright © 2018 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Coarse-Grained Descriptions of Dynamics for Networks with Both Intrinsic and Structural Heterogeneities

PubMed Central

Bertalan, Tom; Wu, Yan; Laing, Carlo; Gear, C. William; Kevrekidis, Ioannis G.

2017-01-01

Finding accurate reduced descriptions for large, complex, dynamically evolving networks is a crucial enabler to their simulation, analysis, and ultimately design. Here, we propose and illustrate a systematic and powerful approach to obtaining good collective coarse-grained observables—variables successfully summarizing the detailed state of such networks. Finding such variables can naturally lead to successful reduced dynamic models for the networks. The main premise enabling our approach is the assumption that the behavior of a node in the network depends (after a short initial transient) on the node identity: a set of descriptors that quantify the node properties, whether intrinsic (e.g., parameters in the node evolution equations) or structural (imparted to the node by its connectivity in the particular network structure). The approach creates a natural link with modeling and “computational enabling technology” developed in the context of Uncertainty Quantification. In our case, however, we will not focus on ensembles of different realizations of a problem, each with parameters randomly selected from a distribution. We will instead study many coupled heterogeneous units, each characterized by randomly assigned (heterogeneous) parameter value(s). One could then coin the term Heterogeneity Quantification for this approach, which we illustrate through a model dynamic network consisting of coupled oscillators with one intrinsic heterogeneity (oscillator individual frequency) and one structural heterogeneity (oscillator degree in the undirected network). The computational implementation of the approach, its shortcomings and possible extensions are also discussed. PMID:28659781

Testing of information condensation in a model reverberating spiking neural network.

PubMed

Vidybida, Alexander

2011-06-01

Information about external world is delivered to the brain in the form of structured in time spike trains. During further processing in higher areas, information is subjected to a certain condensation process, which results in formation of abstract conceptual images of external world, apparently, represented as certain uniform spiking activity partially independent on the input spike trains details. Possible physical mechanism of condensation at the level of individual neuron was discussed recently. In a reverberating spiking neural network, due to this mechanism the dynamics should settle down to the same uniform/ periodic activity in response to a set of various inputs. Since the same periodic activity may correspond to different input spike trains, we interpret this as possible candidate for information condensation mechanism in a network. Our purpose is to test this possibility in a network model consisting of five fully connected neurons, particularly, the influence of geometric size of the network, on its ability to condense information. Dynamics of 20 spiking neural networks of different geometric sizes are modelled by means of computer simulation. Each network was propelled into reverberating dynamics by applying various initial input spike trains. We run the dynamics until it becomes periodic. The Shannon's formula is used to calculate the amount of information in any input spike train and in any periodic state found. As a result, we obtain explicit estimate of the degree of information condensation in the networks, and conclude that it depends strongly on the net's geometric size.

Encoding Time in Feedforward Trajectories of a Recurrent Neural Network Model.

PubMed

Hardy, N F; Buonomano, Dean V

2018-02-01

Brain activity evolves through time, creating trajectories of activity that underlie sensorimotor processing, behavior, and learning and memory. Therefore, understanding the temporal nature of neural dynamics is essential to understanding brain function and behavior. In vivo studies have demonstrated that sequential transient activation of neurons can encode time. However, it remains unclear whether these patterns emerge from feedforward network architectures or from recurrent networks and, furthermore, what role network structure plays in timing. We address these issues using a recurrent neural network (RNN) model with distinct populations of excitatory and inhibitory units. Consistent with experimental data, a single RNN could autonomously produce multiple functionally feedforward trajectories, thus potentially encoding multiple timed motor patterns lasting up to several seconds. Importantly, the model accounted for Weber's law, a hallmark of timing behavior. Analysis of network connectivity revealed that efficiency-a measure of network interconnectedness-decreased as the number of stored trajectories increased. Additionally, the balance of excitation (E) and inhibition (I) shifted toward excitation during each unit's activation time, generating the prediction that observed sequential activity relies on dynamic control of the E/I balance. Our results establish for the first time that the same RNN can generate multiple functionally feedforward patterns of activity as a result of dynamic shifts in the E/I balance imposed by the connectome of the RNN. We conclude that recurrent network architectures account for sequential neural activity, as well as for a fundamental signature of timing behavior: Weber's law.

Linear and Nonlinear Elasticity of Networks Made of Comb-like Polymers and Bottle-Brushes

NASA Astrophysics Data System (ADS)

Liang, H.; Dobrynin, A.; Everhart, M.; Daniel, W.; Vatankhah-Varnoosfaderani, M.; Sheiko, S.

We study mechanical properties of networks made of combs and bottle-brushes by computer simulations, theoretical calculations and experimental techniques. The networks are prepared by cross-linking backbones of combs or bottle-brushes with linear chains. This results in ``hybrid'' networks consisting of linear chains and strands of combs or bottle-brushes. In the framework of the phantom network model, the network modulus at small deformations G0 can be represented as a sum of contributions from linear chains, G0 , l, and strands of comb or bottle-brush, G0 , bb. If the length of extended backbone between crosslinks, Rmax, is much longer than the Kuhn length, bk, the modulus scales with the degree of polymerization of the side chains, nsc, and number of monomers between side chains, ng, as G0 , bb (nsc/ng + 1)-1. In the limit when bk becomes of the order of Rmax, the combs and bottle-brushes can be considered as semiflexible chains, resulting in a network modulus to be G0 , bb (nsc/ng + 1)-1(nsc2/2/ng) . In the nonlinear deformation regime, the strain-hardening behavior is described by the nonlinear network deformation model, which predicts that the true stress is a universal function of the structural modulus, G, first strain invariant, I1, and deformation ratio, β. The results of the computer simulations and predictions of the theoretical model are in a good agreement with experimental results. NSF DMR-1409710, DMR-1407645, DMR-1624569, DMR-1436201.

Dynamic pricing of network goods with boundedly rational consumers.

PubMed

Radner, Roy; Radunskaya, Ami; Sundararajan, Arun

2014-01-07

We present a model of dynamic monopoly pricing for a good that displays network effects. In contrast with the standard notion of a rational-expectations equilibrium, we model consumers as boundedly rational and unable either to pay immediate attention to each price change or to make accurate forecasts of the adoption of the network good. Our analysis shows that the seller's optimal price trajectory has the following structure: The price is low when the user base is below a target level, is high when the user base is above the target, and is set to keep the user base stationary once the target level has been attained. We show that this pricing policy is robust to a number of extensions, which include the product's user base evolving over time and consumers basing their choices on a mixture of a myopic and a "stubborn" expectation of adoption. Our results differ significantly from those that would be predicted by a model based on rational-expectations equilibrium and are more consistent with the pricing of network goods observed in practice.

Overlapping community detection based on link graph using distance dynamics

NASA Astrophysics Data System (ADS)

Chen, Lei; Zhang, Jing; Cai, Li-Jun

2018-01-01

The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

Dynamic pricing of network goods with boundedly rational consumers

PubMed Central

Radner, Roy; Radunskaya, Ami; Sundararajan, Arun

2014-01-01

We present a model of dynamic monopoly pricing for a good that displays network effects. In contrast with the standard notion of a rational-expectations equilibrium, we model consumers as boundedly rational and unable either to pay immediate attention to each price change or to make accurate forecasts of the adoption of the network good. Our analysis shows that the seller’s optimal price trajectory has the following structure: The price is low when the user base is below a target level, is high when the user base is above the target, and is set to keep the user base stationary once the target level has been attained. We show that this pricing policy is robust to a number of extensions, which include the product’s user base evolving over time and consumers basing their choices on a mixture of a myopic and a “stubborn” expectation of adoption. Our results differ significantly from those that would be predicted by a model based on rational-expectations equilibrium and are more consistent with the pricing of network goods observed in practice. PMID:24367101

Neural network modeling of drying of rice in BAU-STR dryer

NASA Astrophysics Data System (ADS)

Alam, Md. Ashraful; Saha, Chayan Kumer; Alam, Md. Monjurul; Ashraf, Md. Ali; Bala, Bilash Kanti; Harvey, Jagger

2018-05-01

The experimental performance and artificial neural network modeling of rice drying in BAU-STR dryer is presented in this paper. The dryer consists of a biomass stove as a heat source, a perforated inner bin and a perforated outer bin with annular space for grains, and a blower (1 hp) to supply heated air. The dryer capacity was 500 kg of freshly harvested rice. Twenty experimental runs were conducted to investigate the experimental performance of the dryer for drying of rice. An independent multilayer neural network approach was used to predict the performance of the BAU-STR dryer for drying of rice. Ten sets of experimental data were used for training using back propagation algorithm and another ten sets of data were used for testing the artificial neural network model. The prediction of the performance of the dryer was found to be excellent after it was adequately trained. The statistical analysis showed that the errors (MSE and RMSE) were within and acceptable range of ±5% with a coefficient of determination (R2) of 99%. The model can be used to predict the potential of the dryer for different locations, and can also be used in a predictive optimal control algorithm.

The TensorMol-0.1 model chemistry: a neural network augmented with long-range physics.

PubMed

Yao, Kun; Herr, John E; Toth, David W; Mckintyre, Ryker; Parkhill, John

2018-02-28

Traditional force fields cannot model chemical reactivity, and suffer from low generality without re-fitting. Neural network potentials promise to address these problems, offering energies and forces with near ab initio accuracy at low cost. However a data-driven approach is naturally inefficient for long-range interatomic forces that have simple physical formulas. In this manuscript we construct a hybrid model chemistry consisting of a nearsighted neural network potential with screened long-range electrostatic and van der Waals physics. This trained potential, simply dubbed "TensorMol-0.1", is offered in an open-source Python package capable of many of the simulation types commonly used to study chemistry: geometry optimizations, harmonic spectra, open or periodic molecular dynamics, Monte Carlo, and nudged elastic band calculations. We describe the robustness and speed of the package, demonstrating its millihartree accuracy and scalability to tens-of-thousands of atoms on ordinary laptops. We demonstrate the performance of the model by reproducing vibrational spectra, and simulating the molecular dynamics of a protein. Our comparisons with electronic structure theory and experimental data demonstrate that neural network molecular dynamics is poised to become an important tool for molecular simulation, lowering the resource barrier to simulating chemistry.

A Spatiotemporal Prediction Framework for Air Pollution Based on Deep RNN

NASA Astrophysics Data System (ADS)

Fan, J.; Li, Q.; Hou, J.; Feng, X.; Karimian, H.; Lin, S.

2017-10-01

Time series data in practical applications always contain missing values due to sensor malfunction, network failure, outliers etc. In order to handle missing values in time series, as well as the lack of considering temporal properties in machine learning models, we propose a spatiotemporal prediction framework based on missing value processing algorithms and deep recurrent neural network (DRNN). By using missing tag and missing interval to represent time series patterns, we implement three different missing value fixing algorithms, which are further incorporated into deep neural network that consists of LSTM (Long Short-term Memory) layers and fully connected layers. Real-world air quality and meteorological datasets (Jingjinji area, China) are used for model training and testing. Deep feed forward neural networks (DFNN) and gradient boosting decision trees (GBDT) are trained as baseline models against the proposed DRNN. Performances of three missing value fixing algorithms, as well as different machine learning models are evaluated and analysed. Experiments show that the proposed DRNN framework outperforms both DFNN and GBDT, therefore validating the capacity of the proposed framework. Our results also provides useful insights for better understanding of different strategies that handle missing values.

Agent-based spin model for financial markets on complex networks: Emergence of two-phase phenomena

NASA Astrophysics Data System (ADS)

Kim, Yup; Kim, Hong-Joo; Yook, Soon-Hyung

2008-09-01

We study a microscopic model for financial markets on complex networks, motivated by the dynamics of agents and their structure of interaction. The model consists of interacting agents (spins) with local ferromagnetic coupling and global antiferromagnetic coupling. In order to incorporate more realistic situations, we also introduce an external field which changes in time. From numerical simulations, we find that the model shows two-phase phenomena. When the local ferromagnetic interaction is balanced with the global antiferromagnetic interaction, the resulting return distribution satisfies a power law having a single peak at zero values of return, which corresponds to the market equilibrium phase. On the other hand, if local ferromagnetic interaction is dominant, then the return distribution becomes double peaked at nonzero values of return, which characterizes the out-of-equilibrium phase. On random networks, the crossover between two phases comes from the competition between two different interactions. However, on scale-free networks, not only the competition between the different interactions but also the heterogeneity of underlying topology causes the two-phase phenomena. Possible relationships between the critical phenomena of spin system and the two-phase phenomena are discussed.

An Efficient Framework Model for Optimizing Routing Performance in VANETs.

PubMed

Al-Kharasani, Nori M; Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala; Hanapi, Zurina Mohd

2018-02-15

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED).

Dynamical analysis of cellular ageing by modeling of gene regulatory network based attractor landscape.

PubMed

Chong, Ket Hing; Zhang, Xiaomeng; Zheng, Jie

2018-01-01

Ageing is a natural phenomenon that is inherently complex and remains a mystery. Conceptual model of cellular ageing landscape was proposed for computational studies of ageing. However, there is a lack of quantitative model of cellular ageing landscape. This study aims to investigate the mechanism of cellular ageing in a theoretical model using the framework of Waddington's epigenetic landscape. We construct an ageing gene regulatory network (GRN) consisting of the core cell cycle regulatory genes (including p53). A model parameter (activation rate) is used as a measure of the accumulation of DNA damage. Using the bifurcation diagrams to estimate the parameter values that lead to multi-stability, we obtained a conceptual model for capturing three distinct stable steady states (or attractors) corresponding to homeostasis, cell cycle arrest, and senescence or apoptosis. In addition, we applied a Monte Carlo computational method to quantify the potential landscape, which displays: I) one homeostasis attractor for low accumulation of DNA damage; II) two attractors for cell cycle arrest and senescence (or apoptosis) in response to high accumulation of DNA damage. Using the Waddington's epigenetic landscape framework, the process of ageing can be characterized by state transitions from landscape I to II. By in silico perturbations, we identified the potential landscape of a perturbed network (inactivation of p53), and thereby demonstrated the emergence of a cancer attractor. The simulated dynamics of the perturbed network displays a landscape with four basins of attraction: homeostasis, cell cycle arrest, senescence (or apoptosis) and cancer. Our analysis also showed that for the same perturbed network with low DNA damage, the landscape displays only the homeostasis attractor. The mechanistic model offers theoretical insights that can facilitate discovery of potential strategies for network medicine of ageing-related diseases such as cancer.

An Interaction Library for the FcεRI Signaling Network

DOE PAGES

Chylek, Lily A.; Holowka, David A.; Baird, Barbara A.; ...

2014-04-15

Antigen receptors play a central role in adaptive immune responses. Although the molecular networks associated with these receptors have been extensively studied, we currently lack a systems-level understanding of how combinations of non-covalent interactions and post-translational modifications are regulated during signaling to impact cellular decision-making. To fill this knowledge gap, it will be necessary to formalize and piece together information about individual molecular mechanisms to form large-scale computational models of signaling networks. To this end, we have developed an interaction library for signaling by the high-affinity IgE receptor, FcεRI. The library consists of executable rules for protein–protein and protein–lipid interactions.more » This library extends earlier models for FcεRI signaling and introduces new interactions that have not previously been considered in a model. Thus, this interaction library is a toolkit with which existing models can be expanded and from which new models can be built. As an example, we present models of branching pathways from the adaptor protein Lat, which influence production of the phospholipid PIP 3 at the plasma membrane and the soluble second messenger IP 3. We find that inclusion of a positive feedback loop gives rise to a bistable switch, which may ensure robust responses to stimulation above a threshold level. In addition, the library is visualized to facilitate understanding of network circuitry and identification of network motifs.« less

A Discrete Fracture Network Model with Stress-Driven Nucleation and Growth

NASA Astrophysics Data System (ADS)

Lavoine, E.; Darcel, C.; Munier, R.; Davy, P.

2017-12-01

The realism of Discrete Fracture Network (DFN) models, beyond the bulk statistical properties, relies on the spatial organization of fractures, which is not issued by purely stochastic DFN models. The realism can be improved by injecting prior information in DFN from a better knowledge of the geological fracturing processes. We first develop a model using simple kinematic rules for mimicking the growth of fractures from nucleation to arrest, in order to evaluate the consequences of the DFN structure on the network connectivity and flow properties. The model generates fracture networks with power-law scaling distributions and a percentage of T-intersections that are consistent with field observations. Nevertheless, a larger complexity relying on the spatial variability of natural fractures positions cannot be explained by the random nucleation process. We propose to introduce a stress-driven nucleation in the timewise process of this kinematic model to study the correlations between nucleation, growth and existing fracture patterns. The method uses the stress field generated by existing fractures and remote stress as an input for a Monte-Carlo sampling of nuclei centers at each time step. Networks so generated are found to have correlations over a large range of scales, with a correlation dimension that varies with time and with the function that relates the nucleation probability to stress. A sensibility analysis of input parameters has been performed in 3D to quantify the influence of fractures and remote stress field orientations.

An Interaction Library for the FcεRI Signaling Network

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

Chylek, Lily A.; Holowka, David A.; Baird, Barbara A.

Antigen receptors play a central role in adaptive immune responses. Although the molecular networks associated with these receptors have been extensively studied, we currently lack a systems-level understanding of how combinations of non-covalent interactions and post-translational modifications are regulated during signaling to impact cellular decision-making. To fill this knowledge gap, it will be necessary to formalize and piece together information about individual molecular mechanisms to form large-scale computational models of signaling networks. To this end, we have developed an interaction library for signaling by the high-affinity IgE receptor, FcεRI. The library consists of executable rules for protein–protein and protein–lipid interactions.more » This library extends earlier models for FcεRI signaling and introduces new interactions that have not previously been considered in a model. Thus, this interaction library is a toolkit with which existing models can be expanded and from which new models can be built. As an example, we present models of branching pathways from the adaptor protein Lat, which influence production of the phospholipid PIP 3 at the plasma membrane and the soluble second messenger IP 3. We find that inclusion of a positive feedback loop gives rise to a bistable switch, which may ensure robust responses to stimulation above a threshold level. In addition, the library is visualized to facilitate understanding of network circuitry and identification of network motifs.« less

A Framework for Translating a High Level Security Policy into Low Level Security Mechanisms

NASA Astrophysics Data System (ADS)

Hassan, Ahmed A.; Bahgat, Waleed M.

2010-01-01

Security policies have different components; firewall, active directory, and IDS are some examples of these components. Enforcement of network security policies to low level security mechanisms faces some essential difficulties. Consistency, verification, and maintenance are the major ones of these difficulties. One approach to overcome these difficulties is to automate the process of translation of high level security policy into low level security mechanisms. This paper introduces a framework of an automation process that translates a high level security policy into low level security mechanisms. The framework is described in terms of three phases; in the first phase all network assets are categorized according to their roles in the network security and relations between them are identified to constitute the network security model. This proposed model is based on organization based access control (OrBAC). However, the proposed model extend the OrBAC model to include not only access control policy but also some other administrative security policies like auditing policy. Besides, the proposed model enables matching of each rule of the high level security policy with the corresponding ones of the low level security policy. Through the second phase of the proposed framework, the high level security policy is mapped into the network security model. The second phase could be considered as a translation of the high level security policy into an intermediate model level. Finally, the intermediate model level is translated automatically into low level security mechanism. The paper illustrates the applicability of proposed approach through an application example.

A Combination Therapy of JO-I and Chemotherapy in Ovarian Cancer Models

DTIC Science & Technology

2013-10-01

which consists of a 3PAR storage backend and is sharing data via a highly available NetApp storage gateway and 2 high throughput commodity storage...Environment is configured as self- service Enterprise cloud and currently hosts more than 700 virtual machines. The network infrastructure consists of...technology infrastructure and information system applications designed to integrate, automate, and standardize operations. These systems fuse state of

Minimal Network Topologies for Signal Processing during Collective Cell Chemotaxis.

PubMed

Yue, Haicen; Camley, Brian A; Rappel, Wouter-Jan

2018-06-19

Cell-cell communication plays an important role in collective cell migration. However, it remains unclear how cells in a group cooperatively process external signals to determine the group's direction of motion. Although the topology of signaling pathways is vitally important in single-cell chemotaxis, the signaling topology for collective chemotaxis has not been systematically studied. Here, we combine mathematical analysis and simulations to find minimal network topologies for multicellular signal processing in collective chemotaxis. We focus on border cell cluster chemotaxis in the Drosophila egg chamber, in which responses to several experimental perturbations of the signaling network are known. Our minimal signaling network includes only four elements: a chemoattractant, the protein Rac (indicating cell activation), cell protrusion, and a hypothesized global factor responsible for cell-cell interaction. Experimental data on cell protrusion statistics allows us to systematically narrow the number of possible topologies from more than 40,000,000 to only six minimal topologies with six interactions between the four elements. This analysis does not require a specific functional form of the interactions, and only qualitative features are needed; it is thus robust to many modeling choices. Simulations of a stochastic biochemical model of border cell chemotaxis show that the qualitative selection procedure accurately determines which topologies are consistent with the experiment. We fit our model for all six proposed topologies; each produces results that are consistent with all experimentally available data. Finally, we suggest experiments to further discriminate possible pathway topologies. Copyright © 2018 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Neural Network and Response Surface Methodology for Rocket Engine Component Optimization

NASA Technical Reports Server (NTRS)

Vaidyanathan, Rajkumar; Papita, Nilay; Shyy, Wei; Tucker, P. Kevin; Griffin, Lisa W.; Haftka, Raphael; Fitz-Coy, Norman; McConnaughey, Helen (Technical Monitor)

2000-01-01

The goal of this work is to compare the performance of response surface methodology (RSM) and two types of neural networks (NN) to aid preliminary design of two rocket engine components. A data set of 45 training points and 20 test points obtained from a semi-empirical model based on three design variables is used for a shear coaxial injector element. Data for supersonic turbine design is based on six design variables, 76 training, data and 18 test data obtained from simplified aerodynamic analysis. Several RS and NN are first constructed using the training data. The test data are then employed to select the best RS or NN. Quadratic and cubic response surfaces. radial basis neural network (RBNN) and back-propagation neural network (BPNN) are compared. Two-layered RBNN are generated using two different training algorithms, namely solverbe and solverb. A two layered BPNN is generated with Tan-Sigmoid transfer function. Various issues related to the training of the neural networks are addressed including number of neurons, error goals, spread constants and the accuracy of different models in representing the design space. A search for the optimum design is carried out using a standard gradient-based optimization algorithm over the response surfaces represented by the polynomials and trained neural networks. Usually a cubic polynominal performs better than the quadratic polynomial but exceptions have been noticed. Among the NN choices, the RBNN designed using solverb yields more consistent performance for both engine components considered. The training of RBNN is easier as it requires linear regression. This coupled with the consistency in performance promise the possibility of it being used as an optimization strategy for engineering design problems.

Context-specific metabolic networks are consistent with experiments.

PubMed

Becker, Scott A; Palsson, Bernhard O

2008-05-16

Reconstructions of cellular metabolism are publicly available for a variety of different microorganisms and some mammalian genomes. To date, these reconstructions are "genome-scale" and strive to include all reactions implied by the genome annotation, as well as those with direct experimental evidence. Clearly, many of the reactions in a genome-scale reconstruction will not be active under particular conditions or in a particular cell type. Methods to tailor these comprehensive genome-scale reconstructions into context-specific networks will aid predictive in silico modeling for a particular situation. We present a method called Gene Inactivity Moderated by Metabolism and Expression (GIMME) to achieve this goal. The GIMME algorithm uses quantitative gene expression data and one or more presupposed metabolic objectives to produce the context-specific reconstruction that is most consistent with the available data. Furthermore, the algorithm provides a quantitative inconsistency score indicating how consistent a set of gene expression data is with a particular metabolic objective. We show that this algorithm produces results consistent with biological experiments and intuition for adaptive evolution of bacteria, rational design of metabolic engineering strains, and human skeletal muscle cells. This work represents progress towards producing constraint-based models of metabolism that are specific to the conditions where the expression profiling data is available.

Dynamic fMRI networks predict success in a behavioral weight loss program among older adults.

PubMed

Mokhtari, Fatemeh; Rejeski, W Jack; Zhu, Yingying; Wu, Guorong; Simpson, Sean L; Burdette, Jonathan H; Laurienti, Paul J

2018-06-01

More than one-third of adults in the United States are obese, with a higher prevalence among older adults. Obesity among older adults is a major cause of physical dysfunction, hypertension, diabetes, and coronary heart diseases. Many people who engage in lifestyle weight loss interventions fail to reach targeted goals for weight loss, and most will regain what was lost within 1-2 years following cessation of treatment. This variability in treatment efficacy suggests that there are important phenotypes predictive of success with intentional weight loss that could lead to tailored treatment regimen, an idea that is consistent with the concept of precision-based medicine. Although the identification of biochemical and metabolic phenotypes are one potential direction of research, neurobiological measures may prove useful as substantial behavioral change is necessary to achieve success in a lifestyle intervention. In the present study, we use dynamic brain networks from functional magnetic resonance imaging (fMRI) data to prospectively identify individuals most likely to succeed in a behavioral weight loss intervention. Brain imaging was performed in overweight or obese older adults (age: 65-79 years) who participated in an 18-month lifestyle weight loss intervention. Machine learning and functional brain networks were combined to produce multivariate prediction models. The prediction accuracy exceeded 95%, suggesting that there exists a consistent pattern of connectivity which correctly predicts success with weight loss at the individual level. Connectivity patterns that contributed to the prediction consisted of complex multivariate network components that substantially overlapped with known brain networks that are associated with behavior emergence, self-regulation, body awareness, and the sensory features of food. Future work on independent datasets and diverse populations is needed to corroborate our findings. Additionally, we believe that efforts can begin to examine whether these models have clinical utility in tailoring treatment. Copyright © 2018 Elsevier Inc. All rights reserved.

Veterans with recent substance use and aggression: PTSD, substance use, and social network behaviors.

PubMed

Sexton, Minden B; Davis, Alan K; Buchholz, Katherine R; Winters, Jamie J; Rauch, Sheila A M; Yzquibell, Maegan; Bonar, Erin E; Friday, Steven; Chermack, Stephen T

2018-04-23

Violence is a salient concern among veterans, yet relationships between psychiatric comorbidity, social networks, and aggression are poorly understood. We examined associations between biopsychosocial factors (substance use, posttraumatic stress disorder [PTSD], and social network behaviors) with aggression. We recruited veterans endorsing past-year aggression and substance use (N = 180) from Department of Veterans Affairs outpatient treatment clinics. Main and interaction effects between probable PTSD, substance use, social network violence and substance use, and veteran violence were examined with negative binomial regressions-specifically, physical aggression toward a relationship partner (PA-P), physical injury of a partner (PI-P), physical aggression toward nonpartners (PA-NP), and physical injury of nonpartners (PI-NP). Alcohol use yielded consistent main effects. PTSD and social network violence demonstrated main effects for PA-NP and PI-NP. PTSD and social network violence interacted to predict PA-P such that social network violence appeared salient only in the context of PTSD. PTSD was associated with PI-P, PA-NP, and PI-NP in social network substance use models. In the PA-P model including social network substance use, veterans with PTSD reported greater PA-P in the context of greater social network substance use, whereas veterans without PTSD endorsed PA-P concurrent with greater alcohol frequency. For PI-P, PTSD interacted with alcohol to predict a greater likelihood of partner injury in the context of social network substance use. Investigated variables demonstrated unique associations within the context of specific relationships and the severity of behaviors. Overall, the findings underscore the importance of biopsychosocial models for understanding veteran violence. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Decoupled ARX and RBF Neural Network Modeling Using PCA and GA Optimization for Nonlinear Distributed Parameter Systems.

PubMed

Zhang, Ridong; Tao, Jili; Lu, Renquan; Jin, Qibing

2018-02-01

Modeling of distributed parameter systems is difficult because of their nonlinearity and infinite-dimensional characteristics. Based on principal component analysis (PCA), a hybrid modeling strategy that consists of a decoupled linear autoregressive exogenous (ARX) model and a nonlinear radial basis function (RBF) neural network model are proposed. The spatial-temporal output is first divided into a few dominant spatial basis functions and finite-dimensional temporal series by PCA. Then, a decoupled ARX model is designed to model the linear dynamics of the dominant modes of the time series. The nonlinear residual part is subsequently parameterized by RBFs, where genetic algorithm is utilized to optimize their hidden layer structure and the parameters. Finally, the nonlinear spatial-temporal dynamic system is obtained after the time/space reconstruction. Simulation results of a catalytic rod and a heat conduction equation demonstrate the effectiveness of the proposed strategy compared to several other methods.

Using XCO2 retrievals for assessing the long-term consistency of NDACC/FTIR data sets

NASA Astrophysics Data System (ADS)

Barthlott, S.; Schneider, M.; Hase, F.; Wiegele, A.; Christner, E.; González, Y.; Blumenstock, T.; Dohe, S.; García, O. E.; Sepúlveda, E.; Strong, K.; Mendonca, J.; Weaver, D.; Palm, M.; Deutscher, N. M.; Warneke, T.; Notholt, J.; Lejeune, B.; Mahieu, E.; Jones, N.; Griffith, D. W. T.; Velazco, V. A.; Smale, D.; Robinson, J.; Kivi, R.; Heikkinen, P.; Raffalski, U.

2014-10-01

Within the NDACC (Network for the Detection of Atmospheric Composition Change), more than 20 FTIR (Fourier-Transform InfraRed) spectrometers, spread worldwide, provide long-term data records of many atmospheric trace gases. We present a method that uses measured and modelled XCO2 for assessing the consistency of these data records. Our NDACC XCO2 retrieval setup is kept simple so that it can easily be adopted for any NDACC/FTIR-like measurement made since the late 1950s. By a comparison to coincident TCCON (Total Carbon Column Observing Network) measurements, we empirically demonstrate the useful quality of this NDACC XCO2 product (empirically obtained scatter between TCCON and NDACC is about 4‰ for daily mean as well as monthly mean comparisons and the bias is 25‰). As XCO2 model we developed and used a simple regression model fitted to CarbonTracker results and the Mauna Loa CO2 in-situ records. A comparison to TCCON data suggests an uncertainty of the model for monthly mean data of below 3‰. We apply the method to the NDACC/FTIR spectra that are used within the project MUSICA (MUlti-platform remote Sensing of Isotopologues for investigating the Cycle of Atmospheric water) and demonstrate that there is a good consistency for these globally representative set of spectra measured since 1996: the scatter between the modelled and measured XCO2 on a yearly time scale is only 3‰.

Using XCO2 retrievals for assessing the long-term consistency of NDACC/FTIR data sets

NASA Astrophysics Data System (ADS)

Barthlott, S.; Schneider, M.; Hase, F.; Wiegele, A.; Christner, E.; González, Y.; Blumenstock, T.; Dohe, S.; García, O. E.; Sepúlveda, E.; Strong, K.; Mendonca, J.; Weaver, D.; Palm, M.; Deutscher, N. M.; Warneke, T.; Notholt, J.; Lejeune, B.; Mahieu, E.; Jones, N.; Griffith, D. W. T.; Velazco, V. A.; Smale, D.; Robinson, J.; Kivi, R.; Heikkinen, P.; Raffalski, U.

2015-03-01

Within the NDACC (Network for the Detection of Atmospheric Composition Change), more than 20 FTIR (Fourier-transform infrared) spectrometers, spread worldwide, provide long-term data records of many atmospheric trace gases. We present a method that uses measured and modelled XCO2 for assessing the consistency of these NDACC data records. Our XCO2 retrieval setup is kept simple so that it can easily be adopted for any NDACC/FTIR-like measurement made since the late 1950s. By a comparison to coincident TCCON (Total Carbon Column Observing Network) measurements, we empirically demonstrate the useful quality of this suggested NDACC XCO2 product (empirically obtained scatter between TCCON and NDACC is about 4‰ for daily mean as well as monthly mean comparisons, and the bias is 25‰). Our XCO2 model is a simple regression model fitted to CarbonTracker results and the Mauna Loa CO2 in situ records. A comparison to TCCON data suggests an uncertainty of the model for monthly mean data of below 3‰. We apply the method to the NDACC/FTIR spectra that are used within the project MUSICA (multi-platform remote sensing of isotopologues for investigating the cycle of atmospheric water) and demonstrate that there is a good consistency for these globally representative set of spectra measured since 1996: the scatter between the modelled and measured XCO2 on a yearly time scale is only 3‰.

Modeling the glass transition of amorphous networks for shape-memory behavior

NASA Astrophysics Data System (ADS)

Xiao, Rui; Choi, Jinwoo; Lakhera, Nishant; Yakacki, Christopher M.; Frick, Carl P.; Nguyen, Thao D.

2013-07-01

In this paper, a thermomechanical constitutive model was developed for the time-dependent behaviors of the glass transition of amorphous networks. The model used multiple discrete relaxation processes to describe the distribution of relaxation times for stress relaxation, structural relaxation, and stress-activated viscous flow. A non-equilibrium thermodynamic framework based on the fictive temperature was introduced to demonstrate the thermodynamic consistency of the constitutive theory. Experimental and theoretical methods were developed to determine the parameters describing the distribution of stress and structural relaxation times and the dependence of the relaxation times on temperature, structure, and driving stress. The model was applied to study the effects of deformation temperatures and physical aging on the shape-memory behavior of amorphous networks. The model was able to reproduce important features of the partially constrained recovery response observed in experiments. Specifically, the model demonstrated a strain-recovery overshoot for cases programmed below Tg and subjected to a constant mechanical load. This phenomenon was not observed for materials programmed above Tg. Physical aging, in which the material was annealed for an extended period of time below Tg, shifted the activation of strain recovery to higher temperatures and increased significantly the initial recovery rate. For fixed-strain recovery, the model showed a larger overshoot in the stress response for cases programmed below Tg, which was consistent with previous experimental observations. Altogether, this work demonstrates how an understanding of the time-dependent behaviors of the glass transition can be used to tailor the temperature and deformation history of the shape-memory programming process to achieve more complex shape recovery pathways, faster recovery responses, and larger activation stresses.

Study of parameter identification using hybrid neural-genetic algorithm in electro-hydraulic servo system

NASA Astrophysics Data System (ADS)

Moon, Byung-Young

2005-12-01

The hybrid neural-genetic multi-model parameter estimation algorithm was demonstrated. This method can be applied to structured system identification of electro-hydraulic servo system. This algorithms consist of a recurrent incremental credit assignment(ICRA) neural network and a genetic algorithm. The ICRA neural network evaluates each member of a generation of model and genetic algorithm produces new generation of model. To evaluate the proposed method, electro-hydraulic servo system was designed and manufactured. The experiment was carried out to figure out the hybrid neural-genetic multi-model parameter estimation algorithm. As a result, the dynamic characteristics were obtained such as the parameters(mass, damping coefficient, bulk modulus, spring coefficient), which minimize total square error. The result of this study can be applied to hydraulic systems in industrial fields.