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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 469 records · Page 26

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Evaluation of obstacle modelling approaches for resource assessment and small wind turbine siting: case study in the northern Netherlands

Abstract. Growth in adoption of distributed wind turbines for energy generation is significantly impacted by challenges associated with siting and accurate estimation of the wind resource. Small turbines, at hub heights of 40 m or less, are greatly impacted by terrestrial obstacles such as built structures and vegetation that can cause complex wake effects. While some progress in high-fidelity complex fluid dynamics (CFD) models has increased the potential accuracy for modelling the impacts of obstacles on turbulent wind flow, these models are too computationally expensive for practical siting and resource assessment applications. To understand the efficacy of available models in situ, this study evaluates classic and commonly used methods alongside new state-of-the-art lower-order models derived from CFD simulations and machine learning approaches. This evaluation is conducted using a subset of an extensive original dataset of measurements from more than 300 operational wind turbines in the northern Netherlands. The results show that data-driven methods (e.g. machine learning and statistical modelling) are most effective at predicting production at real sites with an average error in annual energy production of 2.5 %. When sufficient data may not be available de novo to support these data-driven approaches, models derived from high-fidelity simulations show promise and reliably outperform classic methods. On average these models have 6.3 %–11.5 % error compared with 26 % for classic methods and 27 % baseline error for reanalysis data without obstacle correction. While more performant on average, these methods are also sensitive to the quality of obstacle descriptions and reanalysis inputs.

17 WIND ENERGY↗

DOE OSTI2021

An analysis of gamma-ray data collected at traffic intersections in Northern Virginia

Gamma-ray spectral data were collected from sensors mounted to traffic signals around Northern Virginia. The data were collected over a span of approximately fifteen months. A subset of the data were analyzed manually and subsequently used to train machine-learning models to facilitate the evaluation of the remaining 50k anomalous events identified in the dataset. We describe the analysis approach used here and discuss the results in terms of radioisotope classes and frequency patterns over day-of-week and time-of-day spans. Data from this work has been archived and is available for future and ongoing research applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Low-Temperature Geothermal Play Fairway Analysis for the Denver Basin

This project is part of a national initiative to showcase the benefits of incorporating low-temperature geothermal resource assessment into the deployment of geothermal heating, combined heat and power (CHP), and geothermal direct-use (GDU) technologies. The initiative was established to accelerate the country's decarbonization efforts by identifying potential for low-temperature geothermal resource utilization (<150 degrees C, e.g., CHP and GDU) in selected sedimentary basins with numerous population centers. The play fairway analysis (PFA) methodologies in this study were adapted from previous PFA investigations of sedimentary basin geothermal play types (SBGPTs) that evaluated the potential for low-temperature resources (<150 degrees C). Workflows, relevant datasets, a new Python library, and common and composite geological criteria maps are utilized to develop low-temperature geothermal resource favorability maps for the Denver Basin, a sedimentary basin spanning Colorado, Nebraska, and Wyoming. The replication of these methodologies in other SBGPTs can evaluate potential for low-temperature resources. To facilitate future assessment of low-temperature geothermal resources in SBGPTs, this project provides PFA workflows, data, tools, and favorability maps that will ultimately support the utilization of low-temperature geothermal resources in sedimentary basins.

combined heat and power↗

DOE OSTI2020

The ARM Data-oriented Metrics and Diagnostics Package for Climate Models - A New Tool for Evaluating Climate Models with Field Data

The U.S. Department of Energy (DOE) Atmospheric Radiation Measurement (ARM) program User Facility produces ground-based long-term continuous unique measurements for atmospheric state, precipitation, turbulent fluxes, radiation, aerosol, cloud and the land surface, which are collected at multiple sites. These comprehensive datasets have been widely used to calibrate climate models and are proven to be invaluable for climate model development and improvement. This article introduces an evaluation package to facilitate the use of ground-based ARM measurements in climate model evaluation. The ARM data-oriented metrics and diagnostics package (ARM-DIAGS) includes both ARM observational datasets and a Python-based analysis toolkit for computation and visualization. The observational datasets are compiled from multiple ARM data products and specifically tailored for use in climate model evaluation. In addition, ARM-DIAGS also includes simulation data from models participating the Coupled Model Inter-comparison Project (CMIP), which will allow climate-modeling groups to compare a new, candidate version of their model to existing CMIP models. The analysis toolkit is designed to make the metrics and diagnostics quickly available to the model developers.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

