Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “probabilistic methods”

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 325 records · Page 18

Probabilistic Solar Power Forecasting Using Bayesian Model Averaging

There is rising interest in probabilistic forecasting to mitigate risks from solar power uncertainty, but the numerical weather prediction (NWP) ensembles readily available to system operators are often biased and underdispersed. We propose a Bayesian model averaging (BMA) post-processing method suitable for forecasting power from utility-scale photovoltaic (PV) plants at multiple time horizons up to at least the day-ahead timescale. BMA is a kernel dressing technique for NWP ensembles in which the forecast is a weighted sum of member-specific probability density functions. We tailor BMA for utility-scale PV forecasting by modeling power clipping at the AC inverter rating and advance the theory of BMA with a new beta kernel parameterization that accommodates theoretical constraints not previously addressed. BMA is demonstrated for a case study of 11 utility-scale PV plants in Texas, forecasting at hourly resolution for the complete year 2018. BMA's mixture-model approach mitigates underdispersion of the raw ensemble to significantly improve forecast calibration, while consistently outperforming an ensemble model output statistics (EMOS) parametric approach from the literature. At 4-hour lead time, the BMA post-processing achieves continuous ranked probability skill scores of 2--36% over the raw ensemble, with consistent performance at multiple lead times suitable for power system operations.

14 SOLAR ENERGY↗

Probabilistic Forecasting of Generators Startups and Shutdowns in the MISO System Based on Random Forest

Solving security constrained unit commitment (SCUC) problems to plan an economical generation schedule for day-head electricity market has been an important research topic in recent years. Mixed integer programming method (MIP), the-state-of-art approach for solving SCUC problem, is known computationally hard when the number of binary status variables is large. In this paper, a machine learning-based algorithm - random forest (RF), was applied to forecast the startups (SU) and shutdowns (SD) hours of generators, based on historical hourly system condition observations in the Midcontinent Independent System Operator (MISO) system. The main purpose is to reduce the number of binary status variables, by fixing the SU/SD hours to a narrow range of high confidence. This would significantly reduce the size of the decision space, and therefore speed up SCUC solutions with reduced uncertainty.

Lin, Xinming↗

Denoising diffusion probabilistic models for generative alloy design

Inverse material design is an extremely challenging optimization task made difficult by, in part, the highly nonlinear relationship linking performance with composition. Quantitative approaches have improved significantly owing to advances in high throughput experimentation and computational thermodynamics. However, existing physics-based tools are mostly forward models; input a chemistry and obtain a prediction. More recently the materials community has leveraged advances in the machine learning community to establish novel inverse design frameworks. Very recently denoising diffusion probabilistic models have been shown to be extremely powerful generators producing synthetic data of various modalities e.g. images, text, audio, tables, etc.. In this work a novel framework for alloy design and optimization is proposed leveraging these class of models. Five key generative tasks are demonstrated (1) unconditional generation (2) composition conditioned generation (3) property conditioned generation (4) multi-feedstock conditioned generation and (5) generative optimization. These methods were tested on three case studies: high entropy alloy design, superalloy binder jet additive manufacturing, and in-situ dual-feedstock wire-arc additive manufacturing. Results indicate that the established models are extremely flexible, expressive, and robust. The architecture’s flexibility and training procedure empower the model to learn complex intra-compositional and composition-property relationships. Furthermore, the probabilistic nature of these models makes them well suited for addressing solution non-uniqueness and tackling uncertainty quantification tasks. While the fidelity and quantity of the underlying training data is paramount, we envision that future alloy design frameworks will make extensive use of these kinds of machine learning models as “search” tools bolstering the utility of experimental and computational approaches.

36 MATERIALS SCIENCE↗

Machine Learning Derived Dynamic Operating Reserve Requirements in High-Renewable Power Systems

