Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “evaluation datasets”

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

A lightweight, user-configurable detector ASIC digital architecture with on-chip data compression for MHz X-ray coherent diffraction imaging

Today, most X-ray pixel detectors used at light sources transmit raw pixel data off the detector ASIC. With the availability of more advanced ASIC technology nodes for scientific application, more digital functionalities from the computing domains (e.g., compression) can be integrated directly into a detector ASIC to increase data velocity. In this paper, we describe a lightweight, user-configurable detector ASIC digital architecture with on-chip compression which can be implemented in 130 nm technologies in a reasonable area on the ASIC periphery. In addition, we present a design to efficiently handle the variable data from the stream of parallel compressors. The architecture includes user-selectable lossy and lossless compression blocks. The impact of lossy compression algorithms is evaluated on simulated and experimental X-ray ptychography datasets. This architecture is a practical approach to increase pixel detector frame rates towards the continuous 1 MHz regime for not only coherent imaging techniques such as ptychography, but also for other diffraction techniques at X-ray light sources.

47 OTHER INSTRUMENTATION↗

Optimizing Error-Bounded Lossy Compression for Scientific Data on GPUs

Error-bounded lossy compression is a critical technique for significantly reducing scientific data volumes. With ever-emerging heterogeneous high-performance computing (HPC) architecture, GPU-accelerated error-bounded compressors (such as CUSZ and cuZFP) have been developed. However, they suffer from either low performance or low compression ratios. To this end, we propose CUSZ+ to target both high compression ratios and throughputs. We identify that data sparsity and data smoothness are key factors for high compression throughputs. Our key contributions in this work are fourfold: (1) We propose an efficient compression workflow to adaptively perform run-length encoding and/or variable-length encoding. (2) We derive Lorenzo reconstruction in decompression as multidimensional partial-sum computation and propose a fine-grained Lorenzo reconstruction algorithm for GPU architectures. (3) We carefully optimize each of CUSZ kernels by leveraging state-of-the-art CUDA parallel primitives. (4) We evaluate CUSZ+ using seven real-world HPC application datasets on V100 and A100 GPUs. Experiments show CUSZ+ improves the compression throughputs and ratios by up to 18.4x and 5.3x, respectively, over CUSZ on the tested datasets.

Tian, Jiannan↗

A General Framework for Error-controlled Unstructured Scientific Data Compression

Data compression plays a key role in reducing storage and I/O costs. Traditional lossy methods primarily target data on rectilinear grids and cannot leverage the spatial coherence in unstructured mesh data, leading to suboptimal compression ratios. We present a multi-component, error-bounded compression framework designed to enhance the compression of floating-point unstructured mesh data, which is common in scientific applications. Our approach involves interpolating mesh data onto a rectilinear grid and then separately compressing the grid interpolation and the interpolation residuals. This method is general, independent of mesh types and typologies, and can be seamlessly integrated with existing lossy compressors for improved performance. We evaluated our framework across twelve variables from two synthetic datasets and two real-world simulation datasets. The results indicate that the multi-component framework consistently outperforms state-of-the-art lossy compressors on unstructured data, achieving, on average, a 2.3 − 3.5× improvement in compression ratios, with error bounds ranging from 1 × 10 the −6 to 1×10−2. We further investigate impact of hyperparameters, such as grid spacing and error allocation, to deliver optimal compression ratios in diverse datasets.

Gong, Qian↗

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Autonomous Vehicle Sensing and Compute Load on a Chassis Dynamometer

