Electrical circuit modeling and analysis of microwave acoustic interaction with biological tissues.

PubMed

Gao, Fei; Zheng, Qian; Zheng, Yuanjin

2014-05-01

Numerical study of microwave imaging and microwave-induced thermoacoustic imaging utilizes finite difference time domain (FDTD) analysis for simulation of microwave and acoustic interaction with biological tissues, which is time consuming due to complex grid-segmentation and numerous calculations, not straightforward due to no analytical solution and physical explanation, and incompatible with hardware development requiring circuit simulator such as SPICE. In this paper, instead of conventional FDTD numerical simulation, an equivalent electrical circuit model is proposed to model the microwave acoustic interaction with biological tissues for fast simulation and quantitative analysis in both one and two dimensions (2D). The equivalent circuit of ideal point-like tissue for microwave-acoustic interaction is proposed including transmission line, voltage-controlled current source, envelop detector, and resistor-inductor-capacitor (RLC) network, to model the microwave scattering, thermal expansion, and acoustic generation. Based on which, two-port network of the point-like tissue is built and characterized using pseudo S-parameters and transducer gain. Two dimensional circuit network including acoustic scatterer and acoustic channel is also constructed to model the 2D spatial information and acoustic scattering effect in heterogeneous medium. Both FDTD simulation, circuit simulation, and experimental measurement are performed to compare the results in terms of time domain, frequency domain, and pseudo S-parameters characterization. 2D circuit network simulation is also performed under different scenarios including different sizes of tumors and the effect of acoustic scatterer. The proposed circuit model of microwave acoustic interaction with biological tissue could give good agreement with FDTD simulated and experimental measured results. The pseudo S-parameters and characteristic gain could globally evaluate the performance of tumor detection. The 2D circuit network enables the potential to combine the quasi-numerical simulation and circuit simulation in a uniform simulator for codesign and simulation of a microwave acoustic imaging system, bridging bioeffect study and hardware development seamlessly.

Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

New Passivity Criteria for Fuzzy Bam Neural Networks with Markovian Jumping Parameters and Time-Varying Delays

NASA Astrophysics Data System (ADS)

Vadivel, P.; Sakthivel, R.; Mathiyalagan, K.; Thangaraj, P.

2013-02-01

This paper addresses the problem of passivity analysis issue for a class of fuzzy bidirectional associative memory (BAM) neural networks with Markovian jumping parameters and time varying delays. A set of sufficient conditions for the passiveness of the considered fuzzy BAM neural network model is derived in terms of linear matrix inequalities by using the delay fractioning technique together with the Lyapunov function approach. In addition, the uncertainties are inevitable in neural networks because of the existence of modeling errors and external disturbance. Further, this result is extended to study the robust passivity criteria for uncertain fuzzy BAM neural networks with time varying delays and uncertainties. These criteria are expressed in the form of linear matrix inequalities (LMIs), which can be efficiently solved via standard numerical software. Two numerical examples are provided to demonstrate the effectiveness of the obtained results.

The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference

PubMed Central

Deng, Changjian

2013-01-01

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613

Precise calculation of a bond percolation transition and survival rates of nodes in a complex network.

PubMed

Kawamoto, Hirokazu; Takayasu, Hideki; Jensen, Henrik Jeldtoft; Takayasu, Misako

2015-01-01

Through precise numerical analysis, we reveal a new type of universal loopless percolation transition in randomly removed complex networks. As an example of a real-world network, we apply our analysis to a business relation network consisting of approximately 3,000,000 links among 300,000 firms and observe the transition with critical exponents close to the mean-field values taking into account the finite size effect. We focus on the largest cluster at the critical point, and introduce survival probability as a new measure characterizing the robustness of each node. We also discuss the relation between survival probability and k-shell decomposition.

Automatic network coupling analysis for dynamical systems based on detailed kinetic models.

PubMed

Lebiedz, Dirk; Kammerer, Julia; Brandt-Pollmann, Ulrich

2005-10-01

We introduce a numerical complexity reduction method for the automatic identification and analysis of dynamic network decompositions in (bio)chemical kinetics based on error-controlled computation of a minimal model dimension represented by the number of (locally) active dynamical modes. Our algorithm exploits a generalized sensitivity analysis along state trajectories and subsequent singular value decomposition of sensitivity matrices for the identification of these dominant dynamical modes. It allows for a dynamic coupling analysis of (bio)chemical species in kinetic models that can be exploited for the piecewise computation of a minimal model on small time intervals and offers valuable functional insight into highly nonlinear reaction mechanisms and network dynamics. We present results for the identification of network decompositions in a simple oscillatory chemical reaction, time scale separation based model reduction in a Michaelis-Menten enzyme system and network decomposition of a detailed model for the oscillatory peroxidase-oxidase enzyme system.

Displacement back analysis for a high slope of the Dagangshan Hydroelectric Power Station based on BP neural network and particle swarm optimization.

PubMed

Liang, Zhengzhao; Gong, Bin; Tang, Chunan; Zhang, Yongbin; Ma, Tianhui

2014-01-01

The right bank high slope of the Dagangshan Hydroelectric Power Station is located in complicated geological conditions with deep fractures and unloading cracks. How to obtain the mechanical parameters and then evaluate the safety of the slope are the key problems. This paper presented a displacement back analysis for the slope using an artificial neural network model (ANN) and particle swarm optimization model (PSO). A numerical model was established to simulate the displacement increment results, acquiring training data for the artificial neural network model. The backpropagation ANN model was used to establish a mapping function between the mechanical parameters and the monitoring displacements. The PSO model was applied to initialize the weights and thresholds of the backpropagation (BP) network model and determine suitable values of the mechanical parameters. Then the elastic moduli of the rock masses were obtained according to the monitoring displacement data at different excavation stages, and the BP neural network model was proved to be valid by comparing the measured displacements, the displacements predicted by the BP neural network model, and the numerical simulation using the back-analyzed parameters. The proposed model is useful for rock mechanical parameters determination and instability investigation of rock slopes.

Displacement Back Analysis for a High Slope of the Dagangshan Hydroelectric Power Station Based on BP Neural Network and Particle Swarm Optimization

PubMed Central

Liang, Zhengzhao; Gong, Bin; Tang, Chunan; Zhang, Yongbin; Ma, Tianhui

2014-01-01

The right bank high slope of the Dagangshan Hydroelectric Power Station is located in complicated geological conditions with deep fractures and unloading cracks. How to obtain the mechanical parameters and then evaluate the safety of the slope are the key problems. This paper presented a displacement back analysis for the slope using an artificial neural network model (ANN) and particle swarm optimization model (PSO). A numerical model was established to simulate the displacement increment results, acquiring training data for the artificial neural network model. The backpropagation ANN model was used to establish a mapping function between the mechanical parameters and the monitoring displacements. The PSO model was applied to initialize the weights and thresholds of the backpropagation (BP) network model and determine suitable values of the mechanical parameters. Then the elastic moduli of the rock masses were obtained according to the monitoring displacement data at different excavation stages, and the BP neural network model was proved to be valid by comparing the measured displacements, the displacements predicted by the BP neural network model, and the numerical simulation using the back-analyzed parameters. The proposed model is useful for rock mechanical parameters determination and instability investigation of rock slopes. PMID:25140345

Potential uses of a wireless network in physical security systems.

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

Witzke, Edward L.

2010-07-01

Many possible applications requiring or benefiting from a wireless network are available for bolstering physical security and awareness at high security installations or facilities. These enhancements are not always straightforward and may require careful analysis, selection, tuning, and implementation of wireless technologies. In this paper, an introduction to wireless networks and the task of enhancing physical security is first given. Next, numerous applications of a wireless network are brought forth. The technical issues that arise when using a wireless network to support these applications are then discussed. Finally, a summary is presented.

From brain to earth and climate systems: small-world interaction networks or not?

PubMed

Bialonski, Stephan; Horstmann, Marie-Therese; Lehnertz, Klaus

2010-03-01

We consider recent reports on small-world topologies of interaction networks derived from the dynamics of spatially extended systems that are investigated in diverse scientific fields such as neurosciences, geophysics, or meteorology. With numerical simulations that mimic typical experimental situations, we have identified an important constraint when characterizing such networks: indications of a small-world topology can be expected solely due to the spatial sampling of the system along with the commonly used time series analysis based approaches to network characterization.

Women's connectivity in extreme networks.

PubMed

Manrique, Pedro; Cao, Zhenfeng; Gabriel, Andrew; Horgan, John; Gill, Paul; Qi, Hong; Restrepo, Elvira M; Johnson, Daniela; Wuchty, Stefan; Song, Chaoming; Johnson, Neil

2016-06-01

A popular stereotype is that women will play more minor roles than men as environments become more dangerous and aggressive. Our analysis of new longitudinal data sets from offline and online operational networks [for example, ISIS (Islamic State)] shows that although men dominate numerically, women emerge with superior network connectivity that can benefit the underlying system's robustness and survival. Our observations suggest new female-centric approaches that could be used to affect such networks. They also raise questions about how individual contributions in high-pressure systems are evaluated.

Multistability in bidirectional associative memory neural networks

NASA Astrophysics Data System (ADS)

Huang, Gan; Cao, Jinde

2008-04-01

In this Letter, the multistability issue is studied for Bidirectional Associative Memory (BAM) neural networks. Based on the existence and stability analysis of the neural networks with or without delay, it is found that the 2 n-dimensional networks can have 3 equilibria and 2 equilibria of them are locally exponentially stable, where each layer of the BAM network has n neurons. Furthermore, the results has been extended to (n+m)-dimensional BAM neural networks, where there are n and m neurons on the two layers respectively. Finally, two numerical examples are presented to illustrate the validity of our results.

Coarse graining for synchronization in directed networks

NASA Astrophysics Data System (ADS)

Zeng, An; Lü, Linyuan

2011-05-01

Coarse-graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve statistical properties as well as the dynamic behaviors of the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse-graining directed networks lacks of consideration. In this paper we proposed a path-based coarse-graining (PCG) method to coarse grain the directed networks. Performing the linear stability analysis of synchronization and numerical simulation of the Kuramoto model on four kinds of directed networks, including tree networks and variants of Barabási-Albert networks, Watts-Strogatz networks, and Erdös-Rényi networks, we find our method can effectively preserve the network synchronizability.

Nonlinear multivariate and time series analysis by neural network methods

NASA Astrophysics Data System (ADS)

Hsieh, William W.

2004-03-01

Methods in multivariate statistical analysis are essential for working with large amounts of geophysical data, data from observational arrays, from satellites, or from numerical model output. In classical multivariate statistical analysis, there is a hierarchy of methods, starting with linear regression at the base, followed by principal component analysis (PCA) and finally canonical correlation analysis (CCA). A multivariate time series method, the singular spectrum analysis (SSA), has been a fruitful extension of the PCA technique. The common drawback of these classical methods is that only linear structures can be correctly extracted from the data. Since the late 1980s, neural network methods have become popular for performing nonlinear regression and classification. More recently, neural network methods have been extended to perform nonlinear PCA (NLPCA), nonlinear CCA (NLCCA), and nonlinear SSA (NLSSA). This paper presents a unified view of the NLPCA, NLCCA, and NLSSA techniques and their applications to various data sets of the atmosphere and the ocean (especially for the El Niño-Southern Oscillation and the stratospheric quasi-biennial oscillation). These data sets reveal that the linear methods are often too simplistic to describe real-world systems, with a tendency to scatter a single oscillatory phenomenon into numerous unphysical modes or higher harmonics, which can be largely alleviated in the new nonlinear paradigm.

Strange non-chaotic attractors in a state controlled-cellular neural network-based quasiperiodically forced MLC circuit

NASA Astrophysics Data System (ADS)

Ezhilarasu, P. Megavarna; Inbavalli, M.; Murali, K.; Thamilmaran, K.

2018-07-01

In this paper, we report the dynamical transitions to strange non-chaotic attractors in a quasiperiodically forced state controlled-cellular neural network (SC-CNN)-based MLC circuit via two different mechanisms, namely the Heagy-Hammel route and the gradual fractalisation route. These transitions were observed through numerical simulations and hardware experiments and confirmed using statistical tools, such as maximal Lyapunov exponent spectrum and its variance and singular continuous spectral analysis. We find that there is a remarkable agreement of the results from both numerical simulations as well as from hardware experiments.

Reducing neural network training time with parallel processing

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.; Lamarsh, William J., II

1995-01-01

Obtaining optimal solutions for engineering design problems is often expensive because the process typically requires numerous iterations involving analysis and optimization programs. Previous research has shown that a near optimum solution can be obtained in less time by simulating a slow, expensive analysis with a fast, inexpensive neural network. A new approach has been developed to further reduce this time. This approach decomposes a large neural network into many smaller neural networks that can be trained in parallel. Guidelines are developed to avoid some of the pitfalls when training smaller neural networks in parallel. These guidelines allow the engineer: to determine the number of nodes on the hidden layer of the smaller neural networks; to choose the initial training weights; and to select a network configuration that will capture the interactions among the smaller neural networks. This paper presents results describing how these guidelines are developed.

Passenger flow analysis of Beijing urban rail transit network using fractal approach

NASA Astrophysics Data System (ADS)

Li, Xiaohong; Chen, Peiwen; Chen, Feng; Wang, Zijia

2018-04-01

To quantify the spatiotemporal distribution of passenger flow and the characteristics of an urban rail transit network, we introduce four radius fractal dimensions and two branch fractal dimensions by combining a fractal approach with passenger flow assignment model. These fractal dimensions can numerically describe the complexity of passenger flow in the urban rail transit network and its change characteristics. Based on it, we establish a fractal quantification method to measure the fractal characteristics of passenger follow in the rail transit network. Finally, we validate the reasonability of our proposed method by using the actual data of Beijing subway network. It has been shown that our proposed method can effectively measure the scale-free range of the urban rail transit network, network development and the fractal characteristics of time-varying passenger flow, which further provides a reference for network planning and analysis of passenger flow.

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks

NASA Astrophysics Data System (ADS)

Chung, Tein-Yaw; Lee, Kuan-Chun; Lee, Hsiao-Chih

This paper derived a closed-form expression for inter-flow capacity of a backhaul wireless mesh network (WMN) with centralized scheduling by employing a ring-based approach. Through the definition of an interference area, we are able to accurately describe a bottleneck collision area for a WMN and calculate the upper bound of inter-flow capacity. The closed-form expression shows that the upper bound is a function of the ratio between transmission range and network radius. Simulations and numerical analysis show that our analytic solution can better estimate the inter-flow capacity of WMNs than that of previous approach.

Stability analysis for stochastic BAM nonlinear neural network with delays

NASA Astrophysics Data System (ADS)

Lv, Z. W.; Shu, H. S.; Wei, G. L.

2008-02-01

In this paper, stochastic bidirectional associative memory neural networks with constant or time-varying delays is considered. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, we derive several sufficient conditions in order to guarantee the global asymptotically stable in the mean square. Our investigation shows that the stochastic bidirectional associative memory neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities(LMIs). Hence, the global asymptotic stability of the stochastic bidirectional associative memory neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global asymptotic stability criteria.

Impulsive synchronization of stochastic reaction-diffusion neural networks with mixed time delays.

PubMed

Sheng, Yin; Zeng, Zhigang

2018-07-01

This paper discusses impulsive synchronization of stochastic reaction-diffusion neural networks with Dirichlet boundary conditions and hybrid time delays. By virtue of inequality techniques, theories of stochastic analysis, linear matrix inequalities, and the contradiction method, sufficient criteria are proposed to ensure exponential synchronization of the addressed stochastic reaction-diffusion neural networks with mixed time delays via a designed impulsive controller. Compared with some recent studies, the neural network models herein are more general, some restrictions are relaxed, and the obtained conditions enhance and generalize some published ones. Finally, two numerical simulations are performed to substantiate the validity and merits of the developed theoretical analysis. Copyright © 2018 Elsevier Ltd. All rights reserved.

Precise Calculation of a Bond Percolation Transition and Survival Rates of Nodes in a Complex Network

PubMed Central

Kawamoto, Hirokazu; Takayasu, Hideki; Jensen, Henrik Jeldtoft; Takayasu, Misako

2015-01-01

Through precise numerical analysis, we reveal a new type of universal loopless percolation transition in randomly removed complex networks. As an example of a real-world network, we apply our analysis to a business relation network consisting of approximately 3,000,000 links among 300,000 firms and observe the transition with critical exponents close to the mean-field values taking into account the finite size effect. We focus on the largest cluster at the critical point, and introduce survival probability as a new measure characterizing the robustness of each node. We also discuss the relation between survival probability and k-shell decomposition. PMID:25885791

Multistability and instability analysis of recurrent neural networks with time-varying delays.

PubMed

Zhang, Fanghai; Zeng, Zhigang

2018-01-01

This paper provides new theoretical results on the multistability and instability analysis of recurrent neural networks with time-varying delays. It is shown that such n-neuronal recurrent neural networks have exactly [Formula: see text] equilibria, [Formula: see text] of which are locally exponentially stable and the others are unstable, where k 0 is a nonnegative integer such that k 0 ≤n. By using the combination method of two different divisions, recurrent neural networks can possess more dynamic properties. This method improves and extends the existing results in the literature. Finally, one numerical example is provided to show the superiority and effectiveness of the presented results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Influence of the time scale on the construction of financial networks.

PubMed

Emmert-Streib, Frank; Dehmer, Matthias

2010-09-30

In this paper we investigate the definition and formation of financial networks. Specifically, we study the influence of the time scale on their construction. For our analysis we use correlation-based networks obtained from the daily closing prices of stock market data. More precisely, we use the stocks that currently comprise the Dow Jones Industrial Average (DJIA) and estimate financial networks where nodes correspond to stocks and edges correspond to none vanishing correlation coefficients. That means only if a correlation coefficient is statistically significant different from zero, we include an edge in the network. This construction procedure results in unweighted, undirected networks. By separating the time series of stock prices in non-overlapping intervals, we obtain one network per interval. The length of these intervals corresponds to the time scale of the data, whose influence on the construction of the networks will be studied in this paper. Numerical analysis of four different measures in dependence on the time scale for the construction of networks allows us to gain insights about the intrinsic time scale of the stock market with respect to a meaningful graph-theoretical analysis.

Predicting catastrophes of non-autonomous networks with visibility graphs and horizontal visibility

NASA Astrophysics Data System (ADS)

Zhang, Haicheng; Xu, Daolin; Wu, Yousheng

2018-05-01

Prediction of potential catastrophes in engineering systems is a challenging problem. We first attempt to construct a complex network to predict catastrophes of a multi-modular floating system in advance of their occurrences. Response time series of the system can be mapped into an virtual network by using visibility graph or horizontal visibility algorithm. The topology characteristics of the networks can be used to forecast catastrophes of the system. Numerical results show that there is an obvious corresponding relationship between the variation of topology characteristics and the onset of catastrophes. A Catastrophe Index (CI) is proposed as a numerical indicator to measure a qualitative change from a stable state to a catastrophic state. The two approaches, the visibility graph and horizontal visibility algorithms, are compared by using the index in the reliability analysis with different data lengths and sampling frequencies. The technique of virtual network method is potentially extendable to catastrophe predictions of other engineering systems.

Numerical Simulation and Artificial Neural Network Modeling for Predicting Welding-Induced Distortion in Butt-Welded 304L Stainless Steel Plates

NASA Astrophysics Data System (ADS)

Narayanareddy, V. V.; Chandrasekhar, N.; Vasudevan, M.; Muthukumaran, S.; Vasantharaja, P.

2016-02-01

In the present study, artificial neural network modeling has been employed for predicting welding-induced angular distortions in autogenous butt-welded 304L stainless steel plates. The input data for the neural network have been obtained from a series of three-dimensional finite element simulations of TIG welding for a wide range of plate dimensions. Thermo-elasto-plastic analysis was carried out for 304L stainless steel plates during autogenous TIG welding employing double ellipsoidal heat source. The simulated thermal cycles were validated by measuring thermal cycles using thermocouples at predetermined positions, and the simulated distortion values were validated by measuring distortion using vertical height gauge for three cases. There was a good agreement between the model predictions and the measured values. Then, a multilayer feed-forward back propagation neural network has been developed using the numerically simulated data. Artificial neural network model developed in the present study predicted the angular distortion accurately.

Power-law exponent of the Bouchaud-Mézard model on regular random networks

NASA Astrophysics Data System (ADS)

Ichinomiya, Takashi

2013-07-01

We study the Bouchaud-Mézard model on a regular random network. By assuming adiabaticity and independency, and utilizing the generalized central limit theorem and the Tauberian theorem, we derive an equation that determines the exponent of the probability distribution function of the wealth as x→∞. The analysis shows that the exponent can be smaller than 2, while a mean-field analysis always gives the exponent as being larger than 2. The results of our analysis are shown to be in good agreement with those of the numerical simulations.

Robust recognition of handwritten numerals based on dual cooperative network

NASA Technical Reports Server (NTRS)

Lee, Sukhan; Choi, Yeongwoo

1992-01-01

An approach to robust recognition of handwritten numerals using two operating parallel networks is presented. The first network uses inputs in Cartesian coordinates, and the second network uses the same inputs transformed into polar coordinates. How the proposed approach realizes the robustness to local and global variations of input numerals by handling inputs both in Cartesian coordinates and in its transformed Polar coordinates is described. The required network structures and its learning scheme are discussed. Experimental results show that by tracking only a small number of distinctive features for each teaching numeral in each coordinate, the proposed system can provide robust recognition of handwritten numerals.

Tuning the synchronization of a network of weakly coupled self-oscillating gels via capacitors.

PubMed

Fang, Yan; Yashin, Victor V; Dickerson, Samuel J; Balazs, Anna C

2018-05-01

We consider a network of coupled oscillating units, where each unit comprises a self-oscillating polymer gel undergoing the Belousov-Zhabotinsky (BZ) reaction and an overlaying piezoelectric (PZ) cantilever. Through chemo-mechano-electrical coupling, the oscillations of the networked BZ-PZ units achieve in-phase or anti-phase synchronization, enabling, for example, the storage of information within the system. Herein, we develop numerical and computational models to show that the introduction of capacitors into the BZ-PZ system enhances the dynamical behavior of the oscillating network by yielding additional stable synchronization modes. We specifically show that the capacitors lead to a redistribution of charge in the system and alteration of the force that the PZ cantilevers apply to the underlying gel. Hence, the capacitors modify the strength of the coupling between the oscillators in the network. We utilize a linear stability analysis to determine the phase behavior of BZ-PZ networks encompassing different capacitances, force polarities, and number of units and then verify our findings with numerical simulations. Thus, through analytical calculations and numerical simulations, we determine the impact of the capacitors on the existence of the synchronization modes, their stability, and the rate of synchronization within these complex dynamical systems. The findings from our study can be used to design robotic materials that harness the materials' intrinsic, responsive properties to perform such functions as sensing, actuation, and information storage.

Tuning the synchronization of a network of weakly coupled self-oscillating gels via capacitors

NASA Astrophysics Data System (ADS)

Fang, Yan; Yashin, Victor V.; Dickerson, Samuel J.; Balazs, Anna C.

2018-05-01

We consider a network of coupled oscillating units, where each unit comprises a self-oscillating polymer gel undergoing the Belousov-Zhabotinsky (BZ) reaction and an overlaying piezoelectric (PZ) cantilever. Through chemo-mechano-electrical coupling, the oscillations of the networked BZ-PZ units achieve in-phase or anti-phase synchronization, enabling, for example, the storage of information within the system. Herein, we develop numerical and computational models to show that the introduction of capacitors into the BZ-PZ system enhances the dynamical behavior of the oscillating network by yielding additional stable synchronization modes. We specifically show that the capacitors lead to a redistribution of charge in the system and alteration of the force that the PZ cantilevers apply to the underlying gel. Hence, the capacitors modify the strength of the coupling between the oscillators in the network. We utilize a linear stability analysis to determine the phase behavior of BZ-PZ networks encompassing different capacitances, force polarities, and number of units and then verify our findings with numerical simulations. Thus, through analytical calculations and numerical simulations, we determine the impact of the capacitors on the existence of the synchronization modes, their stability, and the rate of synchronization within these complex dynamical systems. The findings from our study can be used to design robotic materials that harness the materials' intrinsic, responsive properties to perform such functions as sensing, actuation, and information storage.

Implementation of Finite Volume based Navier Stokes Algorithm Within General Purpose Flow Network Code

NASA Technical Reports Server (NTRS)

Schallhorn, Paul; Majumdar, Alok

2012-01-01

This paper describes a finite volume based numerical algorithm that allows multi-dimensional computation of fluid flow within a system level network flow analysis. There are several thermo-fluid engineering problems where higher fidelity solutions are needed that are not within the capacity of system level codes. The proposed algorithm will allow NASA's Generalized Fluid System Simulation Program (GFSSP) to perform multi-dimensional flow calculation within the framework of GFSSP s typical system level flow network consisting of fluid nodes and branches. The paper presents several classical two-dimensional fluid dynamics problems that have been solved by GFSSP's multi-dimensional flow solver. The numerical solutions are compared with the analytical and benchmark solution of Poiseulle, Couette and flow in a driven cavity.

Epidemic spreading on one-way-coupled networks

NASA Astrophysics Data System (ADS)

Wang, Lingna; Sun, Mengfeng; Chen, Shanshan; Fu, Xinchu

2016-09-01

Numerous real-world networks (e.g., social, communicational, and biological networks) have been observed to depend on each other, and this results in interconnected networks with different topology structures and dynamics functions. In this paper, we focus on the scenario of epidemic spreading on one-way-coupled networks comprised of two subnetworks, which can manifest the transmission of some zoonotic diseases. By proposing a mathematical model through mean-field approximation approach, we prove the global stability of the disease-free and endemic equilibria of this model. Through the theoretical and numerical analysis, we obtain interesting results: the basic reproduction number R0 of the whole network is the maximum of the basic reproduction numbers of the two subnetworks; R0 is independent of the cross-infection rate and cross contact pattern; R0 increases rapidly with the growth of inner infection rate if the inner contact pattern is scale-free; in order to eradicate zoonotic diseases from human beings, we must simultaneously eradicate them from animals; bird-to-bird infection rate has bigger impact on the human's average infected density than bird-to-human infection rate.

A Computational Network Biology Approach to Uncover Novel Genes Related to Alzheimer's Disease.

PubMed

Zanzoni, Andreas

2016-01-01

Recent advances in the fields of genetics and genomics have enabled the identification of numerous Alzheimer's disease (AD) candidate genes, although for many of them the role in AD pathophysiology has not been uncovered yet. Concomitantly, network biology studies have shown a strong link between protein network connectivity and disease. In this chapter I describe a computational approach that, by combining local and global network analysis strategies, allows the formulation of novel hypotheses on the molecular mechanisms involved in AD and prioritizes candidate genes for further functional studies.

Numerical and analytical investigation of the chimera state excitation conditions in the Kuramoto-Sakaguchi oscillator network

NASA Astrophysics Data System (ADS)

Frolov, Nikita S.; Goremyko, Mikhail V.; Makarov, Vladimir V.; Maksimenko, Vladimir A.; Hramov, Alexander E.

2017-03-01

In this paper we study the conditions of chimera states excitation in ensemble of non-locally coupled Kuramoto-Sakaguchi (KS) oscillators. In the framework of current research we analyze the dynamics of the homogeneous network containing identical oscillators. We show the chimera state formation process is sensitive to the parameters of coupling kernel and to the KS network initial state. To perform the analysis we have used the Ott-Antonsen (OA) ansatz to consider the behavior of infinitely large KS network.

Women’s connectivity in extreme networks

PubMed Central

Manrique, Pedro; Cao, Zhenfeng; Gabriel, Andrew; Horgan, John; Gill, Paul; Qi, Hong; Restrepo, Elvira M.; Johnson, Daniela; Wuchty, Stefan; Song, Chaoming; Johnson, Neil

2016-01-01

A popular stereotype is that women will play more minor roles than men as environments become more dangerous and aggressive. Our analysis of new longitudinal data sets from offline and online operational networks [for example, ISIS (Islamic State)] shows that although men dominate numerically, women emerge with superior network connectivity that can benefit the underlying system’s robustness and survival. Our observations suggest new female-centric approaches that could be used to affect such networks. They also raise questions about how individual contributions in high-pressure systems are evaluated. PMID:27386564

Boundedness and convergence of online gradient method with penalty for feedforward neural networks.

PubMed

Zhang, Huisheng; Wu, Wei; Liu, Fei; Yao, Mingchen

2009-06-01

In this brief, we consider an online gradient method with penalty for training feedforward neural networks. Specifically, the penalty is a term proportional to the norm of the weights. Its roles in the method are to control the magnitude of the weights and to improve the generalization performance of the network. By proving that the weights are automatically bounded in the network training with penalty, we simplify the conditions that are required for convergence of online gradient method in literature. A numerical example is given to support the theoretical analysis.

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

Global stabilization analysis of inertial memristive recurrent neural networks with discrete and distributed delays.

PubMed

Wang, Leimin; Zeng, Zhigang; Ge, Ming-Feng; Hu, Junhao

2018-05-02

This paper deals with the stabilization problem of memristive recurrent neural networks with inertial items, discrete delays, bounded and unbounded distributed delays. First, for inertial memristive recurrent neural networks (IMRNNs) with second-order derivatives of states, an appropriate variable substitution method is invoked to transfer IMRNNs into a first-order differential form. Then, based on nonsmooth analysis theory, several algebraic criteria are established for the global stabilizability of IMRNNs under proposed feedback control, where the cases with both bounded and unbounded distributed delays are successfully addressed. Finally, the theoretical results are illustrated via the numerical simulations. Copyright © 2018 Elsevier Ltd. All rights reserved.

Global Mittag-Leffler stability analysis of fractional-order impulsive neural networks with one-side Lipschitz condition.

PubMed

Zhang, Xinxin; Niu, Peifeng; Ma, Yunpeng; Wei, Yanqiao; Li, Guoqiang

2017-10-01

This paper is concerned with the stability analysis issue of fractional-order impulsive neural networks. Under the one-side Lipschitz condition or the linear growth condition of activation function, the existence of solution is analyzed respectively. In addition, the existence, uniqueness and global Mittag-Leffler stability of equilibrium point of the fractional-order impulsive neural networks with one-side Lipschitz condition are investigated by the means of contraction mapping principle and Lyapunov direct method. Finally, an example with numerical simulation is given to illustrate the validity and feasibility of the proposed results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Passivity analysis of memristor-based impulsive inertial neural networks with time-varying delays.

PubMed

Wan, Peng; Jian, Jigui

2018-03-01

This paper focuses on delay-dependent passivity analysis for a class of memristive impulsive inertial neural networks with time-varying delays. By choosing proper variable transformation, the memristive inertial neural networks can be rewritten as first-order differential equations. The memristive model presented here is regarded as a switching system rather than employing the theory of differential inclusion and set-value map. Based on matrix inequality and Lyapunov-Krasovskii functional method, several delay-dependent passivity conditions are obtained to ascertain the passivity of the addressed networks. In addition, the results obtained here contain those on the passivity for the addressed networks without impulse effects as special cases and can also be generalized to other neural networks with more complex pulse interference. Finally, one numerical example is presented to show the validity of the obtained results. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Influence of the Time Scale on the Construction of Financial Networks

PubMed Central

Emmert-Streib, Frank; Dehmer, Matthias

2010-01-01

Background In this paper we investigate the definition and formation of financial networks. Specifically, we study the influence of the time scale on their construction. Methodology/Principal Findings For our analysis we use correlation-based networks obtained from the daily closing prices of stock market data. More precisely, we use the stocks that currently comprise the Dow Jones Industrial Average (DJIA) and estimate financial networks where nodes correspond to stocks and edges correspond to none vanishing correlation coefficients. That means only if a correlation coefficient is statistically significant different from zero, we include an edge in the network. This construction procedure results in unweighted, undirected networks. By separating the time series of stock prices in non-overlapping intervals, we obtain one network per interval. The length of these intervals corresponds to the time scale of the data, whose influence on the construction of the networks will be studied in this paper. Conclusions/Significance Numerical analysis of four different measures in dependence on the time scale for the construction of networks allows us to gain insights about the intrinsic time scale of the stock market with respect to a meaningful graph-theoretical analysis. PMID:20949124

MaxEnt analysis of a water distribution network in Canberra, ACT, Australia

NASA Astrophysics Data System (ADS)

Waldrip, Steven H.; Niven, Robert K.; Abel, Markus; Schlegel, Michael; Noack, Bernd R.

2015-01-01

A maximum entropy (MaxEnt) method is developed to infer the state of a pipe flow network, for situations in which there is insufficient information to form a closed equation set. This approach substantially extends existing deterministic methods for the analysis of engineered flow networks (e.g. Newton's method or the Hardy Cross scheme). The network is represented as an undirected graph structure, in which the uncertainty is represented by a continuous relative entropy on the space of internal and external flow rates. The head losses (potential differences) on the network are treated as dependent variables, using specified pipe-flow resistance functions. The entropy is maximised subject to "observable" constraints on the mean values of certain flow rates and/or potential differences, and also "physical" constraints arising from the frictional properties of each pipe and from Kirchhoff's nodal and loop laws. A numerical method is developed in Matlab for solution of the integral equation system, based on multidimensional quadrature. Several nonlinear resistance functions (e.g. power-law and Colebrook) are investigated, necessitating numerical solution of the implicit Lagrangian by a double iteration scheme. The method is applied to a 1123-node, 1140-pipe water distribution network for the suburb of Torrens in the Australian Capital Territory, Australia, using network data supplied by water authority ACTEW Corporation Limited. A number of different assumptions are explored, including various network geometric representations, prior probabilities and constraint settings, yielding useful predictions of network demand and performance. We also propose this methodology be used in conjunction with in-flow monitoring systems, to obtain better inferences of user consumption without large investments in monitoring equipment and maintenance.

Recent Naval Postgraduate School Publications.

DTIC Science & Technology

1980-04-01

Numerical models of ocean circulation and Climate interaction Revs, of Geophis,.and Space Phys., vol. 17, no. 7, p. 1494-1507, (1 979) Haney, R 1...POSTGRADUATE SCHOOL Monterey, California DEPARTMENT OF COMPUTER SCIENCE C06FEBENCE PRESENTATIONS Bradley, G H Enerqy modelling with network optimization...Systems Analysis, Sept., 97 Bradley, G H; Brown, G G Network optimization and defense modeling Center for Nay. Analyses, Arlington, Va., Aug., 1976

Light scattering optimization of chitin random network in ultrawhite beetle scales

NASA Astrophysics Data System (ADS)

Utel, Francesco; Cortese, Lorenzo; Pattelli, Lorenzo; Burresi, Matteo; Vignolini, Silvia; Wiersma, Diederik

2017-09-01

Among the natural white colored photonics structures, a bio-system has become of great interest in the field of disordered optical media: the scale of the white beetle Chyphochilus. Despite its low thickness, on average 7 μm, and low refractive index, this beetle exhibits extreme high brightness and unique whiteness. These properties arise from the interaction of light with a complex network of chitin nano filaments embedded in the interior of the scales. As it's been recently claimed, this could be a consequence of the peculiar morphology of the filaments network that, by means of high filling fraction (0.61) and structural anisotropy, optimizes the multiple scattering of light. We therefore performed a numerical analysis on the structural properties of the chitin network in order to understand their role in the enhancement of the scale scattering intensity. Modeling the filaments as interconnected rod shaped scattering centers, we numerically generated the spatial coordinates of the network components. Controlling the quantities that are claimed to play a fundamental role in the brightness and whiteness properties of the investigated system (filling fraction and average rods orientation, i.e. the anisotropy of the ensemble of scattering centers), we obtained a set of customized random networks. FDTD simulations of light transport have been performed on these systems, observing high reflectance for all the visible frequencies and proving the implemented algorithm to numerically generate the structures is suitable to investigate the dependence of reflectance by anisotropy.

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

NASA Astrophysics Data System (ADS)

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

2013-09-01

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

Prediction of Aerodynamic Coefficients using Neural Networks for Sparse Data

NASA Technical Reports Server (NTRS)

Rajkumar, T.; Bardina, Jorge; Clancy, Daniel (Technical Monitor)

2002-01-01

Basic aerodynamic coefficients are modeled as functions of angles of attack and sideslip with vehicle lateral symmetry and compressibility effects. Most of the aerodynamic parameters can be well-fitted using polynomial functions. In this paper a fast, reliable way of predicting aerodynamic coefficients is produced using a neural network. The training data for the neural network is derived from wind tunnel test and numerical simulations. The coefficients of lift, drag, pitching moment are expressed as a function of alpha (angle of attack) and Mach number. The results produced from preliminary neural network analysis are very good.

The Use of Convolutional Neural Network in Relating Precipitation to Circulation

NASA Astrophysics Data System (ADS)

Pan, B.; Hsu, K. L.; AghaKouchak, A.; Sorooshian, S.

2017-12-01

Precipitation prediction in dynamical weather and climate models depends on 1) the predictability of pressure or geopotential height for the forecasting period and 2) the successive work of interpreting the pressure field in terms of precipitation events. The later task is represented as parameterization schemes in numerical models, where detailed computing inevitably blurs the hidden cause-and-effect relationship in precipitation generation. The "big data" provided by numerical simulation, reanalysis and observation networks requires better causation analysis for people to digest and realize their use. While classic synoptical analysis methods are very-often insufficient for spatially distributed high dimensional data, a Convolutional Neural Network(CNN) is developed here to directly relate precipitation with circulation. Case study carried over west coast United States during boreal winter showed that CNN can locate and capture key pressure zones of different structures to project precipitation spatial distribution with high accuracy across hourly to monthly scales. This direct connection between atmospheric circulation and precipitation offers a probe for attributing precipitation to the coverage, location, intensity and spatial structure of characteristic pressure zones, which can be used for model diagnosis and improvement.

Turing instability in reaction-diffusion models on complex networks

NASA Astrophysics Data System (ADS)

Ide, Yusuke; Izuhara, Hirofumi; Machida, Takuya

2016-09-01

In this paper, the Turing instability in reaction-diffusion models defined on complex networks is studied. Here, we focus on three types of models which generate complex networks, i.e. the Erdős-Rényi, the Watts-Strogatz, and the threshold network models. From analysis of the Laplacian matrices of graphs generated by these models, we numerically reveal that stable and unstable regions of a homogeneous steady state on the parameter space of two diffusion coefficients completely differ, depending on the network architecture. In addition, we theoretically discuss the stable and unstable regions in the cases of regular enhanced ring lattices which include regular circles, and networks generated by the threshold network model when the number of vertices is large enough.

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Analysis of Pull-In Instability of Geometrically Nonlinear Microbeam Using Radial Basis Artificial Neural Network Based on Couple Stress Theory

PubMed Central

Heidari, Mohammad; Heidari, Ali; Homaei, Hadi

2014-01-01

The static pull-in instability of beam-type microelectromechanical systems (MEMS) is theoretically investigated. Two engineering cases including cantilever and double cantilever microbeam are considered. Considering the midplane stretching as the source of the nonlinearity in the beam behavior, a nonlinear size-dependent Euler-Bernoulli beam model is used based on a modified couple stress theory, capable of capturing the size effect. By selecting a range of geometric parameters such as beam lengths, width, thickness, gaps, and size effect, we identify the static pull-in instability voltage. A MAPLE package is employed to solve the nonlinear differential governing equations to obtain the static pull-in instability voltage of microbeams. Radial basis function artificial neural network with two functions has been used for modeling the static pull-in instability of microcantilever beam. The network has four inputs of length, width, gap, and the ratio of height to scale parameter of beam as the independent process variables, and the output is static pull-in voltage of microbeam. Numerical data, employed for training the network, and capabilities of the model have been verified in predicting the pull-in instability behavior. The output obtained from neural network model is compared with numerical results, and the amount of relative error has been calculated. Based on this verification error, it is shown that the radial basis function of neural network has the average error of 4.55% in predicting pull-in voltage of cantilever microbeam. Further analysis of pull-in instability of beam under different input conditions has been investigated and comparison results of modeling with numerical considerations shows a good agreement, which also proves the feasibility and effectiveness of the adopted approach. The results reveal significant influences of size effect and geometric parameters on the static pull-in instability voltage of MEMS. PMID:24860602

Numerical analysis of the chimera states in the multilayered network model

NASA Astrophysics Data System (ADS)

Goremyko, Mikhail V.; Maksimenko, Vladimir A.; Makarov, Vladimir V.; Ghosh, Dibakar; Bera, Bidesh K.; Dana, Syamal K.; Hramov, Alexander E.

2017-03-01

We numerically study the interaction between the ensembles of the Hindmarsh-Rose (HR) neuron systems, arranged in the multilayer network model. We have shown that the fully identical layers, demonstrated individually different chimera due to the initial mismatch, come to the identical chimera state with the increase of inter-layer coupling. Within the multilayer model we also consider the case, when the one layer demonstrates chimera state, while another layer exhibits coherent or incoherent dynamics. It has been shown that the interactions chimera-coherent state and chimera-incoherent state leads to the both excitation of chimera as from the ensemble of fully coherent or incoherent oscillators, and suppression of initially stable chimera state

A rumor transmission model with incubation in social networks

NASA Astrophysics Data System (ADS)

Jia, Jianwen; Wu, Wenjiang

2018-02-01

In this paper, we propose a rumor transmission model with incubation period and constant recruitment in social networks. By carrying out an analysis of the model, we study the stability of rumor-free equilibrium and come to the local stable condition of the rumor equilibrium. We use the geometric approach for ordinary differential equations for showing the global stability of the rumor equilibrium. And when ℜ0 = 1, the new model occurs a transcritical bifurcation. Furthermore, numerical simulations are used to support the analysis. At last, some conclusions are presented.

Spatiotemporal Dynamics of a Network of Coupled Time-Delay Digital Tanlock Loops

NASA Astrophysics Data System (ADS)

Paul, Bishwajit; Banerjee, Tanmoy; Sarkar, B. C.

The time-delay digital tanlock loop (TDTLs) is an important class of phase-locked loop that is widely used in electronic communication systems. Although nonlinear dynamics of an isolated TDTL has been studied in the past but the collective behavior of TDTLs in a network is an important topic of research and deserves special attention as in practical communication systems separate entities are rarely isolated. In this paper, we carry out the detailed analysis and numerical simulations to explore the spatiotemporal dynamics of a network of a one-dimensional ring of coupled TDTLs with nearest neighbor coupling. The equation representing the network is derived and we carry out analytical calculations using the circulant matrix formalism to obtain the stability criteria. An extensive numerical simulation reveals that with the variation of gain parameter and coupling strength the network shows a variety of spatiotemporal dynamics such as frozen random pattern, pattern selection, spatiotemporal intermittency and fully developed spatiotemporal chaos. We map the distinct dynamical regions of the system in two-parameter space. Finally, we quantify the spatiotemporal dynamics by using quantitative measures like Lyapunov exponent and the average quadratic deviation of the full network.

2005 22nd International Symposium on Ballistics Volume 2 Wednesday

DTIC Science & Technology

2005-11-18

Information 1 Experimental and Numerical Study of the Penetration of Tungsten Carbide Into Steel Targets During High Rates of Strain John F . Moxnes...QinetiQ; Vladimir Titarev, Eleuterio Toro , Umeritek Limited The Mechanism Analysis of Interior Ballistics of Serial Chamber Gun, Dr. Sanjiu Ying, Charge...Elements and Meshless Particles, Gordon R. Johnson and Robert A. Stryk, Network Computing Services, Inc. Experimental and Numerical Study of the

Region stability analysis and tracking control of memristive recurrent neural network.

PubMed

Bao, Gang; Zeng, Zhigang; Shen, Yanjun

2018-02-01

Memristor is firstly postulated by Leon Chua and realized by Hewlett-Packard (HP) laboratory. Research results show that memristor can be used to simulate the synapses of neurons. This paper presents a class of recurrent neural network with HP memristors. Firstly, it shows that memristive recurrent neural network has more compound dynamics than the traditional recurrent neural network by simulations. Then it derives that n dimensional memristive recurrent neural network is composed of [Formula: see text] sub neural networks which do not have a common equilibrium point. By designing the tracking controller, it can make memristive neural network being convergent to the desired sub neural network. At last, two numerical examples are given to verify the validity of our result. Copyright © 2017 Elsevier Ltd. All rights reserved.

A network-analysis-based comparative study of the throughput behavior of polymer melts in barrier screw geometries

NASA Astrophysics Data System (ADS)

Aigner, M.; Köpplmayr, T.; Kneidinger, C.; Miethlinger, J.

2014-05-01

Barrier screws are widely used in the plastics industry. Due to the extreme diversity of their geometries, describing the flow behavior is difficult and rarely done in practice. We present a systematic approach based on networks that uses tensor algebra and numerical methods to model and calculate selected barrier screw geometries in terms of pressure, mass flow, and residence time. In addition, we report the results of three-dimensional simulations using the commercially available ANSYS Polyflow software. The major drawbacks of three-dimensional finite-element-method (FEM) simulations are that they require vast computational power and, large quantities of memory, and consume considerable time to create a geometric model created by computer-aided design (CAD) and complete a flow calculation. Consequently, a modified 2.5-dimensional finite volume method, termed network analysis is preferable. The results obtained by network analysis and FEM simulations correlated well. Network analysis provides an efficient alternative to complex FEM software in terms of computing power and memory consumption. Furthermore, typical barrier screw geometries can be parameterized and used for flow calculations without timeconsuming CAD-constructions.

Mean field analysis of algorithms for scale-free networks in molecular biology

PubMed Central

2017-01-01

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabási-Albert algorithm. In this paper the mean field analysis of these algorithms is reconsidered, and extended to variant and modified implementations of the algorithms. The degree sequences of scale-free networks decay according to a powerlaw distribution, namely P(k) ∼ k−γ, where γ is a scaling exponent. We derive mean field expressions for γ, and test these by numerical simulations. Generally, good agreement is obtained. We also found that some algorithms do not produce scale-free networks (for example some variant Barabási-Albert and Solé networks). PMID:29272285

Mean field analysis of algorithms for scale-free networks in molecular biology.

PubMed

Konini, S; Janse van Rensburg, E J

2017-01-01

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabási-Albert algorithm. In this paper the mean field analysis of these algorithms is reconsidered, and extended to variant and modified implementations of the algorithms. The degree sequences of scale-free networks decay according to a powerlaw distribution, namely P(k) ∼ k-γ, where γ is a scaling exponent. We derive mean field expressions for γ, and test these by numerical simulations. Generally, good agreement is obtained. We also found that some algorithms do not produce scale-free networks (for example some variant Barabási-Albert and Solé networks).

A Network Analysis of the American Library Association: Defining a Profession

ERIC Educational Resources Information Center

Battleson, Brenda L.

2010-01-01

The term "librarianship" is a generic one, suggesting one overarching discipline despite the numerous specializations and areas of research within the profession. While many disciplines use bibliometric analysis of their literature to define subfields of study within, such methods are not appropriate to librarianship due to the nature of…

Internet Data Analysis for the Undergraduate Statistics Curriculum

ERIC Educational Resources Information Center

Sanchez, Juana; He, Yan

2005-01-01

Statistics textbooks for undergraduates have not caught up with the enormous amount of analysis of Internet data that is taking place these days. Case studies that use Web server log data or Internet network traffic data are rare in undergraduate Statistics education. And yet these data provide numerous examples of skewed and bimodal…

On the linear stability of blood flow through model capillary networks.

PubMed

Davis, Jeffrey M

2014-12-01

Under the approximation that blood behaves as a continuum, a numerical implementation is presented to analyze the linear stability of capillary blood flow through model tree and honeycomb networks that are based on the microvascular structures of biological tissues. The tree network is comprised of a cascade of diverging bifurcations, in which a parent vessel bifurcates into two descendent vessels, while the honeycomb network also contains converging bifurcations, in which two parent vessels merge into one descendent vessel. At diverging bifurcations, a cell partitioning law is required to account for the nonuniform distribution of red blood cells as a function of the flow rate of blood into each descendent vessel. A linearization of the governing equations produces a system of delay differential equations involving the discharge hematocrit entering each network vessel and leads to a nonlinear eigenvalue problem. All eigenvalues in a specified region of the complex plane are captured using a transformation based on contour integrals to construct a linear eigenvalue problem with identical eigenvalues, which are then determined using a standard QR algorithm. The predicted value of the dimensionless exponent in the cell partitioning law at the instability threshold corresponds to a supercritical Hopf bifurcation in numerical simulations of the equations governing unsteady blood flow. Excellent agreement is found between the predictions of the linear stability analysis and nonlinear simulations. The relaxation of the assumption of plug flow made in previous stability analyses typically has a small, quantitative effect on the stability results that depends on the specific network structure. This implementation of the stability analysis can be applied to large networks with arbitrary structure provided only that the connectivity among the network segments is known.

Distributed Position-Based Consensus of Second-Order Multiagent Systems With Continuous/Intermittent Communication.

PubMed

Song, Qiang; Liu, Fang; Wen, Guanghui; Cao, Jinde; Yang, Xinsong

2017-04-24

This paper considers the position-based consensus in a network of agents with double-integrator dynamics and directed topology. Two types of distributed observer algorithms are proposed to solve the consensus problem by utilizing continuous and intermittent position measurements, respectively, where each observer does not interact with any other observers. For the case of continuous communication between network agents, some convergence conditions are derived for reaching consensus in the network with a single constant delay or multiple time-varying delays on the basis of the eigenvalue analysis and the descriptor method. When the network agents can only obtain intermittent position data from local neighbors at discrete time instants, the consensus in the network without time delay or with nonuniform delays is investigated by using the Wirtinger's inequality and the delayed-input approach. Numerical examples are given to illustrate the theoretical analysis.

Analog-to-digital clinical data collection on networked workstations with graphic user interface.

PubMed

Lunt, D

1991-02-01

An innovative respiratory examination system has been developed that combines physiological response measurement, real-time graphic displays, user-driven operating sequences, and networked file archiving and review into a scientific research and clinical diagnosis tool. This newly constructed computer network is being used to enhance the research center's ability to perform patient pulmonary function examinations. Respiratory data are simultaneously acquired and graphically presented during patient breathing maneuvers and rapidly transformed into graphic and numeric reports, suitable for statistical analysis or database access. The environment consists of the hardware (Macintosh computer, MacADIOS converters, analog amplifiers), the software (HyperCard v2.0, HyperTalk, XCMDs), and the network (AppleTalk, fileservers, printers) as building blocks for data acquisition, analysis, editing, and storage. System operation modules include: Calibration, Examination, Reports, On-line Help Library, Graphic/Data Editing, and Network Storage.

A Method of DTM Construction Based on Quadrangular Irregular Networks and Related Error Analysis

PubMed Central

Kang, Mengjun

2015-01-01

A new method of DTM construction based on quadrangular irregular networks (QINs) that considers all the original data points and has a topological matrix is presented. A numerical test and a real-world example are used to comparatively analyse the accuracy of QINs against classical interpolation methods and other DTM representation methods, including SPLINE, KRIGING and triangulated irregular networks (TINs). The numerical test finds that the QIN method is the second-most accurate of the four methods. In the real-world example, DTMs are constructed using QINs and the three classical interpolation methods. The results indicate that the QIN method is the most accurate method tested. The difference in accuracy rank seems to be caused by the locations of the data points sampled. Although the QIN method has drawbacks, it is an alternative method for DTM construction. PMID:25996691

A Combined Remote Sensing-Numerical Modelling Approach to the Stability Analysis of Delabole Slate Quarry, Cornwall, UK

NASA Astrophysics Data System (ADS)

Havaej, Mohsen; Coggan, John; Stead, Doug; Elmo, Davide

2016-04-01

Rock slope geometry and discontinuity properties are among the most important factors in realistic rock slope analysis yet they are often oversimplified in numerical simulations. This is primarily due to the difficulties in obtaining accurate structural and geometrical data as well as the stochastic representation of discontinuities. Recent improvements in both digital data acquisition and incorporation of discrete fracture network data into numerical modelling software have provided better tools to capture rock mass characteristics, slope geometries and digital terrain models allowing more effective modelling of rock slopes. Advantages of using improved data acquisition technology include safer and faster data collection, greater areal coverage, and accurate data geo-referencing far exceed limitations due to orientation bias and occlusion. A key benefit of a detailed point cloud dataset is the ability to measure and evaluate discontinuity characteristics such as orientation, spacing/intensity and persistence. This data can be used to develop a discrete fracture network which can be imported into the numerical simulations to study the influence of the stochastic nature of the discontinuities on the failure mechanism. We demonstrate the application of digital terrestrial photogrammetry in discontinuity characterization and distinct element simulations within a slate quarry. An accurately geo-referenced photogrammetry model is used to derive the slope geometry and to characterize geological structures. We first show how a discontinuity dataset, obtained from a photogrammetry model can be used to characterize discontinuities and to develop discrete fracture networks. A deterministic three-dimensional distinct element model is then used to investigate the effect of some key input parameters (friction angle, spacing and persistence) on the stability of the quarry slope model. Finally, adopting a stochastic approach, discrete fracture networks are used as input for 3D distinct element simulations to better understand the stochastic nature of the geological structure and its effect on the quarry slope failure mechanism. The numerical modelling results highlight the influence of discontinuity characteristics and kinematics on the slope failure mechanism and the variability in the size and shape of the failed blocks.

An optimal modeling of multidimensional wave digital filtering network for free vibration analysis of symmetrically laminated composite FSDT plates

NASA Astrophysics Data System (ADS)

Tseng, Chien-Hsun

2015-02-01

The technique of multidimensional wave digital filtering (MDWDF) that builds on traveling wave formulation of lumped electrical elements, is successfully implemented on the study of dynamic responses of symmetrically laminated composite plate based on the first order shear deformation theory. The philosophy applied for the first time in this laminate mechanics relies on integration of certain principles involving modeling and simulation, circuit theory, and MD digital signal processing to provide a great variety of outstanding features. Especially benefited by the conservation of passivity gives rise to a nonlinear programming problem (NLP) for the issue of numerical stability of a MD discrete system. Adopting the augmented Lagrangian genetic algorithm, an effective optimization technique for rapidly achieving solution spaces of NLP models, numerical stability of the MDWDF network is well received at all time by the satisfaction of the Courant-Friedrichs-Levy stability criterion with the least restriction. In particular, optimum of the NLP has led to the optimality of the network in terms of effectively and accurately predicting the desired fundamental frequency, and thus to give an insight into the robustness of the network by looking at the distribution of system energies. To further explore the application of the optimum network, more numerical examples are engaged in efforts to achieve a qualitative understanding of the behavior of the laminar system. These are carried out by investigating various effects based on different stacking sequences, stiffness and span-to-thickness ratios, mode shapes and boundary conditions. Results are scrupulously validated by cross referencing with early published works, which show that the present method is in excellent agreement with other numerical and analytical methods.

Nonrandom network connectivity comes in pairs.

PubMed

Hoffmann, Felix Z; Triesch, Jochen

2017-01-01

Overrepresentation of bidirectional connections in local cortical networks has been repeatedly reported and is a focus of the ongoing discussion of nonrandom connectivity. Here we show in a brief mathematical analysis that in a network in which connection probabilities are symmetric in pairs, P ij = P ji , the occurrences of bidirectional connections and nonrandom structures are inherently linked; an overabundance of reciprocally connected pairs emerges necessarily when some pairs of neurons are more likely to be connected than others. Our numerical results imply that such overrepresentation can also be sustained when connection probabilities are only approximately symmetric.

Advanced Models and Algorithms for Self-Similar IP Network Traffic Simulation and Performance Analysis

NASA Astrophysics Data System (ADS)

Radev, Dimitar; Lokshina, Izabella

2010-11-01

The paper examines self-similar (or fractal) properties of real communication network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. Advanced fractal models of sequentional generators and fixed-length sequence generators, and efficient algorithms that are used to simulate self-similar behavior of IP network traffic data are developed and applied. Numerical examples are provided; and simulation results are obtained and analyzed.

Neural network for solving convex quadratic bilevel programming problems.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

2014-03-01

In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

Stability analysis of fractional-order Hopfield neural networks with time delays.

PubMed

Wang, Hu; Yu, Yongguang; Wen, Guoguang

2014-07-01

This paper investigates the stability for fractional-order Hopfield neural networks with time delays. Firstly, the fractional-order Hopfield neural networks with hub structure and time delays are studied. Some sufficient conditions for stability of the systems are obtained. Next, two fractional-order Hopfield neural networks with different ring structures and time delays are developed. By studying the developed neural networks, the corresponding sufficient conditions for stability of the systems are also derived. It is shown that the stability conditions are independent of time delays. Finally, numerical simulations are given to illustrate the effectiveness of the theoretical results obtained in this paper. Copyright © 2014 Elsevier Ltd. All rights reserved.

Fluid Transient Analysis during Priming of Evacuated Line

NASA Technical Reports Server (NTRS)

Bandyopadhyay, Alak; Majumdar, Alok K.; Holt, Kimberley

2017-01-01

Water hammer analysis in pipe lines, in particularly during priming into evacuated lines is important for the design of spacecraft and other in-space application. In the current study, a finite volume network flow analysis code is used for modeling three different geometrical configurations: the first two being straight pipe, one with atmospheric air and other with evacuated line, and the third case is a representation of a complex flow network system. The numerical results show very good agreement qualitatively and quantitatively with measured data available in the literature. The peak pressure and impact time in case of straight pipe priming in evacuated line shows excellent agreement.

The Global Oscillation Network Group site survey, 2: Results

NASA Technical Reports Server (NTRS)

Hill, Frank; Fischer, George; Forgach, Suzanne; Grier, Jennifer; Leibacher, John W.; Jones, Harrison P.; Jones, Patricia B.; Kupke, Renate; Stebbins, Robin T.; Clay, Donald W.

1994-01-01

The Global Oscillation Network Group (GONG) Project will place a network of instruments around the world to observe solar oscillations as continuously as possible for three years. The Project has now chosen the six network sites based on analysis of survey data from fifteen sites around the world. The chosen sites are: Big Bear Solar Observatory, California; Mauna Loa Solar Observatory, Hawaii; Learmonth Solar Observatory, Australia; Udaipur Solar Observatory, India; Observatorio del Teide, Tenerife; and Cerro Tololo Interamerican Observatory, Chile. Total solar intensity at each site yields information on local cloud cover, extinction coefficient, and transparency fluctuations. In addition, the performance of 192 reasonable networks assembled from the individual site records is compared using a statistical principal components analysis. An accompanying paper descibes the analysis methods in detail; here we present the results of both the network and individual site analyses. The selected network has a duty cycle of 93.3%, in good agreement with numerical simulations. The power spectrum of the network observing window shows a first diurnal sidelobe height of 3 x 10(exp -4) with respect to the central component, an improvement of a factor of 1300 over a single site. The background level of the network spectrum is lower by a factor of 50 compared to a single-site spectrum.

Golden Ratio Genetic Algorithm Based Approach for Modelling and Analysis of the Capacity Expansion of Urban Road Traffic Network

PubMed Central

Zhang, Lun; Zhang, Meng; Yang, Wenchen; Dong, Decun

2015-01-01

This paper presents the modelling and analysis of the capacity expansion of urban road traffic network (ICURTN). Thebilevel programming model is first employed to model the ICURTN, in which the utility of the entire network is maximized with the optimal utility of travelers' route choice. Then, an improved hybrid genetic algorithm integrated with golden ratio (HGAGR) is developed to enhance the local search of simple genetic algorithms, and the proposed capacity expansion model is solved by the combination of the HGAGR and the Frank-Wolfe algorithm. Taking the traditional one-way network and bidirectional network as the study case, three numerical calculations are conducted to validate the presented model and algorithm, and the primary influencing factors on extended capacity model are analyzed. The calculation results indicate that capacity expansion of road network is an effective measure to enlarge the capacity of urban road network, especially on the condition of limited construction budget; the average computation time of the HGAGR is 122 seconds, which meets the real-time demand in the evaluation of the road network capacity. PMID:25802512

Experimental Modal Analysis and Dynaic Strain Fiber Bragg Gratings for Structural Health Monitoring of Composite Aerospace Structures

NASA Astrophysics Data System (ADS)

Panopoulou, A.; Fransen, S.; Gomez Molinero, V.; Kostopoulos, V.

2012-07-01

The objective of this work is to develop a new structural health monitoring system for composite aerospace structures based on dynamic response strain measurements and experimental modal analysis techniques. Fibre Bragg Grating (FBG) optical sensors were used for monitoring the dynamic response of the composite structure. The structural dynamic behaviour has been numerically simulated and experimentally verified by means of vibration testing. The hypothesis of all vibration tests was that actual damage in composites reduces their stiffness and produces the same result as mass increase produces. Thus, damage was simulated by slightly varying locally the mass of the structure at different zones. Experimental modal analysis based on the strain responses was conducted and the extracted strain mode shapes were the input for the damage detection expert system. A feed-forward back propagation neural network was the core of the damage detection system. The features-input to the neural network consisted of the strain mode shapes, extracted from the experimental modal analysis. Dedicated training and validation activities were carried out based on the experimental results. The system showed high reliability, confirmed by the ability of the neural network to recognize the size and the position of damage on the structure. The experiments were performed on a real structure i.e. a lightweight antenna sub- reflector, manufactured and tested at EADS CASA ESPACIO. An integrated FBG sensor network, based on the advantage of multiplexing, was mounted on the structure with optimum topology. Numerical simulation of both structures was used as a support tool at all the steps of the work. Potential applications for the proposed system are during ground qualification extensive tests of space structures and during the mission as modal analysis tool on board, being able via the FBG responses to identify a potential failure.

Numerical linear algebra in data mining

NASA Astrophysics Data System (ADS)

Eldén, Lars

Ideas and algorithms from numerical linear algebra are important in several areas of data mining. We give an overview of linear algebra methods in text mining (information retrieval), pattern recognition (classification of handwritten digits), and PageRank computations for web search engines. The emphasis is on rank reduction as a method of extracting information from a data matrix, low-rank approximation of matrices using the singular value decomposition and clustering, and on eigenvalue methods for network analysis.

Dense module enumeration in biological networks

NASA Astrophysics Data System (ADS)

Tsuda, Koji; Georgii, Elisabeth

2009-12-01

Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.

Stability and stabilisation of a class of networked dynamic systems

NASA Astrophysics Data System (ADS)

Liu, H. B.; Wang, D. Q.

2018-04-01

We investigate the stability and stabilisation of a linear time invariant networked heterogeneous system with arbitrarily connected subsystems. A new linear matrix inequality based sufficient and necessary condition for the stability is derived, based on which the stabilisation is provided. The obtained conditions efficiently utilise the block-diagonal characteristic of system parameter matrices and the sparseness of subsystem connection matrix. Moreover, a sufficient condition only dependent on each individual subsystem is also presented for the stabilisation of the networked systems with a large scale. Numerical simulations show that these conditions are computationally valid in the analysis and synthesis of a large-scale networked system.

Entanglement distribution in star network based on spin chain in diamond

NASA Astrophysics Data System (ADS)

Zhu, Yuan-Ming; Ma, Lei

2018-06-01

After star network of spins was proposed, generating entanglement directly through spin interactions between distant parties became possible. We propose an architecture which involves coupled spin chains based on nitrogen-vacancy centers and nitrogen defect spins to expand star network. The numerical analysis shows that the maximally achievable entanglement Em exponentially decays with the length of spin chains M and spin noise. The entanglement capability of this configuration under the effect of disorder and spin loss is also studied. Moreover, it is shown that with this kind of architecture, star network of spins is feasible in measurement of magnetic-field gradient.

New results on global exponential dissipativity analysis of memristive inertial neural networks with distributed time-varying delays.

PubMed

Zhang, Guodong; Zeng, Zhigang; Hu, Junhao

2018-01-01

This paper is concerned with the global exponential dissipativity of memristive inertial neural networks with discrete and distributed time-varying delays. By constructing appropriate Lyapunov-Krasovskii functionals, some new sufficient conditions ensuring global exponential dissipativity of memristive inertial neural networks are derived. Moreover, the globally exponential attractive sets and positive invariant sets are also presented here. In addition, the new proposed results here complement and extend the earlier publications on conventional or memristive neural network dynamical systems. Finally, numerical simulations are given to illustrate the effectiveness of obtained results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

NASA Astrophysics Data System (ADS)

Wang, Ting; Plecháč, Petr

2017-12-01

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.

A key heterogeneous structure of fractal networks based on inverse renormalization scheme

NASA Astrophysics Data System (ADS)

Bai, Yanan; Huang, Ning; Sun, Lina

2018-06-01

Self-similarity property of complex networks was found by the application of renormalization group theory. Based on this theory, network topologies can be classified into universality classes in the space of configurations. In return, through inverse renormalization scheme, a given primitive structure can grow into a pure fractal network, then adding different types of shortcuts, it exhibits different characteristics of complex networks. However, the effect of primitive structure on networks structural property has received less attention. In this paper, we introduce a degree variance index to measure the dispersion of nodes degree in the primitive structure, and investigate the effect of the primitive structure on network structural property quantified by network efficiency. Numerical simulations and theoretical analysis show a primitive structure is a key heterogeneous structure of generated networks based on inverse renormalization scheme, whether or not adding shortcuts, and the network efficiency is positively correlated with degree variance of the primitive structure.

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

PubMed

Liang, Xiaoming; Liu, Zonghua; Li, Baowen

2009-10-01

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

Dynamical analysis of continuous higher-order hopfield networks for combinatorial optimization.

PubMed

Atencia, Miguel; Joya, Gonzalo; Sandoval, Francisco

2005-08-01

In this letter, the ability of higher-order Hopfield networks to solve combinatorial optimization problems is assessed by means of a rigorous analysis of their properties. The stability of the continuous network is almost completely clarified: (1) hyperbolic interior equilibria, which are unfeasible, are unstable; (2) the state cannot escape from the unitary hypercube; and (3) a Lyapunov function exists. Numerical methods used to implement the continuous equation on a computer should be designed with the aim of preserving these favorable properties. The case of nonhyperbolic fixed points, which occur when the Hessian of the target function is the null matrix, requires further study. We prove that these nonhyperbolic interior fixed points are unstable in networks with three neurons and order two. The conjecture that interior equilibria are unstable in the general case is left open.

Improved result on stability analysis of discrete stochastic neural networks with time delay

NASA Astrophysics Data System (ADS)

Wu, Zhengguang; Su, Hongye; Chu, Jian; Zhou, Wuneng

2009-04-01

This Letter investigates the problem of exponential stability for discrete stochastic time-delay neural networks. By defining a novel Lyapunov functional, an improved delay-dependent exponential stability criterion is established in terms of linear matrix inequality (LMI) approach. Meanwhile, the computational complexity of the newly established stability condition is reduced because less variables are involved. Numerical example is given to illustrate the effectiveness and the benefits of the proposed method.

Finite-time stability of neutral-type neural networks with random time-varying delays

NASA Astrophysics Data System (ADS)

Ali, M. Syed; Saravanan, S.; Zhu, Quanxin

2017-11-01

This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.

Activity in the fronto-parietal network indicates numerical inductive reasoning beyond calculation: An fMRI study combined with a cognitive model

PubMed Central

Liang, Peipeng; Jia, Xiuqin; Taatgen, Niels A.; Borst, Jelmer P.; Li, Kuncheng

2016-01-01

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification is critical and unique to reasoning. Previous studies have established the central role of the fronto-parietal network for relational integration during rule identification in numerical inductive reasoning. The current question of interest is whether numerical inductive reasoning exclusively corresponds to calculation or operates beyond calculation, and whether it is possible to distinguish between them based on the activity pattern in the fronto-parietal network. To directly address this issue, three types of problems were created: numerical inductive reasoning, calculation, and perceptual judgment. Our results showed that the fronto-parietal network was more active in numerical inductive reasoning which requires more exchanges between intermediate representations and long-term declarative knowledge during rule identification. These results survived even after controlling for the covariates of response time and error rate. A computational cognitive model was developed using the cognitive architecture ACT-R to account for the behavioral results and brain activity in the fronto-parietal network. PMID:27193284

Activity in the fronto-parietal network indicates numerical inductive reasoning beyond calculation: An fMRI study combined with a cognitive model.

PubMed

Liang, Peipeng; Jia, Xiuqin; Taatgen, Niels A; Borst, Jelmer P; Li, Kuncheng

2016-05-19

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification is critical and unique to reasoning. Previous studies have established the central role of the fronto-parietal network for relational integration during rule identification in numerical inductive reasoning. The current question of interest is whether numerical inductive reasoning exclusively corresponds to calculation or operates beyond calculation, and whether it is possible to distinguish between them based on the activity pattern in the fronto-parietal network. To directly address this issue, three types of problems were created: numerical inductive reasoning, calculation, and perceptual judgment. Our results showed that the fronto-parietal network was more active in numerical inductive reasoning which requires more exchanges between intermediate representations and long-term declarative knowledge during rule identification. These results survived even after controlling for the covariates of response time and error rate. A computational cognitive model was developed using the cognitive architecture ACT-R to account for the behavioral results and brain activity in the fronto-parietal network.

Stability and Hopf bifurcation in a simplified BAM neural network with two time delays.

PubMed

Cao, Jinde; Xiao, Min

2007-03-01

Various local periodic solutions may represent different classes of storage patterns or memory patterns, and arise from the different equilibrium points of neural networks (NNs) by applying Hopf bifurcation technique. In this paper, a bidirectional associative memory NN with four neurons and multiple delays is considered. By applying the normal form theory and the center manifold theorem, analysis of its linear stability and Hopf bifurcation is performed. An algorithm is worked out for determining the direction and stability of the bifurcated periodic solutions. Numerical simulation results supporting the theoretical analysis are also given.

Investigation into the use of satellite remote sensing data products as part of a multi-modal marine environmental monitoring network

NASA Astrophysics Data System (ADS)

O'Connor, Edel; Smeaton, Alan F.; O'Connor, Noel E.; Regan, Fiona

2012-09-01

In this paper it is investigated how conventional in-situ sensor networks can be complemented by the satellite data streams available through numerous platforms orbiting the earth and the combined analyses products available through services such as MyOcean. Despite the numerous benefits associated with the use of satellite remote sensing data products, there are a number of limitations with their use in coastal zones. Here the ability of these data sources to provide contextual awareness, redundancy and increased efficiency to an in-situ sensor network is investigated. The potential use of a variety of chlorophyll and SST data products as additional data sources in the SmartBay monitoring network in Galway Bay, Ireland is analysed. The ultimate goal is to investigate the ability of these products to create a smarter marine monitoring network with increased efficiency. Overall it was found that while care needs to be taken in choosing these products, there was extremely promising performance from a number of these products that would be suitable in the context of a number of applications especially in relation to SST. It was more difficult to come to conclusive results for the chlorophyll analysis.

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.

An alpha-numeric code for representing N-linked glycan structures in secreted glycoproteins.

PubMed

Yusufi, Faraaz Noor Khan; Park, Wonjun; Lee, May May; Lee, Dong-Yup

2009-01-01

Advances in high-throughput techniques have led to the creation of increasing amounts of glycome data. The storage and analysis of this data would benefit greatly from a compact notation for describing glycan structures that can be easily stored and interpreted by computers. Towards this end, we propose a fixed-length alpha-numeric code for representing N-linked glycan structures commonly found in secreted glycoproteins from mammalian cell cultures. This code, GlycoDigit, employs a pre-assigned alpha-numeric index to represent the monosaccharides attached in different branches to the core glycan structure. The present branch-centric representation allows us to visualize the structure while the numerical nature of the code makes it machine readable. In addition, a difference operator can be defined to quantitatively differentiate between glycan structures for further analysis. The usefulness and applicability of GlycoDigit were demonstrated by constructing and visualizing an N-linked glycosylation network.

Emulation of reionization simulations for Bayesian inference of astrophysics parameters using neural networks

NASA Astrophysics Data System (ADS)

Schmit, C. J.; Pritchard, J. R.

2018-03-01

Next generation radio experiments such as LOFAR, HERA, and SKA are expected to probe the Epoch of Reionization (EoR) and claim a first direct detection of the cosmic 21cm signal within the next decade. Data volumes will be enormous and can thus potentially revolutionize our understanding of the early Universe and galaxy formation. However, numerical modelling of the EoR can be prohibitively expensive for Bayesian parameter inference and how to optimally extract information from incoming data is currently unclear. Emulation techniques for fast model evaluations have recently been proposed as a way to bypass costly simulations. We consider the use of artificial neural networks as a blind emulation technique. We study the impact of training duration and training set size on the quality of the network prediction and the resulting best-fitting values of a parameter search. A direct comparison is drawn between our emulation technique and an equivalent analysis using 21CMMC. We find good predictive capabilities of our network using training sets of as low as 100 model evaluations, which is within the capabilities of fully numerical radiative transfer codes.

Dynamics of functional failures and recovery in complex road networks

NASA Astrophysics Data System (ADS)

Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.

2017-11-01

We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

Predicting missing links and identifying spurious links via likelihood analysis

NASA Astrophysics Data System (ADS)

Pan, Liming; Zhou, Tao; Lü, Linyuan; Hu, Chin-Kun

2016-03-01

Real network data is often incomplete and noisy, where link prediction algorithms and spurious link identification algorithms can be applied. Thus far, it lacks a general method to transform network organizing mechanisms to link prediction algorithms. Here we use an algorithmic framework where a network’s probability is calculated according to a predefined structural Hamiltonian that takes into account the network organizing principles, and a non-observed link is scored by the conditional probability of adding the link to the observed network. Extensive numerical simulations show that the proposed algorithm has remarkably higher accuracy than the state-of-the-art methods in uncovering missing links and identifying spurious links in many complex biological and social networks. Such method also finds applications in exploring the underlying network evolutionary mechanisms.

Predicting missing links and identifying spurious links via likelihood analysis

PubMed Central

Pan, Liming; Zhou, Tao; Lü, Linyuan; Hu, Chin-Kun

2016-01-01

Real network data is often incomplete and noisy, where link prediction algorithms and spurious link identification algorithms can be applied. Thus far, it lacks a general method to transform network organizing mechanisms to link prediction algorithms. Here we use an algorithmic framework where a network’s probability is calculated according to a predefined structural Hamiltonian that takes into account the network organizing principles, and a non-observed link is scored by the conditional probability of adding the link to the observed network. Extensive numerical simulations show that the proposed algorithm has remarkably higher accuracy than the state-of-the-art methods in uncovering missing links and identifying spurious links in many complex biological and social networks. Such method also finds applications in exploring the underlying network evolutionary mechanisms. PMID:26961965

Numerical Simulation of Sickle Cell Blood Flow in the Microcirculation

NASA Astrophysics Data System (ADS)

Berger, Stanley A.; Carlson, Brian E.

2001-11-01

A numerical simulation of normal and sickle cell blood flow through the transverse arteriole-capillary microcirculation is carried out to model the dominant mechanisms involved in the onset of vascular stasis in sickle cell disease. The transverse arteriole-capillary network is described by Strahler's network branching method, and the oxygen and blood transport in the capillaries is modeled by a Krogh cylinder analysis utilizing Lighthill's lubrication theory, as developed by Berger and King. Poiseuille's law is used to represent blood flow in the arterioles. Applying this flow and transport model and utilizing volumetric flow continuity at each network bifurcation, a nonlinear system of equations is obtained, which is solved iteratively using a steepest descent algorithm coupled with a Newton solver. Ten different networks are generated and flow results are calculated for normal blood and sickle cell blood without and with precapillary oxygen loss. We find that total volumetric blood flow through the network is greater in the two sickle cell blood simulations than for normal blood owing to the anemia associated with sickle cell disease. The percentage of capillary blockage in the network increases dramatically with decreasing pressure drop across the network in the sickle cell cases while there is no blockage when normal blood flows through simulated networks. It is concluded that, in sickle cell disease, without any vasomotor dilation response to decreasing oxygen concentrations in the blood, capillary blockage will occur in the microvasculature even at average pressure drops across the transverse arteriole-capillary networks.

The social network of international health aid.

PubMed

Han, Lu; Koenig-Archibugi, Mathias; Opsahl, Tore

2018-06-01

International development assistance for health generates an emergent social network in which policy makers in recipient countries are connected to numerous bilateral and multilateral aid agencies and to other aid recipients. Ties in this global network are channels for the transmission of knowledge, norms and influence in addition to material resources, and policy makers in centrally situated governments receive information faster and are exposed to a more diverse range of sources and perspectives. Since diversity of perspectives improves problem-solving capacity, the structural position of aid-receiving governments in the health aid network can affect the health outcomes that those governments are able to attain. We apply a recently developed Social Network Analysis measure to health aid data for 1990-2010 to investigate the relationship between country centrality in the health aid network and improvements in child health. A generalized method of moments (GMM) analysis indicates that, controlling for the volume of health aid and other factors, higher centrality in the health aid network is associated with better child survival rates in a sample of 110 low and middle income countries. Copyright © 2018 Elsevier Ltd. All rights reserved.

A DNA network as an information processing system.

PubMed

Santini, Cristina Costa; Bath, Jonathan; Turberfield, Andrew J; Tyrrell, Andy M

2012-01-01

Biomolecular systems that can process information are sought for computational applications, because of their potential for parallelism and miniaturization and because their biocompatibility also makes them suitable for future biomedical applications. DNA has been used to design machines, motors, finite automata, logic gates, reaction networks and logic programs, amongst many other structures and dynamic behaviours. Here we design and program a synthetic DNA network to implement computational paradigms abstracted from cellular regulatory networks. These show information processing properties that are desirable in artificial, engineered molecular systems, including robustness of the output in relation to different sources of variation. We show the results of numerical simulations of the dynamic behaviour of the network and preliminary experimental analysis of its main components.

On Extended Dissipativity of Discrete-Time Neural Networks With Time Delay.

PubMed

Feng, Zhiguang; Zheng, Wei Xing

2015-12-01

In this brief, the problem of extended dissipativity analysis for discrete-time neural networks with time-varying delay is investigated. The definition of extended dissipativity of discrete-time neural networks is proposed, which unifies several performance measures, such as the H∞ performance, passivity, l2 - l∞ performance, and dissipativity. By introducing a triple-summable term in Lyapunov function, the reciprocally convex approach is utilized to bound the forward difference of the triple-summable term and then the extended dissipativity criterion for discrete-time neural networks with time-varying delay is established. The derived condition guarantees not only the extended dissipativity but also the stability of the neural networks. Two numerical examples are given to demonstrate the reduced conservatism and effectiveness of the obtained results.

Epidemic spread on interconnected metapopulation networks

NASA Astrophysics Data System (ADS)

Wang, Bing; Tanaka, Gouhei; Suzuki, Hideyuki; Aihara, Kazuyuki

2014-09-01

Numerous real-world networks have been observed to interact with each other, resulting in interconnected networks that exhibit diverse, nontrivial behavior with dynamical processes. Here we investigate epidemic spreading on interconnected networks at the level of metapopulation. Through a mean-field approximation for a metapopulation model, we find that both the interaction network topology and the mobility probabilities between subnetworks jointly influence the epidemic spread. Depending on the interaction between subnetworks, proper controls of mobility can efficiently mitigate epidemics, whereas an extremely biased mobility to one subnetwork will typically cause a severe outbreak and promote the epidemic spreading. Our analysis provides a basic framework for better understanding of epidemic behavior in related transportation systems as well as for better control of epidemics by guiding human mobility patterns.

Coupled Hydro-mechanical process of natural fracture network formation in sedimentary basin

NASA Astrophysics Data System (ADS)

Ouraga, zady; Guy, Nicolas; Pouya, amade

2017-04-01

In sedimentary basin numerous phenomenon depending on the geological time span and its history can lead to a decrease in effective stress and therefore result in fracture initiation. Thus, during its formation, under certain conditions, natural fracturing and fracture network formation can occur in various context such as under erosion, tectonic loading and the compaction disequilibrium due to significant sedimentation rate. In this work, natural fracture network and fracture spacing induced by significant sedimentation rate is studied considering mode I fracture propagation, using a coupled hydro-mechanical numerical methods. Assumption of vertical fracture can be considered as a relevant hypothesis in our case of low ratio of horizontal total stress to vertical stress. A particular emphasis is put on synthetic geological structure on which a constant sedimentation rate is imposed on its top. This synthetic geological structure contains defects initially closed and homogeneously distributed. The Fractures are modeled with a constitutive model undergoing damage and the flow is described by poiseuille's law. The damage parameter affects both the mechanical and the hydraulic opening of the fracture. For the numerical simulations, the code Porofis based on finite element modeling is used, fractures are taken into account by cohesive model and the flow is described by Poiseuille's law. The effect of several parameters is also studied and the analysis lead to a fracture network and fracture spacing criterion for basin modeling.

Dynamic stability analysis of fractional order leaky integrator echo state neural networks

NASA Astrophysics Data System (ADS)

Pahnehkolaei, Seyed Mehdi Abedi; Alfi, Alireza; Tenreiro Machado, J. A.

2017-06-01

The Leaky integrator echo state neural network (Leaky-ESN) is an improved model of the recurrent neural network (RNN) and adopts an interconnected recurrent grid of processing neurons. This paper presents a new proof for the convergence of a Lyapunov candidate function to zero when time tends to infinity by means of the Caputo fractional derivative with order lying in the range (0, 1). The stability of Fractional-Order Leaky-ESN (FO Leaky-ESN) is then analyzed, and the existence, uniqueness and stability of the equilibrium point are provided. A numerical example demonstrates the feasibility of the proposed method.

Blocking performance approximation in flexi-grid networks

NASA Astrophysics Data System (ADS)

Ge, Fei; Tan, Liansheng

2016-12-01

The blocking probability to the path requests is an important issue in flexible bandwidth optical communications. In this paper, we propose a blocking probability approximation method of path requests in flexi-grid networks. It models the bundled neighboring carrier allocation with a group of birth-death processes and provides a theoretical analysis to the blocking probability under variable bandwidth traffic. The numerical results show the effect of traffic parameters to the blocking probability of path requests. We use the first fit algorithm in network nodes to allocate neighboring carriers to path requests in simulations, and verify approximation results.

Generalized epidemic process on modular networks.

PubMed

Chung, Kihong; Baek, Yongjoo; Kim, Daniel; Ha, Meesoon; Jeong, Hawoong

2014-05-01

Social reinforcement and modular structure are two salient features observed in the spreading of behavior through social contacts. In order to investigate the interplay between these two features, we study the generalized epidemic process on modular networks with equal-sized finite communities and adjustable modularity. Using the analytical approach originally applied to clique-based random networks, we show that the system exhibits a bond-percolation type continuous phase transition for weak social reinforcement, whereas a discontinuous phase transition occurs for sufficiently strong social reinforcement. Our findings are numerically verified using the finite-size scaling analysis and the crossings of the bimodality coefficient.

LMI-based approach to stability analysis for fractional-order neural networks with discrete and distributed delays

NASA Astrophysics Data System (ADS)

Zhang, Hai; Ye, Renyu; Liu, Song; Cao, Jinde; Alsaedi, Ahmad; Li, Xiaodi

2018-02-01

This paper is concerned with the asymptotic stability of the Riemann-Liouville fractional-order neural networks with discrete and distributed delays. By constructing a suitable Lyapunov functional, two sufficient conditions are derived to ensure that the addressed neural network is asymptotically stable. The presented stability criteria are described in terms of the linear matrix inequalities. The advantage of the proposed method is that one may avoid calculating the fractional-order derivative of the Lyapunov functional. Finally, a numerical example is given to show the validity and feasibility of the theoretical results.

Effects of biases in domain wall network evolution. II. Quantitative analysis

NASA Astrophysics Data System (ADS)

Correia, J. R. C. C. C.; Leite, I. S. C. R.; Martins, C. J. A. P.

2018-04-01

Domain walls form at phase transitions which break discrete symmetries. In a cosmological context, they often overclose the Universe (contrary to observational evidence), although one may prevent this by introducing biases or forcing anisotropic evolution of the walls. In a previous work [Correia et al., Phys. Rev. D 90, 023521 (2014), 10.1103/PhysRevD.90.023521], we numerically studied the evolution of various types of biased domain wall networks in the early Universe, confirming that anisotropic networks ultimately reach scaling while those with a biased potential or biased initial conditions decay. We also found that the analytic decay law obtained by Hindmarsh was in good agreement with simulations of biased potentials, but not of biased initial conditions, and suggested that the difference was related to the Gaussian approximation underlying the analytic law. Here, we extend our previous work in several ways. For the cases of biased potential and biased initial conditions, we study in detail the field distributions in the simulations, confirming that the validity (or not) of the Gaussian approximation is the key difference between the two cases. For anisotropic walls, we carry out a more extensive set of numerical simulations and compare them to the canonical velocity-dependent one-scale model for domain walls, finding that the model accurately predicts the linear scaling regime after isotropization. Overall, our analysis provides a quantitative description of the cosmological evolution of these networks.

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

PubMed

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

2008-12-01

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

Transition Characteristic Analysis of Traffic Evolution Process for Urban Traffic Network

PubMed Central

Chen, Hong; Li, Yang

2014-01-01

The characterization of the dynamics of traffic states remains fundamental to seeking for the solutions of diverse traffic problems. To gain more insights into traffic dynamics in the temporal domain, this paper explored temporal characteristics and distinct regularity in the traffic evolution process of urban traffic network. We defined traffic state pattern through clustering multidimensional traffic time series using self-organizing maps and construct a pattern transition network model that is appropriate for representing and analyzing the evolution progress. The methodology is illustrated by an application to data flow rate of multiple road sections from Network of Shenzhen's Nanshan District, China. Analysis and numerical results demonstrated that the methodology permits extracting many useful traffic transition characteristics including stability, preference, activity, and attractiveness. In addition, more information about the relationships between these characteristics was extracted, which should be helpful in understanding the complex behavior of the temporal evolution features of traffic patterns. PMID:24982969

Dissipativity and stability analysis of fractional-order complex-valued neural networks with time delay.

PubMed

Velmurugan, G; Rakkiyappan, R; Vembarasan, V; Cao, Jinde; Alsaedi, Ahmed

2017-02-01

As we know, the notion of dissipativity is an important dynamical property of neural networks. Thus, the analysis of dissipativity of neural networks with time delay is becoming more and more important in the research field. In this paper, the authors establish a class of fractional-order complex-valued neural networks (FCVNNs) with time delay, and intensively study the problem of dissipativity, as well as global asymptotic stability of the considered FCVNNs with time delay. Based on the fractional Halanay inequality and suitable Lyapunov functions, some new sufficient conditions are obtained that guarantee the dissipativity of FCVNNs with time delay. Moreover, some sufficient conditions are derived in order to ensure the global asymptotic stability of the addressed FCVNNs with time delay. Finally, two numerical simulations are posed to ensure that the attention of our main results are valuable. Copyright © 2016 Elsevier Ltd. All rights reserved.

The use of network analysis to study complex animal communication systems: a study on nightingale song.

PubMed

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-06-22

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the 'small-world' character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval.

The use of network analysis to study complex animal communication systems: a study on nightingale song

PubMed Central

Weiss, Michael; Hultsch, Henrike; Adam, Iris; Scharff, Constance; Kipper, Silke

2014-01-01

The singing of song birds can form complex signal systems comprised of numerous subunits sung with distinct combinatorial properties that have been described as syntax-like. This complexity has inspired inquiries into similarities of bird song to human language; but the quantitative analysis and description of song sequences is a challenging task. In this study, we analysed song sequences of common nightingales (Luscinia megarhynchos) by means of a network analysis. We translated long nocturnal song sequences into networks of song types with song transitions as connectors. As network measures, we calculated shortest path length and transitivity and identified the ‘small-world’ character of nightingale song networks. Besides comparing network measures with conventional measures of song complexity, we also found a correlation between network measures and age of birds. Furthermore, we determined the numbers of in-coming and out-going edges of each song type, characterizing transition patterns. These transition patterns were shared across males for certain song types. Playbacks with different transition patterns provided first evidence that these patterns are responded to differently and thus play a role in singing interactions. We discuss potential functions of the network properties of song sequences in the framework of vocal leadership. Network approaches provide biologically meaningful parameters to describe the song structure of species with extremely large repertoires and complex rules of song retrieval. PMID:24807258

Optimization of deformation monitoring networks using finite element strain analysis

NASA Astrophysics Data System (ADS)

Alizadeh-Khameneh, M. Amin; Eshagh, Mehdi; Jensen, Anna B. O.

2018-04-01

An optimal design of a geodetic network can fulfill the requested precision and reliability of the network, and decrease the expenses of its execution by removing unnecessary observations. The role of an optimal design is highlighted in deformation monitoring network due to the repeatability of these networks. The core design problem is how to define precision and reliability criteria. This paper proposes a solution, where the precision criterion is defined based on the precision of deformation parameters, i. e. precision of strain and differential rotations. A strain analysis can be performed to obtain some information about the possible deformation of a deformable object. In this study, we split an area into a number of three-dimensional finite elements with the help of the Delaunay triangulation and performed the strain analysis on each element. According to the obtained precision of deformation parameters in each element, the precision criterion of displacement detection at each network point is then determined. The developed criterion is implemented to optimize the observations from the Global Positioning System (GPS) in Skåne monitoring network in Sweden. The network was established in 1989 and straddled the Tornquist zone, which is one of the most active faults in southern Sweden. The numerical results show that 17 out of all 21 possible GPS baseline observations are sufficient to detect minimum 3 mm displacement at each network point.

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks

PubMed Central

Hammad, Karim; El Bakly, Ahmed M.

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem—subject to various Quality-of-Service (QoS) constraints—represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms. PMID:29509760

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks.

PubMed

Ramadan, Rahab M; Gasser, Safa M; El-Mahallawy, Mohamed S; Hammad, Karim; El Bakly, Ahmed M

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

Epidemic spreading in time-varying community networks.

PubMed

Ren, Guangming; Wang, Xingyuan

2014-06-01

The spreading processes of many infectious diseases have comparable time scale as the network evolution. Here, we present a simple networks model with time-varying community structure, and investigate susceptible-infected-susceptible epidemic spreading processes in this model. By both theoretic analysis and numerical simulations, we show that the efficiency of epidemic spreading in this model depends intensively on the mobility rate q of the individuals among communities. We also find that there exists a mobility rate threshold qc. The epidemic will survive when q > qc and die when q < qc. These results can help understanding the impacts of human travel on the epidemic spreading in complex networks with community structure.

Pinning synchronization of memristor-based neural networks with time-varying delays.

PubMed

Yang, Zhanyu; Luo, Biao; Liu, Derong; Li, Yueheng

2017-09-01

In this paper, the synchronization of memristor-based neural networks with time-varying delays via pinning control is investigated. A novel pinning method is introduced to synchronize two memristor-based neural networks which denote drive system and response system, respectively. The dynamics are studied by theories of differential inclusions and nonsmooth analysis. In addition, some sufficient conditions are derived to guarantee asymptotic synchronization and exponential synchronization of memristor-based neural networks via the presented pinning control. Furthermore, some improvements about the proposed control method are also discussed in this paper. Finally, the effectiveness of the obtained results is demonstrated by numerical simulations. Copyright © 2017 Elsevier Ltd. All rights reserved.

Boundedness and global robust stability analysis of delayed complex-valued neural networks with interval parameter uncertainties.

PubMed

Song, Qiankun; Yu, Qinqin; Zhao, Zhenjiang; Liu, Yurong; Alsaadi, Fuad E

2018-07-01

In this paper, the boundedness and robust stability for a class of delayed complex-valued neural networks with interval parameter uncertainties are investigated. By using Homomorphic mapping theorem, Lyapunov method and inequality techniques, sufficient condition to guarantee the boundedness of networks and the existence, uniqueness and global robust stability of equilibrium point is derived for the considered uncertain neural networks. The obtained robust stability criterion is expressed in complex-valued LMI, which can be calculated numerically using YALMIP with solver of SDPT3 in MATLAB. An example with simulations is supplied to show the applicability and advantages of the acquired result. Copyright © 2018 Elsevier Ltd. All rights reserved.

Investigating Trigonometric Representations in the Transition to College Mathematics

ERIC Educational Resources Information Center

Byers, Patricia

2010-01-01

This Ontario-based qualitative study examined secondary school and college textbooks' treatment of trigonometric representations in order to identify potential sources of student difficulties in the transition from secondary school to college mathematics. Analysis of networks, comprised of trigonometric representations, identified numerous issues…

The impact of competing zealots on opinion dynamics

NASA Astrophysics Data System (ADS)

Verma, Gunjan; Swami, Ananthram; Chan, Kevin

2014-02-01

An individual’s opinion on an issue is greatly impacted by others in his or her social network. Most people are open-minded and ready to change their opinion when presented evidence; however, some are zealots or inflexibles, that is, individuals who refuse to change their opinion while staunchly advocating an opinion in hopes of convincing others. Zealotry is present in opinions of significant personal investment, such as political, religious or corporate affiliation; it tends to be less commonplace in opinions involving rumors or fashion trends. In this paper, we examine the effect that zealots have in a population whose opinion dynamics obey the naming game model. We present numerical and analytical results about the number and nature of steady state solutions, demonstrating the existence of a bifurcation in the space of zealot fractions. Our analysis indicates conditions under which a minority zealot opinion ultimately prevails, and conditions under which neither opinion attains a majority. We also present numerical and simulation analysis of finite populations and on networks with partial connectivity.

A numerical simulation method and analysis of a complete thermoacoustic-Stirling engine.

PubMed

Ling, Hong; Luo, Ercang; Dai, Wei

2006-12-22

Thermoacoustic prime movers can generate pressure oscillation without any moving parts on self-excited thermoacoustic effect. The details of the numerical simulation methodology for thermoacoustic engines are presented in the paper. First, a four-port network method is used to build the transcendental equation of complex frequency as a criterion to judge if temperature distribution of the whole thermoacoustic system is correct for the case with given heating power. Then, the numerical simulation of a thermoacoustic-Stirling heat engine is carried out. It is proved that the numerical simulation code can run robustly and output what one is interested in. Finally, the calculated results are compared with the experiments of the thermoacoustic-Stirling heat engine (TASHE). It shows that the numerical simulation can agrees with the experimental results with acceptable accuracy.

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.

GPS baseline configuration design based on robustness analysis

NASA Astrophysics Data System (ADS)

Yetkin, M.; Berber, M.

2012-11-01

The robustness analysis results obtained from a Global Positioning System (GPS) network are dramatically influenced by the configurationof the observed baselines. The selection of optimal GPS baselines may allow for a cost effective survey campaign and a sufficiently robustnetwork. Furthermore, using the approach described in this paper, the required number of sessions, the baselines to be observed, and thesignificance levels for statistical testing and robustness analysis can be determined even before the GPS campaign starts. In this study, wepropose a robustness criterion for the optimal design of geodetic networks, and present a very simple and efficient algorithm based on thiscriterion for the selection of optimal GPS baselines. We also show the relationship between the number of sessions and the non-centralityparameter. Finally, a numerical example is given to verify the efficacy of the proposed approach.

The Role of Model and Initial Condition Error in Numerical Weather Forecasting Investigated with an Observing System Simulation Experiment

NASA Technical Reports Server (NTRS)

Prive, Nikki C.; Errico, Ronald M.

2013-01-01

A series of experiments that explore the roles of model and initial condition error in numerical weather prediction are performed using an observing system simulation experiment (OSSE) framework developed at the National Aeronautics and Space Administration Global Modeling and Assimilation Office (NASA/GMAO). The use of an OSSE allows the analysis and forecast errors to be explicitly calculated, and different hypothetical observing networks can be tested with ease. In these experiments, both a full global OSSE framework and an 'identical twin' OSSE setup are utilized to compare the behavior of the data assimilation system and evolution of forecast skill with and without model error. The initial condition error is manipulated by varying the distribution and quality of the observing network and the magnitude of observation errors. The results show that model error has a strong impact on both the quality of the analysis field and the evolution of forecast skill, including both systematic and unsystematic model error components. With a realistic observing network, the analysis state retains a significant quantity of error due to systematic model error. If errors of the analysis state are minimized, model error acts to rapidly degrade forecast skill during the first 24-48 hours of forward integration. In the presence of model error, the impact of observation errors on forecast skill is small, but in the absence of model error, observation errors cause a substantial degradation of the skill of medium range forecasts.

An efficient approach to suppress the negative role of contrarian oscillators in synchronization

NASA Astrophysics Data System (ADS)

Zhang, Xiyun; Ruan, Zhongyuan; Liu, Zonghua

2013-09-01

It has been found that contrarian oscillators usually take a negative role in the collective behaviors formed by conformist oscillators. However, experiments revealed that it is also possible to achieve a strong coherence even when there are contrarians in the system such as neuron networks with both excitable and inhibitory neurons. To understand the underlying mechanism of this abnormal phenomenon, we here consider a complex network of coupled Kuramoto oscillators with mixed positive and negative couplings and present an efficient approach, i.e., tit-for-tat strategy, to suppress the negative role of contrarian oscillators in synchronization and thus increase the order parameter of synchronization. Two classes of contrarian oscillators are numerically studied and a brief theoretical analysis is provided to explain the numerical results.

Application of neural networks and sensitivity analysis to improved prediction of trauma survival.

PubMed

Hunter, A; Kennedy, L; Henry, J; Ferguson, I

2000-05-01

The performance of trauma departments is widely audited by applying predictive models that assess probability of survival, and examining the rate of unexpected survivals and deaths. Although the TRISS methodology, a logistic regression modelling technique, is still the de facto standard, it is known that neural network models perform better. A key issue when applying neural network models is the selection of input variables. This paper proposes a novel form of sensitivity analysis, which is simpler to apply than existing techniques, and can be used for both numeric and nominal input variables. The technique is applied to the audit survival problem, and used to analyse the TRISS variables. The conclusions discuss the implications for the design of further improved scoring schemes and predictive models.

Link prediction based on nonequilibrium cooperation effect

NASA Astrophysics Data System (ADS)

Li, Lanxi; Zhu, Xuzhen; Tian, Hui

2018-04-01

Link prediction in complex networks has become a common focus of many researchers. But most existing methods concentrate on neighbors, and rarely consider degree heterogeneity of two endpoints. Node degree represents the importance or status of endpoints. We describe the large-degree heterogeneity as the nonequilibrium between nodes. This nonequilibrium facilitates a stable cooperation between endpoints, so that two endpoints with large-degree heterogeneity tend to connect stably. We name such a phenomenon as the nonequilibrium cooperation effect. Therefore, this paper proposes a link prediction method based on the nonequilibrium cooperation effect to improve accuracy. Theoretical analysis will be processed in advance, and at the end, experiments will be performed in 12 real-world networks to compare the mainstream methods with our indices in the network through numerical analysis.

Numerical approximation of the electromechanical coupling in the left ventricle with inclusion of the Purkinje network.

PubMed

Landajuela, Mikel; Vergara, Christian; Gerbi, Antonello; Dedé, Luca; Formaggia, Luca; Quarteroni, Alfio

2018-03-25

In this work, we consider the numerical approximation of the electromechanical coupling in the left ventricle with inclusion of the Purkinje network. The mathematical model couples the 3D elastodynamics and bidomain equations for the electrophysiology in the myocardium with the 1D monodomain equation in the Purkinje network. For the numerical solution of the coupled problem, we consider a fixed-point iterative algorithm that enables a partitioned solution of the myocardium and Purkinje network problems. Different levels of myocardium-Purkinje network splitting are considered and analyzed. The results are compared with those obtained using standard strategies proposed in the literature to trigger the electrical activation. Finally, we present a numerical study that, although performed in an idealized computational domain, features all the physiological issues that characterize a heartbeat simulation, including the initiation of the signal in the Purkinje network and the systolic and diastolic phases. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

3D fluid-structure modelling and vibration analysis for fault diagnosis of Francis turbine using multiple ANN and multiple ANFIS

NASA Astrophysics Data System (ADS)

Saeed, R. A.; Galybin, A. N.; Popov, V.

2013-01-01

This paper discusses condition monitoring and fault diagnosis in Francis turbine based on integration of numerical modelling with several different artificial intelligence (AI) techniques. In this study, a numerical approach for fluid-structure (turbine runner) analysis is presented. The results of numerical analysis provide frequency response functions (FRFs) data sets along x-, y- and z-directions under different operating load and different position and size of faults in the structure. To extract features and reduce the dimensionality of the obtained FRF data, the principal component analysis (PCA) has been applied. Subsequently, the extracted features are formulated and fed into multiple artificial neural networks (ANN) and multiple adaptive neuro-fuzzy inference systems (ANFIS) in order to identify the size and position of the damage in the runner and estimate the turbine operating conditions. The results demonstrated the effectiveness of this approach and provide satisfactory accuracy even when the input data are corrupted with certain level of noise.

Graph Theoretical Analysis of Functional Brain Networks: Test-Retest Evaluation on Short- and Long-Term Resting-State Functional MRI Data

PubMed Central

Wang, Jin-Hui; Zuo, Xi-Nian; Gohel, Suril; Milham, Michael P.; Biswal, Bharat B.; He, Yong

2011-01-01

Graph-based computational network analysis has proven a powerful tool to quantitatively characterize functional architectures of the brain. However, the test-retest (TRT) reliability of graph metrics of functional networks has not been systematically examined. Here, we investigated TRT reliability of topological metrics of functional brain networks derived from resting-state functional magnetic resonance imaging data. Specifically, we evaluated both short-term (<1 hour apart) and long-term (>5 months apart) TRT reliability for 12 global and 6 local nodal network metrics. We found that reliability of global network metrics was overall low, threshold-sensitive and dependent on several factors of scanning time interval (TI, long-term>short-term), network membership (NM, networks excluding negative correlations>networks including negative correlations) and network type (NT, binarized networks>weighted networks). The dependence was modulated by another factor of node definition (ND) strategy. The local nodal reliability exhibited large variability across nodal metrics and a spatially heterogeneous distribution. Nodal degree was the most reliable metric and varied the least across the factors above. Hub regions in association and limbic/paralimbic cortices showed moderate TRT reliability. Importantly, nodal reliability was robust to above-mentioned four factors. Simulation analysis revealed that global network metrics were extremely sensitive (but varying degrees) to noise in functional connectivity and weighted networks generated numerically more reliable results in compared with binarized networks. For nodal network metrics, they showed high resistance to noise in functional connectivity and no NT related differences were found in the resistance. These findings provide important implications on how to choose reliable analytical schemes and network metrics of interest. PMID:21818285

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.

Reliability analysis of degradable networks with modified BPR

NASA Astrophysics Data System (ADS)

Wang, Yu-Qing; Zhou, Chao-Fan; Jia, Bin; Zhu, Hua-Bing

2017-12-01

In this paper, the effect of the speed limit on degradable networks with capacity restrictions and the forced flow is investigated. The link performance function considering the road capacity is proposed. Additionally, the probability density distribution and the cumulative distribution of link travel time are introduced in the degradable network. By the mean of distinguishing the value of the speed limit, four cases are discussed, respectively. Means and variances of link travel time and route one of the degradable road network are calculated. Besides, by the mean of performing numerical simulation experiments in a specific network, it is found that the speed limit strategy can reduce the travel time budget and mean travel time of link and route. Moreover, it reveals that the speed limit strategy can cut down variances of the travel time of networks to some extent.

Dynamical behaviours and control measures of rumour-spreading model with consideration of network topology

NASA Astrophysics Data System (ADS)

Zhu, Linhe; Zhao, Hongyong

2017-07-01

A series of online rumours have seriously influenced the normal production and living of people. This paper aims to study the combined impact of psychological factor, propagation delay, network topology and control strategy on rumour diffusion over the online social networks. Based on an online social network, which is seen as a scale-free network, we model the spread of rumours by using a delayed SIS (Susceptible and Infected) epidemic-like model with consideration of psychological factor and network topology. First, through theoretical analysis, we illustrate the boundedness of the density of rumour-susceptible individuals and rumour-infected individuals. Second, we obtain the basic reproduction number R0 and prove the stability of the non-rumour equilibrium point and the rumour-spreading equilibrium point. Third, control strategies, such as uniform immunisation control, proportional immunisation control, targeted immunisation control and optimum control, are put forward to restrain rumour diffusion. Meanwhile, we have compared the differences of these control strategies. Finally, some representative numerical simulations are performed to verify the theoretical analysis results.

A General Map of Iron Metabolism and Tissue-specific Subnetworks

PubMed Central

Hower, Valerie; Mendes, Pedro; Torti, Frank M.; Laubenbacher, Reinhard; Akman, Steven; Shulaev, Vladmir; Torti, Suzy V.

2009-01-01

Iron is required for survival of mammalian cells. Recently, understanding of iron metabolism and trafficking has increased dramatically, revealing a complex, interacting network largely unknown just a few years ago. This provides an excellent model for systems biology development and analysis. The first step in such an analysis is the construction of a structural network of iron metabolism, which we present here. This network was created using CellDesigner version 3.5.2 and includes reactions occurring in mammalian cells of numerous tissue types. The iron metabolic network contains 151 chemical species and 107 reactions and transport steps. Starting from this general model, we construct iron networks for specific tissues and cells that are fundamental to maintaining body iron homeostasis. We include subnetworks for cells of the intestine and liver, tissues important in iron uptake and storage, respectively; as well as the reticulocyte and macrophage, key cells in iron utilization and recycling. The addition of kinetic information to our structural network will permit the simulation of iron metabolism in different tissues as well as in health and disease. PMID:19381358

Optimal convergence in naming game with geography-based negotiation on small-world networks

NASA Astrophysics Data System (ADS)

Liu, Run-Ran; Wang, Wen-Xu; Lai, Ying-Cheng; Chen, Guanrong; Wang, Bing-Hong

2011-01-01

We propose a negotiation strategy to address the effect of geography on the dynamics of naming games over small-world networks. Communication and negotiation frequencies between two agents are determined by their geographical distance in terms of a parameter characterizing the correlation between interaction strength and the distance. A finding is that there exists an optimal parameter value leading to fastest convergence to global consensus on naming. Numerical computations and a theoretical analysis are provided to substantiate our findings.

Stochastic cycle selection in active flow networks.

PubMed

Woodhouse, Francis G; Forrow, Aden; Fawcett, Joanna B; Dunkel, Jörn

2016-07-19

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such nonequilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of biological and nonbiological far-from-equilibrium networks, including actively controlled information flows, and establishes a correspondence between active flow networks and generalized ice-type models.

Stochastic cycle selection in active flow networks

NASA Astrophysics Data System (ADS)

Woodhouse, Francis; Forrow, Aden; Fawcett, Joanna; Dunkel, Jorn

2016-11-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. By connecting concepts from lattice field theory, graph theory and transition rate theory, we show how topology controls dynamics in a generic model for actively driven flow on a network. Through theoretical and numerical analysis we identify symmetry-based rules to classify and predict the selection statistics of complex flow cycles from the network topology. Our conceptual framework is applicable to a broad class of biological and non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models.

Estimating multi-period global cost efficiency and productivity change of systems with network structures

NASA Astrophysics Data System (ADS)

Tohidnia, S.; Tohidi, G.

2018-02-01

The current paper develops three different ways to measure the multi-period global cost efficiency for homogeneous networks of processes when the prices of exogenous inputs are known at all time periods. A multi-period network data envelopment analysis model is presented to measure the minimum cost of the network system based on the global production possibility set. We show that there is a relationship between the multi-period global cost efficiency of network system and its subsystems, and also its processes. The proposed model is applied to compute the global cost Malmquist productivity index for measuring the productivity changes of network system and each of its process between two time periods. This index is circular. Furthermore, we show that the productivity changes of network system can be defined as a weighted average of the process productivity changes. Finally, a numerical example will be presented to illustrate the proposed approach.

A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.

PubMed

Li, Shuai; Li, Yangming; Wang, Zheng

2013-03-01

This paper presents a class of recurrent neural networks to solve quadratic programming problems. Different from most existing recurrent neural networks for solving quadratic programming problems, the proposed neural network model converges in finite time and the activation function is not required to be a hard-limiting function for finite convergence time. The stability, finite-time convergence property and the optimality of the proposed neural network for solving the original quadratic programming problem are proven in theory. Extensive simulations are performed to evaluate the performance of the neural network with different parameters. In addition, the proposed neural network is applied to solving the k-winner-take-all (k-WTA) problem. Both theoretical analysis and numerical simulations validate the effectiveness of our method for solving the k-WTA problem. Copyright © 2012 Elsevier Ltd. All rights reserved.

Stochastic cycle selection in active flow networks

PubMed Central

Woodhouse, Francis G.; Forrow, Aden; Fawcett, Joanna B.; Dunkel, Jörn

2016-01-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such nonequilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of biological and nonbiological far-from-equilibrium networks, including actively controlled information flows, and establishes a correspondence between active flow networks and generalized ice-type models. PMID:27382186

Semianalytic calculation of cosmic microwave background anisotropies from wiggly and superconducting cosmic strings

NASA Astrophysics Data System (ADS)

Rybak, I. Yu.; Avgoustidis, A.; Martins, C. J. A. P.

2017-11-01

We study how the presence of world-sheet currents affects the evolution of cosmic string networks, and their impact on predictions for the cosmic microwave background (CMB) anisotropies generated by these networks. We provide a general description of string networks with currents and explicitly investigate in detail two physically motivated examples: wiggly and superconducting cosmic string networks. By using a modified version of the CMBact code, we show quantitatively how the relevant network parameters in both of these cases influence the predicted CMB signal. Our analysis suggests that previous studies have overestimated the amplitude of the anisotropies for wiggly strings. For superconducting strings the amplitude of the anisotropies depends on parameters which presently are not well known—but which can be measured in future high-resolution numerical simulations.

Utilization of satellite data and regional scale numerical models in short range weather forecasting

NASA Technical Reports Server (NTRS)

Kreitzberg, C. W.

1985-01-01

Overwhelming evidence was developed in a number of studies of satellite data impact on numerical weather prediction that it is unrealistic to expect satellite temperature soundings to improve detailed regional numerical weather prediction. It is likely that satellite data over the United States would substantially impact mesoscale dynamical predictions if the effort were made to develop a composite moisture analysis system. The horizontal variability of moisture, most clearly depicited in images from satellite water vapor channels, would not be determined from conventional rawinsondes even if that network were increased by a doubling of both the number of sites and the time frequency.

Displacement-based back-analysis of the model parameters of the Nuozhadu high earth-rockfill dam.

PubMed

Wu, Yongkang; Yuan, Huina; Zhang, Bingyin; Zhang, Zongliang; Yu, Yuzhen

2014-01-01

The parameters of the constitutive model, the creep model, and the wetting model of materials of the Nuozhadu high earth-rockfill dam were back-analyzed together based on field monitoring displacement data by employing an intelligent back-analysis method. In this method, an artificial neural network is used as a substitute for time-consuming finite element analysis, and an evolutionary algorithm is applied for both network training and parameter optimization. To avoid simultaneous back-analysis of many parameters, the model parameters of the three main dam materials are decoupled and back-analyzed separately in a particular order. Displacement back-analyses were performed at different stages of the construction period, with and without considering the creep and wetting deformations. Good agreement between the numerical results and the monitoring data was obtained for most observation points, which implies that the back-analysis method and decoupling method are effective for solving complex problems with multiple models and parameters. The comparison of calculation results based on different sets of back-analyzed model parameters indicates the necessity of taking the effects of creep and wetting into consideration in the numerical analyses of high earth-rockfill dams. With the resulting model parameters, the stress and deformation distributions at completion are predicted and analyzed.

Challenge Paper: Validation of Forensic Techniques for Criminal Prosecution

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

Erbacher, Robert F.; Endicott-Popovsky, Barbara E.; Frincke, Deborah A.

2007-04-10

Abstract: As in many domains, there is increasing agreement in the user and research community that digital forensics analysts would benefit from the extension, development and application of advanced techniques in performing large scale and heterogeneous data analysis. Modern digital forensics analysis of cyber-crimes and cyber-enabled crimes often requires scrutiny of massive amounts of data. For example, a case involving network compromise across multiple enterprises might require forensic analysis of numerous sets of network logs and computer hard drives, potentially involving 100?s of gigabytes of heterogeneous data, or even terabytes or petabytes of data. Also, the goal for forensic analysismore » is to not only determine whether the illicit activity being considered is taking place, but also to identify the source of the activity and the full extent of the compromise or impact on the local network. Even after this analysis, there remains the challenge of using the results in subsequent criminal and civil processes.« less

Unconstrained handwritten numeral recognition based on radial basis competitive and cooperative networks with spatio-temporal feature representation.

PubMed

Lee, S; Pan, J J

1996-01-01

This paper presents a new approach to representation and recognition of handwritten numerals. The approach first transforms a two-dimensional (2-D) spatial representation of a numeral into a three-dimensional (3-D) spatio-temporal representation by identifying the tracing sequence based on a set of heuristic rules acting as transformation operators. A multiresolution critical-point segmentation method is then proposed to extract local feature points, at varying degrees of scale and coarseness. A new neural network architecture, referred to as radial-basis competitive and cooperative network (RCCN), is presented especially for handwritten numeral recognition. RCCN is a globally competitive and locally cooperative network with the capability of self-organizing hidden units to progressively achieve desired network performance, and functions as a universal approximator of arbitrary input-output mappings. Three types of RCCNs are explored: input-space RCCN (IRCCN), output-space RCCN (ORCCN), and bidirectional RCCN (BRCCN). Experiments against handwritten zip code numerals acquired by the U.S. Postal Service indicated that the proposed method is robust in terms of variations, deformations, transformations, and corruption, achieving about 97% recognition rate.

Reliability Analysis and Modeling of ZigBee Networks

NASA Astrophysics Data System (ADS)

Lin, Cheng-Min

The architecture of ZigBee networks focuses on developing low-cost, low-speed ubiquitous communication between devices. The ZigBee technique is based on IEEE 802.15.4, which specifies the physical layer and medium access control (MAC) for a low rate wireless personal area network (LR-WPAN). Currently, numerous wireless sensor networks have adapted the ZigBee open standard to develop various services to promote improved communication quality in our daily lives. The problem of system and network reliability in providing stable services has become more important because these services will be stopped if the system and network reliability is unstable. The ZigBee standard has three kinds of networks; star, tree and mesh. The paper models the ZigBee protocol stack from the physical layer to the application layer and analyzes these layer reliability and mean time to failure (MTTF). Channel resource usage, device role, network topology and application objects are used to evaluate reliability in the physical, medium access control, network, and application layers, respectively. In the star or tree networks, a series system and the reliability block diagram (RBD) technique can be used to solve their reliability problem. However, a division technology is applied here to overcome the problem because the network complexity is higher than that of the others. A mesh network using division technology is classified into several non-reducible series systems and edge parallel systems. Hence, the reliability of mesh networks is easily solved using series-parallel systems through our proposed scheme. The numerical results demonstrate that the reliability will increase for mesh networks when the number of edges in parallel systems increases while the reliability quickly drops when the number of edges and the number of nodes increase for all three networks. More use of resources is another factor impact on reliability decreasing. However, lower network reliability will occur due to network complexity, more resource usage and complex object relationship.

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

NASA Astrophysics Data System (ADS)

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

2017-03-01

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

Bidirectional reaction steps in metabolic networks: I. Modeling and simulation of carbon isotope labeling experiments.

PubMed

Wiechert, W; de Graaf, A A

1997-07-05

The extension of metabolite balancing with carbon labeling experiments, as described by Marx et al. (Biotechnol. Bioeng. 49: 11-29), results in a much more detailed stationary metabolic flux analysis. As opposed to basic metabolite flux balancing alone, this method enables both flux directions of bidirectional reaction steps to be quantitated. However, the mathematical treatment of carbon labeling systems is much more complicated, because it requires the solution of numerous balance equations that are bilinear with respect to fluxes and fractional labeling. In this study, a universal modeling framework is presented for describing the metabolite and carbon atom flux in a metabolic network. Bidirectional reaction steps are extensively treated and their impact on the system's labeling state is investigated. Various kinds of modeling assumptions, as usually made for metabolic fluxes, are expressed by linear constraint equations. A numerical algorithm for the solution of the resulting linear constrained set of nonlinear equations is developed. The numerical stability problems caused by large bidirectional fluxes are solved by a specially developed transformation method. Finally, the simulation of carbon labeling experiments is facilitated by a flexible software tool for network synthesis. An illustrative simulation study on flux identifiability from available flux and labeling measurements in the cyclic pentose phosphate pathway of a recombinant strain of Zymomonas mobilis concludes this contribution.

Assessment of critical path analyses of the relationship between permeability and electrical conductivity of pore networks

USDA-ARS?s Scientific Manuscript database

Critical path analysis (CPA) is a method for estimating macroscopic transport coefficients of heterogeneous materials that are highly disordered at the micro-scale. Developed originally to model conduction in semiconductors, numerous researchers have noted that CPA might also have relevance to flow ...

SATRAT: Staphylococcus aureus transcript regulatory network analysis tool.

PubMed

Gopal, Tamilselvi; Nagarajan, Vijayaraj; Elasri, Mohamed O

2015-01-01

Staphylococcus aureus is a commensal organism that primarily colonizes the nose of healthy individuals. S. aureus causes a spectrum of infections that range from skin and soft-tissue infections to fatal invasive diseases. S. aureus uses a large number of virulence factors that are regulated in a coordinated fashion. The complex regulatory mechanisms have been investigated in numerous high-throughput experiments. Access to this data is critical to studying this pathogen. Previously, we developed a compilation of microarray experimental data to enable researchers to search, browse, compare, and contrast transcript profiles. We have substantially updated this database and have built a novel exploratory tool-SATRAT-the S. aureus transcript regulatory network analysis tool, based on the updated database. This tool is capable of performing deep searches using a query and generating an interactive regulatory network based on associations among the regulators of any query gene. We believe this integrated regulatory network analysis tool would help researchers explore the missing links and identify novel pathways that regulate virulence in S. aureus. Also, the data model and the network generation code used to build this resource is open sourced, enabling researchers to build similar resources for other bacterial systems.

Analyzing big data in social media: Text and network analyses of an eating disorder forum.

PubMed

Moessner, Markus; Feldhege, Johannes; Wolf, Markus; Bauer, Stephanie

2018-05-10

Social media plays an important role in everyday life of young people. Numerous studies claim negative effects of social media and media in general on eating disorder risk factors. Despite the availability of big data, only few studies have exploited the possibilities so far in the field of eating disorders. Methods for data extraction, computerized content analysis, and network analysis will be introduced. Strategies and methods will be exemplified for an ad-hoc dataset of 4,247 posts and 34,118 comments by 3,029 users of the proed forum on Reddit. Text analysis with latent Dirichlet allocation identified nine topics related to social support and eating disorder specific content. Social network analysis describes the overall communication patterns, and could identify community structures and most influential users. A linear network autocorrelation model was applied to estimate associations in language among network neighbors. The supplement contains R code for data extraction and analyses. This paper provides an introduction to investigating social media data, and will hopefully stimulate big data social media research in eating disorders. When applied in real-time, the methods presented in this manuscript could contribute to improving the safety of ED-related online communication. © 2018 Wiley Periodicals, Inc.

Robust stability for stochastic bidirectional associative memory neural networks with time delays

NASA Astrophysics Data System (ADS)

Shu, H. S.; Lv, Z. W.; Wei, G. L.

2008-02-01

In this paper, the asymptotic stability is considered for a class of uncertain stochastic bidirectional associative memory neural networks with time delays and parameter uncertainties. The delays are time-invariant and the uncertainties are norm-bounded that enter into all network parameters. The aim of this paper is to establish easily verifiable conditions under which the delayed neural network is robustly asymptotically stable in the mean square for all admissible parameter uncertainties. By employing a Lyapunov-Krasovskii functional and conducting the stochastic analysis, a linear matrix inequality matrix inequality (LMI) approach is developed to derive the stability criteria. The proposed criteria can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed criteria.

Global exponential stability of neutral high-order stochastic Hopfield neural networks with Markovian jump parameters and mixed time delays.

PubMed

Huang, Haiying; Du, Qiaosheng; Kang, Xibing

2013-11-01

In this paper, a class of neutral high-order stochastic Hopfield neural networks with Markovian jump parameters and mixed time delays is investigated. The jumping parameters are modeled as a continuous-time finite-state Markov chain. At first, the existence of equilibrium point for the addressed neural networks is studied. By utilizing the Lyapunov stability theory, stochastic analysis theory and linear matrix inequality (LMI) technique, new delay-dependent stability criteria are presented in terms of linear matrix inequalities to guarantee the neural networks to be globally exponentially stable in the mean square. Numerical simulations are carried out to illustrate the main results. © 2013 ISA. Published by ISA. All rights reserved.

Estimating the epidemic threshold on networks by deterministic connections

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

Li, Kezan, E-mail: lkzzr@sohu.com; Zhu, Guanghu; Fu, Xinchu

2014-12-15

For many epidemic networks some connections between nodes are treated as deterministic, while the remainder are random and have different connection probabilities. By applying spectral analysis to several constructed models, we find that one can estimate the epidemic thresholds of these networks by investigating information from only the deterministic connections. Nonetheless, in these models, generic nonuniform stochastic connections and heterogeneous community structure are also considered. The estimation of epidemic thresholds is achieved via inequalities with upper and lower bounds, which are found to be in very good agreement with numerical simulations. Since these deterministic connections are easier to detect thanmore » those stochastic connections, this work provides a feasible and effective method to estimate the epidemic thresholds in real epidemic networks.« less

Epidemic spreading in time-varying community networks

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

Ren, Guangming, E-mail: wangxy@dlut.edu.cn, E-mail: ren-guang-ming@163.com; Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024; Wang, Xingyuan, E-mail: wangxy@dlut.edu.cn, E-mail: ren-guang-ming@163.com

2014-06-15

The spreading processes of many infectious diseases have comparable time scale as the network evolution. Here, we present a simple networks model with time-varying community structure, and investigate susceptible-infected-susceptible epidemic spreading processes in this model. By both theoretic analysis and numerical simulations, we show that the efficiency of epidemic spreading in this model depends intensively on the mobility rate q of the individuals among communities. We also find that there exists a mobility rate threshold q{sub c}. The epidemic will survive when q > q{sub c} and die when q < q{sub c}. These results can help understanding the impacts of human travel onmore » the epidemic spreading in complex networks with community structure.« less

Performance Analysis of IIUM Wireless Campus Network

NASA Astrophysics Data System (ADS)

Abd Latif, Suhaimi; Masud, Mosharrof H.; Anwar, Farhat

2013-12-01

International Islamic University Malaysia (IIUM) is one of the leading universities in the world in terms of quality of education that has been achieved due to providing numerous facilities including wireless services to every enrolled student. The quality of this wireless service is controlled and monitored by Information Technology Division (ITD), an ISO standardized organization under the university. This paper aims to investigate the constraints of wireless campus network of IIUM. It evaluates the performance of the IIUM wireless campus network in terms of delay, throughput and jitter. QualNet 5.2 simulator tool has employed to measure these performances of IIUM wireless campus network. The observation from the simulation result could be one of the influencing factors in improving wireless services for ITD and further improvement.

Spreading dynamics of an e-commerce preferential information model on scale-free networks

NASA Astrophysics Data System (ADS)

Wan, Chen; Li, Tao; Guan, Zhi-Hong; Wang, Yuanmei; Liu, Xiongding

2017-02-01

In order to study the influence of the preferential degree and the heterogeneity of underlying networks on the spread of preferential e-commerce information, we propose a novel susceptible-infected-beneficial model based on scale-free networks. The spreading dynamics of the preferential information are analyzed in detail using the mean-field theory. We determine the basic reproductive number and equilibria. The theoretical analysis indicates that the basic reproductive number depends mainly on the preferential degree and the topology of the underlying networks. We prove the global stability of the information-elimination equilibrium. The permanence of preferential information and the global attractivity of the information-prevailing equilibrium are also studied in detail. Some numerical simulations are presented to verify the theoretical results.

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

NASA Astrophysics Data System (ADS)

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

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

Is functional integration of resting state brain networks an unspecific biomarker for working memory performance?

PubMed

Alavash, Mohsen; Doebler, Philipp; Holling, Heinz; Thiel, Christiane M; Gießing, Carsten

2015-03-01

Is there one optimal topology of functional brain networks at rest from which our cognitive performance would profit? Previous studies suggest that functional integration of resting state brain networks is an important biomarker for cognitive performance. However, it is still unknown whether higher network integration is an unspecific predictor for good cognitive performance or, alternatively, whether specific network organization during rest predicts only specific cognitive abilities. Here, we investigated the relationship between network integration at rest and cognitive performance using two tasks that measured different aspects of working memory; one task assessed visual-spatial and the other numerical working memory. Network clustering, modularity and efficiency were computed to capture network integration on different levels of network organization, and to statistically compare their correlations with the performance in each working memory test. The results revealed that each working memory aspect profits from a different resting state topology, and the tests showed significantly different correlations with each of the measures of network integration. While higher global network integration and modularity predicted significantly better performance in visual-spatial working memory, both measures showed no significant correlation with numerical working memory performance. In contrast, numerical working memory was superior in subjects with highly clustered brain networks, predominantly in the intraparietal sulcus, a core brain region of the working memory network. Our findings suggest that a specific balance between local and global functional integration of resting state brain networks facilitates special aspects of cognitive performance. In the context of working memory, while visual-spatial performance is facilitated by globally integrated functional resting state brain networks, numerical working memory profits from increased capacities for local processing, especially in brain regions involved in working memory performance. Copyright © 2014 Elsevier Inc. All rights reserved.

Spike-train spectra and network response functions for non-linear integrate-and-fire neurons.

PubMed

Richardson, Magnus J E

2008-11-01

Reduced models have long been used as a tool for the analysis of the complex activity taking place in neurons and their coupled networks. Recent advances in experimental and theoretical techniques have further demonstrated the usefulness of this approach. Despite the often gross simplification of the underlying biophysical properties, reduced models can still present significant difficulties in their analysis, with the majority of exact and perturbative results available only for the leaky integrate-and-fire model. Here an elementary numerical scheme is demonstrated which can be used to calculate a number of biologically important properties of the general class of non-linear integrate-and-fire models. Exact results for the first-passage-time density and spike-train spectrum are derived, as well as the linear response properties and emergent states of recurrent networks. Given that the exponential integrate-fire model has recently been shown to agree closely with the experimentally measured response of pyramidal cells, the methodology presented here promises to provide a convenient tool to facilitate the analysis of cortical-network dynamics.

Correlation analysis on real-time tab-delimited network monitoring data

DOE PAGES

Pan, Aditya; Majumdar, Jahin; Bansal, Abhay; ...

2016-01-01

End-End performance monitoring in the Internet, also called PingER is a part of SLAC National Accelerator Laboratory’s research project. It was created to answer the growing need to monitor network both to analyze current performance and to designate resources to optimize execution between research centers, and the universities and institutes co-operating on present and future operations. The monitoring support reflects the broad geographical area of the collaborations and requires a comprehensive number of research and financial channels. The data architecture retrieval and methodology of the interpretation have emerged over numerous years. Analyzing this data is the main challenge due tomore » its high volume. Finally, by using correlation analysis, we can make crucial conclusions about how the network data affects the performance of the hosts and how it depends from countries to countries.« less

Changes in the interaction of resting-state neural networks from adolescence to adulthood.

PubMed

Stevens, Michael C; Pearlson, Godfrey D; Calhoun, Vince D

2009-08-01

This study examined how the mutual interactions of functionally integrated neural networks during resting-state fMRI differed between adolescence and adulthood. Independent component analysis (ICA) was used to identify functionally connected neural networks in 100 healthy participants aged 12-30 years. Hemodynamic timecourses that represented integrated neural network activity were analyzed with tools that quantified system "causal density" estimates, which indexed the proportion of significant Granger causality relationships among system nodes. Mutual influences among networks decreased with age, likely reflecting stronger within-network connectivity and more efficient between-network influences with greater development. Supplemental tests showed that this normative age-related reduction in causal density was accompanied by fewer significant connections to and from each network, regional increases in the strength of functional integration within networks, and age-related reductions in the strength of numerous specific system interactions. The latter included paths between lateral prefrontal-parietal circuits and "default mode" networks. These results contribute to an emerging understanding that activity in widely distributed networks thought to underlie complex cognition influences activity in other networks. (c) 2009 Wiley-Liss, Inc.

GARNET--gene set analysis with exploration of annotation relations.

PubMed

Rho, Kyoohyoung; Kim, Bumjin; Jang, Youngjun; Lee, Sanghyun; Bae, Taejeong; Seo, Jihae; Seo, Chaehwa; Lee, Jihyun; Kang, Hyunjung; Yu, Ungsik; Kim, Sunghoon; Lee, Sanghyuk; Kim, Wan Kyu

2011-02-15

Gene set analysis is a powerful method of deducing biological meaning for an a priori defined set of genes. Numerous tools have been developed to test statistical enrichment or depletion in specific pathways or gene ontology (GO) terms. Major difficulties towards biological interpretation are integrating diverse types of annotation categories and exploring the relationships between annotation terms of similar information. GARNET (Gene Annotation Relationship NEtwork Tools) is an integrative platform for gene set analysis with many novel features. It includes tools for retrieval of genes from annotation database, statistical analysis & visualization of annotation relationships, and managing gene sets. In an effort to allow access to a full spectrum of amassed biological knowledge, we have integrated a variety of annotation data that include the GO, domain, disease, drug, chromosomal location, and custom-defined annotations. Diverse types of molecular networks (pathways, transcription and microRNA regulations, protein-protein interaction) are also included. The pair-wise relationship between annotation gene sets was calculated using kappa statistics. GARNET consists of three modules--gene set manager, gene set analysis and gene set retrieval, which are tightly integrated to provide virtually automatic analysis for gene sets. A dedicated viewer for annotation network has been developed to facilitate exploration of the related annotations. GARNET (gene annotation relationship network tools) is an integrative platform for diverse types of gene set analysis, where complex relationships among gene annotations can be easily explored with an intuitive network visualization tool (http://garnet.isysbio.org/ or http://ercsb.ewha.ac.kr/garnet/).

Stability and synchronization analysis of inertial memristive neural networks with time delays.

PubMed

Rakkiyappan, R; Premalatha, S; Chandrasekar, A; Cao, Jinde

2016-10-01

This paper is concerned with the problem of stability and pinning synchronization of a class of inertial memristive neural networks with time delay. In contrast to general inertial neural networks, inertial memristive neural networks is applied to exhibit the synchronization and stability behaviors due to the physical properties of memristors and the differential inclusion theory. By choosing an appropriate variable transmission, the original system can be transformed into first order differential equations. Then, several sufficient conditions for the stability of inertial memristive neural networks by using matrix measure and Halanay inequality are derived. These obtained criteria are capable of reducing computational burden in the theoretical part. In addition, the evaluation is done on pinning synchronization for an array of linearly coupled inertial memristive neural networks, to derive the condition using matrix measure strategy. Finally, the two numerical simulations are presented to show the effectiveness of acquired theoretical results.

Epidemics in Adaptive Social Networks with Temporary Link Deactivation

NASA Astrophysics Data System (ADS)

Tunc, Ilker; Shkarayev, Maxim S.; Shaw, Leah B.

2013-04-01

Disease spread in a society depends on the topology of the network of social contacts. Moreover, individuals may respond to the epidemic by adapting their contacts to reduce the risk of infection, thus changing the network structure and affecting future disease spread. We propose an adaptation mechanism where healthy individuals may choose to temporarily deactivate their contacts with sick individuals, allowing reactivation once both individuals are healthy. We develop a mean-field description of this system and find two distinct regimes: slow network dynamics, where the adaptation mechanism simply reduces the effective number of contacts per individual, and fast network dynamics, where more efficient adaptation reduces the spread of disease by targeting dangerous connections. Analysis of the bifurcation structure is supported by numerical simulations of disease spread on an adaptive network. The system displays a single parameter-dependent stable steady state and non-monotonic dependence of connectivity on link deactivation rate.

Synchronization of Switched Neural Networks With Communication Delays via the Event-Triggered Control.

PubMed

Wen, Shiping; Zeng, Zhigang; Chen, Michael Z Q; Huang, Tingwen

2017-10-01

This paper addresses the issue of synchronization of switched delayed neural networks with communication delays via event-triggered control. For synchronizing coupled switched neural networks, we propose a novel event-triggered control law which could greatly reduce the number of control updates for synchronization tasks of coupled switched neural networks involving embedded microprocessors with limited on-board resources. The control signals are driven by properly defined events, which depend on the measurement errors and current-sampled states. By using a delay system method, a novel model of synchronization error system with delays is proposed with the communication delays and event-triggered control in the unified framework for coupled switched neural networks. The criteria are derived for the event-triggered synchronization analysis and control synthesis of switched neural networks via the Lyapunov-Krasovskii functional method and free weighting matrix approach. A numerical example is elaborated on to illustrate the effectiveness of the derived results.

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

NASA Astrophysics Data System (ADS)

Gan, Yu; Tang, Ming; Yang, Hanxin

2013-05-01

Since the discovery of non-Poisson statistics of human mobility trajectories, more attention has been paid to understand the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate packet forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and the higher proportion of high-speed agents can enhance the network throughput and reduce the mean traveling time in random forwarding. A hierarchical structure in the dependence of high-speed is observed: the network throughput remains unchanged at small and large high-speed value. It is also interesting to find that a slightly preferential forwarding to high-speed agents can maximize the network capacity. Through theoretical analysis and numerical simulations, we show that the optimal forwarding ratio stems from the local structural heterogeneity of low-speed agents.

Spatial correlation analysis of urban traffic state under a perspective of community detection

NASA Astrophysics Data System (ADS)

Yang, Yanfang; Cao, Jiandong; Qin, Yong; Jia, Limin; Dong, Honghui; Zhang, Aomuhan

2018-05-01

Understanding the spatial correlation of urban traffic state is essential for identifying the evolution patterns of urban traffic state. However, the distribution of traffic state always has characteristics of large spatial span and heterogeneity. This paper adapts the concept of community detection to the correlation network of urban traffic state and proposes a new perspective to identify the spatial correlation patterns of traffic state. In the proposed urban traffic network, the nodes represent road segments, and an edge between a pair of nodes is added depending on the result of significance test for the corresponding correlation of traffic state. Further, the process of community detection in the urban traffic network (named GWPA-K-means) is applied to analyze the spatial dependency of traffic state. The proposed method extends the traditional K-means algorithm in two steps: (i) redefines the initial cluster centers by two properties of nodes (the GWPA value and the minimum shortest path length); (ii) utilizes the weight signal propagation process to transfer the topological information of the urban traffic network into a node similarity matrix. Finally, numerical experiments are conducted on a simple network and a real urban road network in Beijing. The results show that GWPA-K-means algorithm is valid in spatial correlation analysis of traffic state. The network science and community structure analysis perform well in describing the spatial heterogeneity of traffic state on a large spatial scale.

Multiscale Embedded Gene Co-expression Network Analysis

PubMed Central

Song, Won-Min; Zhang, Bin

2015-01-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma. PMID:26618778

Multiscale Embedded Gene Co-expression Network Analysis.

PubMed

Song, Won-Min; Zhang, Bin

2015-11-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma.

Network Analysis of an Emergent Massively Collaborative Creation on Video Sharing Website

NASA Astrophysics Data System (ADS)

Hamasaki, Masahiro; Takeda, Hideaki; Nishimura, Takuichi

The Web technology enables numerous people to collaborate in creation. We designate it as massively collaborative creation via the Web. As an example of massively collaborative creation, we particularly examine video development on Nico Nico Douga, which is a video sharing website that is popular in Japan. We specifically examine videos on Hatsune Miku, a version of a singing synthesizer application software that has inspired not only song creation but also songwriting, illustration, and video editing. As described herein, creators of interact to create new contents through their social network. In this paper, we analyzed the process of developing thousands of videos based on creators' social networks and investigate relationships among creation activity and social networks. The social network reveals interesting features. Creators generate large and sparse social networks including some centralized communities, and such centralized community's members shared special tags. Different categories of creators have different roles in evolving the network, e.g., songwriters gather more links than other categories, implying that they are triggers to network evolution.

Nonsmooth Finite-Time Synchronization of Switched Coupled Neural Networks.

PubMed

Liu, Xiaoyang; Cao, Jinde; Yu, Wenwu; Song, Qiang

2016-10-01

This paper is concerned with the finite-time synchronization (FTS) issue of switched coupled neural networks with discontinuous or continuous activations. Based on the framework of nonsmooth analysis, some discontinuous or continuous controllers are designed to force the coupled networks to synchronize to an isolated neural network. Some sufficient conditions are derived to ensure the FTS by utilizing the well-known finite-time stability theorem for nonlinear systems. Compared with the previous literatures, such synchronization objective will be realized when the activations and the controllers are both discontinuous. The obtained results in this paper include and extend the earlier works on the synchronization issue of coupled networks with Lipschitz continuous conditions. Moreover, an upper bound of the settling time for synchronization is estimated. Finally, numerical simulations are given to demonstrate the effectiveness of the theoretical results.

Effect of correlations on controllability transition in network control

PubMed Central

Nie, Sen; Wang, Xu-Wen; Wang, Bing-Hong; Jiang, Luo-Luo

2016-01-01

The network control problem has recently attracted an increasing amount of attention, owing to concerns including the avoidance of cascading failures of power-grids and the management of ecological networks. It has been proven that numerical control can be achieved if the number of control inputs exceeds a certain transition point. In the present study, we investigate the effect of degree correlation on the numerical controllability in networks whose topological structures are reconstructed from both real and modeling systems, and we find that the transition point of the number of control inputs depends strongly on the degree correlation in both undirected and directed networks with moderately sparse links. More interestingly, the effect of the degree correlation on the transition point cannot be observed in dense networks for numerical controllability, which contrasts with the corresponding result for structural controllability. In particular, for directed random networks and scale-free networks, the influence of the degree correlation is determined by the types of correlations. Our approach provides an understanding of control problems in complex sparse networks. PMID:27063294

Developmental specialization in the right intraparietal sulcus for the abstract representation of numerical magnitude.

PubMed

Holloway, Ian D; Ansari, Daniel

2010-11-01

Because number is an abstract quality of a set, the way in which a number is externally represented does not change its quantitative meaning. In this study, we examined the development of the brain regions that support format-independent representation of numerical magnitude. We asked children and adults to perform both symbolic (Hindu-Arabic numerals) and nonsymbolic (arrays of squares) numerical comparison tasks as well as two control tasks while their brains were scanned using fMRI. In a preliminary analysis, we calculated the conjunction between symbolic and nonsymbolic numerical comparison. We then examined in which brain regions this conjunction differed between children and adults. This analysis revealed a large network of visual and parietal regions that showed greater activation in adults relative to children. In our primary analysis, we examined age-related differences in the conjunction of symbolic and nonsymbolic comparison after subtracting the control tasks. This analysis revealed a much more limited set of regions including the right inferior parietal lobe near the intraparietal sulcus. In addition to showing increased activation to both symbolic and nonsymbolic magnitudes over and above activation related to response selection, this region showed age-related differences in the distance effect. Our findings demonstrate that the format-independent representation of numerical magnitude in the right inferior parietal lobe is the product of developmental processes of cortical specialization and highlight the importance of using appropriate control tasks when conducting developmental neuroimaging studies.

Spectral analysis of Chinese language: Co-occurrence networks from four literary genres

NASA Astrophysics Data System (ADS)

Liang, Wei; Chen, Guanrong

2016-05-01

The eigenvalues and eigenvectors of the adjacency matrix of a network contain essential information about its topology. For each of the Chinese language co-occurrence networks constructed from four literary genres, i.e., essay, popular science article, news report, and novel, it is found that the largest eigenvalue depends on the network size N, the number of edges, the average shortest path length, and the clustering coefficient. Moreover, it is found that their node-degree distributions all follow a power-law. The number of different eigenvalues, Nλ, is found numerically to increase in the manner of Nλ ∝ log N for novel and Nλ ∝ N for the other three literary genres. An ;M; shape or a triangle-like distribution appears in their spectral densities. The eigenvector corresponding to the largest eigenvalue is mostly localized to a node with the largest degree. For the above observed phenomena, mathematical analysis is provided with interpretation from a linguistic perspective.

Characterization of chaotic attractors under noise: A recurrence network perspective

NASA Astrophysics Data System (ADS)

Jacob, Rinku; Harikrishnan, K. P.; Misra, R.; Ambika, G.

2016-12-01

We undertake a detailed numerical investigation to understand how the addition of white and colored noise to a chaotic time series changes the topology and the structure of the underlying attractor reconstructed from the time series. We use the methods and measures of recurrence plot and recurrence network generated from the time series for this analysis. We explicitly show that the addition of noise obscures the property of recurrence of trajectory points in the phase space which is the hallmark of every dynamical system. However, the structure of the attractor is found to be robust even upto high noise levels of 50%. An advantage of recurrence network measures over the conventional nonlinear measures is that they can be applied on short and non stationary time series data. By using the results obtained from the above analysis, we go on to analyse the light curves from a dominant black hole system and show that the recurrence network measures are capable of identifying the nature of noise contamination in a time series.

Backbone of complex networks of corporations: the flow of control.

PubMed

Glattfelder, J B; Battiston, S

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels †

PubMed Central

Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

2016-01-01

In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source’s radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks. PMID:26927119

Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels.

PubMed

Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

2016-02-26

In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source's radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks.

Backbone of complex networks of corporations: The flow of control

NASA Astrophysics Data System (ADS)

Glattfelder, J. B.; Battiston, S.

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Thermal radiation characteristics of nonisothermal cylindrical enclosures using a numerical ray tracing technique

NASA Technical Reports Server (NTRS)

Baumeister, Joseph F.

1990-01-01

Analysis of energy emitted from simple or complex cavity designs can lead to intricate solutions due to nonuniform radiosity and irradiation within a cavity. A numerical ray tracing technique was applied to simulate radiation propagating within and from various cavity designs. To obtain the energy balance relationships between isothermal and nonisothermal cavity surfaces and space, the computer code NEVADA was utilized for its statistical technique applied to numerical ray tracing. The analysis method was validated by comparing results with known theoretical and limiting solutions, and the electrical resistance network method. In general, for nonisothermal cavities the performance (apparent emissivity) is a function of cylinder length-to-diameter ratio, surface emissivity, and cylinder surface temperatures. The extent of nonisothermal conditions in a cylindrical cavity significantly affects the overall cavity performance. Results are presented over a wide range of parametric variables for use as a possible design reference.

Nested Fork-Join Queuing Networks and Their Application to Mobility Airfield Operations Analysis.

DTIC Science & Technology

1997-03-01

shortest queue length. Setia , Squillante, and Tripathi [109] extend Makowski and Nelson’s work by performing a quantitative assessment of a range of...Markov chains." Numerical Solution of Markov Chains, edited by W. J. Stewart, 63- 88. Basel: Marcel Dekker, 1991. [109] Setia , S. K., and others

Promoting Instructional Change: Using Social Network Analysis to Understand the Informal Structure of Academic Departments

ERIC Educational Resources Information Center

Quardokus, Kathleen; Henderson, Charles

2015-01-01

Calls for improvement of undergraduate science education have resulted in numerous initiatives that seek to improve student learning outcomes by promoting changes in faculty teaching practices. Although many of these initiatives focus on individual faculty, researchers consider the academic department to be a highly productive focus for creating…

Emergence of bursts and communities in evolving weighted networks.

PubMed

Jo, Hang-Hyun; Pan, Raj Kumar; Kaski, Kimmo

2011-01-01

Understanding the patterns of human dynamics and social interaction and the way they lead to the formation of an organized and functional society are important issues especially for techno-social development. Addressing these issues of social networks has recently become possible through large scale data analysis of mobile phone call records, which has revealed the existence of modular or community structure with many links between nodes of the same community and relatively few links between nodes of different communities. The weights of links, e.g., the number of calls between two users, and the network topology are found correlated such that intra-community links are stronger compared to the weak inter-community links. This feature is known as Granovetter's "The strength of weak ties" hypothesis. In addition to this inhomogeneous community structure, the temporal patterns of human dynamics turn out to be inhomogeneous or bursty, characterized by the heavy tailed distribution of time interval between two consecutive events, i.e., inter-event time. In this paper, we study how the community structure and the bursty dynamics emerge together in a simple evolving weighted network model. The principal mechanisms behind these patterns are social interaction by cyclic closure, i.e., links to friends of friends and the focal closure, links to individuals sharing similar attributes or interests, and human dynamics by task handling process. These three mechanisms have been implemented as a network model with local attachment, global attachment, and priority-based queuing processes. By comprehensive numerical simulations we show that the interplay of these mechanisms leads to the emergence of heavy tailed inter-event time distribution and the evolution of Granovetter-type community structure. Moreover, the numerical results are found to be in qualitative agreement with empirical analysis results from mobile phone call dataset.

Numerical bifurcation analysis of two coupled FitzHugh-Nagumo oscillators

NASA Astrophysics Data System (ADS)

Hoff, Anderson; dos Santos, Juliana V.; Manchein, Cesar; Albuquerque, Holokx A.

2014-07-01

The behavior of neurons can be modeled by the FitzHugh-Nagumo oscillator model, consisting of two nonlinear differential equations, which simulates the behavior of nerve impulse conduction through the neuronal membrane. In this work, we numerically study the dynamical behavior of two coupled FitzHugh-Nagumo oscillators. We consider unidirectional and bidirectional couplings, for which Lyapunov and isoperiodic diagrams were constructed calculating the Lyapunov exponents and the number of the local maxima of a variable in one period interval of the time-series, respectively. By numerical continuation method the bifurcation curves are also obtained for both couplings. The dynamics of the networks here investigated are presented in terms of the variation between the coupling strength of the oscillators and other parameters of the system. For the network of two oscillators unidirectionally coupled, the results show the existence of Arnold tongues, self-organized sequentially in a branch of a Stern-Brocot tree and by the bifurcation curves it became evident the connection between these Arnold tongues with other periodic structures in Lyapunov diagrams. That system also presents multistability shown in the planes of the basin of attractions.

Convergence of Asymptotic Systems of Non-autonomous Neural Network Models with Infinite Distributed Delays

NASA Astrophysics Data System (ADS)

Oliveira, José J.

2017-10-01

In this paper, we investigate the global convergence of solutions of non-autonomous Hopfield neural network models with discrete time-varying delays, infinite distributed delays, and possible unbounded coefficient functions. Instead of using Lyapunov functionals, we explore intrinsic features between the non-autonomous systems and their asymptotic systems to ensure the boundedness and global convergence of the solutions of the studied models. Our results are new and complement known results in the literature. The theoretical analysis is illustrated with some examples and numerical simulations.

Passive synchronization for Markov jump genetic oscillator networks with time-varying delays.

PubMed

Lu, Li; He, Bing; Man, Chuntao; Wang, Shun

2015-04-01

In this paper, the synchronization problem of coupled Markov jump genetic oscillator networks with time-varying delays and external disturbances is investigated. By introducing the drive-response concept, a novel mode-dependent control scheme is proposed, which guarantees that the synchronization can be achieved. By applying the Lyapunov-Krasovskii functional method and stochastic analysis, sufficient conditions are established based on passivity theory in terms of linear matrix inequalities. A numerical example is provided to demonstrate the effectiveness of our theoretical results. Copyright © 2015 Elsevier Inc. All rights reserved.

Delay-slope-dependent stability results of recurrent neural networks.

PubMed

Li, Tao; Zheng, Wei Xing; Lin, Chong

2011-12-01

By using the fact that the neuron activation functions are sector bounded and nondecreasing, this brief presents a new method, named the delay-slope-dependent method, for stability analysis of a class of recurrent neural networks with time-varying delays. This method includes more information on the slope of neuron activation functions and fewer matrix variables in the constructed Lyapunov-Krasovskii functional. Then some improved delay-dependent stability criteria with less computational burden and conservatism are obtained. Numerical examples are given to illustrate the effectiveness and the benefits of the proposed method.

Applications of network analysis for adaptive management of artificial drainage systems in landscapes vulnerable to sea level rise

NASA Astrophysics Data System (ADS)

Poulter, Benjamin; Goodall, Jonathan L.; Halpin, Patrick N.

2008-08-01

SummaryThe vulnerability of coastal landscapes to sea level rise is compounded by the existence of extensive artificial drainage networks initially built to lower water tables for agriculture, forestry, and human settlements. These drainage networks are found in landscapes with little topographic relief where channel flow is characterized by bi-directional movement across multiple time-scales and related to precipitation, wind, and tidal patterns. The current configuration of many artificial drainage networks exacerbates impacts associated with sea level rise such as salt-intrusion and increased flooding. This suggests that in the short-term, drainage networks might be managed to mitigate sea level rise related impacts. The challenge, however, is that hydrologic processes in regions where channel flow direction is weakly related to slope and topography require extensive parameterization for numerical models which is limited where network size is on the order of a hundred or more kilometers in total length. Here we present an application of graph theoretic algorithms to efficiently investigate network properties relevant to the management of a large artificial drainage system in coastal North Carolina, USA. We created a digital network model representing the observation network topology and four types of drainage features (canal, collector and field ditches, and streams). We applied betweenness-centrality concepts (using Dijkstra's shortest path algorithm) to determine major hydrologic flowpaths based off of hydraulic resistance. Following this, we identified sub-networks that could be managed independently using a community structure and modularity approach. Lastly, a betweenness-centrality algorithm was applied to identify major shoreline entry points to the network that disproportionately control water movement in and out of the network. We demonstrate that graph theory can be applied to solving management and monitoring problems associated with sea level rise for poorly understood drainage networks in advance of numerical methods.

STICAP: A linear circuit analysis program with stiff systems capability. Volume 1: Theory manual. [network analysis

NASA Technical Reports Server (NTRS)

Cooke, C. H.

1975-01-01

STICAP (Stiff Circuit Analysis Program) is a FORTRAN 4 computer program written for the CDC-6400-6600 computer series and SCOPE 3.0 operating system. It provides the circuit analyst a tool for automatically computing the transient responses and frequency responses of large linear time invariant networks, both stiff and nonstiff (algorithms and numerical integration techniques are described). The circuit description and user's program input language is engineer-oriented, making simple the task of using the program. Engineering theories underlying STICAP are examined. A user's manual is included which explains user interaction with the program and gives results of typical circuit design applications. Also, the program structure from a systems programmer's viewpoint is depicted and flow charts and other software documentation are given.

Performance Analysis of Classification Methods for Indoor Localization in Vlc Networks

NASA Astrophysics Data System (ADS)

Sánchez-Rodríguez, D.; Alonso-González, I.; Sánchez-Medina, J.; Ley-Bosch, C.; Díaz-Vilariño, L.

2017-09-01

Indoor localization has gained considerable attention over the past decade because of the emergence of numerous location-aware services. Research works have been proposed on solving this problem by using wireless networks. Nevertheless, there is still much room for improvement in the quality of the proposed classification models. In the last years, the emergence of Visible Light Communication (VLC) brings a brand new approach to high quality indoor positioning. Among its advantages, this new technology is immune to electromagnetic interference and has the advantage of having a smaller variance of received signal power compared to RF based technologies. In this paper, a performance analysis of seventeen machine leaning classifiers for indoor localization in VLC networks is carried out. The analysis is accomplished in terms of accuracy, average distance error, computational cost, training size, precision and recall measurements. Results show that most of classifiers harvest an accuracy above 90 %. The best tested classifier yielded a 99.0 % accuracy, with an average error distance of 0.3 centimetres.

SYNCHRONIZATION OF HETEROGENEOUS OSCILLATORS UNDER NETWORK MODIFICATIONS: PERTURBATION AND OPTIMIZATION OF THE SYNCHRONY ALIGNMENT FUNCTION

PubMed Central

Taylor, Dane; Skardal, Per Sebastian; Sun, Jie

2016-01-01

Synchronization is central to many complex systems in engineering physics (e.g., the power-grid, Josephson junction circuits, and electro-chemical oscillators) and biology (e.g., neuronal, circadian, and cardiac rhythms). Despite these widespread applications—for which proper functionality depends sensitively on the extent of synchronization—there remains a lack of understanding for how systems can best evolve and adapt to enhance or inhibit synchronization. We study how network modifications affect the synchronization properties of network-coupled dynamical systems that have heterogeneous node dynamics (e.g., phase oscillators with non-identical frequencies), which is often the case for real-world systems. Our approach relies on a synchrony alignment function (SAF) that quantifies the interplay between heterogeneity of the network and of the oscillators and provides an objective measure for a system’s ability to synchronize. We conduct a spectral perturbation analysis of the SAF for structural network modifications including the addition and removal of edges, which subsequently ranks the edges according to their importance to synchronization. Based on this analysis, we develop gradient-descent algorithms to efficiently solve optimization problems that aim to maximize phase synchronization via network modifications. We support these and other results with numerical experiments. PMID:27872501

Design of Neural Networks for Fast Convergence and Accuracy

NASA Technical Reports Server (NTRS)

Maghami, Peiman G.; Sparks, Dean W., Jr.

1998-01-01

A novel procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed to provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component spacecraft design changes and measures of its performance. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The design algorithm attempts to avoid the local minima phenomenon that hampers the traditional network training. A numerical example is performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Effect of risk perception on epidemic spreading in temporal networks

NASA Astrophysics Data System (ADS)

Moinet, Antoine; Pastor-Satorras, Romualdo; Barrat, Alain

2018-01-01

Many progresses in the understanding of epidemic spreading models have been obtained thanks to numerous modeling efforts and analytical and numerical studies, considering host populations with very different structures and properties, including complex and temporal interaction networks. Moreover, a number of recent studies have started to go beyond the assumption of an absence of coupling between the spread of a disease and the structure of the contacts on which it unfolds. Models including awareness of the spread have been proposed, to mimic possible precautionary measures taken by individuals that decrease their risk of infection, but have mostly considered static networks. Here, we adapt such a framework to the more realistic case of temporal networks of interactions between individuals. We study the resulting model by analytical and numerical means on both simple models of temporal networks and empirical time-resolved contact data. Analytical results show that the epidemic threshold is not affected by the awareness but that the prevalence can be significantly decreased. Numerical studies on synthetic temporal networks highlight, however, the presence of very strong finite-size effects, resulting in a significant shift of the effective epidemic threshold in the presence of risk awareness. For empirical contact networks, the awareness mechanism leads as well to a shift in the effective threshold and to a strong reduction of the epidemic prevalence.

Reactive immunization on complex networks

NASA Astrophysics Data System (ADS)

Alfinito, Eleonora; Beccaria, Matteo; Fachechi, Alberto; Macorini, Guido

2017-01-01

Epidemic spreading on complex networks depends on the topological structure as well as on the dynamical properties of the infection itself. Generally speaking, highly connected individuals play the role of hubs and are crucial to channel information across the network. On the other hand, static topological quantities measuring the connectivity structure are independent of the dynamical mechanisms of the infection. A natural question is therefore how to improve the topological analysis by some kind of dynamical information that may be extracted from the ongoing infection itself. In this spirit, we propose a novel vaccination scheme that exploits information from the details of the infection pattern at the moment when the vaccination strategy is applied. Numerical simulations of the infection process show that the proposed immunization strategy is effective and robust on a wide class of complex networks.

Finite-time synchronization for memristor-based neural networks with time-varying delays.

PubMed

Abdurahman, Abdujelil; Jiang, Haijun; Teng, Zhidong

2015-09-01

Memristive network exhibits state-dependent switching behaviors due to the physical properties of memristor, which is an ideal tool to mimic the functionalities of the human brain. In this paper, finite-time synchronization is considered for a class of memristor-based neural networks with time-varying delays. Based on the theory of differential equations with discontinuous right-hand side, several new sufficient conditions ensuring the finite-time synchronization of memristor-based chaotic neural networks are obtained by using analysis technique, finite time stability theorem and adding a suitable feedback controller. Besides, the upper bounds of the settling time of synchronization are estimated. Finally, a numerical example is given to show the effectiveness and feasibility of the obtained results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Rumor Spreading Model with Trust Mechanism in Complex Social Networks

NASA Astrophysics Data System (ADS)

Wang, Ya-Qi; Yang, Xiao-Yuan; Han, Yi-Liang; Wang, Xu-An

2013-04-01

In this paper, to study rumor spreading, we propose a novel susceptible-infected-removed (SIR) model by introducing the trust mechanism. We derive mean-field equations that describe the dynamics of the SIR model on homogeneous networks and inhomogeneous networks. Then a steady-state analysis is conducted to investigate the critical threshold and the final size of the rumor spreading. We show that the introduction of trust mechanism reduces the final rumor size and the velocity of rumor spreading, but increases the critical thresholds on both networks. Moreover, the trust mechanism not only greatly reduces the maximum rumor influence, but also postpones the rumor terminal time, which provides us with more time to take measures to control the rumor spreading. The theoretical results are confirmed by sufficient numerical simulations.

Neural network-based system for pattern recognition through a fiber optic bundle

NASA Astrophysics Data System (ADS)

Gamo-Aranda, Javier; Rodriguez-Horche, Paloma; Merchan-Palacios, Miguel; Rosales-Herrera, Pablo; Rodriguez, M.

2001-04-01

A neural network based system to identify images transmitted through a Coherent Fiber-optic Bundle (CFB) is presented. Patterns are generated in a computer, displayed on a Spatial Light Modulator, imaged onto the input face of the CFB, and recovered optically by a CCD sensor array for further processing. Input and output optical subsystems were designed and used to that end. The recognition step of the transmitted patterns is made by a powerful, widely-used, neural network simulator running on the control PC. A complete PC-based interface was developed to control the different tasks involved in the system. An optical analysis of the system capabilities was carried out prior to performing the recognition step. Several neural network topologies were tested, and the corresponding numerical results are also presented and discussed.

Autaptic effects on synchrony of neurons coupled by electrical synapses

NASA Astrophysics Data System (ADS)

Kim, Youngtae

2017-07-01

In this paper, we numerically study the effects of a special synapse known as autapse on synchronization of population of Morris-Lecar (ML) neurons coupled by electrical synapses. Several configurations of the ML neuronal populations such as a pair or a ring or a globally coupled network with and without autapses are examined. While most of the papers on the autaptic effects on synchronization have used networks of neurons of same spiking rate, we use the network of neurons of different spiking rates. We find that the optimal autaptic coupling strength and the autaptic time delay enhance synchronization in our neural networks. We use the phase response curve analysis to explain the enhanced synchronization by autapses. Our findings reveal the important relationship between the intraneuronal feedback loop and the interneuronal coupling.

Hydraulic Fracture Extending into Network in Shale: Reviewing Influence Factors and Their Mechanism

PubMed Central

Ren, Lan; Zhao, Jinzhou; Hu, Yongquan

2014-01-01

Hydraulic fracture in shale reservoir presents complex network propagation, which has essential difference with traditional plane biwing fracture at forming mechanism. Based on the research results of experiments, field fracturing practice, theory analysis, and numerical simulation, the influence factors and their mechanism of hydraulic fracture extending into network in shale have been systematically analyzed and discussed. Research results show that the fracture propagation in shale reservoir is influenced by the geological and the engineering factors, which includes rock mineral composition, rock mechanical properties, horizontal stress field, natural fractures, treating net pressure, fracturing fluid viscosity, and fracturing scale. This study has important theoretical value and practical significance to understand fracture network propagation mechanism in shale reservoir and contributes to improving the science and efficiency of shale reservoir fracturing design. PMID:25032240

Space evolution model and empirical analysis of an urban public transport network

NASA Astrophysics Data System (ADS)

Sui, Yi; Shao, Feng-jing; Sun, Ren-cheng; Li, Shu-jing

2012-07-01

This study explores the space evolution of an urban public transport network, using empirical evidence and a simulation model validated on that data. Public transport patterns primarily depend on traffic spatial-distribution, demands of passengers and expected utility of investors. Evolution is an iterative process of satisfying the needs of passengers and investors based on a given traffic spatial-distribution. The temporal change of urban public transport network is evaluated both using topological measures and spatial ones. The simulation model is validated using empirical data from nine big cities in China. Statistical analyses on topological and spatial attributes suggest that an evolution network with traffic demands characterized by power-law numerical values which distribute in a mode of concentric circles tallies well with these nine cities.

Synchronization stability of memristor-based complex-valued neural networks with time delays.

PubMed

Liu, Dan; Zhu, Song; Ye, Er

2017-12-01

This paper focuses on the dynamical property of a class of memristor-based complex-valued neural networks (MCVNNs) with time delays. By constructing the appropriate Lyapunov functional and utilizing the inequality technique, sufficient conditions are proposed to guarantee exponential synchronization of the coupled systems based on drive-response concept. The proposed results are very easy to verify, and they also extend some previous related works on memristor-based real-valued neural networks. Meanwhile, the obtained sufficient conditions of this paper may be conducive to qualitative analysis of some complex-valued nonlinear delayed systems. A numerical example is given to demonstrate the effectiveness of our theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Evolutionary dynamics on networks of selectively neutral genotypes: effects of topology and sequence stability.

PubMed

Aguirre, Jacobo; Buldú, Javier M; Manrubia, Susanna C

2009-12-01

Networks of selectively neutral genotypes underlie the evolution of populations of replicators in constant environments. Previous theoretical analysis predicted that such populations will evolve toward highly connected regions of the genome space. We first study the evolution of populations of replicators on simple networks and quantify how the transient time to equilibrium depends on the initial distribution of sequences on the neutral network, on the topological properties of the latter, and on the mutation rate. Second, network neutrality is broken through the introduction of an energy for each sequence. This allows to study the competition between two features (neutrality and energetic stability) relevant for survival and subjected to different selective pressures. In cases where the two features are negatively correlated, the population experiences sudden migrations in the genome space for values of the relevant parameters that we calculate. The numerical study of larger networks indicates that the qualitative behavior to be expected in more realistic cases is already seen in representative examples of small networks.

Evolutionary dynamics on networks of selectively neutral genotypes: Effects of topology and sequence stability

NASA Astrophysics Data System (ADS)

Aguirre, Jacobo; Buldú, Javier M.; Manrubia, Susanna C.

2009-12-01

Networks of selectively neutral genotypes underlie the evolution of populations of replicators in constant environments. Previous theoretical analysis predicted that such populations will evolve toward highly connected regions of the genome space. We first study the evolution of populations of replicators on simple networks and quantify how the transient time to equilibrium depends on the initial distribution of sequences on the neutral network, on the topological properties of the latter, and on the mutation rate. Second, network neutrality is broken through the introduction of an energy for each sequence. This allows to study the competition between two features (neutrality and energetic stability) relevant for survival and subjected to different selective pressures. In cases where the two features are negatively correlated, the population experiences sudden migrations in the genome space for values of the relevant parameters that we calculate. The numerical study of larger networks indicates that the qualitative behavior to be expected in more realistic cases is already seen in representative examples of small networks.

Influence of Landscape Coverage on Measuring Spatial and Length Properties of Rock Fracture Networks: Insights from Numerical Simulation

NASA Astrophysics Data System (ADS)

Cao, Wenzhuo; Lei, Qinghua

2018-01-01

Natural fractures are ubiquitous in the Earth's crust and often deeply buried in the subsurface. Due to the difficulty in accessing to their three-dimensional structures, the study of fracture network geometry is usually achieved by sampling two-dimensional (2D) exposures at the Earth's surface through outcrop mapping or aerial photograph techniques. However, the measurement results can be considerably affected by the coverage of forests and other plant species over the exposed fracture patterns. We quantitatively study such effects using numerical simulation. We consider the scenario of nominally isotropic natural fracture systems and represent them using 2D discrete fracture network models governed by fractal and length scaling parameters. The groundcover is modelled as random patches superimposing onto the 2D fracture patterns. The effects of localisation and total coverage of landscape patches are further investigated. The fractal dimension and length exponent of the covered fracture networks are measured and compared with those of the original non-covered patterns. The results show that the measured length exponent increases with the reduced localisation and increased coverage of landscape patches, which is more evident for networks dominated by very large fractures (i.e. small underlying length exponent). However, the landscape coverage seems to have a minor impact on the fractal dimension measurement. The research findings of this paper have important implications for field survey and statistical analysis of geological systems.

Optimal Micropatterns in 2D Transport Networks and Their Relation to Image Inpainting

NASA Astrophysics Data System (ADS)

Brancolini, Alessio; Rossmanith, Carolin; Wirth, Benedikt

2018-04-01

We consider two different variational models of transport networks: the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field, we show for a two-dimensional situation that both highly non-convex network optimization tasks can be transformed into a convex variational problem, which may be very useful from analytical and numerical perspectives. As applications of the convex formulation, we use it to perform numerical simulations (to our knowledge this is the first numerical treatment of urban planning), and we prove a lower bound for the network cost that matches a known upper bound (in terms of how the cost scales in the model parameters) which helps better understand optimal networks and their minimal costs.

PageRank versatility analysis of multilayer modality-based network for exploring the evolution of oil-water slug flow.

PubMed

Gao, Zhong-Ke; Dang, Wei-Dong; Li, Shan; Yang, Yu-Xuan; Wang, Hong-Tao; Sheng, Jing-Ran; Wang, Xiao-Fan

2017-07-14

Numerous irregular flow structures exist in the complicated multiphase flow and result in lots of disparate spatial dynamical flow behaviors. The vertical oil-water slug flow continually attracts plenty of research interests on account of its significant importance. Based on the spatial transient flow information acquired through our designed double-layer distributed-sector conductance sensor, we construct multilayer modality-based network to encode the intricate spatial flow behavior. Particularly, we calculate the PageRank versatility and multilayer weighted clustering coefficient to quantitatively explore the inferred multilayer modality-based networks. Our analysis allows characterizing the complicated evolution of oil-water slug flow, from the opening formation of oil slugs, to the succedent inter-collision and coalescence among oil slugs, and then to the dispersed oil bubbles. These properties render our developed method particularly powerful for mining the essential flow features from the multilayer sensor measurements.

Efficient Power Network Analysis with Modeling of Inductive Effects

NASA Astrophysics Data System (ADS)

Zeng, Shan; Yu, Wenjian; Hong, Xianlong; Cheng, Chung-Kuan

In this paper, an efficient method is proposed to accurately analyze large-scale power/ground (P/G) networks, where inductive parasitics are modeled with the partial reluctance. The method is based on frequency-domain circuit analysis and the technique of vector fitting [14], and obtains the time-domain voltage response at given P/G nodes. The frequency-domain circuit equation including partial reluctances is derived, and then solved with the GMRES algorithm with rescaling, preconditioning and recycling techniques. With the merit of sparsified reluctance matrix and iterative solving techniques for the frequency-domain circuit equations, the proposed method is able to handle large-scale P/G networks with complete inductive modeling. Numerical results show that the proposed method is orders of magnitude faster than HSPICE, several times faster than INDUCTWISE [4], and capable of handling the inductive P/G structures with more than 100, 000 wire segments.

COHERENT NETWORK ANALYSIS FOR CONTINUOUS GRAVITATIONAL WAVE SIGNALS IN A PULSAR TIMING ARRAY: PULSAR PHASES AS EXTRINSIC PARAMETERS

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

Wang, Yan; Mohanty, Soumya D.; Jenet, Fredrick A., E-mail: ywang12@hust.edu.cn

2015-12-20

Supermassive black hole binaries are one of the primary targets of gravitational wave (GW) searches using pulsar timing arrays (PTAs). GW signals from such systems are well represented by parameterized models, allowing the standard Generalized Likelihood Ratio Test (GLRT) to be used for their detection and estimation. However, there is a dichotomy in how the GLRT can be implemented for PTAs: there are two possible ways in which one can split the set of signal parameters for semi-analytical and numerical extremization. The straightforward extension of the method used for continuous signals in ground-based GW searches, where the so-called pulsar phasemore » parameters are maximized numerically, was addressed in an earlier paper. In this paper, we report the first study of the performance of the second approach where the pulsar phases are maximized semi-analytically. This approach is scalable since the number of parameters left over for numerical optimization does not depend on the size of the PTA. Our results show that for the same array size (9 pulsars), the new method performs somewhat worse in parameter estimation, but not in detection, than the previous method where the pulsar phases were maximized numerically. The origin of the performance discrepancy is likely to be in the ill-posedness that is intrinsic to any network analysis method. However, the scalability of the new method allows the ill-posedness to be mitigated by simply adding more pulsars to the array. This is shown explicitly by taking a larger array of pulsars.« less

Suppressing epidemics on networks by exploiting observer nodes.

PubMed

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

Suppressing epidemics on networks by exploiting observer nodes

NASA Astrophysics Data System (ADS)

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

Altered brain functional networks in people with Internet gaming disorder: Evidence from resting-state fMRI.

PubMed

Wang, Lingxiao; Wu, Lingdan; Lin, Xiao; Zhang, Yifen; Zhou, Hongli; Du, Xiaoxia; Dong, Guangheng

2016-08-30

Although numerous neuroimaging studies have detected structural and functional abnormality in specific brain regions and connections in subjects with Internet gaming disorder (IGD), the topological organization of the whole-brain network in IGD remain unclear. In this study, we applied graph theoretical analysis to explore the intrinsic topological properties of brain networks in Internet gaming disorder (IGD). 37 IGD subjects and 35 matched healthy control (HC) subjects underwent a resting-state functional magnetic resonance imaging scan. The functional networks were constructed by thresholding partial correlation matrices of 90 brain regions. Then we applied graph-based approaches to analysis their topological attributes, including small-worldness, nodal metrics, and efficiency. Both IGD and HC subjects show efficient and economic brain network, and small-world topology. Although there was no significant group difference in global topology metrics, the IGD subjects showed reduced regional centralities in the prefrontal cortex, left posterior cingulate cortex, right amygdala, and bilateral lingual gyrus, and increased functional connectivity in sensory-motor-related brain networks compared to the HC subjects. These results imply that people with IGD may be associated with functional network dysfunction, including impaired executive control and emotional management, but enhanced coordination among visual, sensorimotor, auditory and visuospatial systems. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

MetaMapR: pathway independent metabolomic network analysis incorporating unknowns.

PubMed

Grapov, Dmitry; Wanichthanarak, Kwanjeera; Fiehn, Oliver

2015-08-15

Metabolic network mapping is a widely used approach for integration of metabolomic experimental results with biological domain knowledge. However, current approaches can be limited by biochemical domain or pathway knowledge which results in sparse disconnected graphs for real world metabolomic experiments. MetaMapR integrates enzymatic transformations with metabolite structural similarity, mass spectral similarity and empirical associations to generate richly connected metabolic networks. This open source, web-based or desktop software, written in the R programming language, leverages KEGG and PubChem databases to derive associations between metabolites even in cases where biochemical domain or molecular annotations are unknown. Network calculation is enhanced through an interface to the Chemical Translation System, which allows metabolite identifier translation between >200 common biochemical databases. Analysis results are presented as interactive visualizations or can be exported as high-quality graphics and numerical tables which can be imported into common network analysis and visualization tools. Freely available at http://dgrapov.github.io/MetaMapR/. Requires R and a modern web browser. Installation instructions, tutorials and application examples are available at http://dgrapov.github.io/MetaMapR/. ofiehn@ucdavis.edu. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Analysis of Spatial Autocorrelation for Optimal Observation Network in Korea

NASA Astrophysics Data System (ADS)

Park, S.; Lee, S.; Lee, E.; Park, S. K.

2016-12-01

Many studies for improving prediction of high-impact weather have been implemented, such as THORPEX (The Observing System Research and Predictability Experiment), FASTEX (Fronts and Atlantic Storm-Track Experiment), NORPEX (North Pacific Experiment), WSR/NOAA (Winter Storm Reconnaissance), and DOTSTAR (Dropwindsonde Observations for Typhoon Surveillance near the TAiwan Region). One of most important objectives in these studies is to find effects of observation on forecast, and to establish optimal observation network. However, there are lack of such studies on Korea, although Korean peninsula exhibits a highly complex terrain so it is difficult to predict its weather phenomena. Through building the future optimal observation network, it is necessary to increase utilization of numerical weather prediction and improve monitoring·tracking·prediction skills of high-impact weather in Korea. Therefore, we will perform preliminary study to understand the spatial scale for an expansion of observation system through Spatial Autocorrelation (SAC) analysis. In additions, we will develop a testbed system to design an optimal observation network. Analysis is conducted with Automatic Weather System (AWS) rainfall data, global upper air grid observation (i.e., temperature, pressure, humidity), Himawari satellite data (i.e., water vapor) during 2013-2015 of Korea. This study will provide a guideline to construct observation network for not only improving weather prediction skill but also cost-effectiveness.

Is Rest Really Rest? Resting State Functional Connectivity during Rest and Motor Task Paradigms.

PubMed

Jurkiewicz, Michael T; Crawley, Adrian P; Mikulis, David J

2018-04-18

Numerous studies have identified the default mode network (DMN) within the brain of healthy individuals, which has been attributed to the ongoing mental activity of the brain during the wakeful resting-state. While engaged during specific resting-state fMRI paradigms, it remains unclear as to whether traditional block-design simple movement fMRI experiments significantly influence the default mode network or other areas. Using blood-oxygen level dependent (BOLD) fMRI we characterized the pattern of functional connectivity in healthy subjects during a resting-state paradigm and compared this to the same resting-state analysis performed on motor task data residual time courses after regressing out the task paradigm. Using seed-voxel analysis to define the DMN, the executive control network (ECN), and sensorimotor, auditory and visual networks, the resting-state analysis of the residual time courses demonstrated reduced functional connectivity in the motor network and reduced connectivity between the insula and the ECN compared to the standard resting-state datasets. Overall, performance of simple self-directed motor tasks does little to change the resting-state functional connectivity across the brain, especially in non-motor areas. This would suggest that previously acquired fMRI studies incorporating simple block-design motor tasks could be mined retrospectively for assessment of the resting-state connectivity.

Complex-network description of thermal quantum states in the Ising spin chain

NASA Astrophysics Data System (ADS)

Sundar, Bhuvanesh; Valdez, Marc Andrew; Carr, Lincoln D.; Hazzard, Kaden R. A.

2018-05-01

We use network analysis to describe and characterize an archetypal quantum system—an Ising spin chain in a transverse magnetic field. We analyze weighted networks for this quantum system, with link weights given by various measures of spin-spin correlations such as the von Neumann and Rényi mutual information, concurrence, and negativity. We analytically calculate the spin-spin correlations in the system at an arbitrary temperature by mapping the Ising spin chain to fermions, as well as numerically calculate the correlations in the ground state using matrix product state methods, and then analyze the resulting networks using a variety of network measures. We demonstrate that the network measures show some traits of complex networks already in this spin chain, arguably the simplest quantum many-body system. The network measures give insight into the phase diagram not easily captured by more typical quantities, such as the order parameter or correlation length. For example, the network structure varies with transverse field and temperature, and the structure in the quantum critical fan is different from the ordered and disordered phases.

Generalised Transfer Functions of Neural Networks

NASA Astrophysics Data System (ADS)

Fung, C. F.; Billings, S. A.; Zhang, H.

1997-11-01

When artificial neural networks are used to model non-linear dynamical systems, the system structure which can be extremely useful for analysis and design, is buried within the network architecture. In this paper, explicit expressions for the frequency response or generalised transfer functions of both feedforward and recurrent neural networks are derived in terms of the network weights. The derivation of the algorithm is established on the basis of the Taylor series expansion of the activation functions used in a particular neural network. This leads to a representation which is equivalent to the non-linear recursive polynomial model and enables the derivation of the transfer functions to be based on the harmonic expansion method. By mapping the neural network into the frequency domain information about the structure of the underlying non-linear system can be recovered. Numerical examples are included to demonstrate the application of the new algorithm. These examples show that the frequency response functions appear to be highly sensitive to the network topology and training, and that the time domain properties fail to reveal deficiencies in the trained network structure.

Impulsive Effects on Quasi-Synchronization of Neural Networks With Parameter Mismatches and Time-Varying Delay.

PubMed

Tang, Ze; Park, Ju H; Feng, Jianwen

2018-04-01

This paper is concerned with the exponential synchronization issue of nonidentically coupled neural networks with time-varying delay. Due to the parameter mismatch phenomena existed in neural networks, the problem of quasi-synchronization is thus discussed by applying some impulsive control strategies. Based on the definition of average impulsive interval and the extended comparison principle for impulsive systems, some criteria for achieving the quasi-synchronization of neural networks are derived. More extensive ranges of impulsive effects are discussed so that impulse could either play an effective role or play an adverse role in the final network synchronization. In addition, according to the extended formula for the variation of parameters with time-varying delay, precisely exponential convergence rates and quasi-synchronization errors are obtained, respectively, in view of different types impulsive effects. Finally, some numerical simulations with different types of impulsive effects are presented to illustrate the effectiveness of theoretical analysis.

Automated quantification of neuronal networks and single-cell calcium dynamics using calcium imaging

PubMed Central

Patel, Tapan P.; Man, Karen; Firestein, Bonnie L.; Meaney, David F.

2017-01-01

Background Recent advances in genetically engineered calcium and membrane potential indicators provide the potential to estimate the activation dynamics of individual neurons within larger, mesoscale networks (100s–1000 +neurons). However, a fully integrated automated workflow for the analysis and visualization of neural microcircuits from high speed fluorescence imaging data is lacking. New method Here we introduce FluoroSNNAP, Fluorescence Single Neuron and Network Analysis Package. FluoroSNNAP is an open-source, interactive software developed in MATLAB for automated quantification of numerous biologically relevant features of both the calcium dynamics of single-cells and network activity patterns. FluoroSNNAP integrates and improves upon existing tools for spike detection, synchronization analysis, and inference of functional connectivity, making it most useful to experimentalists with little or no programming knowledge. Results We apply FluoroSNNAP to characterize the activity patterns of neuronal microcircuits undergoing developmental maturation in vitro. Separately, we highlight the utility of single-cell analysis for phenotyping a mixed population of neurons expressing a human mutant variant of the microtubule associated protein tau and wild-type tau. Comparison with existing method(s) We show the performance of semi-automated cell segmentation using spatiotemporal independent component analysis and significant improvement in detecting calcium transients using a template-based algorithm in comparison to peak-based or wavelet-based detection methods. Our software further enables automated analysis of microcircuits, which is an improvement over existing methods. Conclusions We expect the dissemination of this software will facilitate a comprehensive analysis of neuronal networks, promoting the rapid interrogation of circuits in health and disease. PMID:25629800

The robustness of multiplex networks under layer node-based attack

PubMed Central

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

2016-01-01

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

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

PubMed

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

2016-04-14

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

Application of real rock pore-threat statistics to a regular pore network model

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

Rakibul, M.; Sarker, H.; McIntyre, D.

2011-01-01

This work reports the application of real rock statistical data to a previously developed regular pore network model in an attempt to produce an accurate simulation tool with low computational overhead. A core plug from the St. Peter Sandstone formation in Indiana was scanned with a high resolution micro CT scanner. The pore-throat statistics of the three-dimensional reconstructed rock were extracted and the distribution of the pore-throat sizes was applied to the regular pore network model. In order to keep the equivalent model regular, only the throat area or the throat radius was varied. Ten realizations of randomly distributed throatmore » sizes were generated to simulate the drainage process and relative permeability was calculated and compared with the experimentally determined values of the original rock sample. The numerical and experimental procedures are explained in detail and the performance of the model in relation to the experimental data is discussed and analyzed. Petrophysical properties such as relative permeability are important in many applied fields such as production of petroleum fluids, enhanced oil recovery, carbon dioxide sequestration, ground water flow, etc. Relative permeability data are used for a wide range of conventional reservoir engineering calculations and in numerical reservoir simulation. Two-phase oil water relative permeability data are generated on the same core plug from both pore network model and experimental procedure. The shape and size of the relative permeability curves were compared and analyzed and good match has been observed for wetting phase relative permeability but for non-wetting phase, simulation results were found to be deviated from the experimental ones. Efforts to determine petrophysical properties of rocks using numerical techniques are to eliminate the necessity of regular core analysis, which can be time consuming and expensive. So a numerical technique is expected to be fast and to produce reliable results. In applied engineering, sometimes quick result with reasonable accuracy is acceptable than the more time consuming results. Present work is an effort to check the accuracy and validity of a previously developed pore network model for obtaining important petrophysical properties of rocks based on cutting-sized sample data.« less

Application of real rock pore-throat statistics to a regular pore network model

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

Sarker, M.R.; McIntyre, D.; Ferer, M.

2011-01-01

This work reports the application of real rock statistical data to a previously developed regular pore network model in an attempt to produce an accurate simulation tool with low computational overhead. A core plug from the St. Peter Sandstone formation in Indiana was scanned with a high resolution micro CT scanner. The pore-throat statistics of the three-dimensional reconstructed rock were extracted and the distribution of the pore-throat sizes was applied to the regular pore network model. In order to keep the equivalent model regular, only the throat area or the throat radius was varied. Ten realizations of randomly distributed throatmore » sizes were generated to simulate the drainage process and relative permeability was calculated and compared with the experimentally determined values of the original rock sample. The numerical and experimental procedures are explained in detail and the performance of the model in relation to the experimental data is discussed and analyzed. Petrophysical properties such as relative permeability are important in many applied fields such as production of petroleum fluids, enhanced oil recovery, carbon dioxide sequestration, ground water flow, etc. Relative permeability data are used for a wide range of conventional reservoir engineering calculations and in numerical reservoir simulation. Two-phase oil water relative permeability data are generated on the same core plug from both pore network model and experimental procedure. The shape and size of the relative permeability curves were compared and analyzed and good match has been observed for wetting phase relative permeability but for non-wetting phase, simulation results were found to be deviated from the experimental ones. Efforts to determine petrophysical properties of rocks using numerical techniques are to eliminate the necessity of regular core analysis, which can be time consuming and expensive. So a numerical technique is expected to be fast and to produce reliable results. In applied engineering, sometimes quick result with reasonable accuracy is acceptable than the more time consuming results. Present work is an effort to check the accuracy and validity of a previously developed pore network model for obtaining important petrophysical properties of rocks based on cutting-sized sample data. Introduction« less

Building a Sustainable Quality Matters™ Community of Practice through Social Network Analysis

ERIC Educational Resources Information Center

Cowan, John; Richter, Stephanie; Miller, Tracy; Rhode, Jason; Click, Aline; Underwood, Jason

2017-01-01

The growth of distance education has necessitated strong evidence of quality for institutions of higher education, and numerous standards and principles of quality have been developed, such as Quality Matters™ (Quality Matters). These systems are often considered only at the course level to guide design and improve student outcomes, but they can…

Application of Network Analysis to Identify and Map Relationships between Information Systems in the context of Arctic Sustainability

NASA Astrophysics Data System (ADS)

Kontar, Y. Y.

2017-12-01

The Arctic Council is an intergovernmental forum promoting cooperation, coordination and interaction among the Arctic States and indigenous communities on issues of sustainable development and environmental protection in the North. The work of the Council is primarily carried out by six Working Groups: Arctic Contaminants Action Program, Arctic Monitoring and Assessment Programme, Conservation of Arctic Flora and Fauna, Emergency Prevention, Preparedness and Response, Protection of the Arctic Marine Environment, and Sustainable Development Working Group. The Working Groups are composed of researchers and representatives from government agencies. Each Working Group issues numerous scientific assessments and reports on a broad field of subjects, from climate change to emergency response in the Arctic. A key goal of these publications is to contribute to policy-making in the Arctic. Complex networks of information systems and the connections between the diverse elements within the systems have been identified via network analysis. This allowed to distinguish data sources that were used in the composition of the primary publications of the Working Groups. Next step is to implement network analysis to identify and map the relationships between the Working Groups and policy makers in the Arctic.

Development of a Bayesian Belief Network Runway Incursion and Excursion Model

NASA Technical Reports Server (NTRS)

Green, Lawrence L.

2014-01-01

In a previous work, a statistical analysis of runway incursion (RI) event data was conducted to ascertain the relevance of this data to the top ten Technical Challenges (TC) of the National Aeronautics and Space Administration (NASA) Aviation Safety Program (AvSP). The study revealed connections to several of the AvSP top ten TC and identified numerous primary causes and contributing factors of RI events. The statistical analysis served as the basis for developing a system-level Bayesian Belief Network (BBN) model for RI events, also previously reported. Through literature searches and data analysis, this RI event network has now been extended to also model runway excursion (RE) events. These RI and RE event networks have been further modified and vetted by a Subject Matter Expert (SME) panel. The combined system-level BBN model will allow NASA to generically model the causes of RI and RE events and to assess the effectiveness of technology products being developed under NASA funding. These products are intended to reduce the frequency of runway safety incidents/accidents, and to improve runway safety in general. The development and structure of the BBN for both RI and RE events are documented in this paper.

Throughput and delay analysis of IEEE 802.15.6-based CSMA/CA protocol.

PubMed

Ullah, Sana; Chen, Min; Kwak, Kyung Sup

2012-12-01

The IEEE 802.15.6 is a new communication standard on Wireless Body Area Network (WBAN) that focuses on a variety of medical, Consumer Electronics (CE) and entertainment applications. In this paper, the throughput and delay performance of the IEEE 802.15.6 is presented. Numerical formulas are derived to determine the maximum throughput and minimum delay limits of the IEEE 802.15.6 for an ideal channel with no transmission errors. These limits are derived for different frequency bands and data rates. Our analysis is validated by extensive simulations using a custom C+ + simulator. Based on analytical and simulation results, useful conclusions are derived for network provisioning and packet size optimization for different applications.

Outage Analysis of Dual-hop Cognitive Networks with Relay Selection over Nakagami-m Fading Environment

NASA Astrophysics Data System (ADS)

Zhang, Zongsheng; Pi, Xurong

2014-09-01

In this paper, we investigate the outage performance of decode-and-forward cognitive relay networks for Nakagami-m fading channels, with considering both best relay selection and interference constraints. Focusing on the relay selection and making use of the underlay cognitive approach, an exact closed-form outage probability expression is derived in an independent, non-identical distributed Nakagami-m environment. The closed-form outage probability provides an efficient means to evaluate the effects of the maximum allowable interference power, number of cognitive relays, and channel conditions between the primary user and cognitive users. Finally, we present numerical results to validate the theory analysis. Moreover, from the simulation results, we obtain that the system can obtain the full diversity.

GeneNetWeaver: in silico benchmark generation and performance profiling of network inference methods.

PubMed

Schaffter, Thomas; Marbach, Daniel; Floreano, Dario

2011-08-15

Over the last decade, numerous methods have been developed for inference of regulatory networks from gene expression data. However, accurate and systematic evaluation of these methods is hampered by the difficulty of constructing adequate benchmarks and the lack of tools for a differentiated analysis of network predictions on such benchmarks. Here, we describe a novel and comprehensive method for in silico benchmark generation and performance profiling of network inference methods available to the community as an open-source software called GeneNetWeaver (GNW). In addition to the generation of detailed dynamical models of gene regulatory networks to be used as benchmarks, GNW provides a network motif analysis that reveals systematic prediction errors, thereby indicating potential ways of improving inference methods. The accuracy of network inference methods is evaluated using standard metrics such as precision-recall and receiver operating characteristic curves. We show how GNW can be used to assess the performance and identify the strengths and weaknesses of six inference methods. Furthermore, we used GNW to provide the international Dialogue for Reverse Engineering Assessments and Methods (DREAM) competition with three network inference challenges (DREAM3, DREAM4 and DREAM5). GNW is available at http://gnw.sourceforge.net along with its Java source code, user manual and supporting data. Supplementary data are available at Bioinformatics online. dario.floreano@epfl.ch.

Fluid Stochastic Petri Nets: Theory, Applications, and Solution

NASA Technical Reports Server (NTRS)

Horton, Graham; Kulkarni, Vidyadhar G.; Nicol, David M.; Trivedi, Kishor S.

1996-01-01

In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold fluid rather than discrete tokens. We define a class of fluid stochastic Petri nets in such a way that the discrete and continuous portions may affect each other. Following this definition we provide equations for their transient and steady-state behavior. We present several examples showing the utility of the construct in communication network modeling and reliability analysis, and discuss important special cases. We then discuss numerical methods for computing the transient behavior of such nets. Finally, some numerical examples are presented.

One-year test-retest reliability of intrinsic connectivity network fMRI in older adults

PubMed Central

Guo, Cong C.; Kurth, Florian; Zhou, Juan; Mayer, Emeran A.; Eickhoff, Simon B; Kramer, Joel H.; Seeley, William W.

2014-01-01

“Resting-state” or task-free fMRI can assess intrinsic connectivity network (ICN) integrity in health and disease, suggesting a potential for use of these methods as disease-monitoring biomarkers. Numerous analytical options are available, including model-driven ROI-based correlation analysis and model-free, independent component analysis (ICA). High test-retest reliability will be a necessary feature of a successful ICN biomarker, yet available reliability data remains limited. Here, we examined ICN fMRI test-retest reliability in 24 healthy older subjects scanned roughly one year apart. We focused on the salience network, a disease-relevant ICN not previously subjected to reliability analysis. Most ICN analytical methods proved reliable (intraclass coefficients > 0.4) and could be further improved by wavelet analysis. Seed-based ROI correlation analysis showed high map-wise reliability, whereas graph theoretical measures and temporal concatenation group ICA produced the most reliable individual unit-wise outcomes. Including global signal regression in ROI-based correlation analyses reduced reliability. Our study provides a direct comparison between the most commonly used ICN fMRI methods and potential guidelines for measuring intrinsic connectivity in aging control and patient populations over time. PMID:22446491

Impact of leakage delay on bifurcation in high-order fractional BAM neural networks.

PubMed

Huang, Chengdai; Cao, Jinde

2018-02-01

The effects of leakage delay on the dynamics of neural networks with integer-order have lately been received considerable attention. It has been confirmed that fractional neural networks more appropriately uncover the dynamical properties of neural networks, but the results of fractional neural networks with leakage delay are relatively few. This paper primarily concentrates on the issue of bifurcation for high-order fractional bidirectional associative memory(BAM) neural networks involving leakage delay. The first attempt is made to tackle the stability and bifurcation of high-order fractional BAM neural networks with time delay in leakage terms in this paper. The conditions for the appearance of bifurcation for the proposed systems with leakage delay are firstly established by adopting time delay as a bifurcation parameter. Then, the bifurcation criteria of such system without leakage delay are successfully acquired. Comparative analysis wondrously detects that the stability performance of the proposed high-order fractional neural networks is critically weakened by leakage delay, they cannot be overlooked. Numerical examples are ultimately exhibited to attest the efficiency of the theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Optimal control strategy for a novel computer virus propagation model on scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Chunming; Huang, Haitao

2016-06-01

This paper aims to study the combined impact of reinstalling system and network topology on the spread of computer viruses over the Internet. Based on scale-free network, this paper proposes a novel computer viruses propagation model-SLBOSmodel. A systematic analysis of this new model shows that the virus-free equilibrium is globally asymptotically stable when its spreading threshold is less than one; nevertheless, it is proved that the viral equilibrium is permanent if the spreading threshold is greater than one. Then, the impacts of different model parameters on spreading threshold are analyzed. Next, an optimally controlled SLBOS epidemic model on complex networks is also studied. We prove that there is an optimal control existing for the control problem. Some numerical simulations are finally given to illustrate the main results.

An improved network model for railway traffic

NASA Astrophysics Data System (ADS)

Li, Keping; Ma, Xin; Shao, Fubo

In railway traffic, safety analysis is a key issue for controlling train operation. Here, the identification and order of key factors are very important. In this paper, a new network model is constructed for analyzing the railway safety, in which nodes are regarded as causation factors and links represent possible relationships among those factors. Our aim is to give all these nodes an importance order, and to find the in-depth relationship among these nodes including how failures spread among them. Based on the constructed network model, we propose a control method to ensure the safe state by setting each node a threshold. As the results, by protecting the Hub node of the constructed network, the spreading of railway accident can be controlled well. The efficiency of such a method is further tested with the help of numerical example.

Divisibility patterns of natural numbers on a complex network.

PubMed

Shekatkar, Snehal M; Bhagwat, Chandrasheel; Ambika, G

2015-09-16

Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of natural numbers in the context of divisibility. In the present paper, we study the divisibility of natural numbers using the framework of a growing complex network. In particular, using tools from the field of statistical inference, we show that the network is scale-free but has a non-stationary degree distribution. Along with this, we report a new kind of similarity pattern for the local clustering, which we call "stretching similarity", in this network. We also show that the various characteristics like average degree, global clustering coefficient and assortativity coefficient of the network vary smoothly with the size of the network. Using analytical arguments we estimate the asymptotic behavior of global clustering and average degree which is validated using numerical analysis.

Novel approaches to pin cluster synchronization on complex dynamical networks in Lur'e forms

NASA Astrophysics Data System (ADS)

Tang, Ze; Park, Ju H.; Feng, Jianwen

2018-04-01

This paper investigates the cluster synchronization of complex dynamical networks consisted of identical or nonidentical Lur'e systems. Due to the special topology structure of the complex networks and the existence of stochastic perturbations, a kind of randomly occurring pinning controller is designed which not only synchronizes all Lur'e systems in the same cluster but also decreases the negative influence among different clusters. Firstly, based on an extended integral inequality, the convex combination theorem and S-procedure, the conditions for cluster synchronization of identical Lur'e networks are derived in a convex domain. Secondly, randomly occurring adaptive pinning controllers with two independent Bernoulli stochastic variables are designed and then sufficient conditions are obtained for the cluster synchronization on complex networks consisted of nonidentical Lur'e systems. In addition, suitable control gains for successful cluster synchronization of nonidentical Lur'e networks are acquired by designing some adaptive updating laws. Finally, we present two numerical examples to demonstrate the validity of the control scheme and the theoretical analysis.

Periodicity and global exponential stability of generalized Cohen-Grossberg neural networks with discontinuous activations and mixed delays.

PubMed

Wang, Dongshu; Huang, Lihong

2014-03-01

In this paper, we investigate the periodic dynamical behaviors for a class of general Cohen-Grossberg neural networks with discontinuous right-hand sides, time-varying and distributed delays. By means of retarded differential inclusions theory and the fixed point theorem of multi-valued maps, the existence of periodic solutions for the neural networks is obtained. After that, we derive some sufficient conditions for the global exponential stability and convergence of the neural networks, in terms of nonsmooth analysis theory with generalized Lyapunov approach. Without assuming the boundedness (or the growth condition) and monotonicity of the discontinuous neuron activation functions, our results will also be valid. Moreover, our results extend previous works not only on discrete time-varying and distributed delayed neural networks with continuous or even Lipschitz continuous activations, but also on discrete time-varying and distributed delayed neural networks with discontinuous activations. We give some numerical examples to show the applicability and effectiveness of our main results. Copyright © 2013 Elsevier Ltd. All rights reserved.

Neural network for nonsmooth pseudoconvex optimization with general convex constraints.

PubMed

Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping

2018-05-01

In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.

Manual of Documentation Practices Applicable to Defence-Aerospace Scientific and Technical Information. Volume 1. Section 1 - Acquisition and Sources. Section 2 - Descriptive Cataloguing. Section 3 - Abstracting and Subject Analysis

DTIC Science & Technology

1978-08-01

weeding I I ORGANISATION & MANAGEMENT Aims and objectives, staffing, promotional activities, identifying u;ers 12 NETWORKS & EXTERNAL SOURCES OF...Acquisition Clerks with typing capability are required for meticulous recordkeeping. Typing capability of 50 words per minute and a working knowledge ...81 Adminhistration and Management Includes management planning and research. 64 Numerical Analysis Includes iteration, difference equations, and 82

Brain Structural Integrity and Intrinsic Functional Connectivity Forecast 6 Year Longitudinal Growth in Children's Numerical Abilities.

PubMed

Evans, Tanya M; Kochalka, John; Ngoon, Tricia J; Wu, Sarah S; Qin, Shaozheng; Battista, Christian; Menon, Vinod

2015-08-19

Early numerical proficiency lays the foundation for acquiring quantitative skills essential in today's technological society. Identification of cognitive and brain markers associated with long-term growth of children's basic numerical computation abilities is therefore of utmost importance. Previous attempts to relate brain structure and function to numerical competency have focused on behavioral measures from a single time point. Thus, little is known about the brain predictors of individual differences in growth trajectories of numerical abilities. Using a longitudinal design, with multimodal imaging and machine-learning algorithms, we investigated whether brain structure and intrinsic connectivity in early childhood are predictive of 6 year outcomes in numerical abilities spanning childhood and adolescence. Gray matter volume at age 8 in distributed brain regions, including the ventrotemporal occipital cortex (VTOC), the posterior parietal cortex, and the prefrontal cortex, predicted longitudinal gains in numerical, but not reading, abilities. Remarkably, intrinsic connectivity analysis revealed that the strength of functional coupling among these regions also predicted gains in numerical abilities, providing novel evidence for a network of brain regions that works in concert to promote numerical skill acquisition. VTOC connectivity with posterior parietal, anterior temporal, and dorsolateral prefrontal cortices emerged as the most extensive network predicting individual gains in numerical abilities. Crucially, behavioral measures of mathematics, IQ, working memory, and reading did not predict children's gains in numerical abilities. Our study identifies, for the first time, functional circuits in the human brain that scaffold the development of numerical skills, and highlights potential biomarkers for identifying children at risk for learning difficulties. Children show substantial individual differences in math abilities and ease of math learning. Early numerical abilities provide the foundation for future academic and professional success in an increasingly technological society. Understanding the early identification of poor math skills has therefore taken on great significance. This work provides important new insights into brain structure and connectivity measures that can predict longitudinal growth of children's math skills over a 6 year period, and may eventually aid in the early identification of children who might benefit from targeted interventions. Copyright © 2015 the authors 0270-6474/15/3511743-08$15.00/0.

On the Achievable Throughput Over TVWS Sensor Networks

PubMed Central

Caleffi, Marcello; Cacciapuoti, Angela Sara

2016-01-01

In this letter, we study the throughput achievable by an unlicensed sensor network operating over TV white space spectrum in presence of coexistence interference. Through the letter, we first analytically derive the achievable throughput as a function of the channel ordering. Then, we show that the problem of deriving the maximum expected throughput through exhaustive search is computationally unfeasible. Finally, we derive a computational-efficient algorithm characterized by polynomial-time complexity to compute the channel set maximizing the expected throughput and, stemming from this, we derive a closed-form expression of the maximum expected throughput. Numerical simulations validate the theoretical analysis. PMID:27043565

A nonlinear dynamical system for combustion instability in a pulse model combustor

NASA Astrophysics Data System (ADS)

Takagi, Kazushi; Gotoda, Hiroshi

2016-11-01

We theoretically and numerically study the bifurcation phenomena of nonlinear dynamical system describing combustion instability in a pulse model combustor on the basis of dynamical system theory and complex network theory. The dynamical behavior of pressure fluctuations undergoes a significant transition from steady-state to deterministic chaos via the period-doubling cascade process known as Feigenbaum scenario with decreasing the characteristic flow time. Recurrence plots and recurrence networks analysis we adopted in this study can quantify the significant changes in dynamic behavior of combustion instability that cannot be captured in the bifurcation diagram.

Finite-time synchronization of complex networks with non-identical nodes and impulsive disturbances

NASA Astrophysics Data System (ADS)

Zhang, Wanli; Li, Chuandong; He, Xing; Li, Hongfei

2018-01-01

This paper investigates the finite-time synchronization of complex networks (CNs) with non-identical nodes and impulsive disturbances. By utilizing stability theories, new 1-norm-based analytical techniques and suitable comparison, systems, several sufficient conditions are obtained to realize the synchronization goal in finite time. State feedback controllers with and without the sign function are designed. Results show that the controllers with sign function can reduce the conservativeness of control gains and the controllers without sign function can overcome the chattering phenomenon. Numerical simulations are offered to verify the effectiveness of the theoretical analysis.

Stability analysis for uncertain switched neural networks with time-varying delay.

PubMed

Shen, Wenwen; Zeng, Zhigang; Wang, Leimin

2016-11-01

In this paper, stability for a class of uncertain switched neural networks with time-varying delay is investigated. By exploring the mode-dependent properties of each subsystem, all the subsystems are categorized into stable and unstable ones. Based on Lyapunov-like function method and average dwell time technique, some delay-dependent sufficient conditions are derived to guarantee the exponential stability of considered uncertain switched neural networks. Compared with general results, our proposed approach distinguishes the stable and unstable subsystems rather than viewing all subsystems as being stable, thus getting less conservative criteria. Finally, two numerical examples are provided to show the validity and the advantages of the obtained results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Griffiths effects of the susceptible-infected-susceptible epidemic model on random power-law networks.

PubMed

Cota, Wesley; Ferreira, Silvio C; Ódor, Géza

2016-03-01

We provide numerical evidence for slow dynamics of the susceptible-infected-susceptible model evolving on finite-size random networks with power-law degree distributions. Extensive simulations were done by averaging the activity density over many realizations of networks. We investigated the effects of outliers in both highly fluctuating (natural cutoff) and nonfluctuating (hard cutoff) most connected vertices. Logarithmic and power-law decays in time were found for natural and hard cutoffs, respectively. This happens in extended regions of the control parameter space λ(1)<λ<λ(2), suggesting Griffiths effects, induced by the topological inhomogeneities. Optimal fluctuation theory considering sample-to-sample fluctuations of the pseudothresholds is presented to explain the observed slow dynamics. A quasistationary analysis shows that response functions remain bounded at λ(2). We argue these to be signals of a smeared transition. However, in the thermodynamic limit the Griffiths effects loose their relevancy and have a conventional critical point at λ(c)=0. Since many real networks are composed by heterogeneous and weakly connected modules, the slow dynamics found in our analysis of independent and finite networks can play an important role for the deeper understanding of such systems.

Complex Dynamics of Delay-Coupled Neural Networks

NASA Astrophysics Data System (ADS)

Mao, Xiaochen

2016-09-01

This paper reveals the complicated dynamics of a delay-coupled system that consists of a pair of sub-networks and multiple bidirectional couplings. Time delays are introduced into the internal connections and network-couplings, respectively. The stability and instability of the coupled network are discussed. The sufficient conditions for the existence of oscillations are given. Case studies of numerical simulations are given to validate the analytical results. Interesting and complicated neuronal activities are observed numerically, such as rest states, periodic oscillations, multiple switches of rest states and oscillations, and the coexistence of different types of oscillations.

Analysis of gene network robustness based on saturated fixed point attractors

PubMed Central

2014-01-01

The analysis of gene network robustness to noise and mutation is important for fundamental and practical reasons. Robustness refers to the stability of the equilibrium expression state of a gene network to variations of the initial expression state and network topology. Numerical simulation of these variations is commonly used for the assessment of robustness. Since there exists a great number of possible gene network topologies and initial states, even millions of simulations may be still too small to give reliable results. When the initial and equilibrium expression states are restricted to being saturated (i.e., their elements can only take values 1 or −1 corresponding to maximum activation and maximum repression of genes), an analytical gene network robustness assessment is possible. We present this analytical treatment based on determination of the saturated fixed point attractors for sigmoidal function models. The analysis can determine (a) for a given network, which and how many saturated equilibrium states exist and which and how many saturated initial states converge to each of these saturated equilibrium states and (b) for a given saturated equilibrium state or a given pair of saturated equilibrium and initial states, which and how many gene networks, referred to as viable, share this saturated equilibrium state or the pair of saturated equilibrium and initial states. We also show that the viable networks sharing a given saturated equilibrium state must follow certain patterns. These capabilities of the analytical treatment make it possible to properly define and accurately determine robustness to noise and mutation for gene networks. Previous network research conclusions drawn from performing millions of simulations follow directly from the results of our analytical treatment. Furthermore, the analytical results provide criteria for the identification of model validity and suggest modified models of gene network dynamics. The yeast cell-cycle network is used as an illustration of the practical application of this analytical treatment. PMID:24650364

Modeling the Propagation of Mobile Phone Virus under Complex Network

PubMed Central

Yang, Wei; Wei, Xi-liang; Guo, Hao; An, Gang; Guo, Lei

2014-01-01

Mobile phone virus is a rogue program written to propagate from one phone to another, which can take control of a mobile device by exploiting its vulnerabilities. In this paper the propagation model of mobile phone virus is tackled to understand how particular factors can affect its propagation and design effective containment strategies to suppress mobile phone virus. Two different propagation models of mobile phone viruses under the complex network are proposed in this paper. One is intended to describe the propagation of user-tricking virus, and the other is to describe the propagation of the vulnerability-exploiting virus. Based on the traditional epidemic models, the characteristics of mobile phone viruses and the network topology structure are incorporated into our models. A detailed analysis is conducted to analyze the propagation models. Through analysis, the stable infection-free equilibrium point and the stability condition are derived. Finally, considering the network topology, the numerical and simulation experiments are carried out. Results indicate that both models are correct and suitable for describing the spread of two different mobile phone viruses, respectively. PMID:25133209

Evaluation of Supply Chain Efficiency Based on a Novel Network of Data Envelopment Analysis Model

NASA Astrophysics Data System (ADS)

Fu, Li Fang; Meng, Jun; Liu, Ying

2015-12-01

Performance evaluation of supply chain (SC) is a vital topic in SC management and inherently complex problems with multilayered internal linkages and activities of multiple entities. Recently, various Network Data Envelopment Analysis (NDEA) models, which opened the “black box” of conventional DEA, were developed and applied to evaluate the complex SC with a multilayer network structure. However, most of them are input or output oriented models which cannot take into consideration the nonproportional changes of inputs and outputs simultaneously. This paper extends the Slack-based measure (SBM) model to a nonradial, nonoriented network model named as U-NSBM with the presence of undesirable outputs in the SC. A numerical example is presented to demonstrate the applicability of the model in quantifying the efficiency and ranking the supply chain performance. By comparing with the CCR and U-SBM models, it is shown that the proposed model has higher distinguishing ability and gives feasible solution in the presence of undesirable outputs. Meanwhile, it provides more insights for decision makers about the source of inefficiency as well as the guidance to improve the SC performance.

Extracting grid cell characteristics from place cell inputs using non-negative principal component analysis

PubMed Central

Dordek, Yedidyah; Soudry, Daniel; Meir, Ron; Derdikman, Dori

2016-01-01

Many recent models study the downstream projection from grid cells to place cells, while recent data have pointed out the importance of the feedback projection. We thus asked how grid cells are affected by the nature of the input from the place cells. We propose a single-layer neural network with feedforward weights connecting place-like input cells to grid cell outputs. Place-to-grid weights are learned via a generalized Hebbian rule. The architecture of this network highly resembles neural networks used to perform Principal Component Analysis (PCA). Both numerical results and analytic considerations indicate that if the components of the feedforward neural network are non-negative, the output converges to a hexagonal lattice. Without the non-negativity constraint, the output converges to a square lattice. Consistent with experiments, grid spacing ratio between the first two consecutive modules is −1.4. Our results express a possible linkage between place cell to grid cell interactions and PCA. DOI: http://dx.doi.org/10.7554/eLife.10094.001 PMID:26952211

A New View of Dynamic River Networks

NASA Astrophysics Data System (ADS)

Perron, J. T.; Willett, S.; McCoy, S. W.

2014-12-01

River networks are the main conduits that transport water, sediment, and nutrients from continental interiors to the oceans. They also shape topography as they erode through bedrock. These hierarchical networks are dynamic: there are numerous examples of apparent changes in the topology of river networks through geologic time. But these examples are geographically scattered, the evidence can be ambiguous, and the mechanisms that drive changes in river networks are poorly understood. This makes it difficult to assess how pervasive river network reorganization is, how it operates, and how the interlocking river basins that compose a given landscape are changing through time. Recent progress has improved the situation. We describe three developments that have dramatically advanced our understanding of dynamic river networks. First, new topographic, geophysical and geochronological measurement techniques are revealing the rate and extent of river network adjustment. Second, laboratory experiments and computational models are clarifying how river networks respond to tectonic and climatic perturbations at scales ranging from local to continental. Third, spatial analysis of genetic data is exposing links between landscape evolution, biological evolution, and the development of biodiversity. We highlight key problems that remain unsolved, and suggest ways to build on recent advances that will bring dynamic river networks into even sharper focus.

Theoretical Analysis of the Mechanism of Fracture Network Propagation with Stimulated Reservoir Volume (SRV) Fracturing in Tight Oil Reservoirs.

PubMed

Su, Yuliang; Ren, Long; Meng, Fankun; Xu, Chen; Wang, Wendong

2015-01-01

Stimulated reservoir volume (SRV) fracturing in tight oil reservoirs often induces complex fracture-network growth, which has a fundamentally different formation mechanism from traditional planar bi-winged fracturing. To reveal the mechanism of fracture network propagation, this paper employs a modified displacement discontinuity method (DDM), mechanical mechanism analysis and initiation and propagation criteria for the theoretical model of fracture network propagation and its derivation. A reasonable solution of the theoretical model for a tight oil reservoir is obtained and verified by a numerical discrete method. Through theoretical calculation and computer programming, the variation rules of formation stress fields, hydraulic fracture propagation patterns (FPP) and branch fracture propagation angles and pressures are analyzed. The results show that during the process of fracture propagation, the initial orientation of the principal stress deflects, and the stress fields at the fracture tips change dramatically in the region surrounding the fracture. Whether the ideal fracture network can be produced depends on the geological conditions and on the engineering treatments. This study has both theoretical significance and practical application value by contributing to a better understanding of fracture network propagation mechanisms in unconventional oil/gas reservoirs and to the improvement of the science and design efficiency of reservoir fracturing.

A new upper bound for the norm of interval matrices with application to robust stability analysis of delayed neural networks.

PubMed

Faydasicok, Ozlem; Arik, Sabri

2013-08-01

The main problem with the analysis of robust stability of neural networks is to find the upper bound norm for the intervalized interconnection matrices of neural networks. In the previous literature, the major three upper bound norms for the intervalized interconnection matrices have been reported and they have been successfully applied to derive new sufficient conditions for robust stability of delayed neural networks. One of the main contributions of this paper will be the derivation of a new upper bound for the norm of the intervalized interconnection matrices of neural networks. Then, by exploiting this new upper bound norm of interval matrices and using stability theory of Lyapunov functionals and the theory of homomorphic mapping, we will obtain new sufficient conditions for the existence, uniqueness and global asymptotic stability of the equilibrium point for the class of neural networks with discrete time delays under parameter uncertainties and with respect to continuous and slope-bounded activation functions. The results obtained in this paper will be shown to be new and they can be considered alternative results to previously published corresponding results. We also give some illustrative and comparative numerical examples to demonstrate the effectiveness and applicability of the proposed robust stability condition. Copyright © 2013 Elsevier Ltd. All rights reserved.

Theoretical Analysis of the Mechanism of Fracture Network Propagation with Stimulated Reservoir Volume (SRV) Fracturing in Tight Oil Reservoirs

PubMed Central

Su, Yuliang; Ren, Long; Meng, Fankun; Xu, Chen; Wang, Wendong

2015-01-01

Stimulated reservoir volume (SRV) fracturing in tight oil reservoirs often induces complex fracture-network growth, which has a fundamentally different formation mechanism from traditional planar bi-winged fracturing. To reveal the mechanism of fracture network propagation, this paper employs a modified displacement discontinuity method (DDM), mechanical mechanism analysis and initiation and propagation criteria for the theoretical model of fracture network propagation and its derivation. A reasonable solution of the theoretical model for a tight oil reservoir is obtained and verified by a numerical discrete method. Through theoretical calculation and computer programming, the variation rules of formation stress fields, hydraulic fracture propagation patterns (FPP) and branch fracture propagation angles and pressures are analyzed. The results show that during the process of fracture propagation, the initial orientation of the principal stress deflects, and the stress fields at the fracture tips change dramatically in the region surrounding the fracture. Whether the ideal fracture network can be produced depends on the geological conditions and on the engineering treatments. This study has both theoretical significance and practical application value by contributing to a better understanding of fracture network propagation mechanisms in unconventional oil/gas reservoirs and to the improvement of the science and design efficiency of reservoir fracturing. PMID:25966285

Statistical Neurodynamics.

NASA Astrophysics Data System (ADS)

Paine, Gregory Harold

1982-03-01

The primary objective of the thesis is to explore the dynamical properties of small nerve networks by means of the methods of statistical mechanics. To this end, a general formalism is developed and applied to elementary groupings of model neurons which are driven by either constant (steady state) or nonconstant (nonsteady state) forces. Neuronal models described by a system of coupled, nonlinear, first-order, ordinary differential equations are considered. A linearized form of the neuronal equations is studied in detail. A Lagrange function corresponding to the linear neural network is constructed which, through a Legendre transformation, provides a constant of motion. By invoking the Maximum-Entropy Principle with the single integral of motion as a constraint, a probability distribution function for the network in a steady state can be obtained. The formalism is implemented for some simple networks driven by a constant force; accordingly, the analysis focuses on a study of fluctuations about the steady state. In particular, a network composed of N noninteracting neurons, termed Free Thinkers, is considered in detail, with a view to interpretation and numerical estimation of the Lagrange multiplier corresponding to the constant of motion. As an archetypical example of a net of interacting neurons, the classical neural oscillator, consisting of two mutually inhibitory neurons, is investigated. It is further shown that in the case of a network driven by a nonconstant force, the Maximum-Entropy Principle can be applied to determine a probability distribution functional describing the network in a nonsteady state. The above examples are reconsidered with nonconstant driving forces which produce small deviations from the steady state. Numerical studies are performed on simplified models of two physical systems: the starfish central nervous system and the mammalian olfactory bulb. Discussions are given as to how statistical neurodynamics can be used to gain a better understanding of the behavior of these systems.

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

Prediction of matching condition for a microstrip subsystem using artificial neural network and adaptive neuro-fuzzy inference system

NASA Astrophysics Data System (ADS)

Salehi, Mohammad Reza; Noori, Leila; Abiri, Ebrahim

2016-11-01

In this paper, a subsystem consisting of a microstrip bandpass filter and a microstrip low noise amplifier (LNA) is designed for WLAN applications. The proposed filter has a small implementation area (49 mm2), small insertion loss (0.08 dB) and wide fractional bandwidth (FBW) (61%). To design the proposed LNA, the compact microstrip cells, an field effect transistor, and only a lumped capacitor are used. It has a low supply voltage and a low return loss (-40 dB) at the operation frequency. The matching condition of the proposed subsystem is predicted using subsystem analysis, artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS). To design the proposed filter, the transmission matrix of the proposed resonator is obtained and analysed. The performance of the proposed ANN and ANFIS models is tested using the numerical data by four performance measures, namely the correlation coefficient (CC), the mean absolute error (MAE), the average percentage error (APE) and the root mean square error (RMSE). The obtained results show that these models are in good agreement with the numerical data, and a small error between the predicted values and numerical solution is obtained.

Numerical modelling in biosciences using delay differential equations

NASA Astrophysics Data System (ADS)

Bocharov, Gennadii A.; Rihan, Fathalla A.

2000-12-01

Our principal purposes here are (i) to consider, from the perspective of applied mathematics, models of phenomena in the biosciences that are based on delay differential equations and for which numerical approaches are a major tool in understanding their dynamics, (ii) to review the application of numerical techniques to investigate these models. We show that there are prima facie reasons for using such models: (i) they have a richer mathematical framework (compared with ordinary differential equations) for the analysis of biosystem dynamics, (ii) they display better consistency with the nature of certain biological processes and predictive results. We analyze both the qualitative and quantitative role that delays play in basic time-lag models proposed in population dynamics, epidemiology, physiology, immunology, neural networks and cell kinetics. We then indicate suitable computational techniques for the numerical treatment of mathematical problems emerging in the biosciences, comparing them with those implemented by the bio-modellers.

Employing Tropospheric Numerical Weather Prediction Model for High-Precision GNSS Positioning

NASA Astrophysics Data System (ADS)

Alves, Daniele; Gouveia, Tayna; Abreu, Pedro; Magário, Jackes

2014-05-01

In the past few years is increasing the necessity of realizing high accuracy positioning. In this sense, the spatial technologies have being widely used. The GNSS (Global Navigation Satellite System) has revolutionized the geodetic positioning activities. Among the existent methods one can emphasize the Precise Point Positioning (PPP) and network-based positioning. But, to get high accuracy employing these methods, mainly in real time, is indispensable to realize the atmospheric modeling (ionosphere and troposphere) accordingly. Related to troposphere, there are the empirical models (for example Saastamoinen and Hopfield). But when highly accuracy results (error of few centimeters) are desired, maybe these models are not appropriated to the Brazilian reality. In order to minimize this limitation arises the NWP (Numerical Weather Prediction) models. In Brazil the CPTEC/INPE (Center for Weather Prediction and Climate Studies / Brazilian Institute for Spatial Researches) provides a regional NWP model, currently used to produce Zenithal Tropospheric Delay (ZTD) predictions (http://satelite.cptec.inpe.br/zenital/). The actual version, called eta15km model, has a spatial resolution of 15 km and temporal resolution of 3 hours. In this paper the main goal is to accomplish experiments and analysis concerning the use of troposphere NWP model (eta15km model) in PPP and network-based positioning. Concerning PPP it was used data from dozens of stations over the Brazilian territory, including Amazon forest. The results obtained with NWP model were compared with Hopfield one. NWP model presented the best results in all experiments. Related to network-based positioning it was used data from GNSS/SP Network in São Paulo State, Brazil. This network presents the best configuration in the country to realize this kind of positioning. Actually the network is composed by twenty stations (http://www.fct.unesp.br/#!/pesquisa/grupos-de-estudo-e-pesquisa/gege//gnss-sp-network2789/). The results obtained employing NWP model also were compared to Hopfield one, and the results were very interesting. The theoretical concepts, experiments, results and analysis will be presented in this paper.

Comparative transcriptome analysis reveals networks of genes activated in the whitefly, Bemisia tabaci when fed on tomato plants infected with Tomato yellow leaf curl virus

USDA-ARS?s Scientific Manuscript database

The whitefly Bemisia tabaci can transmit hundreds of viruses to numerous agricultural crops in the world. Five genera of viruses, including Begomovirus and Crinivirus, are transmitted by B. tabaci. There is little knowledge about the genes involved in virus acquisition and transmission by whiteflies...

Feasibility Analysis on the Utilization of the Iridium Satellite Communications Network for Resident Space Objects in Low Earth Orbit

DTIC Science & Technology

2013-03-21

Coordinate System (from STK ) .................................. 15 Figure 7. Iridium Satellite Viewing Geometry from Ground User...44 Figure 15. Iridium Constellation Model in STK with Single FOV Spot Beams ............. 58 Figure 16...60 Table 11. Numeric RAAN Values Represented as Two Categoric Factors .................... 67 Table 12. Spacecraft RAAN Values in STK

The Operation of a Specialized Scientific Information and Data Analysis Center With Computer Base and Associated Communications Network.

ERIC Educational Resources Information Center

Cottrell, William B.; And Others

The Nuclear Safety Information Center (NSIC) is a highly sophisticated scientific information center operated at Oak Ridge National Laboratory (ORNL) for the U.S. Atomic Energy Commission. Its information file, which consists of both data and bibliographic information, is computer stored and numerous programs have been developed to facilitate the…

Seismicity and Fault Zone Structure Near the Xinfengjiang Water Reservoir, Guangdong, China

NASA Astrophysics Data System (ADS)

Yang, H.; Sun, X.; He, L.; Wang, S.

2015-12-01

Xingfengjiang Water Reservoir (XWR) was built in 1958 and the first impoundment was conducted in 1959. Immediately following the reservoir impoundment, a series of earthquakes occurred in the vicinity of the XWR, including the 1962 M6.1 earthquake that occurred ~1 km next to the dam. Numerous small earthquakes take place in this region presently, making it one of the most active seismic zones in Guangdong. To investigate the present seismicity and associated fault zone structure, we deployed a temporary seismic network, including a dense linear array across the Ren-Zi-Shi fault southwest to the reservoir. The temporary network is consisted of 42 stations that are operated in the field for more than one month. Because of the mountainous terrain, it is impossible to deploy broadband sensors. Here we use DDV-5 seismometer with a central frequency of 120Hz-5s that is independent on external GPS and battery. During our deployment, numerous earthquakes were recorded. Preliminary results of travel time analysis have shown the characteristic of low velocity fault zone. More detailed analysis, including relocation of earthquakes, ambient noise cross correlation, and modeling body waves, will be presented.

Coverage Extension and Balancing the Transmitted Power of the Moving Relay Node at LTE-A Cellular Network

PubMed Central

Aldhaibani, Jaafar A.; Yahya, Abid; Ahmad, R. Badlishah

2014-01-01

The poor capacity at cell boundaries is not enough to meet the growing demand and stringent design which required high capacity and throughput irrespective of user's location in the cellular network. In this paper, we propose new schemes for an optimum fixed relay node (RN) placement in LTE-A cellular network to enhance throughput and coverage extension at cell edge region. The proposed approach mitigates interferences between all nodes and ensures optimum utilization with the optimization of transmitted power. Moreover, we proposed a new algorithm to balance the transmitted power of moving relay node (MR) over cell size and providing required SNR and throughput at the users inside vehicle along with reducing the transmitted power consumption by MR. The numerical analysis along with the simulation results indicates that an improvement in capacity for users is 40% increment at downlink transmission from cell capacity. Furthermore, the results revealed that there is saving nearly 75% from transmitted power in MR after using proposed balancing algorithm. ATDI simulator was used to verify the numerical results, which deals with real digital cartographic and standard formats for terrain. PMID:24672378

Coverage extension and balancing the transmitted power of the moving relay node at LTE-A cellular network.

PubMed

Aldhaibani, Jaafar A; Yahya, Abid; Ahmad, R Badlishah

2014-01-01

The poor capacity at cell boundaries is not enough to meet the growing demand and stringent design which required high capacity and throughput irrespective of user's location in the cellular network. In this paper, we propose new schemes for an optimum fixed relay node (RN) placement in LTE-A cellular network to enhance throughput and coverage extension at cell edge region. The proposed approach mitigates interferences between all nodes and ensures optimum utilization with the optimization of transmitted power. Moreover, we proposed a new algorithm to balance the transmitted power of moving relay node (MR) over cell size and providing required SNR and throughput at the users inside vehicle along with reducing the transmitted power consumption by MR. The numerical analysis along with the simulation results indicates that an improvement in capacity for users is 40% increment at downlink transmission from cell capacity. Furthermore, the results revealed that there is saving nearly 75% from transmitted power in MR after using proposed balancing algorithm. ATDI simulator was used to verify the numerical results, which deals with real digital cartographic and standard formats for terrain.

Detailed analysis of the fireball 20160317_031654 over the United Kingdom

NASA Astrophysics Data System (ADS)

Koukal, Jakub

2018-03-01

On March 17, 2016 in the early morning hours the UKMON network (United Kingdom Meteor Observation Network) cameras recorded a bright fireball with an absolute magnitude of -12.5 ± 0.4m, its atmospheric path began above the Dorset County and ended up above the Oxford County in the southern part of England. This fireball belonging to the Northern March gamma Virginids (IAU MDC #749 NMV) meteor shower was recorded from 8 cameras of the UKMON network. The atmospheric path of the bolide and the heliocentric orbit of the meteoroid are analyzed in this article. The flight of the fireball, whose absolute magnitude was comparable with the brightness of the Full Moon, was also observed by numerous random observers from the public in the United Kingdom, the Netherlands, Belgium and France. Numerical integration of the heliocentric orbit of the body and its clones was performed to find the potential parent body of the fireball and also the potential parent body of the meteor shower #749 NMV. However, no potential parent body of the fireball 20160317_031654 was found in the comets (periodic, non-periodic and lost) and asteroids database.

CUFID-query: accurate network querying through random walk based network flow estimation.

PubMed

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

2017-12-28

Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive performance evaluation based on biological networks with known functional modules, we show that CUFID-query outperforms the existing state-of-the-art algorithms in terms of prediction accuracy and biological significance of the predictions.

Prediction of daily sea surface temperature using efficient neural networks

NASA Astrophysics Data System (ADS)

Patil, Kalpesh; Deo, Makaranad Chintamani

2017-04-01

Short-term prediction of sea surface temperature (SST) is commonly achieved through numerical models. Numerical approaches are more suitable for use over a large spatial domain than in a specific site because of the difficulties involved in resolving various physical sub-processes at local levels. Therefore, for a given location, a data-driven approach such as neural networks may provide a better alternative. The application of neural networks, however, needs a large experimentation in their architecture, training methods, and formation of appropriate input-output pairs. A network trained in this manner can provide more attractive results if the advances in network architecture are additionally considered. With this in mind, we propose the use of wavelet neural networks (WNNs) for prediction of daily SST values. The prediction of daily SST values was carried out using WNN over 5 days into the future at six different locations in the Indian Ocean. First, the accuracy of site-specific SST values predicted by a numerical model, ROMS, was assessed against the in situ records. The result pointed out the necessity for alternative approaches. First, traditional networks were tried and after noticing their poor performance, WNN was used. This approach produced attractive forecasts when judged through various error statistics. When all locations were viewed together, the mean absolute error was within 0.18 to 0.32 °C for a 5-day-ahead forecast. The WNN approach was thus found to add value to the numerical method of SST prediction when location-specific information is desired.

Multi-species Identification of Polymorphic Peptide Variants via Propagation in Spectral Networks

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

Na, Seungjin; Payne, Samuel H.; Bandeira, Nuno

The spectral networks approach enables the detection of pairs of spectra from related peptides and thus allows for the propagation of annotations from identified peptides to unidentified spectra. Beyond allowing for unbiased discovery of unexpected post-translational modifications, spectral networks are also applicable to multi-species comparative proteomics or metaproteomics to identify numerous orthologous versions of a protein. We present algorithmic and statistical advances in spectral networks that have made it possible to rigorously assess the statistical significance of spectral pairs and accurately estimate the error rate of identifications via propagation. In the analysis of three related Cyanothece species, a model organismmore » for biohydrogen production, spectral networks identified peptides with highly divergent sequences with up to dozens of variants per peptide, including many novel peptides in species that lack a sequenced genome. Furthermore, spectral networks strongly suggested the presence of novel peptides even in genomically characterized species (i.e. missing from databases) in that a significant portion of unidentified multi-species networks included at least two polymorphic peptide variants.« less

φ-evo: A program to evolve phenotypic models of biological networks.

PubMed

Henry, Adrien; Hemery, Mathieu; François, Paul

2018-06-01

Molecular networks are at the core of most cellular decisions, but are often difficult to comprehend. Reverse engineering of network architecture from their functions has proved fruitful to classify and predict the structure and function of molecular networks, suggesting new experimental tests and biological predictions. We present φ-evo, an open-source program to evolve in silico phenotypic networks performing a given biological function. We include implementations for evolution of biochemical adaptation, adaptive sorting for immune recognition, metazoan development (somitogenesis, hox patterning), as well as Pareto evolution. We detail the program architecture based on C, Python 3, and a Jupyter interface for project configuration and network analysis. We illustrate the predictive power of φ-evo by first recovering the asymmetrical structure of the lac operon regulation from an objective function with symmetrical constraints. Second, we use the problem of hox-like embryonic patterning to show how a single effective fitness can emerge from multi-objective (Pareto) evolution. φ-evo provides an efficient approach and user-friendly interface for the phenotypic prediction of networks and the numerical study of evolution itself.

SISL and SIRL: Two knowledge dissemination models with leader nodes on cooperative learning networks

NASA Astrophysics Data System (ADS)

Li, Jingjing; Zhang, Yumei; Man, Jiayu; Zhou, Yun; Wu, Xiaojun

2017-02-01

Cooperative learning is one of the most effective teaching methods, which has been widely used. Students' mutual contact forms a cooperative learning network in this process. Our previous research demonstrated that the cooperative learning network has complex characteristics. This study aims to investigating the dynamic spreading process of the knowledge in the cooperative learning network and the inspiration of leaders in this process. To this end, complex network transmission dynamics theory is utilized to construct the knowledge dissemination model of a cooperative learning network. Based on the existing epidemic models, we propose a new susceptible-infected-susceptible-leader (SISL) model that considers both students' forgetting and leaders' inspiration, and a susceptible-infected-removed-leader (SIRL) model that considers students' interest in spreading and leaders' inspiration. The spreading threshold λcand its impact factors are analyzed. Then, numerical simulation and analysis are delivered to reveal the dynamic transmission mechanism of knowledge and leaders' role. This work is of great significance to cooperative learning theory and teaching practice. It also enriches the theory of complex network transmission dynamics.

How mutation alters the evolutionary dynamics of cooperation on networks

NASA Astrophysics Data System (ADS)

Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

2018-05-01

Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

PDB2Graph: A toolbox for identifying critical amino acids map in proteins based on graph theory.

PubMed

Niknam, Niloofar; Khakzad, Hamed; Arab, Seyed Shahriar; Naderi-Manesh, Hossein

2016-05-01

The integrative and cooperative nature of protein structure involves the assessment of topological and global features of constituent parts. Network concept takes complete advantage of both of these properties in the analysis concomitantly. High compatibility to structural concepts or physicochemical properties in addition to exploiting a remarkable simplification in the system has made network an ideal tool to explore biological systems. There are numerous examples in which different protein structural and functional characteristics have been clarified by the network approach. Here, we present an interactive and user-friendly Matlab-based toolbox, PDB2Graph, devoted to protein structure network construction, visualization, and analysis. Moreover, PDB2Graph is an appropriate tool for identifying critical nodes involved in protein structural robustness and function based on centrality indices. It maps critical amino acids in protein networks and can greatly aid structural biologists in selecting proper amino acid candidates for manipulating protein structures in a more reasonable and rational manner. To introduce the capability and efficiency of PDB2Graph in detail, the structural modification of Calmodulin through allosteric binding of Ca(2+) is considered. In addition, a mutational analysis for three well-identified model proteins including Phage T4 lysozyme, Barnase and Ribonuclease HI, was performed to inspect the influence of mutating important central residues on protein activity. Copyright © 2016 Elsevier Ltd. All rights reserved.

BiologicalNetworks 2.0 - an integrative view of genome biology data

PubMed Central

2010-01-01

Background A significant problem in the study of mechanisms of an organism's development is the elucidation of interrelated factors which are making an impact on the different levels of the organism, such as genes, biological molecules, cells, and cell systems. Numerous sources of heterogeneous data which exist for these subsystems are still not integrated sufficiently enough to give researchers a straightforward opportunity to analyze them together in the same frame of study. Systematic application of data integration methods is also hampered by a multitude of such factors as the orthogonal nature of the integrated data and naming problems. Results Here we report on a new version of BiologicalNetworks, a research environment for the integral visualization and analysis of heterogeneous biological data. BiologicalNetworks can be queried for properties of thousands of different types of biological entities (genes/proteins, promoters, COGs, pathways, binding sites, and other) and their relations (interactions, co-expression, co-citations, and other). The system includes the build-pathways infrastructure for molecular interactions/relations and module discovery in high-throughput experiments. Also implemented in BiologicalNetworks are the Integrated Genome Viewer and Comparative Genomics Browser applications, which allow for the search and analysis of gene regulatory regions and their conservation in multiple species in conjunction with molecular pathways/networks, experimental data and functional annotations. Conclusions The new release of BiologicalNetworks together with its back-end database introduces extensive functionality for a more efficient integrated multi-level analysis of microarray, sequence, regulatory, and other data. BiologicalNetworks is freely available at http://www.biologicalnetworks.org. PMID:21190573

Analysis of Focal Mechanism and Microseismicity around the Lusi Mud Eruption Site, East Java, Indonesia

NASA Astrophysics Data System (ADS)

Karyono, Karyono; Obermann, Anne; Mazzini, Adriano; Lupi, Matteo; Syafri, Ildrem; Abdurrokhim, Abdurrokhim; Masturyono, Masturyono; Hadi, Soffian

2016-04-01

The 29th of May 2006 numerous eruption sites started in northeast Java, Indonesia following to a M6.3 earthquake striking the island.Within a few weeks an area or nearly 2 km2 was covered by boiling mud and rock fragments and a prominent central crater (named Lusi) has been erupting for the last 9.5 years. The M.6.3 seismic event also triggered the activation of the Watukosek strike slip fault system that originates from the Arjuno-Welirang volcanic complex and extends to the northeast of Java hosting Lusi and other mud volcanoes. Since 2006 this fault system has been reactivated in numerous instances mostly following to regional seismic and volcanic activity. However the mechanism controlling this activity have never been investigated and remain poorly understood. In order to investigate the relationship existing between seismicity, volcanism, faulting and Lusi activity, we have deployed a network of 31 seismometers in the framework of the ERC-Lusi Lab project. This network covers a large region that monitors the Lusi activity, the Watukosek fault system and the neighboring Arjuno-Welirang volcanic complex. In particular, to understand the consistent pattern of the source mechanism, relative to the general tectonic stress in the study area, a detailed analysis has been carried out by performing the moment tensor inversion for the near field data collected from the network stations. Furthermore these data have been combined with the near field data from the regional network of the Meteorological, Climatological and Geophysical Agency of Indonesia that covers the whole country on a broader scale. Keywords: Lusi, microseismic event, focal mechanism

Prediction of properties of wheat dough using intelligent deep belief networks

NASA Astrophysics Data System (ADS)

Guha, Paramita; Bhatnagar, Taru; Pal, Ishan; Kamboj, Uma; Mishra, Sunita

2017-11-01

In this paper, the rheological and chemical properties of wheat dough are predicted using deep belief networks. Wheat grains are stored at controlled environmental conditions. The internal parameters of grains viz., protein, fat, carbohydrates, moisture, ash are determined using standard chemical analysis and viscosity of the dough is measured using Rheometer. Here, fat, carbohydrates, moisture, ash and temperature are considered as inputs whereas protein and viscosity are chosen as outputs. The prediction algorithm is developed using deep neural network where each layer is trained greedily using restricted Boltzmann machine (RBM) networks. The overall network is finally fine-tuned using standard neural network technique. In most literature, it has been found that fine-tuning is done using back-propagation technique. In this paper, a new algorithm is proposed in which each layer is tuned using RBM and the final network is fine-tuned using deep neural network (DNN). It has been observed that with the proposed algorithm, errors between the actual and predicted outputs are less compared to the conventional algorithm. Hence, the given network can be considered as beneficial as it predicts the outputs more accurately. Numerical results along with discussions are presented.

Energy efficiency evaluation of tree-topology 10 gigabit ethernet passive optical network and ring-topology time- and wavelength-division-multiplexed passive optical network

NASA Astrophysics Data System (ADS)

Song, Jingjing; Yang, Chuanchuan; Zhang, Qingxiang; Ma, Zhuang; Huang, Xingang; Geng, Dan; Wang, Ziyu

2015-09-01

Higher capacity and larger scales have always been the top targets for the evolution of optical access networks, driven by the ever-increasing demand from the end users. One thing that started to attract wide attention not long ago, but with at least equal importance as capacity and scale, is energy efficiency, a metric essential nowadays as human beings are confronted with severe environmental issues like global warming, air pollution, and so on. Here, different from the conventional energy consumption analysis of tree-topology networks, we propose an effective energy consumption calculation method to compare the energy efficiency of the tree-topology 10 gigabit ethernet passive optical network (10G-EPON) and ring-topology time- and wavelength-division-multiplexed passive optical network (TWDM-PON), two experimental networks deployed in China. Numerical results show that the ring-topology TWDM-PON networks with 2, 4, 8, and 16 wavelengths are more energy efficient than the tree-topology 10G-EPON, although 10G-EPON consumes less energy. Also, TWDM-PON with four wavelengths is the most energy-efficient network candidate and saves 58.7% more energy than 10G-EPON when fully loaded.

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

NASA Astrophysics Data System (ADS)

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

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

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

NASA Technical Reports Server (NTRS)

Maghami, Peiman G.; Sparks, Dean W., Jr.

1997-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Design of neural networks for fast convergence and accuracy: dynamics and control.

PubMed

Maghami, P G; Sparks, D R

2000-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

A practical introduction to tensor networks: Matrix product states and projected entangled pair states

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

Orús, Román, E-mail: roman.orus@uni-mainz.de

This is a partly non-technical introduction to selected topics on tensor network methods, based on several lectures and introductory seminars given on the subject. It should be a good place for newcomers to get familiarized with some of the key ideas in the field, specially regarding the numerics. After a very general introduction we motivate the concept of tensor network and provide several examples. We then move on to explain some basics about Matrix Product States (MPS) and Projected Entangled Pair States (PEPS). Selected details on some of the associated numerical methods for 1d and 2d quantum lattice systems aremore » also discussed. - Highlights: • A practical introduction to selected aspects of tensor network methods is presented. • We provide analytical examples of MPS and 2d PEPS. • We provide basic aspects on several numerical methods for MPS and 2d PEPS. • We discuss a number of applications of tensor network methods from a broad perspective.« less

Interfacing a General Purpose Fluid Network Flow Program with the SINDA/G Thermal Analysis Program

NASA Technical Reports Server (NTRS)

Schallhorn, Paul; Popok, Daniel

1999-01-01

A general purpose, one dimensional fluid flow code is currently being interfaced with the thermal analysis program Systems Improved Numerical Differencing Analyzer/Gaski (SINDA/G). The flow code, Generalized Fluid System Simulation Program (GFSSP), is capable of analyzing steady state and transient flow in a complex network. The flow code is capable of modeling several physical phenomena including compressibility effects, phase changes, body forces (such as gravity and centrifugal) and mixture thermodynamics for multiple species. The addition of GFSSP to SINDA/G provides a significant improvement in convective heat transfer modeling for SINDA/G. The interface development is conducted in multiple phases. This paper describes the first phase of the interface which allows for steady and quasi-steady (unsteady solid, steady fluid) conjugate heat transfer modeling.

Detecting malicious chaotic signals in wireless sensor network

NASA Astrophysics Data System (ADS)

Upadhyay, Ranjit Kumar; Kumari, Sangeeta

2018-02-01

In this paper, an e-epidemic Susceptible-Infected-Vaccinated (SIV) model has been proposed to analyze the effect of node immunization and worms attacking dynamics in wireless sensor network. A modified nonlinear incidence rate with cyrtoid type functional response has been considered using sleep and active mode approach. Detailed stability analysis and the sufficient criteria for the persistence of the model system have been established. We also established different types of bifurcation analysis for different equilibria at different critical points of the control parameters. We performed a detailed Hopf bifurcation analysis and determine the direction and stability of the bifurcating periodic solutions using center manifold theorem. Numerical simulations are carried out to confirm the theoretical results. The impact of the control parameters on the dynamics of the model system has been investigated and malicious chaotic signals are detected. Finally, we have analyzed the effect of time delay on the dynamics of the model system.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

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

Zhang, Jianbao; Ma, Zhongjun, E-mail: mzj1234402@163.com; Chen, Guanrong

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding ormore » deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.« less

Fast global oscillations in networks of integrate-and-fire neurons with low firing rates.

PubMed

Brunel, N; Hakim, V

1999-10-01

We study analytically the dynamics of a network of sparsely connected inhibitory integrate-and-fire neurons in a regime where individual neurons emit spikes irregularly and at a low rate. In the limit when the number of neurons --> infinity, the network exhibits a sharp transition between a stationary and an oscillatory global activity regime where neurons are weakly synchronized. The activity becomes oscillatory when the inhibitory feedback is strong enough. The period of the global oscillation is found to be mainly controlled by synaptic times but depends also on the characteristics of the external input. In large but finite networks, the analysis shows that global oscillations of finite coherence time generically exist both above and below the critical inhibition threshold. Their characteristics are determined as functions of systems parameters in these two different regions. The results are found to be in good agreement with numerical simulations.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

NASA Astrophysics Data System (ADS)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-06-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

New exponential synchronization criteria for time-varying delayed neural networks with discontinuous activations.

PubMed

Cai, Zuowei; Huang, Lihong; Zhang, Lingling

2015-05-01

This paper investigates the problem of exponential synchronization of time-varying delayed neural networks with discontinuous neuron activations. Under the extended Filippov differential inclusion framework, by designing discontinuous state-feedback controller and using some analytic techniques, new testable algebraic criteria are obtained to realize two different kinds of global exponential synchronization of the drive-response system. Moreover, we give the estimated rate of exponential synchronization which depends on the delays and system parameters. The obtained results extend some previous works on synchronization of delayed neural networks not only with continuous activations but also with discontinuous activations. Finally, numerical examples are provided to show the correctness of our analysis via computer simulations. Our method and theoretical results have a leading significance in the design of synchronized neural network circuits involving discontinuous factors and time-varying delays. Copyright © 2015 Elsevier Ltd. All rights reserved.

Network-based stochastic semisupervised learning.

PubMed

Silva, Thiago Christiano; Zhao, Liang

2012-03-01

Semisupervised learning is a machine learning approach that is able to employ both labeled and unlabeled samples in the training process. In this paper, we propose a semisupervised data classification model based on a combined random-preferential walk of particles in a network (graph) constructed from the input dataset. The particles of the same class cooperate among themselves, while the particles of different classes compete with each other to propagate class labels to the whole network. A rigorous model definition is provided via a nonlinear stochastic dynamical system and a mathematical analysis of its behavior is carried out. A numerical validation presented in this paper confirms the theoretical predictions. An interesting feature brought by the competitive-cooperative mechanism is that the proposed model can achieve good classification rates while exhibiting low computational complexity order in comparison to other network-based semisupervised algorithms. Computer simulations conducted on synthetic and real-world datasets reveal the effectiveness of the model.

Overarching framework for data-based modelling

NASA Astrophysics Data System (ADS)

Schelter, Björn; Mader, Malenka; Mader, Wolfgang; Sommerlade, Linda; Platt, Bettina; Lai, Ying-Cheng; Grebogi, Celso; Thiel, Marco

2014-02-01

One of the main modelling paradigms for complex physical systems are networks. When estimating the network structure from measured signals, typically several assumptions such as stationarity are made in the estimation process. Violating these assumptions renders standard analysis techniques fruitless. We here propose a framework to estimate the network structure from measurements of arbitrary non-linear, non-stationary, stochastic processes. To this end, we propose a rigorous mathematical theory that underlies this framework. Based on this theory, we present a highly efficient algorithm and the corresponding statistics that are immediately sensibly applicable to measured signals. We demonstrate its performance in a simulation study. In experiments of transitions between vigilance stages in rodents, we infer small network structures with complex, time-dependent interactions; this suggests biomarkers for such transitions, the key to understand and diagnose numerous diseases such as dementia. We argue that the suggested framework combines features that other approaches followed so far lack.

Numerical Analysis of Modeling Based on Improved Elman Neural Network

PubMed Central

Jie, Shao

2014-01-01

A modeling based on the improved Elman neural network (IENN) is proposed to analyze the nonlinear circuits with the memory effect. The hidden layer neurons are activated by a group of Chebyshev orthogonal basis functions instead of sigmoid functions in this model. The error curves of the sum of squared error (SSE) varying with the number of hidden neurons and the iteration step are studied to determine the number of the hidden layer neurons. Simulation results of the half-bridge class-D power amplifier (CDPA) with two-tone signal and broadband signals as input have shown that the proposed behavioral modeling can reconstruct the system of CDPAs accurately and depict the memory effect of CDPAs well. Compared with Volterra-Laguerre (VL) model, Chebyshev neural network (CNN) model, and basic Elman neural network (BENN) model, the proposed model has better performance. PMID:25054172

An individual-based approach to SIR epidemics in contact networks.

PubMed

Youssef, Mina; Scoglio, Caterina

2011-08-21

Many approaches have recently been proposed to model the spread of epidemics on networks. For instance, the Susceptible/Infected/Recovered (SIR) compartmental model has successfully been applied to different types of diseases that spread out among humans and animals. When this model is applied on a contact network, the centrality characteristics of the network plays an important role in the spreading process. However, current approaches only consider an aggregate representation of the network structure, which can result in inaccurate analysis. In this paper, we propose a new individual-based SIR approach, which considers the whole description of the network structure. The individual-based approach is built on a continuous time Markov chain, and it is capable of evaluating the state probability for every individual in the network. Through mathematical analysis, we rigorously confirm the existence of an epidemic threshold below which an epidemic does not propagate in the network. We also show that the epidemic threshold is inversely proportional to the maximum eigenvalue of the network. Additionally, we study the role of the whole spectrum of the network, and determine the relationship between the maximum number of infected individuals and the set of eigenvalues and eigenvectors. To validate our approach, we analytically study the deviation with respect to the continuous time Markov chain model, and we show that the new approach is accurate for a large range of infection strength. Furthermore, we compare the new approach with the well-known heterogeneous mean field approach in the literature. Ultimately, we support our theoretical results through extensive numerical evaluations and Monte Carlo simulations. Published by Elsevier Ltd.

The signaling petri net-based simulator: a non-parametric strategy for characterizing the dynamics of cell-specific signaling networks.

PubMed

Ruths, Derek; Muller, Melissa; Tseng, Jen-Te; Nakhleh, Luay; Ram, Prahlad T

2008-02-29

Reconstructing cellular signaling networks and understanding how they work are major endeavors in cell biology. The scale and complexity of these networks, however, render their analysis using experimental biology approaches alone very challenging. As a result, computational methods have been developed and combined with experimental biology approaches, producing powerful tools for the analysis of these networks. These computational methods mostly fall on either end of a spectrum of model parameterization. On one end is a class of structural network analysis methods; these typically use the network connectivity alone to generate hypotheses about global properties. On the other end is a class of dynamic network analysis methods; these use, in addition to the connectivity, kinetic parameters of the biochemical reactions to predict the network's dynamic behavior. These predictions provide detailed insights into the properties that determine aspects of the network's structure and behavior. However, the difficulty of obtaining numerical values of kinetic parameters is widely recognized to limit the applicability of this latter class of methods. Several researchers have observed that the connectivity of a network alone can provide significant insights into its dynamics. Motivated by this fundamental observation, we present the signaling Petri net, a non-parametric model of cellular signaling networks, and the signaling Petri net-based simulator, a Petri net execution strategy for characterizing the dynamics of signal flow through a signaling network using token distribution and sampling. The result is a very fast method, which can analyze large-scale networks, and provide insights into the trends of molecules' activity-levels in response to an external stimulus, based solely on the network's connectivity. We have implemented the signaling Petri net-based simulator in the PathwayOracle toolkit, which is publicly available at http://bioinfo.cs.rice.edu/pathwayoracle. Using this method, we studied a MAPK1,2 and AKT signaling network downstream from EGFR in two breast tumor cell lines. We analyzed, both experimentally and computationally, the activity level of several molecules in response to a targeted manipulation of TSC2 and mTOR-Raptor. The results from our method agreed with experimental results in greater than 90% of the cases considered, and in those where they did not agree, our approach provided valuable insights into discrepancies between known network connectivities and experimental observations.

The Signaling Petri Net-Based Simulator: A Non-Parametric Strategy for Characterizing the Dynamics of Cell-Specific Signaling Networks

PubMed Central

Ruths, Derek; Muller, Melissa; Tseng, Jen-Te; Nakhleh, Luay; Ram, Prahlad T.

2008-01-01

Reconstructing cellular signaling networks and understanding how they work are major endeavors in cell biology. The scale and complexity of these networks, however, render their analysis using experimental biology approaches alone very challenging. As a result, computational methods have been developed and combined with experimental biology approaches, producing powerful tools for the analysis of these networks. These computational methods mostly fall on either end of a spectrum of model parameterization. On one end is a class of structural network analysis methods; these typically use the network connectivity alone to generate hypotheses about global properties. On the other end is a class of dynamic network analysis methods; these use, in addition to the connectivity, kinetic parameters of the biochemical reactions to predict the network's dynamic behavior. These predictions provide detailed insights into the properties that determine aspects of the network's structure and behavior. However, the difficulty of obtaining numerical values of kinetic parameters is widely recognized to limit the applicability of this latter class of methods. Several researchers have observed that the connectivity of a network alone can provide significant insights into its dynamics. Motivated by this fundamental observation, we present the signaling Petri net, a non-parametric model of cellular signaling networks, and the signaling Petri net-based simulator, a Petri net execution strategy for characterizing the dynamics of signal flow through a signaling network using token distribution and sampling. The result is a very fast method, which can analyze large-scale networks, and provide insights into the trends of molecules' activity-levels in response to an external stimulus, based solely on the network's connectivity. We have implemented the signaling Petri net-based simulator in the PathwayOracle toolkit, which is publicly available at http://bioinfo.cs.rice.edu/pathwayoracle. Using this method, we studied a MAPK1,2 and AKT signaling network downstream from EGFR in two breast tumor cell lines. We analyzed, both experimentally and computationally, the activity level of several molecules in response to a targeted manipulation of TSC2 and mTOR-Raptor. The results from our method agreed with experimental results in greater than 90% of the cases considered, and in those where they did not agree, our approach provided valuable insights into discrepancies between known network connectivities and experimental observations. PMID:18463702

On dynamics of integrate-and-fire neural networks with conductance based synapses.

PubMed

Cessac, Bruno; Viéville, Thierry

2008-01-01

We present a mathematical analysis of networks with integrate-and-fire (IF) neurons with conductance based synapses. Taking into account the realistic fact that the spike time is only known within some finite precision, we propose a model where spikes are effective at times multiple of a characteristic time scale delta, where delta can be arbitrary small (in particular, well beyond the numerical precision). We make a complete mathematical characterization of the model-dynamics and obtain the following results. The asymptotic dynamics is composed by finitely many stable periodic orbits, whose number and period can be arbitrary large and can diverge in a region of the synaptic weights space, traditionally called the "edge of chaos", a notion mathematically well defined in the present paper. Furthermore, except at the edge of chaos, there is a one-to-one correspondence between the membrane potential trajectories and the raster plot. This shows that the neural code is entirely "in the spikes" in this case. As a key tool, we introduce an order parameter, easy to compute numerically, and closely related to a natural notion of entropy, providing a relevant characterization of the computational capabilities of the network. This allows us to compare the computational capabilities of leaky and IF models and conductance based models. The present study considers networks with constant input, and without time-dependent plasticity, but the framework has been designed for both extensions.

Retrieval and Validation of Zenith and Slant Path Delays From the Irish GPS Network

NASA Astrophysics Data System (ADS)

Hanafin, Jennifer; Jennings, S. Gerard; O'Dowd, Colin; McGrath, Ray; Whelan, Eoin

2010-05-01

Retrieval of atmospheric integrated water vapour (IWV) from ground-based GPS receivers and provision of this data product for meteorological applications has been the focus of a number of Europe-wide networks and projects, most recently the EUMETNET GPS water vapour programme. The results presented here are from a project to provide such information about the state of the atmosphere around Ireland for climate monitoring and improved numerical weather prediction. Two geodetic reference GPS receivers have been deployed at Valentia Observatory in Co. Kerry and Mace Head Atmospheric Research Station in Co. Galway, Ireland. These two receivers supplement the existing Ordnance Survey Ireland active network of 17 permanent ground-based receivers. A system to retrieve column-integrated atmospheric water vapour from the data provided by this network has been developed, based on the GPS Analysis at MIT (GAMIT) software package. The data quality of the zenith retrievals has been assessed using co-located radiosondes at the Valentia site and observations from a microwave profiling radiometer at the Mace Head site. Validation of the slant path retrievals requires a numerical weather prediction model and HIRLAM (High-Resolution Limited Area Model) version 7.2, the current operational forecast model in use at Met Éireann for the region, has been used for this validation work. Results from the data processing and comparisons with the independent observations and model will be presented.

Coexistence and local μ-stability of multiple equilibrium points for memristive neural networks with nonmonotonic piecewise linear activation functions and unbounded time-varying delays.

PubMed

Nie, Xiaobing; Zheng, Wei Xing; Cao, Jinde

2016-12-01

In this paper, the coexistence and dynamical behaviors of multiple equilibrium points are discussed for a class of memristive neural networks (MNNs) with unbounded time-varying delays and nonmonotonic piecewise linear activation functions. By means of the fixed point theorem, nonsmooth analysis theory and rigorous mathematical analysis, it is proven that under some conditions, such n-neuron MNNs can have 5 n equilibrium points located in ℜ n , and 3 n of them are locally μ-stable. As a direct application, some criteria are also obtained on the multiple exponential stability, multiple power stability, multiple log-stability and multiple log-log-stability. All these results reveal that the addressed neural networks with activation functions introduced in this paper can generate greater storage capacity than the ones with Mexican-hat-type activation function. Numerical simulations are presented to substantiate the theoretical results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Design and Analysis of a Dynamic Mobility Management Scheme for Wireless Mesh Network

PubMed Central

Roy, Sudipta

2013-01-01

Seamless mobility management of the mesh clients (MCs) in wireless mesh network (WMN) has drawn a lot of attention from the research community. A number of mobility management schemes such as mesh network with mobility management (MEMO), mesh mobility management (M3), and wireless mesh mobility management (WMM) have been proposed. The common problem with these schemes is that they impose uniform criteria on all the MCs for sending route update message irrespective of their distinct characteristics. This paper proposes a session-to-mobility ratio (SMR) based dynamic mobility management scheme for handling both internet and intranet traffic. To reduce the total communication cost, this scheme considers each MC's session and mobility characteristics by dynamically determining optimal threshold SMR value for each MC. A numerical analysis of the proposed scheme has been carried out. Comparison with other schemes shows that the proposed scheme outperforms MEMO, M3, and WMM with respect to total cost. PMID:24311982

Delay decomposition approach to [Formula: see text] filtering analysis of genetic oscillator networks with time-varying delays.

PubMed

Revathi, V M; Balasubramaniam, P

2016-04-01

In this paper, the [Formula: see text] filtering problem is treated for N coupled genetic oscillator networks with time-varying delays and extrinsic molecular noises. Each individual genetic oscillator is a complex dynamical network that represents the genetic oscillations in terms of complicated biological functions with inner or outer couplings denote the biochemical interactions of mRNAs, proteins and other small molecules. Throughout the paper, first, by constructing appropriate delay decomposition dependent Lyapunov-Krasovskii functional combined with reciprocal convex approach, improved delay-dependent sufficient conditions are obtained to ensure the asymptotic stability of the filtering error system with a prescribed [Formula: see text] performance. Second, based on the above analysis, the existence of the designed [Formula: see text] filters are established in terms of linear matrix inequalities with Kronecker product. Finally, numerical examples including a coupled Goodwin oscillator model are inferred to illustrate the effectiveness and less conservatism of the proposed techniques.

IMC/RMC Network Professional Film Collection.

ERIC Educational Resources Information Center

New York State Education Dept., Albany. Special Education Instructional Materials Center.

The compilation is a comprehensive listing of films available from the centers in the Instructional Materials Centers/Regional Media Centers (IMC/RMC) Network. Each IMC/RMC location is given a numerical code in a preliminary listing. These numerical codes are used within the film listing, which is arranged alphabetically according to film titles,…

MINER: exploratory analysis of gene interaction networks by machine learning from expression data.

PubMed

Kadupitige, Sidath Randeni; Leung, Kin Chun; Sellmeier, Julia; Sivieng, Jane; Catchpoole, Daniel R; Bain, Michael E; Gaëta, Bruno A

2009-12-03

The reconstruction of gene regulatory networks from high-throughput "omics" data has become a major goal in the modelling of living systems. Numerous approaches have been proposed, most of which attempt only "one-shot" reconstruction of the whole network with no intervention from the user, or offer only simple correlation analysis to infer gene dependencies. We have developed MINER (Microarray Interactive Network Exploration and Representation), an application that combines multivariate non-linear tree learning of individual gene regulatory dependencies, visualisation of these dependencies as both trees and networks, and representation of known biological relationships based on common Gene Ontology annotations. MINER allows biologists to explore the dependencies influencing the expression of individual genes in a gene expression data set in the form of decision, model or regression trees, using their domain knowledge to guide the exploration and formulate hypotheses. Multiple trees can then be summarised in the form of a gene network diagram. MINER is being adopted by several of our collaborators and has already led to the discovery of a new significant regulatory relationship with subsequent experimental validation. Unlike most gene regulatory network inference methods, MINER allows the user to start from genes of interest and build the network gene-by-gene, incorporating domain expertise in the process. This approach has been used successfully with RNA microarray data but is applicable to other quantitative data produced by high-throughput technologies such as proteomics and "next generation" DNA sequencing.

Negative autoregulation matches production and demand in synthetic transcriptional networks.

PubMed

Franco, Elisa; Giordano, Giulia; Forsberg, Per-Ola; Murray, Richard M

2014-08-15

We propose a negative feedback architecture that regulates activity of artificial genes, or "genelets", to meet their output downstream demand, achieving robustness with respect to uncertain open-loop output production rates. In particular, we consider the case where the outputs of two genelets interact to form a single assembled product. We show with analysis and experiments that negative autoregulation matches the production and demand of the outputs: the magnitude of the regulatory signal is proportional to the "error" between the circuit output concentration and its actual demand. This two-device system is experimentally implemented using in vitro transcriptional networks, where reactions are systematically designed by optimizing nucleic acid sequences with publicly available software packages. We build a predictive ordinary differential equation (ODE) model that captures the dynamics of the system and can be used to numerically assess the scalability of this architecture to larger sets of interconnected genes. Finally, with numerical simulations we contrast our negative autoregulation scheme with a cross-activation architecture, which is less scalable and results in slower response times.

Joint physical and numerical modeling of water distribution networks.

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

Zimmerman, Adam; O'Hern, Timothy John; Orear, Leslie Jr.

2009-01-01

This report summarizes the experimental and modeling effort undertaken to understand solute mixing in a water distribution network conducted during the last year of a 3-year project. The experimental effort involves measurement of extent of mixing within different configurations of pipe networks, measurement of dynamic mixing in a single mixing tank, and measurement of dynamic solute mixing in a combined network-tank configuration. High resolution analysis of turbulence mixing is carried out via high speed photography as well as 3D finite-volume based Large Eddy Simulation turbulence models. Macroscopic mixing rules based on flow momentum balance are also explored, and in somemore » cases, implemented in EPANET. A new version EPANET code was developed to yield better mixing predictions. The impact of a storage tank on pipe mixing in a combined pipe-tank network during diurnal fill-and-drain cycles is assessed. Preliminary comparison between dynamic pilot data and EPANET-BAM is also reported.« less

Modeling and Analysis of Hybrid Cellular/WLAN Systems with Integrated Service-Based Vertical Handoff Schemes

NASA Astrophysics Data System (ADS)

Xia, Weiwei; Shen, Lianfeng

We propose two vertical handoff schemes for cellular network and wireless local area network (WLAN) integration: integrated service-based handoff (ISH) and integrated service-based handoff with queue capabilities (ISHQ). Compared with existing handoff schemes in integrated cellular/WLAN networks, the proposed schemes consider a more comprehensive set of system characteristics such as different features of voice and data services, dynamic information about the admitted calls, user mobility and vertical handoffs in two directions. The code division multiple access (CDMA) cellular network and IEEE 802.11e WLAN are taken into account in the proposed schemes. We model the integrated networks by using multi-dimensional Markov chains and the major performance measures are derived for voice and data services. The important system parameters such as thresholds to prioritize handoff voice calls and queue sizes are optimized. Numerical results demonstrate that the proposed ISHQ scheme can maximize the utilization of overall bandwidth resources with the best quality of service (QoS) provisioning for voice and data services.

Burstiness and tie activation strategies in time-varying social networks.

PubMed

Ubaldi, Enrico; Vezzani, Alessandro; Karsai, Márton; Perra, Nicola; Burioni, Raffaella

2017-04-13

The recent developments in the field of social networks shifted the focus from static to dynamical representations, calling for new methods for their analysis and modelling. Observations in real social systems identified two main mechanisms that play a primary role in networks' evolution and influence ongoing spreading processes: the strategies individuals adopt when selecting between new or old social ties, and the bursty nature of the social activity setting the pace of these choices. We introduce a time-varying network model accounting both for ties selection and burstiness and we analytically study its phase diagram. The interplay of the two effects is non trivial and, interestingly, the effects of burstiness might be suppressed in regimes where individuals exhibit a strong preference towards previously activated ties. The results are tested against numerical simulations and compared with two empirical datasets with very good agreement. Consequently, the framework provides a principled method to classify the temporal features of real networks, and thus yields new insights to elucidate the effects of social dynamics on spreading processes.

Stochastic user equilibrium model with a tradable credit scheme and application in maximizing network reserve capacity

NASA Astrophysics Data System (ADS)

Han, Fei; Cheng, Lin

2017-04-01

The tradable credit scheme (TCS) outperforms congestion pricing in terms of social equity and revenue neutrality, apart from the same perfect performance on congestion mitigation. This article investigates the effectiveness and efficiency of TCS on enhancing transportation network capacity in a stochastic user equilibrium (SUE) modelling framework. First, the SUE and credit market equilibrium conditions are presented; then an equivalent general SUE model with TCS is established by virtue of two constructed functions, which can be further simplified under a specific probability distribution. To enhance the network capacity by utilizing TCS, a bi-level mathematical programming model is established for the optimal TCS design problem, with the upper level optimization objective maximizing network reserve capacity and lower level being the proposed SUE model. The heuristic sensitivity analysis-based algorithm is developed to solve the bi-level model. Three numerical examples are provided to illustrate the improvement effect of TCS on the network in different scenarios.

Discrete dynamic modeling of cellular signaling networks.

PubMed

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Phonological experience modulates voice discrimination: Evidence from functional brain networks analysis.

PubMed

Hu, Xueping; Wang, Xiangpeng; Gu, Yan; Luo, Pei; Yin, Shouhang; Wang, Lijun; Fu, Chao; Qiao, Lei; Du, Yi; Chen, Antao

2017-10-01

Numerous behavioral studies have found a modulation effect of phonological experience on voice discrimination. However, the neural substrates underpinning this phenomenon are poorly understood. Here we manipulated language familiarity to test the hypothesis that phonological experience affects voice discrimination via mediating the engagement of multiple perceptual and cognitive resources. The results showed that during voice discrimination, the activation of several prefrontal regions was modulated by language familiarity. More importantly, the same effect was observed concerning the functional connectivity from the fronto-parietal network to the voice-identity network (VIN), and from the default mode network to the VIN. Our findings indicate that phonological experience could bias the recruitment of cognitive control and information retrieval/comparison processes during voice discrimination. Therefore, the study unravels the neural substrates subserving the modulation effect of phonological experience on voice discrimination, and provides new insights into studying voice discrimination from the perspective of network interactions. Copyright © 2017. Published by Elsevier Inc.

Network Analyses for Space-Time High Frequency Wind Data

NASA Astrophysics Data System (ADS)

Laib, Mohamed; Kanevski, Mikhail

2017-04-01

Recently, network science has shown an important contribution to the analysis, modelling and visualization of complex time series. Numerous existing methods have been proposed for constructing networks. This work studies spatio-temporal wind data by using networks based on the Granger causality test. Furthermore, a visual comparison is carried out with several frequencies of data and different size of moving window. The main attention is paid to the temporal evolution of connectivity intensity. The Hurst exponent is applied on the provided time series in order to explore if there is a long connectivity memory. The results explore the space time structure of wind data and can be applied to other environmental data. The used dataset presents a challenging case study. It consists of high frequency (10 minutes) wind data from 120 measuring stations in Switzerland, for a time period of 2012-2013. The distribution of stations covers different geomorphological zones and elevation levels. The results are compared with the Person correlation network as well.

Numerical Modeling of Unsteady Thermofluid Dynamics in Cryogenic Systems

NASA Technical Reports Server (NTRS)

Majumdar, Alok

2003-01-01

A finite volume based network analysis procedure has been applied to model unsteady flow without and with heat transfer. Liquid has been modeled as compressible fluid where the compressibility factor is computed from the equation of state for a real fluid. The modeling approach recognizes that the pressure oscillation is linked with the variation of the compressibility factor; therefore, the speed of sound does not explicitly appear in the governing equations. The numerical results of chilldown process also suggest that the flow and heat transfer are strongly coupled. This is evident by observing that the mass flow rate during 90-second chilldown process increases by factor of ten.

An Artificial Neural Networks Method for Solving Partial Differential Equations

NASA Astrophysics Data System (ADS)

Alharbi, Abir

2010-09-01

While there already exists many analytical and numerical techniques for solving PDEs, this paper introduces an approach using artificial neural networks. The approach consists of a technique developed by combining the standard numerical method, finite-difference, with the Hopfield neural network. The method is denoted Hopfield-finite-difference (HFD). The architecture of the nets, energy function, updating equations, and algorithms are developed for the method. The HFD method has been used successfully to approximate the solution of classical PDEs, such as the Wave, Heat, Poisson and the Diffusion equations, and on a system of PDEs. The software Matlab is used to obtain the results in both tabular and graphical form. The results are similar in terms of accuracy to those obtained by standard numerical methods. In terms of speed, the parallel nature of the Hopfield nets methods makes them easier to implement on fast parallel computers while some numerical methods need extra effort for parallelization.

Right-side-stretched multifractal spectra indicate small-worldness in networks

NASA Astrophysics Data System (ADS)

Oświȩcimka, Paweł; Livi, Lorenzo; Drożdż, Stanisław

2018-04-01

Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features observed in real-world systems: i) local clustering and ii) the possibility to move across a network by means of long-range links that significantly reduce the characteristic path length. A natural question would be whether there exist several ;types; of small-world architectures, giving rise to a continuum of models with properties (partially) shared with other models belonging to different network families. Here, we take advantage of the interplay between network theory and time series analysis and propose to investigate small-world signatures in complex networks by analyzing multifractal characteristics of time series generated from such networks. In particular, we suggest that the degree of right-sided asymmetry of multifractal spectra is linked with the degree of small-worldness present in networks. This claim is supported by numerical simulations performed on several parametric models, including prototypical small-world networks, scale-free, fractal and also real-world networks describing protein molecules. Our results also indicate that right-sided asymmetry emerges with the presence of the following topological properties: low edge density, low average shortest path, and high clustering coefficient.

Optimizing decentralized production-distribution planning problem in a multi-period supply chain network under uncertainty

NASA Astrophysics Data System (ADS)

Nourifar, Raheleh; Mahdavi, Iraj; Mahdavi-Amiri, Nezam; Paydar, Mohammad Mahdi

2017-09-01

Decentralized supply chain management is found to be significantly relevant in today's competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final product is appropriated with stochastic and fuzzy numbers. We provide mathematical formulation of the problem as a bi-level mixed integer linear programming model. Due to problem's convolution, a structure to solve is developed that incorporates a novel heuristic algorithm based on Kth-best algorithm, fuzzy approach and chance constraint approach. Ultimately, a numerical example is constructed and worked through to demonstrate applicability of the optimization model. A sensitivity analysis is also made.

Finite time synchronization of memristor-based Cohen-Grossberg neural networks with mixed delays.

PubMed

Chen, Chuan; Li, Lixiang; Peng, Haipeng; Yang, Yixian

2017-01-01

Finite time synchronization, which means synchronization can be achieved in a settling time, is desirable in some practical applications. However, most of the published results on finite time synchronization don't include delays or only include discrete delays. In view of the fact that distributed delays inevitably exist in neural networks, this paper aims to investigate the finite time synchronization of memristor-based Cohen-Grossberg neural networks (MCGNNs) with both discrete delay and distributed delay (mixed delays). By means of a simple feedback controller and novel finite time synchronization analysis methods, several new criteria are derived to ensure the finite time synchronization of MCGNNs with mixed delays. The obtained criteria are very concise and easy to verify. Numerical simulations are presented to demonstrate the effectiveness of our theoretical results.

Exploiting Information Diffusion Feature for Link Prediction in Sina Weibo

NASA Astrophysics Data System (ADS)

Li, Dong; Zhang, Yongchao; Xu, Zhiming; Chu, Dianhui; Li, Sheng

2016-01-01

The rapid development of online social networks (e.g., Twitter and Facebook) has promoted research related to social networks in which link prediction is a key problem. Although numerous attempts have been made for link prediction based on network structure, node attribute and so on, few of the current studies have considered the impact of information diffusion on link creation and prediction. This paper mainly addresses Sina Weibo, which is the largest microblog platform with Chinese characteristics, and proposes the hypothesis that information diffusion influences link creation and verifies the hypothesis based on real data analysis. We also detect an important feature from the information diffusion process, which is used to promote link prediction performance. Finally, the experimental results on Sina Weibo dataset have demonstrated the effectiveness of our methods.

Exploiting Information Diffusion Feature for Link Prediction in Sina Weibo.

PubMed

Li, Dong; Zhang, Yongchao; Xu, Zhiming; Chu, Dianhui; Li, Sheng

2016-01-28

The rapid development of online social networks (e.g., Twitter and Facebook) has promoted research related to social networks in which link prediction is a key problem. Although numerous attempts have been made for link prediction based on network structure, node attribute and so on, few of the current studies have considered the impact of information diffusion on link creation and prediction. This paper mainly addresses Sina Weibo, which is the largest microblog platform with Chinese characteristics, and proposes the hypothesis that information diffusion influences link creation and verifies the hypothesis based on real data analysis. We also detect an important feature from the information diffusion process, which is used to promote link prediction performance. Finally, the experimental results on Sina Weibo dataset have demonstrated the effectiveness of our methods.

Artificial neural network in cosmic landscape

NASA Astrophysics Data System (ADS)

Liu, Junyu

2017-12-01

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

2005 22nd International Symposium on Ballistics. Volume 3 Thursday - Friday

DTIC Science & Technology

2005-11-18

QinetiQ; Vladimir Titarev, Eleuterio Toro , Umeritek Limited The Mechanism Analysis of Interior Ballistics of Serial Chamber Gun, Dr. Sanjiu Ying, Charge...Elements and Meshless Particles, Gordon R. Johnson and Robert A. Stryk, Network Computing Services, Inc. Experimental and Numerical Study of the...Internal Ballistics Clive R. Woodley, David Finbow, QinetiQ; Vladimir Titarev, Eleuterio Toro , Numeritek Limited 22nd International Symposium on

Atmospheric cloud physics thermal systems analysis

NASA Technical Reports Server (NTRS)

1977-01-01

Engineering analyses performed on the Atmospheric Cloud Physics (ACPL) Science Simulator expansion chamber and associated thermal control/conditioning system are reported. Analyses were made to develop a verified thermal model and to perform parametric thermal investigations to evaluate systems performance characteristics. Thermal network representations of solid components and the complete fluid conditioning system were solved simultaneously using the Systems Improved Numerical Differencing Analyzer (SINDA) computer program.

Uncertainty in Damage Detection, Dynamic Propagation and Just-in-Time Networks

DTIC Science & Technology

2015-08-03

estimated parameter uncertainty in dynamic data sets; high order compact finite difference schemes for Helmholtz equations with discontinuous wave numbers...delay differential equations with a Gamma distributed delay. We found that with the same population size the histogram plots for the solution to the...schemes for Helmholtz equations with discontinuous wave numbers across interfaces. • We carried out numerical sensitivity analysis with respect to

A recurrent neural network for solving bilevel linear programming problem.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian

2014-04-01

In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.

Analysis of quasi-periodic pore-network structure of centric marine diatom frustules

NASA Astrophysics Data System (ADS)

Cohoon, Gregory A.; Alvarez, Christine E.; Meyers, Keith; Deheyn, Dimitri D.; Hildebrand, Mark; Kieu, Khanh; Norwood, Robert A.

2015-03-01

Diatoms are a common type of phytoplankton characterized by their silica exoskeleton known as a frustule. The diatom frustule is composed of two valves and a series of connecting girdle bands. Each diatom species has a unique frustule shape and valves in particular species display an intricate pattern of pores resembling a photonic crystal structure. We used several numerical techniques to analyze the periodic and quasi-periodic valve pore-network structure in diatoms of the Coscinodiscophyceae order. We quantitatively identify defect locations and pore spacing in the valve and use this information to better understand the optical and biological properties of the diatom.

Passive quantum error correction of linear optics networks through error averaging

NASA Astrophysics Data System (ADS)

Marshman, Ryan J.; Lund, Austin P.; Rohde, Peter P.; Ralph, Timothy C.

2018-02-01

We propose and investigate a method of error detection and noise correction for bosonic linear networks using a method of unitary averaging. The proposed error averaging does not rely on ancillary photons or control and feedforward correction circuits, remaining entirely passive in its operation. We construct a general mathematical framework for this technique and then give a series of proof of principle examples including numerical analysis. Two methods for the construction of averaging are then compared to determine the most effective manner of implementation and probe the related error thresholds. Finally we discuss some of the potential uses of this scheme.

Synaptic dynamics regulation in response to high frequency stimulation in neuronal networks

NASA Astrophysics Data System (ADS)

Su, Fei; Wang, Jiang; Li, Huiyan; Wei, Xile; Yu, Haitao; Deng, Bin

2018-02-01

High frequency stimulation (HFS) has confirmed its ability in modulating the pathological neural activities. However its detailed mechanism is unclear. This study aims to explore the effects of HFS on neuronal networks dynamics. First, the two-neuron FitzHugh-Nagumo (FHN) networks with static coupling strength and the small-world FHN networks with spike-time-dependent plasticity (STDP) modulated synaptic coupling strength are constructed. Then, the multi-scale method is used to transform the network models into equivalent averaged models, where the HFS intensity is modeled as the ratio between stimulation amplitude and frequency. Results show that in static two-neuron networks, there is still synaptic current projected to the postsynaptic neuron even if the presynaptic neuron is blocked by the HFS. In the small-world networks, the effects of the STDP adjusting rate parameter on the inactivation ratio and synchrony degree increase with the increase of HFS intensity. However, only when the HFS intensity becomes very large can the STDP time window parameter affect the inactivation ratio and synchrony index. Both simulation and numerical analysis demonstrate that the effects of HFS on neuronal network dynamics are realized through the adjustment of synaptic variable and conductance.

Multi-criteria robustness analysis of metro networks

NASA Astrophysics Data System (ADS)

Wang, Xiangrong; Koç, Yakup; Derrible, Sybil; Ahmad, Sk Nasir; Pino, Willem J. A.; Kooij, Robert E.

2017-05-01

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical networks, metros can be viewed as topological entities, and as such they possess measurable network properties. In this article, by using network science and graph theory, we investigate ten theoretical and four numerical robustness metrics and their performance in quantifying the robustness of 33 metro networks under random failures or targeted attacks. We find that the ten theoretical metrics capture two distinct aspects of robustness of metro networks. First, several metrics place an emphasis on alternative paths. Second, other metrics place an emphasis on the length of the paths. To account for all aspects, we standardize all ten indicators and plot them on radar diagrams to assess the overall robustness for metro networks. Overall, we find that Tokyo and Rome are the most robust networks. Rome benefits from short transferring and Tokyo has a significant number of transfer stations, both in the city center and in the peripheral area of the city, promoting both a higher number of alternative paths and overall relatively short path-lengths.

Longitudinal Brain Development of Numerical Skills in Typically Developing Children and Children with Developmental Dyscalculia.

PubMed

McCaskey, Ursina; von Aster, Michael; Maurer, Urs; Martin, Ernst; O'Gorman Tuura, Ruth; Kucian, Karin

2017-01-01

Developmental dyscalculia (DD) is a learning disability affecting the acquisition of numerical-arithmetical skills. Studies report persistent deficits in number processing and aberrant functional activation of the fronto-parietal numerical network in DD. However, the neural development of numerical abilities has been scarcely investigated. The present paper provides a first attempt to investigate behavioral and neural trajectories of numerical abilities longitudinally in typically developing (TD) and DD children. During a study period of 4 years, 28 children (8-11 years) were evaluated twice by means of neuropsychological tests and a numerical order fMRI paradigm. Over time, TD children improved in numerical abilities and showed a consistent and well-developed fronto-parietal network. In contrast, DD children revealed persistent deficits in number processing and arithmetic. Brain imaging results of the DD group showed an age-related activation increase in parietal regions (intraparietal sulcus), pointing to a delayed development of number processing areas. Besides, an activation increase in frontal areas was observed over time, indicating the use of compensatory mechanisms. In conclusion, results suggest a continuation in neural development of number representation in DD, whereas the neural network for simple ordinal number estimation seems to be stable or show only subtle changes in TD children over time.

Longitudinal Brain Development of Numerical Skills in Typically Developing Children and Children with Developmental Dyscalculia

PubMed Central

McCaskey, Ursina; von Aster, Michael; Maurer, Urs; Martin, Ernst; O'Gorman Tuura, Ruth; Kucian, Karin

2018-01-01

Developmental dyscalculia (DD) is a learning disability affecting the acquisition of numerical-arithmetical skills. Studies report persistent deficits in number processing and aberrant functional activation of the fronto-parietal numerical network in DD. However, the neural development of numerical abilities has been scarcely investigated. The present paper provides a first attempt to investigate behavioral and neural trajectories of numerical abilities longitudinally in typically developing (TD) and DD children. During a study period of 4 years, 28 children (8–11 years) were evaluated twice by means of neuropsychological tests and a numerical order fMRI paradigm. Over time, TD children improved in numerical abilities and showed a consistent and well-developed fronto-parietal network. In contrast, DD children revealed persistent deficits in number processing and arithmetic. Brain imaging results of the DD group showed an age-related activation increase in parietal regions (intraparietal sulcus), pointing to a delayed development of number processing areas. Besides, an activation increase in frontal areas was observed over time, indicating the use of compensatory mechanisms. In conclusion, results suggest a continuation in neural development of number representation in DD, whereas the neural network for simple ordinal number estimation seems to be stable or show only subtle changes in TD children over time. PMID:29354041

Neural computing for numeric-to-symbolic conversion in control systems

NASA Technical Reports Server (NTRS)

Passino, Kevin M.; Sartori, Michael A.; Antsaklis, Panos J.

1989-01-01

A type of neural network, the multilayer perceptron, is used to classify numeric data and assign appropriate symbols to various classes. This numeric-to-symbolic conversion results in a type of information extraction, which is similar to what is called data reduction in pattern recognition. The use of the neural network as a numeric-to-symbolic converter is introduced, its application in autonomous control is discussed, and several applications are studied. The perceptron is used as a numeric-to-symbolic converter for a discrete-event system controller supervising a continuous variable dynamic system. It is also shown how the perceptron can implement fault trees, which provide useful information (alarms) in a biological system and information for failure diagnosis and control purposes in an aircraft example.

Neural Systems Underlying Individual Differences in Intertemporal Decision-making.

PubMed

Elton, Amanda; Smith, Christopher T; Parrish, Michael H; Boettiger, Charlotte A

2017-03-01

Excessively choosing immediate over larger future rewards, or delay discounting (DD), associates with multiple clinical conditions. Individual differences in DD likely depend on variations in the activation of and functional interactions between networks, representing possible endophenotypes for associated disorders, including alcohol use disorders (AUDs). Numerous fMRI studies have probed the neural bases of DD, but investigations of large-scale networks remain scant. We addressed this gap by testing whether activation within large-scale networks during Now/Later decision-making predicts individual differences in DD. To do so, we scanned 95 social drinkers (18-40 years old; 50 women) using fMRI during hypothetical choices between small monetary amounts available "today" or larger amounts available later. We identified neural networks engaged during Now/Later choice using independent component analysis and tested the relationship between component activation and degree of DD. The activity of two components during Now/Later choice correlated with individual DD rates: A temporal lobe network positively correlated with DD, whereas a frontoparietal-striatal network negatively correlated with DD. Activation differences between these networks predicted individual differences in DD, and their negative correlation during Now/Later choice suggests functional competition. A generalized psychophysiological interactions analysis confirmed a decrease in their functional connectivity during decision-making. The functional connectivity of these two networks negatively correlates with alcohol-related harm, potentially implicating these networks in AUDs. These findings provide novel insight into the neural underpinnings of individual differences in impulsive decision-making with potential implications for addiction and related disorders in which impulsivity is a defining feature.

Applying an intelligent model and sensitivity analysis to inspect mass transfer kinetics, shrinkage and crust color changes of deep-fat fried ostrich meat cubes.

PubMed

Amiryousefi, Mohammad Reza; Mohebbi, Mohebbat; Khodaiyan, Faramarz

2014-01-01

The objectives of this study were to use image analysis and artificial neural network (ANN) to predict mass transfer kinetics as well as color changes and shrinkage of deep-fat fried ostrich meat cubes. Two generalized feedforward networks were separately developed by using the operation conditions as inputs. Results based on the highest numerical quantities of the correlation coefficients between the experimental versus predicted values, showed proper fitting. Sensitivity analysis results of selected ANNs showed that among the input variables, frying temperature was the most sensitive to moisture content (MC) and fat content (FC) compared to other variables. Sensitivity analysis results of selected ANNs showed that MC and FC were the most sensitive to frying temperature compared to other input variables. Similarly, for the second ANN architecture, microwave power density was the most impressive variable having the maximum influence on both shrinkage percentage and color changes. Copyright © 2013 Elsevier Ltd. All rights reserved.

Stochastic Simulation of Biomolecular Networks in Dynamic Environments

PubMed Central

Voliotis, Margaritis; Thomas, Philipp; Grima, Ramon; Bowsher, Clive G.

2016-01-01

Simulation of biomolecular networks is now indispensable for studying biological systems, from small reaction networks to large ensembles of cells. Here we present a novel approach for stochastic simulation of networks embedded in the dynamic environment of the cell and its surroundings. We thus sample trajectories of the stochastic process described by the chemical master equation with time-varying propensities. A comparative analysis shows that existing approaches can either fail dramatically, or else can impose impractical computational burdens due to numerical integration of reaction propensities, especially when cell ensembles are studied. Here we introduce the Extrande method which, given a simulated time course of dynamic network inputs, provides a conditionally exact and several orders-of-magnitude faster simulation solution. The new approach makes it feasible to demonstrate—using decision-making by a large population of quorum sensing bacteria—that robustness to fluctuations from upstream signaling places strong constraints on the design of networks determining cell fate. Our approach has the potential to significantly advance both understanding of molecular systems biology and design of synthetic circuits. PMID:27248512

Preserving Source Location Privacy for Energy Harvesting WSNs.

PubMed

Huang, Changqin; Ma, Ming; Liu, Yuxin; Liu, Anfeng

2017-03-30

Fog (From cOre to edGe) computing employs a huge number of wireless embedded devices to enable end users with anywhere-anytime-to-anything connectivity. Due to their operating nature, wireless sensor nodes often work unattended, and hence are exposed to a variety of attacks. Preserving source-location privacy plays a key role in some wireless sensor network (WSN) applications. In this paper, a redundancy branch convergence-based preserved source location privacy scheme (RBCPSLP) is proposed for energy harvesting sensor networks, with the following advantages: numerous routing branches are created in non-hotspot areas with abundant energy, and those routing branches can merge into a few routing paths before they reach the hotspot areas. The generation time, the duration of routing, and the number of routing branches are then decided independently based on the amount of energy obtained, so as to maximize network energy utilization, greatly enhance privacy protection, and provide long network lifetimes. Theoretical analysis and experimental results show that the RBCPSLP scheme allows a several-fold improvement of the network energy utilization as well as the source location privacy preservation, while maximizing network lifetimes.

Preserving Source Location Privacy for Energy Harvesting WSNs

PubMed Central

Huang, Changqin; Ma, Ming; Liu, Yuxin; Liu, Anfeng

2017-01-01

Fog (From cOre to edGe) computing employs a huge number of wireless embedded devices to enable end users with anywhere-anytime-to-anything connectivity. Due to their operating nature, wireless sensor nodes often work unattended, and hence are exposed to a variety of attacks. Preserving source-location privacy plays a key role in some wireless sensor network (WSN) applications. In this paper, a redundancy branch convergence-based preserved source location privacy scheme (RBCPSLP) is proposed for energy harvesting sensor networks, with the following advantages: numerous routing branches are created in non-hotspot areas with abundant energy, and those routing branches can merge into a few routing paths before they reach the hotspot areas. The generation time, the duration of routing, and the number of routing branches are then decided independently based on the amount of energy obtained, so as to maximize network energy utilization, greatly enhance privacy protection, and provide long network lifetimes. Theoretical analysis and experimental results show that the RBCPSLP scheme allows a several-fold improvement of the network energy utilization as well as the source location privacy preservation, while maximizing network lifetimes. PMID:28358341

Unified synchronization criteria in an array of coupled neural networks with hybrid impulses.

PubMed

Wang, Nan; Li, Xuechen; Lu, Jianquan; Alsaadi, Fuad E

2018-05-01

This paper investigates the problem of globally exponential synchronization of coupled neural networks with hybrid impulses. Two new concepts on average impulsive interval and average impulsive gain are proposed to deal with the difficulties coming from hybrid impulses. By employing the Lyapunov method combined with some mathematical analysis, some efficient unified criteria are obtained to guarantee the globally exponential synchronization of impulsive networks. Our method and criteria are proved to be effective for impulsively coupled neural networks simultaneously with synchronizing impulses and desynchronizing impulses, and we do not need to discuss these two kinds of impulses separately. Moreover, by using our average impulsive interval method, we can obtain an interesting and valuable result for the case of average impulsive interval T a =∞. For some sparse impulsive sequences with T a =∞, the impulses can happen for infinite number of times, but they do not have essential influence on the synchronization property of networks. Finally, numerical examples including scale-free networks are exploited to illustrate our theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

An Asynchronous Recurrent Network of Cellular Automaton-Based Neurons and Its Reproduction of Spiking Neural Network Activities.

PubMed

Matsubara, Takashi; Torikai, Hiroyuki

2016-04-01

Modeling and implementation approaches for the reproduction of input-output relationships in biological nervous tissues contribute to the development of engineering and clinical applications. However, because of high nonlinearity, the traditional modeling and implementation approaches encounter difficulties in terms of generalization ability (i.e., performance when reproducing an unknown data set) and computational resources (i.e., computation time and circuit elements). To overcome these difficulties, asynchronous cellular automaton-based neuron (ACAN) models, which are described as special kinds of cellular automata that can be implemented as small asynchronous sequential logic circuits have been proposed. This paper presents a novel type of such ACAN and a theoretical analysis of its excitability. This paper also presents a novel network of such neurons, which can mimic input-output relationships of biological and nonlinear ordinary differential equation model neural networks. Numerical analyses confirm that the presented network has a higher generalization ability than other major modeling and implementation approaches. In addition, Field-Programmable Gate Array-implementations confirm that the presented network requires lower computational resources.

Distribution of Orientation Selectivity in Recurrent Networks of Spiking Neurons with Different Random Topologies

PubMed Central

Sadeh, Sadra; Rotter, Stefan

2014-01-01

Neurons in the primary visual cortex are more or less selective for the orientation of a light bar used for stimulation. A broad distribution of individual grades of orientation selectivity has in fact been reported in all species. A possible reason for emergence of broad distributions is the recurrent network within which the stimulus is being processed. Here we compute the distribution of orientation selectivity in randomly connected model networks that are equipped with different spatial patterns of connectivity. We show that, for a wide variety of connectivity patterns, a linear theory based on firing rates accurately approximates the outcome of direct numerical simulations of networks of spiking neurons. Distance dependent connectivity in networks with a more biologically realistic structure does not compromise our linear analysis, as long as the linearized dynamics, and hence the uniform asynchronous irregular activity state, remain stable. We conclude that linear mechanisms of stimulus processing are indeed responsible for the emergence of orientation selectivity and its distribution in recurrent networks with functionally heterogeneous synaptic connectivity. PMID:25469704

Characterizing networks formed by P. polycephalum

NASA Astrophysics Data System (ADS)

Dirnberger, M.; Mehlhorn, K.

2017-06-01

We present a systematic study of the characteristic vein networks formed by the slime mold P. polycephalum. Our study is based on an extensive set of graph representations of slime mold networks. We analyze a total of 1998 graphs capturing growth and network formation of P. polycephalum as observed in 36 independent, identical, wet-lab experiments. Relying on concepts from graph theory such as face cycles and cuts as well as ideas from percolation theory, we establish a broad collection of individual observables taking into account various complementary aspects of P. polycephalum networks. As a whole, the collection is intended to serve as a specialized knowledge-base providing a comprehensive characterization of P. polycephalum networks. To this end, it contains individual as well as cumulative results for all investigated observables across all available data series, down to the level of single P. polycephalum graphs. Furthermore we include the raw numerical data as well as various plotting and analysis tools to ensure reproducibility and increase the usefulness of the collection. All our results are publicly available in an organized fashion in the slime mold graph repository (Smgr).

Internal fracture heterogeneity in discrete fracture network modelling: Effect of correlation length and textures with connected and disconnected permeability field

NASA Astrophysics Data System (ADS)

Frampton, A.; Hyman, J.; Zou, L.

2017-12-01

Analysing flow and transport in sparsely fractured media is important for understanding how crystalline bedrock environments function as barriers to transport of contaminants, with important applications towards subsurface repositories for storage of spent nuclear fuel. Crystalline bedrocks are particularly favourable due to their geological stability, low advective flow and strong hydrogeochemical retention properties, which can delay transport of radionuclides, allowing decay to limit release to the biosphere. There are however many challenges involved in quantifying and modelling subsurface flow and transport in fractured media, largely due to geological complexity and heterogeneity, where the interplay between advective and dispersive flow strongly impacts both inert and reactive transport. A key to modelling transport in a Lagrangian framework involves quantifying pathway travel times and the hydrodynamic control of retention, and both these quantities strongly depend on heterogeneity of the fracture network at different scales. In this contribution, we present recent analysis of flow and transport considering fracture networks with single-fracture heterogeneity described by different multivariate normal distributions. A coherent triad of fields with identical correlation length and variance are created but which greatly differ in structure, corresponding to textures with well-connected low, medium and high permeability structures. Through numerical modelling of multiple scales in a stochastic setting we quantify the relative impact of texture type and correlation length against network topological measures, and identify key thresholds for cases where flow dispersion is controlled by single-fracture heterogeneity versus network-scale heterogeneity. This is achieved by using a recently developed novel numerical discrete fracture network model. Furthermore, we highlight enhanced flow channelling for cases where correlation structure continues across intersections in a network, and discuss application to realistic fracture networks using field data of sparsely fractured crystalline rock from the Swedish candidate repository site for spent nuclear fuel.

Mean-field models for heterogeneous networks of two-dimensional integrate and fire neurons.

PubMed

Nicola, Wilten; Campbell, Sue Ann

2013-01-01

We analytically derive mean-field models for all-to-all coupled networks of heterogeneous, adapting, two-dimensional integrate and fire neurons. The class of models we consider includes the Izhikevich, adaptive exponential and quartic integrate and fire models. The heterogeneity in the parameters leads to different moment closure assumptions that can be made in the derivation of the mean-field model from the population density equation for the large network. Three different moment closure assumptions lead to three different mean-field systems. These systems can be used for distinct purposes such as bifurcation analysis of the large networks, prediction of steady state firing rate distributions, parameter estimation for actual neurons and faster exploration of the parameter space. We use the mean-field systems to analyze adaptation induced bursting under realistic sources of heterogeneity in multiple parameters. Our analysis demonstrates that the presence of heterogeneity causes the Hopf bifurcation associated with the emergence of bursting to change from sub-critical to super-critical. This is confirmed with numerical simulations of the full network for biologically reasonable parameter values. This change decreases the plausibility of adaptation being the cause of bursting in hippocampal area CA3, an area with a sizable population of heavily coupled, strongly adapting neurons.

Mean-field models for heterogeneous networks of two-dimensional integrate and fire neurons

PubMed Central

Nicola, Wilten; Campbell, Sue Ann

2013-01-01

We analytically derive mean-field models for all-to-all coupled networks of heterogeneous, adapting, two-dimensional integrate and fire neurons. The class of models we consider includes the Izhikevich, adaptive exponential and quartic integrate and fire models. The heterogeneity in the parameters leads to different moment closure assumptions that can be made in the derivation of the mean-field model from the population density equation for the large network. Three different moment closure assumptions lead to three different mean-field systems. These systems can be used for distinct purposes such as bifurcation analysis of the large networks, prediction of steady state firing rate distributions, parameter estimation for actual neurons and faster exploration of the parameter space. We use the mean-field systems to analyze adaptation induced bursting under realistic sources of heterogeneity in multiple parameters. Our analysis demonstrates that the presence of heterogeneity causes the Hopf bifurcation associated with the emergence of bursting to change from sub-critical to super-critical. This is confirmed with numerical simulations of the full network for biologically reasonable parameter values. This change decreases the plausibility of adaptation being the cause of bursting in hippocampal area CA3, an area with a sizable population of heavily coupled, strongly adapting neurons. PMID:24416013

Influence analysis for high-dimensional time series with an application to epileptic seizure onset zone detection

PubMed Central

Flamm, Christoph; Graef, Andreas; Pirker, Susanne; Baumgartner, Christoph; Deistler, Manfred

2013-01-01

Granger causality is a useful concept for studying causal relations in networks. However, numerical problems occur when applying the corresponding methodology to high-dimensional time series showing co-movement, e.g. EEG recordings or economic data. In order to deal with these shortcomings, we propose a novel method for the causal analysis of such multivariate time series based on Granger causality and factor models. We present the theoretical background, successfully assess our methodology with the help of simulated data and show a potential application in EEG analysis of epileptic seizures. PMID:23354014

Network architecture of the cerebral nuclei (basal ganglia) association and commissural connectome.

PubMed

Swanson, Larry W; Sporns, Olaf; Hahn, Joel D

2016-10-04

The cerebral nuclei form the ventral division of the cerebral hemisphere and are thought to play an important role in neural systems controlling somatic movement and motivation. Network analysis was used to define global architectural features of intrinsic cerebral nuclei circuitry in one hemisphere (association connections) and between hemispheres (commissural connections). The analysis was based on more than 4,000 reports of histologically defined axonal connections involving all 45 gray matter regions of the rat cerebral nuclei and revealed the existence of four asymmetrically interconnected modules. The modules form four topographically distinct longitudinal columns that only partly correspond to previous interpretations of cerebral nuclei structure-function organization. The network of connections within and between modules in one hemisphere or the other is quite dense (about 40% of all possible connections), whereas the network of connections between hemispheres is weak and sparse (only about 5% of all possible connections). Particularly highly interconnected regions (rich club and hubs within it) form a topologically continuous band extending through two of the modules. Connection path lengths among numerous pairs of regions, and among some of the network's modules, are relatively long, thus accounting for low global efficiency in network communication. These results provide a starting point for reexamining the connectional organization of the cerebral hemispheres as a whole (right and left cerebral cortex and cerebral nuclei together) and their relation to the rest of the nervous system.

Mean-field approximations of fixation time distributions of evolutionary game dynamics on graphs

NASA Astrophysics Data System (ADS)

Ying, Li-Min; Zhou, Jie; Tang, Ming; Guan, Shu-Guang; Zou, Yong

2018-02-01

The mean fixation time is often not accurate for describing the timescales of fixation probabilities of evolutionary games taking place on complex networks. We simulate the game dynamics on top of complex network topologies and approximate the fixation time distributions using a mean-field approach. We assume that there are two absorbing states. Numerically, we show that the mean fixation time is sufficient in characterizing the evolutionary timescales when network structures are close to the well-mixing condition. In contrast, the mean fixation time shows large inaccuracies when networks become sparse. The approximation accuracy is determined by the network structure, and hence by the suitability of the mean-field approach. The numerical results show good agreement with the theoretical predictions.

MI-Sim: A MATLAB package for the numerical analysis of microbial ecological interactions.

PubMed

Wade, Matthew J; Oakley, Jordan; Harbisher, Sophie; Parker, Nicholas G; Dolfing, Jan

2017-01-01

Food-webs and other classes of ecological network motifs, are a means of describing feeding relationships between consumers and producers in an ecosystem. They have application across scales where they differ only in the underlying characteristics of the organisms and substrates describing the system. Mathematical modelling, using mechanistic approaches to describe the dynamic behaviour and properties of the system through sets of ordinary differential equations, has been used extensively in ecology. Models allow simulation of the dynamics of the various motifs and their numerical analysis provides a greater understanding of the interplay between the system components and their intrinsic properties. We have developed the MI-Sim software for use with MATLAB to allow a rigorous and rapid numerical analysis of several common ecological motifs. MI-Sim contains a series of the most commonly used motifs such as cooperation, competition and predation. It does not require detailed knowledge of mathematical analytical techniques and is offered as a single graphical user interface containing all input and output options. The tools available in the current version of MI-Sim include model simulation, steady-state existence and stability analysis, and basin of attraction analysis. The software includes seven ecological interaction motifs and seven growth function models. Unlike other system analysis tools, MI-Sim is designed as a simple and user-friendly tool specific to ecological population type models, allowing for rapid assessment of their dynamical and behavioural properties.

Self-organization of complex networks as a dynamical system

NASA Astrophysics Data System (ADS)

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

Self-organization of complex networks as a dynamical system.

PubMed

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

EEG Cortical Connectivity Analysis of Working Memory Reveals Topological Reorganization in Theta and Alpha Bands

PubMed Central

Dai, Zhongxiang; de Souza, Joshua; Lim, Julian; Ho, Paul M.; Chen, Yu; Li, Junhua; Thakor, Nitish; Bezerianos, Anastasios; Sun, Yu

2017-01-01

Numerous studies have revealed various working memory (WM)-related brain activities that originate from various cortical regions and oscillate at different frequencies. However, multi-frequency band analysis of the brain network in WM in the cortical space remains largely unexplored. In this study, we employed a graph theoretical framework to characterize the topological properties of the brain functional network in the theta and alpha frequency bands during WM tasks. Twenty-eight subjects performed visual n-back tasks at two difficulty levels, i.e., 0-back (control task) and 2-back (WM task). After preprocessing, Electroencephalogram (EEG) signals were projected into the source space and 80 cortical brain regions were selected for further analysis. Subsequently, the theta- and alpha-band networks were constructed by calculating the Pearson correlation coefficients between the power series (obtained by concatenating the power values of all epochs in each session) of all pairs of brain regions. Graph theoretical approaches were then employed to estimate the topological properties of the brain networks at different WM tasks. We found higher functional integration in the theta band and lower functional segregation in the alpha band in the WM task compared with the control task. Moreover, compared to the 0-back task, altered regional centrality was revealed in the 2-back task in various brain regions that mainly resided in the frontal, temporal and occipital lobes, with distinct presentations in the theta and alpha bands. In addition, significant negative correlations were found between the reaction time with the average path length of the theta-band network and the local clustering of the alpha-band network, which demonstrates the potential for using the brain network metrics as biomarkers for predicting the task performance during WM tasks. PMID:28553215

EEG Cortical Connectivity Analysis of Working Memory Reveals Topological Reorganization in Theta and Alpha Bands.

PubMed

Dai, Zhongxiang; de Souza, Joshua; Lim, Julian; Ho, Paul M; Chen, Yu; Li, Junhua; Thakor, Nitish; Bezerianos, Anastasios; Sun, Yu

2017-01-01

Numerous studies have revealed various working memory (WM)-related brain activities that originate from various cortical regions and oscillate at different frequencies. However, multi-frequency band analysis of the brain network in WM in the cortical space remains largely unexplored. In this study, we employed a graph theoretical framework to characterize the topological properties of the brain functional network in the theta and alpha frequency bands during WM tasks. Twenty-eight subjects performed visual n -back tasks at two difficulty levels, i.e., 0-back (control task) and 2-back (WM task). After preprocessing, Electroencephalogram (EEG) signals were projected into the source space and 80 cortical brain regions were selected for further analysis. Subsequently, the theta- and alpha-band networks were constructed by calculating the Pearson correlation coefficients between the power series (obtained by concatenating the power values of all epochs in each session) of all pairs of brain regions. Graph theoretical approaches were then employed to estimate the topological properties of the brain networks at different WM tasks. We found higher functional integration in the theta band and lower functional segregation in the alpha band in the WM task compared with the control task. Moreover, compared to the 0-back task, altered regional centrality was revealed in the 2-back task in various brain regions that mainly resided in the frontal, temporal and occipital lobes, with distinct presentations in the theta and alpha bands. In addition, significant negative correlations were found between the reaction time with the average path length of the theta-band network and the local clustering of the alpha-band network, which demonstrates the potential for using the brain network metrics as biomarkers for predicting the task performance during WM tasks.

Innovation diffusion on time-varying activity driven networks

NASA Astrophysics Data System (ADS)

Rizzo, Alessandro; Porfiri, Maurizio

2016-01-01

Since its introduction in the 1960s, the theory of innovation diffusion has contributed to the advancement of several research fields, such as marketing management and consumer behavior. The 1969 seminal paper by Bass [F.M. Bass, Manag. Sci. 15, 215 (1969)] introduced a model of product growth for consumer durables, which has been extensively used to predict innovation diffusion across a range of applications. Here, we propose a novel approach to study innovation diffusion, where interactions among individuals are mediated by the dynamics of a time-varying network. Our approach is based on the Bass' model, and overcomes key limitations of previous studies, which assumed timescale separation between the individual dynamics and the evolution of the connectivity patterns. Thus, we do not hypothesize homogeneous mixing among individuals or the existence of a fixed interaction network. We formulate our approach in the framework of activity driven networks to enable the analysis of the concurrent evolution of the interaction and individual dynamics. Numerical simulations offer a systematic analysis of the model behavior and highlight the role of individual activity on market penetration when targeted advertisement campaigns are designed, or a competition between two different products takes place.

State-level legal preparedness for nuclear and radiological emergencies in the U.S.: a network analysis of state laws and regulations.

PubMed

Guclu, Hasan; Ferrell Bjerke, Elizabeth; Galvan, Jared; Sweeney, Patricia; Potter, Margaret A

2014-01-01

This study explored if and to what extent the laws of U.S. states mirrored the U.S. federal laws for responding to nuclear-radiological emergencies (NREs). Emergency laws from a 12-state sample and the federal government were retrieved and translated into numeric codes representing acting agents, their partner agents, and the purposes of activity in terms of preparedness, response, and recovery. We used network analysis to explore the relationships among agents in terms of legally directed NRE activities. States' legal networks for NREs appear as not highly inclusive, involving an average of 28% of agents among those specified in the federal laws. Certain agents are highly central in NRE networks, so that their capacity and effectiveness might strongly influence an NRE response. State-level lawmakers and planners might consider whether or not greater inclusion of agents, modeled on the federal government laws, would enhance their NRE laws and if more agents should be engaged in planning and policy-making for NRE incidents. Further research should explore if and to what extent legislated NRE directives impose constraints on practical response activities including emergency planning.

Critical frontier of the Potts and percolation models on triangular-type and kagome-type lattices. II. Numerical analysis

NASA Astrophysics Data System (ADS)

Ding, Chengxiang; Fu, Zhe; Guo, Wenan; Wu, F. Y.

2010-06-01

In the preceding paper, one of us (F. Y. Wu) considered the Potts model and bond and site percolation on two general classes of two-dimensional lattices, the triangular-type and kagome-type lattices, and obtained closed-form expressions for the critical frontier with applications to various lattice models. For the triangular-type lattices Wu’s result is exact, and for the kagome-type lattices Wu’s expression is under a homogeneity assumption. The purpose of the present paper is twofold: First, an essential step in Wu’s analysis is the derivation of lattice-dependent constants A,B,C for various lattice models, a process which can be tedious. We present here a derivation of these constants for subnet networks using a computer algorithm. Second, by means of a finite-size scaling analysis based on numerical transfer matrix calculations, we deduce critical properties and critical thresholds of various models and assess the accuracy of the homogeneity assumption. Specifically, we analyze the q -state Potts model and the bond percolation on the 3-12 and kagome-type subnet lattices (n×n):(n×n) , n≤4 , for which the exact solution is not known. Our numerical determination of critical properties such as conformal anomaly and magnetic correlation length verifies that the universality principle holds. To calibrate the accuracy of the finite-size procedure, we apply the same numerical analysis to models for which the exact critical frontiers are known. The comparison of numerical and exact results shows that our numerical values are correct within errors of our finite-size analysis, which correspond to 7 or 8 significant digits. This in turn infers that the homogeneity assumption determines critical frontiers with an accuracy of 5 decimal places or higher. Finally, we also obtained the exact percolation thresholds for site percolation on kagome-type subnet lattices (1×1):(n×n) for 1≤n≤6 .

Analysis of the ecological water diversion project in Wenzhou City

NASA Astrophysics Data System (ADS)

Xu, Haibo; Fu, Lei; Lin, Tong

2018-02-01

As a developed city in China, Wenzhou City has been suffered from bad water quality for years. In order to improve the river network water quality, an ecological water diversion project was designed and executed by the regional government. In this study, an investigation and analysis of the regional ecological water diversion project is made for the purpose of examining the water quality improvements. A numerical model is also established, different water diversion flow rates and sewer interception levels are considered during the simulation. Simulation results reveal that higher flow rate and sewer interception level will greatly improve the river network water quality in Wenzhou City. The importance of the flow rate and interception level has been proved and future work will be focused on increasing the flow rate and upgrading the sewer interception level.

Robust passivity analysis for discrete-time recurrent neural networks with mixed delays

NASA Astrophysics Data System (ADS)

Huang, Chuan-Kuei; Shu, Yu-Jeng; Chang, Koan-Yuh; Shou, Ho-Nien; Lu, Chien-Yu

2015-02-01

This article considers the robust passivity analysis for a class of discrete-time recurrent neural networks (DRNNs) with mixed time-delays and uncertain parameters. The mixed time-delays that consist of both the discrete time-varying and distributed time-delays in a given range are presented, and the uncertain parameters are norm-bounded. The activation functions are assumed to be globally Lipschitz continuous. Based on new bounding technique and appropriate type of Lyapunov functional, a sufficient condition is investigated to guarantee the existence of the desired robust passivity condition for the DRNNs, which can be derived in terms of a family of linear matrix inequality (LMI). Some free-weighting matrices are introduced to reduce the conservatism of the criterion by using the bounding technique. A numerical example is given to illustrate the effectiveness and applicability.

Numerically accurate computational techniques for optimal estimator analyses of multi-parameter models

NASA Astrophysics Data System (ADS)

Berger, Lukas; Kleinheinz, Konstantin; Attili, Antonio; Bisetti, Fabrizio; Pitsch, Heinz; Mueller, Michael E.

2018-05-01

Modelling unclosed terms in partial differential equations typically involves two steps: First, a set of known quantities needs to be specified as input parameters for a model, and second, a specific functional form needs to be defined to model the unclosed terms by the input parameters. Both steps involve a certain modelling error, with the former known as the irreducible error and the latter referred to as the functional error. Typically, only the total modelling error, which is the sum of functional and irreducible error, is assessed, but the concept of the optimal estimator enables the separate analysis of the total and the irreducible errors, yielding a systematic modelling error decomposition. In this work, attention is paid to the techniques themselves required for the practical computation of irreducible errors. Typically, histograms are used for optimal estimator analyses, but this technique is found to add a non-negligible spurious contribution to the irreducible error if models with multiple input parameters are assessed. Thus, the error decomposition of an optimal estimator analysis becomes inaccurate, and misleading conclusions concerning modelling errors may be drawn. In this work, numerically accurate techniques for optimal estimator analyses are identified and a suitable evaluation of irreducible errors is presented. Four different computational techniques are considered: a histogram technique, artificial neural networks, multivariate adaptive regression splines, and an additive model based on a kernel method. For multiple input parameter models, only artificial neural networks and multivariate adaptive regression splines are found to yield satisfactorily accurate results. Beyond a certain number of input parameters, the assessment of models in an optimal estimator analysis even becomes practically infeasible if histograms are used. The optimal estimator analysis in this paper is applied to modelling the filtered soot intermittency in large eddy simulations using a dataset of a direct numerical simulation of a non-premixed sooting turbulent flame.

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

PubMed

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

2009-03-01

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

Numerical Homogenization of Jointed Rock Masses Using Wave Propagation Simulation

NASA Astrophysics Data System (ADS)

Gasmi, Hatem; Hamdi, Essaïeb; Bouden Romdhane, Nejla

2014-07-01

Homogenization in fractured rock analyses is essentially based on the calculation of equivalent elastic parameters. In this paper, a new numerical homogenization method that was programmed by means of a MATLAB code, called HLA-Dissim, is presented. The developed approach simulates a discontinuity network of real rock masses based on the International Society of Rock Mechanics (ISRM) scanline field mapping methodology. Then, it evaluates a series of classic joint parameters to characterize density (RQD, specific length of discontinuities). A pulse wave, characterized by its amplitude, central frequency, and duration, is propagated from a source point to a receiver point of the simulated jointed rock mass using a complex recursive method for evaluating the transmission and reflection coefficient for each simulated discontinuity. The seismic parameters, such as delay, velocity, and attenuation, are then calculated. Finally, the equivalent medium model parameters of the rock mass are computed numerically while taking into account the natural discontinuity distribution. This methodology was applied to 17 bench fronts from six aggregate quarries located in Tunisia, Spain, Austria, and Sweden. It allowed characterizing the rock mass discontinuity network, the resulting seismic performance, and the equivalent medium stiffness. The relationship between the equivalent Young's modulus and rock discontinuity parameters was also analyzed. For these different bench fronts, the proposed numerical approach was also compared to several empirical formulas, based on RQD and fracture density values, published in previous research studies, showing its usefulness and efficiency in estimating rapidly the Young's modulus of equivalent medium for wave propagation analysis.

Competitive epidemic spreading over arbitrary multilayer networks.

PubMed

Darabi Sahneh, Faryad; Scoglio, Caterina

2014-06-01

This study extends the Susceptible-Infected-Susceptible (SIS) epidemic model for single-virus propagation over an arbitrary graph to an Susceptible-Infected by virus 1-Susceptible-Infected by virus 2-Susceptible (SI_{1}SI_{2}S) epidemic model of two exclusive, competitive viruses over a two-layer network with generic structure, where network layers represent the distinct transmission routes of the viruses. We find analytical expressions determining extinction, coexistence, and absolute dominance of the viruses after we introduce the concepts of survival threshold and absolute-dominance threshold. The main outcome of our analysis is the discovery and proof of a region for long-term coexistence of competitive viruses in nontrivial multilayer networks. We show coexistence is impossible if network layers are identical yet possible if network layers are distinct. Not only do we rigorously prove a region of coexistence, but we can quantitate it via interrelation of central nodes across the network layers. Little to no overlapping of the layers' central nodes is the key determinant of coexistence. For example, we show both analytically and numerically that positive correlation of network layers makes it difficult for a virus to survive, while in a network with negatively correlated layers, survival is easier, but total removal of the other virus is more difficult.

Pattern Formation on Networks: from Localised Activity to Turing Patterns

PubMed Central

McCullen, Nick; Wagenknecht, Thomas

2016-01-01

Networks of interactions between competing species are used to model many complex systems, such as in genetics, evolutionary biology or sociology and knowledge of the patterns of activity they can exhibit is important for understanding their behaviour. The emergence of patterns on complex networks with reaction-diffusion dynamics is studied here, where node dynamics interact via diffusion via the network edges. Through the application of a generalisation of dynamical systems analysis this work reveals a fundamental connection between small-scale modes of activity on networks and localised pattern formation seen throughout science, such as solitons, breathers and localised buckling. The connection between solutions with a single and small numbers of activated nodes and the fully developed system-scale patterns are investigated computationally using numerical continuation methods. These techniques are also used to help reveal a much larger portion of of the full number of solutions that exist in the system at different parameter values. The importance of network structure is also highlighted, with a key role being played by nodes with a certain so-called optimal degree, on which the interaction between the reaction kinetics and the network structure organise the behaviour of the system. PMID:27273339

Continuous-variable Measurement-device-independent Quantum Relay Network with Phase-sensitive Amplifiers

NASA Astrophysics Data System (ADS)

Li, Fei; Zhao, Wei; Guo, Ying

2018-01-01

Continuous-variable (CV) measurement-device-independent (MDI) quantum cryptography is now heading towards solving the practical problem of implementing scalable quantum networks. In this paper, we show that a solution can come from deploying an optical amplifier in the CV-MDI system, aiming to establish a high-rate quantum network. We suggest an improved CV-MDI protocol using the EPR states coupled with optical amplifiers. It can implement a practical quantum network scheme, where the legal participants create the secret correlations by using EPR states connecting to an untrusted relay via insecure links and applying the multi-entangled Greenberger-Horne-Zeilinger (GHZ) state analysis at relay station. Despite the possibility that the relay could be completely tampered with and imperfect links are subject to the powerful attacks, the legal participants are still able to extract a secret key from network communication. The numerical simulation indicates that the quantum network communication can be achieved in an asymmetric scenario, fulfilling the demands of a practical quantum network. Furthermore, we show that the use of optical amplifiers can compensate the inherent imperfections and improve the secret key rate of the CV-MDI system.

Event-based simulation of networks with pulse delayed coupling

NASA Astrophysics Data System (ADS)

Klinshov, Vladimir; Nekorkin, Vladimir

2017-10-01

Pulse-mediated interactions are common in networks of different nature. Here we develop a general framework for simulation of networks with pulse delayed coupling. We introduce the discrete map governing the dynamics of such networks and describe the computation algorithm for its numerical simulation.

Delay-induced Turing-like waves for one-species reaction-diffusion model on a network

NASA Astrophysics Data System (ADS)

Petit, Julien; Carletti, Timoteo; Asllani, Malbor; Fanelli, Duccio

2015-09-01

A one-species time-delay reaction-diffusion system defined on a complex network is studied. Traveling waves are predicted to occur following a symmetry-breaking instability of a homogeneous stationary stable solution, subject to an external nonhomogeneous perturbation. These are generalized Turing-like waves that materialize in a single-species populations dynamics model, as the unexpected byproduct of the imposed delay in the diffusion part. Sufficient conditions for the onset of the instability are mathematically provided by performing a linear stability analysis adapted to time-delayed differential equations. The method here developed exploits the properties of the Lambert W-function. The prediction of the theory are confirmed by direct numerical simulation carried out for a modified version of the classical Fisher model, defined on a Watts-Strogatz network and with the inclusion of the delay.

Risk perception in epidemic modeling

NASA Astrophysics Data System (ADS)

Bagnoli, Franco; Liò, Pietro; Sguanci, Luca

2007-12-01

We investigate the effects of risk perception in a simple model of epidemic spreading. We assume that the perception of the risk of being infected depends on the fraction of neighbors that are ill. The effect of this factor is to decrease the infectivity, that therefore becomes a dynamical component of the model. We study the problem in the mean-field approximation and by numerical simulations for regular, random, and scale-free networks. We show that for homogeneous and random networks, there is always a value of perception that stops the epidemics. In the “worst-case” scenario of a scale-free network with diverging input connectivity, a linear perception cannot stop the epidemics; however, we show that a nonlinear increase of the perception risk may lead to the extinction of the disease. This transition is discontinuous, and is not predicted by the mean-field analysis.

Performance analysis for wireless networks: an analytical approach by multifarious Sym Teredo.

PubMed

Punithavathani, D Shalini; Radley, Sheryl

2014-01-01

IPv4-IPv6 transition rolls out numerous challenges to the world of Internet as the Internet is drifting from IPv4 to IPv6. IETF recommends few transition techniques which includes dual stack and translation and tunneling. By means of tunneling the IPv6 packets over IPv4 UDP, Teredo maintains IPv4/IPv6 dual stack node in isolated IPv4 networks behindhand network address translation (NAT). However, the proposed tunneling protocol works with the symmetric and asymmetric NATs. In order to make a Teredo support several symmetric NATs along with several asymmetric NATs, we propose multifarious Sym Teredo (MTS), which is an extension of Teredo with a capability of navigating through several symmetric NATs. The work preserves the Teredo architecture and also offers a backward compatibility with the original Teredo protocol.

Performance Analysis for Wireless Networks: An Analytical Approach by Multifarious Sym Teredo

PubMed Central

Punithavathani, D. Shalini; Radley, Sheryl

2014-01-01

IPv4-IPv6 transition rolls out numerous challenges to the world of Internet as the Internet is drifting from IPv4 to IPv6. IETF recommends few transition techniques which includes dual stack and translation and tunneling. By means of tunneling the IPv6 packets over IPv4 UDP, Teredo maintains IPv4/IPv6 dual stack node in isolated IPv4 networks behindhand network address translation (NAT). However, the proposed tunneling protocol works with the symmetric and asymmetric NATs. In order to make a Teredo support several symmetric NATs along with several asymmetric NATs, we propose multifarious Sym Teredo (MTS), which is an extension of Teredo with a capability of navigating through several symmetric NATs. The work preserves the Teredo architecture and also offers a backward compatibility with the original Teredo protocol. PMID:25506611

Laser dynamics: The system dynamics and network theory of optoelectronic integrated circuit design

NASA Astrophysics Data System (ADS)

Tarng, Tom Shinming-T. K.

Laser dynamics is the system dynamics, communication and network theory for the design of opto-electronic integrated circuit (OEIC). Combining the optical network theory and optical communication theory, the system analysis and design for the OEIC fundamental building blocks is considered. These building blocks include the direct current modulation, inject light modulation, wideband filter, super-gain optical amplifier, E/O and O/O optical bistability and current-controlled optical oscillator. Based on the rate equations, the phase diagram and phase portrait analysis is applied to the theoretical studies and numerical simulation. The OEIC system design methodologies are developed for the OEIC design. Stimulating-field-dependent rate equations are used to model the line-width narrowing/broadening mechanism for the CW mode and frequency chirp of semiconductor lasers. The momentary spectra are carrier-density-dependent. Furthermore, the phase portrait analysis and the nonlinear refractive index is used to simulate the single mode frequency chirp. The average spectra of chaos, period doubling, period pulsing, multi-loops and analog modulation are generated and analyzed. The bifurcation-chirp design chart with modulation depth and modulation frequency as parameters is provided for design purpose.

Flow assignment model for quantitative analysis of diverting bulk freight from road to railway

PubMed Central

Liu, Chang; Wang, Jiaxi; Xiao, Jie; Liu, Siqi; Wu, Jianping; Li, Jian

2017-01-01

Since railway transport possesses the advantage of high volume and low carbon emissions, diverting some freight from road to railway will help reduce the negative environmental impacts associated with transport. This paper develops a flow assignment model for quantitative analysis of diverting truck freight to railway. First, a general network which considers road transportation, railway transportation, handling and transferring is established according to all the steps in the whole transportation process. Then general functions which embody the factors which the shippers will pay attention to when choosing mode and path are formulated. The general functions contain the congestion cost on road, the capacity constraints of railways and freight stations. Based on the general network and general cost function, a user equilibrium flow assignment model is developed to simulate the flow distribution on the general network under the condition that all shippers choose transportation mode and path independently. Since the model is nonlinear and challenging, we adopt a method that uses tangent lines to constitute envelope curve to linearize it. Finally, a numerical example is presented to test the model and show the method of making quantitative analysis of bulk freight modal shift between road and railway. PMID:28771536

Modeling complex metabolic reactions, ecological systems, and financial and legal networks with MIANN models based on Markov-Wiener node descriptors.

PubMed

Duardo-Sánchez, Aliuska; Munteanu, Cristian R; Riera-Fernández, Pablo; López-Díaz, Antonio; Pazos, Alejandro; González-Díaz, Humberto

2014-01-27

The use of numerical parameters in Complex Network analysis is expanding to new fields of application. At a molecular level, we can use them to describe the molecular structure of chemical entities, protein interactions, or metabolic networks. However, the applications are not restricted to the world of molecules and can be extended to the study of macroscopic nonliving systems, organisms, or even legal or social networks. On the other hand, the development of the field of Artificial Intelligence has led to the formulation of computational algorithms whose design is based on the structure and functioning of networks of biological neurons. These algorithms, called Artificial Neural Networks (ANNs), can be useful for the study of complex networks, since the numerical parameters that encode information of the network (for example centralities/node descriptors) can be used as inputs for the ANNs. The Wiener index (W) is a graph invariant widely used in chemoinformatics to quantify the molecular structure of drugs and to study complex networks. In this work, we explore for the first time the possibility of using Markov chains to calculate analogues of node distance numbers/W to describe complex networks from the point of view of their nodes. These parameters are called Markov-Wiener node descriptors of order k(th) (W(k)). Please, note that these descriptors are not related to Markov-Wiener stochastic processes. Here, we calculated the W(k)(i) values for a very high number of nodes (>100,000) in more than 100 different complex networks using the software MI-NODES. These networks were grouped according to the field of application. Molecular networks include the Metabolic Reaction Networks (MRNs) of 40 different organisms. In addition, we analyzed other biological and legal and social networks. These include the Interaction Web Database Biological Networks (IWDBNs), with 75 food webs or ecological systems and the Spanish Financial Law Network (SFLN). The calculated W(k)(i) values were used as inputs for different ANNs in order to discriminate correct node connectivity patterns from incorrect random patterns. The MIANN models obtained present good values of Sensitivity/Specificity (%): MRNs (78/78), IWDBNs (90/88), and SFLN (86/84). These preliminary results are very promising from the point of view of a first exploratory study and suggest that the use of these models could be extended to the high-throughput re-evaluation of connectivity in known complex networks (collation).

Potts-model formulation of the random resistor network

NASA Astrophysics Data System (ADS)

Harris, A. B.; Lubensky, T. C.

1987-05-01

The randomly diluted resistor network is formulated in terms of an n-replicated s-state Potts model with a spin-spin coupling constant J in the limit when first n, then s, and finally 1/J go to zero. This limit is discussed and to leading order in 1/J the generalized susceptibility is shown to reproduce the results of the accompanying paper where the resistor network is treated using the xy model. This Potts Hamiltonian is converted into a field theory by the usual Hubbard-Stratonovich transformation and thereby a renormalization-group treatment is developed to obtain the corrections to the critical exponents to first order in ɛ=6-d, where d is the spatial dimensionality. The recursion relations are shown to be the same as for the xy model. Their detailed analysis (given in the accompanying paper) gives the resistance crossover exponent as φ1=1+ɛ/42, and determines the critical exponent, t for the conductivity of the randomly diluted resistor network at concentrations, p, just above the percolation threshold: t=(d-2)ν+φ1, where ν is the critical exponent for the correlation length at the percolation threshold. These results correct previously accepted results giving φ=1 to all orders in ɛ. The new result for φ1 removes the paradox associated with the numerical result that t>1 for d=2, and also shows that the Alexander-Orbach conjecture, while numerically quite accurate, is not exact, since it disagrees with the ɛ expansion.

Retina vascular network recognition

NASA Astrophysics Data System (ADS)

Tascini, Guido; Passerini, Giorgio; Puliti, Paolo; Zingaretti, Primo

1993-09-01

The analysis of morphological and structural modifications of the retina vascular network is an interesting investigation method in the study of diabetes and hypertension. Normally this analysis is carried out by qualitative evaluations, according to standardized criteria, though medical research attaches great importance to quantitative analysis of vessel color, shape and dimensions. The paper describes a system which automatically segments and recognizes the ocular fundus circulation and micro circulation network, and extracts a set of features related to morphometric aspects of vessels. For this class of images the classical segmentation methods seem weak. We propose a computer vision system in which segmentation and recognition phases are strictly connected. The system is hierarchically organized in four modules. Firstly the Image Enhancement Module (IEM) operates a set of custom image enhancements to remove blur and to prepare data for subsequent segmentation and recognition processes. Secondly the Papilla Border Analysis Module (PBAM) automatically recognizes number, position and local diameter of blood vessels departing from optical papilla. Then the Vessel Tracking Module (VTM) analyses vessels comparing the results of body and edge tracking and detects branches and crossings. Finally the Feature Extraction Module evaluates PBAM and VTM output data and extracts some numerical indexes. Used algorithms appear to be robust and have been successfully tested on various ocular fundus images.

Pore network extraction from pore space images of various porous media systems

NASA Astrophysics Data System (ADS)

Yi, Zhixing; Lin, Mian; Jiang, Wenbin; Zhang, Zhaobin; Li, Haishan; Gao, Jian

2017-04-01

Pore network extraction, which is defined as the transformation from irregular pore space to a simplified network in the form of pores connected by throats, is significant to microstructure analysis and network modeling. A physically realistic pore network is not only a representation of the pore space in the sense of topology and morphology, but also a good tool for predicting transport properties accurately. We present a method to extract pore network by employing the centrally located medial axis to guide the construction of maximal-balls-like skeleton where the pores and throats are defined and parameterized. To validate our method, various rock samples including sand pack, sandstones, and carbonates were used to extract pore networks. The pore structures were compared quantitatively with the structures extracted by medial axis method or maximal ball method. The predicted absolute permeability and formation factor were verified against the theoretical solutions obtained by lattice Boltzmann method and finite volume method, respectively. The two-phase flow was simulated through the networks extracted from homogeneous sandstones, and the generated relative permeability curves were compared with the data obtained from experimental method and other numerical models. The results show that the accuracy of our network is higher than that of other networks for predicting transport properties, so the presented method is more reliable for extracting physically realistic pore network.

An Integrated Solution for Performing Thermo-fluid Conjugate Analysis

NASA Technical Reports Server (NTRS)

Kornberg, Oren

2009-01-01

A method has been developed which integrates a fluid flow analyzer and a thermal analyzer to produce both steady state and transient results of 1-D, 2-D, and 3-D analysis models. The Generalized Fluid System Simulation Program (GFSSP) is a one dimensional, general purpose fluid analysis code which computes pressures and flow distributions in complex fluid networks. The MSC Systems Improved Numerical Differencing Analyzer (MSC.SINDA) is a one dimensional general purpose thermal analyzer that solves network representations of thermal systems. Both GFSSP and MSC.SINDA have graphical user interfaces which are used to build the respective model and prepare it for analysis. The SINDA/GFSSP Conjugate Integrator (SGCI) is a formbase graphical integration program used to set input parameters for the conjugate analyses and run the models. The contents of this paper describes SGCI and its thermo-fluids conjugate analysis techniques and capabilities by presenting results from some example models including the cryogenic chill down of a copper pipe, a bar between two walls in a fluid stream, and a solid plate creating a phase change in a flowing fluid.

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

NASA Astrophysics Data System (ADS)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

Multi-mode clustering model for hierarchical wireless sensor networks

NASA Astrophysics Data System (ADS)

Hu, Xiangdong; Li, Yongfu; Xu, Huifen

2017-03-01

The topology management, i.e., clusters maintenance, of wireless sensor networks (WSNs) is still a challenge due to its numerous nodes, diverse application scenarios and limited resources as well as complex dynamics. To address this issue, a multi-mode clustering model (M2 CM) is proposed to maintain the clusters for hierarchical WSNs in this study. In particular, unlike the traditional time-trigger model based on the whole-network and periodic style, the M2 CM is proposed based on the local and event-trigger operations. In addition, an adaptive local maintenance algorithm is designed for the broken clusters in the WSNs using the spatial-temporal demand changes accordingly. Numerical experiments are performed using the NS2 network simulation platform. Results validate the effectiveness of the proposed model with respect to the network maintenance costs, node energy consumption and transmitted data as well as the network lifetime.

Linking social and pathogen transmission networks using microbial genetics in giraffe (Giraffa camelopardalis).

PubMed

VanderWaal, Kimberly L; Atwill, Edward R; Isbell, Lynne A; McCowan, Brenda

2014-03-01

Although network analysis has drawn considerable attention as a promising tool for disease ecology, empirical research has been hindered by limitations in detecting the occurrence of pathogen transmission (who transmitted to whom) within social networks. Using a novel approach, we utilize the genetics of a diverse microbe, Escherichia coli, to infer where direct or indirect transmission has occurred and use these data to construct transmission networks for a wild giraffe population (Giraffe camelopardalis). Individuals were considered to be a part of the same transmission chain and were interlinked in the transmission network if they shared genetic subtypes of E. coli. By using microbial genetics to quantify who transmits to whom independently from the behavioural data on who is in contact with whom, we were able to directly investigate how the structure of contact networks influences the structure of the transmission network. To distinguish between the effects of social and environmental contact on transmission dynamics, the transmission network was compared with two separate contact networks defined from the behavioural data: a social network based on association patterns, and a spatial network based on patterns of home-range overlap among individuals. We found that links in the transmission network were more likely to occur between individuals that were strongly linked in the social network. Furthermore, individuals that had more numerous connections or that occupied 'bottleneck' positions in the social network tended to occupy similar positions in the transmission network. No similar correlations were observed between the spatial and transmission networks. This indicates that an individual's social network position is predictive of transmission network position, which has implications for identifying individuals that function as super-spreaders or transmission bottlenecks in the population. These results emphasize the importance of association patterns in understanding transmission dynamics, even for environmentally transmitted microbes like E. coli. This study is the first to use microbial genetics to construct and analyse transmission networks in a wildlife population and highlights the potential utility of an approach integrating microbial genetics with network analysis. © 2013 The Authors. Journal of Animal Ecology © 2013 British Ecological Society.

Integrated analysis of genetic, behavioral, and biochemical data implicates neural stem cell-induced changes in immunity, neurotransmission and mitochondrial function in Dementia with Lewy Body mice.

PubMed

Lakatos, Anita; Goldberg, Natalie R S; Blurton-Jones, Mathew

2017-03-10

We previously demonstrated that transplantation of murine neural stem cells (NSCs) can improve motor and cognitive function in a transgenic model of Dementia with Lewy Bodies (DLB). These benefits occurred without changes in human α-synuclein pathology and were mediated in part by stem cell-induced elevation of brain-derived neurotrophic factor (BDNF). However, instrastriatal NSC transplantation likely alters the brain microenvironment via multiple mechanisms that may synergize to promote cognitive and motor recovery. The underlying neurobiology that mediates such restoration no doubt involves numerous genes acting in concert to modulate signaling within and between host brain cells and transplanted NSCs. In order to identify functionally connected gene networks and additional mechanisms that may contribute to stem cell-induced benefits, we performed weighted gene co-expression network analysis (WGCNA) on striatal tissue isolated from NSC- and vehicle-injected wild-type and DLB mice. Combining continuous behavioral and biochemical data with genome wide expression via network analysis proved to be a powerful approach; revealing significant alterations in immune response, neurotransmission, and mitochondria function. Taken together, these data shed further light on the gene network and biological processes that underlie the therapeutic effects of NSC transplantation on α-synuclein induced cognitive and motor impairments, thereby highlighting additional therapeutic targets for synucleinopathies.

Bias in groundwater samples caused by wellbore flow

USGS Publications Warehouse

Reilly, Thomas E.; Franke, O. Lehn; Bennett, Gordon D.

1989-01-01

Proper design of physical installations and sampling procedures for groundwater monitoring networks is critical for the detection and analysis of possible contaminants. Monitoring networks associated with known contaminant sources sometimes include an array of monitoring wells with long well screens. The purpose of this paper is: (a) to report the results of a numerical experiment indicating that significant borehole flow can occur within long well screens installed in homogeneous aquifers with very small head differences in the aquifer (less than 0.01 feet between the top and bottom of the screen); (b) to demonstrate that contaminant monitoring wells with long screens may completely fail to fulfill their purpose in many groundwater environments.

Multiple types of synchronization analysis for discontinuous Cohen-Grossberg neural networks with time-varying delays.

PubMed

Li, Jiarong; Jiang, Haijun; Hu, Cheng; Yu, Zhiyong

2018-03-01

This paper is devoted to the exponential synchronization, finite time synchronization, and fixed-time synchronization of Cohen-Grossberg neural networks (CGNNs) with discontinuous activations and time-varying delays. Discontinuous feedback controller and Novel adaptive feedback controller are designed to realize global exponential synchronization, finite time synchronization and fixed-time synchronization by adjusting the values of the parameters ω in the controller. Furthermore, the settling time of the fixed-time synchronization derived in this paper is less conservative and more accurate. Finally, some numerical examples are provided to show the effectiveness and flexibility of the results derived in this paper. Copyright © 2018 Elsevier Ltd. All rights reserved.

Optimal spatiotemporal representation of multichannel EEG for recognition of brain states associated with distinct visual stimulus

NASA Astrophysics Data System (ADS)

Hramov, Alexander; Musatov, Vyacheslav Yu.; Runnova, Anastasija E.; Efremova, Tatiana Yu.; Koronovskii, Alexey A.; Pisarchik, Alexander N.

2018-04-01

In the paper we propose an approach based on artificial neural networks for recognition of different human brain states associated with distinct visual stimulus. Based on the developed numerical technique and the analysis of obtained experimental multichannel EEG data, we optimize the spatiotemporal representation of multichannel EEG to provide close to 97% accuracy in recognition of the EEG brain states during visual perception. Different interpretations of an ambiguous image produce different oscillatory patterns in the human EEG with similar features for every interpretation. Since these features are inherent to all subjects, a single artificial network can classify with high quality the associated brain states of other subjects.

Parameter estimates in binary black hole collisions using neural networks

NASA Astrophysics Data System (ADS)

Carrillo, M.; Gracia-Linares, M.; González, J. A.; Guzmán, F. S.

2016-10-01

We present an algorithm based on artificial neural networks (ANNs), that estimates the mass ratio in a binary black hole collision out of given gravitational wave (GW) strains. In this analysis, the ANN is trained with a sample of GW signals generated with numerical simulations. The effectiveness of the algorithm is evaluated with GWs generated also with simulations for given mass ratios unknown to the ANN. We measure the accuracy of the algorithm in the interpolation and extrapolation regimes. We present the results for noise free signals and signals contaminated with Gaussian noise, in order to foresee the dependence of the method accuracy in terms of the signal to noise ratio.

Simulation of the mechanical behavior of random fiber networks with different microstructure.

PubMed

Hatami-Marbini, H

2018-05-24

Filamentous protein networks are broadly encountered in biological systems such as cytoskeleton and extracellular matrix. Many numerical studies have been conducted to better understand the fundamental mechanisms behind the striking mechanical properties of these networks. In most of these previous numerical models, the Mikado algorithm has been used to represent the network microstructure. Here, a different algorithm is used to create random fiber networks in order to investigate possible roles of architecture on the elastic behavior of filamentous networks. In particular, random fibrous structures are generated from the growth of individual fibers from random nucleation points. We use computer simulations to determine the mechanical behavior of these networks in terms of their model parameters. The findings are presented and discussed along with the response of Mikado fiber networks. We demonstrate that these alternative networks and Mikado networks show a qualitatively similar response. Nevertheless, the overall elasticity of Mikado networks is stiffer compared to that of the networks created using the alternative algorithm. We describe the effective elasticity of both network types as a function of their line density and of the material properties of the filaments. We also characterize the ratio of bending and axial energy and discuss the behavior of these networks in terms of their fiber density distribution and coordination number.

Environmental Design for a Structured Network Learning Society

ERIC Educational Resources Information Center

Chang, Ben; Cheng, Nien-Heng; Deng, Yi-Chan; Chan, Tak-Wai

2007-01-01

Social interactions profoundly impact the learning processes of learners in traditional societies. The rapid rise of the Internet using population has been the establishment of numerous different styles of network communities. Network societies form when more Internet communities are established, but the basic form of a network society, especially…

Neural Network approach to assess the thermal affected zone around the injection well in a groundwater heat pump system

NASA Astrophysics Data System (ADS)

Lo Russo, Stefano; Taddia, Glenda; Verda, Vittorio

2014-05-01

The common use of well doublets for groundwater-sourced heating or cooling results in a thermal plume of colder or warmer re-injected groundwater known as the Thermal Affected Zone(TAZ). The plumes may be regarded either as a potential anthropogenic geothermal resource or as pollution, depending on downstream aquifer usage. A fundamental aspect in groundwater heat pump (GWHP) plant design is the correct evaluation of the thermally affected zone that develops around the injection well. Temperature anomalies are detected through numerical methods. Crucial elements in the process of thermal impact assessment are the sizes of installations, their position, the heating/cooling load of the building, and the temperature drop/increase imposed on the re-injected water flow. For multiple-well schemes, heterogeneous aquifers, or variable heating and cooling loads, numerical models that simulate groundwater and heat transport are needed. These tools should consider numerous scenarios obtained considering different heating/cooling loads, positions, and operating modes. Computational fluid dynamic (CFD) models are widely used in this field because they offer the opportunity to calculate the time evolution of the thermal plume produced by a heat pump, depending on the characteristics of the subsurface and the heat pump. Nevertheless, these models require large computational efforts, and therefore their use may be limited to a reasonable number of scenarios. Neural networks could represent an alternative to CFD for assessing the TAZ under different scenarios referring to a specific site. The use of neural networks is proposed to determine the time evolution of the groundwater temperature downstream of an installation as a function of the possible utilization profiles of the heat pump. The main advantage of neural network modeling is the possibility of evaluating a large number of scenarios in a very short time, which is very useful for the preliminary analysis of future multiple installations. The neural network is trained using the results from a CFD model (FEFLOW) applied to the installation at Politecnico di Torino (Italy) under several operating conditions.

Suppressing disease spreading by using information diffusion on multiplex networks.

PubMed

Wang, Wei; Liu, Quan-Hui; Cai, Shi-Min; Tang, Ming; Braunstein, Lidia A; Stanley, H Eugene

2016-07-06

Although there is always an interplay between the dynamics of information diffusion and disease spreading, the empirical research on the systemic coevolution mechanisms connecting these two spreading dynamics is still lacking. Here we investigate the coevolution mechanisms and dynamics between information and disease spreading by utilizing real data and a proposed spreading model on multiplex network. Our empirical analysis finds asymmetrical interactions between the information and disease spreading dynamics. Our results obtained from both the theoretical framework and extensive stochastic numerical simulations suggest that an information outbreak can be triggered in a communication network by its own spreading dynamics or by a disease outbreak on a contact network, but that the disease threshold is not affected by information spreading. Our key finding is that there is an optimal information transmission rate that markedly suppresses the disease spreading. We find that the time evolution of the dynamics in the proposed model qualitatively agrees with the real-world spreading processes at the optimal information transmission rate.

Minimum Winfree loop determines self-sustained oscillations in excitable Erdös-Rényi random networks.

PubMed

Qian, Yu; Cui, Xiaohua; Zheng, Zhigang

2017-07-18

The investigation of self-sustained oscillations in excitable complex networks is very important in understanding various activities in brain systems, among which the exploration of the key determinants of oscillations is a challenging task. In this paper, by investigating the influence of system parameters on self-sustained oscillations in excitable Erdös-Rényi random networks (EERRNs), the minimum Winfree loop (MWL) is revealed to be the key factor in determining the emergence of collective oscillations. Specifically, the one-to-one correspondence between the optimal connection probability (OCP) and the MWL length is exposed. Moreover, many important quantities such as the lower critical connection probability (LCCP), the OCP, and the upper critical connection probability (UCCP) are determined by the MWL. Most importantly, they can be approximately predicted by the network structure analysis, which have been verified in numerical simulations. Our results will be of great importance to help us in understanding the key factors in determining persistent activities in biological systems.

Neural networks with excitatory and inhibitory components: Direct and inverse problems by a mean-field approach

NASA Astrophysics Data System (ADS)

di Volo, Matteo; Burioni, Raffaella; Casartelli, Mario; Livi, Roberto; Vezzani, Alessandro

2016-01-01

We study the dynamics of networks with inhibitory and excitatory leak-integrate-and-fire neurons with short-term synaptic plasticity in the presence of depressive and facilitating mechanisms. The dynamics is analyzed by a heterogeneous mean-field approximation, which allows us to keep track of the effects of structural disorder in the network. We describe the complex behavior of different classes of excitatory and inhibitory components, which give rise to a rich dynamical phase diagram as a function of the fraction of inhibitory neurons. Using the same mean-field approach, we study and solve a global inverse problem: reconstructing the degree probability distributions of the inhibitory and excitatory components and the fraction of inhibitory neurons from the knowledge of the average synaptic activity field. This approach unveils new perspectives on the numerical study of neural network dynamics and the possibility of using these models as a test bed for the analysis of experimental data.

Optimal satisfaction degree in energy harvesting cognitive radio networks

NASA Astrophysics Data System (ADS)

Li, Zan; Liu, Bo-Yang; Si, Jiang-Bo; Zhou, Fu-Hui

2015-12-01

A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the Doctorial Programs Foundation of the Ministry of Education of China (Grant No. 20110203110011), and the 111 Project (Grant No. B08038).

Robustness analysis of uncertain dynamical neural networks with multiple time delays.

PubMed

Senan, Sibel

2015-10-01

This paper studies the problem of global robust asymptotic stability of the equilibrium point for the class of dynamical neural networks with multiple time delays with respect to the class of slope-bounded activation functions and in the presence of the uncertainties of system parameters of the considered neural network model. By using an appropriate Lyapunov functional and exploiting the properties of the homeomorphism mapping theorem, we derive a new sufficient condition for the existence, uniqueness and global robust asymptotic stability of the equilibrium point for the class of neural networks with multiple time delays. The obtained stability condition basically relies on testing some relationships imposed on the interconnection matrices of the neural system, which can be easily verified by using some certain properties of matrices. An instructive numerical example is also given to illustrate the applicability of our result and show the advantages of this new condition over the previously reported corresponding results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Using smart mobile devices in social-network-based health education practice: a learning behavior analysis.

PubMed

Wu, Ting-Ting

2014-06-01

Virtual communities provide numerous resources, immediate feedback, and information sharing, enabling people to rapidly acquire information and knowledge and supporting diverse applications that facilitate interpersonal interactions, communication, and sharing. Moreover, incorporating highly mobile and convenient devices into practice-based courses can be advantageous in learning situations. Therefore, in this study, a tablet PC and Google+ were introduced to a health education practice course to elucidate satisfaction of learning module and conditions and analyze the sequence and frequency of learning behaviors during the social-network-based learning process. According to the analytical results, social networks can improve interaction among peers and between educators and students, particularly when these networks are used to search for data, post articles, engage in discussions, and communicate. In addition, most nursing students and nursing educators expressed a positive attitude and satisfaction toward these innovative teaching methods, and looked forward to continuing the use of this learning approach. Copyright © 2014 Elsevier Ltd. All rights reserved.

Burstiness and tie activation strategies in time-varying social networks

NASA Astrophysics Data System (ADS)

Ubaldi, Enrico; Vezzani, Alessandro; Karsai, Márton; Perra, Nicola; Burioni, Raffaella

2017-04-01

The recent developments in the field of social networks shifted the focus from static to dynamical representations, calling for new methods for their analysis and modelling. Observations in real social systems identified two main mechanisms that play a primary role in networks’ evolution and influence ongoing spreading processes: the strategies individuals adopt when selecting between new or old social ties, and the bursty nature of the social activity setting the pace of these choices. We introduce a time-varying network model accounting both for ties selection and burstiness and we analytically study its phase diagram. The interplay of the two effects is non trivial and, interestingly, the effects of burstiness might be suppressed in regimes where individuals exhibit a strong preference towards previously activated ties. The results are tested against numerical simulations and compared with two empirical datasets with very good agreement. Consequently, the framework provides a principled method to classify the temporal features of real networks, and thus yields new insights to elucidate the effects of social dynamics on spreading processes.

Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy

NASA Astrophysics Data System (ADS)

Shi, Chenguang; Salous, Sana; Wang, Fei; Zhou, Jianjiang

2017-08-01

Distributed radar network systems have been shown to have many unique features. Due to their advantage of signal and spatial diversities, radar networks are attractive for target detection. In practice, the netted radars in radar networks are supposed to maximize their transmit power to achieve better detection performance, which may be in contradiction with low probability of intercept (LPI). Therefore, this paper investigates the problem of adaptive power allocation for radar networks in a cooperative game-theoretic framework such that the LPI performance can be improved. Taking into consideration both the transmit power constraints and the minimum signal to interference plus noise ratio (SINR) requirement of each radar, a cooperative Nash bargaining power allocation game based on LPI is formulated, whose objective is to minimize the total transmit power by optimizing the power allocation in radar networks. First, a novel SINR-based network utility function is defined and utilized as a metric to evaluate power allocation. Then, with the well-designed network utility function, the existence and uniqueness of the Nash bargaining solution are proved analytically. Finally, an iterative Nash bargaining algorithm is developed that converges quickly to a Pareto optimal equilibrium for the cooperative game. Numerical simulations and theoretic analysis are provided to evaluate the effectiveness of the proposed algorithm.

Topological Principles of Control in Dynamical Networks

NASA Astrophysics Data System (ADS)

Kim, Jason; Pasqualetti, Fabio; Bassett, Danielle

Networked biological systems, such as the brain, feature complex patterns of interactions. To predict and correct the dynamic behavior of such systems, it is imperative to understand how the underlying topological structure affects and limits the function of the system. Here, we use network control theory to extract topological features that favor or prevent network controllability, and to understand the network-wide effect of external stimuli on large-scale brain systems. Specifically, we treat each brain region as a dynamic entity with real-valued state, and model the time evolution of all interconnected regions using linear, time-invariant dynamics. We propose a simplified feed-forward scheme where the effect of upstream regions (drivers) on the connected downstream regions (non-drivers) is characterized in closed-form. Leveraging this characterization of the simplified model, we derive topological features that predict the controllability properties of non-simplified networks. We show analytically and numerically that these predictors are accurate across a large range of parameters. Among other contributions, our analysis shows that heterogeneity in the network weights facilitate controllability, and allows us to implement targeted interventions that profoundly improve controllability. By assuming an underlying dynamical mechanism, we are able to understand the complex topology of networked biological systems in a functionally meaningful way.

Numerical methods for solving moment equations in kinetic theory of neuronal network dynamics

NASA Astrophysics Data System (ADS)

Rangan, Aaditya V.; Cai, David; Tao, Louis

2007-02-01

Recently developed kinetic theory and related closures for neuronal network dynamics have been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The moment equations arising from the kinetic theory are a system of (1 + 1)-dimensional nonlinear partial differential equations (PDE) on a bounded domain with nonlinear boundary conditions. The PDEs themselves are self-consistently specified by parameters which are functions of the boundary values of the solution. The moment equations can be stiff in space and time. Numerical methods are presented here for efficiently and accurately solving these moment equations. The essential ingredients in our numerical methods include: (i) the system is discretized in time with an implicit Euler method within a spectral deferred correction framework, therefore, the PDEs of the kinetic theory are reduced to a sequence, in time, of boundary value problems (BVPs) with nonlinear boundary conditions; (ii) a set of auxiliary parameters is introduced to recast the original BVP with nonlinear boundary conditions as BVPs with linear boundary conditions - with additional algebraic constraints on the auxiliary parameters; (iii) a careful combination of two Newton's iterates for the nonlinear BVP with linear boundary condition, interlaced with a Newton's iterate for solving the associated algebraic constraints is constructed to achieve quadratic convergence for obtaining the solutions with self-consistent parameters. It is shown that a simple fixed-point iteration can only achieve a linear convergence for the self-consistent parameters. The practicability and efficiency of our numerical methods for solving the moment equations of the kinetic theory are illustrated with numerical examples. It is further demonstrated that the moment equations derived from the kinetic theory of neuronal network dynamics can very well capture the coarse-grained dynamical properties of integrate-and-fire neuronal networks.

Human neural stem cell-derived cultures in three-dimensional substrates form spontaneously functional neuronal networks.

PubMed

Smith, Imogen; Silveirinha, Vasco; Stein, Jason L; de la Torre-Ubieta, Luis; Farrimond, Jonathan A; Williamson, Elizabeth M; Whalley, Benjamin J

2017-04-01

Differentiated human neural stem cells were cultured in an inert three-dimensional (3D) scaffold and, unlike two-dimensional (2D) but otherwise comparable monolayer cultures, formed spontaneously active, functional neuronal networks that responded reproducibly and predictably to conventional pharmacological treatments to reveal functional, glutamatergic synapses. Immunocytochemical and electron microscopy analysis revealed a neuronal and glial population, where markers of neuronal maturity were observed in the former. Oligonucleotide microarray analysis revealed substantial differences in gene expression conferred by culturing in a 3D vs a 2D environment. Notable and numerous differences were seen in genes coding for neuronal function, the extracellular matrix and cytoskeleton. In addition to producing functional networks, differentiated human neural stem cells grown in inert scaffolds offer several significant advantages over conventional 2D monolayers. These advantages include cost savings and improved physiological relevance, which make them better suited for use in the pharmacological and toxicological assays required for development of stem cell-based treatments and the reduction of animal use in medical research. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

Processing Pathways in Mental Arithmetic—Evidence from Probabilistic Fiber Tracking

PubMed Central

Glauche, Volkmar; Weiller, Cornelius; Willmes, Klaus

2013-01-01

Numerical cognition is a case of multi-modular and distributed cerebral processing. So far neither the anatomo-functional connections between the cortex areas involved nor their integration into established frameworks such as the differentiation between dorsal and ventral processing streams have been specified. The current study addressed this issue combining a re-analysis of previously published fMRI data with probabilistic fiber tracking data from an independent sample. We aimed at differentiating neural correlates and connectivity for relatively easy and more difficult addition problems in healthy adults and their association with either rather verbally mediated fact retrieval or magnitude manipulations, respectively. The present data suggest that magnitude- and fact retrieval-related processing seem to be subserved by two largely separate networks, both of them comprising dorsal and ventral connections. Importantly, these networks not only differ in localization of activation but also in the connections between the cortical areas involved. However, it has to be noted that even though seemingly distinct anatomically, these networks operate as a functionally integrated circuit for mental calculation as revealed by a parametric analysis of brain activation. PMID:23383194

Performance Analysis of Physical Layer Security of Opportunistic Scheduling in Multiuser Multirelay Cooperative Networks

PubMed Central

Shim, Kyusung; Do, Nhu Tri; An, Beongku

2017-01-01

In this paper, we study the physical layer security (PLS) of opportunistic scheduling for uplink scenarios of multiuser multirelay cooperative networks. To this end, we propose a low-complexity, yet comparable secrecy performance source relay selection scheme, called the proposed source relay selection (PSRS) scheme. Specifically, the PSRS scheme first selects the least vulnerable source and then selects the relay that maximizes the system secrecy capacity for the given selected source. Additionally, the maximal ratio combining (MRC) technique and the selection combining (SC) technique are considered at the eavesdropper, respectively. Investigating the system performance in terms of secrecy outage probability (SOP), closed-form expressions of the SOP are derived. The developed analysis is corroborated through Monte Carlo simulation. Numerical results show that the PSRS scheme significantly improves the secure ability of the system compared to that of the random source relay selection scheme, but does not outperform the optimal joint source relay selection (OJSRS) scheme. However, the PSRS scheme drastically reduces the required amount of channel state information (CSI) estimations compared to that required by the OJSRS scheme, specially in dense cooperative networks. PMID:28212286

Long distance seawater intrusion through a karst conduit network in the Woodville Karst Plain, Florida

NASA Astrophysics Data System (ADS)

Xu, Zexuan; Bassett, Seth Willis; Hu, Bill; Dyer, Scott Barrett

2016-08-01

Five periods of increased electrical conductivity have been found in the karst conduits supplying one of the largest first magnitude springs in Florida with water. Numerous well-developed conduit networks are distributed in the Woodville Karst Plain (WKP), Florida and connected to the Gulf of Mexico. A composite analysis of precipitation and electrical conductivity data provides strong evidence that the increases in conductivity are directly tied to seawater intrusion moving inland and traveling 11 miles against the prevailing regional hydraulic gradient from from Spring Creek Spring Complex (SCSC), a group of submarine springs at the Gulf Coast. A geochemical analysis of samples from the spring vent rules out anthropogenic contamination and upwelling regional recharge from the deep aquifer as sources of the rising conductivity. The interpretation is supported by the conceptual model established by prior researchers working to characterize the study area. This paper documents the first and longest case of seawater intrusion in the WKP, and also indicates significant possibility of seawater contamination through subsurface conduit networks in a coastal karst aquifer.

Field observations of extended seawater intrusion through subsurface karst conduit networks at Wakulla Spring in the Woodville Karst Plain, Florida

NASA Astrophysics Data System (ADS)

Xu, Z.; Bassett, S.; Hu, B. X.; Dyer, S.

2016-12-01

Five periods of increased electrical conductivity have been found in the karst conduits supplying one of the largest first magnitude springs in Florida with water. Numerous well-developed conduit networks are distributed in the Woodville Karst Plain (WKP), Florida and connected to the Gulf of Mexico. A composite analysis of precipitation and electric conductivity data provides strong evidence that the increases in conductivity are directly tied to seawater intrusion moving inland and traveling 14 miles against the prevailing regional hydraulic gradient from from Spring Creek Spring Complex (SCSC), a group of submarine springs at the Gulf Coast. A geochemical analysis of samples from the spring vent rules out anthropogenic contamination and upwelling regional recharge from the deep aquifer as sources of the rising conductivity. The interpretation is supported by the conceptual model established by prior researchers working to characterize the study area. This abstract documented the first and longest case of seawater intrusion in the WKP, and also indicates significant possibility of seawater contamination through subsurface conduit networks in a coastal karst aquifer.

Long distance seawater intrusion through a karst conduit network in the Woodville Karst Plain, Florida.

PubMed

Xu, Zexuan; Bassett, Seth Willis; Hu, Bill; Dyer, Scott Barrett

2016-08-25

Five periods of increased electrical conductivity have been found in the karst conduits supplying one of the largest first magnitude springs in Florida with water. Numerous well-developed conduit networks are distributed in the Woodville Karst Plain (WKP), Florida and connected to the Gulf of Mexico. A composite analysis of precipitation and electrical conductivity data provides strong evidence that the increases in conductivity are directly tied to seawater intrusion moving inland and traveling 11 miles against the prevailing regional hydraulic gradient from from Spring Creek Spring Complex (SCSC), a group of submarine springs at the Gulf Coast. A geochemical analysis of samples from the spring vent rules out anthropogenic contamination and upwelling regional recharge from the deep aquifer as sources of the rising conductivity. The interpretation is supported by the conceptual model established by prior researchers working to characterize the study area. This paper documents the first and longest case of seawater intrusion in the WKP, and also indicates significant possibility of seawater contamination through subsurface conduit networks in a coastal karst aquifer.

Long distance seawater intrusion through a karst conduit network in the Woodville Karst Plain, Florida

PubMed Central

Xu, Zexuan; Bassett, Seth Willis; Hu, Bill; Dyer, Scott Barrett

2016-01-01

Five periods of increased electrical conductivity have been found in the karst conduits supplying one of the largest first magnitude springs in Florida with water. Numerous well-developed conduit networks are distributed in the Woodville Karst Plain (WKP), Florida and connected to the Gulf of Mexico. A composite analysis of precipitation and electrical conductivity data provides strong evidence that the increases in conductivity are directly tied to seawater intrusion moving inland and traveling 11 miles against the prevailing regional hydraulic gradient from from Spring Creek Spring Complex (SCSC), a group of submarine springs at the Gulf Coast. A geochemical analysis of samples from the spring vent rules out anthropogenic contamination and upwelling regional recharge from the deep aquifer as sources of the rising conductivity. The interpretation is supported by the conceptual model established by prior researchers working to characterize the study area. This paper documents the first and longest case of seawater intrusion in the WKP, and also indicates significant possibility of seawater contamination through subsurface conduit networks in a coastal karst aquifer. PMID:27557803

Energy-efficient sensing in wireless sensor networks using compressed sensing.

PubMed

Razzaque, Mohammad Abdur; Dobson, Simon

2014-02-12

Sensing of the application environment is the main purpose of a wireless sensor network. Most existing energy management strategies and compression techniques assume that the sensing operation consumes significantly less energy than radio transmission and reception. This assumption does not hold in a number of practical applications. Sensing energy consumption in these applications may be comparable to, or even greater than, that of the radio. In this work, we support this claim by a quantitative analysis of the main operational energy costs of popular sensors, radios and sensor motes. In light of the importance of sensing level energy costs, especially for power hungry sensors, we consider compressed sensing and distributed compressed sensing as potential approaches to provide energy efficient sensing in wireless sensor networks. Numerical experiments investigating the effectiveness of compressed sensing and distributed compressed sensing using real datasets show their potential for efficient utilization of sensing and overall energy costs in wireless sensor networks. It is shown that, for some applications, compressed sensing and distributed compressed sensing can provide greater energy efficiency than transform coding and model-based adaptive sensing in wireless sensor networks.

Self-organization in multilayer network with adaptation mechanisms based on competition

NASA Astrophysics Data System (ADS)

Pitsik, Elena N.; Makarov, Vladimir V.; Nedaivozov, Vladimir O.; Kirsanov, Daniil V.; Goremyko, Mikhail V.

2018-04-01

The paper considers the phenomena of competition in multiplex network whose structure evolves corresponding to dynamics of it's elements, forming closed loop of self-learning with the aim to reach the optimal topology. Numerical analysis of proposed model shows that it is possible to obtain scale-invariant structures for corresponding parameters as well as the structures with homogeneous distribution of connections in the layers. Revealed phenomena emerges as the consequence of the self-organization processes related to structure-dynamical selflearning based on homeostasis and homophily, as well as the result of the competition between the network's layers for optimal topology. It was shown that in the mode of partial and cluster synchronization the network reaches scale-free topology of complex nature that is different from layer to layer. However, in the mode of global synchronization the homogeneous topologies on all layer of the network are observed. This phenomenon is tightly connected with the competitive processes that represent themselves as the natural mechanism of reaching the optimal topology of the links in variety of real-world systems.

Generalized activity equations for spiking neural network dynamics.

PubMed

Buice, Michael A; Chow, Carson C

2013-01-01

Much progress has been made in uncovering the computational capabilities of spiking neural networks. However, spiking neurons will always be more expensive to simulate compared to rate neurons because of the inherent disparity in time scales-the spike duration time is much shorter than the inter-spike time, which is much shorter than any learning time scale. In numerical analysis, this is a classic stiff problem. Spiking neurons are also much more difficult to study analytically. One possible approach to making spiking networks more tractable is to augment mean field activity models with some information about spiking correlations. For example, such a generalized activity model could carry information about spiking rates and correlations between spikes self-consistently. Here, we will show how this can be accomplished by constructing a complete formal probabilistic description of the network and then expanding around a small parameter such as the inverse of the number of neurons in the network. The mean field theory of the system gives a rate-like description. The first order terms in the perturbation expansion keep track of covariances.

Characterizing granular networks using topological metrics

NASA Astrophysics Data System (ADS)

Dijksman, Joshua A.; Kovalcinova, Lenka; Ren, Jie; Behringer, Robert P.; Kramar, Miroslav; Mischaikow, Konstantin; Kondic, Lou

2018-04-01

We carry out a direct comparison of experimental and numerical realizations of the exact same granular system as it undergoes shear jamming. We adjust the numerical methods used to optimally represent the experimental settings and outcomes up to microscopic contact force dynamics. Measures presented here range from microscopic through mesoscopic to systemwide characteristics of the system. Topological properties of the mesoscopic force networks provide a key link between microscales and macroscales. We report two main findings: (1) The number of particles in the packing that have at least two contacts is a good predictor for the mechanical state of the system, regardless of strain history and packing density. All measures explored in both experiments and numerics, including stress-tensor-derived measures and contact numbers depend in a universal manner on the fraction of nonrattler particles, fNR. (2) The force network topology also tends to show this universality, yet the shape of the master curve depends much more on the details of the numerical simulations. In particular we show that adding force noise to the numerical data set can significantly alter the topological features in the data. We conclude that both fNR and topological metrics are useful measures to consider when quantifying the state of a granular system.

Brain MRI analysis for Alzheimer's disease diagnosis using an ensemble system of deep convolutional neural networks.

PubMed

Islam, Jyoti; Zhang, Yanqing

2018-05-31

Alzheimer's disease is an incurable, progressive neurological brain disorder. Earlier detection of Alzheimer's disease can help with proper treatment and prevent brain tissue damage. Several statistical and machine learning models have been exploited by researchers for Alzheimer's disease diagnosis. Analyzing magnetic resonance imaging (MRI) is a common practice for Alzheimer's disease diagnosis in clinical research. Detection of Alzheimer's disease is exacting due to the similarity in Alzheimer's disease MRI data and standard healthy MRI data of older people. Recently, advanced deep learning techniques have successfully demonstrated human-level performance in numerous fields including medical image analysis. We propose a deep convolutional neural network for Alzheimer's disease diagnosis using brain MRI data analysis. While most of the existing approaches perform binary classification, our model can identify different stages of Alzheimer's disease and obtains superior performance for early-stage diagnosis. We conducted ample experiments to demonstrate that our proposed model outperformed comparative baselines on the Open Access Series of Imaging Studies dataset.

User's Manual: Thermal Radiation Analysis System TRASYS 2

NASA Technical Reports Server (NTRS)

Jensen, C. L.

1981-01-01

A digital computer software system with generalized capability to solve the radiation related aspects of thermal analysis problems is presented. When used in conjunction with a generalized thermal analysis program such as the systems improved numerical differencing analyzer program, any thermal problem that can be expressed in terms of a lumped parameter R-C thermal network can be solved. The function of TRASYS is twofold. It provides: (a) Internode radiation interchange data; and (b) Incident and absorbed heat rate data from environmental radiant heat sources. Data of both types is provided in a format directly usable by the thermal analyzer programs. The system allows the user to write his own executive or driver program which organizes and directs the program library routines toward solution of each specific problem in the most expeditious manner. The user also may write his own output routines, thus the system data output can directly interface with any thermal analyzer using the R-C network concept.

Modelling Framework and the Quantitative Analysis of Distributed Energy Resources in Future Distribution Networks

NASA Astrophysics Data System (ADS)

Han, Xue; Sandels, Claes; Zhu, Kun; Nordström, Lars

2013-08-01

There has been a large body of statements claiming that the large-scale deployment of Distributed Energy Resources (DERs) could eventually reshape the future distribution grid operation in numerous ways. Thus, it is necessary to introduce a framework to measure to what extent the power system operation will be changed by various parameters of DERs. This article proposed a modelling framework for an overview analysis on the correlation between DERs. Furthermore, to validate the framework, the authors described the reference models of different categories of DERs with their unique characteristics, comprising distributed generation, active demand and electric vehicles. Subsequently, quantitative analysis was made on the basis of the current and envisioned DER deployment scenarios proposed for Sweden. Simulations are performed in two typical distribution network models for four seasons. The simulation results show that in general the DER deployment brings in the possibilities to reduce the power losses and voltage drops by compensating power from the local generation and optimizing the local load profiles.

Satellite Sounder Data Assimilation for Improving Alaska Region Weather Forecast

NASA Technical Reports Server (NTRS)

Zhu, Jiang; Stevens, E.; Zavodsky, B. T.; Zhang, X.; Heinrichs, T.; Broderson, D.

2014-01-01

Data assimilation has been demonstrated very useful in improving both global and regional numerical weather prediction. Alaska has very coarser surface observation sites. On the other hand, it gets much more satellite overpass than lower 48 states. How to utilize satellite data to improve numerical prediction is one of hot topics among weather forecast community in Alaska. The Geographic Information Network of Alaska (GINA) at University of Alaska is conducting study on satellite data assimilation for WRF model. AIRS/CRIS sounder profile data are used to assimilate the initial condition for the customized regional WRF model (GINA-WRF model). Normalized standard deviation, RMSE, and correlation statistic analysis methods are applied to analyze one case of 48 hours forecasts and one month of 24-hour forecasts in order to evaluate the improvement of regional numerical model from Data assimilation. The final goal of the research is to provide improved real-time short-time forecast for Alaska regions.

Age-related increase in brain activity during task-related and -negative networks and numerical inductive reasoning.

PubMed

Sun, Li; Liang, Peipeng; Jia, Xiuqin; Qi, Zhigang; Li, Kuncheng

2014-01-01

Recent neuroimaging studies have shown that elderly adults exhibit increased and decreased activation on various cognitive tasks, yet little is known about age-related changes in inductive reasoning. To investigate the neural basis for the aging effect on inductive reasoning, 15 young and 15 elderly subjects performed numerical inductive reasoning while in a magnetic resonance (MR) scanner. Functional magnetic resonance imaging (fMRI) analysis revealed that numerical inductive reasoning, relative to rest, yielded multiple frontal, temporal, parietal, and some subcortical area activations for both age groups. In addition, the younger participants showed significant regions of task-induced deactivation, while no deactivation occurred in the elderly adults. Direct group comparisons showed that elderly adults exhibited greater activity in regions of task-related activation and areas showing task-induced deactivation (TID) in the younger group. Our findings suggest an age-related deficiency in neural function and resource allocation during inductive reasoning.

A network thermodynamic method for numerical solution of the Nernst-Planck and Poisson equation system with application to ionic transport through membranes.

PubMed

Horno, J; González-Caballero, F; González-Fernández, C F

1990-01-01

Simple techniques of network thermodynamics are used to obtain the numerical solution of the Nernst-Planck and Poisson equation system. A network model for a particular physical situation, namely ionic transport through a thin membrane with simultaneous diffusion, convection and electric current, is proposed. Concentration and electric field profiles across the membrane, as well as diffusion potential, have been simulated using the electric circuit simulation program, SPICE. The method is quite general and extremely efficient, permitting treatments of multi-ion systems whatever the boundary and experimental conditions may be.

Supercomputing '91; Proceedings of the 4th Annual Conference on High Performance Computing, Albuquerque, NM, Nov. 18-22, 1991

NASA Technical Reports Server (NTRS)

1991-01-01

Various papers on supercomputing are presented. The general topics addressed include: program analysis/data dependence, memory access, distributed memory code generation, numerical algorithms, supercomputer benchmarks, latency tolerance, parallel programming, applications, processor design, networks, performance tools, mapping and scheduling, characterization affecting performance, parallelism packaging, computing climate change, combinatorial algorithms, hardware and software performance issues, system issues. (No individual items are abstracted in this volume)

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

PubMed Central

Bosbach, Wolfram A.

2015-01-01

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

Impact of Bounded Noise and Rewiring on the Formation and Instability of Spiral Waves in a Small-World Network of Hodgkin-Huxley Neurons.

PubMed

Yao, Yuangen; Deng, Haiyou; Ma, Chengzhang; Yi, Ming; Ma, Jun

2017-01-01

Spiral waves are observed in the chemical, physical and biological systems, and the emergence of spiral waves in cardiac tissue is linked to some diseases such as heart ventricular fibrillation and epilepsy; thus it has importance in theoretical studies and potential medical applications. Noise is inevitable in neuronal systems and can change the electrical activities of neuron in different ways. Many previous theoretical studies about the impacts of noise on spiral waves focus an unbounded Gaussian noise and even colored noise. In this paper, the impacts of bounded noise and rewiring of network on the formation and instability of spiral waves are discussed in small-world (SW) network of Hodgkin-Huxley (HH) neurons through numerical simulations, and possible statistical analysis will be carried out. Firstly, we present SW network of HH neurons subjected to bounded noise. Then, it is numerically demonstrated that bounded noise with proper intensity σ, amplitude A, or frequency f can facilitate the formation of spiral waves when rewiring probability p is below certain thresholds. In other words, bounded noise-induced resonant behavior can occur in the SW network of neurons. In addition, rewiring probability p always impairs spiral waves, while spiral waves are confirmed to be robust for small p, thus shortcut-induced phase transition of spiral wave with the increase of p is induced. Furthermore, statistical factors of synchronization are calculated to discern the phase transition of spatial pattern, and it is confirmed that larger factor of synchronization is approached with increasing of rewiring probability p, and the stability of spiral wave is destroyed.

Fast numerical methods for simulating large-scale integrate-and-fire neuronal networks.

PubMed

Rangan, Aaditya V; Cai, David

2007-02-01

We discuss numerical methods for simulating large-scale, integrate-and-fire (I&F) neuronal networks. Important elements in our numerical methods are (i) a neurophysiologically inspired integrating factor which casts the solution as a numerically tractable integral equation, and allows us to obtain stable and accurate individual neuronal trajectories (i.e., voltage and conductance time-courses) even when the I&F neuronal equations are stiff, such as in strongly fluctuating, high-conductance states; (ii) an iterated process of spike-spike corrections within groups of strongly coupled neurons to account for spike-spike interactions within a single large numerical time-step; and (iii) a clustering procedure of firing events in the network to take advantage of localized architectures, such as spatial scales of strong local interactions, which are often present in large-scale computational models-for example, those of the primary visual cortex. (We note that the spike-spike corrections in our methods are more involved than the correction of single neuron spike-time via a polynomial interpolation as in the modified Runge-Kutta methods commonly used in simulations of I&F neuronal networks.) Our methods can evolve networks with relatively strong local interactions in an asymptotically optimal way such that each neuron fires approximately once in [Formula: see text] operations, where N is the number of neurons in the system. We note that quantifications used in computational modeling are often statistical, since measurements in a real experiment to characterize physiological systems are typically statistical, such as firing rate, interspike interval distributions, and spike-triggered voltage distributions. We emphasize that it takes much less computational effort to resolve statistical properties of certain I&F neuronal networks than to fully resolve trajectories of each and every neuron within the system. For networks operating in realistic dynamical regimes, such as strongly fluctuating, high-conductance states, our methods are designed to achieve statistical accuracy when very large time-steps are used. Moreover, our methods can also achieve trajectory-wise accuracy when small time-steps are used.

Time irreversibility and intrinsics revealing of series with complex network approach

NASA Astrophysics Data System (ADS)

Xiong, Hui; Shang, Pengjian; Xia, Jianan; Wang, Jing

2018-06-01

In this work, we analyze time series on the basis of the visibility graph algorithm that maps the original series into a graph. By taking into account the all-round information carried by the signals, the time irreversibility and fractal behavior of series are evaluated from a complex network perspective, and considered signals are further classified from different aspects. The reliability of the proposed analysis is supported by numerical simulations on synthesized uncorrelated random noise, short-term correlated chaotic systems and long-term correlated fractal processes, and by the empirical analysis on daily closing prices of eleven worldwide stock indices. Obtained results suggest that finite size has a significant effect on the evaluation, and that there might be no direct relation between the time irreversibility and long-range correlation of series. Similarity and dissimilarity between stock indices are also indicated from respective regional and global perspectives, showing the existence of multiple features of underlying systems.

SICR rumor spreading model in complex networks: Counterattack and self-resistance

NASA Astrophysics Data System (ADS)

Zan, Yongli; Wu, Jianliang; Li, Ping; Yu, Qinglin

2014-07-01

Rumor is an important form of social interaction. However, spreading of harmful rumors could have a significant negative impact on the well-being of the society. In this paper, considering the counterattack mechanism of the rumor spreading, we introduce two new models: Susceptible-Infective-Counterattack-Refractory (SICR) model and adjusted-SICR model. We then derive mean-field equations to describe their dynamics in homogeneous networks and conduct the steady-state analysis. We also introduce the self-resistance parameter τ, and study the influence of this parameter on rumor spreading. Numerical simulations are performed to compare the SICR model with the SIR model and the adjusted-SICR model, respectively, and we investigate the spreading peak of the rumor and the final size of the rumor with various parameters. Simulation results are congruent exactly with the theoretical analysis. The experiment reveals some interesting patterns of rumor spreading involved with counterattack force.

Stability analysis of neural networks with time-varying delay: Enhanced stability criteria and conservatism comparisons

NASA Astrophysics Data System (ADS)

Lin, Wen-Juan; He, Yong; Zhang, Chuan-Ke; Wu, Min

2018-01-01

This paper is concerned with the stability analysis of neural networks with a time-varying delay. To assess system stability accurately, the conservatism reduction of stability criteria has attracted many efforts, among which estimating integral terms as exact as possible is a key issue. At first, this paper develops a new relaxed integral inequality to reduce the estimation gap of popular Wirtinger-based inequality (WBI). Then, for showing the advantages of the proposed inequality over several existing inequalities that also improve the WBI, four stability criteria are derived through different inequalities and the same Lyapunov-Krasovskii functional (LKF), and the conservatism comparison of them is analyzed theoretically. Moreover, an improved criterion is established by combining the proposed inequality and an augmented LKF with delay-product-type terms. Finally, several numerical examples are used to demonstrate the advantages of the proposed method.

Associative memory in an analog iterated-map neural network

NASA Astrophysics Data System (ADS)

Marcus, C. M.; Waugh, F. R.; Westervelt, R. M.

1990-03-01

The behavior of an analog neural network with parallel dynamics is studied analytically and numerically for two associative-memory learning algorithms, the Hebb rule and the pseudoinverse rule. Phase diagrams in the parameter space of analog gain β and storage ratio α are presented. For both learning rules, the networks have large ``recall'' phases in which retrieval states exist and convergence to a fixed point is guaranteed by a global stability criterion. We also demonstrate numerically that using a reduced analog gain increases the probability of recall starting from a random initial state. This phenomenon is comparable to thermal annealing used to escape local minima but has the advantage of being deterministic, and therefore easily implemented in electronic hardware. Similarities and differences between analog neural networks and networks with two-state neurons at finite temperature are also discussed.

Optimal Information Processing in Biochemical Networks

NASA Astrophysics Data System (ADS)

Wiggins, Chris

2012-02-01

A variety of experimental results over the past decades provide examples of near-optimal information processing in biological networks, including in biochemical and transcriptional regulatory networks. Computing information-theoretic quantities requires first choosing or computing the joint probability distribution describing multiple nodes in such a network --- for example, representing the probability distribution of finding an integer copy number of each of two interacting reactants or gene products while respecting the `intrinsic' small copy number noise constraining information transmission at the scale of the cell. I'll given an overview of some recent analytic and numerical work facilitating calculation of such joint distributions and the associated information, which in turn makes possible numerical optimization of information flow in models of noisy regulatory and biochemical networks. Illustrating cases include quantification of form-function relations, ideal design of regulatory cascades, and response to oscillatory driving.

An improved approximate network blocking probability model for all-optical WDM Networks with heterogeneous link capacities

NASA Astrophysics Data System (ADS)

Khan, Akhtar Nawaz

2017-11-01

Currently, analytical models are used to compute approximate blocking probabilities in opaque and all-optical WDM networks with the homogeneous link capacities. Existing analytical models can also be extended to opaque WDM networking with heterogeneous link capacities due to the wavelength conversion at each switch node. However, existing analytical models cannot be utilized for all-optical WDM networking with heterogeneous structure of link capacities due to the wavelength continuity constraint and unequal numbers of wavelength channels on different links. In this work, a mathematical model is extended for computing approximate network blocking probabilities in heterogeneous all-optical WDM networks in which the path blocking is dominated by the link along the path with fewer number of wavelength channels. A wavelength assignment scheme is also proposed for dynamic traffic, termed as last-fit-first wavelength assignment, in which a wavelength channel with maximum index is assigned first to a lightpath request. Due to heterogeneous structure of link capacities and the wavelength continuity constraint, the wavelength channels with maximum indexes are utilized for minimum hop routes. Similarly, the wavelength channels with minimum indexes are utilized for multi-hop routes between source and destination pairs. The proposed scheme has lower blocking probability values compared to the existing heuristic for wavelength assignments. Finally, numerical results are computed in different network scenarios which are approximately equal to values obtained from simulations. Since January 2016, he is serving as Head of Department and an Assistant Professor in the Department of Electrical Engineering at UET, Peshawar-Jalozai Campus, Pakistan. From May 2013 to June 2015, he served Department of Telecommunication Engineering as an Assistant Professor at UET, Peshawar-Mardan Campus, Pakistan. He also worked as an International Internship scholar in the Fukuda Laboratory, National Institute of Informatics, Tokyo, Japan on the topic large-scale simulation for internet topology analysis. His research interests include design and analysis of optical WDM networks, network algorithms, network routing, and network resource optimization problems.

Theoretical Basis for Dynamic Label Propagation in Stationary Metabolic Networks under Step and Periodic Inputs

PubMed Central

Sokol, Serguei; Portais, Jean-Charles

2015-01-01

The dynamics of label propagation in a stationary metabolic network during an isotope labeling experiment can provide highly valuable information on the network topology, metabolic fluxes, and on the size of metabolite pools. However, major issues, both in the experimental set-up and in the accompanying numerical methods currently limit the application of this approach. Here, we propose a method to apply novel types of label inputs, sinusoidal or more generally periodic label inputs, to address both the practical and numerical challenges of dynamic labeling experiments. By considering a simple metabolic system, i.e. a linear, non-reversible pathway of arbitrary length, we develop mathematical descriptions of label propagation for both classical and novel label inputs. Theoretical developments and computer simulations show that the application of rectangular periodic pulses has both numerical and practical advantages over other approaches. We applied the strategy to estimate fluxes in a simulated experiment performed on a complex metabolic network (the central carbon metabolism of Escherichia coli), to further demonstrate its value in conditions which are close to those in real experiments. This study provides a theoretical basis for the rational interpretation of label propagation curves in real experiments, and will help identify the strengths, pitfalls and limitations of such experiments. The cases described here can also be used as test cases for more general numerical methods aimed at identifying network topology, analyzing metabolic fluxes or measuring concentrations of metabolites. PMID:26641860

Synchronization transition in neuronal networks composed of chaotic or non-chaotic oscillators.

PubMed

Xu, Kesheng; Maidana, Jean Paul; Castro, Samy; Orio, Patricio

2018-05-30

Chaotic dynamics has been shown in the dynamics of neurons and neural networks, in experimental data and numerical simulations. Theoretical studies have proposed an underlying role of chaos in neural systems. Nevertheless, whether chaotic neural oscillators make a significant contribution to network behaviour and whether the dynamical richness of neural networks is sensitive to the dynamics of isolated neurons, still remain open questions. We investigated synchronization transitions in heterogeneous neural networks of neurons connected by electrical coupling in a small world topology. The nodes in our model are oscillatory neurons that - when isolated - can exhibit either chaotic or non-chaotic behaviour, depending on conductance parameters. We found that the heterogeneity of firing rates and firing patterns make a greater contribution than chaos to the steepness of the synchronization transition curve. We also show that chaotic dynamics of the isolated neurons do not always make a visible difference in the transition to full synchrony. Moreover, macroscopic chaos is observed regardless of the dynamics nature of the neurons. However, performing a Functional Connectivity Dynamics analysis, we show that chaotic nodes can promote what is known as multi-stable behaviour, where the network dynamically switches between a number of different semi-synchronized, metastable states.

Adaptive control of dynamical synchronization on evolving networks with noise disturbances

NASA Astrophysics Data System (ADS)

Yuan, Wu-Jie; Zhou, Jian-Fang; Sendiña-Nadal, Irene; Boccaletti, Stefano; Wang, Zhen

2018-02-01

In real-world networked systems, the underlying structure is often affected by external and internal unforeseen factors, making its evolution typically inaccessible. An adaptive strategy was introduced for maintaining synchronization on unpredictably evolving networks [Sorrentino and Ott, Phys. Rev. Lett. 100, 114101 (2008), 10.1103/PhysRevLett.100.114101], which yet does not consider the noise disturbances widely existing in networks' environments. We provide here strategies to control dynamical synchronization on slowly and unpredictably evolving networks subjected to noise disturbances which are observed at the node and at the communication channel level. With our strategy, the nodes' coupling strength is adaptively adjusted with the aim of controlling synchronization, and according only to their received signal and noise disturbances. We first provide a theoretical analysis of the control scheme by introducing an error potential function to seek for the minimization of the synchronization error. Then, we show numerical experiments which verify our theoretical results. In particular, it is found that our adaptive strategy is effective even for the case in which the dynamics of the uncontrolled network would be explosive (i.e., the states of all the nodes would diverge to infinity).

Warnings and caveats in brain controllability.

PubMed

Tu, Chengyi; Rocha, Rodrigo P; Corbetta, Maurizio; Zampieri, Sandro; Zorzi, Marco; Suweis, S

2018-08-01

A recent article by Gu et al. (Nat. Commun. 6, 2015) proposed to characterize brain networks, quantified using anatomical diffusion imaging, in terms of their "controllability", drawing on concepts and methods of control theory. They reported that brain activity is controllable from a single node, and that the topology of brain networks provides an explanation for the types of control roles that different regions play in the brain. In this work, we first briefly review the framework of control theory applied to complex networks. We then show contrasting results on brain controllability through the analysis of five different datasets and numerical simulations. We find that brain networks are not controllable (in a statistical significant way) by one single region. Additionally, we show that random null models, with no biological resemblance to brain network architecture, produce the same type of relationship observed by Gu et al. between the average/modal controllability and weighted degree. Finally, we find that resting state networks defined with fMRI cannot be attributed specific control roles. In summary, our study highlights some warning and caveats in the brain controllability framework. Copyright © 2018 Elsevier Inc. All rights reserved.

On Event-Triggered Adaptive Architectures for Decentralized and Distributed Control of Large-Scale Modular Systems

PubMed Central

Albattat, Ali; Gruenwald, Benjamin C.; Yucelen, Tansel

2016-01-01

The last decade has witnessed an increased interest in physical systems controlled over wireless networks (networked control systems). These systems allow the computation of control signals via processors that are not attached to the physical systems, and the feedback loops are closed over wireless networks. The contribution of this paper is to design and analyze event-triggered decentralized and distributed adaptive control architectures for uncertain networked large-scale modular systems; that is, systems consist of physically-interconnected modules controlled over wireless networks. Specifically, the proposed adaptive architectures guarantee overall system stability while reducing wireless network utilization and achieving a given system performance in the presence of system uncertainties that can result from modeling and degraded modes of operation of the modules and their interconnections between each other. In addition to the theoretical findings including rigorous system stability and the boundedness analysis of the closed-loop dynamical system, as well as the characterization of the effect of user-defined event-triggering thresholds and the design parameters of the proposed adaptive architectures on the overall system performance, an illustrative numerical example is further provided to demonstrate the efficacy of the proposed decentralized and distributed control approaches. PMID:27537894

On Event-Triggered Adaptive Architectures for Decentralized and Distributed Control of Large-Scale Modular Systems.

PubMed

Albattat, Ali; Gruenwald, Benjamin C; Yucelen, Tansel

2016-08-16

The last decade has witnessed an increased interest in physical systems controlled over wireless networks (networked control systems). These systems allow the computation of control signals via processors that are not attached to the physical systems, and the feedback loops are closed over wireless networks. The contribution of this paper is to design and analyze event-triggered decentralized and distributed adaptive control architectures for uncertain networked large-scale modular systems; that is, systems consist of physically-interconnected modules controlled over wireless networks. Specifically, the proposed adaptive architectures guarantee overall system stability while reducing wireless network utilization and achieving a given system performance in the presence of system uncertainties that can result from modeling and degraded modes of operation of the modules and their interconnections between each other. In addition to the theoretical findings including rigorous system stability and the boundedness analysis of the closed-loop dynamical system, as well as the characterization of the effect of user-defined event-triggering thresholds and the design parameters of the proposed adaptive architectures on the overall system performance, an illustrative numerical example is further provided to demonstrate the efficacy of the proposed decentralized and distributed control approaches.

Evidence for Functional Networks within the Human Brain's White Matter.

PubMed

Peer, Michael; Nitzan, Mor; Bick, Atira S; Levin, Netta; Arzy, Shahar

2017-07-05

Investigation of the functional macro-scale organization of the human cortex is fundamental in modern neuroscience. Although numerous studies have identified networks of interacting functional modules in the gray-matter, limited research was directed to the functional organization of the white-matter. Recent studies have demonstrated that the white-matter exhibits blood oxygen level-dependent signal fluctuations similar to those of the gray-matter. Here we used these signal fluctuations to investigate whether the white-matter is organized as functional networks by applying a clustering analysis on resting-state functional MRI (RSfMRI) data from white-matter voxels, in 176 subjects (of both sexes). This analysis indicated the existence of 12 symmetrical white-matter functional networks, corresponding to combinations of white-matter tracts identified by diffusion tensor imaging. Six of the networks included interhemispheric commissural bridges traversing the corpus callosum. Signals in white-matter networks correlated with signals from functional gray-matter networks, providing missing knowledge on how these distributed networks communicate across large distances. These findings were replicated in an independent subject group and were corroborated by seed-based analysis in small groups and individual subjects. The identified white-matter functional atlases and analysis codes are available at http://mind.huji.ac.il/white-matter.aspx Our results demonstrate that the white-matter manifests an intrinsic functional organization as interacting networks of functional modules, similarly to the gray-matter, which can be investigated using RSfMRI. The discovery of functional networks within the white-matter may open new avenues of research in cognitive neuroscience and clinical neuropsychiatry. SIGNIFICANCE STATEMENT In recent years, functional MRI (fMRI) has revolutionized all fields of neuroscience, enabling identifications of functional modules and networks in the human brain. However, most fMRI studies ignored a major part of the brain, the white-matter, discarding signals from it as arising from noise. Here we use resting-state fMRI data from 176 subjects to show that signals from the human white-matter contain meaningful information. We identify 12 functional networks composed of interacting long-distance white-matter tracts. Moreover, we show that these networks are highly correlated to resting-state gray-matter networks, highlighting their functional role. Our findings enable reinterpretation of many existing fMRI datasets, and suggest a new way to explore the white-matter role in cognition and its disturbances in neuropsychiatric disorders. Copyright © 2017 the authors 0270-6474/17/376394-14$15.00/0.

Assessment of the Effects of Endocrine Disrupting Compounds on the Development of Vertebrate Neural Network Function Using Multi-electrode Arrays.

PubMed

Sanchez, Karla R; Mersha, Mahlet D; Dhillon, Harbinder S; Temburni, Murali K

2018-04-26

Bis-phenols, such as bis-phenol A (BPA) and bis-phenol-S (BPS), are polymerizing agents widely used in the production of plastics and numerous everyday products. They are classified as endocrine disrupting compounds (EDC) with estradiol-like properties. Long-term exposure to EDCs, even at low doses, has been linked with various health defects including cancer, behavioral disorders, and infertility, with greater vulnerability during early developmental periods. To study the effects of BPA on the development of neuronal function, we used an in vitro neuronal network derived from the early chick embryonic brain as a model. We found that exposure to BPA affected the development of network activity, specifically spiking activity and synchronization. A change in network activity is the crucial link between the molecular target of a drug or compound and its effect on behavioral outcome. Multi-electrode arrays are increasingly becoming useful tools to study the effects of drugs on network activity in vitro. There are several systems available in the market and, although there are variations in the number of electrodes, the type and quality of the electrode array and the analysis software, the basic underlying principles, and the data obtained is the same across the different systems. Although currently limited to analysis of two-dimensional in vitro cultures, these MEA systems are being improved to enable in vivo network activity in brain slices. Here, we provide a detailed protocol for embryonic exposure and recording neuronal network activity and synchrony, along with representative results.

Impact of SMOS soil moisture data assimilation on NCEP-GFS forecasts

NASA Astrophysics Data System (ADS)

Zhan, X.; Zheng, W.; Meng, J.; Dong, J.; Ek, M.

2012-04-01

Soil moisture is one of the few critical land surface state variables that have long memory to impact the exchanges of water, energy and carbon between the land surface and atmosphere. Accurate information about soil moisture status is thus required for numerical weather, seasonal climate and hydrological forecast as well as for agricultural production forecasts, water management and many other water related economic or social activities. Since the successful launch of ESA's soil moisture ocean salinity (SMOS) mission in November 2009, about 2 years of soil moisture retrievals has been collected. SMOS is believed to be the currently best satellite sensors for soil moisture remote sensing. Therefore, it becomes interesting to examine how the collected SMOS soil moisture data are compared with other satellite-sensed soil moisture retrievals (such as NASA's Advanced Microwave Scanning Radiometer -AMSR-E and EUMETSAT's Advanced Scatterometer - ASCAT)), in situ soil moisture measurements, and how these data sets impact numerical weather prediction models such as the Global Forecast System of NOAA-NCEP. This study implements the Ensemble Kalman filter in GFS to assimilate the AMSR-E, ASCAT and SMOS soil moisture observations after a quantitative assessment of their error rate based on in situ measurements from ground networks around contiguous United States. in situ soil moisture measurements from ground networks (such as USDA Soil Climate Analysis network - SCAN and NOAA's U.S. Climate Reference Network -USCRN) are used to evaluate the GFS soil moisture simulations (analysis). The benefits and uncertainties of assimilating the satellite data products in GFS are examined by comparing the GFS forecasts of surface temperature and rainfall with and without the assimilations. From these examinations, the advantages of SMOS soil moisture data products over other satellite soil moisture data sets will be evaluated. The next step toward operationally assimilating soil moisture and other land observations into GFS will also be discussed.

Analyzing the genes related to Alzheimer's disease via a network and pathway-based approach.

PubMed

Hu, Yan-Shi; Xin, Juncai; Hu, Ying; Zhang, Lei; Wang, Ju

2017-04-27

Our understanding of the molecular mechanisms underlying Alzheimer's disease (AD) remains incomplete. Previous studies have revealed that genetic factors provide a significant contribution to the pathogenesis and development of AD. In the past years, numerous genes implicated in this disease have been identified via genetic association studies on candidate genes or at the genome-wide level. However, in many cases, the roles of these genes and their interactions in AD are still unclear. A comprehensive and systematic analysis focusing on the biological function and interactions of these genes in the context of AD will therefore provide valuable insights to understand the molecular features of the disease. In this study, we collected genes potentially associated with AD by screening publications on genetic association studies deposited in PubMed. The major biological themes linked with these genes were then revealed by function and biochemical pathway enrichment analysis, and the relation between the pathways was explored by pathway crosstalk analysis. Furthermore, the network features of these AD-related genes were analyzed in the context of human interactome and an AD-specific network was inferred using the Steiner minimal tree algorithm. We compiled 430 human genes reported to be associated with AD from 823 publications. Biological theme analysis indicated that the biological processes and biochemical pathways related to neurodevelopment, metabolism, cell growth and/or survival, and immunology were enriched in these genes. Pathway crosstalk analysis then revealed that the significantly enriched pathways could be grouped into three interlinked modules-neuronal and metabolic module, cell growth/survival and neuroendocrine pathway module, and immune response-related module-indicating an AD-specific immune-endocrine-neuronal regulatory network. Furthermore, an AD-specific protein network was inferred and novel genes potentially associated with AD were identified. By means of network and pathway-based methodology, we explored the pathogenetic mechanism underlying AD at a systems biology level. Results from our work could provide valuable clues for understanding the molecular mechanism underlying AD. In addition, the framework proposed in this study could be used to investigate the pathological molecular network and genes relevant to other complex diseases or phenotypes.

Executive Functions and Prefrontal Cortex: A Matter of Persistence?

PubMed Central

Ball, Gareth; Stokes, Paul R.; Rhodes, Rebecca A.; Bose, Subrata K.; Rezek, Iead; Wink, Alle-Meije; Lord, Louis-David; Mehta, Mitul A.; Grasby, Paul M.; Turkheimer, Federico E.

2011-01-01

Executive function is thought to originates from the dynamics of frontal cortical networks. We examined the dynamic properties of the blood oxygen level dependent time-series measured with functional MRI (fMRI) within the prefrontal cortex (PFC) to test the hypothesis that temporally persistent neural activity underlies performance in three tasks of executive function. A numerical estimate of signal persistence, the Hurst exponent, postulated to represent the coherent firing of cortical networks, was determined and correlated with task performance. Increasing persistence in the lateral PFC was shown to correlate with improved performance during an n-back task. Conversely, we observed a correlation between persistence and increasing commission error – indicating a failure to inhibit a prepotent response – during a Go/No-Go task. We propose that persistence within the PFC reflects dynamic network formation and these findings underline the importance of frequency analysis of fMRI time-series in the study of executive functions. PMID:21286223

Stochastic dynamics for idiotypic immune networks

NASA Astrophysics Data System (ADS)

Barra, Adriano; Agliari, Elena

2010-12-01

In this work we introduce and analyze the stochastic dynamics obeyed by a model of an immune network recently introduced by the authors. We develop Fokker-Planck equations for the single lymphocyte behavior and coarse grained Langevin schemes for the averaged clone behavior. After showing agreement with real systems (as a short path Jerne cascade), we suggest, both with analytical and numerical arguments, explanations for the generation of (metastable) memory cells, improvement of the secondary response (both in the quality and quantity) and bell shaped modulation against infections as a natural behavior. The whole emerges from the model without being postulated a-priori as it often occurs in second generation immune networks: so the aim of the work is to present some out-of-equilibrium features of this model and to highlight mechanisms which can replace a-priori assumptions in view of further detailed analysis in theoretical systemic immunology.

The transmission of fluctuation among price indices based on Granger causality network

NASA Astrophysics Data System (ADS)

Sun, Qingru; Gao, Xiangyun; Wen, Shaobo; Chen, Zhihua; Hao, Xiaoqing

2018-09-01

In this paper, we provide a method of statistical physics to analyze the fluctuation of transmission by constructing Granger causality network among price indices (PIGCN) from a systematical perspective, using complex network theory combined with Granger causality method. In economic system, there are numerous price indices, of which the relationships are extreme complicated. Thus, time series data of 6 types of price indices of China, including 113 kinds of sub price indices, are selected as example of empirical study. Through the analysis of the structure of PIGCN, we identify important price indices with high transmission range, high intermediation capacity, high cohesion and the fluctuation transmission path of price indices, respectively. Furthermore, dynamic relationships among price indices are revealed. Based on these results, we provide several policy implications for monitoring the diffusion of risk of price fluctuation. Our method can also be used to study the price indices of other countries, which is generally applicable.

Mapping analysis and planning system for the John F. Kennedy Space Center

NASA Technical Reports Server (NTRS)

Hall, C. R.; Barkaszi, M. J.; Provancha, M. J.; Reddick, N. A.; Hinkle, C. R.; Engel, B. A.; Summerfield, B. R.

1994-01-01

Environmental management, impact assessment, research and monitoring are multidisciplinary activities which are ideally suited to incorporate a multi-media approach to environmental problem solving. Geographic information systems (GIS), simulation models, neural networks and expert-system software are some of the advancing technologies being used for data management, query, analysis and display. At the 140,000 acre John F. Kennedy Space Center, the Advanced Software Technology group has been supporting development and implementation of a program that integrates these and other rapidly evolving hardware and software capabilities into a comprehensive Mapping, Analysis and Planning System (MAPS) based in a workstation/local are network environment. An expert-system shell is being developed to link the various databases to guide users through the numerous stages of a facility siting and environmental assessment. The expert-system shell approach is appealing for its ease of data access by management-level decision makers while maintaining the involvement of the data specialists. This, as well as increased efficiency and accuracy in data analysis and report preparation, can benefit any organization involved in natural resources management.

Modelling fuel cell performance using artificial intelligence

NASA Astrophysics Data System (ADS)

Ogaji, S. O. T.; Singh, R.; Pilidis, P.; Diacakis, M.

Over the last few years, fuel cell technology has been increasing promisingly its share in the generation of stationary power. Numerous pilot projects are operating worldwide, continuously increasing the amount of operating hours either as stand-alone devices or as part of gas turbine combined cycles. An essential tool for the adequate and dynamic analysis of such systems is a software model that enables the user to assess a large number of alternative options in the least possible time. On the other hand, the sphere of application of artificial neural networks has widened covering such endeavours of life such as medicine, finance and unsurprisingly engineering (diagnostics of faults in machines). Artificial neural networks have been described as diagrammatic representation of a mathematical equation that receives values (inputs) and gives out results (outputs). Artificial neural networks systems have the capacity to recognise and associate patterns and because of their inherent design features, they can be applied to linear and non-linear problem domains. In this paper, the performance of the fuel cell is modelled using artificial neural networks. The inputs to the network are variables that are critical to the performance of the fuel cell while the outputs are the result of changes in any one or all of the fuel cell design variables, on its performance. Critical parameters for the cell include the geometrical configuration as well as the operating conditions. For the neural network, various network design parameters such as the network size, training algorithm, activation functions and their causes on the effectiveness of the performance modelling are discussed. Results from the analysis as well as the limitations of the approach are presented and discussed.

Investigating the management performance of disinfection analysis of water distribution networks using data mining approaches.

PubMed

Zounemat-Kermani, Mohammad; Ramezani-Charmahineh, Abdollah; Adamowski, Jan; Kisi, Ozgur

2018-06-13

Chlorination, the basic treatment utilized for drinking water sources, is widely used for water disinfection and pathogen elimination in water distribution networks. Thereafter, the proper prediction of chlorine consumption is of great importance in water distribution network performance. In this respect, data mining techniques-which have the ability to discover the relationship between dependent variable(s) and independent variables-can be considered as alternative approaches in comparison to conventional methods (e.g., numerical methods). This study examines the applicability of three key methods, based on the data mining approach, for predicting chlorine levels in four water distribution networks. ANNs (artificial neural networks, including the multi-layer perceptron neural network, MLPNN, and radial basis function neural network, RBFNN), SVM (support vector machine), and CART (classification and regression tree) methods were used to estimate the concentration of residual chlorine in distribution networks for three villages in Kerman Province, Iran. Produced water (flow), chlorine consumption, and residual chlorine were collected daily for 3 years. An assessment of the studied models using several statistical criteria (NSC, RMSE, R 2 , and SEP) indicated that, in general, MLPNN has the greatest capability for predicting chlorine levels followed by CART, SVM, and RBF-ANN. Weaker performance of the data-driven methods in the water distribution networks, in some cases, could be attributed to improper chlorination management rather than the methods' capability.

Network organization of the human autophagy system.

PubMed

Behrends, Christian; Sowa, Mathew E; Gygi, Steven P; Harper, J Wade

2010-07-01

Autophagy, the process by which proteins and organelles are sequestered in autophagosomal vesicles and delivered to the lysosome/vacuole for degradation, provides a primary route for turnover of stable and defective cellular proteins. Defects in this system are linked with numerous human diseases. Although conserved protein kinase, lipid kinase and ubiquitin-like protein conjugation subnetworks controlling autophagosome formation and cargo recruitment have been defined, our understanding of the global organization of this system is limited. Here we report a proteomic analysis of the autophagy interaction network in human cells under conditions of ongoing (basal) autophagy, revealing a network of 751 interactions among 409 candidate interacting proteins with extensive connectivity among subnetworks. Many new autophagy interaction network components have roles in vesicle trafficking, protein or lipid phosphorylation and protein ubiquitination, and affect autophagosome number or flux when depleted by RNA interference. The six ATG8 orthologues in humans (MAP1LC3/GABARAP proteins) interact with a cohort of 67 proteins, with extensive binding partner overlap between family members, and frequent involvement of a conserved surface on ATG8 proteins known to interact with LC3-interacting regions in partner proteins. These studies provide a global view of the mammalian autophagy interaction landscape and a resource for mechanistic analysis of this critical protein homeostasis pathway.

Sharing Writing through Computer Networking.

ERIC Educational Resources Information Center

Fey, Marion H.

1997-01-01

Suggests computer networking can support the essential purposes of the collaborative-writing movement, offering opportunities for sharing writing. Notes that literacy teachers are exploring the connectivity of computer networking through numerous designs that use either real-time or asynchronous communication. Discusses new roles for students and…

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

Wardaya, P. D., E-mail: pongga.wardaya@utp.edu.my; Noh, K. A. B. M., E-mail: pongga.wardaya@utp.edu.my; Yusoff, W. I. B. W., E-mail: pongga.wardaya@utp.edu.my

This paper discusses a new approach for investigating the seismic wave velocity of rock, specifically carbonates, as affected by their pore structures. While the conventional routine of seismic velocity measurement highly depends on the extensive laboratory experiment, the proposed approach utilizes the digital rock physics view which lies on the numerical experiment. Thus, instead of using core sample, we use the thin section image of carbonate rock to measure the effective seismic wave velocity when travelling on it. In the numerical experiment, thin section images act as the medium on which wave propagation will be simulated. For the modeling, anmore » advanced technique based on artificial neural network was employed for building the velocity and density profile, replacing image's RGB pixel value with the seismic velocity and density of each rock constituent. Then, ultrasonic wave was simulated to propagate in the thin section image by using finite difference time domain method, based on assumption of an acoustic-isotropic medium. Effective velocities were drawn from the recorded signal and being compared to the velocity modeling from Wyllie time average model and Kuster-Toksoz rock physics model. To perform the modeling, image analysis routines were undertaken for quantifying the pore aspect ratio that is assumed to represent the rocks pore structure. In addition, porosity and mineral fraction required for velocity modeling were also quantified by using integrated neural network and image analysis technique. It was found that the Kuster-Toksoz gives the closer prediction to the measured velocity as compared to the Wyllie time average model. We also conclude that Wyllie time average that does not incorporate the pore structure parameter deviates significantly for samples having more than 40% porosity. Utilizing this approach we found a good agreement between numerical experiment and theoretically derived rock physics model for estimating the effective seismic wave velocity of rock.« less

Design and analysis of photonic optical switches with improved wavelength selectivity

NASA Astrophysics Data System (ADS)

Wielichowski, Marcin; Patela, Sergiusz

2005-09-01

Efficient optical modulators and switches are the key elements of the future all-optical fiber networks. Aside from numerous advantages, the integrated optical devices suffer from excessive longitudinal dimensions. The dimensions may be significantly reduced with help of periodic structures, such as Bragg gratings, arrayed waveguides or multilayer structures. In this paper we describe methods of analysis and example of analytical results of a photonic switch with properties modified by the application of periodic change of effective refractive index. The switch is composed of a strip-waveguide directional coupler and a transversal Bragg grating.

The CSM testbed software system: A development environment for structural analysis methods on the NAS CRAY-2

NASA Technical Reports Server (NTRS)

Gillian, Ronnie E.; Lotts, Christine G.

1988-01-01

The Computational Structural Mechanics (CSM) Activity at Langley Research Center is developing methods for structural analysis on modern computers. To facilitate that research effort, an applications development environment has been constructed to insulate the researcher from the many computer operating systems of a widely distributed computer network. The CSM Testbed development system was ported to the Numerical Aerodynamic Simulator (NAS) Cray-2, at the Ames Research Center, to provide a high end computational capability. This paper describes the implementation experiences, the resulting capability, and the future directions for the Testbed on supercomputers.

Synchronized and mixed outbreaks of coupled recurrent epidemics.

PubMed

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

2017-05-25

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

Optimal and robust control of a class of nonlinear systems using dynamically re-optimised single network adaptive critic design

NASA Astrophysics Data System (ADS)

Tiwari, Shivendra N.; Padhi, Radhakant

2018-01-01

Following the philosophy of adaptive optimal control, a neural network-based state feedback optimal control synthesis approach is presented in this paper. First, accounting for a nominal system model, a single network adaptive critic (SNAC) based multi-layered neural network (called as NN1) is synthesised offline. However, another linear-in-weight neural network (called as NN2) is trained online and augmented to NN1 in such a manner that their combined output represent the desired optimal costate for the actual plant. To do this, the nominal model needs to be updated online to adapt to the actual plant, which is done by synthesising yet another linear-in-weight neural network (called as NN3) online. Training of NN3 is done by utilising the error information between the nominal and actual states and carrying out the necessary Lyapunov stability analysis using a Sobolev norm based Lyapunov function. This helps in training NN2 successfully to capture the required optimal relationship. The overall architecture is named as 'Dynamically Re-optimised single network adaptive critic (DR-SNAC)'. Numerical results for two motivating illustrative problems are presented, including comparison studies with closed form solution for one problem, which clearly demonstrate the effectiveness and benefit of the proposed approach.

Mean field approximation for biased diffusion on Japanese inter-firm trading network.

PubMed

Watanabe, Hayafumi

2014-01-01

By analysing the financial data of firms across Japan, a nonlinear power law with an exponent of 1.3 was observed between the number of business partners (i.e. the degree of the inter-firm trading network) and sales. In a previous study using numerical simulations, we found that this scaling can be explained by both the money-transport model, where a firm (i.e. customer) distributes money to its out-edges (suppliers) in proportion to the in-degree of destinations, and by the correlations among the Japanese inter-firm trading network. However, in this previous study, we could not specifically identify what types of structure properties (or correlations) of the network determine the 1.3 exponent. In the present study, we more clearly elucidate the relationship between this nonlinear scaling and the network structure by applying mean-field approximation of the diffusion in a complex network to this money-transport model. Using theoretical analysis, we obtained the mean-field solution of the model and found that, in the case of the Japanese firms, the scaling exponent of 1.3 can be determined from the power law of the average degree of the nearest neighbours of the network with an exponent of -0.7.

Hydraulic tomography of discrete networks of conduits and fractures in a karstic aquifer by using a deterministic inversion algorithm

NASA Astrophysics Data System (ADS)

Fischer, P.; Jardani, A.; Lecoq, N.

2018-02-01

In this paper, we present a novel inverse modeling method called Discrete Network Deterministic Inversion (DNDI) for mapping the geometry and property of the discrete network of conduits and fractures in the karstified aquifers. The DNDI algorithm is based on a coupled discrete-continuum concept to simulate numerically water flows in a model and a deterministic optimization algorithm to invert a set of observed piezometric data recorded during multiple pumping tests. In this method, the model is partioned in subspaces piloted by a set of parameters (matrix transmissivity, and geometry and equivalent transmissivity of the conduits) that are considered as unknown. In this way, the deterministic optimization process can iteratively correct the geometry of the network and the values of the properties, until it converges to a global network geometry in a solution model able to reproduce the set of data. An uncertainty analysis of this result can be performed from the maps of posterior uncertainties on the network geometry or on the property values. This method has been successfully tested for three different theoretical and simplified study cases with hydraulic responses data generated from hypothetical karstic models with an increasing complexity of the network geometry, and of the matrix heterogeneity.

Characteristics of microstrip muscle-loaded single-arm Archimedean spiral antennas as investigated by FDTD numerical computations.

PubMed

Jacobsen, Svein; Rolfsnes, Hans Olav; Stauffer, Paul R

2005-02-01

The radiation characteristics and mode of operation of single-arm, groundplane backed, Archimedean spiral antennas are investigated by means of conformal finite difference time domain numerical analysis. It is shown that this antenna type may be categorized as a well-matched, broadband, circularly polarized traveling wave structure that can be fed directly by nonbalanced coaxial networks. The study further concentrates on relevant design and description features parameterized in terms of measures like radiation efficiency, sensing depth, directivity, and axial ratio of complementary polarizations. We document that an antenna of only 30-mm transverse size produces circularly polarized waves in a two-octave frequency span (2-8 GHz) with acceptable radiation efficiency (76%-94%) when loaded by muscle-like tissue.

Numerical Modeling of Flow Distribution in Micro-Fluidics Systems

NASA Technical Reports Server (NTRS)

Majumdar, Alok; Cole, Helen; Chen, C. P.

2005-01-01

This paper describes an application of a general purpose computer program, GFSSP (Generalized Fluid System Simulation Program) for calculating flow distribution in a network of micro-channels. GFSSP employs a finite volume formulation of mass and momentum conservation equations in a network consisting of nodes and branches. Mass conservation equation is solved for pressures at the nodes while the momentum conservation equation is solved at the branches to calculate flowrate. The system of equations describing the fluid network is solved by a numerical method that is a combination of the Newton-Raphson and successive substitution methods. The numerical results have been compared with test data and detailed CFD (computational Fluid Dynamics) calculations. The agreement between test data and predictions is satisfactory. The discrepancies between the predictions and test data can be attributed to the frictional correlation which does not include the effect of surface tension or electro-kinetic effect.

An adaptive neural swarm approach for intrusion defense in ad hoc networks

NASA Astrophysics Data System (ADS)

Cannady, James

2011-06-01

Wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are being increasingly deployed in critical applications due to the flexibility and extensibility of the technology. While these networks possess numerous advantages over traditional wireless systems in dynamic environments they are still vulnerable to many of the same types of host-based and distributed attacks common to those systems. Unfortunately, the limited power and bandwidth available in WSNs and MANETs, combined with the dynamic connectivity that is a defining characteristic of the technology, makes it extremely difficult to utilize traditional intrusion detection techniques. This paper describes an approach to accurately and efficiently detect potentially damaging activity in WSNs and MANETs. It enables the network as a whole to recognize attacks, anomalies, and potential vulnerabilities in a distributive manner that reflects the autonomic processes of biological systems. Each component of the network recognizes activity in its local environment and then contributes to the overall situational awareness of the entire system. The approach utilizes agent-based swarm intelligence to adaptively identify potential data sources on each node and on adjacent nodes throughout the network. The swarm agents then self-organize into modular neural networks that utilize a reinforcement learning algorithm to identify relevant behavior patterns in the data without supervision. Once the modular neural networks have established interconnectivity both locally and with neighboring nodes the analysis of events within the network can be conducted collectively in real-time. The approach has been shown to be extremely effective in identifying distributed network attacks.

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.

Insights on the evolution of metabolic networks of unicellular translationally biased organisms from transcriptomic data and sequence analysis.

PubMed

Carbone, Alessandra; Madden, Richard

2005-10-01

Codon bias is related to metabolic functions in translationally biased organisms, and two facts are argued about. First, genes with high codon bias describe in meaningful ways the metabolic characteristics of the organism; important metabolic pathways corresponding to crucial characteristics of the lifestyle of an organism, such as photosynthesis, nitrification, anaerobic versus aerobic respiration, sulfate reduction, methanogenesis, and others, happen to involve especially biased genes. Second, gene transcriptional levels of sets of experiments representing a significant variation of biological conditions strikingly confirm, in the case of Saccharomyces cerevisiae, that metabolic preferences are detectable by purely statistical analysis: the high metabolic activity of yeast during fermentation is encoded in the high bias of enzymes involved in the associated pathways, suggesting that this genome was affected by a strong evolutionary pressure that favored a predominantly fermentative metabolism of yeast in the wild. The ensemble of metabolic pathways involving enzymes with high codon bias is rather well defined and remains consistent across many species, even those that have not been considered as translationally biased, such as Helicobacter pylori, for instance, reveal some weak form of translational bias for this genome. We provide numerical evidence, supported by experimental data, of these facts and conclude that the metabolic networks of translationally biased genomes, observable today as projections of eons of evolutionary pressure, can be analyzed numerically and predictions of the role of specific pathways during evolution can be derived. The new concepts of Comparative Pathway Index, used to compare organisms with respect to their metabolic networks, and Evolutionary Pathway Index, used to detect evolutionarily meaningful bias in the genetic code from transcriptional data, are introduced.

Evaluation of a landscape evolution model to simulate stream piracies: Insights from multivariable numerical tests using the example of the Meuse basin, France

NASA Astrophysics Data System (ADS)

Benaïchouche, Abed; Stab, Olivier; Tessier, Bruno; Cojan, Isabelle

2016-01-01

In landscapes dominated by fluvial erosion, the landscape morphology is closely related to the hydrographic network system. In this paper, we investigate the hydrographic network reorganization caused by a headward piracy mechanism between two drainage basins in France, the Meuse and the Moselle. Several piracies occurred in the Meuse basin during the past one million years, and the basin's current characteristics are favorable to new piracies by the Moselle river network. This study evaluates the consequences over the next several million years of a relative lowering of the Moselle River (and thus of its basin) with respect to the Meuse River. The problem is addressed with a numerical modeling approach (landscape evolution model, hereafter LEM) that requires empirical determinations of parameters and threshold values. Classically, fitting of the parameters is based on analysis of the relationship between the slope and the drainage area and is conducted under the hypothesis of equilibrium. Application of this conventional approach to the capture issue yields incomplete results that have been consolidated by a parametric sensitivity analysis. The LEM equations give a six-dimensional parameter space that was explored with over 15,000 simulations using the landscape evolution model GOLEM. The results demonstrate that stream piracies occur in only four locations in the studied reach near the city of Toul. The locations are mainly controlled by the local topography and are model-independent. Nevertheless, the chronology of the captures depends on two parameters: the river concavity (given by the fluvial advection equation) and the hillslope erosion factor. Thus, the simulations lead to three different scenarios that are explained by a phenomenon of exclusion or a string of events.

Synchronization in interdependent networks

NASA Astrophysics Data System (ADS)

Um, Jaegon; Minnhagen, Petter; Kim, Beom Jun

2011-06-01

We explore the synchronization behavior in interdependent systems, where the one-dimensional (1D) network (the intranetwork coupling strength JI) is ferromagnetically intercoupled (the strength J) to the Watts-Strogatz (WS) small-world network (the intranetwork coupling strength JII). In the absence of the internetwork coupling (J =0), the former network is well known not to exhibit the synchronized phase at any finite coupling strength, whereas the latter displays the mean-field transition. Through an analytic approach based on the mean-field approximation, it is found that for the weakly coupled 1D network (JI≪1) the increase of J suppresses synchrony, because the nonsynchronized 1D network becomes a heavier burden for the synchronization process of the WS network. As the coupling in the 1D network becomes stronger, it is revealed by the renormalization group (RG) argument that the synchronization is enhanced as JI is increased, implying that the more enhanced partial synchronization in the 1D network makes the burden lighter. Extensive numerical simulations confirm these expected behaviors, while exhibiting a reentrant behavior in the intermediate range of JI. The nonmonotonic change of the critical value of JII is also compared with the result from the numerical RG calculation.

Dynamics of coupled mode solitons in bursting neural networks

NASA Astrophysics Data System (ADS)

Nfor, N. Oma; Ghomsi, P. Guemkam; Moukam Kakmeni, F. M.

2018-02-01

Using an electrically coupled chain of Hindmarsh-Rose neural models, we analytically derived the nonlinearly coupled complex Ginzburg-Landau equations. This is realized by superimposing the lower and upper cutoff modes of wave propagation and by employing the multiple scale expansions in the semidiscrete approximation. We explore the modified Hirota method to analytically obtain the bright-bright pulse soliton solutions of our nonlinearly coupled equations. With these bright solitons as initial conditions of our numerical scheme, and knowing that electrical signals are the basis of information transfer in the nervous system, it is found that prior to collisions at the boundaries of the network, neural information is purely conveyed by bisolitons at lower cutoff mode. After collision, the bisolitons are completely annihilated and neural information is now relayed by the upper cutoff mode via the propagation of plane waves. It is also shown that the linear gain of the system is inextricably linked to the complex physiological mechanisms of ion mobility, since the speeds and spatial profiles of the coupled nerve impulses vary with the gain. A linear stability analysis performed on the coupled system mainly confirms the instability of plane waves in the neural network, with a glaring example of the transition of weak plane waves into a dark soliton and then static kinks. Numerical simulations have confirmed the annihilation phenomenon subsequent to collision in neural systems. They equally showed that the symmetry breaking of the pulse solution of the system leaves in the network static internal modes, sometime referred to as Goldstone modes.

Application of the simplex method to the optimal adjustment of the parameters of a ventilation network

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

Kamba, G.M.; Jacques, E.; Patigny, J.

1995-12-31

Literature is rather abundant on the topic of steady-state network analysis programs. Many versions exist, some of them have real extended facilities such as full graphical manipulation, fire simulation in motion, etc. These programs are certainly of great help to any ventilation planning and often assist the ventilation engineer in his operational decision making. However, what ever the efficiency of the calculation algorithms might be, their weak point still is the overall validity of the model. This numerical model, apart from maybe the questionable application of some physical laws, depends directly on the quality of the data used to identifymore » its most influencing parameters such as the passive (resistance) or active (fan) characteristic of each of the branches in the network. Considering the non-linear character of the problem and the great number of variables involved, finding the closest numerical model of a real mine ventilation network is without any doubt a very difficult problem. This problem, often referred to as the parameter adjustment problem, is in almost every practical case solved on an experimental and {open_quotes}feeling{close_quotes} basis. Only a few papers put forward a mathematical solution based on a least square approach as the best fit criterion. The aim of this paper is to examine the possibility to apply the well-known simplex method to this problem. The performance of this method and its capability to reach the global optimum which corresponds to the best fit is discussed and compared to that of other methods.« less

DRREP: deep ridge regressed epitope predictor.

PubMed

Sher, Gene; Zhi, Degui; Zhang, Shaojie

2017-10-03

The ability to predict epitopes plays an enormous role in vaccine development in terms of our ability to zero in on where to do a more thorough in-vivo analysis of the protein in question. Though for the past decade there have been numerous advancements and improvements in epitope prediction, on average the best benchmark prediction accuracies are still only around 60%. New machine learning algorithms have arisen within the domain of deep learning, text mining, and convolutional networks. This paper presents a novel analytically trained and string kernel using deep neural network, which is tailored for continuous epitope prediction, called: Deep Ridge Regressed Epitope Predictor (DRREP). DRREP was tested on long protein sequences from the following datasets: SARS, Pellequer, HIV, AntiJen, and SEQ194. DRREP was compared to numerous state of the art epitope predictors, including the most recently published predictors called LBtope and DMNLBE. Using area under ROC curve (AUC), DRREP achieved a performance improvement over the best performing predictors on SARS (13.7%), HIV (8.9%), Pellequer (1.5%), and SEQ194 (3.1%), with its performance being matched only on the AntiJen dataset, by the LBtope predictor, where both DRREP and LBtope achieved an AUC of 0.702. DRREP is an analytically trained deep neural network, thus capable of learning in a single step through regression. By combining the features of deep learning, string kernels, and convolutional networks, the system is able to perform residue-by-residue prediction of continues epitopes with higher accuracy than the current state of the art predictors.

Dynamics of coupled mode solitons in bursting neural networks.

PubMed

Nfor, N Oma; Ghomsi, P Guemkam; Moukam Kakmeni, F M

2018-02-01

Using an electrically coupled chain of Hindmarsh-Rose neural models, we analytically derived the nonlinearly coupled complex Ginzburg-Landau equations. This is realized by superimposing the lower and upper cutoff modes of wave propagation and by employing the multiple scale expansions in the semidiscrete approximation. We explore the modified Hirota method to analytically obtain the bright-bright pulse soliton solutions of our nonlinearly coupled equations. With these bright solitons as initial conditions of our numerical scheme, and knowing that electrical signals are the basis of information transfer in the nervous system, it is found that prior to collisions at the boundaries of the network, neural information is purely conveyed by bisolitons at lower cutoff mode. After collision, the bisolitons are completely annihilated and neural information is now relayed by the upper cutoff mode via the propagation of plane waves. It is also shown that the linear gain of the system is inextricably linked to the complex physiological mechanisms of ion mobility, since the speeds and spatial profiles of the coupled nerve impulses vary with the gain. A linear stability analysis performed on the coupled system mainly confirms the instability of plane waves in the neural network, with a glaring example of the transition of weak plane waves into a dark soliton and then static kinks. Numerical simulations have confirmed the annihilation phenomenon subsequent to collision in neural systems. They equally showed that the symmetry breaking of the pulse solution of the system leaves in the network static internal modes, sometime referred to as Goldstone modes.

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.

A novel coherent optical en/decoder for optical label processing of OCDM-based optical packets switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun

2007-11-01

A coherent optical en/decoder based on photonic crystal (PhC) for optical code-division-multiple (OCDM)-based optical label (OCDM-OL) optical packets switching (OPS) networks is proposed in this paper. In this scheme, the optical pulse phase and time delay can be flexibly controlled by the photonic crystal phase shifter and delayer using the appropriate design of fabrication. In this design, the combination calculation of the impurity and normal period layers is applied, according to the PhC transmission matrix theorem. The design and theoretical analysis of the PhC-based optical coherent en/decoder is mainly focused. In addition, the performances of the PhC-based optical en/decoders are analyzed in detail. The reflection, the transmission, delay characteristic and the optical spectrum of pulse en/decoded are studied for the waves tuned in the photonic band-gap by the numerical calculation, taking into account 1-Dimension (1D) PhC. Theoretical analysis and numerical results show that optical pulse is achieved to properly phase modulation and time delay by the proposed scheme, optical label based on OCDM is rewrote successfully by new code for OCDM-based OPS (OCDM-OPS), and an over 8.5 dB ration of auto- and cross-correlation is gained, which demonstrates the applicability of true pulse phase modulation in a number of applications.

Switching synchronization in one-dimensional memristive networks

NASA Astrophysics Data System (ADS)

Slipko, Valeriy A.; Shumovskyi, Mykola; Pershin, Yuriy V.

2015-11-01

We report on a switching synchronization phenomenon in one-dimensional memristive networks, which occurs when several memristive systems with different switching constants are switched from the high- to low-resistance state. Our numerical simulations show that such a collective behavior is especially pronounced when the applied voltage slightly exceeds the combined threshold voltage of memristive systems. Moreover, a finite increase in the network switching time is found compared to the average switching time of individual systems. An analytical model is presented to explain our observations. Using this model, we have derived asymptotic expressions for memory resistances at short and long times, which are in excellent agreement with results of our numerical simulations.

Analog design of a new neural network for optical character recognition.

PubMed

Morns, I P; Dlay, S S

1999-01-01

An electronic circuit is presented for a new type of neural network, which gives a recognition rate of over 100 kHz. The network is used to classify handwritten numerals, presented as Fourier and wavelet descriptors, and has been shown to train far quicker than the popular backpropagation network while maintaining classification accuracy.

Neural-Network Computer Transforms Coordinates

NASA Technical Reports Server (NTRS)

Josin, Gary M.

1990-01-01

Numerical simulation demonstrated ability of conceptual neural-network computer to generalize what it has "learned" from few examples. Ability to generalize achieved with even simple neural network (relatively few neurons) and after exposure of network to only few "training" examples. Ability to obtain fairly accurate mappings after only few training examples used to provide solutions to otherwise intractable mapping problems.

Capacity for patterns and sequences in Kanerva's SDM as compared to other associative memory models

NASA Technical Reports Server (NTRS)

Keeler, James D.

1987-01-01

The information capacity of Kanerva's Sparse Distributed Memory (SDM) and Hopfield-type neural networks is investigated. Under the approximations used, it is shown that the total information stored in these systems is proportional to the number connections in the network. The proportionality constant is the same for the SDM and Hopfield-type models independent of the particular model, or the order of the model. The approximations are checked numerically. This same analysis can be used to show that the SDM can store sequences of spatiotemporal patterns, and the addition of time-delayed connections allows the retrieval of context dependent temporal patterns. A minor modification of the SDM can be used to store correlated patterns.

Machine learning action parameters in lattice quantum chromodynamics

NASA Astrophysics Data System (ADS)

Shanahan, Phiala E.; Trewartha, Daniel; Detmold, William

2018-05-01

Numerical lattice quantum chromodynamics studies of the strong interaction are important in many aspects of particle and nuclear physics. Such studies require significant computing resources to undertake. A number of proposed methods promise improved efficiency of lattice calculations, and access to regions of parameter space that are currently computationally intractable, via multi-scale action-matching approaches that necessitate parametric regression of generated lattice datasets. The applicability of machine learning to this regression task is investigated, with deep neural networks found to provide an efficient solution even in cases where approaches such as principal component analysis fail. The high information content and complex symmetries inherent in lattice QCD datasets require custom neural network layers to be introduced and present opportunities for further development.

Star-type oscillatory networks with generic Kuramoto-type coupling: A model for "Japanese drums synchrony"

NASA Astrophysics Data System (ADS)

Vlasov, Vladimir; Pikovsky, Arkady; Macau, Elbert E. N.

2015-12-01

We analyze star-type networks of phase oscillators by virtue of two methods. For identical oscillators we adopt the Watanabe-Strogatz approach, which gives full analytical description of states, rotating with constant frequency. For nonidentical oscillators, such states can be obtained by virtue of the self-consistent approach in a parametric form. In this case stability analysis cannot be performed, however with the help of direct numerical simulations we show which solutions are stable and which not. We consider this system as a model for a drum orchestra, where we assume that the drummers follow the signal of the leader without listening to each other and the coupling parameters are determined by a geometrical organization of the orchestra.

Joint Transmit Antenna Selection and Power Allocation for ISDF Relaying Mobile-to-Mobile Sensor Networks

PubMed Central

Xu, Lingwei; Zhang, Hao; Gulliver, T. Aaron

2016-01-01

The outage probability (OP) performance of multiple-relay incremental-selective decode-and-forward (ISDF) relaying mobile-to-mobile (M2M) sensor networks with transmit antenna selection (TAS) over N-Nakagami fading channels is investigated. Exact closed-form OP expressions for both optimal and suboptimal TAS schemes are derived. The power allocation problem is formulated to determine the optimal division of transmit power between the broadcast and relay phases. The OP performance under different conditions is evaluated via numerical simulation to verify the analysis. These results show that the optimal TAS scheme has better OP performance than the suboptimal scheme. Further, the power allocation parameter has a significant influence on the OP performance. PMID:26907282

Modeling of knowledge transmission by considering the level of forgetfulness in complex networks

NASA Astrophysics Data System (ADS)

Cao, Bin; Han, Shui-hua; Jin, Zhen

2016-06-01

In this study, we establish a general model by considering the level of forgetfulness during knowledge transmission in complex networks, where the level of forgetfulness depends mainly on the number in a crowd who possess knowledge, while the saturated incidence is also considered. In theory, we analyze the stability of the equilibrium points and the transmission threshold R0 is also given. If R0 > 1, then knowledge can ​be transmitted, but if not, it will become completely extinct. In addition, we performed some numerical simulations to verify the reasonability of the theoretical analysis. The results of the simulations also suggest ​that the proportion of the crowd with knowledge will be increased under a better cultural atmosphere.

Application for Single Price Auction Model (SPA) in AC Network

NASA Astrophysics Data System (ADS)

Wachi, Tsunehisa; Fukutome, Suguru; Chen, Luonan; Makino, Yoshinori; Koshimizu, Gentarou

This paper aims to develop a single price auction model with AC transmission network, based on the principle of maximizing social surplus of electricity market. Specifically, we first formulate the auction market as a nonlinear optimization problem, which has almost the same form as the conventional optimal power flow problem, and then propose an algorithm to derive both market clearing price and trade volume of each player even for the case of market-splitting. As indicated in the paper, the proposed approach can be used not only for the price evaluation of auction or bidding market but also for analysis of bidding strategy, congestion effect and other constraints or factors. Several numerical examples are used to demonstrate effectiveness of our method.

Event-Triggered Fault Detection of Nonlinear Networked Systems.

PubMed

Li, Hongyi; Chen, Ziran; Wu, Ligang; Lam, Hak-Keung; Du, Haiping

2017-04-01

This paper investigates the problem of fault detection for nonlinear discrete-time networked systems under an event-triggered scheme. A polynomial fuzzy fault detection filter is designed to generate a residual signal and detect faults in the system. A novel polynomial event-triggered scheme is proposed to determine the transmission of the signal. A fault detection filter is designed to guarantee that the residual system is asymptotically stable and satisfies the desired performance. Polynomial approximated membership functions obtained by Taylor series are employed for filtering analysis. Furthermore, sufficient conditions are represented in terms of sum of squares (SOSs) and can be solved by SOS tools in MATLAB environment. A numerical example is provided to demonstrate the effectiveness of the proposed results.

Global exponential stability and lag synchronization for delayed memristive fuzzy Cohen-Grossberg BAM neural networks with impulses.

PubMed

Yang, Wengui; Yu, Wenwu; Cao, Jinde; Alsaadi, Fuad E; Hayat, Tasawar

2018-02-01

This paper investigates the stability and lag synchronization for memristor-based fuzzy Cohen-Grossberg bidirectional associative memory (BAM) neural networks with mixed delays (asynchronous time delays and continuously distributed delays) and impulses. By applying the inequality analysis technique, homeomorphism theory and some suitable Lyapunov-Krasovskii functionals, some new sufficient conditions for the uniqueness and global exponential stability of equilibrium point are established. Furthermore, we obtain several sufficient criteria concerning globally exponential lag synchronization for the proposed system based on the framework of Filippov solution, differential inclusion theory and control theory. In addition, some examples with numerical simulations are given to illustrate the feasibility and validity of obtained results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Capacity for patterns and sequences in Kanerva's SDM as compared to other associative memory models. [Sparse, Distributed Memory

NASA Technical Reports Server (NTRS)

Keeler, James D.

1988-01-01

The information capacity of Kanerva's Sparse Distributed Memory (SDM) and Hopfield-type neural networks is investigated. Under the approximations used here, it is shown that the total information stored in these systems is proportional to the number connections in the network. The proportionality constant is the same for the SDM and Hopfield-type models independent of the particular model, or the order of the model. The approximations are checked numerically. This same analysis can be used to show that the SDM can store sequences of spatiotemporal patterns, and the addition of time-delayed connections allows the retrieval of context dependent temporal patterns. A minor modification of the SDM can be used to store correlated patterns.

Modeling epidemic spread with awareness and heterogeneous transmission rates in networks.

PubMed

Shang, Yilun

2013-06-01

During an epidemic outbreak in a human population, susceptibility to infection can be reduced by raising awareness of the disease. In this paper, we investigate the effects of three forms of awareness (i.e., contact, local, and global) on the spread of a disease in a random network. Connectivity-correlated transmission rates are assumed. By using the mean-field theory and numerical simulation, we show that both local and contact awareness can raise the epidemic thresholds while the global awareness cannot, which mirrors the recent results of Wu et al. The obtained results point out that individual behaviors in the presence of an infectious disease has a great influence on the epidemic dynamics. Our method enriches mean-field analysis in epidemic models.

Numerical and Statistical Analysis of Fractures in Mechanically Dissimilar Rocks of Limestone Interbedded with Shale from Nash Point in Bristol Channel, South Wales, UK.

NASA Astrophysics Data System (ADS)

Adeoye-Akinde, K.; Gudmundsson, A.

2017-12-01

Heterogeneity and anisotropy, especially with layered strata within the same reservoir, makes the geometry and permeability of an in-situ fracture network challenging to forecast. This study looks at outcrops analogous to reservoir rocks for a better understanding of in-situ fracture networks and permeability, especially fracture formation, propagation, and arrest/deflection. Here, fracture geometry (e.g. length and aperture) from interbedded limestone and shale is combined with statistical and numerical modelling (using the Finite Element Method) to better forecast fracture network properties and permeability. The main aim is to bridge the gap between fracture data obtained at the core level (cm-scale) and at the seismic level (km-scale). Analysis has been made of geometric properties of over 250 fractures from the blue Lias in Nash Point, UK. As fractures propagate, energy is required to keep them going, and according to the laws of thermodynamics, this energy can be linked to entropy. As fractures grow, entropy increases, therefore, the result shows a strong linear correlation between entropy and the scaling exponent of fracture length and aperture-size distributions. Modelling is used to numerically simulate the stress/fracture behaviour in mechanically dissimilar rocks. Results show that the maximum principal compressive stress orientation changes in the host rock as the fracture-induced stress tip moves towards a more compliant (shale) layer. This behaviour can be related to the three mechanisms of fracture arrest/deflection at an interface, namely: elastic mismatch, stress barrier and Cook-Gordon debonding. Tensile stress concentrates at the contact between the stratigraphic layers, ahead of and around the propagating fracture. However, as shale stiffens with time, the stresses concentrated at the contact start to dissipate into it. This can happen in nature through diagenesis, and with greater depth of burial. This study also investigates how induced fractures propagate and interact with existing discontinuities in layered rocks using analogue modelling. Further work will introduce the Maximum Entropy Method for more accurate statistical modelling. This method is mainly useful to forecast likely fracture-size probability distributions from incomplete subsurface information.

Characterization of Breast Cancer Interstitial Fluids by TmT Labeling, LTQ-Orbitrap Velos Mass Spectrometry and Pathway Analysis

PubMed Central

Cinzia, Raso; Carlo, Cosentino; Marco, Gaspari; Natalia, Malara; Xuemei, Han; Daniel, McClatchy; Kyu, Park Sung; Maria, Renne; Nuria, Vadalà; Ubaldo, Prati; Giovanni, Cuda; Vincenzo, Mollace; Francesco, Amato; Yates, John R.

2012-01-01

Cancer is currently considered as the end point of numerous genomic and epigenomic mutations and as the result of the interaction of transformed cells within the stromal microenvironment. The present work focuses on breast cancer, one of the most common malignancies affecting the female population in industrialized countries. In this study we perform a proteomic analysis of bioptic samples from human breast cancer, namely interstitial fluids and primary cells, normal vs disease tissues, using Tandem mass Tags (TmT) quantitative mass spectrometry combined with the MudPIT technique. To the best of our knowledge this work, with over 1700 proteins identified, represents the most comprehensive characterization of the breast cancer interstitial fluid proteome to date. Network analysis was used to identify functionally active networks in the breast cancer associated samples. From the list of differentially expressed genes we have retrieved the associated functional interaction networks. Many different signaling pathways were found activated, strongly linked to invasion, metastasis development, proliferation and with a significant cross-talking rate. This pilot study presents evidence that the proposed quantitative proteomic approach can be applied to discriminate between normal and tumoral samples and for the discovery of yet unknown carcinogenesis mechanisms and therapeutic strategies. PMID:22563702

All for one but not one for all: how multiple number representations are recruited in one numerical task.

PubMed

Wood, Guilherme; Nuerk, Hans-Christoph; Moeller, Korbinian; Geppert, Barbara; Schnitker, Ralph; Weber, Jochen; Willmes, Klaus

2008-01-02

Number processing recruits a complex network of multiple numerical representations. Usually the components of this network are examined in a between-task approach with the disadvantage of relying upon different instructions, tasks, and inhomogeneous stimulus sets across different studies. A within-task approach may avoid these disadvantages and access involved numerical representations more specifically. In the present study we employed a within-task approach to investigate numerical representations activated in the number bisection task (NBT) using parametric rapid event-related fMRI. Participants were to judge whether the central number of a triplet was also its arithmetic mean (e.g. 23_26_29) or not (e.g. 23_25_29). Activation in the left inferior parietal cortex was associated with the deployment of arithmetic fact knowledge, while activation of the intraparietal cortex indicated more intense magnitude processing, instrumental aspects of calculation and integration of the base-10 structure of two-digit numbers. These results replicate evidence from the literature. Furthermore, activation in the dorsolateral and ventrolateral prefrontal cortex revealed mechanisms of feature monitoring and inhibition as well as allocation of cognitive resources recruited to solve a specific triplet. We conclude that the network of numerical representations should rather be studied in a within-task approach than in varying between-task approaches.

Finite-time robust passive control for a class of switched reaction-diffusion stochastic complex dynamical networks with coupling delays and impulsive control

NASA Astrophysics Data System (ADS)

Syed Ali, M.; Yogambigai, J.; Kwon, O. M.

2018-03-01

Finite-time boundedness and finite-time passivity for a class of switched stochastic complex dynamical networks (CDNs) with coupling delays, parameter uncertainties, reaction-diffusion term and impulsive control are studied. Novel finite-time synchronisation criteria are derived based on passivity theory. This paper proposes a CDN consisting of N linearly and diffusively coupled identical reaction- diffusion neural networks. By constructing of a suitable Lyapunov-Krasovskii's functional and utilisation of Jensen's inequality and Wirtinger's inequality, new finite-time passivity criteria for the networks are established in terms of linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Finally, two interesting numerical examples are given to show the effectiveness of the theoretical results.

Transversal homoclinic orbits in a transiently chaotic neural network.

PubMed

Chen, Shyan-Shiou; Shih, Chih-Wen

2002-09-01

We study the existence of snap-back repellers, hence the existence of transversal homoclinic orbits in a discrete-time neural network. Chaotic behaviors for the network system in the sense of Li and Yorke or Marotto can then be concluded. The result is established by analyzing the structures of the system and allocating suitable parameters in constructing the fixed points and their pre-images for the system. The investigation provides a theoretical confirmation on the scenario of transient chaos for the system. All the parameter conditions for the theory can be examined numerically. The numerical ranges for the parameters which yield chaotic dynamics and convergent dynamics provide significant information in the annealing process in solving combinatorial optimization problems using this transiently chaotic neural network. (c) 2002 American Institute of Physics.

Neural network approach for the calculation of potential coefficients in quantum mechanics

NASA Astrophysics Data System (ADS)

Ossandón, Sebastián; Reyes, Camilo; Cumsille, Patricio; Reyes, Carlos M.

2017-05-01

A numerical method based on artificial neural networks is used to solve the inverse Schrödinger equation for a multi-parameter class of potentials. First, the finite element method was used to solve repeatedly the direct problem for different parametrizations of the chosen potential function. Then, using the attainable eigenvalues as a training set of the direct radial basis neural network a map of new eigenvalues was obtained. This relationship was later inverted and refined by training an inverse radial basis neural network, allowing the calculation of the unknown parameters and therefore estimating the potential function. Three numerical examples are presented in order to prove the effectiveness of the method. The results show that the method proposed has the advantage to use less computational resources without a significant accuracy loss.

New transmission scheme to enhance throughput of DF relay network using rate and power adaptation

NASA Astrophysics Data System (ADS)

Taki, Mehrdad; Heshmati, Milad

2017-09-01

This paper presents a new transmission scheme for a decode and forward (DF) relay network using continuous power adaptation while independent average power constraints are provisioned for each node. To have analytical insight, the achievable throughputs are analysed using continuous adaptation of the rates and the powers. As shown by numerical evaluations, a considerable outperformance is seen by continuous power adaptation compared to the case where constant powers are utilised. Also for practical systems, a new throughput maximised transmission scheme is developed using discrete rate adaptation (adaptive modulation and coding) and continuous transmission power adaptation. First a 2-hop relay network is considered and then the scheme is extended for an N-hop network. Numerical evaluations show the efficiency of the designed schemes.

Efficacy of an artificial neural network-based approach to endoscopic ultrasound elastography in diagnosis of focal pancreatic masses.

PubMed

Săftoiu, Adrian; Vilmann, Peter; Gorunescu, Florin; Janssen, Jan; Hocke, Michael; Larsen, Michael; Iglesias-Garcia, Julio; Arcidiacono, Paolo; Will, Uwe; Giovannini, Marc; Dietrich, Cristoph F; Havre, Roald; Gheorghe, Cristian; McKay, Colin; Gheonea, Dan Ionuţ; Ciurea, Tudorel

2012-01-01

By using strain assessment, real-time endoscopic ultrasound (EUS) elastography provides additional information about a lesion's characteristics in the pancreas. We assessed the accuracy of real-time EUS elastography in focal pancreatic lesions using computer-aided diagnosis by artificial neural network analysis. We performed a prospective, blinded, multicentric study at of 258 patients (774 recordings from EUS elastography) who were diagnosed with chronic pancreatitis (n = 47) or pancreatic adenocarcinoma (n = 211) from 13 tertiary academic medical centers in Europe (the European EUS Elastography Multicentric Study Group). We used postprocessing software analysis to compute individual frames of elastography movies recorded by retrieving hue histogram data from a dynamic sequence of EUS elastography into a numeric matrix. The data then were analyzed in an extended neural network analysis, to automatically differentiate benign from malignant patterns. The neural computing approach had 91.14% training accuracy (95% confidence interval [CI], 89.87%-92.42%) and 84.27% testing accuracy (95% CI, 83.09%-85.44%). These results were obtained using the 10-fold cross-validation technique. The statistical analysis of the classification process showed a sensitivity of 87.59%, a specificity of 82.94%, a positive predictive value of 96.25%, and a negative predictive value of 57.22%. Moreover, the corresponding area under the receiver operating characteristic curve was 0.94 (95% CI, 0.91%-0.97%), which was significantly higher than the values obtained by simple mean hue histogram analysis, for which the area under the receiver operating characteristic was 0.85. Use of the artificial intelligence methodology via artificial neural networks supports the medical decision process, providing fast and accurate diagnoses. Copyright © 2012 AGA Institute. Published by Elsevier Inc. All rights reserved.

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.

Granger causality network reconstruction of conductance-based integrate-and-fire neuronal systems.

PubMed

Zhou, Douglas; Xiao, Yanyang; Zhang, Yaoyu; Xu, Zhiqin; Cai, David

2014-01-01

Reconstruction of anatomical connectivity from measured dynamical activities of coupled neurons is one of the fundamental issues in the understanding of structure-function relationship of neuronal circuitry. Many approaches have been developed to address this issue based on either electrical or metabolic data observed in experiment. The Granger causality (GC) analysis remains one of the major approaches to explore the dynamical causal connectivity among individual neurons or neuronal populations. However, it is yet to be clarified how such causal connectivity, i.e., the GC connectivity, can be mapped to the underlying anatomical connectivity in neuronal networks. We perform the GC analysis on the conductance-based integrate-and-fire (I&F) neuronal networks to obtain their causal connectivity. Through numerical experiments, we find that the underlying synaptic connectivity amongst individual neurons or subnetworks, can be successfully reconstructed by the GC connectivity constructed from voltage time series. Furthermore, this reconstruction is insensitive to dynamical regimes and can be achieved without perturbing systems and prior knowledge of neuronal model parameters. Surprisingly, the synaptic connectivity can even be reconstructed by merely knowing the raster of systems, i.e., spike timing of neurons. Using spike-triggered correlation techniques, we establish a direct mapping between the causal connectivity and the synaptic connectivity for the conductance-based I&F neuronal networks, and show the GC is quadratically related to the coupling strength. The theoretical approach we develop here may provide a framework for examining the validity of the GC analysis in other settings.

Granger Causality Network Reconstruction of Conductance-Based Integrate-and-Fire Neuronal Systems

PubMed Central

Zhou, Douglas; Xiao, Yanyang; Zhang, Yaoyu; Xu, Zhiqin; Cai, David

2014-01-01

Reconstruction of anatomical connectivity from measured dynamical activities of coupled neurons is one of the fundamental issues in the understanding of structure-function relationship of neuronal circuitry. Many approaches have been developed to address this issue based on either electrical or metabolic data observed in experiment. The Granger causality (GC) analysis remains one of the major approaches to explore the dynamical causal connectivity among individual neurons or neuronal populations. However, it is yet to be clarified how such causal connectivity, i.e., the GC connectivity, can be mapped to the underlying anatomical connectivity in neuronal networks. We perform the GC analysis on the conductance-based integrate-and-fire (IF) neuronal networks to obtain their causal connectivity. Through numerical experiments, we find that the underlying synaptic connectivity amongst individual neurons or subnetworks, can be successfully reconstructed by the GC connectivity constructed from voltage time series. Furthermore, this reconstruction is insensitive to dynamical regimes and can be achieved without perturbing systems and prior knowledge of neuronal model parameters. Surprisingly, the synaptic connectivity can even be reconstructed by merely knowing the raster of systems, i.e., spike timing of neurons. Using spike-triggered correlation techniques, we establish a direct mapping between the causal connectivity and the synaptic connectivity for the conductance-based IF neuronal networks, and show the GC is quadratically related to the coupling strength. The theoretical approach we develop here may provide a framework for examining the validity of the GC analysis in other settings. PMID:24586285

Meeting the challenge of funding and allocating resources to mental health across Europe: developing the Mental Health Economics European Network.

PubMed

McDaid, David; Knapp, Martin; Curran, Claire

2006-01-01

There is growing demand for economic analysis to support strategic decision-making for mental health but the availability of economic evidence, in particular on system performance remains limited. The Mental Health Economics European Network (MHEEN) was set up in 2002 with the broad objective of developing a base for mental health economics information and subsequent work in 17 countries. Data on financing, expenditure and costs, provision of services, workforce, employment and capacity for economic evaluation were collected through bespoke questionnaires developed iteratively by the Network. This was augmented by a literature review and analysis of international databases. Findings on financing alone suggest that in many European countries mental health appears to be neglected while mechanisms for resource allocation are rarely linked to objective measure of population mental health needs. Numerous economic barriers and potential solutions were identified. Economic incentives may be one way of promoting change, although there is no 'one size fits all solution. There are significant benefits and synergies to be gained from the continuing development of networks such as MHEEN. In particular the analysis can be used to inform developments in Central and Eastern Europe. For instance there is much that can be learnt on both how the balance of care between institutional and non-institutional care has changed and on the role played by economic incentives in ensuring that resources were used to develop alternative community-based systems.