Search NASA⌕ Search

SEARCH · Search NASA

Results for “simulation data”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Forced Oscillation Source Location in Power Systems Using MVMD-assisted DEF in TF Plane

Fast and accurate forced oscillation source location (FOSL) is critical for mitigating forced oscillations in power systems. Here, to overcome the shortcomings of traditional dissipating energy flow (DEF) in decomposing the forced oscillation components from the measurement responses, a multivariate variational mode decomposition (MVMD)-assisted FOSL is proposed in this paper to locate the forced oscillation sources from measurements in time-frequency (TF) plane. The multi-channel measurement matrix of each generator is formed, then the multi-channel modes are decomposed from the formed multi-channel measurement matrix using the MVMD. Further, the intrinsic mode functions (IMFs) associated with the forced oscillation mode are distinguished from the decomposed modes according to the relative energy weights. With the distinguished IMFs, the MVMD-assisted DEF calculation method is developed to locate the forced oscillation source. Finally, the performance of the proposed method is evaluated using the simulation data of the WECC 179-bus test system and IEEE-NASPI Oscillation Source Location Contest as well as the actual PMU data of ISO New England. The results validated the effectiveness and accuracy of the proposed method in the FOSL.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

FIRE: A Failure-Adaptive RL Framework for Edge Computing Migrations

In edge computing, users' service profiles are migrated between edge servers due to user mobility. Reinforcement Learning (RL) frameworks have been proposed to do so, often trained on simulated data. However, existing RL frameworks overlook occasional server failures, which although rare, impact latency-sensitive applications like AR/VR and real- time obstacle detection. These rare failures, being not adequately represented in historical training data, pose a challenge for data-driven RL algorithms. We introduce FIRE, a framework that adapts to rare events by training a RL policy in an edge computing digital twin environment. We propose FIRE-ImRE, an importance sampling-based Q-learning algorithm, which samples rare events proportionally to their impact on the value function. FIRE considers delay, migration, failure, and backup placement costs across individual and shared service profiles. We prove FIRE-ImRE's boundedness and convergence to optimality. Next, we introduce novel deep Q-learning (FIRE-ImDQL) and actor critic (FIRE-ImACRE) versions of our algorithm to enhance scalability. Here, we extend our framework to accommodate users with varying risk tolerances of rare failure events. Through trace-driven experiments, we show that FIRE reduces edge computing costs compared to vanilla RL and the greedy baseline in the event of failures.

Edge computing↗
DOE OSTI2020

eFESTA: Ensemble Feature Exploration with Surface Density Estimates

We propose surface density estimate (SDE) to model the spatial distribution of surface features-isosurfaces, ridge surfaces, and streamsurfaces-in 3D ensemble simulation data. The inputs of SDE computation are surface features represented as polygon meshes, and no field datasets are required (e.g., scalar fields or vector fields). The SDE is defined as the kernel density estimate of the infinite set of points on the input surfaces and is approximated by accumulating the surface densities of triangular patches. We also propose an algorithm to guide the selection of a proper kernel bandwidth for SDE computation. An ensemble Feature Exploration method based on Surface densiTy EstimAtes (eFESTA) is then proposed to extract and visualize the major trends of ensemble surface features. For an ensemble of surface features, each surface is first transformed into a density field based on its contribution to the SDE, and the resulting density fields are organized into a hierarchical representation based on the pairwise distances between them. The hierarchical representation is then used to guide visual exploration of the density fields as well as the underlying surface features. We demonstrate the application of our method using isosurface in ensemble scalar fields, Lagrangian coherent structures in uncertain unsteady flows, and streamsurfaces in ensemble fluid flows.

Computational modeling↗
DOE OSTI2024

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient species identification for Pacific salmon genetic monitoring programs