The sensing and compute load auxiliary energy consumption in autonomous vehicles may be significant due to the large number of sensors and the high compute load from sensor processing and route planning. To understand this issue, this study investigates the top-down energy usage of an electric 2015 Kia Soul fully instrumented with state sensors and a state-specific computer for path planning and sensor processing. A chassis dynamometer was then used to evaluate the cases of (1) no sensors or computation, (2) only sensors operating, and (3) sensors plus compute load. The vehicle was operated autonomously on the dynamometer using a PolySync drive-kit with drive-by-wire longitudinal control. The DynoJet model 224xLC was used to adapt the eddy current dynamometer's road load parameters to comply with an Environmental Protection Agency drive schedule and to evaluate performance against the Argonne National Laboratory Digital Dynamometer Dataset. On the UDDS-HWFET combined driving cycle, the stock battery's range was reduced by 5.6% for sensors alone and 12.2% for sensors and compute load. These results show that the added sensing and compute auxiliary load from automated and autonomous systems is significant and that research efforts need to be spent investigating new energy efficient systems.

Brown, Nicholas E.↗

HAPPA: A Modular Platform for HPC Application Resilience Analysis with LLMs Embedded

High-performance computing (HPC) systems are increasingly vulnerable to soft errors, which pose significant challenges in maintaining computational accuracy and reliability. Predicting the resilience of HPC applications to these errors is crucial for robust code protection and detailed resilience analysis. In this study, we present HAppA, a modular platform designed for HPC Application Resilience Analysis. Embedding Large Language Models (LLMs), HAppA addresses understanding the context information of long code sequences typical in HPC applications. HAppA implements a novel code representation module that chunks the code into fixed-size segments and aggregates the embeddings of these segments. Three aggregation methods have been explored: MeanPooling, MaxPooling, and LSTM-based techniques. We built a DAtaset for REsilience analysis using Fault Injection (FI), named DARE. Using our DARE dataset, HAppA is trained for regression prediction tasks. Our evaluation results demonstrate the predictive accuracy of HAppA compared to other models, particularly noting that the LSTM-based aggregation method -- HAppA-LSTM -- achieves a mean squared error (MSE) of 0.078 for SDC prediction, surpassing the existing state-of-the-art PARIS model, which recorded an MSE of 0.1172. Additionally, HAppA with the KeyBERT model extracts a list of keywords representing the source code. A comprehensive importance analysis of these keywords further elucidates the code patterns contributing to the error rate. These findings highlight the effectiveness of HAppA in analyzing the resilience of HPC applications and establish a new benchmark for predictive accuracy in resilience.

Jiang, Hailong [Kent State University]↗

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

REDI – Readiness Engine for Data Integration

The Readiness Engine for Data Integration (REDI) is an open-source framework for automating, standardizing, and assessing the process of preparing scientific data for AI training. REDI implements a five-stage pipeline (ingest, preprocess, transform, structure, output) with per-stage provenance instrumentation via Flowcept, domain-aware transformation logic (PII anonymization, regridding, graph encoding, and more), and built-in readiness assessment and validation modes. REDI has been evaluated across climate, proteomics, materials science, and nuclear fusion datasets, demonstrating near-ideal parallel scaling to 100 nodes on OLCF's Frontier system. REDI is deployable as an agent-callable skill in coding environments such as Claude Code and OpenAI Codex, and is complemented by SetGo for FAIR compliance and catalog publication.

