Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS2008

Toward Optimal Transport Networks

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Alexandrov, Natalia↗
DOE OSTI2021

Multi-scale Coupled Processes Modeling of Fractures as Porous, Interfacial and Granular Systems from Rock Images with the Numerical Manifold Method

Abstract The greatest challenges of rigorously modeling coupled hydro-mechanical processes in fractured rocks at different scales are associated with computational geometry. In addition, selections of continuous or discontinuous models, physical laws, and coupling priorities at different scales based on different geometric features determine the applicability of a numerical model for a certain type of problem. In this study, we present our multi-scale modeling capabilities that have been developed based on the numerical manifold method for analyzing coupled hydro-mechanical processes in fractured rocks. Based on their geometric features, the fractures are modeled as continua—finite-thickness porous zones, and discontinua—discontinuous interfaces and microscale asperities and granular systems. Different governing equations, physical laws, coupling priorities, and approaches for addressing fracture intersections and shearing are then applied to describe these. We applied these models to simulate coupled processes in fractured rocks using realistic geometry obtained from rock images at different scales. We first calculated shearing of a single fracture with different models and demonstrated the impacts of asperities on shearing. We then applied the continuous and discontinuous models to simulate a network of rough fractures, demonstrating that contact dynamics contribute significantly to the geometric, multi-physical evolution of systems where rough fractures are not mineral filled. For a discrete fracture network, our coupled processes modeling demonstrates that shearing of the discrete fractures can have a major impact on stress and pore pressure distribution. Lastly, we applied the discontinuous granular model to simulate evolution of a complex granular system with a deformation band, demonstrating that the deformation band can dominate contact dynamics, the structural and the stress evolution of the granular system.

58 GEOSCIENCES↗
NASA NTRS2004

High Speed Networking and Large-scale Simulation in Geodynamics

Large-scale numerical simulation has been one of the most important approaches for understanding global geodynamical processes. In this approach, peta-scale floating point operations (pflops) are often required to carry out a single physically-meaningful numerical experiment. For example, to model convective flow in the Earth's core and generation of the geomagnetic field (geodynamo), simulation for one magnetic free-decay time (approximately 15000 years) with a modest resolution of 150 in three spatial dimensions would require approximately 0.2 pflops. If such a numerical model is used to predict geomagnetic secular variation over decades and longer, with e.g. an ensemble Kalman filter assimilation approach, approximately 30 (and perhaps more) independent simulations of similar scales would be needed for one data assimilation analysis. Obviously, such a simulation would require an enormous computing resource that exceeds the capacity of a single facility currently available at our disposal. One solution is to utilize a very fast network (e.g. 10Gb optical networks) and available middleware (e.g. Globus Toolkit) to allocate available but often heterogeneous resources for such large-scale computing efforts. At NASA GSFC, we are experimenting with such an approach by networking several clusters for geomagnetic data assimilation research. We shall present our initial testing results in the meeting.

Kuang, Weijia↗
DOE OSTI2024

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗
DOE OSTI2025

Advancing stream temperature prediction with a generalizable large-sample framework across CONUS river reaches

Accurately predicting stream temperature in ungauged basins remains a critical challenge for water resource management, thermoelectric power plant cooling, and ecosystem conservation. Large-sample machine learning models trained on hundreds of well-monitored river basins have shown remarkable performance; however, such models have yet to be developed solely using forcing data that can be readily extracted to simulate stream temperatures anywhere in the contiguous United States (CONUS). In this study, we present a scalable, large-sample deep learning framework using Long Short-Term Memory (LSTM) networks to simulate daily stream temperatures in ungauged basins across the CONUS. The framework leverages both modeled reanalysis of meteorological and streamflow inputs as well as static attributes available for all 2.7 million CONUS river reaches in the National Hydrography Dataset Plus (NHDPlusV2). By generating dynamical inputs from predefined thermally relevant upstream contributing areas, rather than the entire upstream basin, the model also offers improvements in very large basins where full-basin averaging can dilute the most important influences on stream temperature. Evaluated across 300 basins, the model achieves a median Mean Absolute Error (MAE) of 1.1 °C and a Nash-Sutcliffe Efficiency (NSE) of 0.95 on temporally and spatially distinct test folds—comparable to models trained exclusively using meteorological and streamflow observational data. The flexible, high-performing framework generalizes to any unmonitored river reach without significant regulation or unnatural thermal input immediately upstream, substantially expanding predictive capabilities in data-scarce regions.

