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,531 records · Page 85

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↗

Physics-guided machine learning approaches to predict the ideal stability properties of fusion plasmas

One of the biggest challenges to achieve the goal of producing fusion energy in tokamak devices is the necessity of avoiding disruptions of the plasma current due to instabilities. The disruption event characterization and forecasting (DECAF) framework has been developed in this purpose, integrating physics models of many causal events that can lead to a disruption. Two different machine learning approaches are proposed to improve the ideal magnetohydrodynamic (MHD) no-wall limit component of the kinetic stability model included in DECAF. First, a random forest regressor (RFR), was adopted to reproduce the DCON computed change in plasma potential energy without wall effects for a large database of equilibria from the national spherical torus experiment (NSTX). This tree-based method provides an analysis of the importance of each input feature, giving an insight into the underlying physics phenomena. Secondly, a fully-connected neural network has been trained on sets of calculations with the DCON code, to get an improved closed form equation of the no-wall β limit as a function of the relevant plasma parameters indicated by the RFR. The neural network has been guided by physics theory of ideal MHD in its extension outside the domain of the NSTX experimental data. The estimated value has been incorporated into the DECAF kinetic stability model and tested against a set of experimentally stable and unstable discharges. Moreover, the neural network results were used to simulate a real-time stability assessment using only quantities available in real-time. Finally, the portability of the model was investigated, showing encouraging results by testing the NSTX-trained algorithm on the mega ampere spherical tokamak (MAST).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Inferring dark matter substructure with astrometric lensing beyond the power spectrum

Abstract Astrometry—the precise measurement of positions and motions of celestial objects—has emerged as a promising avenue for characterizing the dark matter population in our Galaxy. By leveraging recent advances in simulation-based inference and neural network architectures, we introduce a novel method to search for global dark matter-induced gravitational lensing signatures in astrometric datasets. Our method based on neural likelihood-ratio estimation shows significantly enhanced sensitivity to a cold dark matter population and more favorable scaling with measurement noise compared to existing approaches based on two-point correlation statistics. We demonstrate the real-world viability of our method by showing it to be robust to non-trivial modeled as well as unmodeled noise features expected in astrometric measurements. This establishes machine learning as a powerful tool for characterizing dark matter using astrometric data.

convolutional neural networks (1938)↗

Probing DNA clamps with single-molecule force spectroscopy

Detailed mechanisms of DNA clamps in prokaryotic and eukaryotic systems were investigated by probing their mechanics with single-molecule force spectroscopy. Specifically, the mechanical forces required for the Escherichia coli and Saccharomyces cerevisiae clamp opening were measured at the single-molecule level by optical tweezers. Steered molecular dynamics simulations further examined the forces involved in DNA clamp opening from the perspective of the interface binding energies associated with the clamp opening processes. In combination with additional molecular dynamics simulations, we identified the contact networks between the clamp subunits that contribute significantly to the interface stability of the S.cerevisiae and E. coli clamps. These studies provide a vivid picture of the mechanics and energy landscape of clamp opening and reveal how the prokaryotic and eukaryotic clamps function through different mechanisms.

59 BASIC BIOLOGICAL SCIENCES↗

Modeling and Control Using Stochastic Distribution Control Theory for Intersection Traffic Flow

In this work, we investigated stochastic distribution control theory-based traffic signal optimization to achieve a smooth and uniform flow of vehicles through signalized intersections. In this context, the static and linear dynamic stochastic distribution models were developed to express the relationship between the signal timing and the traffic queue length together with its probability density function. Two stochastic distribution control algorithms were designed to control the signal timing at intersections such that the probability density function of the traffic queue of each intersection road segment is made as narrow and as small as possible. Also, a recursive input-output traffic queue estimation model was proposed, which is data-driven and dynamic in nature, to calculate real-time traffic queue length using traffic signal timings and loop-detector data. The control algorithms were evaluated for a one-signal corridor, two-signal corridor, and 2 x 2 network of signalized intersections. MATLAB simulation examples are provided to demonstrate the use of the proposed algorithms and comparison to the existing widely-used semi-actuated control has been made. Desired results were obtained.

97 MATHEMATICS AND COMPUTING↗

Bounded-Confidence Models of Multidimensional Opinions with Topic-Weighted Discordance

People’s opinions on a wide range of topics often evolve over time through their interactions with others. Models of opinion dynamics primarily focus on one-dimensional opinions, which represent opinions on one topic. However, opinions on various topics are rarely isolated; instead, they can be interdependent and correlated. In a bounded-confidence model (BCM) of opinion dynamics, agents are receptive to each other only if their opinions are sufficiently similar. Here, we extend classical agent-based BCMs—namely, the Hegselmann–Krause BCM, which has synchronous interactions, and the Deffuant–Weisbuch BCM, which has asynchronous interactions—to a multidimensional setting, in which the opinions are multidimensional vectors representing opinions of different topics and opinions on different topics are interdependent. To measure opinion differences between agents, we introduce topic-weighted discordance functions that account for opinion differences in all topics. We define regions of receptiveness for our models, and we use them to characterize the steady-state opinion clusters and provide an analytical approach to compute these regions. In addition, we numerically simulate our models on various networks with initial opinions drawn from a variety of distributions. When initial opinions are correlated across different topics, our topic-weighted BCMs yield significantly different results in both transient and steady states compared to baseline models, where the dynamics of each opinion topic are independent.

Mathematics and Computing↗

Beyond the Hype: An Evaluation of Commercially Available Machine-Learning-Based Malware Detectors

There is a lack of scientific testing of commercially available malware detectors, especially those that boast accurate classification of never-before-seen (i.e., zero-day) files using machine learning (ML). Consequently, efficacy of malware detectors is opaque, inhibiting end users from making informed decisions and researchers from targeting gaps in current detectors. In this paper, we present a scientific evaluation of four prominent commercial malware detection tools to assist an organization with two primary questions: To what extent do ML-based tools accurately classify previously and never-before-seen files? Is purchasing a network-level malware detector worth the cost? To investigate, we tested each tool against 3,536 total files (2,554 or 72% malicious, 982 or 28% benign) of a variety of file types, including hundreds of malicious zero-days, polyglots, and APT-style files, delivered on multiple protocols. We present statistical results on detection time and accuracy, consider complementary analysis (using multiple tools together), and provide two novel applications of the recent cost-benefit evaluation procedure of Iannacone & Bridges. Although the ML-based tools are more effective at detecting zero-day files and executables, the signature-based tool might still be an overall better option. Both network-based tools provide substantial (simulated) savings when paired with either host tool, yet both show poor detection rates on protocols other than HTTP or SMTP. Our results show that all four tools have near-perfect precision but alarmingly low recall, especially on file types other than executables and office files—37% of malware, including all polyglot files, were undetected. Priorities for researchers and takeaways for end users are given. Code for future use of the cost model is provided.

97 MATHEMATICS AND COMPUTING↗