Accurately forecasting wind and solar power output poses challenges for deeply decarbonized electricity systems. Grid operators must commit resources to provide reserves to ensure reliable operations in the face of forecast errors, a process which can increase fuel consumption and emissions. We apply neural network-based machine learning to expand the usefulness of median point forecast data by creating probabilistic distributions of short-term uncertainty in demand, wind, and solar forecasts that adapt to prevailing grid conditions. Machine learning derived estimates of forecast errors compare favorably to estimates based on incumbent methods. Reserves derived from machine learning are usually smaller than values derived using incumbent methods, which enables fuel savings during most hours. Machine learning reserves are generally larger than incumbent reserves during times of higher forecast error, potentially improving system reliability. Performance is tested using multi-stage production simulation modeling of the California Independent System Operator (CAISO) system. Machine learning reserves provide production cost and greenhouse gas (GHG) emission reductions of approximately 0.3% relative to historical 2019 requirements. Savings in the 2030 timeframe are highly dependent on battery storage capacity. At lower levels of battery capacity, savings of 0.4% from machine learning reserves are shown. Significant quantities of battery storage are expected to be added to meet California's resource adequacy needs and GHG reduction targets. Addition of these batteries saturate reserve needs and results in minimal within-hour balancing costs in 2030.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Radioisotope Identification with List-Mode Gamma Ray Data: A rigorous assessment on the value of temporal information applied to radioisotope identification.

This work explores the potential of utilizing temporal data from gamma-ray detectors, known as list-mode data, to enhance radioisotope identification. Traditional identification methods, which rely on full gamma-ray spectrum analysis, often require long dwell times and struggle with “confuser” sources, or spectra with similarly spaced spectral peaks. We hypothesize that by leveraging the probabilistic nature of nuclear decay and the time-encoded information from decay sequences and interactions with surrounding materials, we can improve classification accuracy over static spectral analysis. This research rigorously examines the temporal content of list-mode data through exploratory data analysis via correlation discovery and information theory. We further propose a basic classification model that can utilize spectral or temporal data (or both) to determine if the incorporation of temporal information can improve radioisotope identification. The findings suggest that the temporal information present in list-mode gamma-ray data has merit and should be further investigated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sensitivity of fatigue reliability in wind turbines: effects of design turbulence and the Wöhler exponent

Fatigue assessment of wind turbines involves three main sources of uncertainty: material resistance, load, and the damage accumulation model. Many studies focus on increasing the accuracy of fatigue load assessment to improve the fatigue reliability. Probabilistic modeling of the wind's turbulence standard deviation is an example of an approach used for this purpose. Editions 3 and 4 of the IEC standard for the design of wind energy generation systems (IEC 61400-1) suggest different probability distributions as alternatives for the representative turbulence in the normal turbulence model (NTM) of edition 1. There are debates on whether the suggested distributions provide conservative reliability levels, as the established design safety factors are calibrated based on the representative turbulence approach. The current study addresses the debate by comparing annual reliability based on different scenarios of NTM using a probabilistic approach. More importantly, it elaborates on the relative importance of load assessment accuracy in defining the fatigue reliability. Using the DTU 10 MW reference wind turbine and the first-order reliability method (FORM), we study the changes in the annual reliability level and its sensitivity to the three main random inputs. We perform the study considering the blade root flapwise and the tower base fore–aft moments, assuming different fatigue exponents in each load channel. The results show that integration over distributions of turbulence in each mean wind speed results in less conservative annual reliability levels than representative turbulence. The difference in the reliability levels varies according to turbulence distribution and the fatigue exponent. In the case of the tower base, the difference in the annual reliability index after 20 years can be up to 50 %. However, the model and material uncertainty have much higher effects on the reliability levels compared to load uncertainty. Knowledge about such differences in the reliability levels due to the choice of turbulence distribution is especially important, as it impacts the extent of lifetime extension through reliability reassessments.

17 WIND ENERGY↗

Risk-Informed ATF and FLEX Analysis for an Enhanced Resilient BWR Under Design-Basis and Beyond-Design-Basis Accidents

