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 1,171 records · Page 65

Electron percolation in realistic models of carbon nanotube networks

The influence of penetrable and curved carbon nanotubes (CNT) on the charge percolation in three-dimensional disordered CNT networks have been studied with Monte-Carlo simulations. By considering carbon nanotubes as solid objects but where the overlap between their electron cloud can be controlled, we observed that the structural characteristics of networks containing lower aspect ratio CNT are highly sensitive to the degree of penetration between crossed nanotubes. Following our efficient strategy to displace CNT to different positions to create more realistic statistical models, we conclude that the connectivity between objects increases with the hard-core/soft-shell radii ratio. In contrast, the presence of curved CNT in the random networks leads to an increasing percolation threshold and to a decreasing electrical conductivity at saturation. The waviness of CNT decreases the effective distance between the nanotube extremities, hence reducing their connectivity and degrading their electrical properties. We present the results of our simulation in terms of thickness of the CNT network from which simple structural parameters such as the volume fraction or the carbon nanotube density can be accurately evaluated with our more realistic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Survival of pq -superstrings in field theory simulations

We perform large-scale field theoretical simulations in expanding universe to characterize a network of strings that can form composed bound states. The network consists of two copies of Abelian Higgs strings (which we label p and q , respectively) coupled via a potential term to give pq bound states. The simulations are performed using two different kinds of initial conditions: the first one with a network of p - and q -strings, and the second one with a network of q - and pq -strings. This way, we start from two opposite situations: one with no initial pq -strings, and one with a large initial number of pq -strings. We find that in both cases the system scales, and in both cases the system prefers to have a low fraction of pq -strings. This is somewhat surprising in the case for the second type of conditions, showing that the unzipping mechanism is very efficient. We also find hints that both initial conditions tend to asymptote to a common configuration, though we would need a larger dynamical range to confirm it. The average velocities of the different types of strings in the network have also been explored for the first time.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Simulation Study of Quantum Clock Synchronization Using Teleportation

An important requirement in implementing distributed computing and sensing application is the synchronization of clocks at various locations. The Internet relies on the Network Time Protocol (NTP), which synchronizes clocks with accuracy in the order of milliseconds. More recently an ensemble of atomic clocks is used for navigation based on GPS. These clocks are highly accurate and provide time with very low uncertainty. Even so, many physics experiments such as distributed LIGO-based systems may require more accurate clock synchronization that is achievable using quantum entanglement. This requires the deployment of a network of quantum clocks synchronized by exploiting entangled atomic clock qubits. In this paper, we carry out a simulation study of synchronizing a network of quantum clocks interconnected by a fiber plant that supports the ESnet; the latter is used to support the classical communication needed for teleportation. We consider an existing protocol for synchro-nizing the atomic clock qubits that relies on the GHZ states. To assess the performance of the protocol we developed a discrete-event simulation of the network using IBM Qiskit framework for underlying quantum gate operations and measurements. The simulation results shed light on the resources required in terms of the number entangled qubits and the time needed to achieve the synchronization of different number of nodes in ESnet.

Kiran, Mariam↗

Short-Term Load Forecasting Based Automatic Distribution Network Reconfiguration

In a traditional dynamic network reconfiguration study, the optimal topology is determined at every scheduled time point by using the real load data measured at that time. The development of the load forecasting technique can provide an accurate prediction of the load power that will happen in a future time and provide more information about load changes. With the inclusion of load forecasting, the optimal topology can be determined based on the predicted load conditions during a longer time period instead of using a snapshot of the load at the time when the reconfiguration happens; thus, the distribution system operator can use this information to better operate the system reconfiguration and achieve optimal solutions. This paper proposes a short-term load forecasting approach to automatically reconfigure distribution systems in a dynamic and pre-event manner. Specifically, a short-term and high-resolution distribution system load forecasting approach is proposed with a forecaster based on support vector regression and parallel parameters optimization. The network reconfiguration problem is solved by using the forecasted load continuously to determine the optimal network topology with the minimum amount of loss at the future time. The simulation results validate and evaluate the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Joint Modeling of Quasar Variability and Accretion Disk Reprocessing Using Latent Stochastic Differential Equations