Abstract Genetic monitoring of Pacific salmon in the Columbia River basin provides crucial information to fisheries managers that is otherwise challenging to obtain using traditional methods. Monitoring programs such as genetic stock identification (GSI) and parentage‐based tagging (PBT) involve genotyping tens of thousands of individuals annually. Although rare, these large sample collections inevitably include misidentified species, which exhibit low genotyping success on species‐specific Genotyping‐in‐Thousands by sequencing (GT‐seq) panels. For laboratories involved in large‐scale genotyping efforts, diagnosing non‐target species and reassigning them to the appropriate monitoring program can be costly and time‐consuming. To address this problem, we identified 19 primer pairs that exhibit consistent cross‐species amplification among salmonids and contain 51 species informative variants. These genetic markers reliably discriminate among 11 salmonid species and two subspecies of Cutthroat Trout and have been included in species‐specific GT‐seq panels for Chinook Salmon, Coho Salmon, Sockeye Salmon, and Rainbow Trout commonly used for Pacific salmon genetic monitoring. The majority of species‐informative amplicons (16) were newly identified from the four existing GT‐seq panels, thus demonstrating a low‐cost approach to species identification when using targeted sequencing methods. A species‐calling script was developed that is tailored for routine GT‐seq genotyping pipelines and automates the identification of non‐target species. Following extensive testing with empirical and simulated data, we demonstrated that the genetic markers and accompanying script accurately identified species and are robust to missing genotypic data and low‐frequency, shared polymorphisms among species. Finally, we used these tools to identify Coho Salmon incidentally caught in the Columbia River Chinook Salmon sport fishery and used PBT to determine their hatchery of origin. These molecular and computing resources provide a valuable tool for Pacific salmon conservation in the Columbia River basin and demonstrate a cost‐effective approach to species identification for genetic monitoring programs.

Robinson, Zachary L.↗
DOE OSTI2020

Control-Oriented Modeling of Cycle-to-Cycle Combustion Variability at the Misfire Limit in SI Engines

A control-oriented model is presented that can capture the prior-cycle correlation of combustion cycles during conditions with high levels of exhaust gas recirculation (EGR). Combustion events are modeled in discrete time and the dynamic evolution is captured by the residual air, fuel, and inert gas trapped in the combustion chamber. The mathematical formulation of the model is presented together with the calibration procedure to emulate a particular engine operating condition. A cycle-to-cycle system identification methodology is described which allows regressing model parameters from experimental data. Simulations are presented and compared to real engine measurements to show the modeling potential for analysis and control of combustion events.

Maldonado Puente, Bryan↗
DOE OSTI2021

Study of energy response and resolution of the ATLAS Tile Calorimeter to hadrons of energies from 16 to 30 GeV

Three spare modules of the ATLAS Tile Calorimeter were exposed to test beams from the Super Proton Synchrotron accelerator at CERN in 2017. The detector’s measurements of the energy response and resolution to positive pions and kaons, and protons with energies ranging from 16 to 30 GeV are reported. The results have uncertainties of a few percent. They were compared to the predictions of the Geant4-based simulation program used in ATLAS to estimate the response of the detector to proton-proton events at the Large Hadron Collider. The determinations obtained using experimental and simulated data agree within the uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Improving the performance of cryogenic calorimeters with nonlinear multivariate noise cancellation algorithms

Abstract State-of-the-art physics experiments require high-resolution, low-noise, and low-threshold detectors to achieve competitive scientific results. However, experimental environments invariably introduce sources of noise, such as electrical interference or microphonics. The sources of this environmental noise can often be monitored by adding specially designed “auxiliary devices” (e.g. microphones, accelerometers, seismometers, magnetometers, and antennae). A model can then be constructed to predict the detector noise based on the auxiliary device information, which can then be subtracted from the true detector signal. Here, we present a multivariate noise cancellation algorithm which can be used in a variety of settings to improve the performance of detectors using multiple auxiliary devices. To validate this approach, we apply it to simulated data to remove noise due to electromagnetic interference and microphonic vibrations. We then employ the algorithm to a cryogenic light detector in the laboratory and show an improvement in the detector performance. Finally, we motivate the use of nonlinear terms to better model vibrational contributions to the noise in thermal detectors. We show a further improvement in the performance of a particular channel of the CUORE detector when using the nonlinear algorithm in combination with optimal filtering techniques.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Generative models for simulation of KamLAND-Zen