This report documents the activities performed by the Idaho National Laboratory (INL) during fiscal year (FY) 2020 for the U.S. Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program, Risk-Informed System Analysis (RISA) Pathway, Enhanced Resilient Plant (ERP) Systems research. The purpose of the RISA Pathway research and development is to support plant owner-operator decisions with the aim to improve the economics, reliability, and maintain the high levels of safety of current nuclear power plants over periods of extended plant operations. The concept of ERP refers to the combinations of accident-tolerant fuel (ATF), optimal use of diverse and flexible coping strategy (FLEX), enhancements to plant components and systems, and the incorporation of augmented or new passive cooling systems, as well as improved fuel cycle efficiency. The objective of the ERP research effort is to use the RISA methods and toolkit in industry applications, including methods development and early demonstration of technologies, in order to enhance existing reactors’ safety features (both active and passive) and to substantially reduce operating costs through risk-informed approaches to plant design modifications to the plant and their characterization. One main focus of the FY 2020 efforts documented in this report was to extend the analyses conducted in FYs 2018 and 2019 for a pressurized water reactor (PWR) to a boiling water reactor (BWR). The same analysis process, risk analysis approaches, and analysis tools as in the previous work for PWR were used for a generic BWR with near-term ATF cladding (i.e., Iron-Chromium-Aluminum [FeCrAl] cladding and Chromium [Cr]-coated cladding) designs under the postulated station blackout (SBO) and medium loss-of-coolant (MLOCA) accident scenarios. In addition, a FLEX model was developed and incorporated into a generic BWR probabilistic risk assessment (PRA) model using the INL-developed software tool, Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE), to assess the risk impact from FLEX. The other main focus of the FY 2020 efforts was to advance analysis methods, including developing dynamic approach for FLEX human reliability analysis (HRA) using the INL-developed software tool, Event Modeling Risk Assessment using Linked Diagrams (EMRALD), as well as developing a multicriterion benefit evaluation (MCBE) method for evaluating costs and benefits of safety enhancements in nuclear power plants (NPPs). As a case study, the MCBE method was applied to evaluate the costs and benefits brought by FLEX implementation.

99 GENERAL AND MISCELLANEOUS↗

A Framework for Inverse Prediction Using Functional Response Data

Inverse prediction models have commonly been developed to handle scalar data from physical experiments. However, it is not uncommon for data to be collected in functional form. When data are collected in functional form, it must be aggregated to fit the form of traditional methods, which often results in a loss of information. For expensive experiments, this loss of information can be costly. In this study, we introduce the functional inverse prediction (FIP) framework, a general approach which uses the full information in functional response data to provide inverse predictions with probabilistic prediction uncertainties obtained with the bootstrap. The FIP framework is a general methodology that can be modified by practitioners to accommodate many different applications and types of data. We demonstrate the framework, highlighting points of flexibility, with a simulation example and applications to weather data and to nuclear forensics. Results show how functional models can improve the accuracy and precision of predictions.

42 ENGINEERING↗

PyApprox: Enabling efficient model analysis

PyApprox is a Python-based one-stop-shop for probabilistic analysis of scientific numerical models. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent the most popular methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. Simple interfaces are provided for the most commonly-used algorithms to limit a user’s need to tune the various hyper-parameters of each algorithm. However, more advanced work flows that require customization of hyper-parameters is also supported. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of different algorithms for a wide range of model analyses. This paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in ground water.

97 MATHEMATICS AND COMPUTING↗

SPARTAN (Scalable Probabilistic Application Reconfigurable Tensor Autonomous Network)