Hydrology↗
DOE OSTI2025

Improved heavy-ion PID using scintillation light detector with neural network analysis: a Monte Carlo simulation study

The photon collection efficiency of gaseous scintillator detectors varies according to the position of the impinging charged particles in the medium that generates scintillation light. Thus, when impinging particles are distributed over a large area, the intrinsic photon-number resolution of the system is affected by a large variation. This work presents and discusses a method for adjusting the total number of detected photons to account for variation in the photon collection efficiency as a function of the position of the light source within the scintillating medium. The method was developed and validated by processing data from systematic simulation studies based on GEANT4 that model the response of the Energy Loss Optical Scintillation System (ELOSS) detector. The position of the charged particle is calculated using a deep neural network algorithm. This is accomplished by analyzing the distribution of scintillation light recorded by the array of photosensors. The estimated particle position is then used to calculate the correction factor and adjust the amount of captured light to account for variations in the photon collection efficiency. The neural network algorithm provides excellent tracking capabilities, achieving sub-millimeter position resolution and an angular resolution of 12 mrad, approaching the performance of traditional tracking detectors (e.g., drift chambers). The present method can be generalized to any optical scintillation system where the photon collection efficiency depends on the position of the impinging particle.

Heavy-ion detectors↗
NASA NTRS1988

How to cluster in parallel with neural networks

Partitioning a set of N patterns in a d-dimensional metric space into K clusters - in a way that those in a given cluster are more similar to each other than the rest - is a problem of interest in astrophysics, image analysis and other fields. As there are approximately K(N)/K (factorial) possible ways of partitioning the patterns among K clusters, finding the best solution is beyond exhaustive search when N is large. Researchers show that this problem can be formulated as an optimization problem for which very good, but not necessarily optimal solutions can be found by using a neural network. To do this the network must start from many randomly selected initial states. The network is simulated on the MPP (a 128 x 128 SIMD array machine), where researchers use the massive parallelism not only in solving the differential equations that govern the evolution of the network, but also by starting the network from many initial states at once, thus obtaining many solutions in one run. Researchers obtain speedups of two to three orders of magnitude over serial implementations and the promise through Analog VLSI implementations of speedups comensurate with human perceptual abilities.

Kamgar-Parsi, Behzad↗
DOE OSTI2014

Simulation at Extreme-Scale: Co-Design Thinking and Practices

The current trend of computer architecture evolving towards exaflop/s is the fast increasing floating point performance (the so-called “free” flops) accompanied by much slowly improving the bandwidth of memory and network. Numerical simulation would undergo the challenge posed by the unbalanced increase in the compute power and the capability of data movement. In this paper, after reviewing the challenges of hardware and software in moving towards exascale computing, we present co-design thinking for selecting, optimizing, and developing a numerical algorithm and a simulation tool to meet the challenge of simulation at extreme scale. Examples are presented to demonstrate the new way of thinking and its effectiveness on the emerging architecture.

Computer Science↗
DOE OSTI2018

Simulation of solute transport through heterogeneous networks: analysis using the method of moments and the statistics of local transport characteristics

