Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network simulation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A PEPS Plugin for TNQVM

This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.

Chundury, Srikar↗
DOE OSTI2021

Power System Network Reduction for Power Hardware-in-the-Loop Simulation: Preprint

This paper proposes a single-port equivalent and a two-port equivalent to respectively reduce single-port and two-port areas in a large power network. Parameters of the reduced systems are rigorously derived, which guarantees that the electrical quantities at the port remain unchanged over the reduction, including voltage magnitude and phase, active and reactive power injections into the area to be reduced. The proposed techniques are applied to reduce a practical Maui grid, where the total numbers of buses, lines and transformers are respectively reduced from 212, 106 and 108 to 45, 30 and 13. Dynamic behaviors between the full model and the reduced model are compared in detail to illustrate the efficacy and accuracy of the proposed network reduction.

41 EE - Solar Energy Technologies Office (EE-4S)↗
DOE OSTI2019

Finding high-redshift strong lenses in DES using convolutional neural networks

We search Dark Energy Survey (DES) Year 3 imaging data for galaxy-galaxy strong gravitational lenses using convolutional neural networks. We generate 250 000 simulated lenses at redshifts > 0.8 from which we create a data set for training the neural networks with realistic seeing, sky and shot noise. Using the simulations as a guide, we build a catalogue of 1.1 million DES sources with 1.8 < g - i < 5, 0.6 < g - r < 3, r_mag > 19, g_mag > 20, and i_mag > 18.2. We train two ensembles of neural networks on training sets consisting of simulated lenses, simulated non-lenses, and real sources. We use the neural networks to score images of each of the sources in our catalogue with a value from 0 to 1, and select those with scores greater than a chosen threshold for visual inspection, resulting in a candidate set of 7301 galaxies. During visual inspection, we rate 84 as 'probably' or 'definitely' lenses. Four of these are previously known lenses or lens candidates. We inspect a further 9428 candidates with a different score threshold, and identify four new candidates. We present 84 new strong lens candidates, selected after a few hours of visual inspection by astronomers. This catalogue contains a comparable number of high-redshift lenses to that predicted by simulations. Based on simulations, we estimate our sample to contain most discoverable lenses in this imaging and at this redshift range.

Jacobs, C.↗
NASA NTRS2002

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

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.

Rajkumar, T.↗
DOE OSTI2017

Software-defined Quantum Networking Ecosystem

The software enables a user to perform modeling and simulation of software-defined quantum networks. The software addresses the problem of how to synchronize transmission of quantum and classical signals through multi-node networks and to demonstrate quantum information protocols such as quantum teleportation. The software approaches this problem by generating a graphical model of the underlying network and attributing properties to each node and link in the graph. The graphical model is then simulated using a combination of discrete-event simulators to calculate the expected state of each node and link in the graph at a future time. A user interacts with the software by providing an initial network model and instantiating methods for the nodes to transmit information with each other. This includes writing application scripts in python that make use of the software library interfaces. A user then initiates the application scripts, which invokes the software simulation. The user then uses the built-in diagnostic tools to query the state of the simulation and to collect statistics on synchronization.

Humble, Travis S.↗
DOE OSTI2026

Nonlocal Effect of Percolated Particle Networks on Viscoelasticity of Polymer–Filler Nanocomposites: A Mesoscale Simulation Study

With nanoparticles (NPs) as fillers, polymer nanocomposites (PNCs) usually exhibit enhanced mechanical properties. However, a direct connection between the microscopic structural relaxation and macroscopic mechanical properties of PNCs remains to be established. To investigate the micro-to-macro connection, we develop a mesoscale model, in which the NPbridging polymer chains are represented by a dynamic bonded interaction between NPs, and the bulk polymer matrix is implicitly modeled by overdamped Langevin dynamics. Extensive equilibrium simulations are performed to quantify the microscopic dynamics of model PNCs. Systematic analyses of modified Rouse dynamics, dynamic structure factor, and relaxation modulus uncover that the microscopic relaxation dynamics of PNCs are significantly decelerated across different length scales because of nonlocal effects of percolated particle networks a phenomenon that has not been adequately captured in prior simulation studies. We find that NPvolume- fraction and NP-bonding-energy barrier are the two critical variables that affect bulk viscoelasticity the most. The proposed mesoscale model is versatile and provides a powerful framework for studying structure−property relations of different PNCs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Identification of NPP transients using artificial intelligence - 335