The technical founder of Ludwig Computing Inc has been competitively selected for support by Cyclotron Road, a U.S. Department of Energy (DOE) Advanced Manufacturing Office (AMO) Lab-Embedded Entrepreneurship Program (LEEP) through an approved merit review process. Ludwig Computing Inc, supported by the U.S. Department of Energy's Advanced Manufacturing Office through the Cyclotron Road program, has investigated the advantages of probabilistic computing for real-world compute-intensive applications. This research adds to the understanding of alternative computing paradigms by exploring a unique hardware-software co-design that integrates quantum computing methods with nature-inspired problem-solving techniques. The project's focus on areas such as combinatorial optimization, graph analytics, and machine learning demonstrates the potential for significant advancements in computational efficiency and performance. By harnessing natural randomness to streamline large circuits into fewer devices, Ludwig's approach enables massive parallelism, potentially offering higher throughput, speed, and energy efficiency compared to conventional hardware solutions. This work benefits the public by paving the way for more efficient computing solutions that could address complex real-world problems while potentially reducing energy consumption in data-intensive industries.

97 MATHEMATICS AND COMPUTING↗

Optimal Transport as a Tool for Scientific Discovery in Radiation Biology

This report summarizes findings from research conducted for the “Exploration of the Poten tial for Artificial Intelligence and Machine Learning to Advance Low-Dose Radiation Biology Re search” (RadBio-AI) program, supported by the U.S. Department of Energy, Office of Science, Office of Biological and Environmental Research, under Awards KP1601011/FWP CC121 and KP1601017/FWP CC121. The research reported here was undertaken in an effort to assess the potential of optimal measure transport methods as components within the larger scope of a com putational framework envisioned to support research in the radiation biology domain. Within this effort, our interest centered on enabling a unified generic framework where probabilistic modeling, inference, and statistical learning can be carried out for a wide range of data distributions. As described next in Section 1 (and in more detail in our original publication), optimal measure transport offers the possibility of such unified approach.

97 MATHEMATICS AND COMPUTING↗

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗

Synthesizing realistic sand assemblies with denoising diffusion in latent space

Abstract The shapes and morphological features of grains in sand assemblies have far‐reaching implications in many engineering applications, such as geotechnical engineering, computer animations, petroleum engineering, and concentrated solar power. Yet, our understanding of the influence of grain geometries on macroscopic response is often only qualitative, due to the limited availability of high‐quality 3D grain geometry data. In this paper, we introduce a denoising diffusion algorithm that uses a set of point clouds collected from the surface of individual sand grains to generate grains in the latent space. By employing a point cloud autoencoder, the three‐dimensional point cloud structures of sand grains are first encoded into a lower‐dimensional latent space. A generative denoising diffusion probabilistic model is trained to produce synthetic sand that maximizes the log‐likelihood of the generated samples belonging to the original data distribution measured by a Kullback‐Leibler divergence. Numerical experiments suggest that the proposed method is capable of generating realistic grains with morphology, shapes and sizes consistent with the training data inferred from an F50 sand database. We then use a rigid contact dynamic simulator to pour the synthetic sand in a confined volume to form granular assemblies in a static equilibrium state with targeted distribution properties. To ensure third‐party validation, 50,000 synthetic sand grains and the 1542 real synchrotron microcomputed tomography (SMT) scans of the F50 sand, as well as the granular assemblies composed of synthetic sand grains are made available in an open‐source repository.

Vlassis, Nikolaos N.↗

Discrete Graph Structure Learning for Forecasting Multiple Time Series

Time series forecasting is an extensively studied subject in statistics, economics, and computer science. Exploration of the correlation and causation among the variables in a multivariate time series shows promise in enhancing the performance of a time series model. When using deep neural networks as forecasting models, we hypothesize that exploiting the pairwise information among multiple (multivariate) time series also improves their forecast. If an explicit graph structure is known, graph neural networks (GNNs) have been demonstrated as powerful tools to exploit the structure. In this work, we propose learning the structure simultaneously with the GNN if the graph is unknown. We cast the problem as learning a probabilistic graph model through optimizing the mean performance over the graph distribution. The distribution is parameterized by a neural network so that discrete graphs can be sampled differentiably through reparameterization. Empirical evaluations show that our method is simpler, more efficient, and better performing than a recently proposed bilevel learning approach for graph structure learning, as well as a broad array of forecasting models, either deep or non-deep learning based, and graph or non-graph based.

