Discrete-event simulation of a wide-area health care network.

PubMed Central

McDaniel, J G

1995-01-01

OBJECTIVE: Predict the behavior and estimate the telecommunication cost of a wide-area message store-and-forward network for health care providers that uses the telephone system. DESIGN: A tool with which to perform large-scale discrete-event simulations was developed. Network models for star and mesh topologies were constructed to analyze the differences in performances and telecommunication costs. The distribution of nodes in the network models approximates the distribution of physicians, hospitals, medical labs, and insurers in the Province of Saskatchewan, Canada. Modeling parameters were based on measurements taken from a prototype telephone network and a survey conducted at two medical clinics. Simulation studies were conducted for both topologies. RESULTS: For either topology, the telecommunication cost of a network in Saskatchewan is projected to be less than $100 (Canadian) per month per node. The estimated telecommunication cost of the star topology is approximately half that of the mesh. Simulations predict that a mean end-to-end message delivery time of two hours or less is achievable at this cost. A doubling of the data volume results in an increase of less than 50% in the mean end-to-end message transfer time. CONCLUSION: The simulation models provided an estimate of network performance and telecommunication cost in a specific Canadian province. At the expected operating point, network performance appeared to be relatively insensitive to increases in data volume. Similar results might be anticipated in other rural states and provinces in North America where a telephone-based network is desired. PMID:7583646

Simulation of Lunar Surface Communications Network Exploration Scenarios

NASA Technical Reports Server (NTRS)

Linsky, Thomas W.; Bhasin, Kul B.; White, Alex; Palangala, Srihari

2006-01-01

Simulations and modeling of surface-based communications networks provides a rapid and cost effective means of requirement analysis, protocol assessments, and tradeoff studies. Robust testing in especially important for exploration systems, where the cost of deployment is high and systems cannot be easily replaced or repaired. However, simulation of the envisioned exploration networks cannot be achieved using commercial off the shelf network simulation software. Models for the nonstandard, non-COTS protocols used aboard space systems are not readily available. This paper will address the simulation of realistic scenarios representative of the activities which will take place on the surface of the Moon, including selection of candidate network architectures, and the development of an integrated simulation tool using OPNET modeler capable of faithfully modeling those communications scenarios in the variable delay, dynamic surface environments. Scenarios for exploration missions, OPNET development, limitations, and simulations results will be provided and discussed.

Simulating Social Networks of Online Communities: Simulation as a Method for Sociability Design

NASA Astrophysics Data System (ADS)

Ang, Chee Siang; Zaphiris, Panayiotis

We propose the use of social simulations to study and support the design of online communities. In this paper, we developed an Agent-Based Model (ABM) to simulate and study the formation of social networks in a Massively Multiplayer Online Role Playing Game (MMORPG) guild community. We first analyzed the activities and the social network (who-interacts-with-whom) of an existing guild community to identify its interaction patterns and characteristics. Then, based on the empirical results, we derived and formalized the interaction rules, which were implemented in our simulation. Using the simulation, we reproduced the observed social network of the guild community as a means of validation. The simulation was then used to examine how various parameters of the community (e.g. the level of activity, the number of neighbors of each agent, etc) could potentially influence the characteristic of the social networks.

Simulation of Foam Divot Weight on External Tank Utilizing Least Squares and Neural Network Methods

NASA Technical Reports Server (NTRS)

Chamis, Christos C.; Coroneos, Rula M.

2007-01-01

Simulation of divot weight in the insulating foam, associated with the external tank of the U.S. space shuttle, has been evaluated using least squares and neural network concepts. The simulation required models based on fundamental considerations that can be used to predict under what conditions voids form, the size of the voids, and subsequent divot ejection mechanisms. The quadratic neural networks were found to be satisfactory for the simulation of foam divot weight in various tests associated with the external tank. Both linear least squares method and the nonlinear neural network predicted identical results.

A discrete event simulation model for evaluating the performances of an m/g/c/c state dependent queuing system.

PubMed

Khalid, Ruzelan; Nawawi, Mohd Kamal M; Kawsar, Luthful A; Ghani, Noraida A; Kamil, Anton A; Mustafa, Adli

2013-01-01

M/G/C/C state dependent queuing networks consider service rates as a function of the number of residing entities (e.g., pedestrians, vehicles, and products). However, modeling such dynamic rates is not supported in modern Discrete Simulation System (DES) software. We designed an approach to cater this limitation and used it to construct the M/G/C/C state-dependent queuing model in Arena software. Using the model, we have evaluated and analyzed the impacts of various arrival rates to the throughput, the blocking probability, the expected service time and the expected number of entities in a complex network topology. Results indicated that there is a range of arrival rates for each network where the simulation results fluctuate drastically across replications and this causes the simulation results and analytical results exhibit discrepancies. Detail results that show how tally the simulation results and the analytical results in both abstract and graphical forms and some scientific justifications for these have been documented and discussed.

Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers.

PubMed

Jordan, Jakob; Ippen, Tammo; Helias, Moritz; Kitayama, Itaru; Sato, Mitsuhisa; Igarashi, Jun; Diesmann, Markus; Kunkel, Susanne

2018-01-01

State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems.

Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers

PubMed Central

Jordan, Jakob; Ippen, Tammo; Helias, Moritz; Kitayama, Itaru; Sato, Mitsuhisa; Igarashi, Jun; Diesmann, Markus; Kunkel, Susanne

2018-01-01

State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems. PMID:29503613

Wealth distribution on complex networks

NASA Astrophysics Data System (ADS)

Ichinomiya, Takashi

2012-12-01

We study the wealth distribution of the Bouchaud-Mézard model on complex networks. It is known from numerical simulations that this distribution depends on the topology of the network; however, no one has succeeded in explaining it. Using “adiabatic” and “independent” assumptions along with the central-limit theorem, we derive equations that determine the probability distribution function. The results are compared to those of simulations for various networks. We find good agreement between our theory and the simulations, except for the case of Watts-Strogatz networks with a low rewiring rate due to the breakdown of independent assumption.

Thin-Film Nanowire Networks for Transparent Conductor Applications: Simulations of Sheet Resistance and Percolation Thresholds

NASA Astrophysics Data System (ADS)

Winey, Karen I.; Mutiso, Rose M.; Sherrott, Michelle C.; Rathmell, Aaron R.; Wiley, Benjamin J.

2013-03-01

Thin-film metal nanowire networks are being pursued as a viable alternative to the expensive and brittle indium tin oxide (ITO) for transparent conductors. For high performance applications, nanowire networks must exhibit high transmittance at low sheet resistance. Previously, we have used complimentary experimental, simulation and theoretical techniques to explore the effects of filler aspect ratio (L/D), orientation, and size-dispersity on the electrical conductivity of three-dimensional rod-networks in bulk polymer nanocomposites. We adapted our 3D simulation approach and analytical percolation model to study the electrical properties of thin-film rod-networks. By fitting our simulation results to experimental results, we determined the average effective contact resistance between silver nanowires. This contact resistance was then used to quantify how the sheet resistance depends on the aspect ratio of the rods and to show that networks made of nanowires with L/D greater than 100 yield sheet resistances lower than the required 100 Ohm/sq. We also report the critical area fraction of rods required to form a percolated network in thin-film networks and provide an analytical expression for the critical area fraction as a function of L/D.

On the Simulation-Based Reliability of Complex Emergency Logistics Networks in Post-Accident Rescues.

PubMed

Wang, Wei; Huang, Li; Liang, Xuedong

2018-01-06

This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks' statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies.

A neural-network-based model for the dynamic simulation of the tire/suspension system while traversing road irregularities.

PubMed

Guarneri, Paolo; Rocca, Gianpiero; Gobbi, Massimiliano

2008-09-01

This paper deals with the simulation of the tire/suspension dynamics by using recurrent neural networks (RNNs). RNNs are derived from the multilayer feedforward neural networks, by adding feedback connections between output and input layers. The optimal network architecture derives from a parametric analysis based on the optimal tradeoff between network accuracy and size. The neural network can be trained with experimental data obtained in the laboratory from simulated road profiles (cleats). The results obtained from the neural network demonstrate good agreement with the experimental results over a wide range of operation conditions. The NN model can be effectively applied as a part of vehicle system model to accurately predict elastic bushings and tire dynamics behavior. Although the neural network model, as a black-box model, does not provide a good insight of the physical behavior of the tire/suspension system, it is a useful tool for assessing vehicle ride and noise, vibration, harshness (NVH) performance due to its good computational efficiency and accuracy.

Computational study of noise in a large signal transduction network.

PubMed

Intosalmi, Jukka; Manninen, Tiina; Ruohonen, Keijo; Linne, Marja-Leena

2011-06-21

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

Reconfigurable Control with Neural Network Augmentation for a Modified F-15 Aircraft

NASA Technical Reports Server (NTRS)

Burken, John J.; Williams-Hayes, Peggy; Kaneshige, John T.; Stachowiak, Susan J.

2006-01-01

Description of the performance of a simplified dynamic inversion controller with neural network augmentation follows. Simulation studies focus on the results with and without neural network adaptation through the use of an F-15 aircraft simulator that has been modified to include canards. Simulated control law performance with a surface failure, in addition to an aerodynamic failure, is presented. The aircraft, with adaptation, attempts to minimize the inertial cross-coupling effect of the failure (a control derivative anomaly associated with a jammed control surface). The dynamic inversion controller calculates necessary surface commands to achieve desired rates. The dynamic inversion controller uses approximate short period and roll axis dynamics. The yaw axis controller is a sideslip rate command system. Methods are described to reduce the cross-coupling effect and maintain adequate tracking errors for control surface failures. The aerodynamic failure destabilizes the pitching moment due to angle of attack. The results show that control of the aircraft with the neural networks is easier (more damped) than without the neural networks. Simulation results show neural network augmentation of the controller improves performance with aerodynamic and control surface failures in terms of tracking error and cross-coupling reduction.

Adaptive Control Using Neural Network Augmentation for a Modified F-15 Aircraft

NASA Technical Reports Server (NTRS)

Burken, John J.; Williams-Hayes, Peggy; Karneshige, J. T.; Stachowiak, Susan J.

2006-01-01

Description of the performance of a simplified dynamic inversion controller with neural network augmentation follows. Simulation studies focus on the results with and without neural network adaptation through the use of an F-15 aircraft simulator that has been modified to include canards. Simulated control law performance with a surface failure, in addition to an aerodynamic failure, is presented. The aircraft, with adaptation, attempts to minimize the inertial cross-coupling effect of the failure (a control derivative anomaly associated with a jammed control surface). The dynamic inversion controller calculates necessary surface commands to achieve desired rates. The dynamic inversion controller uses approximate short period and roll axis dynamics. The yaw axis controller is a sideslip rate command system. Methods are described to reduce the cross-coupling effect and maintain adequate tracking errors for control surface failures. The aerodynamic failure destabilizes the pitching moment due to angle of attack. The results show that control of the aircraft with the neural networks is easier (more damped) than without the neural networks. Simulation results show neural network augmentation of the controller improves performance with aerodynamic and control surface failures in terms of tracking error and cross-coupling reduction.

A Flexible System for Simulating Aeronautical Telecommunication Network

NASA Technical Reports Server (NTRS)

Maly, Kurt; Overstreet, C. M.; Andey, R.

1998-01-01

At Old Dominion University, we have built Aeronautical Telecommunication Network (ATN) Simulator with NASA being the fund provider. It provides a means to evaluate the impact of modified router scheduling algorithms on the network efficiency, to perform capacity studies on various network topologies and to monitor and study various aspects of ATN through graphical user interface (GUI). In this paper we describe briefly about the proposed ATN model and our abstraction of this model. Later we describe our simulator architecture highlighting some of the design specifications, scheduling algorithms and user interface. At the end, we have provided the results of performance studies on this simulator.

Earth-Mars Telecommunications and Information Management System (TIMS): Antenna Visibility Determination, Network Simulation, and Management Models

NASA Technical Reports Server (NTRS)

Odubiyi, Jide; Kocur, David; Pino, Nino; Chu, Don

1996-01-01

This report presents the results of our research on Earth-Mars Telecommunications and Information Management System (TIMS) network modeling and unattended network operations. The primary focus of our research is to investigate the feasibility of the TIMS architecture, which links the Earth-based Mars Operations Control Center, Science Data Processing Facility, Mars Network Management Center, and the Deep Space Network of antennae to the relay satellites and other communication network elements based in the Mars region. The investigation was enhanced by developing Build 3 of the TIMS network modeling and simulation model. The results of several 'what-if' scenarios are reported along with reports on upgraded antenna visibility determination software and unattended network management prototype.

Reconfigurable Control with Neural Network Augmentation for a Modified F-15 Aircraft

NASA Technical Reports Server (NTRS)

Burken, John J.

2007-01-01

This paper describes the performance of a simplified dynamic inversion controller with neural network supplementation. This 6 DOF (Degree-of-Freedom) simulation study focuses on the results with and without adaptation of neural networks using a simulation of the NASA modified F-15 which has canards. One area of interest is the performance of a simulated surface failure while attempting to minimize the inertial cross coupling effect of a [B] matrix failure (a control derivative anomaly associated with a jammed or missing control surface). Another area of interest and presented is simulated aerodynamic failures ([A] matrix) such as a canard failure. The controller uses explicit models to produce desired angular rate commands. The dynamic inversion calculates the necessary surface commands to achieve the desired rates. The simplified dynamic inversion uses approximate short period and roll axis dynamics. Initial results indicated that the transient response for a [B] matrix failure using a Neural Network (NN) improved the control behavior when compared to not using a neural network for a given failure, However, further evaluation of the controller was comparable, with objections io the cross coupling effects (after changes were made to the controller). This paper describes the methods employed to reduce the cross coupling effect and maintain adequate tracking errors. The IA] matrix failure results show that control of the aircraft without adaptation is more difficult [leas damped) than with active neural networks, Simulation results show Neural Network augmentation of the controller improves performance in terms of backing error and cross coupling reduction and improved performance with aerodynamic-type failures.

Performance evaluation of power control algorithms in wireless cellular networks

NASA Astrophysics Data System (ADS)

Temaneh-Nyah, C.; Iita, V.

2014-10-01

Power control in a mobile communication network intents to control the transmission power levels in such a way that the required quality of service (QoS) for the users is guaranteed with lowest possible transmission powers. Most of the studies of power control algorithms in the literature are based on some kind of simplified assumptions which leads to compromise in the validity of the results when applied in a real environment. In this paper, a CDMA network was simulated. The real environment was accounted for by defining the analysis area and the network base stations and mobile stations are defined by their geographical coordinates, the mobility of the mobile stations is accounted for. The simulation also allowed for a number of network parameters including the network traffic, and the wireless channel models to be modified. Finally, we present the simulation results of a convergence speed based comparative analysis of three uplink power control algorithms.

Development of a Neural Network Simulator for Studying the Constitutive Behavior of Structural Composite Materials

DOE PAGES

Na, Hyuntae; Lee, Seung-Yub; Üstündag, Ersan; ...

2013-01-01

This paper introduces a recent development and application of a noncommercial artificial neural network (ANN) simulator with graphical user interface (GUI) to assist in rapid data modeling and analysis in the engineering diffraction field. The real-time network training/simulation monitoring tool has been customized for the study of constitutive behavior of engineering materials, and it has improved data mining and forecasting capabilities of neural networks. This software has been used to train and simulate the finite element modeling (FEM) data for a fiber composite system, both forward and inverse. The forward neural network simulation precisely reduplicates FEM results several orders ofmore » magnitude faster than the slow original FEM. The inverse simulation is more challenging; yet, material parameters can be meaningfully determined with the aid of parameter sensitivity information. The simulator GUI also reveals that output node size for materials parameter and input normalization method for strain data are critical train conditions in inverse network. The successful use of ANN modeling and simulator GUI has been validated through engineering neutron diffraction experimental data by determining constitutive laws of the real fiber composite materials via a mathematically rigorous and physically meaningful parameter search process, once the networks are successfully trained from the FEM database.« less

On the Simulation-Based Reliability of Complex Emergency Logistics Networks in Post-Accident Rescues

PubMed Central

Wang, Wei; Huang, Li; Liang, Xuedong

2018-01-01

This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks’ statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies. PMID:29316614

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

NASA Astrophysics Data System (ADS)

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

2016-07-01

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

MATLAB Simulation of Gradient-Based Neural Network for Online Matrix Inversion

NASA Astrophysics Data System (ADS)

Zhang, Yunong; Chen, Ke; Ma, Weimu; Li, Xiao-Dong

This paper investigates the simulation of a gradient-based recurrent neural network for online solution of the matrix-inverse problem. Several important techniques are employed as follows to simulate such a neural system. 1) Kronecker product of matrices is introduced to transform a matrix-differential-equation (MDE) to a vector-differential-equation (VDE); i.e., finally, a standard ordinary-differential-equation (ODE) is obtained. 2) MATLAB routine "ode45" is introduced to solve the transformed initial-value ODE problem. 3) In addition to various implementation errors, different kinds of activation functions are simulated to show the characteristics of such a neural network. Simulation results substantiate the theoretical analysis and efficacy of the gradient-based neural network for online constant matrix inversion.

Parallel discrete-event simulation of FCFS stochastic queueing networks

NASA Technical Reports Server (NTRS)

Nicol, David M.

1988-01-01

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

Abductive networks applied to electronic combat

NASA Astrophysics Data System (ADS)

Montgomery, Gerard J.; Hess, Paul; Hwang, Jong S.

1990-08-01

A practical approach to dealing with combinatorial decision problems and uncertainties associated with electronic combat through the use of networks of high-level functional elements called abductive networks is presented. It describes the application of the Abductory Induction Mechanism (AIMTM) a supervised inductive learning tool for synthesizing polynomial abductive networks to the electronic combat problem domain. From databases of historical expert-generated or simulated combat engagements AIM can often induce compact and robust network models for making effective real-time electronic combat decisions despite significant uncertainties or a combinatorial explosion of possible situations. The feasibility of applying abductive networks to realize advanced combat decision aiding capabilities was demonstrated by applying AIM to a set of electronic combat simulations. The networks synthesized by AIM generated accurate assessments of the intent lethality and overall risk associated with a variety of simulated threats and produced reasonable estimates of the expected effectiveness of a group of electronic countermeasures for a large number of simulated combat scenarios. This paper presents the application of abductive networks to electronic combat summarizes the results of experiments performed using AIM discusses the benefits and limitations of applying abductive networks to electronic combat and indicates why abductive networks can often result in capabilities not attainable using alternative approaches. 1. ELECTRONIC COMBAT. UNCERTAINTY. AND MACHINE LEARNING Electronic combat has become an essential part of the ability to make war and has become increasingly complex since

A Discrete Event Simulation Model for Evaluating the Performances of an M/G/C/C State Dependent Queuing System

PubMed Central

Khalid, Ruzelan; M. Nawawi, Mohd Kamal; Kawsar, Luthful A.; Ghani, Noraida A.; Kamil, Anton A.; Mustafa, Adli

2013-01-01

M/G/C/C state dependent queuing networks consider service rates as a function of the number of residing entities (e.g., pedestrians, vehicles, and products). However, modeling such dynamic rates is not supported in modern Discrete Simulation System (DES) software. We designed an approach to cater this limitation and used it to construct the M/G/C/C state-dependent queuing model in Arena software. Using the model, we have evaluated and analyzed the impacts of various arrival rates to the throughput, the blocking probability, the expected service time and the expected number of entities in a complex network topology. Results indicated that there is a range of arrival rates for each network where the simulation results fluctuate drastically across replications and this causes the simulation results and analytical results exhibit discrepancies. Detail results that show how tally the simulation results and the analytical results in both abstract and graphical forms and some scientific justifications for these have been documented and discussed. PMID:23560037

Effective Utilization of Commercial Wireless Networking Technology in Planetary Environments

NASA Technical Reports Server (NTRS)

Caulev, Michael (Technical Monitor); Phillip, DeLeon; Horan, Stephen; Borah, Deva; Lyman, Ray

2005-01-01

The purpose of this research is to investigate the use of commercial, off-the-shelf wireless networking technology in planetary exploration applications involving rovers and sensor webs. The three objectives of this research project are to: 1) simulate the radio frequency environment of proposed landing sites on Mars using actual topographic data, 2) analyze the performance of current wireless networking standards in the simulated radio frequency environment, and 3) propose modifications to the standards for more efficient utilization. In this annual report, we present our results for the second year of research. During this year, the effort has focussed on the second objective of analyzing the performance of the IEEE 802.11a and IEEE 802.1lb wireless networking standards in the simulated radio frequency environment of Mars. The approach builds upon our previous results which deterministically modelled the RF environment at selected sites on Mars using high-resolution topographical data. These results provide critical information regarding antenna coverage patterns, maximum link distances, effects of surface clutter, and multipath effects. Using these previous results, the physical layer of these wireless networking standards has now been simulated and analyzed in the Martian environment. We are looking to extending these results to the and medium access layer next. Our results give us critical information regarding the performance (data rates, packet error rates, link distances, etc.) of IEEE 802.1 la/b wireless networks. This information enables a critical examination of how these wireless networks may be utilized in future Mars missions and how they may be possibly modified for more optimal usage.

A Systems Approach to Scalable Transportation Network Modeling

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

Perumalla, Kalyan S

2006-01-01

Emerging needs in transportation network modeling and simulation are raising new challenges with respect to scal-ability of network size and vehicular traffic intensity, speed of simulation for simulation-based optimization, and fidel-ity of vehicular behavior for accurate capture of event phe-nomena. Parallel execution is warranted to sustain the re-quired detail, size and speed. However, few parallel simulators exist for such applications, partly due to the challenges underlying their development. Moreover, many simulators are based on time-stepped models, which can be computationally inefficient for the purposes of modeling evacuation traffic. Here an approach is presented to de-signing a simulator with memory andmore » speed efficiency as the goals from the outset, and, specifically, scalability via parallel execution. The design makes use of discrete event modeling techniques as well as parallel simulation meth-ods. Our simulator, called SCATTER, is being developed, incorporating such design considerations. Preliminary per-formance results are presented on benchmark road net-works, showing scalability to one million vehicles simu-lated on one processor.« less

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.

Simulation of Electromigration Based on Resistor Networks

NASA Astrophysics Data System (ADS)

Patrinos, Anthony John

A two dimensional computer simulation of electromigration based on resistor networks was designed and implemented. The model utilizes a realistic grain structure generated by the Monte Carlo method and takes specific account of the local effects through which electromigration damage progresses. The dynamic evolution of the simulated thin film is governed by the local current and temperature distributions. The current distribution is calculated by superimposing a two dimensional electrical network on the lattice whose nodes correspond to the particles in the lattice and the branches to interparticle bonds. Current is assumed to flow from site to site via nearest neighbor bonds. The current distribution problem is solved by applying Kirchhoff's rules on the resulting electrical network. The calculation of the temperature distribution in the lattice proceeds by discretizing the partial differential equation for heat conduction, with appropriate material parameters chosen for the lattice and its defects. SEReNe (for Simulation of Electromigration using Resistor Networks) was tested by applying it to common situations arising in experiments with real films with satisfactory results. Specifically, the model successfully reproduces the expected grain size, line width and bamboo effects, the lognormal failure time distribution and the relationship between current density exponent and current density. It has also been modified to simulate temperature ramp experiments but with mixed, in this case, results.

Underwater Electromagnetic Sensor Networks, Part II: Localization and Network Simulations

PubMed Central

Zazo, Javier; Valcarcel Macua, Sergio; Zazo, Santiago; Pérez, Marina; Pérez-Álvarez, Iván; Jiménez, Eugenio; Cardona, Laura; Brito, Joaquín Hernández; Quevedo, Eduardo

2016-01-01

In the first part of the paper, we modeled and characterized the underwater radio channel in shallow waters. In the second part, we analyze the application requirements for an underwater wireless sensor network (U-WSN) operating in the same environment and perform detailed simulations. We consider two localization applications, namely self-localization and navigation aid, and propose algorithms that work well under the specific constraints associated with U-WSN, namely low connectivity, low data rates and high packet loss probability. We propose an algorithm where the sensor nodes collaboratively estimate their unknown positions in the network using a low number of anchor nodes and distance measurements from the underwater channel. Once the network has been self-located, we consider a node estimating its position for underwater navigation communicating with neighboring nodes. We also propose a communication system and simulate the whole electromagnetic U-WSN in the Castalia simulator to evaluate the network performance, including propagation impairments (e.g., noise, interference), radio parameters (e.g., modulation scheme, bandwidth, transmit power), hardware limitations (e.g., clock drift, transmission buffer) and complete MAC and routing protocols. We also explain the changes that have to be done to Castalia in order to perform the simulations. In addition, we propose a parametric model of the communication channel that matches well with the results from the first part of this paper. Finally, we provide simulation results for some illustrative scenarios. PMID:27999309

Disease dynamics in a dynamic social network

NASA Astrophysics Data System (ADS)

Christensen, Claire; Albert, István; Grenfell, Bryan; Albert, Réka

2010-07-01

We develop a framework for simulating a realistic, evolving social network (a city) into which a disease is introduced. We compare our results to prevaccine era measles data for England and Wales, and find that they capture the quantitative and qualitative features of epidemics in populations spanning two orders of magnitude. Our results provide unique insight into how and why the social topology of the contact network influences the propagation of the disease through the population. We argue that network simulation is suitable for concurrently probing contact network dynamics and disease dynamics in ways that prior modeling approaches cannot and it can be extended to the study of less well-documented diseases.

Centralized Networks to Generate Human Body Motions

PubMed Central

Vakulenko, Sergei; Radulescu, Ovidiu; Morozov, Ivan

2017-01-01

We consider continuous-time recurrent neural networks as dynamical models for the simulation of human body motions. These networks consist of a few centers and many satellites connected to them. The centers evolve in time as periodical oscillators with different frequencies. The center states define the satellite neurons’ states by a radial basis function (RBF) network. To simulate different motions, we adjust the parameters of the RBF networks. Our network includes a switching module that allows for turning from one motion to another. Simulations show that this model allows us to simulate complicated motions consisting of many different dynamical primitives. We also use the model for learning human body motion from markers’ trajectories. We find that center frequencies can be learned from a small number of markers and can be transferred to other markers, such that our technique seems to be capable of correcting for missing information resulting from sparse control marker settings. PMID:29240694

Centralized Networks to Generate Human Body Motions.

PubMed

Vakulenko, Sergei; Radulescu, Ovidiu; Morozov, Ivan; Weber, Andres

2017-12-14

We consider continuous-time recurrent neural networks as dynamical models for the simulation of human body motions. These networks consist of a few centers and many satellites connected to them. The centers evolve in time as periodical oscillators with different frequencies. The center states define the satellite neurons' states by a radial basis function (RBF) network. To simulate different motions, we adjust the parameters of the RBF networks. Our network includes a switching module that allows for turning from one motion to another. Simulations show that this model allows us to simulate complicated motions consisting of many different dynamical primitives. We also use the model for learning human body motion from markers' trajectories. We find that center frequencies can be learned from a small number of markers and can be transferred to other markers, such that our technique seems to be capable of correcting for missing information resulting from sparse control marker settings.

Traffic Adaptive Energy Efficient and Low Latency Medium Access Control for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Yadav, Rajesh; Varma, Shirshu; Malaviya, N.

2008-05-01

Medium access control for wireless sensor networks has been a very active research area in the recent years. The traditional wireless medium access control protocol such as IEEE 802.11 is not suitable for the sensor network application because these are battery powered. The recharging of these sensor nodes is expensive and also not possible. The most of the literature in the medium access for the sensor network focuses on the energy efficiency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control packet overhead and overhearing taking nodes latency into consideration based on the network traffic. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach. The validation of the simulation results of the proposed MAC has been done by comparing it with the analytical model. This protocol has been simulated in Network Simulator ns-2.

Enhancing the Simulation Speed of Sensor Network Applications by Asynchronization of Interrupt Service Routines

PubMed Central

Joe, Hyunwoo; Woo, Duk-Kyun; Kim, Hyungshin

2013-01-01

Sensor network simulations require high fidelity and timing accuracy to be used as an implementation and evaluation tool. The cycle-accurate and instruction-level simulator is the known solution for these purposes. However, this type of simulation incurs a high computation cost since it has to model not only the instruction level behavior but also the synchronization between multiple sensors for their causality. This paper presents a novel technique that exploits asynchronous simulations of interrupt service routines (ISR). We can avoid the synchronization overheads when the interrupt service routines are simulated without preemption. If the causality errors occur, we devise a rollback procedure to restore the original synchronized simulation. This concept can be extended to any instruction-level sensor network simulator. Evaluation results show our method can enhance the simulation speed up to 52% in the case of our experiments. For applications with longer interrupt service routines and smaller number of preemptions, the speedup becomes greater. In addition, our simulator is 2 to 11 times faster than the well-known sensor network simulator. PMID:23966200

Association, roost use and simulated disruption of Myotis septentrionalis maternity colonies

USGS Publications Warehouse

Silvis, Alexander; Ford, W. Mark; Britzke, Eric R.; Johnson, Joshua B.

2014-01-01

How wildlife social and resource networks are distributed on the landscape and how animals respond to resource loss are important aspects of behavioral ecology. For bats, understanding these responses may improve conservation efforts and provide insights into adaptations to environmental conditions. We tracked maternity colonies of northern bats (Myotis septentrionalis) at Fort Knox, Kentucky, USA to evaluate their social and resource networks and space use. Roost and social network structure differed between maternity colonies. Overall roost availability did not appear to be strongly related to network characteristics or space use. In simulations for our two largest networks, roost removal was related linearly to network fragmentation; despite this, networks were relatively robust, requiring removal of >20% of roosts to cause network fragmentation. Results from our analyses indicate that northern bat behavior and space use may differ among colonies and potentially across the maternity season. Simulation results suggest that colony social structure is robust to fragmentation caused by random loss of small numbers of roosts. Flexible social dynamics and tolerance of roost loss may be adaptive strategies for coping with ephemeral conditions in dynamic forest habitats.

Towards Interactive Medical Content Delivery Between Simulated Body Sensor Networks and Practical Data Center.

PubMed

Shi, Xiaobo; Li, Wei; Song, Jeungeun; Hossain, M Shamim; Mizanur Rahman, Sk Md; Alelaiwi, Abdulhameed

2016-10-01

With the development of IoT (Internet of Thing), big data analysis and cloud computing, traditional medical information system integrates with these new technologies. The establishment of cloud-based smart healthcare application gets more and more attention. In this paper, semi-physical simulation technology is applied to cloud-based smart healthcare system. The Body sensor network (BSN) of system transmit has two ways of data collection and transmission. The one is using practical BSN to collect data and transmitting it to the data center. The other is transmitting real medical data to practical data center by simulating BSN. In order to transmit real medical data to practical data center by simulating BSN under semi-physical simulation environment, this paper designs an OPNET packet structure, defines a gateway node model between simulating BSN and practical data center and builds a custom protocol stack. Moreover, this paper conducts a large amount of simulation on the real data transmission through simulation network connecting with practical network. The simulation result can provides a reference for parameter settings of fully practical network and reduces the cost of devices and personnel involved.

Unfolding the neutron spectrum of a NE213 scintillator using artificial neural networks.

PubMed

Sharghi Ido, A; Bonyadi, M R; Etaati, G R; Shahriari, M

2009-10-01

Artificial neural networks technology has been applied to unfold the neutron spectra from the pulse height distribution measured with NE213 liquid scintillator. Here, both the single and multi-layer perceptron neural network models have been implemented to unfold the neutron spectrum from an Am-Be neutron source. The activation function and the connectivity of the neurons have been investigated and the results have been analyzed in terms of the network's performance. The simulation results show that the neural network that utilizes the Satlins transfer function has the best performance. In addition, omitting the bias connection of the neurons improve the performance of the network. Also, the SCINFUL code is used for generating the response functions in the training phase of the process. Finally, the results of the neural network simulation have been compared with those of the FORIST unfolding code for both (241)Am-Be and (252)Cf neutron sources. The results of neural network are in good agreement with FORIST code.

Exact Hybrid Particle/Population Simulation of Rule-Based Models of Biochemical Systems

PubMed Central

Stover, Lori J.; Nair, Niketh S.; Faeder, James R.

2014-01-01

Detailed modeling and simulation of biochemical systems is complicated by the problem of combinatorial complexity, an explosion in the number of species and reactions due to myriad protein-protein interactions and post-translational modifications. Rule-based modeling overcomes this problem by representing molecules as structured objects and encoding their interactions as pattern-based rules. This greatly simplifies the process of model specification, avoiding the tedious and error prone task of manually enumerating all species and reactions that can potentially exist in a system. From a simulation perspective, rule-based models can be expanded algorithmically into fully-enumerated reaction networks and simulated using a variety of network-based simulation methods, such as ordinary differential equations or Gillespie's algorithm, provided that the network is not exceedingly large. Alternatively, rule-based models can be simulated directly using particle-based kinetic Monte Carlo methods. This “network-free” approach produces exact stochastic trajectories with a computational cost that is independent of network size. However, memory and run time costs increase with the number of particles, limiting the size of system that can be feasibly simulated. Here, we present a hybrid particle/population simulation method that combines the best attributes of both the network-based and network-free approaches. The method takes as input a rule-based model and a user-specified subset of species to treat as population variables rather than as particles. The model is then transformed by a process of “partial network expansion” into a dynamically equivalent form that can be simulated using a population-adapted network-free simulator. The transformation method has been implemented within the open-source rule-based modeling platform BioNetGen, and resulting hybrid models can be simulated using the particle-based simulator NFsim. Performance tests show that significant memory savings can be achieved using the new approach and a monetary cost analysis provides a practical measure of its utility. PMID:24699269

Exact hybrid particle/population simulation of rule-based models of biochemical systems.

PubMed

Hogg, Justin S; Harris, Leonard A; Stover, Lori J; Nair, Niketh S; Faeder, James R

2014-04-01

Detailed modeling and simulation of biochemical systems is complicated by the problem of combinatorial complexity, an explosion in the number of species and reactions due to myriad protein-protein interactions and post-translational modifications. Rule-based modeling overcomes this problem by representing molecules as structured objects and encoding their interactions as pattern-based rules. This greatly simplifies the process of model specification, avoiding the tedious and error prone task of manually enumerating all species and reactions that can potentially exist in a system. From a simulation perspective, rule-based models can be expanded algorithmically into fully-enumerated reaction networks and simulated using a variety of network-based simulation methods, such as ordinary differential equations or Gillespie's algorithm, provided that the network is not exceedingly large. Alternatively, rule-based models can be simulated directly using particle-based kinetic Monte Carlo methods. This "network-free" approach produces exact stochastic trajectories with a computational cost that is independent of network size. However, memory and run time costs increase with the number of particles, limiting the size of system that can be feasibly simulated. Here, we present a hybrid particle/population simulation method that combines the best attributes of both the network-based and network-free approaches. The method takes as input a rule-based model and a user-specified subset of species to treat as population variables rather than as particles. The model is then transformed by a process of "partial network expansion" into a dynamically equivalent form that can be simulated using a population-adapted network-free simulator. The transformation method has been implemented within the open-source rule-based modeling platform BioNetGen, and resulting hybrid models can be simulated using the particle-based simulator NFsim. Performance tests show that significant memory savings can be achieved using the new approach and a monetary cost analysis provides a practical measure of its utility.

Dual Arm Work Package performance estimates and telerobot task network simulation

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

Draper, J.V.; Blair, L.M.

1997-02-01

This paper describes the methodology and results of a network simulation study of the Dual Arm Work Package (DAWP), to be employed for dismantling the Argonne National Laboratory CP-5 reactor. The development of the simulation model was based upon the results of a task analysis for the same system. This study was performed by the Oak Ridge National Laboratory (ORNL), in the Robotics and Process Systems Division. Funding was provided the US Department of Energy`s Office of Technology Development, Robotics Technology Development Program (RTDP). The RTDP is developing methods of computer simulation to estimate telerobotic system performance. Data were collectedmore » to provide point estimates to be used in a task network simulation model. Three skilled operators performed six repetitions of a pipe cutting task representative of typical teleoperation cutting operations.« less

Implementation of WirelessHART in the NS-2 Simulator and Validation of Its Correctness

PubMed Central

Zand, Pouria; Mathews, Emi; Havinga, Paul; Stojanovski, Spase; Sisinni, Emiliano; Ferrari, Paolo

2014-01-01

One of the first standards in the wireless sensor networks domain, WirelessHART (HART (Highway Addressable Remote Transducer)), was introduced to address industrial process automation and control requirements. This standard can be used as a reference point to evaluate other wireless protocols in the domain of industrial monitoring and control. This makes it worthwhile to set up a reliable WirelessHART simulator in order to achieve that reference point in a relatively easy manner. Moreover, it offers an alternative to expensive testbeds for testing and evaluating the performance of WirelessHART. This paper explains our implementation of WirelessHART in the NS-2 network simulator. According to our knowledge, this is the first implementation that supports the WirelessHART network manager, as well as the whole stack (all OSI (Open Systems Interconnection model) layers) of the WirelessHART standard. It also explains our effort to validate the correctness of our implementation, namely through the validation of the implementation of the WirelessHART stack protocol and of the network manager. We use sniffed traffic from a real WirelessHART testbed installed in the Idrolab plant for these validations. This confirms the validity of our simulator. Empirical analysis shows that the simulated results are nearly comparable to the results obtained from real networks. We also demonstrate the versatility and usability of our implementation by providing some further evaluation results in diverse scenarios. For example, we evaluate the performance of the WirelessHART network by applying incremental interference in a multi-hop network. PMID:24841245

Neural network simulation of the atmospheric point spread function for the adjacency effect research

NASA Astrophysics Data System (ADS)

Ma, Xiaoshan; Wang, Haidong; Li, Ligang; Yang, Zhen; Meng, Xin

2016-10-01

Adjacency effect could be regarded as the convolution of the atmospheric point spread function (PSF) and the surface leaving radiance. Monte Carlo is a common method to simulate the atmospheric PSF. But it can't obtain analytic expression and the meaningful results can be only acquired by statistical analysis of millions of data. A backward Monte Carlo algorithm was employed to simulate photon emitting and propagating in the atmosphere under different conditions. The PSF was determined by recording the photon-receiving numbers in fixed bin at different position. A multilayer feed-forward neural network with a single hidden layer was designed to learn the relationship between the PSF's and the input condition parameters. The neural network used the back-propagation learning rule for training. Its input parameters involved atmosphere condition, spectrum range, observing geometry. The outputs of the network were photon-receiving numbers in the corresponding bin. Because the output units were too many to be allowed by neural network, the large network was divided into a collection of smaller ones. These small networks could be ran simultaneously on many workstations and/or PCs to speed up the training. It is important to note that the simulated PSF's by Monte Carlo technique in non-nadir viewing angles are more complicated than that in nadir conditions which brings difficulties in the design of the neural network. The results obtained show that the neural network approach could be very useful to compute the atmospheric PSF based on the simulated data generated by Monte Carlo method.

Information Diffusion in Facebook-Like Social Networks Under Information Overload

NASA Astrophysics Data System (ADS)

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

2013-07-01

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

Efficient evaluation of wireless real-time control networks.

PubMed

Horvath, Peter; Yampolskiy, Mark; Koutsoukos, Xenofon

2015-02-11

In this paper, we present a system simulation framework for the design and performance evaluation of complex wireless cyber-physical systems. We describe the simulator architecture and the specific developments that are required to simulate cyber-physical systems relying on multi-channel, multihop mesh networks. We introduce realistic and efficient physical layer models and a system simulation methodology, which provides statistically significant performance evaluation results with low computational complexity. The capabilities of the proposed framework are illustrated in the example of WirelessHART, a centralized, real-time, multi-hop mesh network designed for industrial control and monitor applications.

Simulating and Synthesizing Substructures Using Neural Network and Genetic Algorithms

NASA Technical Reports Server (NTRS)

Liu, Youhua; Kapania, Rakesh K.; VanLandingham, Hugh F.

1997-01-01

The feasibility of simulating and synthesizing substructures by computational neural network models is illustrated by investigating a statically indeterminate beam, using both a 1-D and a 2-D plane stress modelling. The beam can be decomposed into two cantilevers with free-end loads. By training neural networks to simulate the cantilever responses to different loads, the original beam problem can be solved as a match-up between two subsystems under compatible interface conditions. The genetic algorithms are successfully used to solve the match-up problem. Simulated results are found in good agreement with the analytical or FEM solutions.

Epidemic spreading in weighted networks: an edge-based mean-field solution.

PubMed

Yang, Zimo; Zhou, Tao

2012-05-01

Weight distribution greatly impacts the epidemic spreading taking place on top of networks. This paper presents a study of a susceptible-infected-susceptible model on regular random networks with different kinds of weight distributions. Simulation results show that the more homogeneous weight distribution leads to higher epidemic prevalence, which, unfortunately, could not be captured by the traditional mean-field approximation. This paper gives an edge-based mean-field solution for general weight distribution, which can quantitatively reproduce the simulation results. This method could be applied to characterize the nonequilibrium steady states of dynamical processes on weighted networks.

Runtime Performance and Virtual Network Control Alternatives in VM-Based High-Fidelity Network Simulations

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

Yoginath, Srikanth B; Perumalla, Kalyan S; Henz, Brian J

2012-01-01

In prior work (Yoginath and Perumalla, 2011; Yoginath, Perumalla and Henz, 2012), the motivation, challenges and issues were articulated in favor of virtual time ordering of Virtual Machines (VMs) in network simulations hosted on multi-core machines. Two major components in the overall virtualization challenge are (1) virtual timeline establishment and scheduling of VMs, and (2) virtualization of inter-VM communication. Here, we extend prior work by presenting scaling results for the first component, with experiment results on up to 128 VMs scheduled in virtual time order on a single 12-core host. We also explore the solution space of design alternatives formore » the second component, and present performance results from a multi-threaded, multi-queue implementation of inter-VM network control for synchronized execution with VM scheduling, incorporated in our NetWarp simulation system.« less

Stochastic simulation and analysis of biomolecular reaction networks

PubMed Central

Frazier, John M; Chushak, Yaroslav; Foy, Brent

2009-01-01

Background In recent years, several stochastic simulation algorithms have been developed to generate Monte Carlo trajectories that describe the time evolution of the behavior of biomolecular reaction networks. However, the effects of various stochastic simulation and data analysis conditions on the observed dynamics of complex biomolecular reaction networks have not recieved much attention. In order to investigate these issues, we employed a a software package developed in out group, called Biomolecular Network Simulator (BNS), to simulate and analyze the behavior of such systems. The behavior of a hypothetical two gene in vitro transcription-translation reaction network is investigated using the Gillespie exact stochastic algorithm to illustrate some of the factors that influence the analysis and interpretation of these data. Results Specific issues affecting the analysis and interpretation of simulation data are investigated, including: (1) the effect of time interval on data presentation and time-weighted averaging of molecule numbers, (2) effect of time averaging interval on reaction rate analysis, (3) effect of number of simulations on precision of model predictions, and (4) implications of stochastic simulations on optimization procedures. Conclusion The two main factors affecting the analysis of stochastic simulations are: (1) the selection of time intervals to compute or average state variables and (2) the number of simulations generated to evaluate the system behavior. PMID:19534796

Point-Process Models of Social Network Interactions: Parameter Estimation and Missing Data Recovery

DTIC Science & Technology

2014-08-01

treating them as zero will have a de minimis impact on the results, but avoiding computing them (and computing with them) saves tremendous time. Set a... test the methods on simulated time series on artificial social networks, including some toy networks and some meant to resemble IkeNet. We conclude...the section by discussing the results in detail. In each of our tests we begin with a complete data set, whether it is real (IkeNet) or simulated. Then

Autoshaping and automaintenance: a neural-network approach.

PubMed

Burgos, José E

2007-07-01

This article presents an interpretation of autoshaping, and positive and negative automaintenance, based on a neural-network model. The model makes no distinction between operant and respondent learning mechanisms, and takes into account knowledge of hippocampal and dopaminergic systems. Four simulations were run, each one using an A-B-A design and four instances of feedfoward architectures. In A, networks received a positive contingency between inputs that simulated a conditioned stimulus (CS) and an input that simulated an unconditioned stimulus (US). Responding was simulated as an output activation that was neither elicited by nor required for the US. B was an omission-training procedure. Response directedness was defined as sensory feedback from responding, simulated as a dependence of other inputs on responding. In Simulation 1, the phenomena were simulated with a fully connected architecture and maximally intense response feedback. The other simulations used a partially connected architecture without competition between CS and response feedback. In Simulation 2, a maximally intense feedback resulted in substantial autoshaping and automaintenance. In Simulation 3, eliminating response feedback interfered substantially with autoshaping and automaintenance. In Simulation 4, intermediate autoshaping and automaintenance resulted from an intermediate response feedback. Implications for the operant-respondent distinction and the behavior-neuroscience relation are discussed.

Autoshaping and Automaintenance: A Neural-Network Approach

PubMed Central

Burgos, José E

2007-01-01

This article presents an interpretation of autoshaping, and positive and negative automaintenance, based on a neural-network model. The model makes no distinction between operant and respondent learning mechanisms, and takes into account knowledge of hippocampal and dopaminergic systems. Four simulations were run, each one using an A-B-A design and four instances of feedfoward architectures. In A, networks received a positive contingency between inputs that simulated a conditioned stimulus (CS) and an input that simulated an unconditioned stimulus (US). Responding was simulated as an output activation that was neither elicited by nor required for the US. B was an omission-training procedure. Response directedness was defined as sensory feedback from responding, simulated as a dependence of other inputs on responding. In Simulation 1, the phenomena were simulated with a fully connected architecture and maximally intense response feedback. The other simulations used a partially connected architecture without competition between CS and response feedback. In Simulation 2, a maximally intense feedback resulted in substantial autoshaping and automaintenance. In Simulation 3, eliminating response feedback interfered substantially with autoshaping and automaintenance. In Simulation 4, intermediate autoshaping and automaintenance resulted from an intermediate response feedback. Implications for the operant–respondent distinction and the behavior–neuroscience relation are discussed. PMID:17725055

SS-mPMG and SS-GA: tools for finding pathways and dynamic simulation of metabolic networks.

PubMed

Katsuragi, Tetsuo; Ono, Naoaki; Yasumoto, Keiichi; Altaf-Ul-Amin, Md; Hirai, Masami Y; Sriyudthsak, Kansuporn; Sawada, Yuji; Yamashita, Yui; Chiba, Yukako; Onouchi, Hitoshi; Fujiwara, Toru; Naito, Satoshi; Shiraishi, Fumihide; Kanaya, Shigehiko

2013-05-01

Metabolomics analysis tools can provide quantitative information on the concentration of metabolites in an organism. In this paper, we propose the minimum pathway model generator tool for simulating the dynamics of metabolite concentrations (SS-mPMG) and a tool for parameter estimation by genetic algorithm (SS-GA). SS-mPMG can extract a subsystem of the metabolic network from the genome-scale pathway maps to reduce the complexity of the simulation model and automatically construct a dynamic simulator to evaluate the experimentally observed behavior of metabolites. Using this tool, we show that stochastic simulation can reproduce experimentally observed dynamics of amino acid biosynthesis in Arabidopsis thaliana. In this simulation, SS-mPMG extracts the metabolic network subsystem from published databases. The parameters needed for the simulation are determined using a genetic algorithm to fit the simulation results to the experimental data. We expect that SS-mPMG and SS-GA will help researchers to create relevant metabolic networks and carry out simulations of metabolic reactions derived from metabolomics data.

Learning by stimulation avoidance: A principle to control spiking neural networks dynamics

PubMed Central

Sinapayen, Lana; Ikegami, Takashi

2017-01-01

Learning based on networks of real neurons, and learning based on biologically inspired models of neural networks, have yet to find general learning rules leading to widespread applications. In this paper, we argue for the existence of a principle allowing to steer the dynamics of a biologically inspired neural network. Using carefully timed external stimulation, the network can be driven towards a desired dynamical state. We term this principle “Learning by Stimulation Avoidance” (LSA). We demonstrate through simulation that the minimal sufficient conditions leading to LSA in artificial networks are also sufficient to reproduce learning results similar to those obtained in biological neurons by Shahaf and Marom, and in addition explains synaptic pruning. We examined the underlying mechanism by simulating a small network of 3 neurons, then scaled it up to a hundred neurons. We show that LSA has a higher explanatory power than existing hypotheses about the response of biological neural networks to external simulation, and can be used as a learning rule for an embodied application: learning of wall avoidance by a simulated robot. In other works, reinforcement learning with spiking networks can be obtained through global reward signals akin simulating the dopamine system; we believe that this is the first project demonstrating sensory-motor learning with random spiking networks through Hebbian learning relying on environmental conditions without a separate reward system. PMID:28158309

Learning by stimulation avoidance: A principle to control spiking neural networks dynamics.

PubMed

Sinapayen, Lana; Masumori, Atsushi; Ikegami, Takashi

2017-01-01

Learning based on networks of real neurons, and learning based on biologically inspired models of neural networks, have yet to find general learning rules leading to widespread applications. In this paper, we argue for the existence of a principle allowing to steer the dynamics of a biologically inspired neural network. Using carefully timed external stimulation, the network can be driven towards a desired dynamical state. We term this principle "Learning by Stimulation Avoidance" (LSA). We demonstrate through simulation that the minimal sufficient conditions leading to LSA in artificial networks are also sufficient to reproduce learning results similar to those obtained in biological neurons by Shahaf and Marom, and in addition explains synaptic pruning. We examined the underlying mechanism by simulating a small network of 3 neurons, then scaled it up to a hundred neurons. We show that LSA has a higher explanatory power than existing hypotheses about the response of biological neural networks to external simulation, and can be used as a learning rule for an embodied application: learning of wall avoidance by a simulated robot. In other works, reinforcement learning with spiking networks can be obtained through global reward signals akin simulating the dopamine system; we believe that this is the first project demonstrating sensory-motor learning with random spiking networks through Hebbian learning relying on environmental conditions without a separate reward system.

Imagining the future: The core episodic simulation network dissociates as a function of timecourse and the amount of simulated information

PubMed Central

Thakral, Preston P.; Benoit, Roland G.; Schacter, Daniel L.

2017-01-01

Neuroimaging data indicate that episodic memory (i.e., remembering specific past experiences) and episodic simulation (i.e., imagining specific future experiences) are associated with enhanced activity in a common set of neural regions, often referred to as the core network. This network comprises the hippocampus, parahippocampal cortex, lateral and medial parietal cortex, lateral temporal cortex, and medial prefrontal cortex. Evidence for a core network has been taken as support for the idea that episodic memory and episodic simulation are supported by common processes. Much remains to be learned about how specific core network regions contribute to specific aspects of episodic simulation. Prior neuroimaging studies of episodic memory indicate that certain regions within the core network are differentially sensitive to the amount of information recollected (e.g., the left lateral parietal cortex). In addition, certain core network regions dissociate as a function of their timecourse of engagement during episodic memory (e.g., transient activity in the posterior hippocampus and sustained activity in the left lateral parietal cortex). In the current study, we assessed whether similar dissociations could be observed during episodic simulation. We found that the left lateral parietal cortex modulates as a function of the amount of simulated details. Of particular interest, while the hippocampus was insensitive to the amount of simulated details, we observed a temporal dissociation within the hippocampus: transient activity occurred in relatively posterior portions of the hippocampus and sustained activity occurred in anterior portions. Because the posterior hippocampal and lateral parietal findings parallel those observed previously during episodic memory, the present results add to the evidence that episodic memory and episodic simulation are supported by common processes. Critically, the present study also provides evidence that regions within the core network support dissociable processes. PMID:28324695

Can surgical simulation be used to train detection and classification of neural networks?

PubMed

Zisimopoulos, Odysseas; Flouty, Evangello; Stacey, Mark; Muscroft, Sam; Giataganas, Petros; Nehme, Jean; Chow, Andre; Stoyanov, Danail

2017-10-01

Computer-assisted interventions (CAI) aim to increase the effectiveness, precision and repeatability of procedures to improve surgical outcomes. The presence and motion of surgical tools is a key information input for CAI surgical phase recognition algorithms. Vision-based tool detection and recognition approaches are an attractive solution and can be designed to take advantage of the powerful deep learning paradigm that is rapidly advancing image recognition and classification. The challenge for such algorithms is the availability and quality of labelled data used for training. In this Letter, surgical simulation is used to train tool detection and segmentation based on deep convolutional neural networks and generative adversarial networks. The authors experiment with two network architectures for image segmentation in tool classes commonly encountered during cataract surgery. A commercially-available simulator is used to create a simulated cataract dataset for training models prior to performing transfer learning on real surgical data. To the best of authors' knowledge, this is the first attempt to train deep learning models for surgical instrument detection on simulated data while demonstrating promising results to generalise on real data. Results indicate that simulated data does have some potential for training advanced classification methods for CAI 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

Investigating Cell Criticality

NASA Astrophysics Data System (ADS)

Serra, R.; Villani, M.; Damiani, C.; Graudenzi, A.; Ingrami, P.; Colacci, A.

Random Boolean networks provide a way to give a precise meaning to the notion that living beings are in a critical state. Some phenomena which are observed in real biological systems (distribution of "avalanches" in gene knock-out experiments) can be modeled using random Boolean networks, and the results can be analytically proven to depend upon the Derrida parameter, which also determines whether the network is critical. By comparing observed and simulated data one can then draw inferences about the criticality of biological cells, although with some care because of the limited number of experimental observations. The relationship between the criticality of a single network and that of a set of interacting networks, which simulate a tissue or a bacterial colony, is also analyzed by computer simulations.

An integrated modeling approach to predict flooding on urban basin.

PubMed

Dey, Ashis Kumar; Kamioka, Seiji

2007-01-01

Correct prediction of flood extents in urban catchments has become a challenging issue. The traditional urban drainage models that consider only the sewerage-network are able to simulate the drainage system correctly until there is no overflow from the network inlet or manhole. When such overflows exist due to insufficient drainage capacity of downstream pipes or channels, it becomes difficult to reproduce the actual flood extents using these traditional one-phase simulation techniques. On the other hand, the traditional 2D models that simulate the surface flooding resulting from rainfall and/or levee break do not consider the sewerage network. As a result, the correct flooding situation is rarely addressed from those available traditional 1D and 2D models. This paper presents an integrated model that simultaneously simulates the sewerage network, river network and 2D mesh network to get correct flood extents. The model has been successfully applied into the Tenpaku basin (Nagoya, Japan), which experienced severe flooding with a maximum flood depth more than 1.5 m on September 11, 2000 when heavy rainfall, 580 mm in 28 hrs (return period > 100 yr), occurred over the catchments. Close agreements between the simulated flood depths and observed data ensure that the present integrated modeling approach is able to reproduce the urban flooding situation accurately, which rarely can be obtained through the traditional 1D and 2D modeling approaches.

How the ownership structures cause epidemics in financial markets: A network-based simulation model

NASA Astrophysics Data System (ADS)

Dastkhan, Hossein; Gharneh, Naser Shams

2018-02-01

Analysis of systemic risks and contagions is one of the main challenges of policy makers and researchers in the recent years. Network theory is introduced as a main approach in the modeling and simulation of financial and economic systems. In this paper, a simulation model is introduced based on the ownership network to analyze the contagion and systemic risk events. For this purpose, different network structures with different values for parameters are considered to investigate the stability of the financial system in the presence of different kinds of idiosyncratic and aggregate shocks. The considered network structures include Erdos-Renyi, core-periphery, segregated and power-law networks. Moreover, the results of the proposed model are also calculated for a real ownership network. The results show that the network structure has a significant effect on the probability and the extent of contagion in the financial systems. For each network structure, various values for the parameters results in remarkable differences in the systemic risk measures. The results of real case show that the proposed model is appropriate in the analysis of systemic risk and contagion in financial markets, identification of systemically important firms and estimation of market loss when the initial failures occur. This paper suggests a new direction in the modeling of contagion in the financial markets, in particular that the effects of new kinds of financial exposure are clarified. This paper's idea and analytical results may also be useful for the financial policy makers, portfolio managers and the firms to conduct their investment in the right direction.

Simulation and optimization of a pulsating heat pipe using artificial neural network and genetic algorithm

NASA Astrophysics Data System (ADS)

Jokar, Ali; Godarzi, Ali Abbasi; Saber, Mohammad; Shafii, Mohammad Behshad

2016-11-01

In this paper, a novel approach has been presented to simulate and optimize the pulsating heat pipes (PHPs). The used pulsating heat pipe setup was designed and constructed for this study. Due to the lack of a general mathematical model for exact analysis of the PHPs, a method has been applied for simulation and optimization using the natural algorithms. In this way, the simulator consists of a kind of multilayer perceptron neural network, which is trained by experimental results obtained from our PHP setup. The results show that the complex behavior of PHPs can be successfully described by the non-linear structure of this simulator. The input variables of the neural network are input heat flux to evaporator (q″), filling ratio (FR) and inclined angle (IA) and its output is thermal resistance of PHP. Finally, based upon the simulation results and considering the heat pipe's operating constraints, the optimum operating point of the system is obtained by using genetic algorithm (GA). The experimental results show that the optimum FR (38.25 %), input heat flux to evaporator (39.93 W) and IA (55°) that obtained from GA are acceptable.

Optimal design of supply chain network under uncertainty environment using hybrid analytical and simulation modeling approach

NASA Astrophysics Data System (ADS)

Chiadamrong, N.; Piyathanavong, V.

2017-12-01

Models that aim to optimize the design of supply chain networks have gained more interest in the supply chain literature. Mixed-integer linear programming and discrete-event simulation are widely used for such an optimization problem. We present a hybrid approach to support decisions for supply chain network design using a combination of analytical and discrete-event simulation models. The proposed approach is based on iterative procedures until the difference between subsequent solutions satisfies the pre-determined termination criteria. The effectiveness of proposed approach is illustrated by an example, which shows closer to optimal results with much faster solving time than the results obtained from the conventional simulation-based optimization model. The efficacy of this proposed hybrid approach is promising and can be applied as a powerful tool in designing a real supply chain network. It also provides the possibility to model and solve more realistic problems, which incorporate dynamism and uncertainty.

Intelligent Resource Management for Local Area Networks: Approach and Evolution

NASA Technical Reports Server (NTRS)

Meike, Roger

1988-01-01

The Data Management System network is a complex and important part of manned space platforms. Its efficient operation is vital to crew, subsystems and experiments. AI is being considered to aid in the initial design of the network and to augment the management of its operation. The Intelligent Resource Management for Local Area Networks (IRMA-LAN) project is concerned with the application of AI techniques to network configuration and management. A network simulation was constructed employing real time process scheduling for realistic loads, and utilizing the IEEE 802.4 token passing scheme. This simulation is an integral part of the construction of the IRMA-LAN system. From it, a causal model is being constructed for use in prediction and deep reasoning about the system configuration. An AI network design advisor is being added to help in the design of an efficient network. The AI portion of the system is planned to evolve into a dynamic network management aid. The approach, the integrated simulation, project evolution, and some initial results are described.

Adaptive MANET multipath routing algorithm based on the simulated annealing approach.

PubMed

Kim, Sungwook

2014-01-01

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

Thinking outside the channel: Modeling nitrogen cycling in networked river ecosystems

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

Helton, Ashley; Poole, Geoffrey C.; Meyer, Judy

2011-01-01

Agricultural and urban development alters nitrogen and other biogeochemical cycles in rivers worldwide. Because such biogeochemical processes cannot be measured empirically across whole river networks, simulation models are critical tools for understanding river-network biogeochemistry. However, limitations inherent in current models restrict our ability to simulate biogeochemical dynamics among diverse river networks. We illustrate these limitations using a river-network model to scale up in situ measures of nitrogen cycling in eight catchments spanning various geophysical and land-use conditions. Our model results provide evidence that catchment characteristics typically excluded from models may control river-network biogeochemistry. Based on our findings, we identify importantmore » components of a revised strategy for simulating biogeochemical dynamics in river networks, including approaches to modeling terrestrial-aquatic linkages, hydrologic exchanges between the channel, floodplain/riparian complex, and subsurface waters, and interactions between coupled biogeochemical cycles.« less

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.

CRF Network Simulations for the South

NASA Technical Reports Server (NTRS)

Titov, Oleg; Behrend, Dirk; Shu, Fengchun; MacMillan, Dan; Fey, Alan

2010-01-01

In order to monitor and improve the CRF in both the Southern Hemisphere and along the ecliptic, we perform various simulations using station networks based mostly on the Australian AuScope network, New Zealand s Warkworth antenna, and several Chinese antennas. The effect of other stations such as HartRAO and Kokee Park to enhance the East-West baseline coverage is also considered. It is anticipated that the simulation results will help IVS to decide on the composition of the CRF sessions of the IVS to be run from 2011 onward.

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

PubMed

Marwan, Wolfgang; Sujatha, Arumugam; Starostzik, Christine

2005-10-21

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

Multispectral image fusion using neural networks

NASA Technical Reports Server (NTRS)

Kagel, J. H.; Platt, C. A.; Donaven, T. W.; Samstad, E. A.

1990-01-01

A prototype system is being developed to demonstrate the use of neural network hardware to fuse multispectral imagery. This system consists of a neural network IC on a motherboard, a circuit card assembly, and a set of software routines hosted by a PC-class computer. Research in support of this consists of neural network simulations fusing 4 to 7 bands of Landsat imagery and fusing (separately) multiple bands of synthetic imagery. The simulations, results, and a description of the prototype system are presented.

A Network Selection Algorithm Considering Power Consumption in Hybrid Wireless Networks

NASA Astrophysics Data System (ADS)

Joe, Inwhee; Kim, Won-Tae; Hong, Seokjoon

In this paper, we propose a novel network selection algorithm considering power consumption in hybrid wireless networks for vertical handover. CDMA, WiBro, WLAN networks are candidate networks for this selection algorithm. This algorithm is composed of the power consumption prediction algorithm and the final network selection algorithm. The power consumption prediction algorithm estimates the expected lifetime of the mobile station based on the current battery level, traffic class and power consumption for each network interface card of the mobile station. If the expected lifetime of the mobile station in a certain network is not long enough compared the handover delay, this particular network will be removed from the candidate network list, thereby preventing unnecessary handovers in the preprocessing procedure. On the other hand, the final network selection algorithm consists of AHP (Analytic Hierarchical Process) and GRA (Grey Relational Analysis). The global factors of the network selection structure are QoS, cost and lifetime. If user preference is lifetime, our selection algorithm selects the network that offers longest service duration due to low power consumption. Also, we conduct some simulations using the OPNET simulation tool. The simulation results show that the proposed algorithm provides longer lifetime in the hybrid wireless network environment.

Electrical Conductivity in Transparent Silver Nanowire Networks: Simulations and Experiments

NASA Astrophysics Data System (ADS)

Sherrott, Michelle; Mutiso, Rose; Rathmell, Aaron; Wiley, Benjamin; Winey, Karen

2012-02-01

We model and experimentally measure the electrical conductivity of two-dimensional networks containing finite, conductive cylinders with aspect ratio ranging from 33 to 333. We have previously used our simulations to explore the effects of cylinder orientation and aspect ratio in three-dimensional composites, and now extend the simulation to consider two-dimensional silver nanowire networks. Preliminary results suggest that increasing the aspect ratio and area fraction of these rods significantly decreases the sheet resistance of the film. For all simulated aspect ratios, this sheet resistance approaches a constant value for high area fractions of rods. This implies that regardless of aspect ratio, there is a limiting minimum sheet resistance that is characteristic of the properties of the nanowires. Experimental data from silver nanowire networks will be incorporated into the simulations to define the contact resistance and corroborate experimentally measured sheet resistances of transparent thin films.

Customer social network affects marketing strategy: A simulation analysis based on competitive diffusion model

NASA Astrophysics Data System (ADS)

Hou, Rui; Wu, Jiawen; Du, Helen S.

2017-03-01

To explain the competition phenomenon and results between QQ and MSN (China) in the Chinese instant messaging software market, this paper developed a new population competition model based on customer social network. The simulation results show that the firm whose product with greater network externality effect will gain more market share than its rival when the same marketing strategy is used. The firm with the advantage of time, derived from the initial scale effect will become more competitive than its rival when facing a group of common penguin customers within a social network, verifying the winner-take-all phenomenon in this case.

Advancing Nucleosynthesis in Core-Collapse Supernovae Models Using 2D CHIMERA Simulations

NASA Astrophysics Data System (ADS)

Harris, J. A.; Hix, W. R.; Chertkow, M. A.; Bruenn, S. W.; Lentz, E. J.; Messer, O. B.; Mezzacappa, A.; Blondin, J. M.; Marronetti, P.; Yakunin, K.

2014-01-01

The deaths of massive stars as core-collapse supernovae (CCSN) serve as a crucial link in understanding galactic chemical evolution since the birth of the universe via the Big Bang. We investigate CCSN in polar axisymmetric simulations using the multidimensional radiation hydrodynamics code CHIMERA. Computational costs have traditionally constrained the evolution of the nuclear composition in CCSN models to, at best, a 14-species α-network. However, the limited capacity of the α-network to accurately evolve detailed composition, the neutronization and the nuclear energy generation rate has fettered the ability of prior CCSN simulations to accurately reproduce the chemical abundances and energy distributions as known from observations. These deficits can be partially ameliorated by "post-processing" with a more realistic network. Lagrangian tracer particles placed throughout the star record the temporal evolution of the initial simulation and enable the extension of the nuclear network evolution by incorporating larger systems in post-processing nucleosynthesis calculations. We present post-processing results of the four ab initio axisymmetric CCSN 2D models of Bruenn et al. (2013) evolved with the smaller α-network, and initiated from stellar metallicity, non-rotating progenitors of mass 12, 15, 20, and 25 M⊙ from Woosley & Heger (2007). As a test of the limitations of post-processing, we provide preliminary results from an ongoing simulation of the 15 M⊙ model evolved with a realistic 150 species nuclear reaction network in situ. With more accurate energy generation rates and an improved determination of the thermodynamic trajectories of the tracer particles, we can better unravel the complicated multidimensional "mass-cut" in CCSN simulations and probe for less energetically significant nuclear processes like the νp-process and the r-process, which require still larger networks.

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

PubMed

McCabe, Collin M; Nunn, Charles L

2018-01-01

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

NetFlow Dynamics

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

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

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

A method of groundwater quality assessment based on fuzzy network-CANFIS and geographic information system (GIS)

NASA Astrophysics Data System (ADS)

Gholami, V.; Khaleghi, M. R.; Sebghati, M.

2017-11-01

The process of water quality testing is money/time-consuming, quite important and difficult stage for routine measurements. Therefore, use of models has become commonplace in simulating water quality. In this study, the coactive neuro-fuzzy inference system (CANFIS) was used to simulate groundwater quality. Further, geographic information system (GIS) was used as the pre-processor and post-processor tool to demonstrate spatial variation of groundwater quality. All important factors were quantified and groundwater quality index (GWQI) was developed. The proposed model was trained and validated by taking a case study of Mazandaran Plain located in northern part of Iran. The factors affecting groundwater quality were the input variables for the simulation, whereas GWQI index was the output. The developed model was validated to simulate groundwater quality. Network validation was performed via comparison between the estimated and actual GWQI values. In GIS, the study area was separated to raster format in the pixel dimensions of 1 km and also by incorporation of input data layers of the Fuzzy Network-CANFIS model; the geo-referenced layers of the effective factors in groundwater quality were earned. Therefore, numeric values of each pixel with geographical coordinates were entered to the Fuzzy Network-CANFIS model and thus simulation of groundwater quality was accessed in the study area. Finally, the simulated GWQI indices using the Fuzzy Network-CANFIS model were entered into GIS, and hence groundwater quality map (raster layer) based on the results of the network simulation was earned. The study's results confirm the high efficiency of incorporation of neuro-fuzzy techniques and GIS. It is also worth noting that the general quality of the groundwater in the most studied plain is fairly low.

Generation of Global Geodetic Networks for GGOS

NASA Astrophysics Data System (ADS)

MacMillan, Daniel; Pavlis, Erricos C.; Kuzmicz-Cieslak, Magda; Koenig, Daniel

2016-12-01

We simulated future networks of VLBI+SLR sites to assess their performance. The objective is to build a global network of geographically well distributed, co-located next-generation sites from each of the space geodetic techniques. The network is being designed to meet the GGOS terrestrial reference frame goals of 1 mm in accuracy and 0.1 mm/yr in stability. We simulated the next generation networks that should be available in five years and in ten years to assess the likelihood that these networks will meet the reference frame goals. Simulations were based on the expectation that 17 broadband VLBI stations will be available in five years and 27 stations in ten years. We also consider the improvement resulting from expanding the network by six additional VLBI sites to improve the global distribution of the network. In the simulations, the networks will operate continuously, but we account for station downtime for maintenance or because of bad weather. We ran SLR+VLBI combination TRF solutions, where site ties were used to connect the two networks in the same way as in combination solutions with observed data. The strengths of VLBI and SLR allows them to provide the necessary reference frame accuracy in scale, geocenter, and orientation. With the +10-year extended network operating for ten years, simulations indicate that scale, origin, and orientation accuracies will be at the level of 0.02 ppb, 0.2 mm, and 6 μas. Combining the +5-year and +10-year network realizations will provide better estimates of accuracy and estimates of stability.

Information diffusion in structured online social networks

NASA Astrophysics Data System (ADS)

Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

2015-05-01

Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

Prior-knowledge-based feedforward network simulation of true boiling point curve of crude oil.

PubMed

Chen, C W; Chen, D Z

2001-11-01

Theoretical results and practical experience indicate that feedforward networks can approximate a wide class of functional relationships very well. This property is exploited in modeling chemical processes. Given finite and noisy training data, it is important to encode the prior knowledge in neural networks to improve the fit precision and the prediction ability of the model. In this paper, as to the three-layer feedforward networks and the monotonic constraint, the unconstrained method, Joerding's penalty function method, the interpolation method, and the constrained optimization method are analyzed first. Then two novel methods, the exponential weight method and the adaptive method, are proposed. These methods are applied in simulating the true boiling point curve of a crude oil with the condition of increasing monotonicity. The simulation experimental results show that the network models trained by the novel methods are good at approximating the actual process. Finally, all these methods are discussed and compared with each other.

An Observing System Simulation Experiment Approach to Meteorological Network Assessment

NASA Astrophysics Data System (ADS)

Abbasnezhadi, K.; Rasmussen, P. F.; Stadnyk, T.; Boluwade, A.

2016-12-01

A proper knowledge of the spatiotemporal distribution of rainfall is important in order to conduct a mindful investigation of water movement and storage throughout a catchment. Currently, the most accurate precipitation information available for the remote Boreal ecozones of northern Manitoba is coming from the Canadian Precipitation Analysis (CaPA) data assimilation system. Throughout the Churchill River Basin (CRB), CaPA still does not have the proper skill due to the limited number of weather stations. A new approach to experimental network design was investigated based on the concept of Observing System Simulation Experiment (OSSE). The OSSE-based network assessment procedure which simulates the CaPA system provides a scientific and hydrologically significant tool to assess the sensitivity of CaPA precipitation analysis to observation network density throughout the CRB. To simulate CaPA system, synthetic background and station data were simulated, respectively, by adding spatially uncorrelated and correlated Gaussian noises to an assumingly true daily weather field synthesized by a gridded precipitation generator which simulates CaPA data. Given the true reference field on one hand, and a set of pseudo-CaPA analyses associated with different network realizations on the other hand, a WATFLOOD hydrological model was employed to compare the modeled runoff. The simulations showed that as network density increases, the accuracy of CaPA precipitation products improves up to a certain limit beyond which adding more stations to the network does not result in further accuracy.

Research on dynamic routing mechanisms in wireless sensor networks.

PubMed

Zhao, A Q; Weng, Y N; Lu, Y; Liu, C Y

2014-01-01

WirelessHART is the most widely applied standard in wireless sensor networks nowadays. However, it does not provide any dynamic routing mechanism, which is important for the reliability and robustness of the wireless network applications. In this paper, a collection tree protocol based, dynamic routing mechanism was proposed for WirelessHART network. The dynamic routing mechanism was evaluated through several simulation experiments in three aspects: time for generating the topology, link quality, and stability of network. Besides, the data transmission efficiency of this routing mechanism was analyzed. The simulation and evaluation results show that this mechanism can act as a dynamic routing mechanism for the TDMA-based wireless sensor network.

Simulating secondary waterflooding in heterogeneous rocks with variable wettability using an image-based, multiscale pore network model

NASA Astrophysics Data System (ADS)

Bultreys, Tom; Van Hoorebeke, Luc; Cnudde, Veerle

2016-09-01

The two-phase flow properties of natural rocks depend strongly on their pore structure and wettability, both of which are often heterogeneous throughout the rock. To better understand and predict these properties, image-based models are being developed. Resulting simulations are however problematic in several important classes of rocks with broad pore-size distributions. We present a new multiscale pore network model to simulate secondary waterflooding in these rocks, which may undergo wettability alteration after primary drainage. This novel approach permits to include the effect of microporosity on the imbibition sequence without the need to describe each individual micropore. Instead, we show that fluid transport through unresolved pores can be taken into account in an upscaled fashion, by the inclusion of symbolic links between macropores, resulting in strongly decreased computational demands. Rules to describe the behavior of these links in the quasistatic invasion sequence are derived from percolation theory. The model is validated by comparison to a fully detailed network representation, which takes each separate micropore into account. Strongly and weakly water-and oil-wet simulations show good results, as do mixed-wettability scenarios with different pore-scale wettability distributions. We also show simulations on a network extracted from a micro-CT scan of Estaillades limestone, which yields good agreement with water-wet and mixed-wet experimental results.

Simbrain 3.0: A flexible, visually-oriented neural network simulator.

PubMed

Tosi, Zachary; Yoshimi, Jeffrey

2016-11-01

Simbrain 3.0 is a software package for neural network design and analysis, which emphasizes flexibility (arbitrarily complex networks can be built using a suite of basic components) and a visually rich, intuitive interface. These features support both students and professionals. Students can study all of the major classes of neural networks in a familiar graphical setting, and can easily modify simulations, experimenting with networks and immediately seeing the results of their interventions. With the 3.0 release, Simbrain supports models on the order of thousands of neurons and a million synapses. This allows the same features that support education to support research professionals, who can now use the tool to quickly design, run, and analyze the behavior of large, highly customizable simulations. Copyright © 2016 Elsevier Ltd. All rights reserved.

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.

PyNN: A Common Interface for Neuronal Network Simulators.

PubMed

Davison, Andrew P; Brüderle, Daniel; Eppler, Jochen; Kremkow, Jens; Muller, Eilif; Pecevski, Dejan; Perrinet, Laurent; Yger, Pierre

2008-01-01

Computational neuroscience has produced a diversity of software for simulations of networks of spiking neurons, with both negative and positive consequences. On the one hand, each simulator uses its own programming or configuration language, leading to considerable difficulty in porting models from one simulator to another. This impedes communication between investigators and makes it harder to reproduce and build on the work of others. On the other hand, simulation results can be cross-checked between different simulators, giving greater confidence in their correctness, and each simulator has different optimizations, so the most appropriate simulator can be chosen for a given modelling task. A common programming interface to multiple simulators would reduce or eliminate the problems of simulator diversity while retaining the benefits. PyNN is such an interface, making it possible to write a simulation script once, using the Python programming language, and run it without modification on any supported simulator (currently NEURON, NEST, PCSIM, Brian and the Heidelberg VLSI neuromorphic hardware). PyNN increases the productivity of neuronal network modelling by providing high-level abstraction, by promoting code sharing and reuse, and by providing a foundation for simulator-agnostic analysis, visualization and data-management tools. PyNN increases the reliability of modelling studies by making it much easier to check results on multiple simulators. PyNN is open-source software and is available from http://neuralensemble.org/PyNN.

PyNN: A Common Interface for Neuronal Network Simulators

PubMed Central

Davison, Andrew P.; Brüderle, Daniel; Eppler, Jochen; Kremkow, Jens; Muller, Eilif; Pecevski, Dejan; Perrinet, Laurent; Yger, Pierre

2008-01-01

Computational neuroscience has produced a diversity of software for simulations of networks of spiking neurons, with both negative and positive consequences. On the one hand, each simulator uses its own programming or configuration language, leading to considerable difficulty in porting models from one simulator to another. This impedes communication between investigators and makes it harder to reproduce and build on the work of others. On the other hand, simulation results can be cross-checked between different simulators, giving greater confidence in their correctness, and each simulator has different optimizations, so the most appropriate simulator can be chosen for a given modelling task. A common programming interface to multiple simulators would reduce or eliminate the problems of simulator diversity while retaining the benefits. PyNN is such an interface, making it possible to write a simulation script once, using the Python programming language, and run it without modification on any supported simulator (currently NEURON, NEST, PCSIM, Brian and the Heidelberg VLSI neuromorphic hardware). PyNN increases the productivity of neuronal network modelling by providing high-level abstraction, by promoting code sharing and reuse, and by providing a foundation for simulator-agnostic analysis, visualization and data-management tools. PyNN increases the reliability of modelling studies by making it much easier to check results on multiple simulators. PyNN is open-source software and is available from http://neuralensemble.org/PyNN. PMID:19194529

Performance of a Regional Aeronautical Telecommunications Network

NASA Technical Reports Server (NTRS)

Bretmersky, Steven C.; Ripamonti, Claudio; Konangi, Vijay K.; Kerczewski, Robert J.

2001-01-01

This paper reports the findings of the simulation of the ATN (Aeronautical Telecommunications Network) for three typical average-sized U.S. airports and their associated air traffic patterns. The models of the protocols were designed to achieve the same functionality and meet the ATN specifications. The focus of this project is on the subnetwork and routing aspects of the simulation. To maintain continuous communication between the aircrafts and the ground facilities, a model based on mobile IP is used. The results indicate that continuous communication is indeed possible. The network can support two applications of significance in the immediate future FTP and HTTP traffic. Results from this simulation prove the feasibility of development of the ATN concept for AC/ATM (Advanced Communications for Air Traffic Management).

Qualitative modeling of normal blood coagulation and its pathological states using stochastic activity networks.

PubMed

Mounts, W M; Liebman, M N

1997-07-01

We have developed a method for representing biological pathways and simulating their behavior based on the use of stochastic activity networks (SANs). SANs, an extension of the original Petri net, have been used traditionally to model flow systems including data-communications networks and manufacturing processes. We apply the methodology to the blood coagulation cascade, a biological flow system, and present the representation method as well as results of simulation studies based on published experimental data. In addition to describing the dynamic model, we also present the results of its utilization to perform simulations of clinical states including hemophilia's A and B as well as sensitivity analysis of individual factors and their impact on thrombin production.

Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation

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

Wolfe, Noah; Carothers, Christopher; Mubarak, Misbah

As supercomputers close in on exascale performance, the increased number of processors and processing power translates to an increased demand on the underlying network interconnect. The Slim Fly network topology, a new lowdiameter and low-latency interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this paper, we present a high-fidelity Slim Fly it-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate our Slim Fly model with the Kathareios et al. Slim Fly model results provided at moderately sized network scales. We further scale the modelmore » size up to n unprecedented 1 million compute nodes; and through visualization of network simulation metrics such as link bandwidth, packet latency, and port occupancy, we get an insight into the network behavior at the million-node scale. We also show linear strong scaling of the Slim Fly model on an Intel cluster achieving a peak event rate of 36 million events per second using 128 MPI tasks to process 7 billion events. Detailed analysis of the underlying discrete-event simulation performance shows that a million-node Slim Fly model simulation can execute in 198 seconds on the Intel cluster.« less

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

PubMed Central

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

2015-01-01

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

Simulation of short-term electric load using an artificial neural network

NASA Astrophysics Data System (ADS)

Ivanin, O. A.

2018-01-01

While solving the task of optimizing operation modes and equipment composition of small energy complexes or other tasks connected with energy planning, it is necessary to have data on energy loads of a consumer. Usually, there is a problem with obtaining real load charts and detailed information about the consumer, because a method of load-charts simulation on the basis of minimal information should be developed. The analysis of work devoted to short-term loads prediction allows choosing artificial neural networks as a most suitable mathematical instrument for solving this problem. The article provides an overview of applied short-term load simulation methods; it describes the advantages of artificial neural networks and offers a neural network structure for electric loads of residential buildings simulation. The results of modeling loads with proposed method and the estimation of its error are presented.

Network visualization of conformational sampling during molecular dynamics simulation.

PubMed

Ahlstrom, Logan S; Baker, Joseph Lee; Ehrlich, Kent; Campbell, Zachary T; Patel, Sunita; Vorontsov, Ivan I; Tama, Florence; Miyashita, Osamu

2013-11-01

Effective data reduction methods are necessary for uncovering the inherent conformational relationships present in large molecular dynamics (MD) trajectories. Clustering algorithms provide a means to interpret the conformational sampling of molecules during simulation by grouping trajectory snapshots into a few subgroups, or clusters, but the relationships between the individual clusters may not be readily understood. Here we show that network analysis can be used to visualize the dominant conformational states explored during simulation as well as the connectivity between them, providing a more coherent description of conformational space than traditional clustering techniques alone. We compare the results of network visualization against 11 clustering algorithms and principal component conformer plots. Several MD simulations of proteins undergoing different conformational changes demonstrate the effectiveness of networks in reaching functional conclusions. Copyright © 2013 Elsevier Inc. All rights reserved.

Lewis Research Center studies of multiple large wind turbine generators on a utility network

NASA Technical Reports Server (NTRS)

Gilbert, L. J.; Triezenberg, D. M.

1979-01-01

A NASA-Lewis program to study the anticipated performance of a wind turbine generator farm on an electric utility network is surveyed. The paper describes the approach of the Lewis Wind Energy Project Office to developing analysis capabilities in the area of wind turbine generator-utility network computer simulations. Attention is given to areas such as, the Lewis Purdue hybrid simulation, an independent stability study, DOE multiunit plant study, and the WEST simulator. Also covered are the Lewis mod-2 simulation including analog simulation of a two wind turbine system and comparison with Boeing simulation results, and gust response of a two machine model. Finally future work to be done is noted and it is concluded that the study shows little interaction between the generators and between the generators and the bus.

Modeling and simulating networks of interdependent protein interactions.

PubMed

Stöcker, Bianca K; Köster, Johannes; Zamir, Eli; Rahmann, Sven

2018-05-21

Protein interactions are fundamental building blocks of biochemical reaction systems underlying cellular functions. The complexity and functionality of these systems emerge not only from the protein interactions themselves but also from the dependencies between these interactions, as generated by allosteric effects or mutual exclusion due to steric hindrance. Therefore, formal models for integrating and utilizing information about interaction dependencies are of high interest. Here, we describe an approach for endowing protein networks with interaction dependencies using propositional logic, thereby obtaining constrained protein interaction networks ("constrained networks"). The construction of these networks is based on public interaction databases as well as text-mined information about interaction dependencies. We present an efficient data structure and algorithm to simulate protein complex formation in constrained networks. The efficiency of the model allows fast simulation and facilitates the analysis of many proteins in large networks. In addition, this approach enables the simulation of perturbation effects, such as knockout of single or multiple proteins and changes of protein concentrations. We illustrate how our model can be used to analyze a constrained human adhesome protein network, which is responsible for the formation of diverse and dynamic cell-matrix adhesion sites. By comparing protein complex formation under known interaction dependencies versus without dependencies, we investigate how these dependencies shape the resulting repertoire of protein complexes. Furthermore, our model enables investigating how the interplay of network topology with interaction dependencies influences the propagation of perturbation effects across a large biochemical system. Our simulation software CPINSim (for Constrained Protein Interaction Network Simulator) is available under the MIT license at http://github.com/BiancaStoecker/cpinsim and as a Bioconda package (https://bioconda.github.io).

Distributed simulation using a real-time shared memory network

NASA Technical Reports Server (NTRS)

Simon, Donald L.; Mattern, Duane L.; Wong, Edmond; Musgrave, Jeffrey L.

1993-01-01

The Advanced Control Technology Branch of the NASA Lewis Research Center performs research in the area of advanced digital controls for aeronautic and space propulsion systems. This work requires the real-time implementation of both control software and complex dynamical models of the propulsion system. We are implementing these systems in a distributed, multi-vendor computer environment. Therefore, a need exists for real-time communication and synchronization between the distributed multi-vendor computers. A shared memory network is a potential solution which offers several advantages over other real-time communication approaches. A candidate shared memory network was tested for basic performance. The shared memory network was then used to implement a distributed simulation of a ramjet engine. The accuracy and execution time of the distributed simulation was measured and compared to the performance of the non-partitioned simulation. The ease of partitioning the simulation, the minimal time required to develop for communication between the processors and the resulting execution time all indicate that the shared memory network is a real-time communication technique worthy of serious consideration.

Reduction technique of drop voltage and power losses to improve power quality using ETAP Power Station simulation model

NASA Astrophysics Data System (ADS)

Satrio, Reza Indra; Subiyanto

2018-03-01

The effect of electric loads growth emerged direct impact in power systems distribution. Drop voltage and power losses one of the important things in power systems distribution. This paper presents modelling approach used to restructrure electrical network configuration, reduce drop voltage, reduce power losses and add new distribution transformer to enhance reliability of power systems distribution. Restructrure electrical network was aimed to analyse and investigate electric loads of a distribution transformer. Measurement of real voltage and real current were finished two times for each consumer, that were morning period and night period or when peak load. Design and simulation were conduct by using ETAP Power Station Software. Based on result of simulation and real measurement precentage of drop voltage and total power losses were mismatch with SPLN (Standard PLN) 72:1987. After added a new distribution transformer and restructrured electricity network configuration, the result of simulation could reduce drop voltage from 1.3 % - 31.3 % to 8.1 % - 9.6 % and power losses from 646.7 watt to 233.29 watt. Result showed, restructrure electricity network configuration and added new distribution transformer can be applied as an effective method to reduce drop voltage and reduce power losses.

A Polarization Reconfigurable Slot Antenna with a Novel Switchable Feeding Network

NASA Astrophysics Data System (ADS)

Xie, Peng; Wang, Guang Ming

2017-12-01

A polarization reconfigurable slot antenna is proposed in this paper. The antenna consists of a microstrip line-to-slotline transition structure, two radiation slots and a switchable feeding network. The feeding network is a gradually changed ring slot with six switching diodes on it. By controlling the diodes states, the antenna can generate y-direction polarization, z-direction polarization, left-hand circular polarization and right-hand circular polarization. Detailed design considerations of the proposed antenna, simulated and measured results are presented and discussed. Measured results agree well with simulated. The results proved that the antenna can realize polarization reconfiguration effectively at 5 GHz.

Evolution of egoism on semi-directed and undirected Barabási-Albert networks

NASA Astrophysics Data System (ADS)

Lima, F. W. S.

2015-05-01

Through Monte Carlo simulations, we study the evolution of the four strategies: Ethnocentric, altruistic, egoistic and cosmopolitan in one community of individuals. Interactions and reproduction among computational agents are simulated on undirected and semi-directed Barabási-Albert (BA) networks. We study the Hammond-Axelrod (HA) model on undirected and semi-directed BA networks for the asexual reproduction case. With a small modification in the traditional HA model, our simulations showed that egoism wins, differently from other results found in the literature where ethnocentric strategy is common. Here, mechanisms such as reciprocity are absent.

Structured Tracking for Safety, Security, and Privacy: Algorithms for Fusing Noisy Estimates from Sensor, Robot, and Camera Networks

DTIC Science & Technology

2009-07-23

negative log of the probability at each edge. 135 7.4 Simulation experiments All simulation experiments were implemented in Matlab and executed on PCs...Sensitivity . . . . 71 4.5 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 4.5.1 Simulation Results...113 6.6.2 Estimator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 6.7 Simulation Results

Application of Fuzzy-Logic Controller and Neural Networks Controller in Gas Turbine Speed Control and Overheating Control and Surge Control on Transient Performance

NASA Astrophysics Data System (ADS)

Torghabeh, A. A.; Tousi, A. M.

2007-08-01

This paper presents Fuzzy Logic and Neural Networks approach to Gas Turbine Fuel schedules. Modeling of non-linear system using feed forward artificial Neural Networks using data generated by a simulated gas turbine program is introduced. Two artificial Neural Networks are used , depicting the non-linear relationship between gas generator speed and fuel flow, and turbine inlet temperature and fuel flow respectively . Off-line fast simulations are used for engine controller design for turbojet engine based on repeated simulation. The Mamdani and Sugeno models are used to expression the Fuzzy system . The linguistic Fuzzy rules and membership functions are presents and a Fuzzy controller will be proposed to provide an Open-Loop control for the gas turbine engine during acceleration and deceleration . MATLAB Simulink was used to apply the Fuzzy Logic and Neural Networks analysis. Both systems were able to approximate functions characterizing the acceleration and deceleration schedules . Surge and Flame-out avoidance during acceleration and deceleration phases are then checked . Turbine Inlet Temperature also checked and controls by Neural Networks controller. This Fuzzy Logic and Neural Network Controllers output results are validated and evaluated by GSP software . The validation results are used to evaluate the generalization ability of these artificial Neural Networks and Fuzzy Logic controllers.

Hybrid stochastic simplifications for multiscale gene networks

PubMed Central

Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

2009-01-01

Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach. PMID:19735554

Simulating Autonomous Telecommunication Networks for Space Exploration

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.

2008-01-01

Currently, most interplanetary telecommunication systems require human intervention for command and control. However, considering the range from near Earth to deep space missions, combined with the increase in the number of nodes and advancements in processing capabilities, the benefits from communication autonomy will be immense. Likewise, greater mission science autonomy brings the need for unscheduled, unpredictable communication and network routing. While the terrestrial Internet protocols are highly developed their suitability for space exploration has been questioned. JPL has developed the Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE) tool to help characterize network designs and protocols. The results will allow future mission planners to better understand the trade offs of communication protocols. This paper discusses various issues with interplanetary network and simulation results of interplanetary networking protocols.

Macrostructure from Microstructure: Generating Whole Systems from Ego Networks

PubMed Central

Smith, Jeffrey A.

2014-01-01

This paper presents a new simulation method to make global network inference from sampled data. The proposed simulation method takes sampled ego network data and uses Exponential Random Graph Models (ERGM) to reconstruct the features of the true, unknown network. After describing the method, the paper presents two validity checks of the approach: the first uses the 20 largest Add Health networks while the second uses the Sociology Coauthorship network in the 1990's. For each test, I take random ego network samples from the known networks and use my method to make global network inference. I find that my method successfully reproduces the properties of the networks, such as distance and main component size. The results also suggest that simpler, baseline models provide considerably worse estimates for most network properties. I end the paper by discussing the bounds/limitations of ego network sampling. I also discuss possible extensions to the proposed approach. PMID:25339783

The Buildup of a Scale-free Photospheric Magnetic Network

NASA Astrophysics Data System (ADS)

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

2012-10-01

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

Relationship between microscopic dynamics in traffic flow and complexity in networks.

PubMed

Li, Xin-Gang; Gao, Zi-You; Li, Ke-Ping; Zhao, Xiao-Mei

2007-07-01

Complex networks are constructed in the evolution process of traffic flow, and the states of traffic flow are represented by nodes in the network. The traffic dynamics can then be studied by investigating the statistical properties of those networks. According to Kerner's three-phase theory, there are two different phases in congested traffic, synchronized flow and wide moving jam. In the framework of this theory, we study different properties of synchronized flow and moving jam in relation to complex network. Scale-free network is constructed in stop-and-go traffic, i.e., a sequence of moving jams [Chin. Phys. Lett. 10, 2711 (2005)]. In this work, the networks generated in synchronized flow are investigated in detail. Simulation results show that the degree distribution of the networks constructed in synchronized flow has two power law regions, so the distinction in topological structure can really reflect the different dynamics in traffic flow. Furthermore, the real traffic data are investigated by this method, and the results are consistent with the simulations.

Stochastic flux analysis of chemical reaction networks

PubMed Central

2013-01-01

Background Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. Results We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. Conclusions We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network. PMID:24314153

A Digitally Programmable Cytomorphic Chip for Simulation of Arbitrary Biochemical Reaction Networks.

PubMed

Woo, Sung Sik; Kim, Jaewook; Sarpeshkar, Rahul

2018-04-01

Prior work has shown that compact analog circuits can faithfully represent and model fundamental biomolecular circuits via efficient log-domain cytomorphic transistor equivalents. Such circuits have emphasized basis functions that are dominant in genetic transcription and translation networks and deoxyribonucleic acid (DNA)-protein binding. Here, we report a system featuring digitally programmable 0.35 μm BiCMOS analog cytomorphic chips that enable arbitrary biochemical reaction networks to be exactly represented thus enabling compact and easy composition of protein networks as well. Since all biomolecular networks can be represented as chemical reaction networks, our protein networks also include the former genetic network circuits as a special case. The cytomorphic analog protein circuits use one fundamental association-dissociation-degradation building-block circuit that can be configured digitally to exactly represent any zeroth-, first-, and second-order reaction including loading, dynamics, nonlinearity, and interactions with other building-block circuits. To address a divergence issue caused by random variations in chip fabrication processes, we propose a unique way of performing computation based on total variables and conservation laws, which we instantiate at both the circuit and network levels. Thus, scalable systems that operate with finite error over infinite time can be built. We show how the building-block circuits can be composed to form various network topologies, such as cascade, fan-out, fan-in, loop, dimerization, or arbitrary networks using total variables. We demonstrate results from a system that combines interacting cytomorphic chips to simulate a cancer pathway and a glycolysis pathway. Both simulations are consistent with conventional software simulations. Our highly parallel digitally programmable analog cytomorphic systems can lead to a useful design, analysis, and simulation tool for studying arbitrary large-scale biological networks in systems and synthetic biology.

Optimal social-networking strategy is a function of socioeconomic conditions.

PubMed

Oishi, Shigehiro; Kesebir, Selin

2012-12-01

In the two studies reported here, we examined the relation among residential mobility, economic conditions, and optimal social-networking strategy. In study 1, a computer simulation showed that regardless of economic conditions, having a broad social network with weak friendship ties is advantageous when friends are likely to move away. By contrast, having a small social network with deep friendship ties is advantageous when the economy is unstable but friends are not likely to move away. In study 2, we examined the validity of the computer simulation using a sample of American adults. Results were consistent with the simulation: American adults living in a zip code where people are residentially stable but economically challenged were happier if they had a narrow but deep social network, whereas in other socioeconomic conditions, people were generally happier if they had a broad but shallow networking strategy. Together, our studies demonstrate that the optimal social-networking strategy varies as a function of socioeconomic conditions.

Prediction of Aerodynamic Coefficient using Genetic Algorithm Optimized Neural Network for Sparse Data

NASA Technical Reports Server (NTRS)

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

2002-01-01

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic coefficients to an accuracy of 110% . In our problem, we would like to get an optimized neural network architecture and minimum data set. This has been accomplished within 500 training cycles of a neural network. After removing training pairs (outliers), the GA has produced much better results. The neural network constructed is a feed forward neural network with a back propagation learning mechanism. The main goal has been to free the network design process from constraints of human biases, and to discover better forms of neural network architectures. The automation of the network architecture search by genetic algorithms seems to have been the best way to achieve this goal.

A novel proposal of GPON-oriented fiber grating sensing data digitalization system for remote sensing network

NASA Astrophysics Data System (ADS)

Wang, Yubao; Zhu, Zhaohui; Wang, Lu; Bai, Jian

2016-05-01

A novel GPON-oriented sensing data digitalization system is proposed to achieve remote monitoring of fiber grating sensing networks utilizing existing optical communication networks in some harsh environments. In which, Quick digitalization of sensing information obtained from the reflected lightwaves by fiber Bragg grating (FBG) sensor is realized, and a novel frame format of sensor signal is designed to suit for public transport so as to facilitate sensor monitoring center to receive and analyze the sensor data. The delay effect, identification method of the sensor data, and various interference factors which influence the sensor data to be correctly received are analyzed. The system simulation is carried out with OptiSystem/Matlab co-simulation approach. The theoretical analysis and simulation results verify the feasibility of the integration of the sensor network and communication network.

Development of a pore network simulation model to study nonaqueous phase liquid dissolution

USGS Publications Warehouse

Dillard, Leslie A.; Blunt, Martin J.

2000-01-01

A pore network simulation model was developed to investigate the fundamental physics of nonequilibrium nonaqueous phase liquid (NAPL) dissolution. The network model is a lattice of cubic chambers and rectangular tubes that represent pore bodies and pore throats, respectively. Experimental data obtained by Powers [1992] were used to develop and validate the model. To ensure the network model was representative of a real porous medium, the pore size distribution of the network was calibrated by matching simulated and experimental drainage and imbibition capillary pressure‐saturation curves. The predicted network residual styrene blob‐size distribution was nearly identical to the observed distribution. The network model reproduced the observed hydraulic conductivity and produced relative permeability curves that were representative of a poorly consolidated sand. Aqueous‐phase transport was represented by applying the equation for solute flux to the network tubes and solving for solute concentrations in the network chambers. Complete mixing was found to be an appropriate approximation for calculation of chamber concentrations. Mass transfer from NAPL blobs was represented using a corner diffusion model. Predicted results of solute concentration versus Peclet number and of modified Sherwood number versus Peclet number for the network model compare favorably with experimental data for the case in which NAPL blob dissolution was negligible. Predicted results of normalized effluent concentration versus pore volume for the network were similar to the experimental data for the case in which NAPL blob dissolution occurred with time.

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

PubMed

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

2011-11-01

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

Application of a neural network to simulate analysis in an optimization process

NASA Technical Reports Server (NTRS)

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

1992-01-01

A new experimental software package called NETS/PROSSS aimed at reducing the computing time required to solve a complex design problem is described. The software combines a neural network for simulating the analysis program with an optimization program. The neural network is applied to approximate results of a finite element analysis program to quickly obtain a near-optimal solution. Results of the NETS/PROSSS optimization process can also be used as an initial design in a normal optimization process and make it possible to converge to an optimum solution with significantly fewer iterations.

Influence maximization based on partial network structure information: A comparative analysis on seed selection heuristics

NASA Astrophysics Data System (ADS)

Erkol, Şirag; Yücel, Gönenç

In this study, the problem of seed selection is investigated. This problem is mainly treated as an optimization problem, which is proved to be NP-hard. There are several heuristic approaches in the literature which mostly use algorithmic heuristics. These approaches mainly focus on the trade-off between computational complexity and accuracy. Although the accuracy of algorithmic heuristics are high, they also have high computational complexity. Furthermore, in the literature, it is generally assumed that complete information on the structure and features of a network is available, which is not the case in most of the times. For the study, a simulation model is constructed, which is capable of creating networks, performing seed selection heuristics, and simulating diffusion models. Novel metric-based seed selection heuristics that rely only on partial information are proposed and tested using the simulation model. These heuristics use local information available from nodes in the synthetically created networks. The performances of heuristics are comparatively analyzed on three different network types. The results clearly show that the performance of a heuristic depends on the structure of a network. A heuristic to be used should be selected after investigating the properties of the network at hand. More importantly, the approach of partial information provided promising results. In certain cases, selection heuristics that rely only on partial network information perform very close to similar heuristics that require complete network data.

On the Performance of TCP Spoofing in Satellite Networks

NASA Technical Reports Server (NTRS)

Ishac, Joseph; Allman, Mark

2001-01-01

In this paper, we analyze the performance of Transmission Control Protocol (TCP) in a network that consists of both satellite and terrestrial components. One method, proposed by outside research, to improve the performance of data transfers over satellites is to use a performance enhancing proxy often dubbed 'spoofing.' Spoofing involves the transparent splitting of a TCP connection between the source and destination by some entity within the network path. In order to analyze the impact of spoofing, we constructed a simulation suite based around the network simulator ns-2. The simulation reflects a host with a satellite connection to the Internet and allows the option to spoof connections just prior to the satellite. The methodology used in our simulation allows us to analyze spoofing over a large range of file sizes and under various congested conditions, while prior work on this topic has primarily focused on bulk transfers with no congestion. As a result of these simulations, we find that the performance of spoofing is dependent upon a number of conditions.

Integration of Online Parameter Identification and Neural Network for In-Flight Adaptive Control

NASA Technical Reports Server (NTRS)

Hageman, Jacob J.; Smith, Mark S.; Stachowiak, Susan

2003-01-01

An indirect adaptive system has been constructed for robust control of an aircraft with uncertain aerodynamic characteristics. This system consists of a multilayer perceptron pre-trained neural network, online stability and control derivative identification, a dynamic cell structure online learning neural network, and a model following control system based on the stochastic optimal feedforward and feedback technique. The pre-trained neural network and model following control system have been flight-tested, but the online parameter identification and online learning neural network are new additions used for in-flight adaptation of the control system model. A description of the modification and integration of these two stand-alone software packages into the complete system in preparation for initial flight tests is presented. Open-loop results using both simulation and flight data, as well as closed-loop performance of the complete system in a nonlinear, six-degree-of-freedom, flight validated simulation, are analyzed. Results show that this online learning system, in contrast to the nonlearning system, has the ability to adapt to changes in aerodynamic characteristics in a real-time, closed-loop, piloted simulation, resulting in improved flying qualities.

Enhanced Handover Decision Algorithm in Heterogeneous Wireless Network

PubMed Central

Abdullah, Radhwan Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Transferring a huge amount of data between different network locations over the network links depends on the network’s traffic capacity and data rate. Traditionally, a mobile device may be moved to achieve the operations of vertical handover, considering only one criterion, that is the Received Signal Strength (RSS). The use of a single criterion may cause service interruption, an unbalanced network load and an inefficient vertical handover. In this paper, we propose an enhanced vertical handover decision algorithm based on multiple criteria in the heterogeneous wireless network. The algorithm consists of three technology interfaces: Long-Term Evolution (LTE), Worldwide interoperability for Microwave Access (WiMAX) and Wireless Local Area Network (WLAN). It also employs three types of vertical handover decision algorithms: equal priority, mobile priority and network priority. The simulation results illustrate that the three types of decision algorithms outperform the traditional network decision algorithm in terms of handover number probability and the handover failure probability. In addition, it is noticed that the network priority handover decision algorithm produces better results compared to the equal priority and the mobile priority handover decision algorithm. Finally, the simulation results are validated by the analytical model. PMID:28708067

Development and evaluation of packet video schemes

NASA Technical Reports Server (NTRS)

Sayood, Khalid; Chen, Y. C.; Hadenfeldt, A. C.

1990-01-01

Reflecting the two tasks proposed for the current year, namely a feasibility study of simulating the NASA network, and a study of progressive transmission schemes, are presented. The view of the NASA network, gleaned from the various technical reports made available to use, is provided. Also included is a brief overview of how the current simulator could be modified to accomplish the goal of simulating the NASA network. As the material in this section would be the basis for the actual simulation, it is important to make sure that it is an accurate reflection of the requirements on the simulator. Brief descriptions of the set of progressive transmission algorithms selected for the study are contained. The results available in the literature were obtained under a variety of different assumptions, not all of which are stated. As such, the only way to compare the efficiency and the implementational complexity of the various algorithms is to simulate them.

A computational model of oxygen delivery by hemoglobin-based oxygen carriers in three-dimensional microvascular networks.

PubMed

Tsoukias, Nikolaos M; Goldman, Daniel; Vadapalli, Arjun; Pittman, Roland N; Popel, Aleksander S

2007-10-21

A detailed computational model is developed to simulate oxygen transport from a three-dimensional (3D) microvascular network to the surrounding tissue in the presence of hemoglobin-based oxygen carriers. The model accounts for nonlinear O(2) consumption, myoglobin-facilitated diffusion and nonlinear oxyhemoglobin dissociation in the RBCs and plasma. It also includes a detailed description of intravascular resistance to O(2) transport and is capable of incorporating realistic 3D microvascular network geometries. Simulations in this study were performed using a computer-generated microvascular architecture that mimics morphometric parameters for the hamster cheek pouch retractor muscle. Theoretical results are presented next to corresponding experimental data. Phosphorescence quenching microscopy provided PO(2) measurements at the arteriolar and venular ends of capillaries in the hamster retractor muscle before and after isovolemic hemodilution with three different hemodilutents: a non-oxygen-carrying plasma expander and two hemoglobin solutions with different oxygen affinities. Sample results in a microvascular network show an enhancement of diffusive shunting between arterioles, venules and capillaries and a decrease in hemoglobin's effectiveness for tissue oxygenation when its affinity for O(2) is decreased. Model simulations suggest that microvascular network anatomy can affect the optimal hemoglobin affinity for reducing tissue hypoxia. O(2) transport simulations in realistic representations of microvascular networks should provide a theoretical framework for choosing optimal parameter values in the development of hemoglobin-based blood substitutes.

Optical network unit placement in Fiber-Wireless (FiWi) access network by Moth-Flame optimization algorithm

NASA Astrophysics Data System (ADS)

Singh, Puja; Prakash, Shashi

2017-07-01

Hybrid wireless-optical broadband access network (WOBAN) or Fiber-Wireless (FiWi) is the integration of wireless access network and optical network. This hybrid multi-domain network adopts the advantages of wireless and optical domains and serves the demand of technology savvy users. FiWi exhibits the properties of cost effectiveness, robustness, flexibility, high capacity, reliability and is self organized. Optical Network Unit (ONU) placement problem in FiWi contributes in simplifying the network design and enhances the performance in terms of cost efficiency and increased throughput. Several individual-based algorithms, such as Simulated Annealing (SA), Tabu Search, etc. have been suggested for ONU placement, but these algorithms suffer from premature convergence (trapping in a local optima). The present research work undertakes the deployment of FiWi and proposes a novel nature-inspired heuristic paradigm called Moth-Flame optimization (MFO) algorithm for multiple optical network units' placement. MFO is a population based algorithm. Population-based algorithms are better in handling local optima avoidance. The simulation results are compared with the existing Greedy and Simulated Annealing algorithms to optimize the position of ONUs. To the best of our knowledge, MFO algorithm has been used for the first time in this domain, moreover it has been able to provide very promising and competitive results. The performance of MFO algorithm has been analyzed by varying the 'b' parameter. MFO algorithm results in faster convergence than the existing strategies of Greedy and SA and returns a lower value of overall cost function. The results exhibit the dependence of the objective function on the distribution of wireless users also.

SAGRAD: A Program for Neural Network Training with Simulated Annealing and the Conjugate Gradient Method.

PubMed

Bernal, Javier; Torres-Jimenez, Jose

2015-01-01

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller's algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller's algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller's algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data.

Identification and control of plasma vertical position using neural network in Damavand tokamak.

PubMed

Rasouli, H; Rasouli, C; Koohi, A

2013-02-01

In this work, a nonlinear model is introduced to determine the vertical position of the plasma column in Damavand tokamak. Using this model as a simulator, a nonlinear neural network controller has been designed. In the first stage, the electronic drive and sensory circuits of Damavand tokamak are modified. These circuits can control the vertical position of the plasma column inside the vacuum vessel. Since the vertical position of plasma is an unstable parameter, a direct closed loop system identification algorithm is performed. In the second stage, a nonlinear model is identified for plasma vertical position, based on the multilayer perceptron (MLP) neural network (NN) structure. Estimation of simulator parameters has been performed by back-propagation error algorithm using Levenberg-Marquardt gradient descent optimization technique. The model is verified through simulation of the whole closed loop system using both simulator and actual plant in similar conditions. As the final stage, a MLP neural network controller is designed for simulator model. In the last step, online training is performed to tune the controller parameters. Simulation results justify using of the NN controller for the actual plant.

A case study of evolutionary computation of biochemical adaptation

NASA Astrophysics Data System (ADS)

François, Paul; Siggia, Eric D.

2008-06-01

Simulations of evolution have a long history, but their relation to biology is questioned because of the perceived contingency of evolution. Here we provide an example of a biological process, adaptation, where simulations are argued to approach closer to biology. Adaptation is a common feature of sensory systems, and a plausible component of other biochemical networks because it rescales upstream signals to facilitate downstream processing. We create random gene networks numerically, by linking genes with interactions that model transcription, phosphorylation and protein-protein association. We define a fitness function for adaptation in terms of two functional metrics, and show that any reasonable combination of them will yield the same adaptive networks after repeated rounds of mutation and selection. Convergence to these networks is driven by positive selection and thus fast. There is always a path in parameter space of continuously improving fitness that leads to perfect adaptation, implying that the actual mutation rates we use in the simulation do not bias the results. Our results imply a kinetic view of evolution, i.e., it favors gene networks that can be learned quickly from the random examples supplied by mutation. This formulation allows for deductive predictions of the networks realized in nature.

A multi-scale network method for two-phase flow in porous media

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

Khayrat, Karim, E-mail: khayratk@ifd.mavt.ethz.ch; Jenny, Patrick

Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces withinmore » each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.« less

Revisiting node-based SIR models in complex networks with degree correlations

NASA Astrophysics Data System (ADS)

Wang, Yi; Cao, Jinde; Alofi, Abdulaziz; AL-Mazrooei, Abdullah; Elaiw, Ahmed

2015-11-01

In this paper, we consider two growing networks which will lead to the degree-degree correlations between two nearest neighbors in the network. When the network grows to some certain size, we introduce an SIR-like disease such as pandemic influenza H1N1/09 to the population. Due to its rapid spread, the population size changes slowly, and thus the disease spreads on correlated networks with approximately fixed size. To predict the disease evolution on correlated networks, we first review two node-based SIR models incorporating degree correlations and an edge-based SIR model without considering degree correlation, and then compare the predictions of these models with stochastic SIR simulations, respectively. We find that the edge-based model, even without considering degree correlations, agrees much better than the node-based models incorporating degree correlations with stochastic SIR simulations in many respects. Moreover, simulation results show that for networks with positive correlation, the edge-based model provides a better upper bound of the cumulative incidence than the node-based SIR models, whereas for networks with negative correlation, it provides a lower bound of the cumulative incidence.

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.

Hybrid stochastic simplifications for multiscale gene networks.

PubMed

Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

2009-09-07

Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.

A Proposal for Modeling Real Hardware, Weather and Marine Conditions for Underwater Sensor Networks

PubMed Central

Climent, Salvador; Capella, Juan Vicente; Blanc, Sara; Perles, Angel; Serrano, Juan José

2013-01-01

Network simulators are useful for researching protocol performance, appraising new hardware capabilities and evaluating real application scenarios. However, these tasks can only be achieved when using accurate models and real parameters that enable the extraction of trustworthy results and conclusions. This paper presents an underwater wireless sensor network ecosystem for the ns-3 simulator. This ecosystem is composed of a new energy-harvesting model and a low-cost, low-power underwater wake-up modem model that, alongside existing models, enables the performance of accurate simulations by providing real weather and marine conditions from the location where the real application is to be deployed. PMID:23748171

Investigation of Alien Wavelength Quality in Live Multi-Domain, Multi-Vendor Link Using Advanced Simulation Tool

NASA Astrophysics Data System (ADS)

Nordal Petersen, Martin; Nuijts, Roeland; Lange Bjørn, Lars

2014-05-01

This article presents an advanced optical model for simulation of alien wavelengths in multi-domain and multi-vendor dense wavelength-division multiplexing networks. The model aids optical network planners with a better understanding of the non-linear effects present in dense wavelength-division multiplexing systems and better utilization of alien wavelengths in future applications. The limiting physical effects for alien wavelengths are investigated in relation to power levels, channel spacing, and other factors. The simulation results are verified through experimental setup in live multi-domain dense wavelength-division multiplexing systems between two national research networks: SURFnet in Holland and NORDUnet in Denmark.

Bayesian network prior: network analysis of biological data using external knowledge

PubMed Central

Isci, Senol; Dogan, Haluk; Ozturk, Cengizhan; Otu, Hasan H.

2014-01-01

Motivation: Reverse engineering GI networks from experimental data is a challenging task due to the complex nature of the networks and the noise inherent in the data. One way to overcome these hurdles would be incorporating the vast amounts of external biological knowledge when building interaction networks. We propose a framework where GI networks are learned from experimental data using Bayesian networks (BNs) and the incorporation of external knowledge is also done via a BN that we call Bayesian Network Prior (BNP). BNP depicts the relation between various evidence types that contribute to the event ‘gene interaction’ and is used to calculate the probability of a candidate graph (G) in the structure learning process. Results: Our simulation results on synthetic, simulated and real biological data show that the proposed approach can identify the underlying interaction network with high accuracy even when the prior information is distorted and outperforms existing methods. Availability: Accompanying BNP software package is freely available for academic use at http://bioe.bilgi.edu.tr/BNP. Contact: hasan.otu@bilgi.edu.tr Supplementary Information: Supplementary data are available at Bioinformatics online. PMID:24215027

Conceptual Hierarchies in a Flat Attractor Network

PubMed Central

O’Connor, Christopher M.; Cree, George S.; McRae, Ken

2009-01-01

The structure of people’s conceptual knowledge of concrete nouns has traditionally been viewed as hierarchical (Collins & Quillian, 1969). For example, superordinate concepts (vegetable) are assumed to reside at a higher level than basic-level concepts (carrot). A feature-based attractor network with a single layer of semantic features developed representations of both basic-level and superordinate concepts. No hierarchical structure was built into the network. In Experiment and Simulation 1, the graded structure of categories (typicality ratings) is accounted for by the flat attractor-network. Experiment and Simulation 2 show that, as with basic-level concepts, such a network predicts feature verification latencies for superordinate concepts (vegetable ). In Experiment and Simulation 3, counterintuitive results regarding the temporal dynamics of similarity in semantic priming are explained by the model. By treating both types of concepts the same in terms of representation, learning, and computations, the model provides new insights into semantic memory. PMID:19543434

Distributed network scheduling

NASA Technical Reports Server (NTRS)

Clement, Bradley J.; Schaffer, Steven R.

2004-01-01

Distributed Network Scheduling is the scheduling of future communications of a network by nodes in the network. This report details software for doing this onboard spacecraft in a remote network. While prior work on distributed scheduling has been applied to remote spacecraft networks, the software reported here focuses on modeling communication activities in greater detail and including quality of service constraints. Our main results are based on a Mars network of spacecraft and include identifying a maximum opportunity of improving traverse exploration rate a factor of three; a simulation showing reduction in one-way delivery times from a rover to Earth from as much as 5 to 1.5 hours; simulated response to unexpected events averaging under an hour onboard; and ground schedule generation ranging from seconds to 50 minutes for 15 to 100 communication goals.

The effects of malicious nodes on performance of mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Li, Fanzhi; Shi, Xiyu; Jassim, Sabah; Adams, Christopher

2006-05-01

Wireless ad hoc networking offers convenient infrastructureless communication over the shared wireless channel. However, the nature of ad hoc networks makes them vulnerable to security attacks. Unlike their wired counterpart, infrastructureless ad hoc networks do not have a clear line of defense, their topology is dynamically changing, and every mobile node can receive messages from its neighbors and can be contacted by all other nodes in its neighborhood. This poses a great danger to network security if some nodes behave in a malicious manner. The immediate concern about the security in this type of networks is how to protect the network and the individual mobile nodes against malicious act of rogue nodes from within the network. This paper is concerned with security aspects of wireless ad hoc networks. We shall present results of simulation experiments on ad hoc network's performance in the presence of malicious nodes. We shall investigate two types of attacks and the consequences will be simulated and quantified in terms of loss of packets and other factors. The results show that network performance, in terms of successful packet delivery ratios, significantly deteriorates when malicious nodes act according to the defined misbehaving characteristics.

Evolution of ethnocentrism on undirected and directed Barabási-Albert networks

NASA Astrophysics Data System (ADS)

Lima, F. W. S.; Hadzibeganovic, Tarik; Stauffer, Dietrich

2009-12-01

Using Monte Carlo simulations, we study the evolution of contingent cooperation and ethnocentrism in the one-shot game. Interactions and reproduction among computational agents are simulated on undirected and directed Barabási-Albert (BA) networks. We first replicate the Hammond-Axelrod model of in-group favoritism on a square lattice and then generalize this model on undirected and directed BA networks for both asexual and sexual reproduction cases. Our simulations demonstrate that irrespective of the mode of reproduction, the ethnocentric strategy becomes common even though cooperation is individually costly and mechanisms such as reciprocity or conformity are absent. Moreover, our results indicate that the spread of favoritism towards similar others highly depends on the network topology and the associated heterogeneity of the studied population.

Multi-model ensemble hydrological simulation using a BP Neural Network for the upper Yalongjiang River Basin, China

NASA Astrophysics Data System (ADS)

Li, Zhanjie; Yu, Jingshan; Xu, Xinyi; Sun, Wenchao; Pang, Bo; Yue, Jiajia

2018-06-01

Hydrological models are important and effective tools for detecting complex hydrological processes. Different models have different strengths when capturing the various aspects of hydrological processes. Relying on a single model usually leads to simulation uncertainties. Ensemble approaches, based on multi-model hydrological simulations, can improve application performance over single models. In this study, the upper Yalongjiang River Basin was selected for a case study. Three commonly used hydrological models (SWAT, VIC, and BTOPMC) were selected and used for independent simulations with the same input and initial values. Then, the BP neural network method was employed to combine the results from the three models. The results show that the accuracy of BP ensemble simulation is better than that of the single models.

Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation.

PubMed

Du, Tingsong; Hu, Yang; Ke, Xianting

2015-01-01

An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation

PubMed Central

Hu, Yang; Ke, Xianting

2015-01-01

An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA. PMID:26447713

Fault detection and classification in electrical power transmission system using artificial neural network.

PubMed

Jamil, Majid; Sharma, Sanjeev Kumar; Singh, Rajveer

2015-01-01

This paper focuses on the detection and classification of the faults on electrical power transmission line using artificial neural networks. The three phase currents and voltages of one end are taken as inputs in the proposed scheme. The feed forward neural network along with back propagation algorithm has been employed for detection and classification of the fault for analysis of each of the three phases involved in the process. A detailed analysis with varying number of hidden layers has been performed to validate the choice of the neural network. The simulation results concluded that the present method based on the neural network is efficient in detecting and classifying the faults on transmission lines with satisfactory performances. The different faults are simulated with different parameters to check the versatility of the method. The proposed method can be extended to the Distribution network of the Power System. The various simulations and analysis of signals is done in the MATLAB(®) environment.

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

Redline, Erica Marie; Bolintineanu, Dan S.; Lane, J. Matthew

The aim of this study was to alter polymerization chemistry to improve network homogeneity in free-radical crosslinked systems. It was hypothesized that a reduction in heterogeneity of the network would lead to improved mechanical performance. Experiments and simulations were carried out to investigate the connection between polymerization chemistry, network structure and mechanical properties. Experiments were conducted on two different monomer systems - the first is a single monomer system, urethane dimethacrylate (UDMA), and the second is a two-monomer system consisting of bisphenol A glycidyl dimethacrylate (BisGMA) and triethylene glycol dimethacrylate (TEGDMA) in a ratio of 70/30 BisGMA/TEGDMA by weight. Themore » methacrylate systems were crosslinked using traditional radical polymeriza- tion (TRP) with azobisisobutyronitrile (AIBN) or benzoyl peroxide (BPO) as an initiator; TRP systems were used as the control. The monomers were also cross-linked using activator regenerated by electron transfer atom transfer radical polymerization (ARGET ATRP) as a type of controlled radical polymerization (CRP). FTIR and DSC were used to monitor reac- tion kinetics of the systems. The networks were analyzed using NMR, DSC, X-ray diffraction (XRD), atomic force microscopy (AFM), and small angle X-ray scattering (SAXS). These techniques were employed in an attempt to quantify differences between the traditional and controlled radical polymerizations. While a quantitative methodology for characterizing net- work morphology was not established, SAXS and AFM have shown some promising initial results. Additionally, differences in mechanical behavior were observed between traditional and controlled radical polymerized thermosets in the BisGMA/TEGDMA system but not in the UDMA materials; this finding may be the result of network ductility variations between the two materials. Coarse-grained molecular dynamics simulations employing a novel model of the CRP reaction were carried out for the UDMA system, with parameters calibrated based on fully atomistic simulations of the UDMA monomer in the liquid state. Detailed metrics based on network graph theoretical approaches were implemented to quantify the bond network topology resulting from simulations. For a broad range of polymerization parameters, no discernible differences were seen between TRP and CRP UDMA simulations at equal conversions, although clear differences exist as a function of conversion. Both findings are consistent with experiments. Despite a number of shortcomings, these models have demonstrated the potential of molecular simulations for studying network topology in these systems.« less

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

Efficient Allocation of Resources for Defense of Spatially Distributed Networks Using Agent-Based Simulation.

PubMed

Kroshl, William M; Sarkani, Shahram; Mazzuchi, Thomas A

2015-09-01

This article presents ongoing research that focuses on efficient allocation of defense resources to minimize the damage inflicted on a spatially distributed physical network such as a pipeline, water system, or power distribution system from an attack by an active adversary, recognizing the fundamental difference between preparing for natural disasters such as hurricanes, earthquakes, or even accidental systems failures and the problem of allocating resources to defend against an opponent who is aware of, and anticipating, the defender's efforts to mitigate the threat. Our approach is to utilize a combination of integer programming and agent-based modeling to allocate the defensive resources. We conceptualize the problem as a Stackelberg "leader follower" game where the defender first places his assets to defend key areas of the network, and the attacker then seeks to inflict the maximum damage possible within the constraints of resources and network structure. The criticality of arcs in the network is estimated by a deterministic network interdiction formulation, which then informs an evolutionary agent-based simulation. The evolutionary agent-based simulation is used to determine the allocation of resources for attackers and defenders that results in evolutionary stable strategies, where actions by either side alone cannot increase its share of victories. We demonstrate these techniques on an example network, comparing the evolutionary agent-based results to a more traditional, probabilistic risk analysis (PRA) approach. Our results show that the agent-based approach results in a greater percentage of defender victories than does the PRA-based approach. © 2015 Society for Risk Analysis.

Software for Brain Network Simulations: A Comparative Study

PubMed Central

Tikidji-Hamburyan, Ruben A.; Narayana, Vikram; Bozkus, Zeki; El-Ghazawi, Tarek A.

2017-01-01

Numerical simulations of brain networks are a critical part of our efforts in understanding brain functions under pathological and normal conditions. For several decades, the community has developed many software packages and simulators to accelerate research in computational neuroscience. In this article, we select the three most popular simulators, as determined by the number of models in the ModelDB database, such as NEURON, GENESIS, and BRIAN, and perform an independent evaluation of these simulators. In addition, we study NEST, one of the lead simulators of the Human Brain Project. First, we study them based on one of the most important characteristics, the range of supported models. Our investigation reveals that brain network simulators may be biased toward supporting a specific set of models. However, all simulators tend to expand the supported range of models by providing a universal environment for the computational study of individual neurons and brain networks. Next, our investigations on the characteristics of computational architecture and efficiency indicate that all simulators compile the most computationally intensive procedures into binary code, with the aim of maximizing their computational performance. However, not all simulators provide the simplest method for module development and/or guarantee efficient binary code. Third, a study of their amenability for high-performance computing reveals that NEST can almost transparently map an existing model on a cluster or multicore computer, while NEURON requires code modification if the model developed for a single computer has to be mapped on a computational cluster. Interestingly, parallelization is the weakest characteristic of BRIAN, which provides no support for cluster computations and limited support for multicore computers. Fourth, we identify the level of user support and frequency of usage for all simulators. Finally, we carry out an evaluation using two case studies: a large network with simplified neural and synaptic models and a small network with detailed models. These two case studies allow us to avoid any bias toward a particular software package. The results indicate that BRIAN provides the most concise language for both cases considered. Furthermore, as expected, NEST mostly favors large network models, while NEURON is better suited for detailed models. Overall, the case studies reinforce our general observation that simulators have a bias in the computational performance toward specific types of the brain network models. PMID:28775687

Inference of scale-free networks from gene expression time series.

PubMed

Daisuke, Tominaga; Horton, Paul

2006-04-01

Quantitative time-series observation of gene expression is becoming possible, for example by cell array technology. However, there are no practical methods with which to infer network structures using only observed time-series data. As most computational models of biological networks for continuous time-series data have a high degree of freedom, it is almost impossible to infer the correct structures. On the other hand, it has been reported that some kinds of biological networks, such as gene networks and metabolic pathways, may have scale-free properties. We hypothesize that the architecture of inferred biological network models can be restricted to scale-free networks. We developed an inference algorithm for biological networks using only time-series data by introducing such a restriction. We adopt the S-system as the network model, and a distributed genetic algorithm to optimize models to fit its simulated results to observed time series data. We have tested our algorithm on a case study (simulated data). We compared optimization under no restriction, which allows for a fully connected network, and under the restriction that the total number of links must equal that expected from a scale free network. The restriction reduced both false positive and false negative estimation of the links and also the differences between model simulation and the given time-series data.

Membrane Properties and the Balance between Excitation and Inhibition Control Gamma-Frequency Oscillations Arising from Feedback Inhibition

PubMed Central

Economo, Michael N.; White, John A.

2012-01-01

Computational studies as well as in vivo and in vitro results have shown that many cortical neurons fire in a highly irregular manner and at low average firing rates. These patterns seem to persist even when highly rhythmic signals are recorded by local field potential electrodes or other methods that quantify the summed behavior of a local population. Models of the 30–80 Hz gamma rhythm in which network oscillations arise through ‘stochastic synchrony’ capture the variability observed in the spike output of single cells while preserving network-level organization. We extend upon these results by constructing model networks constrained by experimental measurements and using them to probe the effect of biophysical parameters on network-level activity. We find in simulations that gamma-frequency oscillations are enabled by a high level of incoherent synaptic conductance input, similar to the barrage of noisy synaptic input that cortical neurons have been shown to receive in vivo. This incoherent synaptic input increases the emergent network frequency by shortening the time scale of the membrane in excitatory neurons and by reducing the temporal separation between excitation and inhibition due to decreased spike latency in inhibitory neurons. These mechanisms are demonstrated in simulations and in vitro current-clamp and dynamic-clamp experiments. Simulation results further indicate that the membrane potential noise amplitude has a large impact on network frequency and that the balance between excitatory and inhibitory currents controls network stability and sensitivity to external inputs. PMID:22275859

Design and evaluation of a DAMQ multiprocessor network with self-compacting buffers

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

Park, J.; O`Krafka, B.W.O.; Vassiliadis, S.

1994-12-31

This paper describes a new approach to implement Dynamically Allocated Multi-Queue (DAMQ) switching elements using a technique called ``self-compacting buffers``. This technique is efficient in that the amount of hardware required to manage the buffers is relatively small; it offers high performance since it is an implementation of a DAMQ. The first part of this paper describes the self-compacting buffer architecture in detail, and compares it against a competing DAMQ switch design. The second part presents extensive simulation results comparing the performance of a self compacting buffer switch against an ideal switch including several examples of k-ary n-cubes and deltamore » networks. In addition, simulation results show how the performance of an entire network can be quickly and accurately approximated by simulating just a single switching element.« less

FERN - a Java framework for stochastic simulation and evaluation of reaction networks.

PubMed

Erhard, Florian; Friedel, Caroline C; Zimmer, Ralf

2008-08-29

Stochastic simulation can be used to illustrate the development of biological systems over time and the stochastic nature of these processes. Currently available programs for stochastic simulation, however, are limited in that they either a) do not provide the most efficient simulation algorithms and are difficult to extend, b) cannot be easily integrated into other applications or c) do not allow to monitor and intervene during the simulation process in an easy and intuitive way. Thus, in order to use stochastic simulation in innovative high-level modeling and analysis approaches more flexible tools are necessary. In this article, we present FERN (Framework for Evaluation of Reaction Networks), a Java framework for the efficient simulation of chemical reaction networks. FERN is subdivided into three layers for network representation, simulation and visualization of the simulation results each of which can be easily extended. It provides efficient and accurate state-of-the-art stochastic simulation algorithms for well-mixed chemical systems and a powerful observer system, which makes it possible to track and control the simulation progress on every level. To illustrate how FERN can be easily integrated into other systems biology applications, plugins to Cytoscape and CellDesigner are included. These plugins make it possible to run simulations and to observe the simulation progress in a reaction network in real-time from within the Cytoscape or CellDesigner environment. FERN addresses shortcomings of currently available stochastic simulation programs in several ways. First, it provides a broad range of efficient and accurate algorithms both for exact and approximate stochastic simulation and a simple interface for extending to new algorithms. FERN's implementations are considerably faster than the C implementations of gillespie2 or the Java implementations of ISBJava. Second, it can be used in a straightforward way both as a stand-alone program and within new systems biology applications. Finally, complex scenarios requiring intervention during the simulation progress can be modelled easily with FERN.

Lattice Boltzmann simulation of CO2 reactive transport in network fractured media

NASA Astrophysics Data System (ADS)

Tian, Zhiwei; Wang, Junye

2017-08-01

Carbon dioxide (CO2) geological sequestration plays an important role in mitigating CO2 emissions for climate change. Understanding interactions of the injected CO2 with network fractures and hydrocarbons is key for optimizing and controlling CO2 geological sequestration and evaluating its risks to ground water. However, there is a well-known, difficult process in simulating the dynamic interaction of fracture-matrix, such as dynamic change of matrix porosity, unsaturated processes in rock matrix, and effect of rock mineral properties. In this paper, we develop an explicit model of the fracture-matrix interactions using multilayer bounce-back treatment as a first attempt to simulate CO2 reactive transport in network fractured media through coupling the Dardis's LBM porous model for a new interface treatment. Two kinds of typical fracture networks in porous media are simulated: straight cross network fractures and interleaving network fractures. The reaction rate and porosity distribution are illustrated and well-matched patterns are found. The species concentration distribution and evolution with time steps are also analyzed and compared with different transport properties. The results demonstrate the capability of this model to investigate the complex processes of CO2 geological injection and reactive transport in network fractured media, such as dynamic change of matrix porosity.

Modeling and simulation of different and representative engineering problems using Network Simulation Method

PubMed Central

2018-01-01

Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model. PMID:29518121

Modeling and simulation of different and representative engineering problems using Network Simulation Method.

PubMed

Sánchez-Pérez, J F; Marín, F; Morales, J L; Cánovas, M; Alhama, F

2018-01-01

Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model.

Unified study of Quality of Service (QoS) in OPS/OBS networks

NASA Astrophysics Data System (ADS)

Hailu, Dawit Hadush; Lema, Gebrehiwet Gebrekrstos; Yekun, Ephrem Admasu; Kebede, Samrawit Haylu

2017-07-01

With the growth of Internet traffic, an inevitable use of optical networks provide a large bandwidth, fast data transmission rates and Quality of Service (QoS) support. Currently, Optical Burst Switched (OBS)/Optical Packet Switched (OPS) networks are under study as future solutions for addressing the increase demand of Internet traffic. However, due to their high blocking probability in the intermediate nodes they have been delayed in the industries. Packet loss in OBS/OPS networks is mainly occur due to contention. Hence, the contribution of this study is to analyze the file loss ratio (FLR), packet overhead and number of disjoint paths, and processing delay over Coded Packet Transport (CPT) scheme for OBS/OPS network using simulation. The simulations show that CPT scheme reduces the FLR in OBS/OPS network for the evaluated scenarios since the data packets are chopped off into blocks of the data packet for transmission over a network. Simulation results for secrecy and survivability are verified with the help of the analytical model to define the operational range of CPT scheme.

Modeling a secular trend by Monte Carlo simulation of height biased migration in a spatial network.

PubMed

Groth, Detlef

2017-04-01

Background: In a recent Monte Carlo simulation, the clustering of body height of Swiss military conscripts within a spatial network with characteristic features of the natural Swiss geography was investigated. In this study I examined the effect of migration of tall individuals into network hubs on the dynamics of body height within the whole spatial network. The aim of this study was to simulate height trends. Material and methods: Three networks were used for modeling, a regular rectangular fishing net like network, a real world example based on the geographic map of Switzerland, and a random network. All networks contained between 144 and 148 districts and between 265-307 road connections. Around 100,000 agents were initially released with average height of 170 cm, and height standard deviation of 6.5 cm. The simulation was started with the a priori assumption that height variation within a district is limited and also depends on height of neighboring districts (community effect on height). In addition to a neighborhood influence factor, which simulates a community effect, body height dependent migration of conscripts between adjacent districts in each Monte Carlo simulation was used to re-calculate next generation body heights. In order to determine the direction of migration for taller individuals, various centrality measures for the evaluation of district importance within the spatial network were applied. Taller individuals were favored to migrate more into network hubs, backward migration using the same number of individuals was random, not biased towards body height. Network hubs were defined by the importance of a district within the spatial network. The importance of a district was evaluated by various centrality measures. In the null model there were no road connections, height information could not be delivered between the districts. Results: Due to the favored migration of tall individuals into network hubs, average body height of the hubs, and later, of the whole network increased by up to 0.1 cm per iteration depending on the network model. The general increase in height within the network depended on connectedness and on the amount of height information that was exchanged between neighboring districts. If higher amounts of neighborhood height information were exchanged, the general increase in height within the network was large (strong secular trend). The trend in the homogeneous fishnet like network was lowest, the trend in the random network was highest. Yet, some network properties, such as the heteroscedasticity and autocorrelations of the migration simulation models differed greatly from the natural features observed in Swiss military conscript networks. Autocorrelations of district heights for instance, were much higher in the migration models. Conclusion: This study confirmed that secular height trends can be modeled by preferred migration of tall individuals into network hubs. However, basic network properties of the migration simulation models differed greatly from the natural features observed in Swiss military conscripts. Similar network-based data from other countries should be explored to better investigate height trends with Monte Carlo migration approach.

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

Lee, Y.C.; Doolen, G.; Chen, H.H.

A high-order correlation tensor formalism for neural networks is described. The model can simulate auto associative, heteroassociative, as well as multiassociative memory. For the autoassociative model, simulation results show a drastic increase in the memory capacity and speed over that of the standard Hopfield-like correlation matrix methods. The possibility of using multiassociative memory for a learning universal inference network is also discussed. 9 refs., 5 figs.

Implementing and Simulating Dynamic Traffic Assignment with Intelligent Transportation Systems in Cube Avenue

NASA Technical Reports Server (NTRS)

Foytik, Peter; Robinson, Mike

2010-01-01

As urban populations and traffic congestion levels increase, effective use of information and communication tools and intelligent transportation systems as becoming increasingly important in order to maximize the efficiency of transportation networks. The appropriate placement and employment of these tools within a network is critical to their effectiveness. This presentation proposes and demonstrates the use of a commercial transportation simulation tool to simulate dynamic traffic assignment and rerouting to model route modifications as a result of traffic information.

Reactive molecular dynamics of network polymers: Generation, characterization and mechanical properties

NASA Astrophysics Data System (ADS)

Shankar, Chandrashekar

The goal of this research was to gain a fundamental understanding of the properties of networks created by the ring opening metathesis polymerization (ROMP) of dicyclopentadiene (DCPD) used in self-healing materials. To this end we used molecular simulation methods to generate realistic structures of DCPD networks, characterize their structures, and determine their mechanical properties. Density functional theory (DFT) calculations, complemented by structural information derived from molecular dynamics simulations were used to reconstruct experimental Raman spectra and differential scanning calorimetry (DSC) data. We performed coarse-grained simulations comparing networks generated via the ROMP reaction process and compared them to those generated via a RANDOM process, which led to the fundamental realization that the polymer topology has a unique influence on the network properties. We carried out fully atomistic simulations of DCPD using a novel algorithm for recreating ROMP reactions of DCPD molecules. Mechanical properties derived from these atomistic networks are in excellent agreement with those obtained from coarse-grained simulations in which interactions between nodes are subject to angular constraints. This comparison provides self-consistent validation of our simulation results and helps to identify the level of detail necessary for the coarse-grained interaction model. Simulations suggest networks can classified into three stages: fluid-like, rubber-like or glass-like delineated by two thresholds in degree of reaction alpha: The onset of finite magnitudes for the Young's modulus, alphaY, and the departure of the Poisson ration from 0.5, alphaP. In each stage the polymer exhibits a different predominant mechanical response to deformation. At low alpha < alphaY it flows. At alpha Y < alpha < alphaP the response is entropic with no change in internal energy. At alpha > alphaP the response is enthalpic change in internal energy. We developed graph theory-based network characterizations to correlate between network topology and the simulated mechanical properties. (1) Eigenvector centrality (2) Graph fractal dimension, (3) Fiedler partitioning, and (4) Cross-link fraction (Q3+Q4). Of these quantities, the Fiedler partition is the best characteristic for the prediction of Young's Modulus. The new computational tools developed in this research are of great fundamental and practical interest.

Some issues related to simulation of the tracking and communications computer network

NASA Technical Reports Server (NTRS)

Lacovara, Robert C.

1989-01-01

The Communications Performance and Integration branch of the Tracking and Communications Division has an ongoing involvement in the simulation of its flight hardware for Space Station Freedom. Specifically, the communication process between central processor(s) and orbital replaceable units (ORU's) is simulated with varying degrees of fidelity. The results of investigations into three aspects of this simulation effort are given. The most general area involves the use of computer assisted software engineering (CASE) tools for this particular simulation. The second area of interest is simulation methods for systems of mixed hardware and software. The final area investigated is the application of simulation methods to one of the proposed computer network protocols for space station, specifically IEEE 802.4.

Some issues related to simulation of the tracking and communications computer network

NASA Astrophysics Data System (ADS)

Lacovara, Robert C.

1989-12-01

The Communications Performance and Integration branch of the Tracking and Communications Division has an ongoing involvement in the simulation of its flight hardware for Space Station Freedom. Specifically, the communication process between central processor(s) and orbital replaceable units (ORU's) is simulated with varying degrees of fidelity. The results of investigations into three aspects of this simulation effort are given. The most general area involves the use of computer assisted software engineering (CASE) tools for this particular simulation. The second area of interest is simulation methods for systems of mixed hardware and software. The final area investigated is the application of simulation methods to one of the proposed computer network protocols for space station, specifically IEEE 802.4.

Distributed Observer Network

NASA Technical Reports Server (NTRS)

2008-01-01

NASA s advanced visual simulations are essential for analyses associated with life cycle planning, design, training, testing, operations, and evaluation. Kennedy Space Center, in particular, uses simulations for ground services and space exploration planning in an effort to reduce risk and costs while improving safety and performance. However, it has been difficult to circulate and share the results of simulation tools among the field centers, and distance and travel expenses have made timely collaboration even harder. In response, NASA joined with Valador Inc. to develop the Distributed Observer Network (DON), a collaborative environment that leverages game technology to bring 3-D simulations to conventional desktop and laptop computers. DON enables teams of engineers working on design and operations to view and collaborate on 3-D representations of data generated by authoritative tools. DON takes models and telemetry from these sources and, using commercial game engine technology, displays the simulation results in a 3-D visual environment. Multiple widely dispersed users, working individually or in groups, can view and analyze simulation results on desktop and laptop computers in real time.

The Structural Underpinnings of Policy Learning: A Classroom Policy Simulation

NASA Astrophysics Data System (ADS)

Bird, Stephen

This paper investigates the relationship between the centrality of individual actors in a social network structure and their policy learning performance. In a dynamic comparable to real-world policy networks, results from a classroom simulation demonstrate a strong relationship between centrality in social learning networks and grade performance. Previous research indicates that social network centrality should have a positive effect on learning in other contexts and this link is tested in a policy learning context. Second, the distinction between collaborative learning versus information diffusion processes in policy learning is examined. Third, frequency of interaction is analyzed to determine whether consistent, frequent tics have a greater impact on the learning process. Finally, the data arc analyzed to determine if the benefits of centrality have limitations or thresholds when benefits no longer accrue. These results demonstrate the importance of network structure, and support a collaborative conceptualization of the policy learning process.

Distributed Observer Network (DON), Version 3.0, User's Guide

NASA Technical Reports Server (NTRS)

Mazzone, Rebecca A.; Conroy, Michael P.

2015-01-01

The Distributed Observer Network (DON) is a data presentation tool developed by the National Aeronautics and Space Administration (NASA) to distribute and publish simulation results. Leveraging the display capabilities inherent in modern gaming technology, DON places users in a fully navigable 3-D environment containing graphical models and allows the users to observe how those models evolve and interact over time in a given scenario. Each scenario is driven with data that has been generated by authoritative NASA simulation tools and exported in accordance with a published data interface specification. This decoupling of the data from the source tool enables DON to faithfully display a simulator's results and ensure that every simulation stakeholder will view the exact same information every time.

Evaluation on surface current observing network of high frequency ground wave radars in the Gulf of Thailand

NASA Astrophysics Data System (ADS)

Yin, Xunqiang; Shi, Junqiang; Qiao, Fangli

2018-05-01

Due to the high cost of ocean observation system, the scientific design of observation network becomes much important. The current network of the high frequency radar system in the Gulf of Thailand has been studied using a three-dimensional coastal ocean model. At first, the observations from current radars have been assimilated into this coastal model and the forecast results have improved due to the data assimilation. But the results also show that further optimization of the observing network is necessary. And then, a series of experiments were carried out to assess the performance of the existing high frequency ground wave radar surface current observation system. The simulated surface current data in three regions were assimilated sequentially using an efficient ensemble Kalman filter data assimilation scheme. The experimental results showed that the coastal surface current observation system plays a positive role in improving the numerical simulation of the currents. Compared with the control experiment without assimilation, the simulation precision of surface and subsurface current had been improved after assimilated the surface currents observed at current networks. However, the improvement for three observing regions was quite different and current observing network in the Gulf of Thailand is not effective and a further optimization is required. Based on these evaluations, a manual scheme has been designed by discarding the redundant and inefficient locations and adding new stations where the performance after data assimilation is still low. For comparison, an objective scheme based on the idea of data assimilation has been obtained. Results show that all the two schemes of observing network perform better than the original network and optimal scheme-based data assimilation is much superior to the manual scheme that based on the evaluation of original observing network in the Gulf of Thailand. The distributions of the optimal network of radars could be a useful guidance for future design of observing system in this region.

The Validity of Quasi-Steady-State Approximations in Discrete Stochastic Simulations

PubMed Central

Kim, Jae Kyoung; Josić, Krešimir; Bennett, Matthew R.

2014-01-01

In biochemical networks, reactions often occur on disparate timescales and can be characterized as either fast or slow. The quasi-steady-state approximation (QSSA) utilizes timescale separation to project models of biochemical networks onto lower-dimensional slow manifolds. As a result, fast elementary reactions are not modeled explicitly, and their effect is captured by nonelementary reaction-rate functions (e.g., Hill functions). The accuracy of the QSSA applied to deterministic systems depends on how well timescales are separated. Recently, it has been proposed to use the nonelementary rate functions obtained via the deterministic QSSA to define propensity functions in stochastic simulations of biochemical networks. In this approach, termed the stochastic QSSA, fast reactions that are part of nonelementary reactions are not simulated, greatly reducing computation time. However, it is unclear when the stochastic QSSA provides an accurate approximation of the original stochastic simulation. We show that, unlike the deterministic QSSA, the validity of the stochastic QSSA does not follow from timescale separation alone, but also depends on the sensitivity of the nonelementary reaction rate functions to changes in the slow species. The stochastic QSSA becomes more accurate when this sensitivity is small. Different types of QSSAs result in nonelementary functions with different sensitivities, and the total QSSA results in less sensitive functions than the standard or the prefactor QSSA. We prove that, as a result, the stochastic QSSA becomes more accurate when nonelementary reaction functions are obtained using the total QSSA. Our work provides an apparently novel condition for the validity of the QSSA in stochastic simulations of biochemical reaction networks with disparate timescales. PMID:25099817

Hybrid Communication Architectures for Distributed Smart Grid Applications

DOE PAGES

Zhang, Jianhua; Hasandka, Adarsh; Wei, Jin; ...

2018-04-09

Wired and wireless communications both play an important role in the blend of communications technologies necessary to enable future smart grid communications. Hybrid networks exploit independent mediums to extend network coverage and improve performance. However, whereas individual technologies have been applied in simulation networks, as far as we know there is only limited attention that has been paid to the development of a suite of hybrid communication simulation models for the communications system design. Hybrid simulation models are needed to capture the mixed communication technologies and IP address mechanisms in one simulation. To close this gap, we have developed amore » suite of hybrid communication system simulation models to validate the critical system design criteria for a distributed solar Photovoltaic (PV) communications system, including a single trip latency of 300 ms, throughput of 9.6 Kbps, and packet loss rate of 1%. In conclusion, the results show that three low-power wireless personal area network (LoWPAN)-based hybrid architectures can satisfy three performance metrics that are critical for distributed energy resource communications.« less

Hybrid Communication Architectures for Distributed Smart Grid Applications

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

Zhang, Jianhua; Hasandka, Adarsh; Wei, Jin

Wired and wireless communications both play an important role in the blend of communications technologies necessary to enable future smart grid communications. Hybrid networks exploit independent mediums to extend network coverage and improve performance. However, whereas individual technologies have been applied in simulation networks, as far as we know there is only limited attention that has been paid to the development of a suite of hybrid communication simulation models for the communications system design. Hybrid simulation models are needed to capture the mixed communication technologies and IP address mechanisms in one simulation. To close this gap, we have developed amore » suite of hybrid communication system simulation models to validate the critical system design criteria for a distributed solar Photovoltaic (PV) communications system, including a single trip latency of 300 ms, throughput of 9.6 Kbps, and packet loss rate of 1%. In conclusion, the results show that three low-power wireless personal area network (LoWPAN)-based hybrid architectures can satisfy three performance metrics that are critical for distributed energy resource communications.« less

Inverse simulation system for manual-controlled rendezvous and docking based on artificial neural network

NASA Astrophysics Data System (ADS)

Zhou, Wanmeng; Wang, Hua; Tang, Guojin; Guo, Shuai

2016-09-01

The time-consuming experimental method for handling qualities assessment cannot meet the increasing fast design requirements for the manned space flight. As a tool for the aircraft handling qualities research, the model-predictive-control structured inverse simulation (MPC-IS) has potential applications in the aerospace field to guide the astronauts' operations and evaluate the handling qualities more effectively. Therefore, this paper establishes MPC-IS for the manual-controlled rendezvous and docking (RVD) and proposes a novel artificial neural network inverse simulation system (ANN-IS) to further decrease the computational cost. The novel system was obtained by replacing the inverse model of MPC-IS with the artificial neural network. The optimal neural network was trained by the genetic Levenberg-Marquardt algorithm, and finally determined by the Levenberg-Marquardt algorithm. In order to validate MPC-IS and ANN-IS, the manual-controlled RVD experiments on the simulator were carried out. The comparisons between simulation results and experimental data demonstrated the validity of two systems and the high computational efficiency of ANN-IS.

Soft-error tolerance and energy consumption evaluation of embedded computer with magnetic random access memory in practical systems using computer simulations

NASA Astrophysics Data System (ADS)

Nebashi, Ryusuke; Sakimura, Noboru; Sugibayashi, Tadahiko

2017-08-01

We evaluated the soft-error tolerance and energy consumption of an embedded computer with magnetic random access memory (MRAM) using two computer simulators. One is a central processing unit (CPU) simulator of a typical embedded computer system. We simulated the radiation-induced single-event-upset (SEU) probability in a spin-transfer-torque MRAM cell and also the failure rate of a typical embedded computer due to its main memory SEU error. The other is a delay tolerant network (DTN) system simulator. It simulates the power dissipation of wireless sensor network nodes of the system using a revised CPU simulator and a network simulator. We demonstrated that the SEU effect on the embedded computer with 1 Gbit MRAM-based working memory is less than 1 failure in time (FIT). We also demonstrated that the energy consumption of the DTN sensor node with MRAM-based working memory can be reduced to 1/11. These results indicate that MRAM-based working memory enhances the disaster tolerance of embedded computers.

SAGRAD: A Program for Neural Network Training with Simulated Annealing and the Conjugate Gradient Method

PubMed Central

Bernal, Javier; Torres-Jimenez, Jose

2015-01-01

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller’s scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller’s algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller’s algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller’s algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data. PMID:26958442

Network simulation using the simulation language for alternate modeling (SLAM 2)

NASA Technical Reports Server (NTRS)

Shen, S.; Morris, D. W.

1983-01-01

The simulation language for alternate modeling (SLAM 2) is a general purpose language that combines network, discrete event, and continuous modeling capabilities in a single language system. The efficacy of the system's network modeling is examined and discussed. Examples are given of the symbolism that is used, and an example problem and model are derived. The results are discussed in terms of the ease of programming, special features, and system limitations. The system offers many features which allow rapid model development and provides an informative standardized output. The system also has limitations which may cause undetected errors and misleading reports unless the user is aware of these programming characteristics.

Quantitative petri net model of gene regulated metabolic networks in the cell.

PubMed

Chen, Ming; Hofestädt, Ralf

2011-01-01

A method to exploit hybrid Petri nets (HPN) for quantitatively modeling and simulating gene regulated metabolic networks is demonstrated. A global kinetic modeling strategy and Petri net modeling algorithm are applied to perform the bioprocess functioning and model analysis. With the model, the interrelations between pathway analysis and metabolic control mechanism are outlined. Diagrammatical results of the dynamics of metabolites are simulated and observed by implementing a HPN tool, Visual Object Net ++. An explanation of the observed behavior of the urea cycle is proposed to indicate possibilities for metabolic engineering and medical care. Finally, the perspective of Petri nets on modeling and simulation of metabolic networks is discussed.

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

PubMed

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

2018-04-24

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

The Interaction of Risk Network Structures and Virus Natural History in the Non-spreading of HIV Among People Who Inject Drugs in the Early Stages of the Epidemic.

PubMed

Dombrowski, Kirk; Khan, Bilal; Habecker, Patrick; Hagan, Holly; Friedman, Samuel R; Saad, Mohamed

2017-04-01

This article explores how social network dynamics may have reduced the spread of HIV-1 infection among people who inject drugs during the early years of the epidemic. Stochastic, discrete event, agent-based simulations are used to test whether a "firewall effect" can arise out of self-organizing processes at the actor level, and whether such an effect can account for stable HIV prevalence rates below population saturation. Repeated simulation experiments show that, in the presence of recurring, acute, and highly infectious outbreaks, micro-network structures combine with the HIV virus's natural history to reduce the spread of the disease. These results indicate that network factors likely played a significant role in the prevention of HIV infection within injection risk networks during periods of peak prevalence. They also suggest that social forces that disturb network connections may diminish the natural firewall effect and result in higher rates of HIV.

The Interaction of Risk Network Structures and Virus Natural History in the non-Spreading of HIV among People Who Inject Drugs in the Early Stages of the Epidemic

PubMed Central

Dombrowski, Kirk; Khan, Bilal; Habecker, Patrick; Hagan, Holly; Friedman, Samuel R.; Saad, Mohamed

2016-01-01

This article explores how social network dynamics may have reduced the spread of HIV-1 infection among people who inject drugs during the early years of the epidemic. Stochastic, discrete event, agent-based simulations are used to test whether a “firewall effect” can arise out of self-organizing processes at the actor level, and whether such an effect can account for stable HIV prevalence rates below population saturation. Repeated simulation experiments show that, in the presence of recurring, acute, and highly infectious outbreaks, micro-network structures combine with the HIV virus’s natural history to reduce the spread of the disease. These results indicate that network factors likely played a significant role in the prevention of HIV infection within injection risk networks during periods of peak prevalence. They also suggest that social forces that disturb network connections may diminish the natural firewall effect and result in higher rates of HIV. PMID:27699596

Output-feedback control of combined sewer networks through receding horizon control with moving horizon estimation

NASA Astrophysics Data System (ADS)

Joseph-Duran, Bernat; Ocampo-Martinez, Carlos; Cembrano, Gabriela

2015-10-01

An output-feedback control strategy for pollution mitigation in combined sewer networks is presented. The proposed strategy provides means to apply model-based predictive control to large-scale sewer networks, in-spite of the lack of measurements at most of the network sewers. In previous works, the authors presented a hybrid linear control-oriented model for sewer networks together with the formulation of Optimal Control Problems (OCP) and State Estimation Problems (SEP). By iteratively solving these problems, preliminary Receding Horizon Control with Moving Horizon Estimation (RHC/MHE) results, based on flow measurements, were also obtained. In this work, the RHC/MHE algorithm has been extended to take into account both flow and water level measurements and the resulting control loop has been extensively simulated to assess the system performance according different measurement availability scenarios and rain events. All simulations have been carried out using a detailed physically based model of a real case-study network as virtual reality.

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.

Minimal autocatalytic networks.

PubMed

Steel, Mike; Hordijk, Wim; Smith, Joshua

2013-09-07

Self-sustaining autocatalytic chemical networks represent a necessary, though not sufficient condition for the emergence of early living systems. These networks have been formalised and investigated within the framework of RAF theory, which has led to a number of insights and results concerning the likelihood of such networks forming. In this paper, we extend this analysis by focussing on how small autocatalytic networks are likely to be when they first emerge. First we show that simulations are unlikely to settle this question, by establishing that the problem of finding a smallest RAF within a catalytic reaction system is NP-hard. However, irreducible RAFs (irrRAFs) can be constructed in polynomial time, and we show it is possible to determine in polynomial time whether a bounded size set of these irrRAFs contain the smallest RAFs within a system. Moreover, we derive rigorous bounds on the sizes of small RAFs and use simulations to sample irrRAFs under the binary polymer model. We then apply mathematical arguments to prove a new result suggested by those simulations: at the transition catalysis level at which RAFs first form in this model, small RAFs are unlikely to be present. We also investigate further the relationship between RAFs and another formal approach to self-sustaining and closed chemical networks, namely chemical organisation theory (COT). Copyright © 2013 Elsevier Ltd. All rights reserved.

Structurally Dynamic Spin Market Networks

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent "brain" is modeled by a recursive neural network with local and global inputs and feedback connections. For specific parametric combination the complex network displays small-world phenomenon combined with scale-free behavior. The identification of a local leader (network hub, agent whose strategies are frequently adapted by its neighbors) is carried out by repeated random walk process through network. The simulations show empirically relevant dynamics of price returns and volatility clustering. The additional emerging aspects of stylized market statistics are Zipfian distributions of fitness.

Synthesis of recurrent neural networks for dynamical system simulation.

PubMed

Trischler, Adam P; D'Eleuterio, Gabriele M T

2016-08-01

We review several of the most widely used techniques for training recurrent neural networks to approximate dynamical systems, then describe a novel algorithm for this task. The algorithm is based on an earlier theoretical result that guarantees the quality of the network approximation. We show that a feedforward neural network can be trained on the vector-field representation of a given dynamical system using backpropagation, then recast it as a recurrent network that replicates the original system's dynamics. After detailing this algorithm and its relation to earlier approaches, we present numerical examples that demonstrate its capabilities. One of the distinguishing features of our approach is that both the original dynamical systems and the recurrent networks that simulate them operate in continuous time. Copyright © 2016 Elsevier Ltd. All rights reserved.

A simplified computational memory model from information processing.

PubMed

Zhang, Lanhua; Zhang, Dongsheng; Deng, Yuqin; Ding, Xiaoqian; Wang, Yan; Tang, Yiyuan; Sun, Baoliang

2016-11-23

This paper is intended to propose a computational model for memory from the view of information processing. The model, called simplified memory information retrieval network (SMIRN), is a bi-modular hierarchical functional memory network by abstracting memory function and simulating memory information processing. At first meta-memory is defined to express the neuron or brain cortices based on the biology and graph theories, and we develop an intra-modular network with the modeling algorithm by mapping the node and edge, and then the bi-modular network is delineated with intra-modular and inter-modular. At last a polynomial retrieval algorithm is introduced. In this paper we simulate the memory phenomena and functions of memorization and strengthening by information processing algorithms. The theoretical analysis and the simulation results show that the model is in accordance with the memory phenomena from information processing view.

Energy efficient strategy for throughput improvement in wireless sensor networks.

PubMed

Jabbar, Sohail; Minhas, Abid Ali; Imran, Muhammad; Khalid, Shehzad; Saleem, Kashif

2015-01-23

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature.

Energy Efficient Strategy for Throughput Improvement in Wireless Sensor Networks

PubMed Central

Jabbar, Sohail; Minhas, Abid Ali; Imran, Muhammad; Khalid, Shehzad; Saleem, Kashif

2015-01-01

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature. PMID:25625902

Using deep neural networks to augment NIF post-shot analysis

NASA Astrophysics Data System (ADS)

Humbird, Kelli; Peterson, Luc; McClarren, Ryan; Field, John; Gaffney, Jim; Kruse, Michael; Nora, Ryan; Spears, Brian

2017-10-01

Post-shot analysis of National Ignition Facility (NIF) experiments is the process of determining which simulation inputs yield results consistent with experimental observations. This analysis is typically accomplished by running suites of manually adjusted simulations, or Monte Carlo sampling surrogate models that approximate the response surfaces of the physics code. These approaches are expensive and often find simulations that match only a small subset of observables simultaneously. We demonstrate an alternative method for performing post-shot analysis using inverse models, which map directly from experimental observables to simulation inputs with quantified uncertainties. The models are created using a novel machine learning algorithm which automates the construction and initialization of deep neural networks to optimize predictive accuracy. We show how these neural networks, trained on large databases of post-shot simulations, can rigorously quantify the agreement between simulation and experiment. This work performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.

Spatial spreading of infectious disease via local and national mobility networks in South Korea

NASA Astrophysics Data System (ADS)

Kwon, Okyu; Son, Woo-Sik

2017-12-01

We study the spread of infectious disease based on local- and national-scale mobility networks. We construct a local mobility network using data on urban bus services to estimate local-scale movement of people. We also construct a national mobility network from orientation-destination data of vehicular traffic between highway tollgates to evaluate national-scale movement of people. A metapopulation model is used to simulate the spread of epidemics. Thus, the number of infected people is simulated using a susceptible-infectious-recovered (SIR) model within the administrative division, and inter-division spread of infected people is determined through local and national mobility networks. In this paper, we consider two scenarios for epidemic spread. In the first, the infectious disease only spreads through local-scale movement of people, that is, the local mobility network. In the second, it spreads via both local and national mobility networks. For the former, the simulation results show infected people sequentially spread to neighboring divisions. Yet for the latter, we observe a faster spreading pattern to distant divisions. Thus, we confirm the national mobility network enhances synchronization among the incidence profiles of all administrative divisions.

Simulation of two-phase flow in horizontal fracture networks with numerical manifold method

NASA Astrophysics Data System (ADS)

Ma, G. W.; Wang, H. D.; Fan, L. F.; Wang, B.

2017-10-01

The paper presents simulation of two-phase flow in discrete fracture networks with numerical manifold method (NMM). Each phase of fluids is considered to be confined within the assumed discrete interfaces in the present method. The homogeneous model is modified to approach the mixed fluids. A new mathematical cover formation for fracture intersection is proposed to satisfy the mass conservation. NMM simulations of two-phase flow in a single fracture, intersection, and fracture network are illustrated graphically and validated by the analytical method or the finite element method. Results show that the motion status of discrete interface significantly depends on the ratio of mobility of two fluids rather than the value of the mobility. The variation of fluid velocity in each fracture segment and the driven fluid content are also influenced by the ratio of mobility. The advantages of NMM in the simulation of two-phase flow in a fracture network are demonstrated in the present study, which can be further developed for practical engineering applications.

Advanced local area network concepts

NASA Technical Reports Server (NTRS)

Grant, Terry

1985-01-01

Development of a good model of the data traffic requirements for Local Area Networks (LANs) onboard the Space Station is the driving problem in this work. A parameterized workload model is under development. An analysis contract has been started specifically to capture the distributed processing requirements for the Space Station and then to develop a top level model to simulate how various processing scenarios can handle the workload and what data communication patterns result. A summary of the Local Area Network Extendsible Simulator 2 Requirements Specification and excerpts from a grant report on the topological design of fiber optic local area networks with application to Expressnet are given.

Reduced-Order Modeling for Flutter/LCO Using Recurrent Artificial Neural Network

NASA Technical Reports Server (NTRS)

Yao, Weigang; Liou, Meng-Sing

2012-01-01

The present study demonstrates the efficacy of a recurrent artificial neural network to provide a high fidelity time-dependent nonlinear reduced-order model (ROM) for flutter/limit-cycle oscillation (LCO) modeling. An artificial neural network is a relatively straightforward nonlinear method for modeling an input-output relationship from a set of known data, for which we use the radial basis function (RBF) with its parameters determined through a training process. The resulting RBF neural network, however, is only static and is not yet adequate for an application to problems of dynamic nature. The recurrent neural network method [1] is applied to construct a reduced order model resulting from a series of high-fidelity time-dependent data of aero-elastic simulations. Once the RBF neural network ROM is constructed properly, an accurate approximate solution can be obtained at a fraction of the cost of a full-order computation. The method derived during the study has been validated for predicting nonlinear aerodynamic forces in transonic flow and is capable of accurate flutter/LCO simulations. The obtained results indicate that the present recurrent RBF neural network is accurate and efficient for nonlinear aero-elastic system analysis

Social Network Analysis and Nutritional Behavior: An Integrated Modeling Approach

PubMed Central

Senior, Alistair M.; Lihoreau, Mathieu; Buhl, Jerome; Raubenheimer, David; Simpson, Stephen J.

2016-01-01

Animals have evolved complex foraging strategies to obtain a nutritionally balanced diet and associated fitness benefits. Recent research combining state-space models of nutritional geometry with agent-based models (ABMs), show how nutrient targeted foraging behavior can also influence animal social interactions, ultimately affecting collective dynamics and group structures. Here we demonstrate how social network analyses can be integrated into such a modeling framework and provide a practical analytical tool to compare experimental results with theory. We illustrate our approach by examining the case of nutritionally mediated dominance hierarchies. First we show how nutritionally explicit ABMs that simulate the emergence of dominance hierarchies can be used to generate social networks. Importantly the structural properties of our simulated networks bear similarities to dominance networks of real animals (where conflicts are not always directly related to nutrition). Finally, we demonstrate how metrics from social network analyses can be used to predict the fitness of agents in these simulated competitive environments. Our results highlight the potential importance of nutritional mechanisms in shaping dominance interactions in a wide range of social and ecological contexts. Nutrition likely influences social interactions in many species, and yet a theoretical framework for exploring these effects is currently lacking. Combining social network analyses with computational models from nutritional ecology may bridge this divide, representing a pragmatic approach for generating theoretical predictions for nutritional experiments. PMID:26858671

Advanced Polymer Network Structures

DTIC Science & Technology

2016-02-01

double networks in a single step was identified from coarse-grained molecular dynamics simulations of polymer solvents bearing rigid side chains dissolved...in a polymer network. Coarse-grained molecular dynamics simulations also explored the mechanical behavior of traditional double networks and...DRI), polymer networks, polymer gels, molecular dynamics simulations , double networks 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF

Scaling of counter-current imbibition recovery curves using artificial neural networks

NASA Astrophysics Data System (ADS)

Jafari, Iman; Masihi, Mohsen; Nasiri Zarandi, Masoud

2018-06-01

Scaling imbibition curves are of great importance in the characterization and simulation of oil production from naturally fractured reservoirs. Different parameters such as matrix porosity and permeability, oil and water viscosities, matrix dimensions, and oil/water interfacial tensions have an effective on the imbibition process. Studies on the scaling imbibition curves along with the consideration of different assumptions have resulted in various scaling equations. In this work, using an artificial neural network (ANN) method, a novel technique is presented for scaling imbibition recovery curves, which can be used for scaling the experimental and field-scale imbibition cases. The imbibition recovery curves for training and testing the neural network were gathered through the simulation of different scenarios using a commercial reservoir simulator. In this ANN-based method, six parameters were assumed to have an effect on the imbibition process and were considered as the inputs for training the network. Using the ‘Bayesian regularization’ training algorithm, the network was trained and tested. Training and testing phases showed superior results in comparison with the other scaling methods. It is concluded that using the new technique is useful for scaling imbibition recovery curves, especially for complex cases, for which the common scaling methods are not designed.

Scalability enhancement of AODV using local link repairing

NASA Astrophysics Data System (ADS)

Jain, Jyoti; Gupta, Roopam; Bandhopadhyay, T. K.

2014-09-01

Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load.

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

Content-Based Multi-Channel Network Coding Algorithm in the Millimeter-Wave Sensor Network

PubMed Central

Lin, Kai; Wang, Di; Hu, Long

2016-01-01

With the development of wireless technology, the widespread use of 5G is already an irreversible trend, and millimeter-wave sensor networks are becoming more and more common. However, due to the high degree of complexity and bandwidth bottlenecks, the millimeter-wave sensor network still faces numerous problems. In this paper, we propose a novel content-based multi-channel network coding algorithm, which uses the functions of data fusion, multi-channel and network coding to improve the data transmission; the algorithm is referred to as content-based multi-channel network coding (CMNC). The CMNC algorithm provides a fusion-driven model based on the Dempster-Shafer (D-S) evidence theory to classify the sensor nodes into different classes according to the data content. By using the result of the classification, the CMNC algorithm also provides the channel assignment strategy and uses network coding to further improve the quality of data transmission in the millimeter-wave sensor network. Extensive simulations are carried out and compared to other methods. Our simulation results show that the proposed CMNC algorithm can effectively improve the quality of data transmission and has better performance than the compared methods. PMID:27376302

Study on Dissemination Patterns in Location-Aware Gossiping Networks

NASA Astrophysics Data System (ADS)

Kami, Nobuharu; Baba, Teruyuki; Yoshikawa, Takashi; Morikawa, Hiroyuki

We study the properties of information dissemination over location-aware gossiping networks leveraging location-based real-time communication applications. Gossiping is a promising method for quickly disseminating messages in a large-scale system, but in its application to information dissemination for location-aware applications, it is important to consider the network topology and patterns of spatial dissemination over the network in order to achieve effective delivery of messages to potentially interested users. To this end, we propose a continuous-space network model extended from Kleinberg's small-world model applicable to actual location-based applications. Analytical and simulation-based study shows that the proposed network achieves high dissemination efficiency resulting from geographically neutral dissemination patterns as well as selective dissemination to proximate users. We have designed a highly scalable location management method capable of promptly updating the network topology in response to node movement and have implemented a distributed simulator to perform dynamic target pursuit experiments as one example of applications that are the most sensitive to message forwarding delay. The experimental results show that the proposed network surpasses other types of networks in pursuit efficiency and achieves the desirable dissemination patterns.

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

ModelforAnalyzing Human Communication Network Based onAgent-Based Simulation

NASA Astrophysics Data System (ADS)

Matsuyama, Shinako; Terano, Takao

This paper discusses dynamic properties of human communications networks, which appears as a result of informationexchanges among people. We propose agent-based simulation (ABS) to examine implicit mechanisms behind the dynamics. The ABS enables us to reveal the characteristics and the differences of the networks regarding the specific communicationgroups. We perform experiments on the ABS with activity data from questionnaires survey and with virtual data which isdifferent from the activity data. We compare the difference between them and show the effectiveness of the ABS through theexperiments.

OSI Network-layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

NASA Astrophysics Data System (ADS)

Lawniczak, Anna T.; Gerisch, Alf; Di Stefano, Bruno

2005-06-01

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path-length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathered using Netzwerk-1, a C++ simulation tool that we developed for our abstraction.

Generalization of Clustering Coefficients to Signed Correlation Networks

PubMed Central

Costantini, Giulio; Perugini, Marco

2014-01-01

The recent interest in network analysis applications in personality psychology and psychopathology has put forward new methodological challenges. Personality and psychopathology networks are typically based on correlation matrices and therefore include both positive and negative edge signs. However, some applications of network analysis disregard negative edges, such as computing clustering coefficients. In this contribution, we illustrate the importance of the distinction between positive and negative edges in networks based on correlation matrices. The clustering coefficient is generalized to signed correlation networks: three new indices are introduced that take edge signs into account, each derived from an existing and widely used formula. The performances of the new indices are illustrated and compared with the performances of the unsigned indices, both on a signed simulated network and on a signed network based on actual personality psychology data. The results show that the new indices are more resistant to sample variations in correlation networks and therefore have higher convergence compared with the unsigned indices both in simulated networks and with real data. PMID:24586367

Percolation of localized attack on isolated and interdependent random networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2014-03-01

Percolation properties of isolated and interdependent random networks have been investigated extensively. The focus of these studies has been on random attacks where each node in network is attacked with the same probability or targeted attack where each node is attacked with a probability being a function of its centrality, such as degree. Here we discuss a new type of realistic attacks which we call a localized attack where a group of neighboring nodes in the networks are attacked. We attack a randomly chosen node, its neighbors, and its neighbor of neighbors and so on, until removing a fraction (1 - p) of the network. This type of attack reflects damages due to localized disasters, such as earthquakes, floods and war zones in real-world networks. We study, both analytically and by simulations the impact of localized attack on percolation properties of random networks with arbitrary degree distributions and discuss in detail random regular (RR) networks, Erdős-Rényi (ER) networks and scale-free (SF) networks. We extend and generalize our theoretical and simulation results of single isolated networks to networks formed of interdependent networks.

SPIR: The potential spreaders involved SIR model for information diffusion in social networks

NASA Astrophysics Data System (ADS)

Rui, Xiaobin; Meng, Fanrong; Wang, Zhixiao; Yuan, Guan; Du, Changjiang

2018-09-01

The Susceptible-Infective-Removed (SIR) model is one of the most widely used models for the information diffusion research in social networks. Many researchers have devoted themselves to improving the classic SIR model in different aspects. However, on the one hand, the equations of these improved models are regarded as continuous functions, while the corresponding simulation experiments use discrete time, leading to the mismatch between numerical solutions got from mathematical method and experimental results obtained by simulating the spreading behaviour of each node. On the other hand, if the equations of these improved models are solved discretely, susceptible nodes will be calculated repeatedly, resulting in a big deviation from the actual value. In order to solve the above problem, this paper proposes a Susceptible-Potential-Infective-Removed (SPIR) model that analyses the diffusion process based on the discrete time according to simulation. Besides, this model also introduces a potential spreader set which solve the problem of repeated calculation effectively. To test the SPIR model, various experiments have been carried out from different angles on both artificial networks and real world networks. The Pearson correlation coefficient between numerical solutions of our SPIR equations and corresponding simulation results is mostly bigger than 0.95, which reveals that the proposed SPIR model is able to depict the information diffusion process with high accuracy.

Coupling effects on turning points of infectious diseases epidemics in scale-free networks.

PubMed

Kim, Kiseong; Lee, Sangyeon; Lee, Doheon; Lee, Kwang Hyung

2017-05-31

Pandemic is a typical spreading phenomenon that can be observed in the human society and is dependent on the structure of the social network. The Susceptible-Infective-Recovered (SIR) model describes spreading phenomena using two spreading factors; contagiousness (β) and recovery rate (γ). Some network models are trying to reflect the social network, but the real structure is difficult to uncover. We have developed a spreading phenomenon simulator that can input the epidemic parameters and network parameters and performed the experiment of disease propagation. The simulation result was analyzed to construct a new marker VRTP distribution. We also induced the VRTP formula for three of the network mathematical models. We suggest new marker VRTP (value of recovered on turning point) to describe the coupling between the SIR spreading and the Scale-free (SF) network and observe the aspects of the coupling effects with the various of spreading and network parameters. We also derive the analytic formulation of VRTP in the fully mixed model, the configuration model, and the degree-based model respectively in the mathematical function form for the insights on the relationship between experimental simulation and theoretical consideration. We discover the coupling effect between SIR spreading and SF network through devising novel marker VRTP which reflects the shifting effect and relates to entropy.

The neural network to determine the mechanical properties of the steels

NASA Astrophysics Data System (ADS)

Yemelyanov, Vitaliy; Yemelyanova, Nataliya; Safonova, Marina; Nedelkin, Aleksey

2018-04-01

The authors describe the neural network structure and software that is designed and developed to determine the mechanical properties of steels. The neural network is developed to refine upon the values of the steels properties. The results of simulations of the developed neural network are shown. The authors note the low standard error of the proposed neural network. To realize the proposed neural network the specialized software has been developed.

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

PubMed

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

2014-01-01

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

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

PubMed Central

Li, Wei

2014-01-01

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

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

Yang, Huan; Cheng, Liang; Chuah, Mooi Choo

In the generation, transmission, and distribution sectors of the smart grid, intelligence of field devices is realized by programmable logic controllers (PLCs). Many smart-grid subsystems are essentially cyber-physical energy systems (CPES): For instance, the power system process (i.e., the physical part) within a substation is monitored and controlled by a SCADA network with hosts running miscellaneous applications (i.e., the cyber part). To study the interactions between the cyber and physical components of a CPES, several co-simulation platforms have been proposed. However, the network simulators/emulators of these platforms do not include a detailed traffic model that takes into account the impactsmore » of the execution model of PLCs on traffic characteristics. As a result, network traces generated by co-simulation only reveal the impacts of the physical process on the contents of the traffic generated by SCADA hosts, whereas the distinction between PLCs and computing nodes (e.g., a hardened computer running a process visualization application) has been overlooked. To generate realistic network traces using co-simulation for the design and evaluation of applications relying on accurate traffic profiles, it is necessary to establish a traffic model for PLCs. In this work, we propose a parameterized model for PLCs that can be incorporated into existing co-simulation platforms. We focus on the DNP3 subsystem of slave PLCs, which automates the processing of packets from the DNP3 master. To validate our approach, we extract model parameters from both the configuration and network traces of real PLCs. Simulated network traces are generated and compared against those from PLCs. Our evaluation shows that our proposed model captures the essential traffic characteristics of DNP3 slave PLCs, which can be used to extend existing co-simulation platforms and gain further insights into the behaviors of CPES.« less

Modeling and Performance Simulation of the Mass Storage Network Environment

NASA Technical Reports Server (NTRS)

Kim, Chan M.; Sang, Janche

2000-01-01

This paper describes the application of modeling and simulation in evaluating and predicting the performance of the mass storage network environment. Network traffic is generated to mimic the realistic pattern of file transfer, electronic mail, and web browsing. The behavior and performance of the mass storage network and a typical client-server Local Area Network (LAN) are investigated by modeling and simulation. Performance characteristics in throughput and delay demonstrate the important role of modeling and simulation in network engineering and capacity planning.

Trace Replay and Network Simulation Tool

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

Acun, Bilge; Jain, Nikhil; Bhatele, Abhinav

2015-03-23

TraceR is a trace reply tool built upon the ROSS-based CODES simulation framework. TraceR can be used for predicting network performances and understanding network behavior by simulating messaging in High Performance Computing applications on interconnection networks.

Trace Replay and Network Simulation Tool

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

Jain, Nikhil; Bhatele, Abhinav; Acun, Bilge

TraceR Is a trace replay tool built upon the ROSS-based CODES simulation framework. TraceR can be used for predicting network performance and understanding network behavior by simulating messaging In High Performance Computing applications on interconnection networks.

Information spreading on mobile communication networks: A new model that incorporates human behaviors

NASA Astrophysics Data System (ADS)

Ren, Fei; Li, Sai-Ping; Liu, Chuang

2017-03-01

Recently, there is a growing interest in the modeling and simulation based on real social networks among researchers in multi-disciplines. Using an empirical social network constructed from the calling records of a Chinese mobile service provider, we here propose a new model to simulate the information spreading process. This model takes into account two important ingredients that exist in real human behaviors: information prevalence and preferential spreading. The fraction of informed nodes when the system reaches an asymptotically stable state is primarily determined by information prevalence, and the heterogeneity of link weights would slow down the information diffusion. Moreover, the sizes of blind clusters which consist of connected uninformed nodes show a power-law distribution, and these uninformed nodes correspond to a particular portion of nodes which are located at special positions in the network, namely at the edges of large clusters or inside the clusters connected through weak links. Since the simulations are performed on a real world network, the results should be useful in the understanding of the influences of social network structures and human behaviors on information propagation.

Life's attractors : understanding developmental systems through reverse engineering and in silico evolution.

PubMed

Jaeger, Johannes; Crombach, Anton

2012-01-01

We propose an approach to evolutionary systems biology which is based on reverse engineering of gene regulatory networks and in silico evolutionary simulations. We infer regulatory parameters for gene networks by fitting computational models to quantitative expression data. This allows us to characterize the regulatory structure and dynamical repertoire of evolving gene regulatory networks with a reasonable amount of experimental and computational effort. We use the resulting network models to identify those regulatory interactions that are conserved, and those that have diverged between different species. Moreover, we use the models obtained by data fitting as starting points for simulations of evolutionary transitions between species. These simulations enable us to investigate whether such transitions are random, or whether they show stereotypical series of regulatory changes which depend on the structure and dynamical repertoire of an evolving network. Finally, we present a case study-the gap gene network in dipterans (flies, midges, and mosquitoes)-to illustrate the practical application of the proposed methodology, and to highlight the kind of biological insights that can be gained by this approach.

Autonomous control of production networks using a pheromone approach

NASA Astrophysics Data System (ADS)

Armbruster, D.; de Beer, C.; Freitag, M.; Jagalski, T.; Ringhofer, C.

2006-04-01

The flow of parts through a production network is usually pre-planned by a central control system. Such central control fails in presence of highly fluctuating demand and/or unforeseen disturbances. To manage such dynamic networks according to low work-in-progress and short throughput times, an autonomous control approach is proposed. Autonomous control means a decentralized routing of the autonomous parts themselves. The parts’ decisions base on backward propagated information about the throughput times of finished parts for different routes. So, routes with shorter throughput times attract parts to use this route again. This process can be compared to ants leaving pheromones on their way to communicate with following ants. The paper focuses on a mathematical description of such autonomously controlled production networks. A fluid model with limited service rates in a general network topology is derived and compared to a discrete-event simulation model. Whereas the discrete-event simulation of production networks is straightforward, the formulation of the addressed scenario in terms of a fluid model is challenging. Here it is shown, how several problems in a fluid model formulation (e.g. discontinuities) can be handled mathematically. Finally, some simulation results for the pheromone-based control with both the discrete-event simulation model and the fluid model are presented for a time-dependent influx.

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

PubMed

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

2000-01-01

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

Leveraging social networks for understanding the evolution of epidemics

PubMed Central

2011-01-01

Background To understand how infectious agents disseminate throughout a population it is essential to capture the social model in a realistic manner. This paper presents a novel approach to modeling the propagation of the influenza virus throughout a realistic interconnection network based on actual individual interactions which we extract from online social networks. The advantage is that these networks can be extracted from existing sources which faithfully record interactions between people in their natural environment. We additionally allow modeling the characteristics of each individual as well as customizing his daily interaction patterns by making them time-dependent. Our purpose is to understand how the infection spreads depending on the structure of the contact network and the individuals who introduce the infection in the population. This would help public health authorities to respond more efficiently to epidemics. Results We implement a scalable, fully distributed simulator and validate the epidemic model by comparing the simulation results against the data in the 2004-2005 New York State Department of Health Report (NYSDOH), with similar temporal distribution results for the number of infected individuals. We analyze the impact of different types of connection models on the virus propagation. Lastly, we analyze and compare the effects of adopting several different vaccination policies, some of them based on individual characteristics -such as age- while others targeting the super-connectors in the social model. Conclusions This paper presents an approach to modeling the propagation of the influenza virus via a realistic social model based on actual individual interactions extracted from online social networks. We implemented a scalable, fully distributed simulator and we analyzed both the dissemination of the infection and the effect of different vaccination policies on the progress of the epidemics. The epidemic values predicted by our simulator match real data from NYSDOH. Our results show that our simulator can be a useful tool in understanding the differences in the evolution of an epidemic within populations with different characteristics and can provide guidance with regard to which, and how many, individuals should be vaccinated to slow down the virus propagation and reduce the number of infections. PMID:22784620

A kinetic Monte Carlo approach to study fluid transport in pore networks

NASA Astrophysics Data System (ADS)

Apostolopoulou, M.; Day, R.; Hull, R.; Stamatakis, M.; Striolo, A.

2017-10-01

The mechanism of fluid migration in porous networks continues to attract great interest. Darcy's law (phenomenological continuum theory), which is often used to describe macroscopically fluid flow through a porous material, is thought to fail in nano-channels. Transport through heterogeneous and anisotropic systems, characterized by a broad distribution of pores, occurs via a contribution of different transport mechanisms, all of which need to be accounted for. The situation is likely more complicated when immiscible fluid mixtures are present. To generalize the study of fluid transport through a porous network, we developed a stochastic kinetic Monte Carlo (KMC) model. In our lattice model, the pore network is represented as a set of connected finite volumes (voxels), and transport is simulated as a random walk of molecules, which "hop" from voxel to voxel. We simulated fluid transport along an effectively 1D pore and we compared the results to those expected by solving analytically the diffusion equation. The KMC model was then implemented to quantify the transport of methane through hydrated micropores, in which case atomistic molecular dynamic simulation results were reproduced. The model was then used to study flow through pore networks, where it was able to quantify the effect of the pore length and the effect of the network's connectivity. The results are consistent with experiments but also provide additional physical insights. Extension of the model will be useful to better understand fluid transport in shale rocks.

Self-organizing network services with evolutionary adaptation.

PubMed

Nakano, Tadashi; Suda, Tatsuya

2005-09-01

This paper proposes a novel framework for developing adaptive and scalable network services. In the proposed framework, a network service is implemented as a group of autonomous agents that interact in the network environment. Agents in the proposed framework are autonomous and capable of simple behaviors (e.g., replication, migration, and death). In this paper, an evolutionary adaptation mechanism is designed using genetic algorithms (GAs) for agents to evolve their behaviors and improve their fitness values (e.g., response time to a service request) to the environment. The proposed framework is evaluated through simulations, and the simulation results demonstrate the ability of autonomous agents to adapt to the network environment. The proposed framework may be suitable for disseminating network services in dynamic and large-scale networks where a large number of data and services need to be replicated, moved, and deleted in a decentralized manner.

An Extended N-Player Network Game and Simulation of Four Investment Strategies on a Complex Innovation Network

PubMed Central

Zhou, Wen; Koptyug, Nikita; Ye, Shutao; Jia, Yifan; Lu, Xiaolong

2016-01-01

As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions. PMID:26745375

An Extended N-Player Network Game and Simulation of Four Investment Strategies on a Complex Innovation Network.

PubMed

Zhou, Wen; Koptyug, Nikita; Ye, Shutao; Jia, Yifan; Lu, Xiaolong

2016-01-01

As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions.

Cyber Physical System Modelling of Distribution Power Systems for Dynamic Demand Response

NASA Astrophysics Data System (ADS)

Chu, Xiaodong; Zhang, Rongxiang; Tang, Maosen; Huang, Haoyi; Zhang, Lei

2018-01-01

Dynamic demand response (DDR) is a package of control methods to enhance power system security. A CPS modelling and simulation platform for DDR in distribution power systems is presented in this paper. CPS modelling requirements of distribution power systems are analyzed. A coupled CPS modelling platform is built for assessing DDR in the distribution power system, which combines seamlessly modelling tools of physical power networks and cyber communication networks. Simulations results of IEEE 13-node test system demonstrate the effectiveness of the modelling and simulation platform.

Stability Depends on Positive Autoregulation in Boolean Gene Regulatory Networks

PubMed Central

Pinho, Ricardo; Garcia, Victor; Irimia, Manuel; Feldman, Marcus W.

2014-01-01

Network motifs have been identified as building blocks of regulatory networks, including gene regulatory networks (GRNs). The most basic motif, autoregulation, has been associated with bistability (when positive) and with homeostasis and robustness to noise (when negative), but its general importance in network behavior is poorly understood. Moreover, how specific autoregulatory motifs are selected during evolution and how this relates to robustness is largely unknown. Here, we used a class of GRN models, Boolean networks, to investigate the relationship between autoregulation and network stability and robustness under various conditions. We ran evolutionary simulation experiments for different models of selection, including mutation and recombination. Each generation simulated the development of a population of organisms modeled by GRNs. We found that stability and robustness positively correlate with autoregulation; in all investigated scenarios, stable networks had mostly positive autoregulation. Assuming biological networks correspond to stable networks, these results suggest that biological networks should often be dominated by positive autoregulatory loops. This seems to be the case for most studied eukaryotic transcription factor networks, including those in yeast, flies and mammals. PMID:25375153

Software defined network architecture based research on load balancing strategy

NASA Astrophysics Data System (ADS)

You, Xiaoqian; Wu, Yang

2018-05-01

As a new type network architecture, software defined network has the key idea of separating the control place of the network from the transmission plane, to manage and control the network in a concentrated way; in addition, the network interface is opened on the control layer and the data layer, so as to achieve programmable control of the network. Considering that only the single shortest route is taken into the calculation of traditional network data flow transmission, and congestion and resource consumption caused by excessive load of link circuits are ignored, a link circuit load based flow media business QoS gurantee system is proposed in this article to divide the flow in the network into ordinary data flow and QoS flow. In this way, it supervises the link circuit load with the controller so as to calculate reasonable route rapidly and issue the flow table to the exchanger, to finish rapid data transmission. In addition, it establishes a simulation platform to acquire optimized result through simulation experiment.

Evolution of tag-based cooperation with emotion on complex networks

NASA Astrophysics Data System (ADS)

Lima, F. W. S.

2018-04-01

We study the evolution of the four strategies: Ethnocentric, altruistic, egoistic and cosmopolitan in one community of individuals through Monte Carlo simulations. Interactions and reproduction among computational agents are simulated on undirected Barabási-Albert (UBA) networks and Erdös-Rènyi random graphs (ER).We study the Hammond-Axelrod model on both UBA networks and ER random graphs for the asexual reproduction case. We use a modified version of the traditional Hammond-Axelrod model and we also allow the agents’ decisions about one of the strategies to take into account the emotion among their equals. Our simulations showed that egoism and altruism win, differently from other results found in the literature where ethnocentric strategy is common.

Neuron splitting in compute-bound parallel network simulations enables runtime scaling with twice as many processors.

PubMed

Hines, Michael L; Eichner, Hubert; Schürmann, Felix

2008-08-01

Neuron tree topology equations can be split into two subtrees and solved on different processors with no change in accuracy, stability, or computational effort; communication costs involve only sending and receiving two double precision values by each subtree at each time step. Splitting cells is useful in attaining load balance in neural network simulations, especially when there is a wide range of cell sizes and the number of cells is about the same as the number of processors. For compute-bound simulations load balance results in almost ideal runtime scaling. Application of the cell splitting method to two published network models exhibits good runtime scaling on twice as many processors as could be effectively used with whole-cell balancing.

A simplified computational memory model from information processing

PubMed Central

Zhang, Lanhua; Zhang, Dongsheng; Deng, Yuqin; Ding, Xiaoqian; Wang, Yan; Tang, Yiyuan; Sun, Baoliang

2016-01-01

This paper is intended to propose a computational model for memory from the view of information processing. The model, called simplified memory information retrieval network (SMIRN), is a bi-modular hierarchical functional memory network by abstracting memory function and simulating memory information processing. At first meta-memory is defined to express the neuron or brain cortices based on the biology and graph theories, and we develop an intra-modular network with the modeling algorithm by mapping the node and edge, and then the bi-modular network is delineated with intra-modular and inter-modular. At last a polynomial retrieval algorithm is introduced. In this paper we simulate the memory phenomena and functions of memorization and strengthening by information processing algorithms. The theoretical analysis and the simulation results show that the model is in accordance with the memory phenomena from information processing view. PMID:27876847

Radionuclide Gas Transport through Nuclear Explosion-Generated Fracture Networks

PubMed Central

Jordan, Amy B.; Stauffer, Philip H.; Knight, Earl E.; Rougier, Esteban; Anderson, Dale N.

2015-01-01

Underground nuclear weapon testing produces radionuclide gases which may seep to the surface. Barometric pumping of gas through explosion-fractured rock is investigated using a new sequentially-coupled hydrodynamic rock damage/gas transport model. Fracture networks are produced for two rock types (granite and tuff) and three depths of burial. The fracture networks are integrated into a flow and transport numerical model driven by surface pressure signals of differing amplitude and variability. There are major differences between predictions using a realistic fracture network and prior results that used a simplified geometry. Matrix porosity and maximum fracture aperture have the greatest impact on gas breakthrough time and window of opportunity for detection, with different effects between granite and tuff simulations highlighting the importance of accurately simulating the fracture network. In particular, maximum fracture aperture has an opposite effect on tuff and granite, due to different damage patterns and their effect on the barometric pumping process. From stochastic simulations using randomly generated hydrogeologic parameters, normalized detection curves are presented to show differences in optimal sampling time for granite and tuff simulations. Seasonal and location-based effects on breakthrough, which occur due to differences in barometric forcing, are stronger where the barometric signal is highly variable. PMID:26676058

Radionuclide Gas Transport through Nuclear Explosion-Generated Fracture Networks.

PubMed

Jordan, Amy B; Stauffer, Philip H; Knight, Earl E; Rougier, Esteban; Anderson, Dale N

2015-12-17

Underground nuclear weapon testing produces radionuclide gases which may seep to the surface. Barometric pumping of gas through explosion-fractured rock is investigated using a new sequentially-coupled hydrodynamic rock damage/gas transport model. Fracture networks are produced for two rock types (granite and tuff) and three depths of burial. The fracture networks are integrated into a flow and transport numerical model driven by surface pressure signals of differing amplitude and variability. There are major differences between predictions using a realistic fracture network and prior results that used a simplified geometry. Matrix porosity and maximum fracture aperture have the greatest impact on gas breakthrough time and window of opportunity for detection, with different effects between granite and tuff simulations highlighting the importance of accurately simulating the fracture network. In particular, maximum fracture aperture has an opposite effect on tuff and granite, due to different damage patterns and their effect on the barometric pumping process. From stochastic simulations using randomly generated hydrogeologic parameters, normalized detection curves are presented to show differences in optimal sampling time for granite and tuff simulations. Seasonal and location-based effects on breakthrough, which occur due to differences in barometric forcing, are stronger where the barometric signal is highly variable.

A laboratory system for the investigation of rain fade compensation techniques for Ka-band satellites

NASA Technical Reports Server (NTRS)

Svoboda, James S.; Kachmar, Brian A.

1993-01-01

The design and performance of a rain fade simulation/counteraction system on a laboratory simulated 30/20 GHz, time division multiple access (TDMA) satellite communications testbed is evaluated. Severe rain attenuation of electromagnetic radiation at 30/20 GHz occurs due to the carrier wavelength approaching the water droplet size. Rain in the downlink path lowers the signal power present at the receiver, resulting in a higher number of bit errors induced in the digital ground terminal. The laboratory simulation performed at NASA Lewis Research Center uses a programmable PIN diode attenuator to simulate 20 GHz satellite downlink geographic rain fade profiles. A computer based network control system monitors the downlink power and informs the network of any power threshold violations, which then prompts the network to issue commands that temporarily increase the gain of the satellite based traveling wave tube (TWT) amplifier. After the rain subsides, the network returns the TWT to the normal energy conserving power mode. Bit error rate (BER) data taken at the receiving ground terminal serves as a measure of the severity of rain degradation, and also evaluates the extent to which the network can improve the faded channel.

Simulation Modeling of Resilience Assessment in Indonesian Fertiliser Industry Supply Networks

NASA Astrophysics Data System (ADS)

Utami, I. D.; Holt, R. J.; McKay, A.

2018-01-01

Supply network resilience is a significant aspect in the performance of the Indonesian fertiliser industry. Decision makers use risk assessment and port management reports to evaluate the availability of infrastructure. An opportunity was identified to incorporate both types of data into an approach for the measurement of resilience. A framework, based on a synthesis of literature and interviews with industry practitioners, covering both social and technical factors is introduced. A simulation model was then built to allow managers to explore implications for resilience and predict levels of risk in different scenarios. Result of interview with respondens from Indonesian fertiliser industry indicated that the simulation model could be valuable in the assessment. This paper provides details of the simulation model for decision makers to explore levels of risk in supply networks. For practitioners, the model could be used by government to assess the current condition of supply networks in Indonesian industries. On the other hand, for academia, the approach provides a new application of agent-based models in research on supply network resilience and presents a real example of how agent-based modeling could be used as to support the assessment approach.

Efficiency of reactant site sampling in network-free simulation of rule-based models for biochemical systems

PubMed Central

Yang, Jin; Hlavacek, William S.

2011-01-01

Rule-based models, which are typically formulated to represent cell signaling systems, can now be simulated via various network-free simulation methods. In a network-free method, reaction rates are calculated for rules that characterize molecular interactions, and these rule rates, which each correspond to the cumulative rate of all reactions implied by a rule, are used to perform a stochastic simulation of reaction kinetics. Network-free methods, which can be viewed as generalizations of Gillespie’s method, are so named because these methods do not require that a list of individual reactions implied by a set of rules be explicitly generated, which is a requirement of other methods for simulating rule-based models. This requirement is impractical for rule sets that imply large reaction networks (i.e., long lists of individual reactions), as reaction network generation is expensive. Here, we compare the network-free simulation methods implemented in RuleMonkey and NFsim, general-purpose software tools for simulating rule-based models encoded in the BioNetGen language. The method implemented in NFsim uses rejection sampling to correct overestimates of rule rates, which introduces null events (i.e., time steps that do not change the state of the system being simulated). The method implemented in RuleMonkey uses iterative updates to track rule rates exactly, which avoids null events. To ensure a fair comparison of the two methods, we developed implementations of the rejection and rejection-free methods specific to a particular class of kinetic models for multivalent ligand-receptor interactions. These implementations were written with the intention of making them as much alike as possible, minimizing the contribution of irrelevant coding differences to efficiency differences. Simulation results show that performance of the rejection method is equal to or better than that of the rejection-free method over wide parameter ranges. However, when parameter values are such that ligand-induced aggregation of receptors yields a large connected receptor cluster, the rejection-free method is more efficient. PMID:21832806

Simulation studies of multiple large wind turbine generators on a utility network

NASA Technical Reports Server (NTRS)

Gilbert, L. J.; Triezenberg, D. M.

1979-01-01

The potential electrical problems that may be inherent in the inertia of clusters of wind turbine generators and an electric utility network were investigated. Preliminary and limited results of an analog simulation of two MOD-2 wind generators tied to an infinite bus indicate little interaction between the generators and between the generators and the bus. The system demonstrated transient stability for the conditions considered.

Advances in dynamic modeling of colorectal cancer signaling-network regions, a path toward targeted therapies

PubMed Central

Kolch, Walter; Kholodenko, Boris N.; Ambrosi, Cristina De; Barla, Annalisa; Biganzoli, Elia M.; Nencioni, Alessio; Patrone, Franco; Ballestrero, Alberto; Zoppoli, Gabriele; Verri, Alessandro; Parodi, Silvio

2015-01-01

The interconnected network of pathways downstream of the TGFβ, WNT and EGF-families of receptor ligands play an important role in colorectal cancer pathogenesis. We studied and implemented dynamic simulations of multiple downstream pathways and described the section of the signaling network considered as a Molecular Interaction Map (MIM). Our simulations used Ordinary Differential Equations (ODEs), which involved 447 reactants and their interactions. Starting from an initial “physiologic condition”, the model can be adapted to simulate individual pathologic cancer conditions implementing alterations/mutations in relevant onco-proteins. We verified some salient model predictions using the mutated colorectal cancer lines HCT116 and HT29. We measured the amount of MYC and CCND1 mRNAs and AKT and ERK phosphorylated proteins, in response to individual or combination onco-protein inhibitor treatments. Experimental and simulation results were well correlated. Recent independently published results were also predicted by our model. Even in the presence of an approximate and incomplete signaling network information, a predictive dynamic modeling seems already possible. An important long term road seems to be open and can be pursued further, by incremental steps, toward even larger and better parameterized MIMs. Personalized treatment strategies with rational associations of signaling-proteins inhibitors, could become a realistic goal. PMID:25671297

Explaining the heterogeneity of functional connectivity findings in multiple sclerosis: An empirically informed modeling study.

PubMed

Tewarie, Prejaas; Steenwijk, Martijn D; Brookes, Matthew J; Uitdehaag, Bernard M J; Geurts, Jeroen J G; Stam, Cornelis J; Schoonheim, Menno M

2018-06-01

To understand the heterogeneity of functional connectivity results reported in the literature, we analyzed the separate effects of grey and white matter damage on functional connectivity and networks in multiple sclerosis. For this, we employed a biophysical thalamo-cortical model consisting of interconnected cortical and thalamic neuronal populations, informed and amended by empirical diffusion MRI tractography data, to simulate functional data that mimic neurophysiological signals. Grey matter degeneration was simulated by decreasing within population connections and white matter degeneration by lowering between population connections, based on lesion predilection sites in multiple sclerosis. For all simulations, functional connectivity and functional network organization are quantified by phase synchronization and network integration, respectively. Modeling results showed that both cortical and thalamic grey matter damage induced a global increase in functional connectivity, whereas white matter damage induced an initially increased connectivity followed by a global decrease. Both white and especially grey matter damage, however, induced a decrease in network integration. These empirically informed simulations show that specific topology and timing of structural damage are nontrivial aspects in explaining functional abnormalities in MS. Insufficient attention to these aspects likely explains contradictory findings in multiple sclerosis functional imaging studies so far. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

Simulation studies of a wide area health care network.

PubMed Central

McDaniel, J. G.

1994-01-01

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

Is there any connection between the network morphology and the fluctuations of the stock market index?

NASA Astrophysics Data System (ADS)

Stefan, F. M.; Atman, A. P. F.

2015-02-01

Models which consider behavioral aspects of the investors have attracted increasing interest in the Finance and Econophysics literature in the last years. Different behavioral profiles (imitation, anti-imitation, indifference) were proposed for the investors, which take their decision based on their trust network (neighborhood). Results from agent-based models have shown that most of the features observed in actual stock market indices can be replicated in simulations. Here, we present a deeper investigation of an agent based model considering different network morphologies (regular, random, small-world) for the investors' trust network, in an attempt to answer the question raised in the title. We study the model by considering four scenarios for the investors and different initial conditions to analyze their influence in the stock market fluctuations. We have characterized the stationary limit for each scenario tested, focusing on the changes introduced when complex networks were used, and calculated the Hurst exponent in some cases. Simulations showed interesting results suggesting that the fluctuations of the stock market index are strongly affected by the network morphology, a remarkable result which we believe was never reported or predicted before.

Dynamic security contingency screening and ranking using neural networks.

PubMed

Mansour, Y; Vaahedi, E; El-Sharkawi, M A

1997-01-01

This paper summarizes BC Hydro's experience in applying neural networks to dynamic security contingency screening and ranking. The idea is to use the information on the prevailing operating condition and directly provide contingency screening and ranking using a trained neural network. To train the two neural networks for the large scale systems of BC Hydro and Hydro Quebec, in total 1691 detailed transient stability simulation were conducted, 1158 for BC Hydro system and 533 for the Hydro Quebec system. The simulation program was equipped with the energy margin calculation module (second kick) to measure the energy margin in each run. The first set of results showed poor performance for the neural networks in assessing the dynamic security. However a number of corrective measures improved the results significantly. These corrective measures included: 1) the effectiveness of output; 2) the number of outputs; 3) the type of features (static versus dynamic); 4) the number of features; 5) system partitioning; and 6) the ratio of training samples to features. The final results obtained using the large scale systems of BC Hydro and Hydro Quebec demonstrates a good potential for neural network in dynamic security assessment contingency screening and ranking.

Local-Area-Network Simulator

NASA Technical Reports Server (NTRS)

Gibson, Jim; Jordan, Joe; Grant, Terry

1990-01-01

Local Area Network Extensible Simulator (LANES) computer program provides method for simulating performance of high-speed local-area-network (LAN) technology. Developed as design and analysis software tool for networking computers on board proposed Space Station. Load, network, link, and physical layers of layered network architecture all modeled. Mathematically models according to different lower-layer protocols: Fiber Distributed Data Interface (FDDI) and Star*Bus. Written in FORTRAN 77.

Evolving Scale-Free Networks by Poisson Process: Modeling and Degree Distribution.

PubMed

Feng, Minyu; Qu, Hong; Yi, Zhang; Xie, Xiurui; Kurths, Jurgen

2016-05-01

Since the great mathematician Leonhard Euler initiated the study of graph theory, the network has been one of the most significant research subject in multidisciplinary. In recent years, the proposition of the small-world and scale-free properties of complex networks in statistical physics made the network science intriguing again for many researchers. One of the challenges of the network science is to propose rational models for complex networks. In this paper, in order to reveal the influence of the vertex generating mechanism of complex networks, we propose three novel models based on the homogeneous Poisson, nonhomogeneous Poisson and birth death process, respectively, which can be regarded as typical scale-free networks and utilized to simulate practical networks. The degree distribution and exponent are analyzed and explained in mathematics by different approaches. In the simulation, we display the modeling process, the degree distribution of empirical data by statistical methods, and reliability of proposed networks, results show our models follow the features of typical complex networks. Finally, some future challenges for complex systems are discussed.

Integration of communications and tracking data processing simulation for space station

NASA Technical Reports Server (NTRS)

Lacovara, Robert C.

1987-01-01

A simplified model of the communications network for the Communications and Tracking Data Processing System (CTDP) was developed. It was simulated by use of programs running on several on-site computers. These programs communicate with one another by means of both local area networks and direct serial connections. The domain of the model and its simulation is from Orbital Replaceable Unit (ORU) interface to Data Management Systems (DMS). The simulation was designed to allow status queries from remote entities across the DMS networks to be propagated through the model to several simulated ORU's. The ORU response is then propagated back to the remote entity which originated the request. Response times at the various levels were investigated in a multi-tasking, multi-user operating system environment. Results indicate that the effective bandwidth of the system may be too low to support expected data volume requirements under conventional operating systems. Instead, some form of embedded process control program may be required on the node computers.

An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks

NASA Astrophysics Data System (ADS)

Zhong, Peijun; Ruan, Feng

2018-03-01

With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks

PubMed Central

2014-01-01

Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism evaluation based on circuit simulation method excludes most of subgraphs which are not probability isomorphism and reduces the search space of the probability isomorphism subgraphs using the mismatch values in the node voltage set. It is an innovative way to find the frequent probability patterns, which can be efficiently applied to probability motif discovery problems in the further studies. PMID:25350277

Modeling and dynamical topology properties of VANET based on complex networks theory

NASA Astrophysics Data System (ADS)

Zhang, Hong; Li, Jie

2015-01-01

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What's more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

Modeling and dynamical topology properties of VANET based on complex networks theory

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

Zhang, Hong; Li, Jie, E-mail: prof.li@foxmail.com

2015-01-15

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate andmore » control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.« less

The Statistical Mechanics of Dilute, Disordered Systems

NASA Astrophysics Data System (ADS)

Blackburn, Roger Michael

Available from UMI in association with The British Library. Requires signed TDF. A graph partitioning problem with variable inter -partition costs is studied by exploiting its mapping on to the Ashkin-Teller spin glass. The cavity method is used to derive the TAP equations and free energy for both extensively connected and dilute systems. Unlike Ising and Potts spin glasses, the self-consistent equation for the distribution of effective fields does not have a solution solely made up of delta functions. Numerical integration is used to find the stable solution, from which the ground state energy is calculated. Simulated annealing is used to test the results. The retrieving activity distribution for networks of boolean functions trained as associative memories for optimal capacity is derived. For infinite networks, outputs are shown to be frozen, in contrast to dilute asymmetric networks trained with the Hebb rule. For finite networks, a steady leaking to the non-retrieving attractor is demonstrated. Simulations of quenched networks are reported which show a departure from this picture: some configurations remain frozen for all time, while others follow cycles of small periods. An estimate of the critical capacity from the simulations is found to be in broad agreement with recent analytical results. The existing theory is extended to include noise on recall, and the behaviour is found to be robust to noise up to order 1/c^2 for networks with connectivity c.

Lattice based Kinetic Monte Carlo Simulations of a complex chemical reaction network

NASA Astrophysics Data System (ADS)

Danielson, Thomas; Savara, Aditya; Hin, Celine

Lattice Kinetic Monte Carlo (KMC) simulations offer a powerful alternative to using ordinary differential equations for the simulation of complex chemical reaction networks. Lattice KMC provides the ability to account for local spatial configurations of species in the reaction network, resulting in a more detailed description of the reaction pathway. In KMC simulations with a large number of reactions, the range of transition probabilities can span many orders of magnitude, creating subsets of processes that occur more frequently or more rarely. Consequently, processes that have a high probability of occurring may be selected repeatedly without actually progressing the system (i.e. the forward and reverse process for the same reaction). In order to avoid the repeated occurrence of fast frivolous processes, it is necessary to throttle the transition probabilities in such a way that avoids altering the overall selectivity. Likewise, as the reaction progresses, new frequently occurring species and reactions may be introduced, making a dynamic throttling algorithm a necessity. We present a dynamic steady-state detection scheme with the goal of accurately throttling rate constants in order to optimize the KMC run time without compromising the selectivity of the reaction network. The algorithm has been applied to a large catalytic chemical reaction network, specifically that of methanol oxidative dehydrogenation, as well as additional pathways on CeO2(111) resulting in formaldehyde, CO, methanol, CO2, H2 and H2O as gas products.

ASP-G: an ASP-based method for finding attractors in genetic regulatory networks

PubMed Central

Mushthofa, Mushthofa; Torres, Gustavo; Van de Peer, Yves; Marchal, Kathleen; De Cock, Martine

2014-01-01

Motivation: Boolean network models are suitable to simulate GRNs in the absence of detailed kinetic information. However, reducing the biological reality implies making assumptions on how genes interact (interaction rules) and how their state is updated during the simulation (update scheme). The exact choice of the assumptions largely determines the outcome of the simulations. In most cases, however, the biologically correct assumptions are unknown. An ideal simulation thus implies testing different rules and schemes to determine those that best capture an observed biological phenomenon. This is not trivial because most current methods to simulate Boolean network models of GRNs and to compute their attractors impose specific assumptions that cannot be easily altered, as they are built into the system. Results: To allow for a more flexible simulation framework, we developed ASP-G. We show the correctness of ASP-G in simulating Boolean network models and obtaining attractors under different assumptions by successfully recapitulating the detection of attractors of previously published studies. We also provide an example of how performing simulation of network models under different settings help determine the assumptions under which a certain conclusion holds. The main added value of ASP-G is in its modularity and declarativity, making it more flexible and less error-prone than traditional approaches. The declarative nature of ASP-G comes at the expense of being slower than the more dedicated systems but still achieves a good efficiency with respect to computational time. Availability and implementation: The source code of ASP-G is available at http://bioinformatics.intec.ugent.be/kmarchal/Supplementary_Information_Musthofa_2014/asp-g.zip. Contact: Kathleen.Marchal@UGent.be or Martine.DeCock@UGent.be Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25028722

Global exponential periodicity and stability of discrete-time complex-valued recurrent neural networks with time-delays.

PubMed

Hu, Jin; Wang, Jun

2015-06-01

In recent years, complex-valued recurrent neural networks have been developed and analysed in-depth in view of that they have good modelling performance for some applications involving complex-valued elements. In implementing continuous-time dynamical systems for simulation or computational purposes, it is quite necessary to utilize a discrete-time model which is an analogue of the continuous-time system. In this paper, we analyse a discrete-time complex-valued recurrent neural network model and obtain the sufficient conditions on its global exponential periodicity and exponential stability. Simulation results of several numerical examples are delineated to illustrate the theoretical results and an application on associative memory is also given. Copyright © 2015 Elsevier Ltd. All rights reserved.

Dynamic autonomous routing technology for IP-based satellite ad hoc networks

NASA Astrophysics Data System (ADS)

Wang, Xiaofei; Deng, Jing; Kostas, Theresa; Rajappan, Gowri

2014-06-01

IP-based routing for military LEO/MEO satellite ad hoc networks is very challenging due to network and traffic heterogeneity, network topology and traffic dynamics. In this paper, we describe a traffic priority-aware routing scheme for such networks, namely Dynamic Autonomous Routing Technology (DART) for satellite ad hoc networks. DART has a cross-layer design, and conducts routing and resource reservation concurrently for optimal performance in the fluid but predictable satellite ad hoc networks. DART ensures end-to-end data delivery with QoS assurances by only choosing routing paths that have sufficient resources, supporting different packet priority levels. In order to do so, DART incorporates several resource management and innovative routing mechanisms, which dynamically adapt to best fit the prevailing conditions. In particular, DART integrates a resource reservation mechanism to reserve network bandwidth resources; a proactive routing mechanism to set up non-overlapping spanning trees to segregate high priority traffic flows from lower priority flows so that the high priority flows do not face contention from low priority flows; a reactive routing mechanism to arbitrate resources between various traffic priorities when needed; a predictive routing mechanism to set up routes for scheduled missions and for anticipated topology changes for QoS assurance. We present simulation results showing the performance of DART. We have conducted these simulations using the Iridium constellation and trajectories as well as realistic military communications scenarios. The simulation results demonstrate DART's ability to discriminate between high-priority and low-priority traffic flows and ensure disparate QoS requirements of these traffic flows.

Gene expression complex networks: synthesis, identification, and analysis.

PubMed

Lopes, Fabrício M; Cesar, Roberto M; Costa, Luciano Da F

2011-10-01

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdös-Rényi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabási-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree variation, decreasing its network recovery rate with the increase of . The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

Correlation Filter Synthesis Using Neural Networks.

DTIC Science & Technology

1993-12-01

trained neural networks may be understood as "smart" data interpolators, the stored filter and the filter synthesis approaches have much in common: in...the former new filters are found by searching a data bank consisting of the filters themselves; in the latter filters are formed from a distributed... data bank that contains neural network interaction strengths or weights. 1.2 Key Results and Outputs Excellent computer simulation results were

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.

Modeling, Simulation and Analysis of Public Key Infrastructure

NASA Technical Reports Server (NTRS)

Liu, Yuan-Kwei; Tuey, Richard; Ma, Paul (Technical Monitor)

1998-01-01

Security is an essential part of network communication. The advances in cryptography have provided solutions to many of the network security requirements. Public Key Infrastructure (PKI) is the foundation of the cryptography applications. The main objective of this research is to design a model to simulate a reliable, scalable, manageable, and high-performance public key infrastructure. We build a model to simulate the NASA public key infrastructure by using SimProcess and MatLab Software. The simulation is from top level all the way down to the computation needed for encryption, decryption, digital signature, and secure web server. The application of secure web server could be utilized in wireless communications. The results of the simulation are analyzed and confirmed by using queueing theory.

On the performance of voltage stepping for the simulation of adaptive, nonlinear integrate-and-fire neuronal networks.

PubMed

Kaabi, Mohamed Ghaith; Tonnelier, Arnaud; Martinez, Dominique

2011-05-01

In traditional event-driven strategies, spike timings are analytically given or calculated with arbitrary precision (up to machine precision). Exact computation is possible only for simplified neuron models, mainly the leaky integrate-and-fire model. In a recent paper, Zheng, Tonnelier, and Martinez (2009) introduced an approximate event-driven strategy, named voltage stepping, that allows the generic simulation of nonlinear spiking neurons. Promising results were achieved in the simulation of single quadratic integrate-and-fire neurons. Here, we assess the performance of voltage stepping in network simulations by considering more complex neurons (quadratic integrate-and-fire neurons with adaptation) coupled with multiple synapses. To handle the discrete nature of synaptic interactions, we recast voltage stepping in a general framework, the discrete event system specification. The efficiency of the method is assessed through simulations and comparisons with a modified time-stepping scheme of the Runge-Kutta type. We demonstrated numerically that the original order of voltage stepping is preserved when simulating connected spiking neurons, independent of the network activity and connectivity.

Neural network to diagnose lining condition

NASA Astrophysics Data System (ADS)

Yemelyanov, V. A.; Yemelyanova, N. Y.; Nedelkin, A. A.; Zarudnaya, M. V.

2018-03-01

The paper presents data on the problem of diagnosing the lining condition at the iron and steel works. The authors describe the neural network structure and software that are designed and developed to determine the lining burnout zones. The simulation results of the proposed neural networks are presented. The authors note the low learning and classification errors of the proposed neural networks. To realize the proposed neural network, the specialized software has been developed.

Hierarchical lattice models of hydrogen-bond networks in water

NASA Astrophysics Data System (ADS)

Dandekar, Rahul; Hassanali, Ali A.

2018-06-01

We develop a graph-based model of the hydrogen-bond network in water, with a view toward quantitatively modeling the molecular-level correlational structure of the network. The networks formed are studied by the constructing the model on two infinite-dimensional lattices. Our models are built bottom up, based on microscopic information coming from atomistic simulations, and we show that the predictions of the model are consistent with known results from ab initio simulations of liquid water. We show that simple entropic models can predict the correlations and clustering of local-coordination defects around tetrahedral waters observed in the atomistic simulations. We also find that orientational correlations between bonds are longer ranged than density correlations, determine the directional correlations within closed loops, and show that the patterns of water wires within these structures are also consistent with previous atomistic simulations. Our models show the existence of density and compressibility anomalies, as seen in the real liquid, and the phase diagram of these models is consistent with the singularity-free scenario previously proposed by Sastry and coworkers [Phys. Rev. E 53, 6144 (1996), 10.1103/PhysRevE.53.6144].

Evaluating the hydraulic and transport properties of peat soil using pore network modeling and X-ray micro computed tomography

NASA Astrophysics Data System (ADS)

Gharedaghloo, Behrad; Price, Jonathan S.; Rezanezhad, Fereidoun; Quinton, William L.

2018-06-01

Micro-scale properties of peat pore space and their influence on hydraulic and transport properties of peat soils have been given little attention so far. Characterizing the variation of these properties in a peat profile can increase our knowledge on the processes controlling contaminant transport through peatlands. As opposed to the common macro-scale (or bulk) representation of groundwater flow and transport processes, a pore network model (PNM) simulates flow and transport processes within individual pores. Here, a pore network modeling code capable of simulating advective and diffusive transport processes through a 3D unstructured pore network was developed; its predictive performance was evaluated by comparing its results to empirical values and to the results of computational fluid dynamics (CFD) simulations. This is the first time that peat pore networks have been extracted from X-ray micro-computed tomography (μCT) images of peat deposits and peat pore characteristics evaluated in a 3D approach. Water flow and solute transport were modeled in the unstructured pore networks mapped directly from μCT images. The modeling results were processed to determine the bulk properties of peat deposits. Results portray the commonly observed decrease in hydraulic conductivity with depth, which was attributed to the reduction of pore radius and increase in pore tortuosity. The increase in pore tortuosity with depth was associated with more decomposed peat soil and decreasing pore coordination number with depth, which extended the flow path of fluid particles. Results also revealed that hydraulic conductivity is isotropic locally, but becomes anisotropic after upscaling to core-scale; this suggests the anisotropy of peat hydraulic conductivity observed in core-scale and field-scale is due to the strong heterogeneity in the vertical dimension that is imposed by the layered structure of peat soils. Transport simulations revealed that for a given solute, the effective diffusion coefficient decreases with depth due to the corresponding increase of diffusional tortuosity. Longitudinal dispersivity of peat also was computed by analyzing advective-dominant transport simulations that showed peat dispersivity is similar to the empirical values reported in the same peat soil; it is not sensitive to soil depth and does not vary much along the soil profile.

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility

PubMed Central

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-01-01

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. PMID:27007373

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility.

PubMed

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-03-19

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

Minimum requirements for predictive pore-network modeling of solute transport in micromodels

NASA Astrophysics Data System (ADS)

Mehmani, Yashar; Tchelepi, Hamdi A.

2017-10-01

Pore-scale models are now an integral part of analyzing fluid dynamics in porous materials (e.g., rocks, soils, fuel cells). Pore network models (PNM) are particularly attractive due to their computational efficiency. However, quantitative predictions with PNM have not always been successful. We focus on single-phase transport of a passive tracer under advection-dominated regimes and compare PNM with high-fidelity direct numerical simulations (DNS) for a range of micromodel heterogeneities. We identify the minimum requirements for predictive PNM of transport. They are: (a) flow-based network extraction, i.e., discretizing the pore space based on the underlying velocity field, (b) a Lagrangian (particle tracking) simulation framework, and (c) accurate transfer of particles from one pore throat to the next. We develop novel network extraction and particle tracking PNM methods that meet these requirements. Moreover, we show that certain established PNM practices in the literature can result in first-order errors in modeling advection-dominated transport. They include: all Eulerian PNMs, networks extracted based on geometric metrics only, and flux-based nodal transfer probabilities. Preliminary results for a 3D sphere pack are also presented. The simulation inputs for this work are made public to serve as a benchmark for the research community.

Unified Approach to Modeling and Simulation of Space Communication Networks and Systems

NASA Technical Reports Server (NTRS)

Barritt, Brian; Bhasin, Kul; Eddy, Wesley; Matthews, Seth

2010-01-01

Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks

Competitive diffusion in online social networks with heterogeneous users

NASA Astrophysics Data System (ADS)

Li, Pei; He, Su; Wang, Hui; Zhang, Xin

2014-06-01

Online social networks have attracted increasing attention since they provide various approaches for hundreds of millions of people to stay connected with their friends. However, most research on diffusion dynamics in epidemiology cannot be applied directly to characterize online social networks, where users are heterogeneous and may act differently according to their standpoints. In this paper, we propose models to characterize the competitive diffusion in online social networks with heterogeneous users. We classify messages into two types (i.e., positive and negative) and users into three types (i.e., positive, negative and neutral). We estimate the positive (negative) influence for a user generating a given type message, which is the number of times that positive (negative) messages are processed (i.e., read) incurred by this action. We then consider the diffusion threshold, above which the corresponding influence will approach infinity, and the effect threshold, above which the unexpected influence of generating a message will exceed the expected one. We verify all these results by simulations, which show the analysis results are perfectly consistent with the simulation results. These results are of importance in understanding the diffusion dynamics in online social networks, and also critical for advertisers in viral marketing where there are fans, haters and neutrals.

VLSI synthesis of digital application specific neural networks

NASA Technical Reports Server (NTRS)

Beagles, Grant; Winters, Kel

1991-01-01

Neural networks tend to fall into two general categories: (1) software simulations, or (2) custom hardware that must be trained. The scope of this project is the merger of these two classifications into a system whereby a software model of a network is trained to perform a specific task and the results used to synthesize a standard cell realization of the network using automated tools.

An Interactive Simulation Program for Exploring Computational Models of Auto-Associative Memory.

PubMed

Fink, Christian G

2017-01-01

While neuroscience students typically learn about activity-dependent plasticity early in their education, they often struggle to conceptually connect modification at the synaptic scale with network-level neuronal dynamics, not to mention with their own everyday experience of recalling a memory. We have developed an interactive simulation program (based on the Hopfield model of auto-associative memory) that enables the user to visualize the connections generated by any pattern of neural activity, as well as to simulate the network dynamics resulting from such connectivity. An accompanying set of student exercises introduces the concepts of pattern completion, pattern separation, and sparse versus distributed neural representations. Results from a conceptual assessment administered before and after students worked through these exercises indicate that the simulation program is a useful pedagogical tool for illustrating fundamental concepts of computational models of memory.

Nanophotonic particle simulation and inverse design using artificial neural networks.

PubMed

Peurifoy, John; Shen, Yichen; Jing, Li; Yang, Yi; Cano-Renteria, Fidel; DeLacy, Brendan G; Joannopoulos, John D; Tegmark, Max; Soljačić, Marin

2018-06-01

We propose a method to use artificial neural networks to approximate light scattering by multilayer nanoparticles. We find that the network needs to be trained on only a small sampling of the data to approximate the simulation to high precision. Once the neural network is trained, it can simulate such optical processes orders of magnitude faster than conventional simulations. Furthermore, the trained neural network can be used to solve nanophotonic inverse design problems by using back propagation, where the gradient is analytical, not numerical.

Simulating synchronization in neuronal networks

NASA Astrophysics Data System (ADS)

Fink, Christian G.

2016-06-01

We discuss several techniques used in simulating neuronal networks by exploring how a network's connectivity structure affects its propensity for synchronous spiking. Network connectivity is generated using the Watts-Strogatz small-world algorithm, and two key measures of network structure are described. These measures quantify structural characteristics that influence collective neuronal spiking, which is simulated using the leaky integrate-and-fire model. Simulations show that adding a small number of random connections to an otherwise lattice-like connectivity structure leads to a dramatic increase in neuronal synchronization.

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

PubMed

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

2018-06-01

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

Studies on Radar Sensor Networks

DTIC Science & Technology

2007-08-08

scheme in which 2-D image was created via adding voltages with the appropriate time offset. Simulation results show that our DCT-based scheme works...using RSNs in terms of the probability of miss detection PMD and the root mean square error (RMSE). Simulation results showed that multi-target detection... Simulation results are presented to evaluate the feasibility and effectiveness of the proposed JMIC algorithm in a query surveillance region. 5 SVD-QR and

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

Wilson, David G.; Cook, Marvin A.

This report summarizes collaborative efforts between Secure Scalable Microgrid and Korean Institute of Energy Research team members . The efforts aim to advance microgrid research and development towards the efficient utilization of networked microgrids . The collaboration resulted in the identification of experimental and real time simulation capabilities that may be leveraged for networked microgrids research, development, and demonstration . Additional research was performed to support the demonstration of control techniques within real time simulation and with hardware in the loop for DC microgrids .

Network Flow Simulation of Fluid Transients in Rocket Propulsion Systems

NASA Technical Reports Server (NTRS)

Bandyopadhyay, Alak; Hamill, Brian; Ramachandran, Narayanan; Majumdar, Alok

2011-01-01

Fluid transients, also known as water hammer, can have a significant impact on the design and operation of both spacecraft and launch vehicle propulsion systems. These transients often occur at system activation and shutdown. The pressure rise due to sudden opening and closing of valves of propulsion feed lines can cause serious damage during activation and shutdown of propulsion systems. During activation (valve opening) and shutdown (valve closing), pressure surges must be predicted accurately to ensure structural integrity of the propulsion system fluid network. In the current work, a network flow simulation software (Generalized Fluid System Simulation Program) based on Finite Volume Method has been used to predict the pressure surges in the feed line due to both valve closing and valve opening using two separate geometrical configurations. The valve opening pressure surge results are compared with experimental data available in the literature and the numerical results compared very well within reasonable accuracy (< 5%) for a wide range of inlet-to-initial pressure ratios. A Fast Fourier Transform is preformed on the pressure oscillations to predict the various modal frequencies of the pressure wave. The shutdown problem, i.e. valve closing problem, the simulation results are compared with the results of Method of Characteristics. Most rocket engines experience a longitudinal acceleration, known as "pogo" during the later stage of engine burn. In the shutdown example problem, an accumulator has been used in the feed system to demonstrate the "pogo" mitigation effects in the feed system of propellant. The simulation results using GFSSP compared very well with the results of Method of Characteristics.

Optimal information transfer in enzymatic networks: A field theoretic formulation

NASA Astrophysics Data System (ADS)

Samanta, Himadri S.; Hinczewski, Michael; Thirumalai, D.

2017-07-01

Signaling in enzymatic networks is typically triggered by environmental fluctuations, resulting in a series of stochastic chemical reactions, leading to corruption of the signal by noise. For example, information flow is initiated by binding of extracellular ligands to receptors, which is transmitted through a cascade involving kinase-phosphatase stochastic chemical reactions. For a class of such networks, we develop a general field-theoretic approach to calculate the error in signal transmission as a function of an appropriate control variable. Application of the theory to a simple push-pull network, a module in the kinase-phosphatase cascade, recovers the exact results for error in signal transmission previously obtained using umbral calculus [Hinczewski and Thirumalai, Phys. Rev. X 4, 041017 (2014), 10.1103/PhysRevX.4.041017]. We illustrate the generality of the theory by studying the minimal errors in noise reduction in a reaction cascade with two connected push-pull modules. Such a cascade behaves as an effective three-species network with a pseudointermediate. In this case, optimal information transfer, resulting in the smallest square of the error between the input and output, occurs with a time delay, which is given by the inverse of the decay rate of the pseudointermediate. Surprisingly, in these examples the minimum error computed using simulations that take nonlinearities and discrete nature of molecules into account coincides with the predictions of a linear theory. In contrast, there are substantial deviations between simulations and predictions of the linear theory in error in signal propagation in an enzymatic push-pull network for a certain range of parameters. Inclusion of second-order perturbative corrections shows that differences between simulations and theoretical predictions are minimized. Our study establishes that a field theoretic formulation of stochastic biological signaling offers a systematic way to understand error propagation in networks of arbitrary complexity.

A program to compute the soft Robinson-Foulds distance between phylogenetic networks.

PubMed

Lu, Bingxin; Zhang, Louxin; Leong, Hon Wai

2017-03-14

Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic networks, phylogenetic trees and clusters serve as the basis for reconstruction and comparison of phylogenetic networks. To understand these relationships, two problems are raised: the tree containment problem, which asks whether a phylogenetic tree is displayed in a phylogenetic network, and the cluster containment problem, which asks whether a cluster is represented at a node in a phylogenetic network. Both the problems are NP-complete. A fast exponential-time algorithm for the cluster containment problem on arbitrary networks is developed and implemented in C. The resulting program is further extended into a computer program for fast computation of the Soft Robinson-Foulds distance between phylogenetic networks. Two computer programs are developed for facilitating reconstruction and validation of phylogenetic network models in evolutionary and comparative genomics. Our simulation tests indicated that they are fast enough for use in practice. Additionally, the distribution of the Soft Robinson-Foulds distance between phylogenetic networks is demonstrated to be unlikely normal by our simulation data.

Synchronization between uncertain nonidentical networks with quantum chaotic behavior

NASA Astrophysics Data System (ADS)

Li, Wenlin; Li, Chong; Song, Heshan

2016-11-01

Synchronization between uncertain nonidentical networks with quantum chaotic behavior is researched. The identification laws of unknown parameters in state equations of network nodes, the adaptive laws of configuration matrix elements and outer coupling strengths are determined based on Lyapunov theorem. The conditions of realizing synchronization between uncertain nonidentical networks are discussed and obtained. Further, Jaynes-Cummings model in physics are taken as the nodes of two networks and simulation results show that the synchronization performance between networks is very stable.

Studies on the population dynamics of a rumor-spreading model in online social networks

NASA Astrophysics Data System (ADS)

Dong, Suyalatu; Fan, Feng-Hua; Huang, Yong-Chang

2018-02-01

This paper sets up a rumor spreading model in online social networks based on the European fox rabies SIR model. The model considers the impact of changing number of online social network users, combines the transmission dynamics to set up a population dynamics of rumor spreading model in online social networks. Simulation is carried out on online social network, and results show that the new rumor spreading model is in accordance with the real propagation characteristics in online social networks.

Altered Micro-RNA Degradation Promotes Tumor Heterogeneity: A Result from Boolean Network Modeling.

PubMed

Wu, Yunyi; Krueger, Gerhard R F; Wang, Guanyu

2016-02-01

Cancer heterogeneity may reflect differential dynamical outcomes of the regulatory network encompassing biomolecules at both transcriptional and post-transcriptional levels. In other words, differential gene-expression profiles may correspond to different stable steady states of a mathematical model for simulation of biomolecular networks. To test this hypothesis, we simplified a regulatory network that is important for soft-tissue sarcoma metastasis and heterogeneity, comprising of transcription factors, micro-RNAs, and signaling components of the NOTCH pathway. We then used a Boolean network model to simulate the dynamics of this network, and particularly investigated the consequences of differential miRNA degradation modes. We found that efficient miRNA degradation is crucial for sustaining a homogenous and healthy phenotype, while defective miRNA degradation may lead to multiple stable steady states and ultimately to carcinogenesis and heterogeneity. Copyright© 2016 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.

Study on the effect of sink moving trajectory on wireless sensor networks

NASA Astrophysics Data System (ADS)

Zhong, Peijun; Ruan, Feng

2018-03-01

Wireless sensor networks are developing very fast in recent years, due to their wide potential applications. However there exists the so-called hot spot problem, namely the nodes close to static sink node tend to die earlier than other nodes since they have heavier burden to forward. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we make extensive experimental simulations for circular sensor network, with one mobile sink moving along different radius circumference. The whole network is divided into several clusters and there is one cluster head (CH) inside each cluster. The ordinary sensors communicate with CH and CHs construct a chain until the sink node. Simulation results show that the best network performance appears when sink moves along 0.25 R in terms of network lifetime.

Measurement-device-independent quantum communication with an untrusted source

NASA Astrophysics Data System (ADS)

Xu, Feihu

2015-07-01

Measurement-device-independent quantum key distribution (MDI-QKD) can provide enhanced security compared to traditional QKD, and it constitutes an important framework for a quantum network with an untrusted network server. Still, a key assumption in MDI-QKD is that the sources are trusted. We propose here a MDI quantum network with a single untrusted source. We have derived a complete proof of the unconditional security of MDI-QKD with an untrusted source. Using simulations, we have considered various real-life imperfections in its implementation, and the simulation results show that MDI-QKD with an untrusted source provides a key generation rate that is close to the rate of initial MDI-QKD in the asymptotic setting. Our work proves the feasibility of the realization of a quantum network. The network users need only low-cost modulation devices, and they can share both an expensive detector and a complicated laser provided by an untrusted network server.

Open-source framework for power system transmission and distribution dynamics co-simulation

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

Huang, Renke; Fan, Rui; Daily, Jeff

The promise of the smart grid entails more interactions between the transmission and distribution networks, and there is an immediate need for tools to provide the comprehensive modelling and simulation required to integrate operations at both transmission and distribution levels. Existing electromagnetic transient simulators can perform simulations with integration of transmission and distribution systems, but the computational burden is high for large-scale system analysis. For transient stability analysis, currently there are only separate tools for simulating transient dynamics of the transmission and distribution systems. In this paper, we introduce an open source co-simulation framework “Framework for Network Co-Simulation” (FNCS), togethermore » with the decoupled simulation approach that links existing transmission and distribution dynamic simulators through FNCS. FNCS is a middleware interface and framework that manages the interaction and synchronization of the transmission and distribution simulators. Preliminary testing results show the validity and capability of the proposed open-source co-simulation framework and the decoupled co-simulation methodology.« less

Linear and Nonlinear Elasticity of Networks Made of Comb-like Polymers and Bottle-Brushes

NASA Astrophysics Data System (ADS)

Liang, H.; Dobrynin, A.; Everhart, M.; Daniel, W.; Vatankhah-Varnoosfaderani, M.; Sheiko, S.

We study mechanical properties of networks made of combs and bottle-brushes by computer simulations, theoretical calculations and experimental techniques. The networks are prepared by cross-linking backbones of combs or bottle-brushes with linear chains. This results in ``hybrid'' networks consisting of linear chains and strands of combs or bottle-brushes. In the framework of the phantom network model, the network modulus at small deformations G0 can be represented as a sum of contributions from linear chains, G0 , l, and strands of comb or bottle-brush, G0 , bb. If the length of extended backbone between crosslinks, Rmax, is much longer than the Kuhn length, bk, the modulus scales with the degree of polymerization of the side chains, nsc, and number of monomers between side chains, ng, as G0 , bb (nsc/ng + 1)-1. In the limit when bk becomes of the order of Rmax, the combs and bottle-brushes can be considered as semiflexible chains, resulting in a network modulus to be G0 , bb (nsc/ng + 1)-1(nsc2/2/ng) . In the nonlinear deformation regime, the strain-hardening behavior is described by the nonlinear network deformation model, which predicts that the true stress is a universal function of the structural modulus, G, first strain invariant, I1, and deformation ratio, β. The results of the computer simulations and predictions of the theoretical model are in a good agreement with experimental results. NSF DMR-1409710, DMR-1407645, DMR-1624569, DMR-1436201.

Effect of simulated rill erosion on overland flow connectivity in synthetically generated fields

NASA Astrophysics Data System (ADS)

Penuela Fernandez, Andres; Rocio Rodriguez Pleguezuelo, Carmen; Javaux, Mathieu; Bielders, Charles L.

2014-05-01

Preferential flow paths developed during rill erosion processes connect different parts of the soil surface that may increase the degree of connectivity and hence the hydrological response of the soil surface. However, few studies have tried to quantify the effect of rill networks on overland flow connectivity. For this purpose, simulated rill networks were generated by the RillGrow erosion model (Favis-Mortlock, 1998; Favis-Mortlock et al. 2000) on synthetically generated fields. To characterize the hydrological connectivity a functional connectivity indicator called the relative surface connection function (RSCf) (Antoine et al. 2009) was used. This indicator, which relates the area connected to the outflow boundary to the degree of filling of maximum depression storage (MDS), is fast to compute and was previously shown to be able to efficiently discriminate between contrasted connectivity scenarios. The RSCf function was calculated for different DEM obtained at different times during the development of the simulated rill networks. The evolution of overland flow connectivity was then quantified and compared at these different time steps. The results of this study showed that the changes in microtopography resulting from the simulated rill erosion have a strong impact on the hydrological connectivity as reflected in the RSCf. Furthermore, the results show that the evolution of the RSCf may allow identifying different types of erosion since the shape of the RSCf only starts to change when rill networks are visualized on the surface.

Establishing a Modern Ground Network for Space Geodesy Applications

NASA Technical Reports Server (NTRS)

Pearlman, M.; Pavlis, E.; Altamimi, Z.; Noll, C.

2010-01-01

Ground-based networks of co-located space-geodesy techniques (VLBI, SLR, GLASS, DORIS) are the basis for the development and maintenance of the :International Terrestrial deference Frame (ITRE), which is the basis for our metric measurements of global change. The Global Geodetic Observing System (GGOS) within the International Association of Geodesy has established a task to develop a strategy to design, integrate and maintain the fundamental geodetic network and supporting infrastructure in a sustainable way to satisfy the long-term requirements for the reference frame. The GGOS goal is an origin definition at I mm or better and a temporal stability on the order of 0.1 mm/y, with similar numbers for the scale and orientation components. These goals are based on scientific requirements to address sea level rise with confidence. As a first step, simulations focused on establishing the optimal global SLR and VLBI network, since these two techniques alone are sufficient to define the reference frame. The GLASS constellations will then distribute the reference frame to users anywhere on the Earth. Using simulated data to be collected by the future networks, we investigated various designs and the resulting accuracy in the origin, scale and orientation of the resulting ITRF. We present here the results of extensive simulation studies aimed at designing optimal global geodetic networks to support GGOS science products. Current estimates are the network will require 24 - 32 globally distributed co-location sites. Stations in the near global network will require geologically stable sites witla good weather, established infrastructure, and local support and personnel. EGOS will seek groups that are interested in participation. GGOS intends to issues a Call for Participation of groups that would like to take part in the network implementation and operation_ Some examples of integrated stations currently in operation or under development will be presented. We will examine necessary conditions and challenges in designing a co-location station.

Percolation Pore Network Study on the Residue Gas Saturation of Dry Reservoir Rocks

NASA Astrophysics Data System (ADS)

Cheng, T.; Tang, Y. B.; Zou, G. Y.; Jiang, K.; Li, M.

2014-12-01

We tried to model the effect of pore size heterogeneity and pore connectivity on the residue gas saturation for dry gas reservoir rocks. If we consider that snap-off does not exist and only piston displacement takes place in all pores with the same size during imbibition process, in the extreme case, the residue gas saturation will be equal to zero. Thus we can suppose that the residue gas saturation of dry rocks is mainly controlled by the pore size distribution. To verify the assumption, percolation pore networks (i.e., three-dimensional simple cubic (SC) and body-center cubic (BCC)) were used in the study. The connectivity and the pore size distribution in percolation pore network could be changed randomly. The concept of water phase connectivity zw(i.e., water coordination number) and gas phase connectivity zg (i.e., gas coordination number) was introduced here. zw and zg will change during simulation and can be estimated numerically from the results of simulations through gradually saturated networks by water. The Simulation results show that when zg less than or equal to 1.5 during water quasi - static imbibition, the gas will be trapped in rock pores. Network simulation results also shows that the residue gas saturation Srg follows a power law relationship (i.e.,Srg∝σrα, where σr is normalized standard deviation of the pore radius distribution, and exponent α is a function of coordination number). This indicates that the residue gas saturation has no explicit relationship with porosity and permeability as it should have in light of previous study, pore radius distribution is the principal factor in determining the residue gas saturation of dry reservoir rocks.

Reinforce Networking Theory with OPNET Simulation

ERIC Educational Resources Information Center

Guo, Jinhua; Xiang, Weidong; Wang, Shengquan

2007-01-01

As networking systems have become more complex and expensive, hands-on experiments based on networking simulation have become essential for teaching the key computer networking topics to students. The simulation approach is the most cost effective and highly useful because it provides a virtual environment for an assortment of desirable features…

Biogeochemical metabolic modeling of methanogenesis by Methanosarcina barkeri

NASA Astrophysics Data System (ADS)

Jensvold, Z. D.; Jin, Q.

2015-12-01

Methanogenesis, the biological process of methane production, is the final step of natural organic matter degradation. In studying natural methanogenesis, important questions include how fast methanogenesis proceeds and how methanogens adapt to the environment. To address these questions, we propose a new approach - biogeochemical reaction modeling - by simulating the metabolic networks of methanogens. Biogeochemical reaction modeling combines geochemical reaction modeling and genome-scale metabolic modeling. Geochemical reaction modeling focuses on the speciation of electron donors and acceptors in the environment, and therefore the energy available to methanogens. Genome-scale metabolic modeling predicts microbial rates and metabolic strategies. Specifically, this approach describes methanogenesis using an enzyme network model, and computes enzyme rates by accounting for both the kinetics and thermodynamics. The network model is simulated numerically to predict enzyme abundances and rates of methanogen metabolism. We applied this new approach to Methanosarcina barkeri strain fusaro, a model methanogen that makes methane by reducing carbon dioxide and oxidizing dihydrogen. The simulation results match well with the results of previous laboratory experiments, including the magnitude of proton motive force and the kinetic parameters of Methanosarcina barkeri. The results also predict that in natural environments, the configuration of methanogenesis network, including the concentrations of enzymes and metabolites, differs significantly from that under laboratory settings.

Distribution of shortest cycle lengths in random networks

NASA Astrophysics Data System (ADS)

Bonneau, Haggai; Hassid, Aviv; Biham, Ofer; Kühn, Reimer; Katzav, Eytan

2017-12-01

We present analytical results for the distribution of shortest cycle lengths (DSCL) in random networks. The approach is based on the relation between the DSCL and the distribution of shortest path lengths (DSPL). We apply this approach to configuration model networks, for which analytical results for the DSPL were obtained before. We first calculate the fraction of nodes in the network which reside on at least one cycle. Conditioning on being on a cycle, we provide the DSCL over ensembles of configuration model networks with degree distributions which follow a Poisson distribution (Erdős-Rényi network), degenerate distribution (random regular graph), and a power-law distribution (scale-free network). The mean and variance of the DSCL are calculated. The analytical results are found to be in very good agreement with the results of computer simulations.

Network traffic behaviour near phase transition point

NASA Astrophysics Data System (ADS)

Lawniczak, A. T.; Tang, X.

2006-03-01

We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnect) Reference Model of packet switching networks. The Network Layer is responsible for routing packets across the network from their sources to their destinations and for control of congestion in data networks. Using the model we investigate spatio-temporal packets traffic dynamics near the phase transition point for various network connection topologies, and static and adaptive routing algorithms. We present selected simulation results and analyze them.

On the powerful use of simulations in the quake-catcher network to efficiently position low-cost earthquake sensors

USGS Publications Warehouse

Benson, K.; Estrada, T.; Taufer, M.; Lawrence, J.; Cochran, E.

2011-01-01

The Quake-Catcher Network (QCN) uses low-cost sensors connected to volunteer computers across the world to monitor seismic events. The location and density of these sensors' placement can impact the accuracy of the event detection. Because testing different special arrangements of new sensors could disrupt the currently active project, this would best be accomplished in a simulated environment. This paper presents an accurate and efficient framework for simulating the low cost QCN sensors and identifying their most effective locations and densities. Results presented show how our simulations are reliable tools to study diverse scenarios under different geographical and infrastructural constraints. ?? 2011 IEEE.

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

PubMed Central

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

2017-01-01

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

A carrier sensed multiple access protocol for high data base rate ring networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, Kurt J.; Overstreet, C. Michael; Khanna, S.; Paterra, Frank

1990-01-01

The results of the study of a simple but effective media access protocol for high data rate networks are presented. The protocol is based on the fact that at high data rates networks can contain multiple messages simultaneously over their span, and that in a ring, nodes used to detect the presence of a message arriving from the immediate upstream neighbor. When an incoming signal is detected, the node must either abort or truncate a message it is presently sending. Thus, the protocol with local carrier sensing and multiple access is designated CSMA/RN. The performance of CSMA/RN with TTattempt and truncate is studied using analytic and simulation models. Three performance factors, wait or access time, service time and response or end-to-end travel time are presented. The service time is basically a function of the network rate, it changes by a factor of 1 between no load and full load. Wait time, which is zero for no load, remains small for load factors up to 70 percent of full load. Response time, which adds travel time while on the network to wait and service time, is mainly a function of network length, especially for longer distance networks. Simulation results are shown for CSMA/RN where messages are removed at the destination. A wide range of local and metropolitan area network parameters including variations in message size, network length, and node count are studied. Finally, a scaling factor based upon the ratio of message to network length demonstrates that the results, and hence, the CSMA/RN protocol, are applicable to wide area networks.

Parallel discrete event simulation using shared memory

NASA Technical Reports Server (NTRS)

Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.

1988-01-01

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Parallel discrete event simulation: A shared memory approach

NASA Technical Reports Server (NTRS)

Reed, Daniel A.; Malony, Allen D.; Mccredie, Bradley D.

1987-01-01

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.

Near real-time traffic routing

NASA Technical Reports Server (NTRS)

Yang, Chaowei (Inventor); Xie, Jibo (Inventor); Zhou, Bin (Inventor); Cao, Ying (Inventor)

2012-01-01

A near real-time physical transportation network routing system comprising: a traffic simulation computing grid and a dynamic traffic routing service computing grid. The traffic simulator produces traffic network travel time predictions for a physical transportation network using a traffic simulation model and common input data. The physical transportation network is divided into a multiple sections. Each section has a primary zone and a buffer zone. The traffic simulation computing grid includes multiple of traffic simulation computing nodes. The common input data includes static network characteristics, an origin-destination data table, dynamic traffic information data and historical traffic data. The dynamic traffic routing service computing grid includes multiple dynamic traffic routing computing nodes and generates traffic route(s) using the traffic network travel time predictions.

Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

PubMed Central

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks. PMID:22412343

Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.

PubMed

Wen, Chih-Yu; Chen, Ying-Chih

2009-01-01

This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

Network Modeling and Energy-Efficiency Optimization for Advanced Machine-to-Machine Sensor Networks

PubMed Central

Jung, Sungmo; Kim, Jong Hyun; Kim, Seoksoo

2012-01-01

Wireless machine-to-machine sensor networks with multiple radio interfaces are expected to have several advantages, including high spatial scalability, low event detection latency, and low energy consumption. Here, we propose a network model design method involving network approximation and an optimized multi-tiered clustering algorithm that maximizes node lifespan by minimizing energy consumption in a non-uniformly distributed network. Simulation results show that the cluster scales and network parameters determined with the proposed method facilitate a more efficient performance compared to existing methods. PMID:23202190

Effect of nanowire curviness on the percolation resistivity of transparent, conductive metal nanowire networks

NASA Astrophysics Data System (ADS)

Hicks, Jeremy; Li, Junying; Ying, Chen; Ural, Ant

2018-05-01

We study the effect of nanowire curviness on the percolation resistivity of transparent, conductive metal nanowire networks by Monte Carlo simulations. We generate curvy nanowires as one-dimensional sticks using 3rd-order Bézier curves. The degree of curviness in the network is quantified by the concept of curviness angle and curl ratio. We systematically study the interaction between the effect of curviness and five other nanowire/device parameters on the network resistivity, namely nanowire density, nanowire length, device length, device width, and nanowire alignment. We find that the resistivity exhibits a power law dependence on the curl ratio, which is a signature of percolation transport. In each case, we extract the power-law scaling critical exponents and explain the results using geometrical and physical arguments. The value of the curl ratio critical exponent is not universal, but increases as the other nanowire/device parameters drive the network toward the percolation threshold. We find that, for randomly oriented networks, curviness is undesirable since it increases the resistivity. For well-aligned networks, on the other hand, some curviness is highly desirable, since the resistivity minimum occurs for partially curvy nanowires. We explain these results by considering the two competing effects of curviness on the percolation resistivity. The results presented in this work can be extended to any network, film, or nanocomposite consisting of one-dimensional nanoelements. Our results show that Monte Carlo simulations are an essential predictive tool for both studying the percolation transport and optimizing the electronic properties of transparent, conductive nanowire networks for a wide range of applications.

BioNSi: A Discrete Biological Network Simulator Tool.

PubMed

Rubinstein, Amir; Bracha, Noga; Rudner, Liat; Zucker, Noga; Sloin, Hadas E; Chor, Benny

2016-08-05

Modeling and simulation of biological networks is an effective and widely used research methodology. The Biological Network Simulator (BioNSi) is a tool for modeling biological networks and simulating their discrete-time dynamics, implemented as a Cytoscape App. BioNSi includes a visual representation of the network that enables researchers to construct, set the parameters, and observe network behavior under various conditions. To construct a network instance in BioNSi, only partial, qualitative biological data suffices. The tool is aimed for use by experimental biologists and requires no prior computational or mathematical expertise. BioNSi is freely available at http://bionsi.wix.com/bionsi , where a complete user guide and a step-by-step manual can also be found.

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.

Statistical mechanics of a cat's cradle

NASA Astrophysics Data System (ADS)

Shen, Tongye; Wolynes, Peter G.

2006-11-01

It is believed that, much like a cat's cradle, the cytoskeleton can be thought of as a network of strings under tension. We show that both regular and random bond-disordered networks having bonds that buckle upon compression exhibit a variety of phase transitions as a function of temperature and extension. The results of self-consistent phonon calculations for the regular networks agree very well with computer simulations at finite temperature. The analytic theory also yields a rigidity onset (mechanical percolation) and the fraction of extended bonds for random networks. There is very good agreement with the simulations by Delaney et al (2005 Europhys. Lett. 72 990). The mean field theory reveals a nontranslationally invariant phase with self-generated heterogeneity of tautness, representing 'antiferroelasticity'.

Multiscale fracture network characterization and impact on flow: A case study on the Latemar carbonate platform

NASA Astrophysics Data System (ADS)

Hardebol, N. J.; Maier, C.; Nick, H.; Geiger, S.; Bertotti, G.; Boro, H.

2015-12-01

A fracture network arrangement is quantified across an isolated carbonate platform from outcrop and aerial imagery to address its impact on fluid flow. The network is described in terms of fracture density, orientation, and length distribution parameters. Of particular interest is the role of fracture cross connections and abutments on the effective permeability. Hence, the flow simulations explicitly account for network topology by adopting Discrete-Fracture-and-Matrix description. The interior of the Latemar carbonate platform (Dolomites, Italy) is taken as outcrop analogue for subsurface reservoirs of isolated carbonate build-ups that exhibit a fracture-dominated permeability. New is our dual strategy to describe the fracture network both as deterministic- and stochastic-based inputs for flow simulations. The fracture geometries are captured explicitly and form a multiscale data set by integration of interpretations from outcrops, airborne imagery, and lidar. The deterministic network descriptions form the basis for descriptive rules that are diagnostic of the complex natural fracture arrangement. The fracture networks exhibit a variable degree of multitier hierarchies with smaller-sized fractures abutting against larger fractures under both right and oblique angles. The influence of network topology on connectivity is quantified using Discrete-Fracture-Single phase fluid flow simulations. The simulation results show that the effective permeability for the fracture and matrix ensemble can be 50 to 400 times higher than the matrix permeability of 1.0 · 10-14 m2. The permeability enhancement is strongly controlled by the connectivity of the fracture network. Therefore, the degree of intersecting and abutting fractures should be captured from outcrops with accuracy to be of value as analogue.

Network-level reproduction number and extinction threshold for vector-borne diseases.

PubMed

Xue, Ling; Scoglio, Caterina

2015-06-01

The basic reproduction number of deterministic models is an essential quantity to predict whether an epidemic will spread or not. Thresholds for disease extinction contribute crucial knowledge of disease control, elimination, and mitigation of infectious diseases. Relationships between basic reproduction numbers of two deterministic network-based ordinary differential equation vector-host models, and extinction thresholds of corresponding stochastic continuous-time Markov chain models are derived under some assumptions. Numerical simulation results for malaria and Rift Valley fever transmission on heterogeneous networks are in agreement with analytical results without any assumptions, reinforcing that the relationships may always exist and proposing a mathematical problem for proving existence of the relationships in general. Moreover, numerical simulations show that the basic reproduction number does not monotonically increase or decrease with the extinction threshold. Consistent trends of extinction probability observed through numerical simulations provide novel insights into mitigation strategies to increase the disease extinction probability. Research findings may improve understandings of thresholds for disease persistence in order to control vector-borne diseases.

Simulating Chemistry in Star Forming Environments

NASA Astrophysics Data System (ADS)

Gong, Munan

Chemistry plays an important role in the interstellar medium (ISM), regulating the heating and cooling of the gas and determining abundances of molecular species that trace gas properties in observations. One of the most abundant and important molecules in the ISM is CO. CO is a main coolant for the molecular ISM, and the CO(J = 1 - 0) line emission is a widely used observational tracer for molecular clouds. In Chapter 2, we propose a new simplified chemical network for hydrogen and carbon chemistry in the atomic and molecular ISM. We compare results from our chemical network in detail with results from a full photodissociation region (PDR) code, and also with the Nelson & Langer (NL99) network previously adopted in the simulation literature. We show that our chemical network gives similar results to the PDR code in the equilibrium abundances of all species over a wide range of densities, temperature, and metallicities, whereas the NL99 network shows significant disagreement. We also compare with observations of diffuse and translucent clouds. We find that the CO, CHx and OHx abundances are consistent with equilibrium predictions for densities n = 100 - 1000 cm-3, but the predicted equilibrium CI abundance is higher than observations, signaling the potential importance of non-equilibrium/dynamical effects. In Chapter 3, we apply our new chemistry network to a study of the XCO conversion factor, which is used to convert the CO luminosity to the total H2 mass. We use numerical simulations to investigate how XCO depends on numerical resolution, non-equilibrium chemistry, physical environment, and observational beam size. Our study employs 3D magnetohydrodynamics (MHD) simulations of galactic disks with solar neighborhood conditions, where star formation and the three-phase interstellar medium (ISM) is self-consistently generated by the interaction between gravity and stellar feedback. Synthetic CO maps are obtained by post-processing the MHD simulations with chemistry and radiation transfer. We find that CO is only an approximate tracer of H2. Nevertheless, 〈 XCO〉 = 0.7 - 1.0 x 1020 cm-2K-1km-1 s consistent with observations, insensitive to the evolutionary ISM state or the far-ultraviolet (FUV) radiation field strength. Our numerical simulations successfully reproduce the observed variations of X CO on parsec scales, as well as the dependence of X CO on extinction and the CO excitation temperature.

Comparison of RF spectrum prediction methods for dynamic spectrum access

NASA Astrophysics Data System (ADS)

Kovarskiy, Jacob A.; Martone, Anthony F.; Gallagher, Kyle A.; Sherbondy, Kelly D.; Narayanan, Ram M.

2017-05-01

Dynamic spectrum access (DSA) refers to the adaptive utilization of today's busy electromagnetic spectrum. Cognitive radio/radar technologies require DSA to intelligently transmit and receive information in changing environments. Predicting radio frequency (RF) activity reduces sensing time and energy consumption for identifying usable spectrum. Typical spectrum prediction methods involve modeling spectral statistics with Hidden Markov Models (HMM) or various neural network structures. HMMs describe the time-varying state probabilities of Markov processes as a dynamic Bayesian network. Neural Networks model biological brain neuron connections to perform a wide range of complex and often non-linear computations. This work compares HMM, Multilayer Perceptron (MLP), and Recurrent Neural Network (RNN) algorithms and their ability to perform RF channel state prediction. Monte Carlo simulations on both measured and simulated spectrum data evaluate the performance of these algorithms. Generalizing spectrum occupancy as an alternating renewal process allows Poisson random variables to generate simulated data while energy detection determines the occupancy state of measured RF spectrum data for testing. The results suggest that neural networks achieve better prediction accuracy and prove more adaptable to changing spectral statistics than HMMs given sufficient training data.

Bringing simulation to engineers in the field: a Web 2.0 approach.

PubMed

Haines, Robert; Khan, Kashif; Brooke, John

2009-07-13

Field engineers working on water distribution systems have to implement day-to-day operational decisions. Since pipe networks are highly interconnected, the effects of such decisions are correlated with hydraulic and water quality conditions elsewhere in the network. This makes the provision of predictive decision support tools (DSTs) for field engineers critical to optimizing the engineering work on the network. We describe how we created DSTs to run on lightweight mobile devices by using the Web 2.0 technique known as Software as a Service. We designed our system following the architectural style of representational state transfer. The system not only displays static geographical information system data for pipe networks, but also dynamic information and prediction of network state, by invoking and displaying the results of simulations running on more powerful remote resources.

Enterprise virtual private network (VPN) with dense wavelength division multiplexing (DWDM) design

NASA Astrophysics Data System (ADS)

Carranza, Aparicio

An innovative computer simulation and modeling tool for metropolitan area optical data communication networks is presented. These models address the unique requirements of Virtual Private Networks for enterprise data centers, which may comprise a mixture of protocols including ESCON, FICON, Fibre Channel, Sysplex protocols (ETR, CLO, ISC); and other links interconnected over dark fiber using Dense Wavelength Division Multiplexing (DWDM). Our models have the capability of designing a network with minimal inputs; to compute optical link budgets; suggest alternative configurations; and also optimize the design based on user-defined performance metrics. The models make use of Time Division Multiplexing (TDM) wherever possible for lower data rate traffics. Simulation results for several configurations are presented and they have been validated by means of experiments conducted on the IBM enterprise network testbed in Poughkeepsie, N.Y.

Reorganization of river networks under changing spatiotemporal precipitation patterns: An optimal channel network approach

NASA Astrophysics Data System (ADS)

Abed-Elmdoust, Armaghan; Miri, Mohammad-Ali; Singh, Arvind

2016-11-01

We investigate the impact of changing nonuniform spatial and temporal precipitation patterns on the evolution of river networks. To achieve this, we develop a two-dimensional optimal channel network (OCN) model with a controllable rainfall distribution to simulate the evolution of river networks, governed by the principle of minimum energy expenditure, inside a prescribed boundary. We show that under nonuniform precipitation conditions, river networks reorganize significantly toward new patterns with different geomorphic and hydrologic signatures. This reorganization is mainly observed in the form of migration of channels of different orders, widening or elongation of basins as well as formation and extinction of channels and basins. In particular, when the precipitation gradient is locally increased, the higher-order channels, including the mainstream river, migrate toward regions with higher precipitation intensity. Through pertinent examples, the reorganization of the drainage network is quantified via stream parameters such as Horton-Strahler and Tokunaga measures, order-based channel total length and river long profiles obtained via simulation of three-dimensional basin topography, while the hydrologic response of the evolved network is investigated using metrics such as hydrograph and power spectral density of simulated streamflows at the outlet of the network. In addition, using OCNs, we investigate the effect of orographic precipitation patterns on multicatchment landscapes composed of several interacting basins. Our results show that network-inspired methods can be utilized as insightful and versatile models for directly exploring the effects of climate change on the evolution of river drainage systems.

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management.

PubMed

Cruz-Piris, Luis; Rivera, Diego; Fernandez, Susel; Marsa-Maestre, Ivan

2018-02-02

One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network.

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management

PubMed Central

2018-01-01

One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network. PMID:29393884

A robust fractional-order PID controller design based on active queue management for TCP network

NASA Astrophysics Data System (ADS)

Hamidian, Hamideh; Beheshti, Mohammad T. H.

2018-01-01

In this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.

BioNetCAD: design, simulation and experimental validation of synthetic biochemical networks

PubMed Central

Rialle, Stéphanie; Felicori, Liza; Dias-Lopes, Camila; Pérès, Sabine; El Atia, Sanaâ; Thierry, Alain R.; Amar, Patrick; Molina, Franck

2010-01-01

Motivation: Synthetic biology studies how to design and construct biological systems with functions that do not exist in nature. Biochemical networks, although easier to control, have been used less frequently than genetic networks as a base to build a synthetic system. To date, no clear engineering principles exist to design such cell-free biochemical networks. Results: We describe a methodology for the construction of synthetic biochemical networks based on three main steps: design, simulation and experimental validation. We developed BioNetCAD to help users to go through these steps. BioNetCAD allows designing abstract networks that can be implemented thanks to CompuBioTicDB, a database of parts for synthetic biology. BioNetCAD enables also simulations with the HSim software and the classical Ordinary Differential Equations (ODE). We demonstrate with a case study that BioNetCAD can rationalize and reduce further experimental validation during the construction of a biochemical network. Availability and implementation: BioNetCAD is freely available at http://www.sysdiag.cnrs.fr/BioNetCAD. It is implemented in Java and supported on MS Windows. CompuBioTicDB is freely accessible at http://compubiotic.sysdiag.cnrs.fr/ Contact: stephanie.rialle@sysdiag.cnrs.fr; franck.molina@sysdiag.cnrs.fr Supplementary information: Supplementary data are available at Bioinformatics online. PMID:20628073

Simulation platform of LEO satellite communication system based on OPNET

NASA Astrophysics Data System (ADS)

Zhang, Yu; Zhang, Yong; Li, Xiaozhuo; Wang, Chuqiao; Li, Haihao

2018-02-01

For the purpose of verifying communication protocol in the low earth orbit (LEO) satellite communication system, an Optimized Network Engineering Tool (OPNET) based simulation platform is built. Using the three-layer modeling mechanism, the network model, the node model and the process model of the satellite communication system are built respectively from top to bottom, and the protocol will be implemented by finite state machine and Proto-C language. According to satellite orbit parameters, orbit files are generated via Satellite Tool Kit (STK) and imported into OPNET, and the satellite nodes move along their orbits. The simulation platform adopts time-slot-driven mode, divides simulation time into continuous time slots, and allocates slot number for each time slot. A resource allocation strategy is simulated on this platform, and the simulation results such as resource utilization rate, system throughput and packet delay are analyzed, which indicate that this simulation platform has outstanding versatility.

Radionuclide gas transport through nuclear explosion-generated fracture networks

DOE PAGES

Jordan, Amy B.; Stauffer, Philip H.; Knight, Earl E.; ...

2015-12-17

Underground nuclear weapon testing produces radionuclide gases which may seep to the surface. Barometric pumping of gas through explosion-fractured rock is investigated using a new sequentially-coupled hydrodynamic rock damage/gas transport model. Fracture networks are produced for two rock types (granite and tuff) and three depths of burial. The fracture networks are integrated into a flow and transport numerical model driven by surface pressure signals of differing amplitude and variability. There are major differences between predictions using a realistic fracture network and prior results that used a simplified geometry. Matrix porosity and maximum fracture aperture have the greatest impact on gasmore » breakthrough time and window of opportunity for detection, with different effects between granite and tuff simulations highlighting the importance of accurately simulating the fracture network. In particular, maximum fracture aperture has an opposite effect on tuff and granite, due to different damage patterns and their effect on the barometric pumping process. From stochastic simulations using randomly generated hydrogeologic parameters, normalized detection curves are presented to show differences in optimal sampling time for granite and tuff simulations. In conclusion, seasonal and location-based effects on breakthrough, which occur due to differences in barometric forcing, are stronger where the barometric signal is highly variable.« less

Radionuclide gas transport through nuclear explosion-generated fracture networks

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

Jordan, Amy B.; Stauffer, Philip H.; Knight, Earl E.

Underground nuclear weapon testing produces radionuclide gases which may seep to the surface. Barometric pumping of gas through explosion-fractured rock is investigated using a new sequentially-coupled hydrodynamic rock damage/gas transport model. Fracture networks are produced for two rock types (granite and tuff) and three depths of burial. The fracture networks are integrated into a flow and transport numerical model driven by surface pressure signals of differing amplitude and variability. There are major differences between predictions using a realistic fracture network and prior results that used a simplified geometry. Matrix porosity and maximum fracture aperture have the greatest impact on gasmore » breakthrough time and window of opportunity for detection, with different effects between granite and tuff simulations highlighting the importance of accurately simulating the fracture network. In particular, maximum fracture aperture has an opposite effect on tuff and granite, due to different damage patterns and their effect on the barometric pumping process. From stochastic simulations using randomly generated hydrogeologic parameters, normalized detection curves are presented to show differences in optimal sampling time for granite and tuff simulations. In conclusion, seasonal and location-based effects on breakthrough, which occur due to differences in barometric forcing, are stronger where the barometric signal is highly variable.« less

Competing dynamic phases of active polymer networks

NASA Astrophysics Data System (ADS)

Freedman, Simon; Banerjee, Shiladitya; Dinner, Aaron R.

Recent experiments on in-vitro reconstituted assemblies of F-actin, myosin-II motors, and cross-linking proteins show that tuning local network properties can changes the fundamental biomechanical behavior of the system. For example, by varying cross-linker density and actin bundle rigidity, one can switch between contractile networks useful for reshaping cells, polarity sorted networks ideal for directed molecular transport, and frustrated networks with robust structural properties. To efficiently investigate the dynamic phases of actomyosin networks, we developed a coarse grained non-equilibrium molecular dynamics simulation of model semiflexible filaments, molecular motors, and cross-linkers with phenomenologically defined interactions. The simulation's accuracy was verified by benchmarking the mechanical properties of its individual components and collective behavior against experimental results at the molecular and network scales. By adjusting the model's parameters, we can reproduce the qualitative phases observed in experiment and predict the protein characteristics where phase crossovers could occur in collective network dynamics. Our model provides a framework for understanding cells' multiple uses of actomyosin networks and their applicability in materials research. Supported by the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program.

Programmable multi-node quantum network design and simulation

NASA Astrophysics Data System (ADS)

Dasari, Venkat R.; Sadlier, Ronald J.; Prout, Ryan; Williams, Brian P.; Humble, Travis S.

2016-05-01

Software-defined networking offers a device-agnostic programmable framework to encode new network functions. Externally centralized control plane intelligence allows programmers to write network applications and to build functional network designs. OpenFlow is a key protocol widely adopted to build programmable networks because of its programmability, flexibility and ability to interconnect heterogeneous network devices. We simulate the functional topology of a multi-node quantum network that uses programmable network principles to manage quantum metadata for protocols such as teleportation, superdense coding, and quantum key distribution. We first show how the OpenFlow protocol can manage the quantum metadata needed to control the quantum channel. We then use numerical simulation to demonstrate robust programmability of a quantum switch via the OpenFlow network controller while executing an application of superdense coding. We describe the software framework implemented to carry out these simulations and we discuss near-term efforts to realize these applications.

Nanophotonic particle simulation and inverse design using artificial neural networks

PubMed Central

Peurifoy, John; Shen, Yichen; Jing, Li; Cano-Renteria, Fidel; DeLacy, Brendan G.; Joannopoulos, John D.; Tegmark, Max

2018-01-01

We propose a method to use artificial neural networks to approximate light scattering by multilayer nanoparticles. We find that the network needs to be trained on only a small sampling of the data to approximate the simulation to high precision. Once the neural network is trained, it can simulate such optical processes orders of magnitude faster than conventional simulations. Furthermore, the trained neural network can be used to solve nanophotonic inverse design problems by using back propagation, where the gradient is analytical, not numerical. PMID:29868640

Quantum versus simulated annealing in wireless interference network optimization.

PubMed

Wang, Chi; Chen, Huo; Jonckheere, Edmond

2016-05-16

Quantum annealing (QA) serves as a specialized optimizer that is able to solve many NP-hard problems and that is believed to have a theoretical advantage over simulated annealing (SA) via quantum tunneling. With the introduction of the D-Wave programmable quantum annealer, a considerable amount of effort has been devoted to detect and quantify quantum speedup. While the debate over speedup remains inconclusive as of now, instead of attempting to show general quantum advantage, here, we focus on a novel real-world application of D-Wave in wireless networking-more specifically, the scheduling of the activation of the air-links for maximum throughput subject to interference avoidance near network nodes. In addition, D-Wave implementation is made error insensitive by a novel Hamiltonian extra penalty weight adjustment that enlarges the gap and substantially reduces the occurrence of interference violations resulting from inevitable spin bias and coupling errors. The major result of this paper is that quantum annealing benefits more than simulated annealing from this gap expansion process, both in terms of ST99 speedup and network queue occupancy. It is the hope that this could become a real-word application niche where potential benefits of quantum annealing could be objectively assessed.

Supervisory control of mobile sensor networks: math formulation, simulation, and implementation.

PubMed

Giordano, Vincenzo; Ballal, Prasanna; Lewis, Frank; Turchiano, Biagio; Zhang, Jing Bing

2006-08-01

This paper uses a novel discrete-event controller (DEC) for the coordination of cooperating heterogeneous wireless sensor networks (WSNs) containing both unattended ground sensors (UGSs) and mobile sensor robots. The DEC sequences the most suitable tasks for each agent and assigns sensor resources according to the current perception of the environment. A matrix formulation makes this DEC particularly useful for WSN, where missions change and sensor agents may be added or may fail. WSN have peculiarities that complicate their supervisory control. Therefore, this paper introduces several new tools for DEC design and operation, including methods for generating the required supervisory matrices based on mission planning, methods for modifying the matrices in the event of failed nodes, or nodes entering the network, and a novel dynamic priority assignment weighting approach for selecting the most appropriate and useful sensors for a given mission task. The resulting DEC represents a complete dynamical description of the WSN system, which allows a fast programming of deployable WSN, a computer simulation analysis, and an efficient implementation. The DEC is actually implemented on an experimental wireless-sensor-network prototyping system. Both simulation and experimental results are presented to show the effectiveness and versatility of the developed control architecture.

Dynamics and control of diseases in networks with community structure.

PubMed

Salathé, Marcel; Jones, James H

2010-04-08

The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc.) depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how such community structure affects epidemics may provide insights for preventing the spread of disease between communities by changing the structure of the contact network through pharmaceutical or non-pharmaceutical interventions. We use empirical and simulated networks to investigate the spread of disease in networks with community structure. We find that community structure has a major impact on disease dynamics, and we show that in networks with strong community structure, immunization interventions targeted at individuals bridging communities are more effective than those simply targeting highly connected individuals. Because the structure of relevant contact networks is generally not known, and vaccine supply is often limited, there is great need for efficient vaccination algorithms that do not require full knowledge of the network. We developed an algorithm that acts only on locally available network information and is able to quickly identify targets for successful immunization intervention. The algorithm generally outperforms existing algorithms when vaccine supply is limited, particularly in networks with strong community structure. Understanding the spread of infectious diseases and designing optimal control strategies is a major goal of public health. Social networks show marked patterns of community structure, and our results, based on empirical and simulated data, demonstrate that community structure strongly affects disease dynamics. These results have implications for the design of control strategies.

An Efficient Framework Model for Optimizing Routing Performance in VANETs.

PubMed

Al-Kharasani, Nori M; Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala; Hanapi, Zurina Mohd

2018-02-15

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED).

Nonparametric Simulation of Signal Transduction Networks with Semi-Synchronized Update

PubMed Central

Nassiri, Isar; Masoudi-Nejad, Ali; Jalili, Mahdi; Moeini, Ali

2012-01-01

Simulating signal transduction in cellular signaling networks provides predictions of network dynamics by quantifying the changes in concentration and activity-level of the individual proteins. Since numerical values of kinetic parameters might be difficult to obtain, it is imperative to develop non-parametric approaches that combine the connectivity of a network with the response of individual proteins to signals which travel through the network. The activity levels of signaling proteins computed through existing non-parametric modeling tools do not show significant correlations with the observed values in experimental results. In this work we developed a non-parametric computational framework to describe the profile of the evolving process and the time course of the proportion of active form of molecules in the signal transduction networks. The model is also capable of incorporating perturbations. The model was validated on four signaling networks showing that it can effectively uncover the activity levels and trends of response during signal transduction process. PMID:22737250

Modeling complexity in engineered infrastructure system: Water distribution network as an example

NASA Astrophysics Data System (ADS)

Zeng, Fang; Li, Xiang; Li, Ke

2017-02-01

The complex topology and adaptive behavior of infrastructure systems are driven by both self-organization of the demand and rigid engineering solutions. Therefore, engineering complex systems requires a method balancing holism and reductionism. To model the growth of water distribution networks, a complex network model was developed following the combination of local optimization rules and engineering considerations. The demand node generation is dynamic and follows the scaling law of urban growth. The proposed model can generate a water distribution network (WDN) similar to reported real-world WDNs on some structural properties. Comparison with different modeling approaches indicates that a realistic demand node distribution and co-evolvement of demand node and network are important for the simulation of real complex networks. The simulation results indicate that the efficiency of water distribution networks is exponentially affected by the urban growth pattern. On the contrary, the improvement of efficiency by engineering optimization is limited and relatively insignificant. The redundancy and robustness, on another aspect, can be significantly improved through engineering methods.

Advances and issues from the simulation of planetary magnetospheres with recent supercomputer systems

NASA Astrophysics Data System (ADS)

Fukazawa, K.; Walker, R. J.; Kimura, T.; Tsuchiya, F.; Murakami, G.; Kita, H.; Tao, C.; Murata, K. T.

2016-12-01

Planetary magnetospheres are very large, while phenomena within them occur on meso- and micro-scales. These scales range from 10s of planetary radii to kilometers. To understand dynamics in these multi-scale systems, numerical simulations have been performed by using the supercomputer systems. We have studied the magnetospheres of Earth, Jupiter and Saturn by using 3-dimensional magnetohydrodynamic (MHD) simulations for a long time, however, we have not obtained the phenomena near the limits of the MHD approximation. In particular, we have not studied meso-scale phenomena that can be addressed by using MHD.Recently we performed our MHD simulation of Earth's magnetosphere by using the K-computer which is the first 10PFlops supercomputer and obtained multi-scale flow vorticity for the both northward and southward IMF. Furthermore, we have access to supercomputer systems which have Xeon, SPARC64, and vector-type CPUs and can compare simulation results between the different systems. Finally, we have compared the results of our parameter survey of the magnetosphere with observations from the HISAKI spacecraft.We have encountered a number of difficulties effectively using the latest supercomputer systems. First the size of simulation output increases greatly. Now a simulation group produces over 1PB of output. Storage and analysis of this much data is difficult. The traditional way to analyze simulation results is to move the results to the investigator's home computer. This takes over three months using an end-to-end 10Gbps network. In reality, there are problems at some nodes such as firewalls that can increase the transfer time to over one year. Another issue is post-processing. It is hard to treat a few TB of simulation output due to the memory limitations of a post-processing computer. To overcome these issues, we have developed and introduced the parallel network storage, the highly efficient network protocol and the CUI based visualization tools.In this study, we will show the latest simulation results using the petascale supercomputer and problems from the use of these supercomputer systems.

Impact of indoor environment on path loss in body area networks.

PubMed

Hausman, Sławomir; Januszkiewicz, Łukasz

2014-10-20

In this paper the influence of an example indoor environment on narrowband radio channel path loss for body area networks operating around 2.4 GHz is investigated using computer simulations and on-site measurements. In contrast to other similar studies, the simulation model included both a numerical human body phantom and its environment-room walls, floor and ceiling. As an example, radio signal attenuation between two different configurations of transceivers with dipole antennas placed in a direct vicinity of a human body (on-body scenario) is analyzed by computer simulations for several types of reflecting environments. In the analyzed case the propagation environments comprised a human body and office room walls. As a reference environment for comparison, free space with only a conducting ground plane, modelling a steel mesh reinforced concrete floor, was chosen. The transmitting and receiving antennas were placed in two on-body configurations chest-back and chest-arm. Path loss vs. frequency simulation results obtained using Finite Difference Time Domain (FDTD) method and a multi-tissue anthropomorphic phantom were compared to results of measurements taken with a vector network analyzer with a human subject located in an average-size empty cuboidal office room. A comparison of path loss values in different environments variants gives some qualitative and quantitative insight into the adequacy of simplified indoor environment model for the indoor body area network channel representation.

Impact of Indoor Environment on Path Loss in Body Area Networks

PubMed Central

Hausman, Sławomir; Januszkiewicz, Łukasz

2014-01-01

In this paper the influence of an example indoor environment on narrowband radio channel path loss for body area networks operating around 2.4 GHz is investigated using computer simulations and on-site measurements. In contrast to other similar studies, the simulation model included both a numerical human body phantom and its environment—room walls, floor and ceiling. As an example, radio signal attenuation between two different configurations of transceivers with dipole antennas placed in a direct vicinity of a human body (on-body scenario) is analyzed by computer simulations for several types of reflecting environments. In the analyzed case the propagation environments comprised a human body and office room walls. As a reference environment for comparison, free space with only a conducting ground plane, modelling a steel mesh reinforced concrete floor, was chosen. The transmitting and receiving antennas were placed in two on-body configurations chest–back and chest–arm. Path loss vs. frequency simulation results obtained using Finite Difference Time Domain (FDTD) method and a multi-tissue anthropomorphic phantom were compared to results of measurements taken with a vector network analyzer with a human subject located in an average-size empty cuboidal office room. A comparison of path loss values in different environments variants gives some qualitative and quantitative insight into the adequacy of simplified indoor environment model for the indoor body area network channel representation. PMID:25333289

Multiscale Quantum Mechanics/Molecular Mechanics Simulations with Neural Networks.

PubMed

Shen, Lin; Wu, Jingheng; Yang, Weitao

2016-10-11

Molecular dynamics simulation with multiscale quantum mechanics/molecular mechanics (QM/MM) methods is a very powerful tool for understanding the mechanism of chemical and biological processes in solution or enzymes. However, its computational cost can be too high for many biochemical systems because of the large number of ab initio QM calculations. Semiempirical QM/MM simulations have much higher efficiency. Its accuracy can be improved with a correction to reach the ab initio QM/MM level. The computational cost on the ab initio calculation for the correction determines the efficiency. In this paper we developed a neural network method for QM/MM calculation as an extension of the neural-network representation reported by Behler and Parrinello. With this approach, the potential energy of any configuration along the reaction path for a given QM/MM system can be predicted at the ab initio QM/MM level based on the semiempirical QM/MM simulations. We further applied this method to three reactions in water to calculate the free energy changes. The free-energy profile obtained from the semiempirical QM/MM simulation is corrected to the ab initio QM/MM level with the potential energies predicted with the constructed neural network. The results are in excellent accordance with the reference data that are obtained from the ab initio QM/MM molecular dynamics simulation or corrected with direct ab initio QM/MM potential energies. Compared with the correction using direct ab initio QM/MM potential energies, our method shows a speed-up of 1 or 2 orders of magnitude. It demonstrates that the neural network method combined with the semiempirical QM/MM calculation can be an efficient and reliable strategy for chemical reaction simulations.

Design and optimization of all-optical networks

NASA Astrophysics Data System (ADS)

Xiao, Gaoxi

1999-10-01

In this thesis, we present our research results on the design and optimization of all-optical networks. We divide our results into the following four parts: 1.In the first part, we consider broadcast-and-select networks. In our research, we propose an alternative and cheaper network configuration to hide the tuning time. In addition, we derive lower bounds on the optimal schedule lengths and prove that they are tighter than the best existing bounds. 2.In the second part, we consider all-optical wide area networks. We propose a set of algorithms for allocating a given number of WCs to the nodes. We adopt a simulation-based optimization approach, in which we collect utilization statistics of WCs from computer simulation and then perform optimization to allocate the WCs. Therefore, our algorithms are widely applicable and they are not restricted to any particular model and assumption. We have conducted extensive computer simulation on regular and irregular networks under both uniform and non-uniform traffic. We see that our method can get nearly the same performance as that of full wavelength conversion by using a much smaller number of WCs. Compared with the best existing method, the results show that our algorithms can significantly reduce (1)the overall blocking probability (i.e., better mean quality of service) and (2)the maximum of the blocking probabilities experienced at all the source nodes (i.e., better fairness). Equivalently, for a given performance requirement on blocking probability, our algorithms can significantly reduce the number of WCs required. 3.In the third part, we design and optimize the physical topology of all-optical wide area networks. We show that the design problem is NP-complete and we propose a heuristic algorithm called two-stage cut saturation algorithm for this problem. Simulation results show that (1)the proposed algorithm can efficiently design networks with low cost and high utilization, and (2)if wavelength converters are available to support full wavelength conversion, the cost of the links can be significantly reduced. 4.In the fourth part, we consider all-optical wide area networks with multiple fibers per link. We design a node configuration for all-optical networks. We exploit the flexibility that, to establish a lightpath across a node, we can select any one of the available channels in the incoming link and any one of the available channels in the outgoing link. As a result, the proposed node configuration requires a small number of small optical switches while it can achieve nearly the same performance as the existing one. And there is no additional crosstalk other than the intrinsic crosstalk within each single-chip optical switch.* (Abstract shortened by UMI.) *Originally published in DAI Vol. 60, No. 2. Reprinted here with corrected author name.

Incorporation of RAM techniques into simulation modeling

NASA Astrophysics Data System (ADS)

Nelson, S. C., Jr.; Haire, M. J.; Schryver, J. C.

1995-01-01

This work concludes that reliability, availability, and maintainability (RAM) analytical techniques can be incorporated into computer network simulation modeling to yield an important new analytical tool. This paper describes the incorporation of failure and repair information into network simulation to build a stochastic computer model to represent the RAM Performance of two vehicles being developed for the US Army: The Advanced Field Artillery System (AFAS) and the Future Armored Resupply Vehicle (FARV). The AFAS is the US Army's next generation self-propelled cannon artillery system. The FARV is a resupply vehicle for the AFAS. Both vehicles utilize automation technologies to improve the operational performance of the vehicles and reduce manpower. The network simulation model used in this work is task based. The model programmed in this application requirements a typical battle mission and the failures and repairs that occur during that battle. Each task that the FARV performs--upload, travel to the AFAS, refuel, perform tactical/survivability moves, return to logistic resupply, etc.--is modeled. Such a model reproduces a model reproduces operational phenomena (e.g., failures and repairs) that are likely to occur in actual performance. Simulation tasks are modeled as discrete chronological steps; after the completion of each task decisions are programmed that determine the next path to be followed. The result is a complex logic diagram or network. The network simulation model is developed within a hierarchy of vehicle systems, subsystems, and equipment and includes failure management subnetworks. RAM information and other performance measures are collected which have impact on design requirements. Design changes are evaluated through 'what if' questions, sensitivity studies, and battle scenario changes.

Analysis of Artificial Neural Network in Erosion Modeling: A Case Study of Serang Watershed

NASA Astrophysics Data System (ADS)

Arif, N.; Danoedoro, P.; Hartono

2017-12-01

Erosion modeling is an important measuring tool for both land users and decision makers to evaluate land cultivation and thus it is necessary to have a model to represent the actual reality. Erosion models are a complex model because of uncertainty data with different sources and processing procedures. Artificial neural networks can be relied on for complex and non-linear data processing such as erosion data. The main difficulty in artificial neural network training is the determination of the value of each network input parameters, i.e. hidden layer, momentum, learning rate, momentum, and RMS. This study tested the capability of artificial neural network application in the prediction of erosion risk with some input parameters through multiple simulations to get good classification results. The model was implemented in Serang Watershed, Kulonprogo, Yogyakarta which is one of the critical potential watersheds in Indonesia. The simulation results showed the number of iterations that gave a significant effect on the accuracy compared to other parameters. A small number of iterations can produce good accuracy if the combination of other parameters was right. In this case, one hidden layer was sufficient to produce good accuracy. The highest training accuracy achieved in this study was 99.32%, occurred in ANN 14 simulation with combination of network input parameters of 1 HL; LR 0.01; M 0.5; RMS 0.0001, and the number of iterations of 15000. The ANN training accuracy was not influenced by the number of channels, namely input dataset (erosion factors) as well as data dimensions, rather it was determined by changes in network parameters.

Vectorized algorithms for spiking neural network simulation.

PubMed

Brette, Romain; Goodman, Dan F M

2011-06-01

High-level languages (Matlab, Python) are popular in neuroscience because they are flexible and accelerate development. However, for simulating spiking neural networks, the cost of interpretation is a bottleneck. We describe a set of algorithms to simulate large spiking neural networks efficiently with high-level languages using vector-based operations. These algorithms constitute the core of Brian, a spiking neural network simulator written in the Python language. Vectorized simulation makes it possible to combine the flexibility of high-level languages with the computational efficiency usually associated with compiled languages.

Modeling DNP3 Traffic Characteristics of Field Devices in SCADA Systems of the Smart Grid

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

Yang, Huan; Cheng, Liang; Chuah, Mooi Choo

In the generation, transmission, and distribution sectors of the smart grid, intelligence of field devices is realized by programmable logic controllers (PLCs). Many smart-grid subsystems are essentially cyber-physical energy systems (CPES): For instance, the power system process (i.e., the physical part) within a substation is monitored and controlled by a SCADA network with hosts running miscellaneous applications (i.e., the cyber part). To study the interactions between the cyber and physical components of a CPES, several co-simulation platforms have been proposed. However, the network simulators/emulators of these platforms do not include a detailed traffic model that takes into account the impactsmore » of the execution model of PLCs on traffic characteristics. As a result, network traces generated by co-simulation only reveal the impacts of the physical process on the contents of the traffic generated by SCADA hosts, whereas the distinction between PLCs and computing nodes (e.g., a hardened computer running a process visualization application) has been overlooked. To generate realistic network traces using co-simulation for the design and evaluation of applications relying on accurate traffic profiles, it is necessary to establish a traffic model for PLCs. In this work, we propose a parameterized model for PLCs that can be incorporated into existing co-simulation platforms. We focus on the DNP3 subsystem of slave PLCs, which automates the processing of packets from the DNP3 master. To validate our approach, we extract model parameters from both the configuration and network traces of real PLCs. Simulated network traces are generated and compared against those from PLCs. Our evaluation shows that our proposed model captures the essential traffic characteristics of DNP3 slave PLCs, which can be used to extend existing co-simulation platforms and gain further insights into the behaviors of CPES.« less

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

PubMed

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

2015-07-01

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

Geometric characterization and simulation of planar layered elastomeric fibrous biomaterials

PubMed Central

Carleton, James B.; D'Amore, Antonio; Feaver, Kristen R.; Rodin, Gregory J.; Sacks, Michael S.

2014-01-01

Many important biomaterials are composed of multiple layers of networked fibers. While there is a growing interest in modeling and simulation of the mechanical response of these biomaterials, a theoretical foundation for such simulations has yet to be firmly established. Moreover, correctly identifying and matching key geometric features is a critically important first step for performing reliable mechanical simulations. The present work addresses these issues in two ways. First, using methods of geometric probability we develop theoretical estimates for the mean linear and areal fiber intersection densities for two-dimensional fibrous networks. These densities are expressed in terms of the fiber density and the orientation distribution function, both of which are relatively easy-to-measure properties. Secondly, we develop a random walk algorithm for geometric simulation of two-dimensional fibrous networks which can accurately reproduce the prescribed fiber density and orientation distribution function. Furthermore, the linear and areal fiber intersection densities obtained with the algorithm are in agreement with the theoretical estimates. Both theoretical and computational results are compared with those obtained by post-processing of SEM images of actual scaffolds. These comparisons reveal difficulties inherent to resolving fine details of multilayered fibrous networks. The methods provided herein can provide a rational means to define and generate key geometric features from experimentally measured or prescribed scaffold structural data. PMID:25311685

Healthcare Supported by Data Mule Networks in Remote Communities of the Amazon Region

PubMed Central

Coutinho, Mauro Margalho; Efrat, Alon; Richa, Andrea

2014-01-01

This paper investigates the feasibility of using boats as data mule nodes, carrying medical ultrasound videos from remote and isolated communities in the Amazon region in Brazil, to the main city of that area. The videos will be used by physicians to perform remote analysis and follow-up routine of prenatal examinations of pregnant women. Two open source simulators (the ONE and NS-2) were used to evaluate the results obtained utilizing a CoDPON (continuous displacement plan oriented network). The simulations took into account the connection times between the network nodes (boats) and the number of nodes on each boat route. PMID:27433519

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.

Hardware implementation of an adaptive resonance theory (ART) neural network using compensated operational amplifiers

NASA Astrophysics Data System (ADS)

Ho, Ching S.; Liou, Juin J.; Georgiopoulos, Michael; Christodoulou, Christos G.

1994-03-01

This paper presents an analog circuit design and implementation for an adaptive resonance theory neural network architecture called the augmented ART1 neural network (AART1-NN). Practical monolithic operational amplifiers (Op-Amps) LM741 and LM318 are selected to implement the circuit, and a simple compensation scheme is developed to adjust the Op-Amp electrical characteristics to meet the design requirement. A 7-node prototype circuit has been designed and verified using the Pspice circuit simulator run on a Sun workstation. Results simulated from the AART1-NN circuit using the LM741, LM318, and ideal Op-Amps are presented and compared.

A Polygon Model for Wireless Sensor Network Deployment with Directional Sensing Areas

PubMed Central

Wu, Chun-Hsien; Chung, Yeh-Ching

2009-01-01

The modeling of the sensing area of a sensor node is essential for the deployment algorithm of wireless sensor networks (WSNs). In this paper, a polygon model is proposed for the sensor node with directional sensing area. In addition, a WSN deployment algorithm is presented with topology control and scoring mechanisms to maintain network connectivity and improve sensing coverage rate. To evaluate the proposed polygon model and WSN deployment algorithm, a simulation is conducted. The simulation results show that the proposed polygon model outperforms the existed disk model and circular sector model in terms of the maximum sensing coverage rate. PMID:22303159

A human body model for efficient numerical characterization of UWB signal propagation in wireless body area networks.

PubMed

Lim, Hooi Been; Baumann, Dirk; Li, Er-Ping

2011-03-01

Wireless body area network (WBAN) is a new enabling system with promising applications in areas such as remote health monitoring and interpersonal communication. Reliable and optimum design of a WBAN system relies on a good understanding and in-depth studies of the wave propagation around a human body. However, the human body is a very complex structure and is computationally demanding to model. This paper aims to investigate the effects of the numerical model's structure complexity and feature details on the simulation results. Depending on the application, a simplified numerical model that meets desired simulation accuracy can be employed for efficient simulations. Measurements of ultra wideband (UWB) signal propagation along a human arm are performed and compared to the simulation results obtained with numerical arm models of different complexity levels. The influence of the arm shape and size, as well as tissue composition and complexity is investigated.

Cybersim: geographic, temporal, and organizational dynamics of malware propagation

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

Santhi, Nandakishore; Yan, Guanhua; Eidenbenz, Stephan

2010-01-01

Cyber-infractions into a nation's strategic security envelope pose a constant and daunting challenge. We present the modular CyberSim tool which has been developed in response to the need to realistically simulate at a national level, software vulnerabilities and resulting mal ware propagation in online social networks. CyberSim suite (a) can generate realistic scale-free networks from a database of geocoordinated computers to closely model social networks arising from personal and business email contacts and online communities; (b) maintains for each,bost a list of installed software, along with the latest published vulnerabilities; (d) allows designated initial nodes where malware gets introduced; (e)more » simulates, using distributed discrete event-driven technology, the spread of malware exploiting a specific vulnerability, with packet delay and user online behavior models; (f) provides a graphical visualization of spread of infection, its severity, businesses affected etc to the analyst. We present sample simulations on a national level network with millions of computers.« less

A Physics-driven Neural Networks-based Simulation System (PhyNNeSS) for multimodal interactive virtual environments involving nonlinear deformable objects

PubMed Central

De, Suvranu; Deo, Dhannanjay; Sankaranarayanan, Ganesh; Arikatla, Venkata S.

2012-01-01

Background While an update rate of 30 Hz is considered adequate for real time graphics, a much higher update rate of about 1 kHz is necessary for haptics. Physics-based modeling of deformable objects, especially when large nonlinear deformations and complex nonlinear material properties are involved, at these very high rates is one of the most challenging tasks in the development of real time simulation systems. While some specialized solutions exist, there is no general solution for arbitrary nonlinearities. Methods In this work we present PhyNNeSS - a Physics-driven Neural Networks-based Simulation System - to address this long-standing technical challenge. The first step is an off-line pre-computation step in which a database is generated by applying carefully prescribed displacements to each node of the finite element models of the deformable objects. In the next step, the data is condensed into a set of coefficients describing neurons of a Radial Basis Function network (RBFN). During real-time computation, these neural networks are used to reconstruct the deformation fields as well as the interaction forces. Results We present realistic simulation examples from interactive surgical simulation with real time force feedback. As an example, we have developed a deformable human stomach model and a Penrose-drain model used in the Fundamentals of Laparoscopic Surgery (FLS) training tool box. Conclusions A unique computational modeling system has been developed that is capable of simulating the response of nonlinear deformable objects in real time. The method distinguishes itself from previous efforts in that a systematic physics-based pre-computational step allows training of neural networks which may be used in real time simulations. We show, through careful error analysis, that the scheme is scalable, with the accuracy being controlled by the number of neurons used in the simulation. PhyNNeSS has been integrated into SoFMIS (Software Framework for Multimodal Interactive Simulation) for general use. PMID:22629108

Solar photospheric network properties and their cycle variation

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

Thibault, K.; Charbonneau, P.; Béland, M., E-mail: kim@astro.umontreal.ca-a, E-mail: paulchar@astro.umontreal.ca-b, E-mail: michel.beland@calculquebec.ca-c

We present a numerical simulation of the formation and evolution of the solar photospheric magnetic network over a full solar cycle. The model exhibits realistic behavior as it produces large, unipolar concentrations of flux in the polar caps, a power-law flux distribution with index –1.69, a flux replacement timescale of 19.3 hr, and supergranule diameters of 20 Mm. The polar behavior is especially telling of model accuracy, as it results from lower-latitude activity, and accumulates the residues of any potential modeling inaccuracy and oversimplification. In this case, the main oversimplification is the absence of a polar sink for the flux,more » causing an amount of polar cap unsigned flux larger than expected by almost one order of magnitude. Nonetheless, our simulated polar caps carry the proper signed flux and dipole moment, and also show a spatial distribution of flux in good qualitative agreement with recent high-latitude magnetographic observations by Hinode. After the last cycle emergence, the simulation is extended until the network has recovered its quiet Sun initial condition. This permits an estimate of the network relaxation time toward the baseline state characterizing extended periods of suppressed activity, such as the Maunder Grand Minimum. Our simulation results indicate a network relaxation time of 2.9 yr, setting 2011 October as the soonest the time after which the last solar activity minimum could have qualified as a Maunder-type Minimum. This suggests that photospheric magnetism did not reach its baseline state during the recent extended minimum between cycles 23 and 24.« less

Inferring Gene Regulatory Networks by Singular Value Decomposition and Gravitation Field Algorithm

PubMed Central

Zheng, Ming; Wu, Jia-nan; Huang, Yan-xin; Liu, Gui-xia; Zhou, You; Zhou, Chun-guang

2012-01-01

Reconstruction of gene regulatory networks (GRNs) is of utmost interest and has become a challenge computational problem in system biology. However, every existing inference algorithm from gene expression profiles has its own advantages and disadvantages. In particular, the effectiveness and efficiency of every previous algorithm is not high enough. In this work, we proposed a novel inference algorithm from gene expression data based on differential equation model. In this algorithm, two methods were included for inferring GRNs. Before reconstructing GRNs, singular value decomposition method was used to decompose gene expression data, determine the algorithm solution space, and get all candidate solutions of GRNs. In these generated family of candidate solutions, gravitation field algorithm was modified to infer GRNs, used to optimize the criteria of differential equation model, and search the best network structure result. The proposed algorithm is validated on both the simulated scale-free network and real benchmark gene regulatory network in networks database. Both the Bayesian method and the traditional differential equation model were also used to infer GRNs, and the results were used to compare with the proposed algorithm in our work. And genetic algorithm and simulated annealing were also used to evaluate gravitation field algorithm. The cross-validation results confirmed the effectiveness of our algorithm, which outperforms significantly other previous algorithms. PMID:23226565

MARIKA - A model revision system using qualitative analysis of simulations. [of human orientation system

NASA Technical Reports Server (NTRS)

Groleau, Nicolas; Frainier, Richard; Colombano, Silvano; Hazelton, Lyman; Szolovits, Peter

1993-01-01

This paper describes portions of a novel system called MARIKA (Model Analysis and Revision of Implicit Key Assumptions) to automatically revise a model of the normal human orientation system. The revision is based on analysis of discrepancies between experimental results and computer simulations. The discrepancies are calculated from qualitative analysis of quantitative simulations. The experimental and simulated time series are first discretized in time segments. Each segment is then approximated by linear combinations of simple shapes. The domain theory and knowledge are represented as a constraint network. Incompatibilities detected during constraint propagation within the network yield both parameter and structural model alterations. Interestingly, MARIKA diagnosed a data set from the Massachusetts Eye and Ear Infirmary Vestibular Laboratory as abnormal though the data was tagged as normal. Published results from other laboratories confirmed the finding. These encouraging results could lead to a useful clinical vestibular tool and to a scientific discovery system for space vestibular adaptation.

Direct numerical simulation of cellular-scale blood flow in microvascular networks

NASA Astrophysics Data System (ADS)

Balogh, Peter; Bagchi, Prosenjit

2017-11-01

A direct numerical simulation method is developed to study cellular-scale blood flow in physiologically realistic microvascular networks that are constructed in silico following published in vivo images and data, and are comprised of bifurcating, merging, and winding vessels. The model resolves large deformation of individual red blood cells (RBC) flowing in such complex networks. The vascular walls and deformable interfaces of the RBCs are modeled using the immersed-boundary methods. Time-averaged hemodynamic quantities obtained from the simulations agree quite well with published in vivo data. Our simulations reveal that in several vessels the flow rates and pressure drops could be negatively correlated. The flow resistance and hematocrit are also found to be negatively correlated in some vessels. These observations suggest a deviation from the classical Poiseuille's law in such vessels. The cells are observed to frequently jam at vascular bifurcations resulting in reductions in hematocrit and flow rate in the daughter and mother vessels. We find that RBC jamming results in several orders of magnitude increase in hemodynamic resistance, and thus provides an additional mechanism of increased in vivo blood viscosity as compared to that determined in vitro. Funded by NSF CBET 1604308.

A Novel IEEE 802.15.4e DSME MAC for Wireless Sensor Networks

PubMed Central

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-01-01

IEEE 802.15.4e standard proposes Deterministic and Synchronous Multichannel Extension (DSME) mode for wireless sensor networks (WSNs) to support industrial, commercial and health care applications. In this paper, a new channel access scheme and beacon scheduling schemes are designed for the IEEE 802.15.4e enabled WSNs in star topology to reduce the network discovery time and energy consumption. In addition, a new dynamic guaranteed retransmission slot allocation scheme is designed for devices with the failure Guaranteed Time Slot (GTS) transmission to reduce the retransmission delay. To evaluate our schemes, analytical models are designed to analyze the performance of WSNs in terms of reliability, delay, throughput and energy consumption. Our schemes are validated with simulation and analytical results and are observed that simulation results well match with the analytical one. The evaluated results of our designed schemes can improve the reliability, throughput, delay, and energy consumptions significantly. PMID:28275216

A Novel IEEE 802.15.4e DSME MAC for Wireless Sensor Networks.

PubMed

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-01-16

IEEE 802.15.4e standard proposes Deterministic and Synchronous Multichannel Extension (DSME) mode for wireless sensor networks (WSNs) to support industrial, commercial and health care applications. In this paper, a new channel access scheme and beacon scheduling schemes are designed for the IEEE 802.15.4e enabled WSNs in star topology to reduce the network discovery time and energy consumption. In addition, a new dynamic guaranteed retransmission slot allocation scheme is designed for devices with the failure Guaranteed Time Slot (GTS) transmission to reduce the retransmission delay. To evaluate our schemes, analytical models are designed to analyze the performance of WSNs in terms of reliability, delay, throughput and energy consumption. Our schemes are validated with simulation and analytical results and are observed that simulation results well match with the analytical one. The evaluated results of our designed schemes can improve the reliability, throughput, delay, and energy consumptions significantly.

The relevance of network micro-structure for neural dynamics.

PubMed

Pernice, Volker; Deger, Moritz; Cardanobile, Stefano; Rotter, Stefan

2013-01-01

The activity of cortical neurons is determined by the input they receive from presynaptic neurons. Many previous studies have investigated how specific aspects of the statistics of the input affect the spike trains of single neurons and neurons in recurrent networks. However, typically very simple random network models are considered in such studies. Here we use a recently developed algorithm to construct networks based on a quasi-fractal probability measure which are much more variable than commonly used network models, and which therefore promise to sample the space of recurrent networks in a more exhaustive fashion than previously possible. We use the generated graphs as the underlying network topology in simulations of networks of integrate-and-fire neurons in an asynchronous and irregular state. Based on an extensive dataset of networks and neuronal simulations we assess statistical relations between features of the network structure and the spiking activity. Our results highlight the strong influence that some details of the network structure have on the activity dynamics of both single neurons and populations, even if some global network parameters are kept fixed. We observe specific and consistent relations between activity characteristics like spike-train irregularity or correlations and network properties, for example the distributions of the numbers of in- and outgoing connections or clustering. Exploiting these relations, we demonstrate that it is possible to estimate structural characteristics of the network from activity data. We also assess higher order correlations of spiking activity in the various networks considered here, and find that their occurrence strongly depends on the network structure. These results provide directions for further theoretical studies on recurrent networks, as well as new ways to interpret spike train recordings from neural circuits.

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

PubMed Central

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

2018-01-01

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

Inference, simulation, modeling, and analysis of complex networks, with special emphasis on complex networks in systems biology

NASA Astrophysics Data System (ADS)

Christensen, Claire Petra

Across diverse fields ranging from physics to biology, sociology, and economics, the technological advances of the past decade have engendered an unprecedented explosion of data on highly complex systems with thousands, if not millions of interacting components. These systems exist at many scales of size and complexity, and it is becoming ever-more apparent that they are, in fact, universal, arising in every field of study. Moreover, they share fundamental properties---chief among these, that the individual interactions of their constituent parts may be well-understood, but the characteristic behaviour produced by the confluence of these interactions---by these complex networks---is unpredictable; in a nutshell, the whole is more than the sum of its parts. There is, perhaps, no better illustration of this concept than the discoveries being made regarding complex networks in the biological sciences. In particular, though the sequencing of the human genome in 2003 was a remarkable feat, scientists understand that the "cellular-level blueprints" for the human being are cellular-level parts lists, but they say nothing (explicitly) about cellular-level processes. The challenge of modern molecular biology is to understand these processes in terms of the networks of parts---in terms of the interactions among proteins, enzymes, genes, and metabolites---as it is these processes that ultimately differentiate animate from inanimate, giving rise to life! It is the goal of systems biology---an umbrella field encapsulating everything from molecular biology to epidemiology in social systems---to understand processes in terms of fundamental networks of core biological parts, be they proteins or people. By virtue of the fact that there are literally countless complex systems, not to mention tools and techniques used to infer, simulate, analyze, and model these systems, it is impossible to give a truly comprehensive account of the history and study of complex systems. The author's own publications have contributed network inference, simulation, modeling, and analysis methods to the much larger body of work in systems biology, and indeed, in network science. The aim of this thesis is therefore twofold: to present this original work in the historical context of network science, but also to provide sufficient review and reference regarding complex systems (with an emphasis on complex networks in systems biology) and tools and techniques for their inference, simulation, analysis, and modeling, such that the reader will be comfortable in seeking out further information on the subject. The review-like Chapters 1, 2, and 4 are intended to convey the co-evolution of network science and the slow but noticeable breakdown of boundaries between disciplines in academia as research and comparison of diverse systems has brought to light the shared properties of these systems. It is the author's hope that theses chapters impart some sense of the remarkable and rapid progress in complex systems research that has led to this unprecedented academic synergy. Chapters 3 and 5 detail the author's original work in the context of complex systems research. Chapter 3 presents the methods and results of a two-stage modeling process that generates candidate gene-regulatory networks of the bacterium B.subtilis from experimentally obtained, yet mathematically underdetermined microchip array data. These networks are then analyzed from a graph theoretical perspective, and their biological viability is critiqued by comparing the networks' graph theoretical properties to those of other biological systems. The results of topological perturbation analyses revealing commonalities in behavior at multiple levels of complexity are also presented, and are shown to be an invaluable means by which to ascertain the level of complexity to which the network inference process is robust to noise. Chapter 5 outlines a learning algorithm for the development of a realistic, evolving social network (a city) into which a disease is introduced. The results of simulations in populations spanning two orders of magnitude are compared to prevaccine era measles data for England and Wales and demonstrate that the simulations are able to capture the quantitative and qualitative features of epidemics in populations as small as 10,000 people. The work presented in Chapter 5 validates the utility of network simulation in concurrently probing contact network dynamics and disease dynamics.

Neural Network Emulation of Reionization Simulations

NASA Astrophysics Data System (ADS)

Schmit, Claude J.; Pritchard, Jonathan R.

2018-05-01

Next generation radio experiments such as LOFAR, HERA and SKA are expected to probe the Epoch of Reionization and claim a first direct detection of the cosmic 21cm signal within the next decade. One of the major challenges for these experiments will be dealing with enormous incoming data volumes. Machine learning is key to increasing our data analysis efficiency. We consider the use of an artificial neural network to emulate 21cmFAST simulations and use it in a Bayesian parameter inference study. We then compare the network predictions to a direct evaluation of the EoR simulations and analyse the dependence of the results on the training set size. We find that the use of a training set of size 100 samples can recover the error contours of a full scale MCMC analysis which evaluates the model at each step.

Parallel ALLSPD-3D: Speeding Up Combustor Analysis Via Parallel Processing

NASA Technical Reports Server (NTRS)

Fricker, David M.

1997-01-01

The ALLSPD-3D Computational Fluid Dynamics code for reacting flow simulation was run on a set of benchmark test cases to determine its parallel efficiency. These test cases included non-reacting and reacting flow simulations with varying numbers of processors. Also, the tests explored the effects of scaling the simulation with the number of processors in addition to distributing a constant size problem over an increasing number of processors. The test cases were run on a cluster of IBM RS/6000 Model 590 workstations with ethernet and ATM networking plus a shared memory SGI Power Challenge L workstation. The results indicate that the network capabilities significantly influence the parallel efficiency, i.e., a shared memory machine is fastest and ATM networking provides acceptable performance. The limitations of ethernet greatly hamper the rapid calculation of flows using ALLSPD-3D.

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

PubMed

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

2017-08-01

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

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

NASA Technical Reports Server (NTRS)

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

1992-01-01

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

Interference Drop Scheme: Enhancing QoS Provision in Multi-Hop Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Luo, Chang-Yi; Komuro, Nobuyoshi; Takahashi, Kiyoshi; Kasai, Hiroyuki; Ueda, Hiromi; Tsuboi, Toshinori

Ad hoc networking uses wireless technologies to construct networks with no physical infrastructure and so are expected to provide instant networking in areas such as disaster recovery sites and inter-vehicle communication. Unlike conventional wired networks services, services in ad hoc networks are easily disrupted by the frequent changes in traffic and topology. Therefore, solutions to assure the Quality of Services (QoS) in ad hoc networks are different from the conventional ones used in wired networks. In this paper, we propose a new queue management scheme, Interference Drop Scheme (IDS) for ad hoc networks. In the conventional queue management approaches such as FIFO (First-in First-out) and RED (Random Early Detection), a queue is usually managed by a queue length limit. FIFO discards packets according to the queue limit, and RED discards packets in an early and random fashion. IDS, on the other hand, manages the queue according to wireless interference time, which increases as the number of contentions in the MAC layer increases. When there are many MAC contentions, IDS discards TCP data packets. By observing the interference time and discarding TCP data packets, our simulation results show that IDS improves TCP performance and reduces QoS violations in UDP in ad hoc networks with chain, grid, and random topologies. Our simulation results also demonstrate that wireless interference time is a better metric than queue length limit for queue management in multi-hop ad hoc networks.

Practical synchronization on complex dynamical networks via optimal pinning control

NASA Astrophysics Data System (ADS)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Limit of a nonpreferential attachment multitype network model

NASA Astrophysics Data System (ADS)

Shang, Yilun

2017-02-01

Here, we deal with a model of multitype network with nonpreferential attachment growth. The connection between two nodes depends asymmetrically on their types, reflecting the implication of time order in temporal networks. Based upon graph limit theory, we analytically determined the limit of the network model characterized by a kernel, in the sense that the number of copies of any fixed subgraph converges when network size tends to infinity. The results are confirmed by extensive simulations. Our work thus provides a theoretical framework for quantitatively understanding grown temporal complex networks as a whole.

Using Neural Networks for Sensor Validation

NASA Technical Reports Server (NTRS)

Mattern, Duane L.; Jaw, Link C.; Guo, Ten-Huei; Graham, Ronald; McCoy, William

1998-01-01

This paper presents the results of applying two different types of neural networks in two different approaches to the sensor validation problem. The first approach uses a functional approximation neural network as part of a nonlinear observer in a model-based approach to analytical redundancy. The second approach uses an auto-associative neural network to perform nonlinear principal component analysis on a set of redundant sensors to provide an estimate for a single failed sensor. The approaches are demonstrated using a nonlinear simulation of a turbofan engine. The fault detection and sensor estimation results are presented and the training of the auto-associative neural network to provide sensor estimates is discussed.

Trust recovery model of Ad Hoc network based on identity authentication scheme

NASA Astrophysics Data System (ADS)

Liu, Jie; Huan, Shuiyuan

2017-05-01

Mobile Ad Hoc network trust model is widely used to solve mobile Ad Hoc network security issues. Aiming at the problem of reducing the network availability caused by the processing of malicious nodes and selfish nodes in mobile Ad Hoc network routing based on trust model, an authentication mechanism based on identity authentication mobile Ad Hoc network is proposed, which uses identity authentication to identify malicious nodes, And trust the recovery of selfish nodes in order to achieve the purpose of reducing network congestion and improving network quality. The simulation results show that the implementation of the mechanism can effectively improve the network availability and security.

Cislan-2 extension final document by University of Twente (Netherlands)

NASA Astrophysics Data System (ADS)

Niemegeers, Ignas; Baumann, Frank; Beuwer, Wim; Jordense, Marcel; Pras, Aiko; Schutte, Leon; Tracey, Ian

1992-01-01

Results of worked performed under the so called Cislan extension contract are presented. The adaptation of the Cislan 2 prototype design to an environment of interconnected Local Area Networks (LAN's) instead of a single 802.5 token ring LAN is considered. In order to extend the network architecture, the Interconnection Function (IF) protocol layer was subdivided into two protocol layers: a new IF layer, and below the Medium Enhancement (ME) protocol layer. Some small enhancements to the distributed bandwidth allocation protocol were developed, which in fact are also applicable to the 'normal' Cislan 2 system. The new services and protocols are described together with some scenarios and requirements for the new internetting Cislan 2 system. How to overcome the degradation of the quality of speech due to packet loss on the LAN subsystem was studied. Experiments were planned in order to measure this speech quality degradation. Simulations were performed of two Cislan subsystems, the bandwidth allocation protocol and the clock synchronization mechanism. Results on both simulations, performed on SUN workstations using QNAP as a simulation tool, are given. Results of the simulations of the clock synchronization mechanism, and results of the simulation of the distributed bandwidth allocation protocol are given.

Quantification of Road Network Vulnerability and Traffic Impacts to Regional Landslide Hazards.

NASA Astrophysics Data System (ADS)

Postance, Benjamin; Hillier, John; Dixon, Neil; Dijkstra, Tom

2015-04-01

Slope instability represents a prevalent hazard to transport networks. In the UK regional road networks are frequently disrupted by multiple slope failures triggered during intense precipitation events; primarily due to a degree of regional homogeneity of slope materials, geomorphology and weather conditions. It is of interest to examine how different locations and combinations of slope failure impact road networks, particularly in the context of projected climate change and a 40% increase in UK road demand by 2040. In this study an extensive number (>50 000) of multiple failure event scenarios are simulated within a dynamic micro simulation to assess traffic impacts during peak flow (7 - 10 AM). Possible failure locations are selected within the county of Gloucestershire (3150 km2) using historic failure sites and British Geological Survey GeoSure data. Initial investigations employ a multiple linear regression analyses to consider the severity of traffic impacts, as measured by time, in respect of spatial and topographical network characteristics including connectivity, density and capacity in proximity to failure sites; the network distance between disruptions in multiple failure scenarios is used to consider the effects of spatial clustering. The UK Department of Transport road travel demand and UKCP09 weather projection data to 2080 provide a suitable basis for traffic simulations and probabilistic slope stability assessments. Future work will thus focus on the development of a catastrophe risk model to simulate traffic impacts under various narratives of future travel demand and slope instability under climatic change. The results of this investigation shall contribute to the understanding of road network vulnerabilities and traffic impacts from climate driven slope hazards.

Computer Simulations of Bottle Brushes: From Melts to Soft Networks

DOE PAGES

Cao, Zhen; Carrillo, Jan-Michael Y.; Sheiko, Sergei S.; ...

2015-07-13

We use a combination of Molecular dynamics simulations and analytical calculations, and study dens bottle-brush systems in a melt and network State. Analysis of our simulation results shows that bottle-brush macromolecules in melt behave as ideal chains with effective Kuhn length b K. Simulations show that the bottle-brush-induced bending rigidity is due to an entropy decrease caused by redistribution of the side chains upon backbone bending. The Kuhn length of the bottle:brushes increases with increasing the side-chain degree of polymerization n sc as b K proportional to n sc 0.46. Moreover, this model of bottle brush macromolecules is extended tomore » describe mechanical properties of bottle brush networks in linear and nonlinear deformation regimes. In the linear deformation regime, the network shear modulus scales with the degree of polymerization of the side chains as G 0 proportional to (n sc + 1) -1 as long as the ratio of the Kuhn length, b K, to the size of the fully extended bottle-brush backbone between cross-links, R-max, is smaller than unity, b K/R max << 1. Bottle-brush networks With b K/R max proportional to 1 demonstrate behavior similar to that of networks Of semiflexible chains with G 0 proportional to n sc -0.5. Finally, in the nonlinear network deformation regime, the deformation-dependent shear modulus is a universal function of the first strain invariant I 1 and bottle-brush backbone deformation ratio beta describing stretching ability of the bottle-brush backbone between cross-links.« less

Mitigating Handoff Call Dropping in Wireless Cellular Networks: A Call Admission Control Technique

NASA Astrophysics Data System (ADS)

Ekpenyong, Moses Effiong; Udoh, Victoria Idia; Bassey, Udoma James

2016-06-01

Handoff management has been an important but challenging issue in the field of wireless communication. It seeks to maintain seamless connectivity of mobile users changing their points of attachment from one base station to another. This paper derives a call admission control model and establishes an optimal step-size coefficient (k) that regulates the admission probability of handoff calls. An operational CDMA network carrier was investigated through the analysis of empirical data collected over a period of 1 month, to verify the performance of the network. Our findings revealed that approximately 23 % of calls in the existing system were lost, while 40 % of the calls (on the average) were successfully admitted. A simulation of the proposed model was then carried out under ideal network conditions to study the relationship between the various network parameters and validate our claim. Simulation results showed that increasing the step-size coefficient degrades the network performance. Even at optimum step-size (k), the network could still be compromised in the presence of severe network crises, but our model was able to recover from these problems and still functions normally.

A fuzzy call admission control scheme in wireless networks

NASA Astrophysics Data System (ADS)

Ma, Yufeng; Gong, Shenguang; Hu, Xiulin; Zhang, Yunyu

2007-11-01

Scarcity of the spectrum resource and mobility of users make quality of service (QoS) provision a critical issue in wireless networks. This paper presents a fuzzy call admission control scheme to meet the requirement of the QoS. A performance measure is formed as a weighted linear function of new call and handoff call blocking probabilities. Simulation compares the proposed fuzzy scheme with an adaptive channel reservation scheme. Simulation results show that fuzzy scheme has a better robust performance in terms of average blocking criterion.

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.

A Multimetric Approach for Handoff Decision in Heterogeneous Wireless Networks

NASA Astrophysics Data System (ADS)

Kustiawan, I.; Purnama, W.

2018-02-01

Seamless mobility and service continuity anywhere at any time are an important issue in the wireless Internet. This research proposes a scheme to make handoff decisions effectively in heterogeneous wireless networks using a fuzzy system. Our design lies in an inference engine which takes RSS (received signal strength), data rate, network latency, and user preference as strategic determinants. The logic of our engine is realized on a UE (user equipment) side in faster reaction to network dynamics while roaming across different radio access technologies. The fuzzy system handles four metrics jointly to deduce a moderate decision about when to initiate handoff. The performance of our design is evaluated by simulating move-out mobility scenarios. Simulation results show that our scheme outperforms other approaches in terms of reducing unnecessary handoff.

[Hydraulic simulation and safety assessment of secondary water supply system with anti-negative pressure facility].

PubMed

Wang, Huan-Huan; Liu, Shu-Ming; Jiang, Shuaiz; Meng, Fan-Lin; Bai, Lu

2013-01-01

In the last few decades, anti-negative pressure facility (ANPF) has been emerged as a revolutionary approach for sloving the pollution in the Second Water Supply System (SWSS) in China. This study analyzed implications of the safety in SWSS with ANPF, utilizing the water distribution network hydraulic model. A method of hydraulic simulation and security assessment was presented which was able to reflect the number and location of nodes that can be installed in ANPF. Benchmark results through two instance networks showed that 67% and 89% of nodes in each network did not fit the ANPFs for installation. The simple and pratical algorithm was recommended in the water distribution network design and planing in order to increase the security of SWSS.

LavaNet—Neural network development environment in a general mine planning package

NASA Astrophysics Data System (ADS)

Kapageridis, Ioannis Konstantinou; Triantafyllou, A. G.

2011-04-01

LavaNet is a series of scripts written in Perl that gives access to a neural network simulation environment inside a general mine planning package. A well known and a very popular neural network development environment, the Stuttgart Neural Network Simulator, is used as the base for the development of neural networks. LavaNet runs inside VULCAN™—a complete mine planning package with advanced database, modelling and visualisation capabilities. LavaNet is taking advantage of VULCAN's Perl based scripting environment, Lava, to bring all the benefits of neural network development and application to geologists, mining engineers and other users of the specific mine planning package. LavaNet enables easy development of neural network training data sets using information from any of the data and model structures available, such as block models and drillhole databases. Neural networks can be trained inside VULCAN™ and the results be used to generate new models that can be visualised in 3D. Direct comparison of developed neural network models with conventional and geostatistical techniques is now possible within the same mine planning software package. LavaNet supports Radial Basis Function networks, Multi-Layer Perceptrons and Self-Organised Maps.

Highly dynamic animal contact network and implications on disease transmission

PubMed Central

Chen, Shi; White, Brad J.; Sanderson, Michael W.; Amrine, David E.; Ilany, Amiyaal; Lanzas, Cristina

2014-01-01

Contact patterns among hosts are considered as one of the most critical factors contributing to unequal pathogen transmission. Consequently, networks have been widely applied in infectious disease modeling. However most studies assume static network structure due to lack of accurate observation and appropriate analytic tools. In this study we used high temporal and spatial resolution animal position data to construct a high-resolution contact network relevant to infectious disease transmission. The animal contact network aggregated at hourly level was highly variable and dynamic within and between days, for both network structure (network degree distribution) and individual rank of degree distribution in the network (degree order). We integrated network degree distribution and degree order heterogeneities with a commonly used contact-based, directly transmitted disease model to quantify the effect of these two sources of heterogeneity on the infectious disease dynamics. Four conditions were simulated based on the combination of these two heterogeneities. Simulation results indicated that disease dynamics and individual contribution to new infections varied substantially among these four conditions under both parameter settings. Changes in the contact network had a greater effect on disease dynamics for pathogens with smaller basic reproduction number (i.e. R0 < 2). PMID:24667241

Minimizing communication cost among distributed controllers in software defined networks

NASA Astrophysics Data System (ADS)

Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

2016-08-01

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator.

PubMed

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator

PubMed Central

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation. PMID:28596730

Exploring biological interaction networks with tailored weighted quasi-bicliques

PubMed Central

2012-01-01

Background Biological networks provide fundamental insights into the functional characterization of genes and their products, the characterization of DNA-protein interactions, the identification of regulatory mechanisms, and other biological tasks. Due to the experimental and biological complexity, their computational exploitation faces many algorithmic challenges. Results We introduce novel weighted quasi-biclique problems to identify functional modules in biological networks when represented by bipartite graphs. In difference to previous quasi-biclique problems, we include biological interaction levels by using edge-weighted quasi-bicliques. While we prove that our problems are NP-hard, we also describe IP formulations to compute exact solutions for moderately sized networks. Conclusions We verify the effectiveness of our IP solutions using both simulation and empirical data. The simulation shows high quasi-biclique recall rates, and the empirical data corroborate the abilities of our weighted quasi-bicliques in extracting features and recovering missing interactions from biological networks. PMID:22759421

Insights into failed lexical retrieval from network science.

PubMed

Vitevitch, Michael S; Chan, Kit Ying; Goldstein, Rutherford

2014-02-01

Previous network analyses of the phonological lexicon (Vitevitch, 2008) observed a web-like structure that exhibited assortative mixing by degree: words with dense phonological neighborhoods tend to have as neighbors words that also have dense phonological neighborhoods, and words with sparse phonological neighborhoods tend to have as neighbors words that also have sparse phonological neighborhoods. Given the role that assortative mixing by degree plays in network resilience, we examined instances of real and simulated lexical retrieval failures in computer simulations, analysis of a slips-of-the-ear corpus, and three psycholinguistic experiments for evidence of this network characteristic in human behavior. The results of the various analyses support the hypothesis that the structure of words in the mental lexicon influences lexical processing. The implications of network science for current models of spoken word recognition, language processing, and cognitive psychology more generally are discussed. Copyright © 2013 Elsevier Inc. All rights reserved.

Connecting macroscopic dynamics with microscopic properties in active microtubule network contraction

NASA Astrophysics Data System (ADS)

Foster, Peter J.; Yan, Wen; Fürthauer, Sebastian; Shelley, Michael J.; Needleman, Daniel J.

2017-12-01

The cellular cytoskeleton is an active material, driven out of equilibrium by molecular motor proteins. It is not understood how the collective behaviors of cytoskeletal networks emerge from the properties of the network’s constituent motor proteins and filaments. Here we present experimental results on networks of stabilized microtubules in Xenopus oocyte extracts, which undergo spontaneous bulk contraction driven by the motor protein dynein, and investigate the effects of varying the initial microtubule density and length distribution. We find that networks contract to a similar final density, irrespective of the length of microtubules or their initial density, but that the contraction timescale varies with the average microtubule length. To gain insight into why this microscopic property influences the macroscopic network contraction time, we developed simulations where microtubules and motors are explicitly represented. The simulations qualitatively recapitulate the variation of contraction timescale with microtubule length, and allowed stress contributions from different sources to be estimated and decoupled.

Majority-Vote Model on Opinion-Dependent Network

NASA Astrophysics Data System (ADS)

Lima, F. W. S.

2013-09-01

We study a nonequilibrium model with up-down symmetry and a noise parameter q known as majority-vote model (MVM) of Oliveira 1992 on opinion-dependent network or Stauffer-Hohnisch-Pittnauer (SHP) networks. By Monte Carlo (MC) simulations and finite-size scaling relations the critical exponents β/ν, γ/ν and 1/ν and points qc and U* are obtained. After extensive simulations, we obtain β/ν = 0.230(3), γ/ν = 0.535(2) and 1/ν = 0.475(8). The calculated values of the critical noise parameter and Binder cumulant are qc = 0.166(3) and U* = 0.288(3). Within the error bars, the exponents obey the relation 2β/ν + γ/ν = 1 and the results presented here demonstrate that the MVM belongs to a different universality class than the equilibrium Ising model on SHP networks, but to the same class as majority-vote models on some other networks.

Insights into failed lexical retrieval from network science

PubMed Central

Vitevitch, Michael S.; Chan, Kit Ying; Goldstein, Rutherford

2013-01-01

Previous network analyses of the phonological lexicon (Vitevitch, 2008) observed a web-like structure that exhibited assortative mixing by degree: words with dense phonological neighborhoods tend to have as neighbors words that also have dense phonological neighborhoods, and words with sparse phonological neighborhoods tend to have as neighbors words that also have sparse phonological neighborhoods. Given the role that assortative mixing by degree plays in network resilience, we examined instances of real and simulated lexical retrieval failures in computer simulations, analysis of a slips-of-the-ear corpus, and three psycholinguistic experiments for evidence of this network characteristic in human behavior. The results of the various analyses support the hypothesis that the structure of words in the mental lexicon influences lexical processing. The implications of network science for current models of spoken word recognition, language processing, and cognitive psychology more generally are discussed. PMID:24269488

Developmental Self-Construction and -Configuration of Functional Neocortical Neuronal Networks

PubMed Central

Bauer, Roman; Zubler, Frédéric; Pfister, Sabina; Hauri, Andreas; Pfeiffer, Michael; Muir, Dylan R.; Douglas, Rodney J.

2014-01-01

The prenatal development of neural circuits must provide sufficient configuration to support at least a set of core postnatal behaviors. Although knowledge of various genetic and cellular aspects of development is accumulating rapidly, there is less systematic understanding of how these various processes play together in order to construct such functional networks. Here we make some steps toward such understanding by demonstrating through detailed simulations how a competitive co-operative (‘winner-take-all’, WTA) network architecture can arise by development from a single precursor cell. This precursor is granted a simplified gene regulatory network that directs cell mitosis, differentiation, migration, neurite outgrowth and synaptogenesis. Once initial axonal connection patterns are established, their synaptic weights undergo homeostatic unsupervised learning that is shaped by wave-like input patterns. We demonstrate how this autonomous genetically directed developmental sequence can give rise to self-calibrated WTA networks, and compare our simulation results with biological data. PMID:25474693

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

NASA Technical Reports Server (NTRS)

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

2002-01-01

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

Cellular automata simulation of topological effects on the dynamics of feed-forward motifs

PubMed Central

Apte, Advait A; Cain, John W; Bonchev, Danail G; Fong, Stephen S

2008-01-01

Background Feed-forward motifs are important functional modules in biological and other complex networks. The functionality of feed-forward motifs and other network motifs is largely dictated by the connectivity of the individual network components. While studies on the dynamics of motifs and networks are usually devoted to the temporal or spatial description of processes, this study focuses on the relationship between the specific architecture and the overall rate of the processes of the feed-forward family of motifs, including double and triple feed-forward loops. The search for the most efficient network architecture could be of particular interest for regulatory or signaling pathways in biology, as well as in computational and communication systems. Results Feed-forward motif dynamics were studied using cellular automata and compared with differential equation modeling. The number of cellular automata iterations needed for a 100% conversion of a substrate into a target product was used as an inverse measure of the transformation rate. Several basic topological patterns were identified that order the specific feed-forward constructions according to the rate of dynamics they enable. At the same number of network nodes and constant other parameters, the bi-parallel and tri-parallel motifs provide higher network efficacy than single feed-forward motifs. Additionally, a topological property of isodynamicity was identified for feed-forward motifs where different network architectures resulted in the same overall rate of the target production. Conclusion It was shown for classes of structural motifs with feed-forward architecture that network topology affects the overall rate of a process in a quantitatively predictable manner. These fundamental results can be used as a basis for simulating larger networks as combinations of smaller network modules with implications on studying synthetic gene circuits, small regulatory systems, and eventually dynamic whole-cell models. PMID:18304325

Cooperative spreading processes in multiplex networks.

PubMed

Wei, Xiang; Chen, Shihua; Wu, Xiaoqun; Ning, Di; Lu, Jun-An

2016-06-01

This study is concerned with the dynamic behaviors of epidemic spreading in multiplex networks. A model composed of two interacting complex networks is proposed to describe cooperative spreading processes, wherein the virus spreading in one layer can penetrate into the other to promote the spreading process. The global epidemic threshold of the model is smaller than the epidemic thresholds of the corresponding isolated networks. Thus, global epidemic onset arises in the interacting networks even though an epidemic onset does not arise in each isolated network. Simulations verify the analysis results and indicate that cooperative spreading processes in multiplex networks enhance the final infection fraction.

A New Wavelength Optimization and Energy-Saving Scheme Based on Network Coding in Software-Defined WDM-PON Networks

NASA Astrophysics Data System (ADS)

Ren, Danping; Wu, Shanshan; Zhang, Lijing

2016-09-01

In view of the characteristics of the global control and flexible monitor of software-defined networks (SDN), we proposes a new optical access network architecture dedicated to Wavelength Division Multiplexing-Passive Optical Network (WDM-PON) systems based on SDN. The network coding (NC) technology is also applied into this architecture to enhance the utilization of wavelength resource and reduce the costs of light source. Simulation results show that this scheme can optimize the throughput of the WDM-PON network, greatly reduce the system time delay and energy consumption.

Multi-agent-based bio-network for systems biology: protein-protein interaction network as an example.

PubMed

Ren, Li-Hong; Ding, Yong-Sheng; Shen, Yi-Zhen; Zhang, Xiang-Feng

2008-10-01

Recently, a collective effort from multiple research areas has been made to understand biological systems at the system level. This research requires the ability to simulate particular biological systems as cells, organs, organisms, and communities. In this paper, a novel bio-network simulation platform is proposed for system biology studies by combining agent approaches. We consider a biological system as a set of active computational components interacting with each other and with an external environment. Then, we propose a bio-network platform for simulating the behaviors of biological systems and modelling them in terms of bio-entities and society-entities. As a demonstration, we discuss how a protein-protein interaction (PPI) network can be seen as a society of autonomous interactive components. From interactions among small PPI networks, a large PPI network can emerge that has a remarkable ability to accomplish a complex function or task. We also simulate the evolution of the PPI networks by using the bio-operators of the bio-entities. Based on the proposed approach, various simulators with different functions can be embedded in the simulation platform, and further research can be done from design to development, including complexity validation of the biological system.

Evaluating methods of inferring gene regulatory networks highlights their lack of performance for single cell gene expression data.

PubMed

Chen, Shuonan; Mar, Jessica C

2018-06-19

A fundamental fact in biology states that genes do not operate in isolation, and yet, methods that infer regulatory networks for single cell gene expression data have been slow to emerge. With single cell sequencing methods now becoming accessible, general network inference algorithms that were initially developed for data collected from bulk samples may not be suitable for single cells. Meanwhile, although methods that are specific for single cell data are now emerging, whether they have improved performance over general methods is unknown. In this study, we evaluate the applicability of five general methods and three single cell methods for inferring gene regulatory networks from both experimental single cell gene expression data and in silico simulated data. Standard evaluation metrics using ROC curves and Precision-Recall curves against reference sets sourced from the literature demonstrated that most of the methods performed poorly when they were applied to either experimental single cell data, or simulated single cell data, which demonstrates their lack of performance for this task. Using default settings, network methods were applied to the same datasets. Comparisons of the learned networks highlighted the uniqueness of some predicted edges for each method. The fact that different methods infer networks that vary substantially reflects the underlying mathematical rationale and assumptions that distinguish network methods from each other. This study provides a comprehensive evaluation of network modeling algorithms applied to experimental single cell gene expression data and in silico simulated datasets where the network structure is known. Comparisons demonstrate that most of these assessed network methods are not able to predict network structures from single cell expression data accurately, even if they are specifically developed for single cell methods. Also, single cell methods, which usually depend on more elaborative algorithms, in general have less similarity to each other in the sets of edges detected. The results from this study emphasize the importance for developing more accurate optimized network modeling methods that are compatible for single cell data. Newly-developed single cell methods may uniquely capture particular features of potential gene-gene relationships, and caution should be taken when we interpret these results.

Selected-node stochastic simulation algorithm

NASA Astrophysics Data System (ADS)

Duso, Lorenzo; Zechner, Christoph

2018-04-01

Stochastic simulations of biochemical networks are of vital importance for understanding complex dynamics in cells and tissues. However, existing methods to perform such simulations are associated with computational difficulties and addressing those remains a daunting challenge to the present. Here we introduce the selected-node stochastic simulation algorithm (snSSA), which allows us to exclusively simulate an arbitrary, selected subset of molecular species of a possibly large and complex reaction network. The algorithm is based on an analytical elimination of chemical species, thereby avoiding explicit simulation of the associated chemical events. These species are instead described continuously in terms of statistical moments derived from a stochastic filtering equation, resulting in a substantial speedup when compared to Gillespie's stochastic simulation algorithm (SSA). Moreover, we show that statistics obtained via snSSA profit from a variance reduction, which can significantly lower the number of Monte Carlo samples needed to achieve a certain performance. We demonstrate the algorithm using several biological case studies for which the simulation time could be reduced by orders of magnitude.

Link performance model for filter bank based multicarrier systems

NASA Astrophysics Data System (ADS)

Petrov, Dmitry; Oborina, Alexandra; Giupponi, Lorenza; Stitz, Tobias Hidalgo

2014-12-01

This paper presents a complete link level abstraction model for link quality estimation on the system level of filter bank multicarrier (FBMC)-based networks. The application of mean mutual information per coded bit (MMIB) approach is validated for the FBMC systems. The considered quality measure of the resource element for the FBMC transmission is the received signal-to-noise-plus-distortion ratio (SNDR). Simulation results of the proposed link abstraction model show that the proposed approach is capable of estimating the block error rate (BLER) accurately, even when the signal is propagated through the channels with deep and frequent fades, as it is the case for the 3GPP Hilly Terrain (3GPP-HT) and Enhanced Typical Urban (ETU) models. The FBMC-related results of link level simulations are compared with cyclic prefix orthogonal frequency division multiplexing (CP-OFDM) analogs. Simulation results are also validated through the comparison to reference publicly available results. Finally, the steps of link level abstraction algorithm for FBMC are formulated and its application for system level simulation of a professional mobile radio (PMR) network is discussed.

Flight Test Results from the NF-15B Intelligent Flight Control System (IFCS) Project with Adaptation to a Simulated Stabilator Failure

NASA Technical Reports Server (NTRS)

Bosworth, John T.; Williams-Hayes, Peggy S.

2007-01-01

Adaptive flight control systems have the potential to be more resilient to extreme changes in airplane behavior. Extreme changes could be a result of a system failure or of damage to the airplane. A direct adaptive neural-network-based flight control system was developed for the National Aeronautics and Space Administration NF-15B Intelligent Flight Control System airplane and subjected to an inflight simulation of a failed (frozen) (unmovable) stabilator. Formation flight handling qualities evaluations were performed with and without neural network adaptation. The results of these flight tests are presented. Comparison with simulation predictions and analysis of the performance of the adaptation system are discussed. The performance of the adaptation system is assessed in terms of its ability to decouple the roll and pitch response and reestablish good onboard model tracking. Flight evaluation with the simulated stabilator failure and adaptation engaged showed that there was generally improvement in the pitch response; however, a tendency for roll pilot-induced oscillation was experienced. A detailed discussion of the cause of the mixed results is presented.

Flight Test Results from the NF-15B Intelligent Flight Control System (IFCS) Project with Adaptation to a Simulated Stabilator Failure

NASA Technical Reports Server (NTRS)

Bosworth, John T.; Williams-Hayes, Peggy S.

2010-01-01

Adaptive flight control systems have the potential to be more resilient to extreme changes in airplane behavior. Extreme changes could be a result of a system failure or of damage to the airplane. A direct adaptive neural-network-based flight control system was developed for the National Aeronautics and Space Administration NF-15B Intelligent Flight Control System airplane and subjected to an inflight simulation of a failed (frozen) (unmovable) stabilator. Formation flight handling qualities evaluations were performed with and without neural network adaptation. The results of these flight tests are presented. Comparison with simulation predictions and analysis of the performance of the adaptation system are discussed. The performance of the adaptation system is assessed in terms of its ability to decouple the roll and pitch response and reestablish good onboard model tracking. Flight evaluation with the simulated stabilator failure and adaptation engaged showed that there was generally improvement in the pitch response; however, a tendency for roll pilot-induced oscillation was experienced. A detailed discussion of the cause of the mixed results is presented.

Research of G3-PLC net self-organization processes in the NS-3 modeling framework

NASA Astrophysics Data System (ADS)

Pospelova, Irina; Chebotayev, Pavel; Klimenko, Aleksey; Myakochin, Yuri; Polyakov, Igor; Shelupanov, Alexander; Zykov, Dmitriy

2017-11-01

When modern infocommunication networks are designed, the combination of several data transfer channels is widely used. It is necessary for the purposes of improvement in quality and robustness of communication. Communication systems based on more than one data transfer channel are named heterogeneous communication systems. For the design of a heterogeneous network, the most optimal solution is the use of mesh technology. Mesh technology ensures message delivery to the destination under conditions of unpredictable interference environment situation in each of two channels. Therewith, one of the high-priority problems is the choice of a routing protocol when the mesh networks are designed. An important design stage for any computer network is modeling. Modeling allows us to design a few different variants of design solutions and also to compute all necessary functional specifications for each of these solutions. As a result, it allows us to reduce costs for the physical realization of a network. In this article the research of dynamic routing in the NS3 simulation modeling framework is presented. The article contains an evaluation of simulation modeling applicability in solving the problem of heterogeneous networks design. Results of modeling may be afterwards used for physical realization of this kind of networks.

Predictive optimal control of sewer networks using CORAL tool: application to Riera Blanca catchment in Barcelona.

PubMed

Puig, V; Cembrano, G; Romera, J; Quevedo, J; Aznar, B; Ramón, G; Cabot, J

2009-01-01

This paper deals with the global control of the Riera Blanca catchment in the Barcelona sewer network using a predictive optimal control approach. This catchment has been modelled using a conceptual modelling approach based on decomposing the catchments in subcatchments and representing them as virtual tanks. This conceptual modelling approach allows real-time model calibration and control of the sewer network. The global control problem of the Riera Blanca catchment is solved using a optimal/predictive control algorithm. To implement the predictive optimal control of the Riera Blanca catchment, a software tool named CORAL is used. The on-line control is simulated by interfacing CORAL with a high fidelity simulator of sewer networks (MOUSE). CORAL interchanges readings from the limnimeters and gate commands with MOUSE as if it was connected with the real SCADA system. Finally, the global control results obtained using the predictive optimal control are presented and compared against the results obtained using current local control system. The results obtained using the global control are very satisfactory compared to those obtained using the local control.

Prediction of ultrasonic pulse velocity for enhanced peat bricks using adaptive neuro-fuzzy methodology.

PubMed

Motamedi, Shervin; Roy, Chandrabhushan; Shamshirband, Shahaboddin; Hashim, Roslan; Petković, Dalibor; Song, Ki-Il

2015-08-01

Ultrasonic pulse velocity is affected by defects in material structure. This study applied soft computing techniques to predict the ultrasonic pulse velocity for various peats and cement content mixtures for several curing periods. First, this investigation constructed a process to simulate the ultrasonic pulse velocity with adaptive neuro-fuzzy inference system. Then, an ANFIS network with neurons was developed. The input and output layers consisted of four and one neurons, respectively. The four inputs were cement, peat, sand content (%) and curing period (days). The simulation results showed efficient performance of the proposed system. The ANFIS and experimental results were compared through the coefficient of determination and root-mean-square error. In conclusion, use of ANFIS network enhances prediction and generation of strength. The simulation results confirmed the effectiveness of the suggested strategies. Copyright © 2015 Elsevier B.V. All rights reserved.

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

NASA Technical Reports Server (NTRS)

Kuhn, D. Richard; Kacker, Raghu; Lei, Yu

2010-01-01

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

Generalizing Gillespie’s Direct Method to Enable Network-Free Simulations

DOE PAGES

Suderman, Ryan T.; Mitra, Eshan David; Lin, Yen Ting; ...

2018-03-28

Gillespie’s direct method for stochastic simulation of chemical kinetics is a staple of computational systems biology research. However, the algorithm requires explicit enumeration of all reactions and all chemical species that may arise in the system. In many cases, this is not feasible due to the combinatorial explosion of reactions and species in biological networks. Rule-based modeling frameworks provide a way to exactly represent networks containing such combinatorial complexity, and generalizations of Gillespie’s direct method have been developed as simulation engines for rule-based modeling languages. Here, we provide both a high-level description of the algorithms underlying the simulation engines, termedmore » network-free simulation algorithms, and how they have been applied in systems biology research. We also define a generic rule-based modeling framework and describe a number of technical details required for adapting Gillespie’s direct method for network-free simulation. Lastly, we briefly discuss potential avenues for advancing network-free simulation and the role they continue to play in modeling dynamical systems in biology.« less

Generalizing Gillespie’s Direct Method to Enable Network-Free Simulations

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

Suderman, Ryan T.; Mitra, Eshan David; Lin, Yen Ting

Gillespie’s direct method for stochastic simulation of chemical kinetics is a staple of computational systems biology research. However, the algorithm requires explicit enumeration of all reactions and all chemical species that may arise in the system. In many cases, this is not feasible due to the combinatorial explosion of reactions and species in biological networks. Rule-based modeling frameworks provide a way to exactly represent networks containing such combinatorial complexity, and generalizations of Gillespie’s direct method have been developed as simulation engines for rule-based modeling languages. Here, we provide both a high-level description of the algorithms underlying the simulation engines, termedmore » network-free simulation algorithms, and how they have been applied in systems biology research. We also define a generic rule-based modeling framework and describe a number of technical details required for adapting Gillespie’s direct method for network-free simulation. Lastly, we briefly discuss potential avenues for advancing network-free simulation and the role they continue to play in modeling dynamical systems in biology.« less

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

A Simulation of Cooperation and Competition in Insurgent Networks

NASA Astrophysics Data System (ADS)

Gabbay, Michael

2014-03-01

Insurgencies are often characterized by multiple groups who share a common foe in the national government but have independent organizations which may differ with respect to social identities, ideologies, strategies, and their use of violence. These groups may cooperate in various ways such as conducting joint attacks, pooling resources, and establishing formal alliances or mergers. However, they may also compete with each other over popular support, recruitment of fighters, funding, allies, and ultimately military dominance. A network coevolution model of insurgent factional dynamics is presented which accounts for factors driving cooperation and competition. The model is formulated as a system of coupled ODEs which evolves network ties between insurgent groups along with group policies concerning the targets of violence. Simulation results are presented showing sharp transitions in network structure as model parameters are varied. Connections are drawn between the model results and empirical data from the Iraqi insurgency. This work was supported by the Office of Naval Research under grant N00014-13-1-0381.

Design and Analysis of a Low Latency Deterministic Network MAC for Wireless Sensor Networks

PubMed Central

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-01-01

The IEEE 802.15.4e standard has four different superframe structures for different applications. Use of a low latency deterministic network (LLDN) superframe for the wireless sensor network is one of them, which can operate in a star topology. In this paper, a new channel access mechanism for IEEE 802.15.4e-based LLDN shared slots is proposed, and analytical models are designed based on this channel access mechanism. A prediction model is designed to estimate the possible number of retransmission slots based on the number of failed transmissions. Performance analysis in terms of data transmission reliability, delay, throughput and energy consumption are provided based on our proposed designs. Our designs are validated for simulation and analytical results, and it is observed that the simulation results well match with the analytical ones. Besides, our designs are compared with the IEEE 802.15.4 MAC mechanism, and it is shown that ours outperforms in terms of throughput, energy consumption, delay and reliability. PMID:28937632

Design and Analysis of a Low Latency Deterministic Network MAC for Wireless Sensor Networks.

PubMed

Sahoo, Prasan Kumar; Pattanaik, Sudhir Ranjan; Wu, Shih-Lin

2017-09-22

The IEEE 802.15.4e standard has four different superframe structures for different applications. Use of a low latency deterministic network (LLDN) superframe for the wireless sensor network is one of them, which can operate in a star topology. In this paper, a new channel access mechanism for IEEE 802.15.4e-based LLDN shared slots is proposed, and analytical models are designed based on this channel access mechanism. A prediction model is designed to estimate the possible number of retransmission slots based on the number of failed transmissions. Performance analysis in terms of data transmission reliability, delay, throughput and energy consumption are provided based on our proposed designs. Our designs are validated for simulation and analytical results, and it is observed that the simulation results well match with the analytical ones. Besides, our designs are compared with the IEEE 802.15.4 MAC mechanism, and it is shown that ours outperforms in terms of throughput, energy consumption, delay and reliability.

GTRF: a game theory approach for regulating node behavior in real-time wireless sensor networks.

PubMed

Lin, Chi; Wu, Guowei; Pirozmand, Poria

2015-06-04

The selfish behaviors of nodes (or selfish nodes) cause packet loss, network congestion or even void regions in real-time wireless sensor networks, which greatly decrease the network performance. Previous methods have focused on detecting selfish nodes or avoiding selfish behavior, but little attention has been paid to regulating selfish behavior. In this paper, a Game Theory-based Real-time & Fault-tolerant (GTRF) routing protocol is proposed. GTRF is composed of two stages. In the first stage, a game theory model named VA is developed to regulate nodes' behaviors and meanwhile balance energy cost. In the second stage, a jumping transmission method is adopted, which ensures that real-time packets can be successfully delivered to the sink before a specific deadline. We prove that GTRF theoretically meets real-time requirements with low energy cost. Finally, extensive simulations are conducted to demonstrate the performance of our scheme. Simulation results show that GTRF not only balances the energy cost of the network, but also prolongs network lifetime.

Synchronization from Second Order Network Connectivity Statistics

PubMed Central

Zhao, Liqiong; Beverlin, Bryce; Netoff, Theoden; Nykamp, Duane Q.

2011-01-01

We investigate how network structure can influence the tendency for a neuronal network to synchronize, or its synchronizability, independent of the dynamical model for each neuron. The synchrony analysis takes advantage of the framework of second order networks, which defines four second order connectivity statistics based on the relative frequency of two-connection network motifs. The analysis identifies two of these statistics, convergent connections, and chain connections, as highly influencing the synchrony. Simulations verify that synchrony decreases with the frequency of convergent connections and increases with the frequency of chain connections. These trends persist with simulations of multiple models for the neuron dynamics and for different types of networks. Surprisingly, divergent connections, which determine the fraction of shared inputs, do not strongly influence the synchrony. The critical role of chains, rather than divergent connections, in influencing synchrony can be explained by their increasing the effective coupling strength. The decrease of synchrony with convergent connections is primarily due to the resulting heterogeneity in firing rates. PMID:21779239

Simulate speleogenesis processes with an approach based on fracturing and hydrogeological processes: effect of various hydraulic boundary conditions

NASA Astrophysics Data System (ADS)

Lafare, A.; Jourde, H.; Leonardi, V.; Pistre, S.; Dörfliger, N.

2012-04-01

Several numerical modeling approaches attempted to simulate the processes of karst conduit genesis. These existing methods are mainly based on the physical and chemical laws driving the carbonate dissolution processes (taking account of calcite saturation of the water and the partial pressure of carbon dioxide). As a consequence, these works bring a well-documented knowledge on the kinetics of the carbonate dissolution processes in karst systems. Nevertheless, these models are mainly applied on simplified initial void networks, which do not match the fracturing and geological reality. Considering that the initial geometry of the void network (fractures, bedding planes) would have an influence on the final pattern of the speleological network, taking account of it could improve the understanding of speleogenesis. In the aim to take into account the geometry of the initial void network (fracture networks of several orders), a numerical model is developed, which involves a pseudo-statistic fracturing generator (REZO3D, Jourde 1999, Josnin et al. 2002, Jourde et al. 2002) coupled to a finite element groundwater simulator (GROUNDWATER, F. Cornaton, CHYN, University of Neuchâtel). The principle of the modeling of the genesis of the karst drainage system is based on an analogical empirical polynomial equation considering the pore velocity and the mean age of the water as main parameters. The computation is carried out on the basis of a time step, whose duration depends on the simulated scenario (from 100 to 5000 years). The mean age of the water is used in order to simulate the decrease of the chemical dissolving potential of the water within the aquifer, in contact with the carbonate rock. The first simulator -REZO3D- allows producing three-dimensional discrete fracture networks constituted by plane fractures, whose spatial distribution respects mechanical and statistical laws. These networks are then processed in order to write finite element meshes which constitute the bases of groundwater flow and transport simulations. The polynomial parameters of the equation are calibrated with former speleogenesis studies (Dreybrodt 1996, Dreybrodt et al. 2005, Palmer 1991). The presented study involves two orthogonal families of fractures embedded in a carbonate matrix, in a mono-stratum setting. For each simulation, several settings of boundary conditions are tested, in terms of recharge (diffuse or concentrated, hydraulic head or flux limited) and discharge (spatial position, punctual or diffuse). The results are interpreted in terms of head fields, mean groundwater age distributions and total flow rates as a function of time. The aim is to assess the influence of the hydraulic boundary conditions on the finally obtained morphologies of the karstic networks, and on the velocity of the evolution of the drainage system. Results are discussed and perspectives are given on the application of such model to real case studies.

Spectral Entropy Based Neuronal Network Synchronization Analysis Based on Microelectrode Array Measurements

PubMed Central

Kapucu, Fikret E.; Välkki, Inkeri; Mikkonen, Jarno E.; Leone, Chiara; Lenk, Kerstin; Tanskanen, Jarno M. A.; Hyttinen, Jari A. K.

2016-01-01

Synchrony and asynchrony are essential aspects of the functioning of interconnected neuronal cells and networks. New information on neuronal synchronization can be expected to aid in understanding these systems. Synchronization provides insight in the functional connectivity and the spatial distribution of the information processing in the networks. Synchronization is generally studied with time domain analysis of neuronal events, or using direct frequency spectrum analysis, e.g., in specific frequency bands. However, these methods have their pitfalls. Thus, we have previously proposed a method to analyze temporal changes in the complexity of the frequency of signals originating from different network regions. The method is based on the correlation of time varying spectral entropies (SEs). SE assesses the regularity, or complexity, of a time series by quantifying the uniformity of the frequency spectrum distribution. It has been previously employed, e.g., in electroencephalogram analysis. Here, we revisit our correlated spectral entropy method (CorSE), providing evidence of its justification, usability, and benefits. Here, CorSE is assessed with simulations and in vitro microelectrode array (MEA) data. CorSE is first demonstrated with a specifically tailored toy simulation to illustrate how it can identify synchronized populations. To provide a form of validation, the method was tested with simulated data from integrate-and-fire model based computational neuronal networks. To demonstrate the analysis of real data, CorSE was applied on in vitro MEA data measured from rat cortical cell cultures, and the results were compared with three known event based synchronization measures. Finally, we show the usability by tracking the development of networks in dissociated mouse cortical cell cultures. The results show that temporal correlations in frequency spectrum distributions reflect the network relations of neuronal populations. In the simulated data, CorSE unraveled the synchronizations. With the real in vitro MEA data, CorSE produced biologically plausible results. Since CorSE analyses continuous data, it is not affected by possibly poor spike or other event detection quality. We conclude that CorSE can reveal neuronal network synchronization based on in vitro MEA field potential measurements. CorSE is expected to be equally applicable also in the analysis of corresponding in vivo and ex vivo data analysis. PMID:27803660

Exponential stability of stochastic complex networks with multi-weights based on graph theory

NASA Astrophysics Data System (ADS)

Zhang, Chunmei; Chen, Tianrui

2018-04-01

In this paper, a novel approach to exponential stability of stochastic complex networks with multi-weights is investigated by means of the graph-theoretical method. New sufficient conditions are provided to ascertain the moment exponential stability and almost surely exponential stability of stochastic complex networks with multiple weights. It is noted that our stability results are closely related with multi-weights and the intensity of stochastic disturbance. Numerical simulations are also presented to substantiate the theoretical results.

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

NASA Astrophysics Data System (ADS)

Sharqawy, Mostafa H.

2016-12-01

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

Virtual network embedding in cross-domain network based on topology and resource attributes

NASA Astrophysics Data System (ADS)

Zhu, Lei; Zhang, Zhizhong; Feng, Linlin; Liu, Lilan

2018-03-01

Aiming at the network architecture ossification and the diversity of access technologies issues, this paper researches the cross-domain virtual network embedding algorithm. By analysing the topological attribute from the local and global perspective of nodes in the virtual network and the physical network, combined with the local network resource property, we rank the embedding priority of the nodes with PCA and TOPSIS methods. Besides, the link load distribution is considered. Above all, We proposed an cross-domain virtual network embedding algorithm based on topology and resource attributes. The simulation results depicts that our algorithm increases the acceptance rate of multi-domain virtual network requests, compared with the existing virtual network embedding algorithm.

High-gain EDFA using ASE suppression: numerical simulation and experimental characterization

NASA Astrophysics Data System (ADS)

Woellner, Eudes F.; Fugihara, Meire C.; Vendramin, Marcio; Chitz, Edson; Kalinowski, Hypolito J.; Pontes, Maria J.

2001-08-01

A single stage, bi-directionally pumped Erbium Doped Fiber Amplifier is studied, using a scheme that reduces the counter propagating ASE, avoiding self saturation due to ASE. The amplifier is numerically simulated and experimentally characterized. Gain, saturation and polarization dependence measurements are carried to compare with simulated results. Transient response is simulated to verify the amplifier performance in cable television distribution network.

Spreading dynamics of a SIQRS epidemic model on scale-free networks

NASA Astrophysics Data System (ADS)

Li, Tao; Wang, Yuanmei; Guan, Zhi-Hong

2014-03-01

In order to investigate the influence of heterogeneity of the underlying networks and quarantine strategy on epidemic spreading, a SIQRS epidemic model on the scale-free networks is presented. Using the mean field theory the spreading dynamics of the virus is analyzed. The spreading critical threshold and equilibria are derived. Theoretical results indicate that the critical threshold value is significantly dependent on the topology of the underlying networks and quarantine rate. The existence of equilibria is determined by threshold value. The stability of disease-free equilibrium and the permanence of the disease are proved. Numerical simulations confirmed the analytical results.

Boundedness, Mittag-Leffler stability and asymptotical ω-periodicity of fractional-order fuzzy neural networks.

PubMed

Wu, Ailong; Zeng, Zhigang

2016-02-01

We show that the ω-periodic fractional-order fuzzy neural networks cannot generate non-constant ω-periodic signals. In addition, several sufficient conditions are obtained to ascertain the boundedness and global Mittag-Leffler stability of fractional-order fuzzy neural networks. Furthermore, S-asymptotical ω-periodicity and global asymptotical ω-periodicity of fractional-order fuzzy neural networks is also characterized. The obtained criteria improve and extend the existing related results. To illustrate and compare the theoretical criteria, some numerical examples with simulation results are discussed in detail. Crown Copyright © 2015. Published by Elsevier Ltd. All rights reserved.

Surgical model-view-controller simulation software framework for local and collaborative applications

PubMed Central

Sankaranarayanan, Ganesh; Halic, Tansel; Arikatla, Venkata Sreekanth; Lu, Zhonghua; De, Suvranu

2010-01-01

Purpose Surgical simulations require haptic interactions and collaboration in a shared virtual environment. A software framework for decoupled surgical simulation based on a multi-controller and multi-viewer model-view-controller (MVC) pattern was developed and tested. Methods A software framework for multimodal virtual environments was designed, supporting both visual interactions and haptic feedback while providing developers with an integration tool for heterogeneous architectures maintaining high performance, simplicity of implementation, and straightforward extension. The framework uses decoupled simulation with updates of over 1,000 Hz for haptics and accommodates networked simulation with delays of over 1,000 ms without performance penalty. Results The simulation software framework was implemented and was used to support the design of virtual reality-based surgery simulation systems. The framework supports the high level of complexity of such applications and the fast response required for interaction with haptics. The efficacy of the framework was tested by implementation of a minimally invasive surgery simulator. Conclusion A decoupled simulation approach can be implemented as a framework to handle simultaneous processes of the system at the various frame rates each process requires. The framework was successfully used to develop collaborative virtual environments (VEs) involving geographically distributed users connected through a network, with the results comparable to VEs for local users. PMID:20714933

Artificial Neural Network Metamodels of Stochastic Computer Simulations

DTIC Science & Technology

1994-08-10

SUBTITLE r 5. FUNDING NUMBERS Artificial Neural Network Metamodels of Stochastic I () Computer Simulations 6. AUTHOR(S) AD- A285 951 Robert Allen...8217!298*1C2 ARTIFICIAL NEURAL NETWORK METAMODELS OF STOCHASTIC COMPUTER SIMULATIONS by Robert Allen Kilmer B.S. in Education Mathematics, Indiana...dedicate this document to the memory of my father, William Ralph Kilmer. mi ABSTRACT Signature ARTIFICIAL NEURAL NETWORK METAMODELS OF STOCHASTIC

ChainMail based neural dynamics modeling of soft tissue deformation for surgical simulation.

PubMed

Zhang, Jinao; Zhong, Yongmin; Smith, Julian; Gu, Chengfan

2017-07-20

Realistic and real-time modeling and simulation of soft tissue deformation is a fundamental research issue in the field of surgical simulation. In this paper, a novel cellular neural network approach is presented for modeling and simulation of soft tissue deformation by combining neural dynamics of cellular neural network with ChainMail mechanism. The proposed method formulates the problem of elastic deformation into cellular neural network activities to avoid the complex computation of elasticity. The local position adjustments of ChainMail are incorporated into the cellular neural network as the local connectivity of cells, through which the dynamic behaviors of soft tissue deformation are transformed into the neural dynamics of cellular neural network. Experiments demonstrate that the proposed neural network approach is capable of modeling the soft tissues' nonlinear deformation and typical mechanical behaviors. The proposed method not only improves ChainMail's linear deformation with the nonlinear characteristics of neural dynamics but also enables the cellular neural network to follow the principle of continuum mechanics to simulate soft tissue deformation.

Space Communications and Navigation (SCaN) Network Simulation Tool Development and Its Use Cases

NASA Technical Reports Server (NTRS)

Jennings, Esther; Borgen, Richard; Nguyen, Sam; Segui, John; Stoenescu, Tudor; Wang, Shin-Ywan; Woo, Simon; Barritt, Brian; Chevalier, Christine; Eddy, Wesley

2009-01-01

In this work, we focus on the development of a simulation tool to assist in analysis of current and future (proposed) network architectures for NASA. Specifically, the Space Communications and Navigation (SCaN) Network is being architected as an integrated set of new assets and a federation of upgraded legacy systems. The SCaN architecture for the initial missions for returning humans to the moon and beyond will include the Space Network (SN) and the Near-Earth Network (NEN). In addition to SCaN, the initial mission scenario involves a Crew Exploration Vehicle (CEV), the International Space Station (ISS) and NASA Integrated Services Network (NISN). We call the tool being developed the SCaN Network Integration and Engineering (SCaN NI&E) Simulator. The intended uses of such a simulator are: (1) to characterize performance of particular protocols and configurations in mission planning phases; (2) to optimize system configurations by testing a larger parameter space than may be feasible in either production networks or an emulated environment; (3) to test solutions in order to find issues/risks before committing more significant resources needed to produce real hardware or flight software systems. We describe two use cases of the tool: (1) standalone simulation of CEV to ISS baseline scenario to determine network performance, (2) participation in Distributed Simulation Integration Laboratory (DSIL) tests to perform function testing and verify interface and interoperability of geographically dispersed simulations/emulations.

Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks

PubMed Central

Vestergaard, Christian L.; Génois, Mathieu

2015-01-01

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling. PMID:26517860

Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks.

PubMed

Vestergaard, Christian L; Génois, Mathieu

2015-10-01

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling.

Comment on high resolution simulations of cosmic strings. 1: Network evoloution

NASA Technical Reports Server (NTRS)

Turok, Neil; Albrecht, Andreas

1990-01-01

Comments are made on recent claims (Albrecht and Turok, 1989) regarding simulations of cosmic string evolution. Specially, it was claimed that results were dominated by a numerical artifact which rounds out kinks on a scale of the order of the correlation length on the network. This claim was based on an approximate analysis of an interpolation equation which is solved herein. The typical rounding scale is actually less than one fifth of the correlation length, and comparable with other numerical cutoffs. Results confirm previous estimates of numerical uncertainties, and show that the approximations poorly represent the real solutions to the interpolation equation.

Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks

PubMed Central

Moya, José M.; Vallejo, Juan Carlos; Fraga, David; Araujo, Álvaro; Villanueva, Daniel; de Goyeneche, Juan-Mariano

2009-01-01

Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios. PMID:22412345

An Efficient Framework Model for Optimizing Routing Performance in VANETs

PubMed Central

Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala

2018-01-01

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED). PMID:29462884

An additional k-means clustering step improves the biological features of WGCNA gene co-expression networks.

PubMed

Botía, Juan A; Vandrovcova, Jana; Forabosco, Paola; Guelfi, Sebastian; D'Sa, Karishma; Hardy, John; Lewis, Cathryn M; Ryten, Mina; Weale, Michael E

2017-04-12

Weighted Gene Co-expression Network Analysis (WGCNA) is a widely used R software package for the generation of gene co-expression networks (GCN). WGCNA generates both a GCN and a derived partitioning of clusters of genes (modules). We propose k-means clustering as an additional processing step to conventional WGCNA, which we have implemented in the R package km2gcn (k-means to gene co-expression network, https://github.com/juanbot/km2gcn ). We assessed our method on networks created from UKBEC data (10 different human brain tissues), on networks created from GTEx data (42 human tissues, including 13 brain tissues), and on simulated networks derived from GTEx data. We observed substantially improved module properties, including: (1) few or zero misplaced genes; (2) increased counts of replicable clusters in alternate tissues (x3.1 on average); (3) improved enrichment of Gene Ontology terms (seen in 48/52 GCNs) (4) improved cell type enrichment signals (seen in 21/23 brain GCNs); and (5) more accurate partitions in simulated data according to a range of similarity indices. The results obtained from our investigations indicate that our k-means method, applied as an adjunct to standard WGCNA, results in better network partitions. These improved partitions enable more fruitful downstream analyses, as gene modules are more biologically meaningful.

Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks

DTIC Science & Technology

2009-09-01

Wireless Sensor Network (WSN) Simulator Research Personnel: Dr. Ali Abu-El Humos Task No. Task Current Status 1 Literature review and problem definition...networks.com/ [2] S. Dulman, P. Havinga, "A Simulation Template for Wireless Sensor Networks ," Supplement of the Sixth International Symposium on Autonomous... Sensor Network (WSN) Simulator 76 I Breakdown of the Research Activity to Tasks 76 II Description of the Tasks 76 Task 1 Literature Review and

Efficient generation of connectivity in neuronal networks from simulator-independent descriptions

PubMed Central

Djurfeldt, Mikael; Davison, Andrew P.; Eppler, Jochen M.

2014-01-01

Simulator-independent descriptions of connectivity in neuronal networks promise greater ease of model sharing, improved reproducibility of simulation results, and reduced programming effort for computational neuroscientists. However, until now, enabling the use of such descriptions in a given simulator in a computationally efficient way has entailed considerable work for simulator developers, which must be repeated for each new connectivity-generating library that is developed. We have developed a generic connection generator interface that provides a standard way to connect a connectivity-generating library to a simulator, such that one library can easily be replaced by another, according to the modeler's needs. We have used the connection generator interface to connect C++ and Python implementations of the previously described connection-set algebra to the NEST simulator. We also demonstrate how the simulator-independent modeling framework PyNN can transparently take advantage of this, passing a connection description through to the simulator layer for rapid processing in C++ where a simulator supports the connection generator interface and falling-back to slower iteration in Python otherwise. A set of benchmarks demonstrates the good performance of the interface. PMID:24795620

Genomic data assimilation for estimating hybrid functional Petri net from time-course gene expression data.

PubMed

Nagasaki, Masao; Yamaguchi, Rui; Yoshida, Ryo; Imoto, Seiya; Doi, Atsushi; Tamada, Yoshinori; Matsuno, Hiroshi; Miyano, Satoru; Higuchi, Tomoyuki

2006-01-01

We propose an automatic construction method of the hybrid functional Petri net as a simulation model of biological pathways. The problems we consider are how we choose the values of parameters and how we set the network structure. Usually, we tune these unknown factors empirically so that the simulation results are consistent with biological knowledge. Obviously, this approach has the limitation in the size of network of interest. To extend the capability of the simulation model, we propose the use of data assimilation approach that was originally established in the field of geophysical simulation science. We provide genomic data assimilation framework that establishes a link between our simulation model and observed data like microarray gene expression data by using a nonlinear state space model. A key idea of our genomic data assimilation is that the unknown parameters in simulation model are converted as the parameter of the state space model and the estimates are obtained as the maximum a posteriori estimators. In the parameter estimation process, the simulation model is used to generate the system model in the state space model. Such a formulation enables us to handle both the model construction and the parameter tuning within a framework of the Bayesian statistical inferences. In particular, the Bayesian approach provides us a way of controlling overfitting during the parameter estimations that is essential for constructing a reliable biological pathway. We demonstrate the effectiveness of our approach using synthetic data. As a result, parameter estimation using genomic data assimilation works very well and the network structure is suitably selected.

Research on a Queue Scheduling Algorithm in Wireless Communications Network

NASA Astrophysics Data System (ADS)

Yang, Wenchuan; Hu, Yuanmei; Zhou, Qiancai

This paper proposes a protocol QS-CT, Queue Scheduling Mechanism based on Multiple Access in Ad hoc net work, which adds queue scheduling mechanism to RTS-CTS-DATA using multiple access protocol. By endowing different queues different scheduling mechanisms, it makes networks access to the channel much more fairly and effectively, and greatly enhances the performance. In order to observe the final performance of the network with QS-CT protocol, we simulate it and compare it with MACA/C-T without QS-CT protocol. Contrast to MACA/C-T, the simulation result shows that QS-CT has greatly improved the throughput, delay, rate of packets' loss and other key indicators.

Neural network for control of rearrangeable Clos networks.

PubMed

Park, Y K; Cherkassky, V

1994-09-01

Rapid evolution in the field of communication networks requires high speed switching technologies. This involves a high degree of parallelism in switching control and routing performed at the hardware level. The multistage crossbar networks have always been attractive to switch designers. In this paper a neural network approach to controlling a three-stage Clos network in real time is proposed. This controller provides optimal routing of communication traffic requests on a call-by-call basis by rearranging existing connections, with a minimum length of rearrangement sequence so that a new blocked call request can be accommodated. The proposed neural network controller uses Paull's rearrangement algorithm, along with the special (least used) switch selection rule in order to minimize the length of rearrangement sequences. The functional behavior of our model is verified by simulations and it is shown that the convergence time required for finding an optimal solution is constant, regardless of the switching network size. The performance is evaluated for random traffic with various traffic loads. Simulation results show that applying the least used switch selection rule increases the efficiency in switch rearrangements, reducing the network convergence time. The implementation aspects are also discussed to show the feasibility of the proposed approach.

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.

eLoom and Flatland: specification, simulation and visualization engines for the study of arbitrary hierarchical neural architectures.

PubMed

Caudell, Thomas P; Xiao, Yunhai; Healy, Michael J

2003-01-01

eLoom is an open source graph simulation software tool, developed at the University of New Mexico (UNM), that enables users to specify and simulate neural network models. Its specification language and libraries enables users to construct and simulate arbitrary, potentially hierarchical network structures on serial and parallel processing systems. In addition, eLoom is integrated with UNM's Flatland, an open source virtual environments development tool to provide real-time visualizations of the network structure and activity. Visualization is a useful method for understanding both learning and computation in artificial neural networks. Through 3D animated pictorially representations of the state and flow of information in the network, a better understanding of network functionality is achieved. ART-1, LAPART-II, MLP, and SOM neural networks are presented to illustrate eLoom and Flatland's capabilities.

Quantitative Assessment of Transportation Network Vulnerability with Dynamic Traffic Simulation Methods

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

Shekar, Venkateswaran; Fiondella, Lance; Chatterjee, Samrat

Transportation networks are critical to the social and economic function of nations. Given the continuing increase in the populations of cities throughout the world, the criticality of transportation infrastructure is expected to increase. Thus, it is ever more important to mitigate congestion as well as to assess the impact disruptions would have on individuals who depend on transportation for their work and livelihood. Moreover, several government organizations are responsible for ensuring transportation networks are available despite the constant threat of natural disasters and terrorist activities. Most of the previous transportation network vulnerability research has been performed in the context ofmore » static traffic models, many of which are formulated as traditional optimization problems. However, transportation networks are dynamic because their usage varies over time. Thus, more appropriate methods to characterize the vulnerability of transportation networks should consider their dynamic properties. This paper presents a quantitative approach to assess the vulnerability of a transportation network to disruptions with methods from traffic simulation. Our approach can prioritize the critical links over time and is generalizable to the case where both link and node disruptions are of concern. We illustrate the approach through a series of examples. Our results demonstrate that the approach provides quantitative insight into the time varying criticality of links. Such an approach could be used as the objective function of less traditional optimization methods that use simulation and other techniques to evaluate the relative utility of a particular network defense to reduce vulnerability and increase resilience.« less

Better Water Demand and Pipe Description Improve the Distribution Network Modeling Results

EPA Science Inventory

Distribution system modeling simplifies pipe network in skeletonization and simulates the flow and water quality by using generalized water demand patterns. While widely used, the approach has not been examined fully on how it impacts the modeling fidelity. This study intends to ...

Conductive network formation of carbon nanotubes in elastic polymer microfibers and its effect on the electrical conductance: Experiment and simulation

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

Cho, Hyun Woo; Kim, Jeongmin; Sung, Bong June, E-mail: jjpark@chonnam.ac.kr, E-mail: bjsung@sogang.ac.kr

We investigate how the electrical conductance of microfibers (made of polymers and conductive nanofillers) decreases upon uniaxial deformation by performing both experiments and simulations. Even though various elastic conductors have been developed due to promising applications for deformable electronic devices, the mechanism at a molecular level for electrical conductance change has remained elusive. Previous studies proposed that the decrease in electrical conductance would result from changes in either distances or contact numbers between conductive fillers. In this work, we prepare microfibers of single walled carbon nanotubes (SWCNTs)/polyvinyl alcohol composites and investigate the electrical conductance and the orientation of SWCNTs uponmore » uniaxial deformation. We also perform extensive Monte Carlo simulations, which reproduce experimental results for the relative decrease in conductance and the SWCNTs orientation. We investigate the electrical networks of SWCNTs in microfibers and find that the decrease in the electrical conductance upon uniaxial deformation should be attributed to a subtle change in the topological structure of the electrical network.« less

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

PubMed Central

2009-01-01

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

Variation Scenarios in System Deployments for the GGOS2020 Space Geodesy Network

NASA Astrophysics Data System (ADS)

Pavlis, Erricos C.; Kuzmicz-Cieslak, Magdalena; MacMillan, Daniel S.

2017-04-01

Simulation studies have so far determined an approximate size and station density for the Space Geodetic Network that will meet the requirements recommended by the U.S. National Research Council report "Precise Geodetic Infrastructure: National Requirements for a Shared Resource" (2010). A network of about 30 globally distributed "core" observatories with state of the art equipment needs to be deployed over the next decade. Subsequently, GGOS—the Global Geodetic Observing System issued a "Call for Proposals for the expansion and update of the network, to which several countries committed to contribute. The renewal process will not happen instantly and for a long time, the network will comprise legacy and next generation equipment. We conducted a new batch of simulation studies using the proposed site locations and the proposed equipment at each site, to gauge the contribution of specific systems and locations to the global results. The majority of the examined sites are well-established future sites, some of which are even close to completion. Despite the good intentions of the contributing agencies/countries, in some cases we have identified regional gaps in coverage with either SLR or VLBI systems. We have characterized the effect of these gaps on the quality of the final TRF. We present the results of these simulation studies and rank the examined cases according to the likelihood that the designed network will successfully meet the GGOS goals of 1 mm accuracy (decadal scale) and a temporal stability on the order of 0.1 mm/y, with similar numbers for the scale and orientation components of the TRF.

GGOS2020 Space Geodesy Network: Variations in System Deployment Scenarios

NASA Astrophysics Data System (ADS)

Pavlis, E. C.; Koenig, D.; Kuzmicz-Cieslak, M.; MacMillan, D. S.

2016-12-01

Simulation studies have so far determined an approximate size and station density for the Space Geodetic Network that will meet the requirements recommended by the U.S. National Research Council report "Precise Geodetic Infrastructure: National Requirements for a Shared Resource" (2010). A network of about 30 globally distributed "core" observatories with state of the art equipment needs to be deployed over the next decade. Subsequently, GGOS—the Global Geodetic Observing System issued a "Call for Proposals for the expansion and update of the network, to which several countries committed to contribute. The renewal process will not happen instantly and for a long time, the network will comprise legacy and next generation equipment. We conducted a new batch of simulation studies using the proposed site locations and the proposed equipment at each site, to gauge the contribution of specific systems and locations to the global results. The majority of the examined sites are well-established future sites, some of which are even close to completion. Despite the good intentions of the contributing agencies/countries, in some cases we have identified regional gaps in coverage with either SLR or VLBI systems. We have characterized the effect of these gaps on the quality of the final TRF. We present the results of these simulation studies and rank the examined cases according to the likelihood that the designed network will successfully meet the GGOS goals of 1 mm accuracy (decadal scale) and a temporal stability on the order of 0.1 mm/y, with similar numbers for the scale and orientation components of the TRF.

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.

Flank wears Simulation by using back propagation neural network when cutting hardened H-13 steel in CNC End Milling

NASA Astrophysics Data System (ADS)

Hazza, Muataz Hazza F. Al; Adesta, Erry Y. T.; Riza, Muhammad

2013-12-01

High speed milling has many advantages such as higher removal rate and high productivity. However, higher cutting speed increase the flank wear rate and thus reducing the cutting tool life. Therefore estimating and predicting the flank wear length in early stages reduces the risk of unaccepted tooling cost. This research presents a neural network model for predicting and simulating the flank wear in the CNC end milling process. A set of sparse experimental data for finish end milling on AISI H13 at hardness of 48 HRC have been conducted to measure the flank wear length. Then the measured data have been used to train the developed neural network model. Artificial neural network (ANN) was applied to predict the flank wear length. The neural network contains twenty hidden layer with feed forward back propagation hierarchical. The neural network has been designed with MATLAB Neural Network Toolbox. The results show a high correlation between the predicted and the observed flank wear which indicates the validity of the models.

Performance of TCP variants over LTE network

NASA Astrophysics Data System (ADS)

Nor, Shahrudin Awang; Maulana, Ade Novia

2016-08-01

One of the implementation of a wireless network is based on mobile broadband technology Long Term Evolution (LTE). LTE offers a variety of advantages, especially in terms of access speed, capacity, architectural simplicity and ease of implementation, as well as the breadth of choice of the type of user equipment (UE) that can establish the access. The majority of the Internet connections in the world happen using the TCP (Transmission Control Protocol) due to the TCP's reliability in transmitting packets in the network. TCP reliability lies in the ability to control the congestion. TCP was originally designed for wired media, but LTE connected through a wireless medium that is not stable in comparison to wired media. A wide variety of TCP has been made to produce a better performance than its predecessor. In this study, we simulate the performance provided by the TCP NewReno and TCP Vegas based on simulation using network simulator version 2 (ns2). The TCP performance is analyzed in terms of throughput, packet loss and end-to-end delay. In comparing the performance of TCP NewReno and TCP Vegas, the simulation result shows that the throughput of TCP NewReno is slightly higher than TCP Vegas, while TCP Vegas gives significantly better end-to-end delay and packet loss. The analysis of throughput, packet loss and end-to-end delay are made to evaluate the simulation.

Geometric characterization and simulation of planar layered elastomeric fibrous biomaterials

DOE PAGES

Carleton, James B.; D’Amore, Antonio; Feaver, Kristen R.; ...

2014-10-13

Many important biomaterials are composed of multiple layers of networked fibers. While there is a growing interest in modeling and simulation of the mechanical response of these biomaterials, a theoretical foundation for such simulations has yet to be firmly established. Moreover, correctly identifying and matching key geometric features is a critically important first step for performing reliable mechanical simulations. This paper addresses these issues in two ways. First, using methods of geometric probability, we develop theoretical estimates for the mean linear and areal fiber intersection densities for 2-D fibrous networks. These densities are expressed in terms of the fiber densitymore » and the orientation distribution function, both of which are relatively easy-to-measure properties. Secondly, we develop a random walk algorithm for geometric simulation of 2-D fibrous networks which can accurately reproduce the prescribed fiber density and orientation distribution function. Furthermore, the linear and areal fiber intersection densities obtained with the algorithm are in agreement with the theoretical estimates. Both theoretical and computational results are compared with those obtained by post-processing of scanning electron microscope images of actual scaffolds. These comparisons reveal difficulties inherent to resolving fine details of multilayered fibrous networks. Finally, the methods provided herein can provide a rational means to define and generate key geometric features from experimentally measured or prescribed scaffold structural data.« less

How the initial level of visibility and limited resource affect the evolution of cooperation

NASA Astrophysics Data System (ADS)

Han, Dun; Li, Dandan; Sun, Mei

2016-06-01

This work sheds important light on how the initial level of visibility and limited resource might affect the evolution of the players’ strategies under different network structure. We perform the prisoner’s dilemma game in the lattice network and the scale-free network, the simulation results indicate that the average density of death in lattice network decreases with the increases of the initial proportion of visibility. However, the contrary phenomenon is observed in the scale-free network. Further results reflect that the individuals’ payoff in lattice network is significantly larger than the one in the scale-free network. In the lattice network, the visibility individuals could earn much more than the invisibility one. However, the difference is not apparent in the scale-free network. We also find that a high Successful-Defection-Payoff (SDB) and a rich natural environment have relatively larger deleterious cooperation effects. A high SDB is beneficial to raising the level of visibility in the heterogeneous network, however, that has adverse visibility consequences in homogeneous network. Our result reveals that players are more likely to cooperate voluntarily under homogeneous network structure.

Conducting multicenter research in healthcare simulation: Lessons learned from the INSPIRE network.

PubMed

Cheng, Adam; Kessler, David; Mackinnon, Ralph; Chang, Todd P; Nadkarni, Vinay M; Hunt, Elizabeth A; Duval-Arnould, Jordan; Lin, Yiqun; Pusic, Martin; Auerbach, Marc

2017-01-01

Simulation-based research has grown substantially over the past two decades; however, relatively few published simulation studies are multicenter in nature. Multicenter research confers many distinct advantages over single-center studies, including larger sample sizes for more generalizable findings, sharing resources amongst collaborative sites, and promoting networking. Well-executed multicenter studies are more likely to improve provider performance and/or have a positive impact on patient outcomes. In this manuscript, we offer a step-by-step guide to conducting multicenter, simulation-based research based upon our collective experience with the International Network for Simulation-based Pediatric Innovation, Research and Education (INSPIRE). Like multicenter clinical research, simulation-based multicenter research can be divided into four distinct phases. Each phase has specific differences when applied to simulation research: (1) Planning phase , to define the research question, systematically review the literature, identify outcome measures, and conduct pilot studies to ensure feasibility and estimate power; (2) Project Development phase , when the primary investigator identifies collaborators, develops the protocol and research operations manual, prepares grant applications, obtains ethical approval and executes subsite contracts, registers the study in a clinical trial registry, forms a manuscript oversight committee, and conducts feasibility testing and data validation at each site; (3) Study Execution phase , involving recruitment and enrollment of subjects, clear communication and decision-making, quality assurance measures and data abstraction, validation, and analysis; and (4) Dissemination phase , where the research team shares results via conference presentations, publications, traditional media, social media, and implements strategies for translating results to practice. With this manuscript, we provide a guide to conducting quantitative multicenter research with a focus on simulation-specific issues.

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

NASA Astrophysics Data System (ADS)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Neural-Network Simulator

NASA Technical Reports Server (NTRS)

Mitchell, Paul H.

1991-01-01

F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.

Spiking neural network simulation: memory-optimal synaptic event scheduling.

PubMed

Stewart, Robert D; Gurney, Kevin N

2011-06-01

Spiking neural network simulations incorporating variable transmission delays require synaptic events to be scheduled prior to delivery. Conventional methods have memory requirements that scale with the total number of synapses in a network. We introduce novel scheduling algorithms for both discrete and continuous event delivery, where the memory requirement scales instead with the number of neurons. Superior algorithmic performance is demonstrated using large-scale, benchmarking network simulations.

Physical-layer network coding for passive optical interconnect in datacenter networks.

PubMed

Lin, Rui; Cheng, Yuxin; Guan, Xun; Tang, Ming; Liu, Deming; Chan, Chun-Kit; Chen, Jiajia

2017-07-24

We introduce physical-layer network coding (PLNC) technique in a passive optical interconnect (POI) architecture for datacenter networks. The implementation of the PLNC in the POI at 2.5 Gb/s and 10Gb/s have been experimentally validated while the gains in terms of network layer performances have been investigated by simulation. The results reveal that in order to realize negligible packet drop, the wavelengths usage can be reduced by half while a significant improvement in packet delay especially under high traffic load can be achieved by employing PLNC over POI.

Electronic neural networks for global optimization

NASA Technical Reports Server (NTRS)

Thakoor, A. P.; Moopenn, A. W.; Eberhardt, S.

1990-01-01

An electronic neural network with feedback architecture, implemented in analog custom VLSI is described. Its application to problems of global optimization for dynamic assignment is discussed. The convergence properties of the neural network hardware are compared with computer simulation results. The neural network's ability to provide optimal or near optimal solutions within only a few neuron time constants, a speed enhancement of several orders of magnitude over conventional search methods, is demonstrated. The effect of noise on the circuit dynamics and the convergence behavior of the neural network hardware is also examined.

Evolving network with different edges

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

Sun Jie; Department of Mathematics and Computer Science, Clarkson University, Potsdam, New York 13699; Ge Yizhi

2007-10-15

We propose a scale-free network similar to Barabasi-Albert networks but with two different types of edges. This model is based on the idea that in many cases there are more than one kind of link in a network and when a new node enters the network both old nodes and different kinds of links compete to obtain it. The degree distribution of both the total degree and the degree of each type of edge is analyzed and found to be scale-free. Simulations are shown to confirm these results.

Epidemic spreading on interconnected networks.

PubMed

Saumell-Mendiola, Anna; Serrano, M Ángeles; Boguñá, Marián

2012-08-01

Many real networks are not isolated from each other but form networks of networks, often interrelated in nontrivial ways. Here, we analyze an epidemic spreading process taking place on top of two interconnected complex networks. We develop a heterogeneous mean-field approach that allows us to calculate the conditions for the emergence of an endemic state. Interestingly, a global endemic state may arise in the coupled system even though the epidemics is not able to propagate on each network separately and even when the number of coupling connections is small. Our analytic results are successfully confronted against large-scale numerical simulations.

Evolutionary Games in Multi-Agent Systems of Weighted Social Networks

NASA Astrophysics Data System (ADS)

Du, Wen-Bo; Cao, Xian-Bin; Zheng, Hao-Ran; Zhou, Hong; Hu, Mao-Bin

Much empirical evidence has shown realistic networks are weighted. Compared with those on unweighted networks, the dynamics on weighted network often exhibit distinctly different phenomena. In this paper, we investigate the evolutionary game dynamics (prisoner's dilemma game and snowdrift game) on a weighted social network consisted of rational agents and focus on the evolution of cooperation in the system. Simulation results show that the cooperation level is strongly affected by the weighted nature of the network. Moreover, the variation of time series has also been investigated. Our work may be helpful in understanding the cooperative behavior in the social systems.

Endogenous network of firms and systemic risk

NASA Astrophysics Data System (ADS)

Ma, Qianting; He, Jianmin; Li, Shouwei

2018-02-01

We construct an endogenous network characterized by commercial credit relationships connecting the upstream and downstream firms. Simulation results indicate that the endogenous network model displays a scale-free property which exists in real-world firm systems. In terms of the network structure, with the expansion of the scale of network nodes, the systemic risk increases significantly, while the heterogeneities of network nodes have no effect on systemic risk. As for firm micro-behaviors, including the selection range of trading partners, actual output, labor requirement, price of intermediate products and employee salaries, increase of all these parameters will lead to higher systemic risk.

Epidemic spreading on interconnected networks

NASA Astrophysics Data System (ADS)

Saumell-Mendiola, Anna; Serrano, M. Ángeles; Boguñá, Marián

2012-08-01

Many real networks are not isolated from each other but form networks of networks, often interrelated in nontrivial ways. Here, we analyze an epidemic spreading process taking place on top of two interconnected complex networks. We develop a heterogeneous mean-field approach that allows us to calculate the conditions for the emergence of an endemic state. Interestingly, a global endemic state may arise in the coupled system even though the epidemics is not able to propagate on each network separately and even when the number of coupling connections is small. Our analytic results are successfully confronted against large-scale numerical simulations.

Inferring Boolean network states from partial information

PubMed Central

2013-01-01

Networks of molecular interactions regulate key processes in living cells. Therefore, understanding their functionality is a high priority in advancing biological knowledge. Boolean networks are often used to describe cellular networks mathematically and are fitted to experimental datasets. The fitting often results in ambiguities since the interpretation of the measurements is not straightforward and since the data contain noise. In order to facilitate a more reliable mapping between datasets and Boolean networks, we develop an algorithm that infers network trajectories from a dataset distorted by noise. We analyze our algorithm theoretically and demonstrate its accuracy using simulation and microarray expression data. PMID:24006954

The risk of disease to great apes: simulating disease spread in orang-utan (Pongo pygmaeus wurmbii) and chimpanzee (Pan troglodytes schweinfurthii) association networks.

PubMed

Carne, Charlotte; Semple, Stuart; Morrogh-Bernard, Helen; Zuberbühler, Klaus; Lehmann, Julia

2014-01-01

All great ape species are endangered, and infectious diseases are thought to pose a particular threat to their survival. As great ape species vary substantially in social organisation and gregariousness, there are likely to be differences in susceptibility to disease types and spread. Understanding the relation between social variables and disease is therefore crucial for implementing effective conservation measures. Here, we simulate the transmission of a range of diseases in a population of orang-utans in Sabangau Forest (Central Kalimantan) and a community of chimpanzees in Budongo Forest (Uganda), by systematically varying transmission likelihood and probability of subsequent recovery. Both species have fission-fusion social systems, but differ considerably in their level of gregariousness. We used long-term behavioural data to create networks of association patterns on which the spread of different diseases was simulated. We found that chimpanzees were generally far more susceptible to the spread of diseases than orang-utans. When simulating different diseases that varied widely in their probability of transmission and recovery, it was found that the chimpanzee community was widely and strongly affected, while in orang-utans even highly infectious diseases had limited spread. Furthermore, when comparing the observed association network with a mean-field network (equal contact probability between group members), we found no major difference in simulated disease spread, suggesting that patterns of social bonding in orang-utans are not an important determinant of susceptibility to disease. In chimpanzees, the predicted size of the epidemic was smaller on the actual association network than on the mean-field network, indicating that patterns of social bonding have important effects on susceptibility to disease. We conclude that social networks are a potentially powerful tool to model the risk of disease transmission in great apes, and that chimpanzees are particularly threatened by infectious disease outbreaks as a result of their social structure.

The Risk of Disease to Great Apes: Simulating Disease Spread in Orang-Utan (Pongo pygmaeus wurmbii) and Chimpanzee (Pan troglodytes schweinfurthii) Association Networks

PubMed Central

Carne, Charlotte; Semple, Stuart; Morrogh-Bernard, Helen; Zuberbühler, Klaus; Lehmann, Julia

2014-01-01

All great ape species are endangered, and infectious diseases are thought to pose a particular threat to their survival. As great ape species vary substantially in social organisation and gregariousness, there are likely to be differences in susceptibility to disease types and spread. Understanding the relation between social variables and disease is therefore crucial for implementing effective conservation measures. Here, we simulate the transmission of a range of diseases in a population of orang-utans in Sabangau Forest (Central Kalimantan) and a community of chimpanzees in Budongo Forest (Uganda), by systematically varying transmission likelihood and probability of subsequent recovery. Both species have fission-fusion social systems, but differ considerably in their level of gregariousness. We used long-term behavioural data to create networks of association patterns on which the spread of different diseases was simulated. We found that chimpanzees were generally far more susceptible to the spread of diseases than orang-utans. When simulating different diseases that varied widely in their probability of transmission and recovery, it was found that the chimpanzee community was widely and strongly affected, while in orang-utans even highly infectious diseases had limited spread. Furthermore, when comparing the observed association network with a mean-field network (equal contact probability between group members), we found no major difference in simulated disease spread, suggesting that patterns of social bonding in orang-utans are not an important determinant of susceptibility to disease. In chimpanzees, the predicted size of the epidemic was smaller on the actual association network than on the mean-field network, indicating that patterns of social bonding have important effects on susceptibility to disease. We conclude that social networks are a potentially powerful tool to model the risk of disease transmission in great apes, and that chimpanzees are particularly threatened by infectious disease outbreaks as a result of their social structure. PMID:24740263

Simulating market dynamics: interactions between consumer psychology and social networks.

PubMed

Janssen, Marco A; Jager, Wander

2003-01-01

Markets can show different types of dynamics, from quiet markets dominated by one or a few products, to markets with continual penetration of new and reintroduced products. In a previous article we explored the dynamics of markets from a psychological perspective using a multi-agent simulation model. The main results indicated that the behavioral rules dominating the artificial consumer's decision making determine the resulting market dynamics, such as fashions, lock-in, and unstable renewal. Results also show the importance of psychological variables like social networks, preferences, and the need for identity to explain the dynamics of markets. In this article we extend this work in two directions. First, we will focus on a more systematic investigation of the effects of different network structures. The previous article was based on Watts and Strogatz's approach, which describes the small-world and clustering characteristics in networks. More recent research demonstrated that many large networks display a scale-free power-law distribution for node connectivity. In terms of market dynamics this may imply that a small proportion of consumers may have an exceptional influence on the consumptive behavior of others (hubs, or early adapters). We show that market dynamics is a self-organized property depending on the interaction between the agents' decision-making process (heuristics), the product characteristics (degree of satisfaction of unit of consumption, visibility), and the structure of interactions between agents (size of network and hubs in a social network).

NEVESIM: event-driven neural simulation framework with a Python interface.

PubMed

Pecevski, Dejan; Kappel, David; Jonke, Zeno

2014-01-01

NEVESIM is a software package for event-driven simulation of networks of spiking neurons with a fast simulation core in C++, and a scripting user interface in the Python programming language. It supports simulation of heterogeneous networks with different types of neurons and synapses, and can be easily extended by the user with new neuron and synapse types. To enable heterogeneous networks and extensibility, NEVESIM is designed to decouple the simulation logic of communicating events (spikes) between the neurons at a network level from the implementation of the internal dynamics of individual neurons. In this paper we will present the simulation framework of NEVESIM, its concepts and features, as well as some aspects of the object-oriented design approaches and simulation strategies that were utilized to efficiently implement the concepts and functionalities of the framework. We will also give an overview of the Python user interface, its basic commands and constructs, and also discuss the benefits of integrating NEVESIM with Python. One of the valuable capabilities of the simulator is to simulate exactly and efficiently networks of stochastic spiking neurons from the recently developed theoretical framework of neural sampling. This functionality was implemented as an extension on top of the basic NEVESIM framework. Altogether, the intended purpose of the NEVESIM framework is to provide a basis for further extensions that support simulation of various neural network models incorporating different neuron and synapse types that can potentially also use different simulation strategies.

NEVESIM: event-driven neural simulation framework with a Python interface

PubMed Central

Pecevski, Dejan; Kappel, David; Jonke, Zeno

2014-01-01

NEVESIM is a software package for event-driven simulation of networks of spiking neurons with a fast simulation core in C++, and a scripting user interface in the Python programming language. It supports simulation of heterogeneous networks with different types of neurons and synapses, and can be easily extended by the user with new neuron and synapse types. To enable heterogeneous networks and extensibility, NEVESIM is designed to decouple the simulation logic of communicating events (spikes) between the neurons at a network level from the implementation of the internal dynamics of individual neurons. In this paper we will present the simulation framework of NEVESIM, its concepts and features, as well as some aspects of the object-oriented design approaches and simulation strategies that were utilized to efficiently implement the concepts and functionalities of the framework. We will also give an overview of the Python user interface, its basic commands and constructs, and also discuss the benefits of integrating NEVESIM with Python. One of the valuable capabilities of the simulator is to simulate exactly and efficiently networks of stochastic spiking neurons from the recently developed theoretical framework of neural sampling. This functionality was implemented as an extension on top of the basic NEVESIM framework. Altogether, the intended purpose of the NEVESIM framework is to provide a basis for further extensions that support simulation of various neural network models incorporating different neuron and synapse types that can potentially also use different simulation strategies. PMID:25177291

Simulating economic effects of disruptions in the telecommunications infrastructure.

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

Cox, Roger Gary; Barton, Dianne Catherine; Reinert, Rhonda K.

2004-01-01

CommAspen is a new agent-based model for simulating the interdependent effects of market decisions and disruptions in the telecommunications infrastructure on other critical infrastructures in the U.S. economy such as banking and finance, and electric power. CommAspen extends and modifies the capabilities of Aspen-EE, an agent-based model previously developed by Sandia National Laboratories to analyze the interdependencies between the electric power system and other critical infrastructures. CommAspen has been tested on a series of scenarios in which the communications network has been disrupted, due to congestion and outages. Analysis of the scenario results indicates that communications networks simulated by themore » model behave as their counterparts do in the real world. Results also show that the model could be used to analyze the economic impact of communications congestion and outages.« less

Evaluation and development the routing protocol of a fully functional simulation environment for VANETs

NASA Astrophysics Data System (ADS)

Ali, Azhar Tareq; Warip, Mohd Nazri Mohd; Yaakob, Naimah; Abduljabbar, Waleed Khalid; Atta, Abdu Mohammed Ali

2017-11-01

Vehicular Ad-hoc Networks (VANETs) is an area of wireless technologies that is attracting a great deal of interest. There are still several areas of VANETS, such as security and routing protocols, medium access control, that lack large amounts of research. There is also a lack of freely available simulators that can quickly and accurately simulate VANETs. The main goal of this paper is to develop a freely available VANETS simulator and to evaluate popular mobile ad-hoc network routing protocols in several VANETS scenarios. The VANETS simulator consisted of a network simulator, traffic (mobility simulator) and used a client-server application to keep the two simulators in sync. The VANETS simulator also models buildings to create a more realistic wireless network environment. Ad-Hoc Distance Vector routing (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) were initially simulated in a city, country, and highway environment to provide an overall evaluation.

Fine-granularity inference and estimations to network traffic for SDN.

PubMed

Jiang, Dingde; Huo, Liuwei; Li, Ya

2018-01-01

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective.

Fine-granularity inference and estimations to network traffic for SDN

PubMed Central

Huo, Liuwei; Li, Ya

2018-01-01

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective. PMID:29718913

Gamma oscillations in a nonlinear regime: a minimal model approach using heterogeneous integrate-and-fire networks.

PubMed

Bathellier, Brice; Carleton, Alan; Gerstner, Wulfram

2008-12-01

Fast oscillations and in particular gamma-band oscillation (20-80 Hz) are commonly observed during brain function and are at the center of several neural processing theories. In many cases, mathematical analysis of fast oscillations in neural networks has been focused on the transition between irregular and oscillatory firing viewed as an instability of the asynchronous activity. But in fact, brain slice experiments as well as detailed simulations of biological neural networks have produced a large corpus of results concerning the properties of fully developed oscillations that are far from this transition point. We propose here a mathematical approach to deal with nonlinear oscillations in a network of heterogeneous or noisy integrate-and-fire neurons connected by strong inhibition. This approach involves limited mathematical complexity and gives a good sense of the oscillation mechanism, making it an interesting tool to understand fast rhythmic activity in simulated or biological neural networks. A surprising result of our approach is that under some conditions, a change of the strength of inhibition only weakly influences the period of the oscillation. This is in contrast to standard theoretical and experimental models of interneuron network gamma oscillations (ING), where frequency tightly depends on inhibition strength, but it is similar to observations made in some in vitro preparations in the hippocampus and the olfactory bulb and in some detailed network models. This result is explained by the phenomenon of suppression that is known to occur in strongly coupled oscillating inhibitory networks but had not yet been related to the behavior of oscillation frequency.

A Simple and Accurate Network for Hydrogen and Carbon Chemistry in the Interstellar Medium

NASA Astrophysics Data System (ADS)

Gong, Munan; Ostriker, Eve C.; Wolfire, Mark G.

2017-07-01

Chemistry plays an important role in the interstellar medium (ISM), regulating the heating and cooling of the gas and determining abundances of molecular species that trace gas properties in observations. Although solving the time-dependent equations is necessary for accurate abundances and temperature in the dynamic ISM, a full chemical network is too computationally expensive to incorporate into numerical simulations. In this paper, we propose a new simplified chemical network for hydrogen and carbon chemistry in the atomic and molecular ISM. We compare results from our chemical network in detail with results from a full photodissociation region (PDR) code, and also with the Nelson & Langer (NL99) network previously adopted in the simulation literature. We show that our chemical network gives similar results to the PDR code in the equilibrium abundances of all species over a wide range of densities, temperature, and metallicities, whereas the NL99 network shows significant disagreement. Applying our network to 1D models, we find that the CO-dominated regime delimits the coldest gas and that the corresponding temperature tracks the cosmic-ray ionization rate in molecular clouds. We provide a simple fit for the locus of CO-dominated regions as a function of gas density and column. We also compare with observations of diffuse and translucent clouds. We find that the CO, {{CH}}x, and {{OH}}x abundances are consistent with equilibrium predictions for densities n=100{--}1000 {{cm}}-3, but the predicted equilibrium C abundance is higher than that seen in observations, signaling the potential importance of non-equilibrium/dynamical effects.

NetMOD version 1.0 user's manual

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

Merchant, Bion John

2014-01-01

NetMOD (Network Monitoring for Optimal Detection) is a Java-based software package for conducting simulation of seismic networks. Specifically, NetMOD simulates the detection capabilities of seismic monitoring networks. Network simulations have long been used to study network resilience to station outages and to determine where additional stations are needed to reduce monitoring thresholds. NetMOD makes use of geophysical models to determine the source characteristics, signal attenuation along the path between the source and station, and the performance and noise properties of the station. These geophysical models are combined to simulate the relative amplitudes of signal and noise that are observed atmore » each of the stations. From these signal-to-noise ratios (SNR), the probability of detection can be computed given a detection threshold. This manual describes how to configure and operate NetMOD to perform seismic detection simulations. In addition, NetMOD is distributed with a simulation dataset for the Comprehensive Nuclear-Test-Ban Treaty Organization (CTBTO) International Monitoring System (IMS) seismic network for the purpose of demonstrating NetMOD's capabilities and providing user training. The tutorial sections of this manual use this dataset when describing how to perform the steps involved when running a simulation.« less

Mapping Creativity: Creativity Measurements Network Analysis

ERIC Educational Resources Information Center

Pinheiro, Igor Reszka; Cruz, Roberto Moraes

2014-01-01

This article borrowed network analysis tools to discover how the construct formed by the set of all measures of creativity configures itself. To this end, using a variant of the meta-analytical method, a database was compiled simulating 42,381 responses to 974 variables centered on 64 creativity measures. Results, although preliminary, indicate…

Progression of Diabetic Capillary Occlusion: A Model

PubMed Central

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

2016-01-01

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

Neural network submodel as an abstraction tool: relating network performance to combat outcome

NASA Astrophysics Data System (ADS)

Jablunovsky, Greg; Dorman, Clark; Yaworsky, Paul S.

2000-06-01

Simulation of Command and Control (C2) networks has historically emphasized individual system performance with little architectural context or credible linkage to `bottom- line' measures of combat outcomes. Renewed interest in modeling C2 effects and relationships stems from emerging network intensive operational concepts. This demands improved methods to span the analytical hierarchy between C2 system performance models and theater-level models. Neural network technology offers a modeling approach that can abstract the essential behavior of higher resolution C2 models within a campaign simulation. The proposed methodology uses off-line learning of the relationships between network state and campaign-impacting performance of a complex C2 architecture and then approximation of that performance as a time-varying parameter in an aggregated simulation. Ultimately, this abstraction tool offers an increased fidelity of C2 system simulation that captures dynamic network dependencies within a campaign context.

Accurate lithography simulation model based on convolutional neural networks

NASA Astrophysics Data System (ADS)

Watanabe, Yuki; Kimura, Taiki; Matsunawa, Tetsuaki; Nojima, Shigeki

2017-07-01

Lithography simulation is an essential technique for today's semiconductor manufacturing process. In order to calculate an entire chip in realistic time, compact resist model is commonly used. The model is established for faster calculation. To have accurate compact resist model, it is necessary to fix a complicated non-linear model function. However, it is difficult to decide an appropriate function manually because there are many options. This paper proposes a new compact resist model using CNN (Convolutional Neural Networks) which is one of deep learning techniques. CNN model makes it possible to determine an appropriate model function and achieve accurate simulation. Experimental results show CNN model can reduce CD prediction errors by 70% compared with the conventional model.

Numerical aerodynamic simulation program long haul communications prototype

NASA Technical Reports Server (NTRS)

Cmaylo, Bohden K.; Foo, Lee

1987-01-01

This document is a report of the Numerical Aerodynamic Simulation (NAS) Long Haul Communications Prototype (LHCP). It describes the accomplishments of the LHCP group, presents the results from all LHCP experiments and testing activities, makes recommendations for present and future LHCP activities, and evaluates the remote workstation accesses from Langley Research Center, Lewis Research Center, and Colorado State University to Ames Research Center. The report is the final effort of the Long Haul (Wideband) Communications Prototype Plan (PT-1133-02-N00), 3 October 1985, which defined the requirements for the development, test, and operation of the LHCP network and was the plan used to evaluate the remote user bandwidth requirements for the Numerical Aerodynamic Simulation Processing System Network.

FPGA Based Reconfigurable ATM Switch Test Bed

NASA Technical Reports Server (NTRS)

Chu, Pong P.; Jones, Robert E.

1998-01-01

Various issues associated with "FPGA Based Reconfigurable ATM Switch Test Bed" are presented in viewgraph form. Specific topics include: 1) Network performance evaluation; 2) traditional approaches; 3) software simulation; 4) hardware emulation; 5) test bed highlights; 6) design environment; 7) test bed architecture; 8) abstract sheared-memory switch; 9) detailed switch diagram; 10) traffic generator; 11) data collection circuit and user interface; 12) initial results; and 13) the following conclusions: Advances in FPGA make hardware emulation feasible for performance evaluation, hardware emulation can provide several orders of magnitude speed-up over software simulation; due to the complexity of hardware synthesis process, development in emulation is much more difficult than simulation and requires knowledge in both networks and digital design.

Quantitative evaluation of simulated functional brain networks in graph theoretical analysis.

PubMed

Lee, Won Hee; Bullmore, Ed; Frangou, Sophia

2017-02-01

There is increasing interest in the potential of whole-brain computational models to provide mechanistic insights into resting-state brain networks. It is therefore important to determine the degree to which computational models reproduce the topological features of empirical functional brain networks. We used empirical connectivity data derived from diffusion spectrum and resting-state functional magnetic resonance imaging data from healthy individuals. Empirical and simulated functional networks, constrained by structural connectivity, were defined based on 66 brain anatomical regions (nodes). Simulated functional data were generated using the Kuramoto model in which each anatomical region acts as a phase oscillator. Network topology was studied using graph theory in the empirical and simulated data. The difference (relative error) between graph theory measures derived from empirical and simulated data was then estimated. We found that simulated data can be used with confidence to model graph measures of global network organization at different dynamic states and highlight the sensitive dependence of the solutions obtained in simulated data on the specified connection densities. This study provides a method for the quantitative evaluation and external validation of graph theory metrics derived from simulated data that can be used to inform future study designs. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

Fault Analysis of Space Station DC Power Systems-Using Neural Network Adaptive Wavelets to Detect Faults

NASA Technical Reports Server (NTRS)

Momoh, James A.; Wang, Yanchun; Dolce, James L.

1997-01-01

This paper describes the application of neural network adaptive wavelets for fault diagnosis of space station power system. The method combines wavelet transform with neural network by incorporating daughter wavelets into weights. Therefore, the wavelet transform and neural network training procedure become one stage, which avoids the complex computation of wavelet parameters and makes the procedure more straightforward. The simulation results show that the proposed method is very efficient for the identification of fault locations.

Properties of a memory network in psychology

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

Wedemann, Roseli S.; Donangelo, Raul; Carvalho, Luis A. V. de

We have previously described neurotic psychopathology and psychoanalytic working-through by an associative memory mechanism, based on a neural network model, where memory was modelled by a Boltzmann machine (BM). Since brain neural topology is selectively structured, we simulated known microscopic mechanisms that control synaptic properties, showing that the network self-organizes to a hierarchical, clustered structure. Here, we show some statistical mechanical properties of the complex networks which result from this self-organization. They indicate that a generalization of the BM may be necessary to model memory.

Cluster-modified function projective synchronisation of complex networks with asymmetric coupling

NASA Astrophysics Data System (ADS)

Wang, Shuguo

2018-02-01

This paper investigates the cluster-modified function projective synchronisation (CMFPS) of a generalised linearly coupled network with asymmetric coupling and nonidentical dynamical nodes. A novel synchronisation scheme is proposed to achieve CMFPS in community networks. We use adaptive control method to derive CMFPS criteria based on Lyapunov stability theory. Each cluster of networks is synchronised with target system by state transformation with scaling function matrix. Numerical simulation results are presented finally to illustrate the effectiveness of this method.

Axelrod's Metanorm Games on Networks

PubMed Central

Galán, José M.; Łatek, Maciej M.; Rizi, Seyed M. Mussavi

2011-01-01

Metanorms is a mechanism proposed to promote cooperation in social dilemmas. Recent experimental results show that network structures that underlie social interactions influence the emergence of norms that promote cooperation. We generalize Axelrod's analysis of metanorms dynamics to interactions unfolding on networks through simulation and mathematical modeling. Network topology strongly influences the effectiveness of the metanorms mechanism in establishing cooperation. In particular, we find that average degree, clustering coefficient and the average number of triplets per node play key roles in sustaining or collapsing cooperation. PMID:21655211

Properties of a memory network in psychology

NASA Astrophysics Data System (ADS)

Wedemann, Roseli S.; Donangelo, Raul; de Carvalho, Luís A. V.

2007-12-01

We have previously described neurotic psychopathology and psychoanalytic working-through by an associative memory mechanism, based on a neural network model, where memory was modelled by a Boltzmann machine (BM). Since brain neural topology is selectively structured, we simulated known microscopic mechanisms that control synaptic properties, showing that the network self-organizes to a hierarchical, clustered structure. Here, we show some statistical mechanical properties of the complex networks which result from this self-organization. They indicate that a generalization of the BM may be necessary to model memory.

On the robustness of complex heterogeneous gene expression networks.

PubMed

Gómez-Gardeñes, Jesús; Moreno, Yamir; Floría, Luis M

2005-04-01

We analyze a continuous gene expression model on the underlying topology of a complex heterogeneous network. Numerical simulations aimed at studying the chaotic and periodic dynamics of the model are performed. The results clearly indicate that there is a region in which the dynamical and structural complexity of the system avoid chaotic attractors. However, contrary to what has been reported for Random Boolean Networks, the chaotic phase cannot be completely suppressed, which has important bearings on network robustness and gene expression modeling.

Modelling Pollutant Dispersion in a Street Network

NASA Astrophysics Data System (ADS)

Salem, N. Ben; Garbero, V.; Salizzoni, P.; Lamaison, G.; Soulhac, L.

2015-04-01

This study constitutes a further step in the analysis of the performances of a street network model to simulate atmospheric pollutant dispersion in urban areas. The model, named SIRANE, is based on the decomposition of the urban atmosphere into two sub-domains: the urban boundary layer, whose dynamics is assumed to be well established, and the urban canopy, represented as a series of interconnected boxes. Parametric laws govern the mass exchanges between the boxes under the assumption that the pollutant dispersion within the canopy can be fully simulated by modelling three main bulk transfer phenomena: channelling along street axes, transfers at street intersections, and vertical exchange between street canyons and the overlying atmosphere. Here, we aim to evaluate the reliability of the parametrizations adopted to simulate these phenomena, by focusing on their possible dependence on the external wind direction. To this end, we test the model against concentration measurements within an idealized urban district whose geometrical layout closely matches the street network represented in SIRANE. The analysis is performed for an urban array with a fixed geometry and a varying wind incidence angle. The results show that the model provides generally good results with the reference parametrizations adopted in SIRANE and that its performances are quite robust for a wide range of the model parameters. This proves the reliability of the street network approach in simulating pollutant dispersion in densely built city districts. The results also show that the model performances may be improved by considering a dependence of the wind fluctuations at street intersections and of the vertical exchange velocity on the direction of the incident wind. This opens the way for further investigations to clarify the dependence of these parameters on wind direction and street aspect ratios.

Direct Numerical Simulation of Cellular-Scale Blood Flow in 3D Microvascular Networks.

PubMed

Balogh, Peter; Bagchi, Prosenjit

2017-12-19

We present, to our knowledge, the first direct numerical simulation of 3D cellular-scale blood flow in physiologically realistic microvascular networks. The vascular networks are designed following in vivo images and data, and are comprised of bifurcating, merging, and winding vessels. Our model resolves the large deformation and dynamics of each individual red blood cell flowing through the networks with high fidelity, while simultaneously retaining the highly complex geometric details of the vascular architecture. To our knowledge, our simulations predict several novel and unexpected phenomena. We show that heterogeneity in hemodynamic quantities, which is a hallmark of microvascular blood flow, appears both in space and time, and that the temporal heterogeneity is more severe than its spatial counterpart. The cells are observed to frequently jam at vascular bifurcations resulting in reductions in hematocrit and flow rate in the daughter and mother vessels. We find that red blood cell jamming at vascular bifurcations results in several orders-of-magnitude increase in hemodynamic resistance, and thus provides an additional mechanism of increased in vivo blood viscosity as compared to that determined in vitro. A striking result from our simulations is negative pressure-flow correlations observed in several vessels, implying a significant deviation from Poiseuille's law. Furthermore, negative correlations between vascular resistance and hematocrit are observed in various vessels, also defying a major principle of particulate suspension flow. To our knowledge, these novel findings are absent in blood flow in straight tubes, and they underscore the importance of considering realistic physiological geometry and resolved cellular interactions in modeling microvascular hemodynamics. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Promotion of cooperation induced by appropriate payoff aspirations in a small-world networked game

NASA Astrophysics Data System (ADS)

Chen, Xiaojie; Wang, Long

2008-01-01

Based on learning theory, we adopt a stochastic learning updating rule to investigate the evolution of cooperation in the Prisoner’s Dilemma game on Newman-Watts small-world networks with different payoff aspiration levels. Interestingly, simulation results show that the mechanism of intermediate aspiration promoting cooperation resembles a resonancelike behavior, and there exists a ping-pong vibration of cooperation for large payoff aspiration. To explain the nontrivial dependence of the cooperation level on the aspiration level, we investigate the fractions of links, provide analytical results of the cooperation level, and find that the simulation results are in close agreement with analytical ones. Our work may be helpful in understanding the cooperative behavior induced by the aspiration level in society.

PetriScape - A plugin for discrete Petri net simulations in Cytoscape.

PubMed

Almeida, Diogo; Azevedo, Vasco; Silva, Artur; Baumbach, Jan

2016-06-04

Systems biology plays a central role for biological network analysis in the post-genomic era. Cytoscape is the standard bioinformatics tool offering the community an extensible platform for computational analysis of the emerging cellular network together with experimental omics data sets. However, only few apps/plugins/tools are available for simulating network dynamics in Cytoscape 3. Many approaches of varying complexity exist but none of them have been integrated into Cytoscape as app/plugin yet. Here, we introduce PetriScape, the first Petri net simulator for Cytoscape. Although discrete Petri nets are quite simplistic models, they are capable of modeling global network properties and simulating their behaviour. In addition, they are easily understood and well visualizable. PetriScape comes with the following main functionalities: (1) import of biological networks in SBML format, (2) conversion into a Petri net, (3) visualization as Petri net, and (4) simulation and visualization of the token flow in Cytoscape. PetriScape is the first Cytoscape plugin for Petri nets. It allows a straightforward Petri net model creation, simulation and visualization with Cytoscape, providing clues about the activity of key components in biological networks.

PetriScape - A plugin for discrete Petri net simulations in Cytoscape.

PubMed

Almeida, Diogo; Azevedo, Vasco; Silva, Artur; Baumbach, Jan

2016-03-01

Systems biology plays a central role for biological network analysis in the post-genomic era. Cytoscape is the standard bioinformatics tool offering the community an extensible platform for computational analysis of the emerging cellular network together with experimental omics data sets. However, only few apps/plugins/tools are available for simulating network dynamics in Cytoscape 3. Many approaches of varying complexity exist but none of them have been integrated into Cytoscape as app/plugin yet. Here, we introduce PetriScape, the first Petri net simulator for Cytoscape. Although discrete Petri nets are quite simplistic models, they are capable of modeling global network properties and simulating their behaviour. In addition, they are easily understood and well visualizable. PetriScape comes with the following main functionalities: (1) import of biological networks in SBML format, (2) conversion into a Petri net, (3) visualization as Petri net, and (4) simulation and visualization of the token flow in Cytoscape. PetriScape is the first Cytoscape plugin for Petri nets. It allows a straightforward Petri net model creation, simulation and visualization with Cytoscape, providing clues about the activity of key components in biological networks.

Sampling from complex networks using distributed learning automata

NASA Astrophysics Data System (ADS)

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

2014-02-01

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

A Viscoelastic earthquake simulator with application to the San Francisco Bay region

USGS Publications Warehouse

Pollitz, Fred F.

2009-01-01

Earthquake simulation on synthetic fault networks carries great potential for characterizing the statistical patterns of earthquake occurrence. I present an earthquake simulator based on elastic dislocation theory. It accounts for the effects of interseismic tectonic loading, static stress steps at the time of earthquakes, and postearthquake stress readjustment through viscoelastic relaxation of the lower crust and mantle. Earthquake rupture initiation and termination are determined with a Coulomb failure stress criterion and the static cascade model. The simulator is applied to interacting multifault systems: one, a synthetic two-fault network, and the other, a fault network representative of the San Francisco Bay region. The faults are discretized both along strike and along dip and can accommodate both strike slip and dip slip. Stress and seismicity functions are evaluated over 30,000 yr trial time periods, resulting in a detailed statistical characterization of the fault systems. Seismicity functions such as the coefficient of variation and a- and b-values exhibit systematic patterns with respect to simple model parameters. This suggests that reliable estimation of the controlling parameters of an earthquake simulator is a prerequisite to the interpretation of its output in terms of seismic hazard.

Simulation on the Performance of a Driven Fan Made by Polyester/Epoxy interpenetrate polymer network (IPN)

NASA Astrophysics Data System (ADS)

Fahrul Hassan, Mohd; Jamri, Azmil; Nawawi, Azli; Zaini Yunos, Muhamad; Fauzi Ahmad, Md; Adzila, Sharifah; Nasrull Abdol Rahman, Mohd

2017-08-01

The main purpose of this study is to investigate the performance of a driven fan design made by Polyester/Epoxy interpenetrate polymer network (IPN) material that specifically used for turbocharger compressor. Polyester/Epoxy IPN is polymer plastics that was used as replacements for traditional polymers and has been widely used in a variety of applications because of their limitless conformations. Simulation based on several parameters which are air pressure, air velocity and air temperature have been carried out for a driven fan design performance of two different materials, aluminum alloy (existing driven fan design) and Polyester/Epoxy IPN using SolidWorks Flow Simulation software. Results from both simulations were analyzed and compared where both materials show similar performance in terms of air pressure and air velocity due to similar geometric and dimension, but Polyester/Epoxy IPN produces lower air temperature than aluminum alloy. This study shows a preliminary result of the potential Polyester/Epoxy IPN to be used as a driven fan design material. In the future, further studies will be conducted on detail simulation and experimental analysis.

A Compact Synchronous Cellular Model of Nonlinear Calcium Dynamics: Simulation and FPGA Synthesis Results.

PubMed

Soleimani, Hamid; Drakakis, Emmanuel M

2017-06-01

Recent studies have demonstrated that calcium is a widespread intracellular ion that controls a wide range of temporal dynamics in the mammalian body. The simulation and validation of such studies using experimental data would benefit from a fast large scale simulation and modelling tool. This paper presents a compact and fully reconfigurable cellular calcium model capable of mimicking Hopf bifurcation phenomenon and various nonlinear responses of the biological calcium dynamics. The proposed cellular model is synthesized on a digital platform for a single unit and a network model. Hardware synthesis, physical implementation on FPGA, and theoretical analysis confirm that the proposed cellular model can mimic the biological calcium behaviors with considerably low hardware overhead. The approach has the potential to speed up large-scale simulations of slow intracellular dynamics by sharing more cellular units in real-time. To this end, various networks constructed by pipelining 10 k to 40 k cellular calcium units are compared with an equivalent simulation run on a standard PC workstation. Results show that the cellular hardware model is, on average, 83 times faster than the CPU version.

Structure Analysis of Jungle-Gym-Type Gels by Brownian Dynamics Simulation

NASA Astrophysics Data System (ADS)

Ohta, Noriyoshi; Ono, Kohki; Takasu, Masako; Furukawa, Hidemitsu

2008-02-01

We investigated the structure and the formation process of two kinds of gels by Brownian dynamics simulation. The effect of flexibility of main chain oligomer was studied. From our results, hard gel with rigid main chain forms more homogeneous network structure than soft gel with flexible main chain. In soft gel, many small loops are formed, and clusters tend to shrink. This heterogeneous network structure may be caused by microgels. In the low density case, soft gel shows more heterogeneity than the high density case.

U.S. Tank Platoon Training for the 1987 Canadian Army Trophy (CAT) competition Using a Simulation Networking (SIMNET) System

DTIC Science & Technology

1987-10-01

will be addressed as the Testbed is constructed: 0. (1) How can a large cluster of simulators be networked at a singie " site ? [For example, a battalion... network and its subject LAN sites networked with Lt-N technology. *-" m-artter were based umDn technical and military There will be 324 simulators in all...If all sites "Cori consicerations. were active at one time, 1,400 troops would be involved- The technical assessment was that a local area network

Determination of blood oxygenation in the brain by time-resolved reflectance spectroscopy: influence of the skin, skull, and meninges

NASA Astrophysics Data System (ADS)

Hielscher, Andreas H.; Liu, Hanli; Wang, Lihong V.; Tittel, Frank K.; Chance, Britton; Jacques, Steven L.

1994-07-01

Near infrared light has been used for the determination of blood oxygenation in the brain but little attention has been paid to the fact that the states of blood oxygenation in arteries, veins, and capillaries differ substantially. In this study, Monte Carlo simulations for a heterogeneous system were conducted, and near infrared time-resolved reflectance measurements were performed on a heterogeneous tissue phantom model. The model was made of a solid polyester resin, which simulates the tissue background. A network of tubes was distributed uniformly through the resin to simulate the blood vessels. The time-resolved reflectance spectra were taken with different absorbing solutions filled in the network. Based on the simulation and experimental results, we investigated the dependence of the absorption coefficient obtained from the heterogeneous system on the absorption of the actual absorbing solution filled in the tubes. We show that light absorption by the brain should result from the combination of blood and blood-free tissue background.