Abstract The next generation of searches for neutrinoless double beta decay ($$0 \nu \beta \beta $$ 0 ν β β ) are poised to answer deep questions on the nature of neutrinos and the source of the Universe’s matter–antimatter asymmetry. They will be looking for event rates of less than one event per ton of instrumented isotope per year. To claim discovery, accurate and efficient simulations of detector events that mimic$$0 \nu \beta \beta $$ 0 ν β β is critical. Traditional Monte Carlo (MC) simulations can be supplemented by machine-learning-based generative models. This work describes the performance of generative models that we designed for monolithic liquid scintillator detectors like KamLAND to produce accurate simulation data without a predefined physics model. We present their current ability to recover low-level features and perform interpolation. In the future, the results of these generative models can be used to improve event classification and background rejection by providing high-quality abundant generated data.

Physics↗
DOE OSTI2024

Citizen science for IceCube: Name that Neutrino

Name that Neutrino is a citizen science project where volunteers aid in classification of events for the IceCube Neutrino Observatory, an immense particle detector at the geographic South Pole. From March 2023 to September 2023, volunteers did classifications of videos produced from simulated data of both neutrino signal and background interactions. Name that Neutrino obtained more than 128,000 classifications by over 1800 registered volunteers that were compared to results obtained by a deep neural network machine-learning algorithm. Possible improvements for both Name that Neutrino and the deep neural network are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Characterization and identification of HPC applications at leadership computing facility

High Performance Computing (HPC) is an important method for scientific discovery via large-scale simulation, data analysis, or artificial intelligence. Leadership-class supercomputers are expensive, but essential to run large HPC applications. The Petascale era of supercomputers began in 2008, with the first machines achieving performance in excess of one petaflops, and with the advent of new supercomputers in 2021 (e.g., Aurora, Frontier), the Exascale era will soon begin. However, the high theoretical computing capability (i.e., peak FLOPS) of a machine is not the only meaningful target when designing a supercomputer, as the resources demand of applications varies. A deep understanding of the characterization of applications that run on a leadership supercomputer is one of the most important ways for planning its design, development and operation. In order to improve our understanding of HPC applications, user demands and resource usage characteristics, we perform correlative analysis of various logs for different subsystems of a leadership supercomputer. This analysis reveals surprising, sometimes counter-intuitive patterns, which, in some cases, conflicts with existing assumptions, and have important implications for future system designs as well as supercomputer operations. For example, our analysis shows that while the applications spend significant time on MPI, most applications spend very little time on file I/O. Combined analysis of hardware event logs and task failure logs show that the probability of a hardware FATAL event causing task failure is low. Combined analysis of control system logs and file I/O logs reveals that pure POSIX I/O is used more widely than higher level parallel I/O. Based on holistic insights of the application gained through combined and co-analysis of multiple logs from different perspectives and general intuition, we engineer features to "fingerprint" HPC applications. We use t-SNE (a machine learning technique for dimensionality reduction) to validate the explainability of our features and finally train machine learning models to identify HPC applications or group those with similar characteristic. To the best of our knowledge, this is the first work that combines logs on file I/O, computing, and inter-node communication for insightful analysis of HPC applications in production.

Liu, Zhengchun↗
DOE OSTI2022

geothermal_osr (Energy Predictor for Geothermal Open Source Reservoir) [SWR-22-23]

This is a repository with the tools developed for predicting energy produced at Open-Source Reservoir (OSR). It includes both simulation data for OSR, as well as Jupyter notebooks for training and evaluating prediction models. OSR was constructed based on the data from Brady Hot Springs reservoir (Nevada, USA) but has a number of sufficiently modified characteristics and does not disclose any sensitive data.

Duplyakin, Dmitry↗
DOE OSTI2024

eagles-project/asediag