We used a time domain random walk approach to simulate passive solute transport in networks. In individual pores, solute transport was modeled as a combination of Poiseuille flow and Taylor dispersion. The solute plume data were interpreted via the method of moments. Analysis of the first and second moments showed that the longitudinal dispersivity increased with increasing coefficient of variation of the pore radii CV and decreasing pore coordination number Z. The third moment was negative and its magnitude grew linearly with time, meaning that the simulated dispersion was intrinsically non-Fickian. The statistics of the Eulerian mean fluid velocities $\hat{u}_i$, the Taylor dispersion coefficients $\hat{D}_i$ and the transit times $\hat{t}_i$ were very complex and strongly affected by CV and Z. In particular, the probability of occurrence of negative velocities grew with increasing CV and decreasing Z. Hence, backward and forward transit times had to be distinguished. The high-τ branch of the transit-times probability curves had a power law form associated to non-Fickian behavior. However, the exponent was insensitive to pore connectivity, although variations of Z affected the third moment growth. Thus, we conclude that both the low- and high-τ branches played a role in generating the observed non-Fickian behavior.

Li, Min↗
DOE OSTI2014

Lazy Updating of hubs can enable more realistic models by speeding up stochastic simulations

To respect the nature of discrete parts in a system, stochastic simulation algorithms (SSAs) must update for each action (i) all part counts and (ii) each action's probability of occurring next and its timing. This makes it expensive to simulate biological networks with well-connected “hubs” such as ATP that affect many actions. Temperature and volume also affect many actions and may be changed significantly in small steps by the network itself during fever and cell growth, respectively. Such trends matter for evolutionary questions, as cell volume determines doubling times and fever may affect survival, both key traits for biological evolution. Yet simulations often ignore such trends and assume constant environments to avoid many costly probability updates. Such computational convenience precludes analyses of important aspects of evolution. Here we present “Lazy Updating,” an add-on for SSAs designed to reduce the cost of simulating hubs. When a hub changes, Lazy Updating postpones all probability updates for reactions depending on this hub, until a threshold is crossed. Speedup is substantial if most computing time is spent on such updates. We implemented Lazy Updating for the Sorting Direct Method and it is easily integrated into other SSAs such as Gillespie's Direct Method or the Next Reaction Method. Testing on several toy models and a cellular metabolism model showed >10× faster simulations for its use-cases—with a small loss of accuracy. Thus we see Lazy Updating as a valuable tool for some special but important simulation problems that are difficult to address efficiently otherwise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗
DOE OSTI2026

Simultaneous global and local clustering in multiplex networks with covariate information

Understanding both global and layer-specific group structures is useful for uncovering complex patterns in networks with multiple interaction types. In this work, we introduce a new model, the hierarchical multiplex stochastic blockmodel, which simultaneously detects communities within individual layers of a multiplex network while inferring a global node clustering across the layers. A stochastic blockmodel is assumed in each layer, with probabilities of layer-level group memberships determined by a node’s global group assignment. Our model uses a Bayesian framework, employing a probit stick-breaking process to construct node-specific mixing proportions over a set of shared Griffiths–Engen–McCloseky distributions. These proportions determine layer-level community assignment, allowing for an unknown and varying number of groups across layers, while incorporating nodal covariate information to inform the global clustering. We propose a scalable variational inference procedure with parallelisable updates for application to large networks. Extensive simulation studies demonstrate our model’s ability to accurately recover both global and layer-level clusters in complicated settings, and applications to real data showcase the model’s effectiveness in uncovering interesting latent network structure.

community detection↗
DOE OSTI2020

Application of First-Principles-Based Artificial Neural Network Potentials to Multiscale-Shock Dynamics Simulations on Solid Materials

The use of artificial neural network (ANN) potentials trained with first-principles calculations has emerged as a promising approach for molecular dynamics (MD) simulations encompassing large space and time scales while retaining first-principles accuracy. To date, however, the application of ANN-MD has been limited to near-equilibrium processes. Here we combine first-principles-trained ANN-MD with multiscale shock theory (MSST) to successfully describe far-from-equilibrium shock phenomena. Overall, our ANN-MSST-MD approach describes shock-wave propagation in solids with first-principles accuracy but a 5000 times shorter computing time. Accordingly, ANN-MD-MSST was able to resolve fine, long-time elastic deformation at low shock speed, which was impossible with first-principles MD because of the high computational cost. This work thus lays a foundation of ANN-MD simulation to study a wide range of far-from-equilibrium processes.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Synchronization of Lienard-Type Oscillators in Heterogenous Electrical Networks