Quasars are bright active galactic nuclei powered by the accretion of matter around supermassive black holes at the center of galaxies. Their stochastic brightness variability depends on the physical properties of the accretion disk and black hole. The upcoming Rubin Observatory Legacy Survey of Space and Time (LSST) is expected to observe tens of millions of quasars, so there is a need for efficient techniques like machine learning that can handle the large volume of data. Quasar variability is believed to be driven by an X-ray corona, which is reprocessed by the accretion disk and emitted as UV/optical variability. We are the first to introduce an auto-differentiable simulation of the accretion disk and reprocessing. We use the simulation as a direct component of our neural network to jointly model the driving variability and reprocessing, trained with supervised learning on simulated LSST-like 10 yr quasar light curves. We encode the light curves using a transformer encoder, and the driving variability is reconstructed using latent stochastic differential equations, a physically motivated generative deep learning method that can model continuous-time stochastic dynamics. By embedding the physical processes of the driving signal and reprocessing into our network, we achieve a model that is more robust and interpretable. We demonstrate that our model outperforms a Gaussian process regression baseline and can infer accretion disk parameters and time delays between wave bands, even for out-of-distribution driving signals. Our approach provides a powerful framework that can be adapted to solve other inverse problems in multivariate time series.

Fagin, Joshua [City Univ. of New York (CUNY), NY (↗

Parameter Optimization Toolbox for NS-3 network optimization, NS-3 Parameter Optimization Framework [SWR-18-60]

This simulation-based parameter optimization framework is proposed to tune parameters of different types of communication networks using ns-3 to achieve the optimal network performance. It consists of three main components: an ns-3 packet reporting module; a sampler running simulations with all possible parameter sets for the input parameter variables by using a parallel executor at each generation; and a hybrid optimization algorithm for tuning configurable parameters of hybrid designs and application parameter variables. The proposed hybrid metaheuristic optimization algorithm combines an evolutionary algorithm with a gradient descent function to quickly achieve an approximate globally optimum solution. This software is designed to be used in a multi-core processing Linux environment and run over a long duration of time. The execution time varies depending mainly upon the nature of the ns-3 configuration being simulated. This software includes a custom ns-3 QoS measurement application which must be included with the ns-3 source code during installation of the software.

Hasandka, Adarsh↗

Evaluating System Parameters on a Dragonfly using Simulation and Visualization

The dragon y topology is becoming a popular choice for build- ing high-radix, low-diameter networks with high-bandwidth links. Even with a powerful network, preliminary experi- ments on Edison at NERSC have shown that for communica- tion heavy applications, job interference and thus presumably job placement remains an important factor. In this paper, we explore the e ects of job placement, job sizes, parallel workloads and network con gurations on network through- put to better understand inter-job interference. We use a simulation tool called Damsel y to model the network be- havior of Edison and study the impact of various system parameters on network throughput. Parallel workloads based on ve representative communication patters are used and the simulation studies on up to 131,072 cores are aided by a new visualization of the dragon y network.

97 MATHEMATICS AND COMPUTING↗

Fit Fly: A Case Study of Interconnect Innovation through Parallel Simulation

To meet the demand for exascale-level performance from high-performance computing (HPC) interconnects, many system architects are turning to simulation results for accurate and reliable predictions of the performance of prospective technologies. Testing full-scale networks with a variety of benchmarking tools, including synthetic workloads and application traces, can give crucial insight into what ideas are most promising without needing to physically construct a test network. While flexible, however, this approach is extremely compute time intensive. We address this time complexity challenge through the use of large-scale, optimistic parallel simulation that ultimately leads to faster HPC network architecture innovations. In this paper we demonstrate this innovation capability through a real-world network design case study. Specifically, we have simulated and compared four extreme-scale interconnects: Dragonfly, Megafly, Slim Fly, and a new dual-rail-dual-plane variation of the Slim Fly network topology. We present this new variant of Slim Fly, dubbed Fit Fly, to show how interconnect innovation and evaluation-beyond what is possible through analytic methods-can be achieved through parallel simulation. We validate and compare the model with various network designs using the CODES interconnect simulation framework. By running large-scale simulations in a parallel environment, we are able to quickly generate reliable performance results that can help network designers break ground on the next generation of high-performance network designs.

High Performance Computing↗

Reliable extrapolation of deep neural operators informed by physics or sparse observations

Deep neural operators can learn nonlinear mappings between infinite-dimensional function spaces via deep neural networks. As promising surrogate solvers of partial differential equations (PDEs) for real-time prediction, deep neural operators such as deep operator networks (DeepONets) provide a new simulation paradigm in science and engineering. Pure data-driven neural operators and deep learning models, in general, are usually limited to interpolation scenarios, where new predictions utilize inputs within the support of the training set. However, in the inference stage of real-world applications, the input may lie outside the support, i.e., extrapolation is required, which may result to large errors and unavoidable failure of deep learning models. Here, we address this challenge of extrapolation for deep neural operators. First, we systematically investigate the extrapolation behavior of DeepONets by quantifying the extrapolation complexity, via the 2-Wasserstein distance between two function spaces and propose a new strategy of bias–variance trade-off for extrapolation with respect to model capacity. Subsequently, we develop a complete workflow, including extrapolation determination, and we propose five reliable learning methods that guarantee a safe prediction under extrapolation by requiring additional information—the governing PDEs of the system or sparse new observations. The proposed methods are based on either fine-tuning a pre-trained DeepONet or multifidelity learning. We demonstrate the effectiveness of the proposed framework for various types of parametric PDEs. Furthermore, our systematic comparisons provide practical guidelines for selecting a proper extrapolation method depending on the available information, desired accuracy, and required inference speed.

42 ENGINEERING↗

Machine learning-assisted early ignition prediction in a complex flow

Machine learning methods are used to improve the efficiency by which turbulence-resolved simulations predict whether a hydrogen jet in air crossflow will successfully ignite. The flush-mounted jet issues perpendicularly from the wall of a low-speed wind tunnel into a turbulent boundary layer wherein a laser-induced optical breakdown (LIB) hotspot is deposited. A detailed hydrogen chemical mechanism is used to model the radicals and any subsequent chemical reactions. A dielectric-barrier discharge actuator generates body forces and hydrogen radicals near the jet orifice. Here we focus on the success or not of the ignition based on LIB location. A challenge is that definitive determination of this requires long simulations, up to 440 µs after the LIB deposition. This is particularly expensive since multiple simulations are required to find the threshold. To reduce the computational effort, three short-time (91 µs) criteria are proposed, evaluated, and compared: a constructed criterion based on detailed observations of radicals near the stoichiometric surface and two machine learning approaches, each trained on 38 realizations. The constructed criterion provides a low-cost estimate of the ignition boundary that is unambiguous in 45 of the 50 training and test trials, so only 10% of them would need to be simulated longer. The trained neural networks correctly predict outcomes in all cases evaluated, with the more automated procedure—a convolutional neural network (CNN) trained on two-dimensional images—providing the most definitive outcome prediction. From the CNN, a sensitivity analysis is used to determine which kernel features from the two-dimensional input data, as defined by intermediate-layer network weights, are important for identifying ignition.

42 ENGINEERING↗

A statistical approach to screening isotopic signatures in monitoring for underground nuclear explosions

The ability to differentiate between atmospheric radionuclide signatures from underground nuclear explosions (UNEs) and signals from other sources, such as medical isotope-production facilities and nuclear reactors, can be critical to the detection and monitoring of unannounced, low-yield nuclear events. Signatures having anomalously high amplitudes, compared to background levels, remain the best indicator in screening for a UNE. However, isotopic composition can further validate a suspected UNE signature, but separation from any atmospheric background composition is first necessary. To date, evaluating the challenges of performing this separation has typically involved comparing an observed background with a highly idealized deterministic model of radioxenon signature production by a UNE that does not consider the influence of post-detonation chemical/physical processes in the detonation cavity or the subsequent gas transport mechanisms that can also affect the isotopic composition of the detected gas signature. In addition, purely deterministic models, as previously employed, overlook the uncertainty inherent in estimating critical parameters characterizing the UNE and its detonation environment. In this paper, we create detailed, multi-parameter models of radionuclide evolution using the widely accepted England and Rider post-detonation radionuclide decay-chain network coupled to detailed models simulating physical production and transport processes affecting the gas signature. Because these models are governed by uncertain parameters including barometric fluctuations, realistic ranges of variation for each of the parameters influencing isotopic composition are then defined. A Latin-Hypercube sampling approach is used to obtain a random distribution of isotopic production and gas transport results associated with a given value of each parameter. We apply these results to background histories of two stations, one providing 4-isotope background measurements and the other providing two-isotope measurements associated with the 2013 DPRK announced UNE.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Acid–Base Chemistry of a Model IrO 2 Catalytic Interface

Iridium oxide (IrO 2 ) is one of the most efficient catalytic materials for the oxygen evolution reaction (OER), yet the atomic scale structure of its aqueous interface is largely unknown. Herein, the hydration structure, proton transfer mechanisms and acid-base properties of the rutile IrO 2 (110)-water interface are investigated using ab-initio based deep neural-network potentials and enhanced sampling simulations. The proton affinities of the different surface sites are characterized by calculating their acid dissociation constants, which yield a point of zero-charge in good agreement with experiments. A large fraction (≈ 80%) of adsorbed water dissociation is observed, together with a short lifetime (≈ 0.5 ns) of the resulting terminal hydroxy groups, due to rapid proton exchanges between adsorbed H 2 O and adjacent OH species. As a result, this rapid surface proton transfer supports the suggestion that the rate-determining step in the OER may not involve proton transfer across the double layer into solution, as indicated by recent experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.

42 ENGINEERING↗

Identifying Defects with Guided Algorithms in Bragg Coherent Diffractive Imaging

In this study, crystallographic defects such as dislocations can significantly alter material properties and functionality. However, imaging these imperfections during operation remains challenging due to the short length scales involved and the reactive environments of interest. Bragg coherent diffractive imaging (BCDI) has emerged as a powerful tool capable of identifying dislocations, twin domains, and other defects in 3D detail with nanometer spatial resolution within nanocrystals and grains in reactive environments. However, BCDI relies on phase retrieval algorithms that can fail to accurately reconstruct the defect network. Here, we use numerical simulations to explore different guided phase retrieval algorithms for imaging defective crystals using BCDI. We explore different defect types, defect densities, Bragg peaks, and guided algorithm fitness metrics as a function of signal-to-noise ratio. Based on these results, we offer a general prescription for phasing of defective crystals with no a prior knowledge.

36 MATERIALS SCIENCE↗

Active learning of neural network potentials for rare events

Developing an automated active learning framework for Neural Network Potentials, focusing on accurately simulating bond-breaking in hexane chains through steered molecular dynamics sampling and assessing model transferability.

97 MATHEMATICS AND COMPUTING↗

Synchronization in node of complex networks consist of complex chaotic system

A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.

36 MATERIALS SCIENCE↗

On the effect of mixing-driven vaporization in a homogeneous relaxation modeling framework

The homogeneous relaxation model (HRM) is one of the most widely used models to describe the liquid–gas phase transition in multiphase flows due to the occurrence of cavitation. However, in its original formulation, the HRM does not account for the presence of ambient gas species, which generally limits its applicability to the injector's internal flow where ambient gases are negligible. In this work, a mixing-driven vaporization (MDV) model was developed to extend the capability of the HRM in handling the mixing effect in the regions external to the nozzle, where vapor–liquid equilibrium for multi-species mixtures of fuel and ambient gas is considered. Herein, to assess the model performance, simulations of the Engine Combustion Network's Spray G injector were performed with the HRM and the MDV model under both flash-boiling and evaporating conditions. It was found that the MDV model led to a better match against x-ray measurements of fuel density in the near-nozzle region. In contrast to the HRM, the MDV model was able to reproduce the vaporization process in the mixing zone at the edge of the fuel jet, which aligns with the expected physics. This resulted in substantial differences in the prediction of other flow characteristics such as mixture temperature and pressure. Furthermore, this work demonstrates that evaporation timescales have a considerable effect on the MDV model's predictions, as shown by a parametric study in which a time factor was introduced to mimic the effect of different timescales due to different phase change mechanisms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