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 1,657 records · Page 92

Modular Aquatic Simulation System 1D

MASS1 simulates open channel hydrodynamics and transport in branched channel networks, using cross-section averaged forms of the continuity, momentum, and convection diffusion equations. Thermal energy transport (temperature), including meteorological influences is supported. The thermodynamics of total dissolved gas (TDG) can be directly simulated. MASS1 has been developed over the last 20 years. It is currently being used on DOE projects that require MASS1 to beopen source. Hence, the authors would like to distribute MASS1 in source form.

Source record↗

Modular Aquatic Simulation System 1D

MASS1 simulates open channel hydrodynamics and transport in branched channel networks, using cross-section averaged forms of the continuity, momentum, and convection diffusion equations. Thermal energy transport (temperature), including meteorological influences is supported. The thermodynamics of total dissolved gas (TDG) can be directly simulated. MASS1 has been developed over the last 20 years. It is currently being used on DOE projects that require MASS1 to beopen source. Hence, the authors would like to distribute MASS1 in source form.

Source record↗

Influence of fracture statistics on advective transport and implications for geologic repositories

Large-scale (2.5 km by 2.5 km) simulations of fluid flow and solute transport through low-permeability fractured rock are assessed to determine suitability for hosting a nuclear waste repository. Multiple realizations of fracture networks with statistically realistic features are generated according to established methods. A novel continuum method provides a basis for solving flow and simulating particle trajectories through the fracture networks. Classical and fractional advection-dispersion models form the analytic foundation for statistical summaries of the transport of 25,000 conservative particles through the backbone of each network realization. Particle retention in low-velocity fractures, fast transport, and anomalous dispersion are all observed in the simulated plumes. Predictability is addressed by measuring the deviation of individual plumes from their ensemble average, taken over all realizations for each set of fracture network statistics. Fifteen sets of fracture network statistics are examined, ranging from dense networks of relatively short fractures to sparse networks of rather long fractures. Finally, the plume statistics are carefully examined in order to develop recommendations for suitable geologic repositories on the basis of fracture network statistics.

58 GEOSCIENCES↗

Refining fast calorimeter simulations with a Schrödinger Bridge

Machine learning-based simulations, especially calorimeter simulations, are promising tools for approximating the precision of classical high energy physics simulations with a fraction of the generation time. Nearly all methods proposed so far learn neural networks that map a random variable with a known probability density, like a Gaussian, to realistic-looking events. In many cases, physics events are not close to Gaussian and so these neural networks have to learn a highly complex function. We study an alternative approach: Schrödinger bridge Quality Improvement via Refinement of Existing Lightweight Simulations (SQuIRELS). SQuIRELS leverages the power of diffusion-based neural networks and Schrödinger bridges to map between samples where the probability density is not known explicitly. We apply SQuIRELS to the task of refining a classical fast simulation to approximate a full classical simulation. On simulated calorimeter events, we find that SQuIRELS is able to reproduce highly non-trivial features of the full simulation with a fraction of the generation time.

Calorimeter methods↗

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗

Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation

Uncertainty quantification (UQ) tasks, such as model calibration, uncertainty propagation, and optimization under uncertainty, typically require several thousand evaluations of the underlying computer codes. To cope with the cost of simulations, one replaces the real response surface with a cheap surrogate based, e.g., on polynomial chaos expansions, neural networks, support vector machines, or Gaussian processes (GP). However, the number of simulations required to learn a generic multivariate response grows exponentially as the input dimension increases. This curse of dimensionality can only be addressed, if the response exhibits some special structure that can be discovered and exploited. A wide range of physical responses exhibit a special structure known as an active subspace (AS). An AS is a linear manifold of the stochastic space characterized by maximal response variation. The idea is that one should first identify this low dimensional manifold, project the high-dimensional input onto it, and then link the projection to the output. If the dimensionality of the AS is low enough, then learning the link function is a much easier problem than the original problem of learning a high-dimensional function. The classic approach to discovering the AS requires gradient information, a fact that severely limits its applicability. Furthermore, and partly because of its reliance to gradients, it is not able to handle noisy observations. The latter is an essential trait if one wants to be able to propagate uncertainty through stochastic simulators, e.g., through molecular dynamics codes. In this work, we develop a probabilistic version of AS which is gradient-free and robust to observational noise. Our approach relies on a novel Gaussian process regression with built-in dimensionality reduction. In particular, the AS is represented as an orthogonal projection matrix that serves as yet another covariance function hyper-parameter to be estimated from the data. To train the model, we design a two-step maximum likelihood optimization procedure that ensures the orthogonality of the projection matrix by exploiting recent results on the Stiefel manifold, i.e., the manifold of matrices with orthogonal columns. The additional benefit of our probabilistic formulation, is that it allows us to select the dimensionality of the AS via the Bayesian information criterion. We validate our approach by showing that it can discover the right AS in synthetic examples without gradient information using both noiseless and noisy observations. We demonstrate that our method is able to discover the same AS as the classical approach in a challenging one-hundred-dimensional problem involving an elliptic stochastic partial differential equation with random conductivity. Finally, we use our approach to study the effect of geometric and material uncertainties in the propagation of solitary waves in a one dimensional granular system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Propagating synthetic populations with dynamic Bayesian networks: a framework for long-horizon demographic forecasting