Shang, Chao↗

Active meta-learning for predicting and selecting perovskite crystallization experiments

Autonomous experimentation systems use algorithms and data from prior experiments to select and perform new experiments in order to meet a specified objective. In most experimental chemistry situations, there is a limited set of prior historical data available, and acquiring new data may be expensive and time consuming, which places constraints on machine learning methods. Active learning methods prioritize new experiment selection by using machine learning model uncertainty and predicted outcomes. Meta-learning methods attempt to construct models that can learn quickly with a limited set of data for a new task. Here in this paper, we applied the model-agnostic meta-learning (MAML) model and the Probabilistic LATent model for Incorporating Priors and Uncertainty in few-Shot learning (PLATIPUS) approach, which extends MAML to active learning, to the problem of halide perovskite growth by inverse temperature crystallization. Using a dataset of 1870 reactions conducted using 19 different organoammonium lead iodide systems, we determined the optimal strategies for incorporating historical data into active and meta-learning models to predict reaction compositions that result in crystals. We then evaluated the best three algorithms (PLATIPUS and active-learning k-nearest neighbor and decision tree algorithms) with four new chemical systems in experimental laboratory tests. With a fixed budget of 20 experiments, PLATIPUS makes superior predictions of reaction outcomes compared to other active-learning algorithms and a random baseline.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable Risk Assessment of Rare Events in Power Systems With Uncertain Wind Generation and Loads

Risk assessment of rare events has become increasingly important in power system planning and operation with the increasing integration of renewable energy and the presence of system uncertainties. However, quantifying the risk posed by rare events via the traditional method, i.e., Monte Carlo sampling (MCS), incurs substantial computational expense stemming from the vast ensemble of power flow simulations. To accelerate the assessment, this paper proposes a Deep Neural Network (DNN)-kernelized vector-valued Gaussian Process (VVGP) approach with excellent computational efficiency while maintaining high accuracy. Consequently, serving as a surrogate model for the power flow solver, the DNN-kernelized VVGP enables significantly faster but accurate risk assessment compared to the power flow solver. The developed surrogate model evaluates low-order N - k events that contain more than 90% instances by adeptly capturing the topological features while the high-order N - k events are assessed via a power flow solver, thereby striking a balance between computational efficiency and uncertainty quantification accuracy. Moreover, the model incorporates a Support Vector Machine (SVM) classifier to resample concerning low-probability tail events to counteract the biases potentially introduced during the DNN-kernelized VVGP evaluations. Simulations conducted on the modified IEEE 24-bus, 118-bus, and European 1354-bus systems demonstrate that the proposed method maintains the accuracy benchmark set by MCS while significantly reducing computational demands in large-scale power systems as compared to other state-of-the-art methods.

17 WIND ENERGY↗

Explainable and trustworthy artificial intelligence for correctable modeling in chemical sciences

Data science has primarily focused on big data, but for many physics, chemistry, and engineering applications, data are often small, correlated and, thus, low dimensional, and sourced from both computations and experiments with various levels of noise. Typical statistics and machine learning methods do not work for these cases. Expert knowledge is essential, but a systematic framework for incorporating it into physics-based models under uncertainty is lacking. Here, we develop a mathematical and computational framework for probabilistic artificial intelligence (AI)–based predictive modeling combining data, expert knowledge, multiscale models, and information theory through uncertainty quantification and probabilistic graphical models (PGMs). We apply PGMs to chemistry specifically and develop predictive guarantees for PGMs generally. Our proposed framework, combining AI and uncertainty quantification, provides explainable results leading to correctable and, eventually, trustworthy models. The proposed framework is demonstrated on a microkinetic model of the oxygen reduction reaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