Brewer, Wesley [Oak Ridge National Laboratory (ORN↗

Anomaly Detection and Identification Using a Leave-One-Variable-Out Method

At nuclear power plants (NPPs), anomaly detection and identification (i.e., determining the causes of anomalies) are important tasks for ensuring the safe and efficient operation of NPPs. These tasks are currently labor-intensive and costly, and are made more difficult by the size and complexity of NPP systems. An alternative approach to conducting these tasks is to automate them, such as via the reconstruction-based contribution method, which is a well-researched unsupervised machine learning method that uses a data-driven model of anomaly-free behavior to detect events and then identify each variable’s contributions to those events. The present effort developed a novel contribution approach that utilized a leave-one-variable-out (LOVO) model, with which each variable is predicted using all the other variables. The novelty lay in transforming this model into a reconstruction model and modifying the identification algorithm to work with the new reconstruction model. To evaluate this method in a controlled environment, a synthetic dataset based on spring-mass-damper (SMD) systems (commonly found in mechanical engineering references) was used, with known anomalies introduced into the system. The proposed method successfully detected the anomalies and afforded insights into their causes, thus enabling the appropriate identifications to be made.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Using spatio-temporal graph neural networks to estimate fleet-wide photovoltaic performance degradation patterns

Accurate estimation of photovoltaic (PV) system performance is crucial for determining its feasibility as a power generation technology and financial asset. PV-based energy solutions offer a viable alternative to traditional energy resources due to their superior Levelized Cost of Energy (LCOE). A significant challenge in assessing the LCOE of PV systems lies in understanding the Performance Loss Rate (PLR) for large fleets of PV systems. Estimating the PLR of PV systems becomes increasingly important in the rapidly growing PV industry. Precise PLR estimation benefits PV users by providing real-time monitoring of PV module performance, while explainable PLR estimation assists PV manufacturers in studying and enhancing the performance of their products. However, traditional PLR estimation methods based on statistical models have notable drawbacks. Firstly, they require user knowledge and decision-making. Secondly, they fail to leverage spatial coherence for fleet-level analysis. Additionally, these methods inherently assume the linearity of degradation, which is not representative of real world degradation. To overcome these challenges, we propose a novel graph deep learning-based decomposition method called the Spatio-Temporal Graph Neural Network for fleet-level PLR estimation (PV-stGNN-PLR). PV-stGNN-PLR decomposes the power timeseries data into aging and fluctuation components, utilizing the aging component to estimate PLR. PV-stGNN-PLR exploits spatial and temporal coherence to derive PLR estimation for all systems in a fleet and imposes flatness and smoothness regularization in loss function to ensure the successful disentanglement between aging and fluctuation. We have evaluated PV-stGNN-PLR on three simulated PV datasets consisting of 100 inverters from 5 sites. Experimental results show that PV-stGNN-PLR obtains a reduction of 33.9% and 35.1% on average in Mean Absolute Percent Error (MAPE) and Euclidean Distance (ED) in PLR degradation pattern estimation compared to the state-of-the-art PLR estimation methods.

14 SOLAR ENERGY↗

Renewable Energy Potential Model: Hawaii Geothermal Supply Curves

This dataset extends the development of the Renewable Energy Potential (reV) model to include geothermal energy, with a specific focus on Hawaii. Provided here are the results of two scenarios that were modeled for geothermal energy in Hawaii: binary enhanced geothermal systems (EGS) at a depth of 2.5 km and hydrothermal binary systems at a depth of 1.5 km. The resource data for both scenarios were derived from Lautze and Haskins (2024) using an exponential method. The PFA probability of heat map was used as a look up table for which temperature gradient to use (Lautze and Haskins, 2024). The dataset provides geospatial and techno-economic details for evaluating geothermal energy potential. It includes spatial coordinates, estimated capacity factors, developable area, resource potential, and annual energy production metrics. Economic details such as levelized cost of electricity (LCOE), site development costs, transmission costs, and fixed-charge rates are also included. The reV model, originally developed for wind and solar energy, incorporates these variables to evaluate deployment constraints related to land use, environmental and cultural factors, and grid integration.

15 GEOTHERMAL ENERGY↗

Agricultural Impacts on Nitrogen Cycling: Climate and Air Pollution (Final Technical Report)

We have successfully added a parameterization of ammonia emissions from synthetic fertilizer and manure from agriculture to Earth System Models. We have evaluated how emissions change in the future and the processes driving these changes. We have examined the impact of agricultural ammonia emissions on present-day air quality and have evaluated the impact of resolving the emissions with high temporal resolution. We have also examined the impact of how Earth System Models treat the cycling of emissions in soils. Our code, the Flows of Agricultural Nitrogen – version 2 – model (FANv2) has been run in both the CLM framework and the ELM framework. To my knowledge the code has not yet been fully implemented into ELM. Volatilization of ammonia (NH3) from fertilizers and livestock wastes forms a significant pathway of nitrogen losses in agricultural ecosystems and constitutes the largest source of atmospheric emissions of NH3. We have provided a major update to the process model FAN (Flow of Agricultural Nitrogen), which evaluates NH3 emissions interactively within an Earth system model; in this work, the Community Earth System Model (CESM) is used. The updated version (FANv2) includes a more detailed treatment of both physical and agricultural processes, which allows the model to differentiate between the volatilization losses from animal housings, manure storage, grazed pastures, and the application of manure and different types of mineral fertilizers. The modeled ammonia emissions are first evaluated at a local scale against experimental data for various types of fertilizers and manure, and they are subsequently run globally to evaluate NH3 emissions for 2010–2015 based on gridded datasets of fertilizer use and livestock populations. Comparison of regional emissions shows that FANv2 agrees with previous inventories for North America and Europe and is within the range of previous inventories for China. However, due to higher NH3 emissions in Africa, India, and Latin America, the global emissions simulated by FANv2(48 Tg N) are 30 %–40 % higher than in the existing inventories.

54 ENVIRONMENTAL SCIENCES↗

Cybersecurity Center for Offshore Wind Energy (Final Project Report)

This project establishes a Cybersecurity Center for Offshore Wind Energy with the objective of designing and operating a cyber-physical testbed for wind energy farms (WEFs) that enables comprehensive cybersecurity research. The testbed incorporates a Supervisory Control and Data Acquisition (SCADA) system connected to turbine models via industrial-grade programmable logic controllers (PLCs) and remote terminal units (RTUs). It supports side-channel data acquisition, implementation and analysis of various cyberattack scenarios, and development of attack detection, mitigation, and best-practice guidance tailored to wind energy systems. During the project, the team expanded the number and fidelity of mathematical turbine models (MTMs), integrated these models with SCADA infrastructure, and deployed a scaled physical turbine and associated sensors. High-resolution operational and side-channel data streams were collected and used to refine machine-learning (ML)-based attack detection systems and to extend the WindCRAFT framework to multi-turbine threat scenarios. The project demonstrated a realistic, scalable environment for evaluating cyber threats, validated attack detection approaches using enriched datasets, and identified new multi-turbine and inter-turbine communication attack vectors. The resulting testbed, models, and security mechanisms provide a foundation for ongoing R&D and deployment of cyber-resilient offshore wind energy systems.

17 WIND ENERGY↗

Shallow cloud variability in Houston, Texas, during the ESCAPE and TRACER field experiments

Shallow convection plays an important role in Earth's climate system by regulating the vertical transport of heat, moisture, and momentum in the lower troposphere. Aerosols, large-scale meteorology, and low-level convergence influence the spatiotemporal variability in shallow convection, and the coastal urban area of Houston, Texas, is an ideal laboratory to investigate these complex interactions. Here, geostationary satellite and ground-based radar observations from June to September 2022 during the TRacking Aerosol Convection interactions ExpeRiment (TRACER) and Experiment of Sea Breeze Convection, Aerosols, Precipitation, and Environment (ESCAPE) field campaigns are used to characterize the spatial coverage, vertical extent, and precipitation fraction of shallow convective clouds. The fused operational remote sensing datasets over a 250 km × 250 km domain are evaluated against profiling observations. The domain-wide diurnal shallow cloud fractions are used to identify four distinct modes of shallow convection. In all clusters, the domain-wide cloud fractions are consistently higher than the domain-wide precipitation fractions, and shallow cloud fractions are higher over water than they are over land, while the shallow precipitation fractions show the opposite behavior. In the two modes with minimal deep cloud activity, shallow cloud frequency is highest over ocean in the early morning, and there is a transition to higher shallow cloud frequency over land by the afternoon in one cluster or to high shallow cloud frequencies everywhere by the afternoon in the other. Lastly, we find regions with higher shallow cloud top heights and a large region along the coastline where shallow clouds are more likely to precipitate.

54 ENVIRONMENTAL SCIENCES↗

An improved mechanistic model for ammonia volatilization in Earth system models: Flow of Agricultural Nitrogen version 2 (FANv2)

Abstract. Volatilization of ammonia (NH 3 ) from fertilizers and livestock wastes forms a significant pathway of nitrogen losses in agricultural ecosystems and constitutes the largest source of atmospheric emissions of NH 3 . This paper describes a major update to the process model FAN (Flow of Agricultural Nitrogen), which evaluates NH 3 emissions interactively within an Earth system model; in this work, the Community Earth System Model (CESM) is used. The updated version (FANv2) includes a more detailed treatment of both physical and agricultural processes, which allows the model to differentiate between the volatilization losses from animal housings, manure storage, grazed pastures, and the application of manure and different types of mineral fertilizers. The modeled ammonia emissions are first evaluated at a local scale against experimental data for various types of fertilizers and manure, and they are subsequently run globally to evaluate NH3 emissions for 2010–2015 based on gridded datasets of fertilizer use and livestock populations. Comparison of regional emissions shows that FANv2 agrees with previous inventories for North America and Europe and is within the range of previous inventories for China. However, due to higher NH 3 emissions in Africa, India, and Latin America, the global emissions simulated by FANv2 (48 Tg N) are 30 %–40 % higher than in the existing inventories.

Vira, Julius↗

Miscanthus carbon flux data for SABR and UIEF

This eddy covariance (EC) gap-filled and partitioned flux dataset for Miscanthus from the SABR and UIEF farms was collected to evaluate carbon fluxes during the establishment phase of Miscanthus. The goal of this research is to quantify net carbon exchange using the EC technique at two sites and assess how carbon uptake varies with different planting densities. The dataset is contains two .csv files.

Aslan Sungur, Guler (Rojda) [Department of Agronom↗

HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware

For a considerable time, large datasets containing problem instances have proven valuable for analyzing computer hardware, software, and algorithms. One notable example of the value of large datasets is ImageNet [1], a vast repository of images that has been instrumental in testing numerous deep learning packages. Similarly, in the domain of computational chemistry and materials science, the availability of extensive datasets such as the Protein Data Bank [2], the Materials Project [3], and QM9 [4] has greatly facilitated the evaluation of new algorithms and software approaches, while also promoting standardization within the field. These well-defined datasets and problem instances, in turn, serve as the foundation for creating benchmarking suites like MLPerf [5] and LINPACK [6], [7]. These suites enable fair and rigorous comparisons of different methodologies and solutions, fostering continuous advancements in various areas of computer science and beyond.

Sawaya, Nicolas PD↗

Prompt Phrase Ordering Using Large Language Models in HPC: Evaluating Prompt Sensitivity

Large language models (LLMs) have demonstrated effective performance in domain-specific tasks, often requiring a well-designed prompt to guide their responses. However, optimizing the right prompt is challenging due to prompt sensitivity—the phenomenon where small changes in the prompt can lead to significant variations in performance. In this study, we evaluate prompt performance by examining all permutations of independent phrases to investigate prompt sensitivity and robustness. We used two datasets: the GSM8k dataset, which assesses mathematical reasoning, and a custom template prompt for summarizing database metadata. Our goal was to evaluate the performance across all permutations of a sequence of prompt phrases. The study was conducted using the llama3-instruct- 7B model hosted on Ollama, with computations parallelized in a high-performance computing environment. By comparing the average index of phrases in the best and worst-performing prompts, we found that the order of independent phrases within a prompt significantly impacts LLM performance. Additionally, we used Hamming distance to assess changes between phrase orderings, concluding that prompt modifications can dramatically affect scores, often by almost random chance. These findings support existing research on prompt sensitivity. We discuss the challenges of prompt optimization, noting that altering phrases in a successful prompt does not always result in another successful prompt.

97 MATHEMATICS AND COMPUTING↗