Aerosol process analysis in model-native Spectral Element (SE) grid. Aerosol Diagnostics on Model Native Grid is a Python-based tool designed for diagnosing aerosol processes in E3SM. It is particularly designed to analyze simulation data on the model-native spectral element (SE) grid, soit is also known as Aerosol SE Diagnostics or “asediag”

Hassan, Taufiq↗
DOE OSTI2025

NOODLES Grid [SWR-25-93]

NOODLES Grid is a real-time visualization server for power system simulation data. It loads precomputed datasets, builds optimized instance renderings, and streams live interactive scenes to connected clients. It is built for high scalability, flexible visualization, and fast interaction. NOODLES is a cross-platform/device/tool protocol for collaborative visualization. NOODLES was Developed at the National Renewable Energy Laboratory (NREL) as a capability of the Insight Center https://www.nrel.gov/computational-science/insight-center.html

Brunhart-Lupo, Nicholas [National Renewable Energy↗
DOE OSTI2023

Comparing Regional Energy Consumption for Direct Drone and Truck Deliveries

Drone delivery, once thought of as fictitious, is becoming a reality with the efforts of both forward-looking enterprises and supportive government policies. This emerging mode of e-commerce delivery raises many concerns. One important concern is the energy efficiency of direct delivery drones compared with conventional delivery trucks at a regional systems level. Here, in this study, we develop and apply methods to quantify the regional energy impacts of drone delivery, then we assess these impacts and compare them with the impacts of truck delivery. To study this problem, we develop an optimization model that determines an optimal set of fulfillment centers (FCs) with variable service capacities that allow drones to make direct e-commerce deliveries. We adopt two drone delivery energy estimation models from the literature and use them as inputs to demonstrate the potential range of energy needs. We also develop another optimization model to account for the energy consumption of diesel trucks (DTs) and battery electric vehicles (BEVs). We test the models using validated simulation data for the Chicago metropolitan area in the U.S. to quantify the energy implications of these three delivery modes. For drone delivery, we further extend our analyses by considering the impact of wind speed and flight patterns. Our results show that direct delivery drones require 15.8% more energy than BEVs on an average windy day, and they need 15% more energy than DTs on a very windy day. We provide essential parameter values for reproducibility and list relevant open problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Quantifying shifts in natural selection on codon usage between protein regions: a population genetics approach

Codon usage bias (CUB), the non-uniform usage of synonymous codons, occurs across all domains of life. Adaptive CUB is hypothesized to result from various selective pressures, including selection for efficient ribosome elongation, accurate translation, mRNA secondary structure, and/or protein folding. Given the critical link between protein folding and protein function, numerous studies have analyzed the relationship between codon usage and protein structure. The results from these studies have often been contradictory, likely reflecting the differing methods used for measuring codon usage and the failure to appropriately control for confounding factors, such as differences in amino acid usage between protein structures and changes in the frequency of different structures with gene expression. Here we take an explicit population genetics approach to quantify codon-specific shifts in natural selection related to protein structure in S. cerevisiae and E. coli. Unlike other metrics of codon usage, our approach explicitly separates the effects of natural selection, scaled by gene expression, and mutation bias while naturally accounting for a region’s amino acid usage. Bayesian model comparisons suggest selection on codon usage varies only slightly between helix, sheet, and coil secondary structures and, similarly, between structured and intrinsically-disordered regions. Similarly, in contrast to previous findings, we find selection on codon usage only varies slightly at the termini of helices in E. coli. Using simulated data, we show this previous work indicating “non-optimal” codons are enriched at the beginning of helices in S. cerevisiae was due to failure to control for various confounding factors (e.g. amino acid biases, gene expression, etc.), and rather than selection to modulate cotranslational folding. Our results reveal a weak relationship between codon usage and protein structure, indicating that differences in selection on codon usage between structures are slight. In addition to the magnitude of differences in selection between protein structures being slight, the observed shifts appear to be idiosyncratic and largely codon-specific rather than systematic reversals in the nature of selection. Overall, our work demonstrates the statistical power and benefits of studying selective shifts on codon usage or other genomic features from an explicitly evolutionary approach. Limitations of this approach and future potential research avenues are discussed.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