Motivated by potential applications for power-electronic converters in microgrids, we study the problem of global asymptotic synchronization of Lienard-type nonlinear oscillators in heterogenous LTI electrical networks with series R-L circuits modeling interconnections. By heterogeneous, we mean that the resistance-to-inductance ratios of the lines are not all the same. Building on our previous work, we derive sufficient conditions for global asymptotic synchronization by using a first-order filter on the outputs of the oscillators. Our approach leverages a coordinate transformation to a system that emphasizes signal differences and the use of passivity based arguments to establish synchronization of the network of oscillators asymptotically. The analysis subsumes and generalizes previous conditions that have been derived for Lienard oscillators in homogeneous electrical networks. Numerical simulations are provided to validate the results.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Multi-time scale control of demand flexibility in smart distribution networks

This study presents a multi-timescale control strategy to deploy demand flexibilities of electric vehicles (EV) for providing system balancing and local congestion management by simultaneously ensuring economic benefits to participating actors. First, the EV charging problem from consumer, aggregator, and grid operator’s perspective is investigated. A hierarchical control architecture (HCA) comprising scheduling, coordinative, and adaptive layers is then designed to realize their coordinative goal. This is realized by integrating a multi-time scale control, which works from a day-ahead scheduling up to real-time adaptive control. The performance of the developed method is investigated with high EV penetration in a typical distribution network. The simulation results demonstrates that HCA exploit EV flexibility to solve grid unbalancing and congestions with simultaneous maximization of economic benefits by ensuring EV participation to day-ahead, balancing, and regulation markets. For the given network configuration and pricing structure, HCA ensures the EV owners to get paid up to 5 times the cost they were paying without control.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Data-Driven Voltage Regulation of Distribution Grid Using Nonlinear Autoregressive Model with Exogenous Inputs (NARX)

This article proposes data-driven control via a nonlinear autoregressive model with exogenous inputs (NARX) for real-time voltage regulation of a modified feeder using reactive power sources. Traditional voltage control strategies rely on rule-based heuristics or optimization techniques, which often require detailed system models and extensive computational resources. The NARX-based controller learns system dynamics from historical data and predicts optimal reactive power dispatch in real-time for voltage correction. The proposed approach is evaluated on a power system feeder model under varying load and network conditions. Simulation results demonstrate that the NARX-based controller achieves improved voltage regulation, offering higher adaptability to system fluctuations. This study highlights the potential of data-driven control for enhancing the reliability of power distribution networks.

Donge, Vrushabh [ORNL] (ORCID:0000000306062803)↗
DOE OSTI2024

Leveraging Optimal Sparse Sensor Placement to Aggregate a Network of Digital Twins for Nuclear Subsystems

Nuclear power plants (NPPs) require continuous monitoring of various systems, structures, and components to ensure safe and efficient operations. The critical safety testing of new fuel compositions and the analysis of the effects of power transients on core temperatures can be achieved through modeling and simulations. They capture the dynamics of the physical phenomenon associated with failure modes and facilitate the creation of digital twins (DTs). Accurate reconstruction of fields of interest (e.g., temperature, pressure, velocity) from sensor measurements is crucial to establish a two-way communication between physical experiments and models. Sensor placement is highly constrained in most nuclear subsystems due to challenging operating conditions and inherent spatial limitations. This study develops optimized data-driven sensor placements for full-field reconstruction within reactor and steam generator subsystems of NPPs. Optimized constrained sensors reconstruct field of interest within a tri-structural isotropic (TRISO) fuel irradiation experiment, a lumped parameter model of a nuclear fuel test rod and a steam generator. The optimization procedure leverages reduced-order models of flow physics to provide a highly accurate full-field reconstruction of responses of interest, noise-induced uncertainty quantification and physically feasible sensor locations. Accurate sensor-based reconstructions establish a foundation for the digital twinning of subsystems, culminating in a comprehensive DT aggregate of an NPP.

42 ENGINEERING↗