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 415 records · Page 23

sPHENIX heavy flavor jet tagging studies in p+p at $\sqrt{s_{NN}}=200~GeV$

Heavy-flavor jets, which are initiated from heavy quarks, are ideal probes for studying flavor dependent parton energy loss. We report on the performance of jet flavor tagging using two Neural Network Machine Learning (ML) models: the Long Short-Term Memory (LSTM) model and an Attention-based Neural Network, in simulations of 200 GeV p + p collisions. The tagging performance of bottom quark initiated jets with both ML models surpasses that of the traditional cut-based method. Technical details, including sample and kinematic variable selections, the machine learning training and testing setup with parameter tuning, and outcome comparisons, will be discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Selection of a Cutting Tool by Means of a Digital Model

A digital model of a cutting tool produced by neural-network modeling is considered. By means of this model, the composition and structure of a wear-resistant coating may be optimized. The machining conditions that ensure maximum wear resistance of the tool may also be identified.

42 ENGINEERING↗

Isochronic Evolution and the Radioactive Decay of r-process Nuclei

Abstract We report on the creation and application of a novel decay network that uses the latest data from experiment and evaluation. We use the network to simulate the late-time phase of the rapid neutron capture ( r ) process. In this epoch, the bulk of nuclear reactions, such as radiative capture, have ceased, and nuclear decays are the dominant transmutation channels. We find that the decay from short-lived to long-lived species naturally leads to an isochronic evolution in which nuclei with similar half-lives are populated at the same time. We consider random perturbations along each isobaric chain to initial solar-like r -process compositions to demonstrate the isochronic nature of the late-time phase of the r -process. Our analysis shows that detailed knowledge of the final isotopic composition allows for the prediction of late-time evolution with a high degree of confidence despite uncertainties that exist in astrophysical conditions and the nuclear physics properties of the most neutron-rich nuclei. We provide the time-dependent nuclear composition in the Appendix as supplemental material.

79 ASTRONOMY AND ASTROPHYSICS↗

pynucastro: A Python Library for Nuclear Astrophysics

We describe pynucastro 2.0, an open-source library for interactively creating and exploring astrophysical nuclear reaction networks. We demonstrate new methods for approximating rates and use detailed balance to create reverse rates, show how to build networks and determine whether they are appropriate for a particular science application, and discuss the changes made to the library over the past few years. Finally, we demonstrate the validity of the networks produced and share how we use pynucastro networks in simulation codes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Semivolatile POA and parameterized total combustion SOA in CMAQv5.2: impacts on source strength and partitioning

Abstract. Mounting evidence from field and laboratory observations coupled with atmospheric model analyses shows that primary combustion emissions of organic compounds dynamically partition between the vapor and particulate phases, especially as near-source emissions dilute and cool to ambient conditions. The most recent version of the Community Multiscale Air Quality model version 5.2 (CMAQv5.2) accounts for the semivolatile partitioning and gas-phase aging of these primary organic aerosol (POA) compounds consistent with experimentally derived parameterizations. We also include a new surrogate species, potential secondary organic aerosol from combustion emissions (pcSOA), which provides a representation of the secondary organic aerosol (SOA) from anthropogenic combustion sources that could be missing from current chemical transport model predictions. The reasons for this missing mass likely include the following: (1) unspeciated semivolatile and intermediate volatility organic compound (SVOC and IVOC, respectively) emissions missing from current inventories, (2) multigenerational aging of organic vapor products from known SOA precursors (e.g., toluene, alkanes), (3) underestimation of SOA yields due to vapor wall losses in smog chamber experiments, and (4) reversible organic compounds–water interactions and/or aqueous-phase processing of known organic vapor emissions. CMAQ predicts the spatially averaged contribution of pcSOA to OA surface concentrations in the continental United States to be 38.6 and 23.6 % in the 2011 winter and summer, respectively. Whereas many past modeling studies focused on a particular measurement campaign, season, location, or model configuration, we endeavor to evaluate the model and important uncertain parameters with a comprehensive set of United States-based model runs using multiple horizontal scales (4 and 12 km), gas-phase chemical mechanisms, and seasons and years. The model with representation of semivolatile POA improves predictions of hourly OA observations over the traditional nonvolatile model at sites during field campaigns in southern California (CalNex, May–June 2010), northern California (CARES, June 2010), the southeast US (SOAS, June 2013; SEARCH, January and July, 2011). Model improvements manifest better correlations (e.g., the correlation coefficient at Pasadena at night increases from 0.38 to 0.62) and reductions in underprediction during the photochemically active afternoon period (e.g., bias at Pasadena from −5.62 to −2.42 µg m−3). Daily averaged predictions of observations at routine-monitoring networks from simulations over the continental US (CONUS) in 2011 show modest improvement during winter, with mean biases reducing from 1.14 to 0.73 µg m−3, but less change in the summer when the decreases from POA evaporation were similar to the magnitude of added SOA mass. Because the model-performance improvement realized by including the relatively simple pcSOA approach is similar to that of more-complicated parameterizations of OA formation and aging, we recommend caution when applying these more-complicated approaches as they currently rely on numerous uncertain parameters. The pcSOA parameters optimized for performance at the southern and northern California sites lead to higher OA formation than is observed in the CONUS evaluation. This may be due to any of the following: variations in real pcSOA in different regions or time periods, too-high concentrations of other OA sources in the model that are important over the larger domain, or other model issues such as loss processes. This discrepancy is likely regionally and temporally dependent and driven by interferences from factors like varying emissions and chemical regimes.