If the accidents happen in nuclear power plants (NPPs), the NPP operators identify the transients through observing the behaviors of the major parameters. However, the integrity of the instrumentation signals is not ensured under the accident circumstances and the major parameters essential in identifying the transients can rapidly change although the instruments generate accurate signals. Thus, to successfully control the accidents by taking necessary measures relatively faster, it is very important to provide the operators with the information that can identify the transients and accidents accurately. In this study, the transients of severe accidents in NPPs are identified and classified using artificial intelligence methodologies. Several transients are identified using support vector classification (SVC) and probabilistic neural network (PNN) as artificial intelligence methodologies. The used data for the transients are the simulation data using the modular accident analysis program (MAAP) code for the optimized power reactors (OPR1000s). The time-integrated values of chosen simulated sensor signals are used as the input variables for identifying the transients. As a result of this study, the proposed models identified the transients quite precisely. Therefore, the quite accurate identification of the transients indicates the excellence of these artificial intelligence methods and they will produce useful supporting information for the operators even under extreme transient circumstances in NPPs. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2014

Solar photospheric network properties and their cycle variation

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, 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.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Benchmarking a Tunable Quantum Neural Network on Trapped-Ion and Superconducting Hardware

We implement a quantum generalization of a neural network on trapped-ion and IBM superconducting quantum computers to classify MNIST images, a common benchmark in computer vision. The network feedforward involves qubit rotations whose angles depend on the results of measurements in the previous layer. The network is trained via simulation, but inference is performed experimentally on quantum hardware. The classical-to-quantum correspondence is controlled by an interpolation parameter, $a$, which is zero in the classical limit. Increasing $a$ introduces quantum uncertainty into the measurements, which is shown to improve network performance at moderate values of the interpolation parameter. We then focus on particular images that fail to be classified by a classical neural network but are detected correctly in the quantum network. For such borderline cases, we observe strong deviations from the simulated behavior. We attribute this to physical noise, which causes the output to fluctuate between nearby minima of the classification energy landscape. Such strong sensitivity to physical noise is absent for clear images. We further benchmark physical noise by inserting additional single-qubit and two-qubit gate pairs into the neural network circuits. Our work provides a springboard toward more complex quantum neural networks on current devices: while the approach is rooted in standard classical machine learning, scaling up such networks may prove classically non-simulable and could offer a route to near-term quantum advantage.

FOS: Physical sciences↗
DOE OSTI2023

Enhanced Large-Signal Stability Method for Grid-Forming Inverters During Current Limiting: Preprint

Grid-forming (GFM) inverters are a promising technology for the widespread integration of renewable energy sources in future power systems. As a key element of GFM inverter control, the primary controller governs the internal reference voltage and angle. During contingencies in the grid---such as faults, voltage drops, or frequency and phase jumps---an inverter can be forced into a current-limiting mode of operation modulating inverter dynamics, and, as a result, it is prone to losing synchronism with the grid. In this paper, we propose a novel GFM primary control method with an additional synchronization term that naturally activates during contingencies to improve the dynamic response. The method allows the inverter to remain synchronized with the grid, which improves the inverter's dynamic behavior both during and after current-limiting grid conditions and enhances grid support, including voltage support using full current capacity. The method is demonstrated for voltage, frequency, and phase jumps both in a single-machine-to-infinite-bus and a network-wide electromagnetic transient simulation of the IEEE 14-bus system with 5 GFM inverters. The simulations provide insights into the proposed synchronization method and confirm the high potential of the method, which robustly secures synchronism under severe contingencies.