AviSense: A Real-time System for Detection, Classification, and Analysis of Aviation Signals

Wireless systems are an integral part of aviation. Apart from their apparent use in air-to-ground communication, wireless systems play a crucial role in avionic functions including navigation and landing. An interference-free wireless environment is therefore critical for the uninterrupted operation and safety of an aircraft. Hence, there is an urgency for airport facilities to acquire the capability to continuously monitor aviation frequency bands for real-time detection of interference and anomalies. To meet this critical need, we design and build AviSense, an SDR-based real-time, versatile system for monitoring aviation bands. AviSense detects and characterizes signal activities to enable practical and effective anomaly detection. We identify and tackle the challenges posed by a diverse set of critical aviation bands and technologies. We evaluate our methodology with real-world aviation signal measurements and two custom datasets of anomalous signals. We find that our signal classification capability achieves a true positive rate of ~99%, with few exceptions, and a false positive rate of less than 4%. We also demonstrate that AviSense can effectively distinguish between different types of anomalies. We build and evaluate a prototype implementation of AviSense that supports distributed monitoring.

42 ENGINEERING↗

DOE OSTI2025

CGSim: A Simulation Framework for Large Scale Distributed Computing Environment

Large-scale distributed computing infrastructures such as the Worldwide LHC Computing Grid (WLCG) require comprehensive simulation tools for evaluating performance, testing new algorithms, and optimizing resource allocation strategies. However, existing simulators suffer from limited scalability, hardwired algorithms, lack of real-time monitoring, and inability to generate datasets suitable for modern machine learning approaches. We present CGSim, a simulation framework for large-scale distributed computing environments that addresses these limitations. Built upon the validated SimGrid simulation framework, CGSim provides high-level abstractions for modeling heterogeneous grid environments while maintaining accuracy and scalability. Key features include a modular plugin mechanism for testing custom workflow scheduling and data movement policies, interactive real-time visualization dashboards, and automatic generation of event-level datasets suitable for AI-assisted performance modeling. We demonstrate CGSim’s capabilities through a comprehensive evaluation using production ATLAS PanDA workloads, showing significant calibration accuracy improvements across WLCG computing sites. Scalability experiments show near-linear scaling for multi-site simulations, with distributed workloads achieving 6 × better performance compared to single-site execution. The framework enables researchers to simulate WLCG-scale infrastructures with hundreds of sites and thousands of concurrent jobs within practical time budget constraints on commodity hardware.