54 ENVIRONMENTAL SCIENCES↗

APHiD: Hierarchical Task Placement to Enable a Tapered Fat Tree Topology for Lower Power and Cost in HPC Networks

The power and procurement cost of bandwidth in system-wide networks has forced a steady drop in the byte/flop ratio. This trend of computation becoming faster relative to the network is expected to hold. In this paper, we explore how cost-oriented task placement enables reducing the cost of system-wide networks by enabling high performance even on tapered topologies where more bandwidth is provisioned at lower levels. We describe APHiD, an efficient hierarchical placement algorithm that uses new techniques to improve the quality of heuristic solutions and reduces the demand on high-level, expensive bandwidth in hierarchical topologies. We apply APHiD to a tapered fat-tree, demonstrating that APHiD maintains application scalability even for severely tapered network configurations. Using simulation, we show that for tapered networks APHiD improves performance by more than 50% over random placement and even 15% in some cases over costlier, state-of-the-art placement algorithms.

Michelogiannakis, George↗

Market-based Co-optimization of Energy and Ancillary Services with Distributed Energy Resource Flexibilities

Energy storage systems and flexible loads have attracted significant interests due to their capabilities to provide various grid services. In this paper, the flexibilities are optimally allocated among multiple distributed energy resource aggregators with energy storage systems and flexible buildings by the utility coordinator through market-based co-optimization. An iterative market clearing algorithm is developed to determine the optimal energy and ancillary service prices, with consideration of both local dynamics and network constraints. Simulation results demonstrate the effectiveness of the proposed algorithm and the benefits of co-optimizing the energy and ancillary service markets.

Ma, Ke↗

Toward designing effective exascale scientific computing workflows: experiences and best practices

Many fields within scientific computing have embraced advances in big-data analysis and machine learning, which often requires the deployment of large, distributed and complicated workflows that may combine training neural networks, performing simulations, running inference, and performing database queries and data analysis in asynchronous, parallel and pipelined execution frameworks. Such a shift has brought into focus the need for scalable, efficient workflow management solutions with reproducibility, error and provenance handling, traceability, and checkpoint-restart capabilities, among other needs. Here, we discuss challenges and best-practices for deploying exascale-generation computational science workflows on resources at the Oak Ridge Leadership Computing Facility (OLCF). We present our experiences with large-scale deployment of distributed workflows on the Summit supercomputer, including for bioinformatics and computational biophysics, materials science, and deep learning model optimization. We also present problems and solutions created by working within a Python-centric software base on traditional HPC systems, and discuss steps that will be required before the convergence of HPC, AI, and data science can be fully realized. Our results point to a wealth of exciting new possibilities for harnessing this convergence to tackle new scientific challenges.

Coletti, Mark↗

Exponential acceleration of macroscopic quantum tunneling in a Floquet Ising model

The exponential suppression of macroscopic quantum tunneling (MQT) in the number of elements to be reconfigured is an essential element of broken symmetry phases. This suppression is also a core bottleneck in quantum algorithms, such as traversing an energy landscape in optimization, and adiabatic state preparation more generally. In this work, we demonstrate exponential acceleration of MQT through Floquet engineering with the application of a uniform, high frequency transverse drive field. Using the ferromagnetic phase of the transverse field Ising model in one and two dimensions as a prototypical example, we identify three phenomenological regimes as a function of drive strength. For weak drives, the system exhibits exponentially decaying tunneling rates but robust magnetic order; in the crossover regime at intermediate drive strength, we find polynomial decay of tunnelling alongside vanishing magnetic order; and at very strong drive strengths both the Rabi frequency and time-averaged magnetic order are approximately constant with increasing system size. We support these claims with extensive full wavefunction and tensor network numerical simulations, and theoretical analysis. An experimental test of these results presents a technologically important and novel scientific question accessible on NISQ-era quantum computers.

Grattan, George↗

A Generic FSC Wind Park EMT Model with IEEE Std 2800-Compliant Fault Ride-Through Capability