current limiting↗
NASA NTRS2000

Efficient Simulation of Wing Modal Response: Application of 2nd Order Shape Sensitivities and Neural Networks

At the preliminary design stage of a wing structure, an efficient simulation, one needing little computation but yielding adequately accurate results for various response quantities, is essential in the search of optimal design in a vast design space. In the present paper, methods of using sensitivities up to 2nd order, and direct application of neural networks are explored. The example problem is how to decide the natural frequencies of a wing given the shape variables of the structure. It is shown that when sensitivities cannot be obtained analytically, the finite difference approach is usually more reliable than a semi-analytical approach provided an appropriate step size is used. The use of second order sensitivities is proved of being able to yield much better results than the case where only the first order sensitivities are used. When neural networks are trained to relate the wing natural frequencies to the shape variables, a negligible computation effort is needed to accurately determine the natural frequencies of a new design.

Kapania, Rakesh K.↗
DOE OSTI2012

THE X-FACTOR IN GALAXIES. II. THE MOLECULAR-HYDROGEN-STAR-FORMATION RELATION

There is ample observational evidence that the star formation rate (SFR) surface density, {Sigma}{sub SFR}, is closely correlated with the surface density of molecular hydrogen, {Sigma}{sub H{sub 2}}. This empirical relation holds both for galaxy-wide averages and for individual {approx}>kpc sized patches of the interstellar medium, but appears to degrade substantially at a sub-kpc scale. Identifying the physical mechanisms that determine the scale-dependent properties of the observed {Sigma}{sub H{sub 2}}-{Sigma}{sub SFR} relation using a set of cosmological, galaxy formation simulations with a peak resolution of {approx}100 pc. These simulations include a chemical network for molecular hydrogen, a model for the CO emission, and a simple, stochastic prescription for star formation that operates on {approx}100 pc scales. Specifically, star formation is modeled as a Poisson process in which the average SFR is directly proportional to the present mass of H{sub 2}. The predictions of our numerical model are in good agreement with the observed Kennicutt-Schmidt and {Sigma}{sub H{sub 2}}-{Sigma}{sub SFR} relations. We show that observations based on CO emission are ill suited to reliably measure the slope of the latter relation at low ({approx}< 20 M {sub Sun} pc{sup -2}) H{sub 2} surface densities on sub-kpc scales. Our models also predict that the inferred {Sigma}{sub H{sub 2}}-{Sigma}{sub SFR} relation steepens at high H{sub 2} surface densities as a result of the surface density dependence of the CO/H{sub 2} conversion factor. Finally, we show that on sub-kpc scales most of the scatter of the relation is a consequence of discreteness effects of the star formation process. In contrast, variations of the CO/H{sub 2} conversion factor are responsible for most of the scatter measured on super-kpc scales.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

A Parallel Computing Infrastructure for Building Energy Simulation

In order to study grid-interactive efficient buildings, Pacific Northwest National Laboratories (PNNL) needs an infrastructure for urban-scale building energy modeling. Such an infrastructure should be fast, scalable, and easy-to-use. Given a set of data from the Energy Information Administration’s Commercial Building Energy Consumption Survey (CBECS) and tool to translate survey data into simulation inputs, this project aimed to conduct the simulation of the entire dataset in parallel. Before running the simulations, the necessary software was bundled into a container for use on the PNNL supercomputing network. Then, the parallel simulation workflow was designed using GNU Make, a file creation software, and submitted to a supercomputing partition which could run hundreds of simulations simultaneously. The EnergyPlus simulations output hourly electric meter data for each CBECS sample, which represents the electricity consumption of similar commercial buildings across the United States. Analyzing and visualizing the meter data is important to the future of the work, and this project wrote code to make common analysis methods simple, fast, and accessible. Moving forwards, the model will need to be expanded to include data from other sources and its accuracy will need to be improved and eventually validated.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1992

Sea ice classification using fast learning neural networks