This study presents a dynamic demographic microsimulator using dynamic Bayesian networks to forecast long–term changes in household and individual life events. Leveraging longitudinal Panel Study of Income Dynamics (PSID) data, two networks for individuals and households were modeled to simulate transitions in employment, income, education, marriage, childbirth, leaving the parental home, home ownership, mortality, and household formation or dissolution. Across 1,000 simulation runs spanning 24 years, household–level outcomes remain highly accurate and individual–level predictions reasonable. Although accuracy naturally declines with projection horizon, performance remains promising at both levels. This study addresses a key limitation of existing population synthesis models, which typically generate only a single static snapshot of the population. In conclusion, by introducing a framework that propagates cross-sectional outputs into the future, the microsimulator enables the tracking of demographic evolution over time, enhances realism in population-based simulations, and supplies credible inputs to agent-based travel demand models.

Demographic modeling↗

AutonomieAI: An efficient and deployable vehicle energy consumption estimation toolkit

Here, this paper presents AutonomieAI, a novel toolkit designed for efficient energy estimation of vehicles across diverse trip scenarios, routes, and drive cycles, applicable to a broad range of vehicle powertrain technologies. It leverages state-of-the-art Machine Learning techniques to deliver real-time energy prediction of vehicles, enabling co-simulation with transportation level system tools and opening doors for large-scale optimization at city, network or national level. Benchmark results show that AutonomieAI achieves high accuracy, with an average percentage error below 2% for most powertrain types, and computational efficiency capable of processing over 10,000 trips per second. Applications of AutonomieAI have potential to offer the flexibility to assist in solving eco-routing problems, optimize for vehicle and powertrain selection, study charging decision behavior, and optimize for charging station placement. AutonomieAI is the result of large neural network based model architectures, trained on very large and unique high fidelity vehicle simulation data. It is lightweight, deployable, efficient and has accuracy comparable to specialized and complex physics based simulation softwares.

Autonomie↗

Local primordial non-Gaussianity from the large-scale clustering of photometric DESI luminous red galaxies

ABSTRACT We use angular clustering of luminous red galaxies from the Dark Energy Spectroscopic Instrument (DESI) imaging surveys to constrain the local primordial non-Gaussianity parameter fNL. Our sample comprises over 12 million targets, covering 14 000 deg2 of the sky, with redshifts in the range 0.2 < z < 1.35. We identify Galactic extinction, survey depth, and astronomical seeing as the primary sources of systematic error, and employ linear regression and artificial neural networks to alleviate non-cosmological excess clustering on large scales. Our methods are tested against simulations with and without fNL and systematics, showing superior performance of the neural network treatment. The neural network with a set of nine imaging property maps passes our systematic null test criteria, and is chosen as the fiducial treatment. Assuming the universality relation, we find $f_{\rm NL} = 34^{+24(+50)}_{-44(-73)}$ at 68 per cent (95 per cent) confidence. We apply a series of robustness tests (e.g. cuts on imaging, declination, or scales used) that show consistency in the obtained constraints. We study how the regression method biases the measured angular power spectrum and degrades the fNL constraining power. The use of the nine maps more than doubles the uncertainty compared to using only the three primary maps in the regression. Our results thus motivate the development of more efficient methods that avoid overcorrection, protect large-scale clustering information, and preserve constraining power. Additionally, our results encourage further studies of fNL with DESI spectroscopic samples, where the inclusion of 3D clustering modes should help separate imaging systematics and lessen the degradation in the fNL uncertainty.

79 ASTRONOMY AND ASTROPHYSICS↗

A Toolbox Model of Evolution of Metabolic Pathways on Networks of Arbitrary Topology

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger ‘‘universal’’ network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of ‘‘small-world’’ topology, reallife metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

59 BASIC BIOLOGICAL SCIENCES↗

A Toolbox Model of Evolution of Metabolic Pathways on Networks of Arbitrary Topology

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger 'universal' network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of 'small-world' topology, real-life metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

59 BASIC BIOLOGICAL SCIENCES↗

Simulating the Impact of Dynamic Rerouting on Metropolitan-scale Traffic Systems

The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this article, we describe enhancements to the Mobiliti parallel traffic simulator to model dynamic rerouting behavior with the addition of vehicle controller actors and vehicle-to-controller reroute requests. The simulator is designed to support distributed-memory parallel execution using discrete event simulation and be scalable on high-performance computing platforms. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day in the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present a sensitivity study on the dynamic rerouting parameters, discuss the simulator’s parallel scalability, and analyze system-level impacts of changing the dynamic rerouting penetration. Furthermore, we examine the varying effects on different functional classes and geographical regions and present a validation of the simulation results compared to real-world data.

97 MATHEMATICS AND COMPUTING↗