Vatsavai, Sairam Sri [Brookhaven National Laborato↗

DOE OSTI2021

Quantitative resilience evaluation on recovery from emergency situations in nuclear power plants

Here, this paper mainly introduces how to develop a resilience evaluation model by quantifying the relationship between resilience and resilience components in regard to recovering from emergency situations in nuclear power plants (NPPs). It is an extension of the author’s previous researches. To develop the model, the first step was to analyze event reports published in Republic of Korea in terms of resilience factors from different safety perspectives. Second, statistical methods such as factor analysis, principal component analysis, and multivariate regression analysis were applied to the dataset to identify relations among resilience factors and develop a quantitative resilience evaluation model for recovery from emergency situations in NPPs. Third, the model was validated using the recent event report data released in Korea. Lastly, we present a discussion on how to apply the quantitative resilience evaluation model to results from stress tests performed in Korea.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2024

Shorter function summaries for finite state machine-based high consequence systems using logic synthesis and tautologies (Final Report LDRD 24-1302)

Computer programs are often viewed as collections of functions – each function has parameters (inputs) and computes a return value, and each has potential side effects that modify program state (outputs). In this research, a Sandia symbolic execution tool designed to support “human-in-the-loop” analysis was modified to automatically create “function summaries,” and a new tool, “diaboolical,” was created to support enhancing readability of the summary using a novel approach to bit-vector simplification that leverages logic synthesis and tautologies. For this effort, students at Auburn University created several finite state machines (FSMs) to serve as exemplars for high-consequence systems. Function summaries for each of the machines were obtained, and then portions of the summaries were simplified using both diaboolical and the simplification procedure of a popular SMT solver. A comparison of the results shows that diaboolical can often produce smaller function summaries, with expression length improvements over the unsimplified function summaries ranging from 0% to 90% for diaboolical and 0% to 65% for the SMT solver, though diaboolical had a significantly greater cost in time. Diaboolical was evaluated against a collection of “arbitrary” C-code as well as FSM exemplars, and for both datasets it achieved an approximately 10% improvement in expression length compared to simplifications that could be obtained using existing techniques. Function summaries can assist assurance efforts that evaluate existing systems and their executable code. A smaller function summary is likely easier for humans to understand and could thus increase the ability and efficacy of assurance practices centered around the analysis of executable artifacts.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

An overview of the Western United States Dynamically Downscaled Dataset (WUS-D3)

Abstract. Predicting future climate change over a region of complex terrain, such as the western United States (US), remains challenging due to the low resolution of global climate models (GCMs). Yet the climate extremes of recent years in this region, such as floods, wildfires, and drought, are likely to intensify further as climate warms, underscoring the need for high-quality and high-resolution predictions. Here, we present an ensemble of dynamically downscaled simulations over the western US from 1980–2100 at 9 km grid spacing, driven by 16 latest-generation GCMs. This dataset is titled the Western US Dynamically Downscaled Dataset (WUS-D3). We describe the challenges of producing WUS-D3, including GCM selection and technical issues, and we evaluate the simulations' realism by comparing historical results to temperature and precipitation observations. The future downscaled climate change signals are shaped in physically credible ways by the regional model's more realistic coastlines and topography. (1) The mean warming signals are heavily influenced by more realistic snowpack. (2) Mean precipitation changes are often consistent with wetting on the windward side of mountain complexes, as warmer, moister air masses are uplifted orographically during precipitation events. (3) There are large fractional precipitation increases on the lee side of mountain complexes, leading to potentially significant changes in water resources and ecology in these arid landscapes. (4) Increases in precipitation extremes are generally larger than in the GCMs, driven by locally intensified atmospheric updrafts tied to sharper, more realistic gradients in topography. (5) Changes in temperature extremes are different from what is expected by a shift in mean temperature and are shaped by local atmospheric dynamics and land surface feedbacks. Because of its high resolution, comprehensiveness, and representation of relevant physical processes, this dataset presents a unique opportunity to evaluate societally relevant future changes in western US climate.

Rahimi, Stefan (ORCID:0000000331884462)↗

DOE OSTI2025

HexWeather: Hexagonal Spatial Data Aggregation for Weather-Driven Grid Resilience Analysis

Extreme weather accounts for over 8 0 % of major U.S. power outages since 2000, highlighting the need for spatial tools that align weather data with the irregular boundaries of electric infrastructure. This paper introduces HexWeather, a modular, resolution-aware framework for aggregating historical and forecasted weather data using Uber's H3 hexagonal spatial indexing system. Unlike traditional methods that rely on state or county-level grids, HexWeather enables weather analysis across custom geographies such as utility service areas where public datasets are often unavailable or misaligned. Using Open-Meteo data, we evaluate how H3 resolution affects anomaly detection, spatial variability, and forecast uncertainty across three scales: state, county, and utility. Results show that while coarse resolutions suffice for broad trend tracking, finer resolutions are essential for identifying localized variability and operational risks. By applying metrics like Z-score standard deviation and interquartile range, HexWeather quantifies the spatial spread of both historical anomalies and forecasted conditions, allowing users to assess resolution adequacy for each analysis. This framework supports rapid weather data reuse, reproducible anomaly detection, and predictive modeling for infrastructure resilience. By bridging spatial misalignment in traditional datasets and enabling retrospective and forward-looking analysis within the same pipeline, HexWeather lays the groundwork for better post event analysis, outage prediction, and resilience planning.

Morris, Jacob [ORNL]↗

DOE OSTI2023

Accelerating Random Forest Classification on GPU and FPGA

Random Forests (RFs) are a commonly used machine learning method for classification and regression tasks spanning a variety of application domains, including bioinformatics, business analytics, and software optimization. While prior work has focused primarily on improving performance of the training of RFs, many applications, such as malware identification, cancer prediction, and banking fraud detection, require fast RF classification. In this work, we accelerate RF classification on GPU and FPGA. In order to provide efficient support for large datasets, we propose a hierarchical memory layout suitable to the GPU/FPGA memory hierarchy. We design three RF classification code variants based on that layout, and we investigate GPU- and FPGA-specific considerations for these kernels. Our experimental evaluation, performed on an Nvidia Xp GPU and on a Xilinx Alveo U250 FPGA accelerator card using publicly available datasets on the scale of millions of samples and tens of features, covers various aspects. First, we evaluate the performance benefits of our hierarchical data structure over the standard compressed sparse row (CSR) format. Second, we compare our GPU implementation with cuML, a machine learning library targeting Nvidia GPUs. Third, we explore the performance/accuracy tradeoff resulting from the use of different tree depths in the RF. Finally, we perform a comparative performance analysis of our GPU and FPGA implementations. Our evaluation shows that for high accuracy targets, our GPU implementation yields 5-9x speedup over CSR, and up to a 2x speedup over cuML.

FPGA, Xilinx FPGA, GPU, Random Forest classificati↗

DOE OSTI2020

Multitask Recommender Systems for Cancer Drug Response

The problem we are currently trying to address is that there are many types of cancer drugs and many types of cancers and there is not always experimental data for a specific cancer type and cancer drug interaction. While there is a large possible set of feasible drug and cancer combinations, testing each pair is not realistic due to the high monetary cost of cell-based assays. Thus, this leaves researchers with a difficult choice of what drugs they should test on specific cancer types. This issue is known as the cold-start problem. Our focus is on developing recommender systems capable of addressing the cold-start problem as it relates to interaction between cancer types and cancer drugs. One of the most effective ways to address the cold-start problem is through large data analysis, however due to the cost prohibitive nature of cancer research the largest available data set size is the Genomics of Drug Sensitivity in Cancer with 494,973 genomic associations. To achieve optimal model performance on the cold-start problem, it is advantageous to employ multitask algorithms that are capable of transferring information between cancer datasets. The aim of this report is to draw from adaptations and state of the art developments in both algorithms for recommender systems and multitask learning to model the interaction between cancer cell lines and cancer drugs. Cancer cell lines are defined by the US National Cancer Institute as "cancer cells that keep dividing and growing over time, under certain conditions in a laboratory". This paper will focus on evaluating the performance of Neural Collaborative Filtering and Gaussian Processes, as well as their multitask adaptations, on cancer datasets from CCLE, NCI60, GDSC and CTRP. These methods will be evaluated on model performance in regression prediction but also in interpretability.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2024

Enhancing Solar Power Forecasting with Regularized Constrained Quantile Regression Averaging and Bootstrapping Techniques

Probabilistic solar power forecasting (SPF) plays an essential role in optimizing power-grid operations by quantifying the forecast uncertainty. To improve the accuracy and robustness of probabilistic SPF, this paper introduces the regularized constrained quantile regression averaging (rCQRA) method to combine outputs from multiple PSPF models. In addition, a bootstrapping method was used to quantify model uncertainty, providing insights into the reliability and significance of each ensemble component. To evaluate its efficacy, the proposed rCQRA method is used to integrate four PSPF methods. The resulting SPF models are trained and validated using a real-world six-year dataset from a rooftop solar plant in the USA. The performance of the proposed rCQRA method is evaluated and compared with two benchmark methods under three categories of weather conditions. It is shown that the rCQRA method has superior performance in its forecast reliability, sharpness, and accuracy.

Ensemble learning, probabilistic solar power forec↗

DOE OSTI2022

Multimodal sensor fusion framework for residential building occupancy detection

For several years now, smart building energy systems have been a research area of intensive activity. In light of the increasing need for sustainable buildings and energy systems, this trend motivates an increasing need for a solution to reduce carbon dioxide emissions and improve energy efficiency. This work proposes a high-performing and transferable occupancy detection framework that combines sensor data from different data modalities, including time series environmental data (temperature, humidity, and illuminance), image data, and acoustic energy data using ensemble method. To draw out the best prediction performance in each modality, the proposed framework was developed, including various models that were designed to learn the occupancy patterns reflected in the physical data streams. To tackle the time series environmental data, we designed two variants of an occupancy detection spatiotemporal pattern network (Occ-STPN) that performs both feature level and decision level fusion, respectively. We also propose a new metric; the fading memory mean square error (FMMSE), that provides a fair evaluation and penalization of delayed occupancy predictions. Multiple open-sourced datasets, including the Electricity Consumption and Occupancy and the University of California, Irvine's (UCI) building occupancy detection dataset, along with our own real data collected from six different houses, were used to validate the algorithms' performance. The experimental results presented herein break down the performance for each sensing modality, and a detailed analysis of the performance is also discussed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Energy storage planning for enhanced resilience of power systems against wildfires and heatwaves

Extreme weather events pose significant risks to power grid stability due to their severe consequences and potential for widespread failures. Energy storage systems hold great potential for enhancing grid resilience against such events by providing reliable power during peak demand periods. However, accurately quantifying the size, location, and investment costs of new energy storage assets is a complex task, as energy storage planning decisions depend on the investment choices of other generation technologies and the integration of new transmission projects. Here, this paper presents a novel capacity expansion planning framework that simultaneously optimizes investments in energy storage, generation, and transmission, determining their optimal size, location, and type, while incorporating extreme weather events into long-term planning. More specifically, our stress-event-informed planning framework integrates the impact of heatwaves and wildfires into the planning process, identifying least-cost investment solutions that comply with policy goals and enhance grid resilience. The proposed framework employs machine-learning-based modeling to project heatwave-induced loads and performance-based risk assessment to evaluate wildfire-driven transmission line derates. Using industry-standard datasets to accurately represent the transmission topology of the Western Interconnection (WI) system, the proposed framework is applied to the WI 40-zone system, with investment decisions reported for the years 2030, 2035, and 2040. Simulation results reveal that with just a 10% increase in investment costs, resilience against extreme events can be significantly improved, with investment decisions heavily favoring energy storage, particularly 4-hour energy storage systems.

25 ENERGY STORAGE↗

DOE OSTI2023

Exact solution of burst pressure for thick-walled pipes using the flow theory of plasticity

This paper develops an exact solution of burst pressure for defect-free, thick-walled pipes using the flow theory of plasticity in terms of the average shear stress yield criterion (or Zhu-Leis yield criterion). The pipe steel is assumed to obey the power-law strain hardening rule, and large plastic deformation is described by the finite strain theory. On this basis, internal pressure is obtained as a power series function of the effective strains on the inside and outside surfaces of the thick-walled pipe with use of the second Bernoulli numbers. At burst failure, the Zhu-Leis flow solution of burst pressure is determined as a power series solution, and the burst effective strains, the burst effective stresses, and the burst pressure are functions of the diameter ratio (D o / D i ), strain hardening exponent (n), and ultimate tensile strength (UTS). Similarly, the Tresca and von Mises flow solutions of burst pressure are also determined as a power series solution in terms of the Tresca and von Mises yield criteria. A general closed-from exact solution of burst pressure is then proposed for the three yield criteria, and the results showed that the proposed exact solution matches well with the power series solution for each yield criterion. Moreover, the von Mises flow solution is an upper bound prediction, the Tresca flow solution is a lower bound prediction, and the Zhu-Leis flow solution is an intermediate prediction that agrees well with the finite element analysis results of burst pressure for thick-walled pipes. Furthermore, two datasets of full-scale burst tests are then utilized to evaluate and validate the proposed flow solutions of burst pressure for both thin and thick-walled pipes.

42 ENGINEERING↗

DOE OSTI2021

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗

DOE OSTI2024

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