A first learning neural network approach to the classification of sea ice is presented. The fast learning (FL) neural network and a multilayer perceptron (MLP) trained with backpropagation learning (BP network) were tested on simulated data sets based on the known dominant scattering characteristics of the target class. Four classes were used in the data simulation: open water, thick lossy saline ice, thin saline ice, and multiyear ice. The BP network was unable to consistently converge to less than 25 percent error while the FL method yielded an average error of approximately 1 percent on the first iteration of training. The fast learning method presented can significantly reduce the CPU time necessary to train a neural network as well as consistently yield higher classification accuracy than BP networks.

Dawson, M. S.↗
NASA NTRS2003

Method for Constructing Composite Response Surfaces by Combining Neural Networks with other Interpolation or Estimation Techniques

A method and system for design optimization that incorporates the advantages of both traditional response surface methodology (RSM) and neural networks is disclosed. The present invention employs a unique strategy called parameter-based partitioning of the given design space. In the design procedure, a sequence of composite response surfaces based on both neural networks and polynomial fits is used to traverse the design space to identify an optimal solution. The composite response surface has both the power of neural networks and the economy of low-order polynomials (in terms of the number of simulations needed and the network training requirements). The present invention handles design problems with many more parameters than would be possible using neural networks alone and permits a designer to rapidly perform a variety of trade-off studies before arriving at the final design.

Rai, Man Mohan↗
NASA NTRS2000

A Simulation Study of Paced TCP

In this paper, we study the performance of paced TCP, a modified version of TCP designed especially for high delay- bandwidth networks. In typical networks, TCP optimizes its send-rate by transmitting increasingly large bursts, or windows, of packets, one burst per round-trip time, until it reaches a maximum window-size, which corresponds to the full capacity of the network. In a network with a high delay-bandwidth product, however, Transmission Control Protocol's (TCPs) maximum window-size may be larger than the queue size of the intermediate routers, and routers will begin to drop packets as soon as the windows become too large for the router queues. The TCP sender then concludes that the bottleneck capacity of the network has been reached, and it limits its send-rate accordingly. Partridge proposed paced TCP as a means of solving the problem of queueing bottlenecks. A sender using paced TCP would release packets in multiple, small bursts during a round-trip time in which ordinary TCP would release a single, large burst of packets. This approach allows the sender to increase its send-rate to the maximum window size without encountering queueing bottlenecks. This paper describes the performance of paced TCP in a simulated network and discusses implementation details that can affect the performance of paced TCP.

Kulik, Joanna↗
DOE OSTI2021

Application of Machine Learning Techniques to an Agent-Based Model of Pantoea

Agent-based modeling (ABM) is a powerful simulation technique which describes a complex dynamic system based on its interacting constituent entities. While the flexibility of ABM enables broad application, the complexity of real-world models demands intensive computing resources and computational time; however, a metamodel may be constructed to gain insight at less computational expense. Here, we developed a model in NetLogo to describe the growth of a microbial population consisting of Pantoea . We applied 13 parameters that defined the model and actively changed seven of the parameters to modulate the evolution of the population curve in response to these changes. We efficiently performed more than 3,000 simulations using a Python wrapper, NL4Py . Upon evaluation of the correlation between the active parameters and outputs by random forest regression, we found that the parameters which define the depth of medium and glucose concentration affect the population curves significantly. Subsequently, we constructed a metamodel, a dense neural network, to predict the simulation outputs from the active parameters and found that it achieves high prediction accuracy, reaching an R 2 coefficient of determination value up to 0.92. Our approach of using a combination of ABM with random forest regression and neural network reduces the number of required ABM simulations. The simplified and refined metamodels may provide insights into the complex dynamic system before their transition to more sophisticated models that run on high-performance computing systems. The ultimate goal is to build a bridge between simulation and experiment, allowing model validation by comparing the simulated data to experimental data in microbiology.

59 BASIC BIOLOGICAL SCIENCES↗