Structural analysis of WO 3 -TeO 2 glasses by neutron, high energy X-ray diffraction, reverse Monte Carlo simulations and XANES

The structure of WO 3 -TeO 2 glasses containing 15, 20 and 25 mol% WO 3 are studied by neutron diffraction (ND), high energy X-ray diffraction (XRD) and X-ray Absorption Near Edge spectroscopy (XANES). The short-range structural properties of glasses i.e. Te-O and W-O speciation, coordination number distributions, bond-lengths, and the O-Te-O, O-W-O and O-O-O bond angle distributions in the glass network are determined by the Reverse Monte Carlo (RMC) simulations of the ND and XRD data. RMC technique successfully determined all partial pair correlation functions and the coordination number distributions revealed that glass network consists predominantly of TeO 4 and WO 4 units with small amounts of triangular, penta and hexa co-ordinated units. The average W-O and Te-O bond lengths are in the ranges: 1.69-1.75 +/- 0.01 angstrom and 1.99-2.00 +/- 0.01 angstrom respectively. Both W-O and Te-O correlation peaks are asymmetrical, that indicate a distribution of their bond lengths in the respective structural units. The O-Te-O bond angle distribution has a peak at 107 +/- 2 degrees. Similarly the O-W-O bond angle distribution has a peak at 108 +/- 5 degrees. On increasing the WO3 concentration from 15 to 25 mol%, the average Te-O coordination number decreases from 3.80 to 3.61 +/- 0.02 due to the structural transformation: TeO 4 → TeO 3 , similarly the W-O coordination also decreases and is in the range: 3.79-3.67 +/- 0.02. XANES studies found that the oxidation state of Te and W ions in the glasses are 4 + and 6 + respectively.

36 MATERIALS SCIENCE↗

A simulation framework for evaluating electronic order workflows in integrated health records

Electronic health record (EHR) systems are critical to modern healthcare delivery, yet the dynamic workflows that govern electronic order processing remain underexplored. Inefficiencies in these digital pathways can cause delays in care, repetitive workloads, and even patient harm. This study presents a discrete-event simulation framework used to reconstruct and evaluate EHR-based order workflows in a large integrated healthcare system. Using real-world data extracted from the Veterans Health Administration’s Corporate Data Warehouse, the authors mapped order events to standardized state transitions and modeled their progression across different facilities of varying complexity levels. After being calibrated with empirical distributions of transition times and validated against observed time-in-system metrics, the simulation demonstrates close alignment with historical performance. Scenario analyses reveal that resource capacity constraints significantly amplify the impact of electronic order surges, which are reflected in the disproportionate growth in backlogs and processing delays. Adjustments in transition probabilities further increased recirculation and extended workflow paths. Network-based analysis identified Reserved, InProgress, and Completed as structurally critical states that function as hubs within the process network but the transitions in-between also act as major bottlenecks. These results showcased the effectiveness of simulation-based approaches in monitoring EHR order processing performance and evaluating consequences of workflow changes on healthcare network resources planning. The proposed simulation framework provides a scalable data-driven tool to support operational decision-making and improve the efficiency of electronic order management in complex healthcare environments.

Engineering↗

Design and simulation of a SiPM-on-tile ZDC for the future EIC, and its performance with graph neural networks

We present a design for a high-granularity zero-degree calorimeter (ZDC) for the upcoming Electron-Ion Collider (EIC). The design uses SiPM-on-tile technology and features a novel staggered-layer arrangement that improves spatial resolution. To fully leverage the design’s high granularity and non-trivial geometry, we employ graph neural networks (GNNs) for energy and angle regression as well as signal classification. The GNN-boosted performance metrics meet, and in some cases, significantly surpass the requirements set in the report on science requirements and detector requirements for the EIC (Yellow Report), laying the groundwork for enhanced measurements that will facilitate a wide physics program. Our studies show that GNNs can significantly enhance the performance of high-granularity CALICE-style calorimeters by automating and optimizing the software compensation algorithms required for these systems. This improvement holds true even in the case of complicated geometries that pose challenges for image-based AI/ML methods.

Calorimeter↗

Impact of Open Communication Networks on Load Frequency Control with Plug-In Electric Vehicles by Cyber-Physical Dynamic Co-Simulation

With the increasing electrification of the transportation sector to achieve the carbon neutrality objective, despite the challenges of charging electric vehicles (EV), there are also opportunities through smart charging EVs to improve system frequency stability; however, EV control technologies might require nontraditional communication support. This paper investigates the impacts of communication variations of EV on power system load frequency control through a cyber-physical dynamic system (CPDS) co-simulation. Here, the CPDS is built upon our previously developed transmission-and-distribution dynamic co-simulation model with the added communication variation functions (i.e., delay and packet loss). The case studies consider multiple communication variation scenarios when the system experiences an N-1 generation trip contingency. The scenarios include communication delays and packet loss using both homogeneous and heterogeneous assumptions. The outcomes of this work can help improve EV frequency regulation services and provide robust and effective tests for different load frequency control algorithms of the future power systems.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