The modern power grid is seeing more and more electricity come from renewable sources like wind farms, which use sophisticated power electronics instead of traditional spinning generators. To keep everything running smoothly and meet industry standards such as IEEE 2800, these systems need smart control strategies. In our work, we built a flexible computer model of a full-scale wind farm converter that can handle grid disturbances without shutting down. When a fault or storm hits, the model’s built-in logic automatically adjusts the currents it sends to the grid and protects its internal energy storage, ensuring the wind farm stays connected and doesn’t damage its own equipment. Once the disturbance clears, the model restores normal operation seamlessly, so there’s no long interruption in power delivery. At the same time, it carefully regulates the voltage where the wind farm ties into the larger grid, helping to maintain safe voltage levels across the network. Our simulations show that this control setup not only meets all the requirements of IEEE Standard 2800 but also allows the wind farm to recover quickly and predictably, keeping the lights on no matter what happens on the grid.

17 WIND ENERGY↗

SuperNeuro: A Fast and Scalable Simulator for Neuromorphic Computing

In many neuromorphic workflows, simulators play a vital role for important tasks such as training spiking neural networks, running neuroscience simulations, and designing, implementing, and testing neuromorphic algorithms. Currently available simulators cater to either neuroscience workflows (e.g., NEST and Brian2) or deep learning workflows (e.g., BindsNET). Problematically, the neuroscience-based simulators are slow and not very scalable, and the deep learning-based simulators do not support certain functionalities that are typical of neuromorphic workloads (e.g., synaptic delay). In this paper, we address this gap in the literature and present SuperNeuro, which is a fast and scalable simulator for neuromorphic computing capable of both homogeneous and heterogeneous simulations as well as GPU acceleration. We also present preliminary results that compare SuperNeuro to widely used neuromorphic simulators such as NEST, Brian2, and BindsNET in terms of computation times. We demonstrate that SuperNeuro can be approximately 10×--300× faster than some of the other simulators for small sparse networks. On large sparse and large dense networks, SuperNeuro can be approximately 2.2×--3.4× faster than the other simulators, respectively.

Date, Prasanna↗

Differentiable hybrid neural network approach for enhancing reactor dynamics simulations

Reactor dynamics simulations provide essential insights into the time-dependent behavior of nuclear reactors under various operating conditions. However, high-fidelity simulations can be computationally intensive, requiring significant computational resources. Here, to address this challenge, this study employs a differentiable hybrid model that utilizes neural networks as a corrector to enhance the performance of a low-fidelity simulation, aligning its predictions with those of a high-fidelity simulation. Low-fidelity and high-fidelity simulations were obtained by adjusting the mesh size in the System Dynamics Analysis Tool. The differentiable hybrid model was trained in two approaches: time-step-wise and sequence-wise. It was then applied to simulate various transients in a molten salt reactor. Its performance was evaluated by comparing its responses to transients against those of the high-fidelity simulation. An additional approach was performed using a data-driven model to correct the low-fidelity simulation. In comparison, the differentiable hybrid model showed significant improvements in transient prediction, effectively addressing the limitations of the low-fidelity simulations. The results highlighted the robustness of the differentiable hybrid model in both training approaches. It delivered simulations that were at least 3.8 times faster than high-fidelity models. In the time-step-wise approach, it achieved at least a 39% improvement in accuracy. In the sequence-wise approach, it showed at least an 81% accuracy improvement over the full transient. This approach offers a promising path for improving computational efficiency without compromising accuracy in nuclear reactor simulations, making it suitable for real-time digital twin applications.

42 - ENGINEERING↗

dfnWorks: A discrete fracture network framework for modeling subsurface flow and transport

DFNWORKS is a parallelized computational suite to generate three-dimensional discrete fracture networks (DFN) and simulate flow and transport. Developed at Los Alamos National Laboratory over the past five years, it has been used to study flow and transport in fractured media at scales ranging from millimeters to kilometers. The networks are created and meshed using DFNGEN, which combines FRAM (the feature rejection algorithm for meshing) methodology to stochastically generate three-dimensional DFNs with the LaGriT meshing toolbox to create a high-quality computational mesh representation. The representation produces a conforming Delaunay triangulation suitable for high performance computing finite volume solvers in an intrinsically parallel fashion. Flow through the network is simulated in dfnFlow, which utilizes the massively parallel subsurface flow and reactive transport finite volume code PFLOTRAN. A Lagrangian approach to simulating transport through the DFN is adopted within DFNTRANS to determine pathlines and solute transport through the DFN. Example applications of this suite in the areas of nuclear waste repository science, hydraulic fracturing and CO 2 sequestration are also included.

42 ENGINEERING↗

Simulating, visualizing, and searching traffic in a software defined network

The present disclosure pertains to systems and methods for simulating data packet routing within a software defined network (“SDN”), visualizing the results of the simulation, and permitting a user to search the resulting simulation. In one specified embodiment, a system may receive from a user a simulation parameter associated with a packet to be simulated in the SDN. A packet based on the at least one simulation parameter may be generated. A response of the SDN to the packet may be simulated by identifying applicable traffic routing rules and identifying a subsequent destination based on the applicable traffic routing rules. A record of the subsequent destination may be added to the simulation result, and the process may continue until a terminating condition is satisfied.

42 ENGINEERING↗