SEARCH · Engineering Papers
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.
This PowerPoint presentation was presented virtually at the American Geophysical Union (AGU) Fall Meeting 2020.
Explore the source record for details and available documents.
Abstract – Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.
Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.
Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which usually consists of a database of tabulated values, used to calculate the cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of micro cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. To address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multi-group cross section data across isotopes, reaction types and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs for have been trained for all isotopes in this work and systematic Griffin testing is ongoing at this moment to ensure the feasibility of this ROM technique for cross section predictions.
Decarbonization goals in the United States electricity sector are increasing the levels of renewable energy generation in the electricity supply system, and are driving increased attention to building electrification, which will increase the magnitude and shift the timing of the electricity system peak. These changes are motivating new approaches to coordinate building electricity demand with low-carbon renewable generation, elevating the importance of demand flexibility (DF) in buildings and the need to quantify the temporal impacts of DF. In this paper, we first characterize the hourly predictive accuracy of six commonly used baseline models in an application context of quantifying building-level load shift. Our analysis revealed insights such as hours of the day (afternoons), periods of the week (weekends), and seasons (summer) that were predicted with more accuracy than other time periods. In addition, the analysis showed tendencies toward overprediction or underprediction of load. Secondly, we provide the first published investigation of baseline erosion from repeated dispatch of building load shifting. We observed that as the baseline period is pushed back further from the prediction day, the distribution of errors across baseline model predictions increases, with notable inflection points near the three-week erosion point for two of the three models.
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.
Radiofrequency (RF) communications offer reliable but low data rates and energy-inefficient satellite links, while free-space optical (FSO) promises high bandwidth but struggles with disturbances imposed by atmospheric effects. A hybrid RF/FSO architecture aims to achieve optimal reliability along with high data rates for space communications. Accurate prediction of dynamic ground-to-satellite FSO link availability is critical for routing decisions in low-earth orbit constellations. In this paper, we propose a system leveraging ubiquitous RF links to proactively forecast FSO link degradation prior to signal drops below threshold levels. This enables pre-calculation of rerouting to maximally maintain high data rate FSO links throughout the duration of weather effects. We implement a supervised learning model to anticipate FSO attenuation based on the analysis of RF patterns. Through the simulation of a dense lower earth orbit (LEO) satellite constellation, we demonstrate the efficacy of our approach in a simulated satellite network, highlighting the balance between predictive accuracy and prediction duration. An emulated cloud attenuation model is proposed to provide insight into the temporal profiles of RF signals and their correlation to FSO channel dynamics. Our investigation sheds light on the trade-offs between prediction horizon and accuracy arising from RF beacon numbers and proximity.
Hybrid breeding in sorghum [Sorghum bicolor (L.) Moench] utilizes the cytoplasmic-nuclear male sterility (CMS) system for seed production and subsequently harnesses heterosis. Since the cost of developing and evaluating inbred and hybrid lines in the CMS system is costly and time-consuming, genomic prediction of parental lines and hybrids is based on genetic data genotype. We generated 602 hybrids by crossing two female (A) lines with 301 diverse and elite male (R) lines from the sorghum association panel and collected phenotypic data for agronomic traits over two years. We genotyped the inbred parents using whole genome resequencing and used 2,687,342 high quality (minor allele frequency > 2%) single nucleotide polymorphisms for genomic prediction. For grain yield, the experimental hybrids exhibited an average mid-parent heterosis of 40%. Genomic best linear unbiased prediction (GBLUP) for hybrid performance yielded an average prediction accuracy of 0.76–0.93 under the prediction scenario where both parental lines in validation sets were included in the training sets (T2). However, when only female tester was shared between training and validation sets (T1F), prediction accuracies declined by 12–90%, with plant height showing the greatest decline. Mean accuracies for predicting the general combining ability of male parents ranged from 0.33 to 0.62 for all traits. Our results showed hybrid performance for agronomic traits can be predicted with high accuracy, and optimizing genomic relationship is essential for optimal training population design for genomic selection in sorghum breeding.
The rising usage of intermittent energy has garnered the need for large scale energy storage systems. Redox flow batteries (RFB) based energy storage system shows promising potential. Numerical simulations and machine learning approaches have been widely used to study RFB performance. The development of autonomous material discovery framework and digital twin of energy storage system usually needs to query cell performance through fast response models. In this study, two computationally efficient models are introduced: a physics-based analytical flow battery model (EZBattery), and a machine learning operator model (Deep Operator Network, denoted by DeepONet). Both models can provide cell performance near instantly, and prediction accuracy was systematically examined on an application of evaluating the performances of a 780 cm 2 aqueous organic redox flow battery (AORFB), using potential anolyte candidates in dihydroxyphenazine (DHP)-based family of organic materials. A validated computationally expansive 3-dimensional multi-physics finite element model by COMSOL was used as the ground truth and provided the training data set for the DeepONet. 1280 samples were generated with 10 properties to mimic the different possible anolyte candidates, and the cell performances were evaluated under 10 different combined operating conditions. The accuracy comparisons for the two computationally efficient models show that both models can provide comparable accuracy in predicting cell charging/discharging voltage curves. DeepONet can provide slightly higher overall accuracy than EZBattery with faster calculation speed, but highly relies on the training dataset. EZBattery does not need a training dataset and can provide interpretable physics-based explanations of the results, while being more flexible to adjust to adapt any different cell designs, flow battery architectures, and electrolyte materials.
We present a new finite element framework for modeling compressible, turbulent multiphase flows with heat transfer. For two-fluid systems with a free surface, the Volume of Fluid (VOF) method is implemented without the need for interface reconstruction, while turbulence is resolved using a dynamic Vreman large eddy simulation (LES) model. Unlike most two-phase VOF studies, which neglect heat transfer, the present approach incorporates energy transport equations within the VOF formulation to account for heat exchange, an effect particularly important in turbulent flows. Conjugate heat transfer is often challenging in finite volume methods, which require explicit specification of heat fluxes at the solid–fluid interface, limiting accuracy and predictive capability. By contrast, the finite element formulation does not require heat flux inputs, allowing more accurate and robust simulation of heat transfer between solids and fluids. The method is demonstrated through three representative cases. First, a two-fluid instability with a single-mode perturbation is simulated and validated against analytical growth rates. Second, conjugate heat transfer is examined in a high-temperature flow over a cold metal cylinder, with validation performed both quantitatively—via pressure coefficient comparisons with experimental data—and qualitatively using vector field topology. Finally, compressible spray injection and breakup are modeled, demonstrating the ability of the framework to capture interfacial dynamics and atomization under turbulent, high-speed conditions. In the compressible spray injection and breakup case, the results indicate that the finite element formulation achieved higher predictive accuracy and robustness than the finite-volume method. With the same mesh resolution, the FEM reduced the root mean square error (RMSE) and mean absolute percentage error (MAPE) from 6.96 mm and 26.0% (for the FVM) to 4.85 mm and 12.7%, respectively, demonstrating improved accuracy and robustness in capturing interfacial dynamics and heat transfer. The study also introduced vector field topology to visualize and interpret coherent flow structures and instabilities, offering insights beyond conventional scalar-field analyses.
Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.
Recent studies suggest that biases between wind plant pre-construction energy yield estimates and actual energy production are decreasing over time. However, variability in energy yield prediction accuracy across different projects and wind energy consultants remains high. Wake effects are one of the largest categories comprising the pre-construction energy yield assessment process. To assess the accuracy of wake loss predictions, we compare pre-construction wake loss estimates provided by 8 consultants to the estimated operational wake losses for 10 North American wind plants, as part of the Wind Plant Performance Prediction (WP3) Benchmark project. We estimate operational wake losses using supervisory control and data acquisition (SCADA) data by comparing total wind plant energy production to the potential energy production based on the power produced by freestream wind turbines. In the presentation, we will discuss the overall wake loss prediction bias as well as the project-to-project variability in the prediction accuracy. Further, we will highlight challenges encountered when estimating operational wake losses, including the impact of complex terrain and the presence of neighboring wind plants.
Electricity load forecasting is essential to utility operation and power grid stability. A wide spectrum of data-driven methods, ranging from linear regression models to more recent deep learning models have been adopted to forecast electric load over the years. However, there still lacks a holistic evaluation of the applicability of conventional statistical and machine learning based algorithms with respect to different temporal and spatial scopes, computational requirements, and sensitivity of model-tuning. Enabled by a large-scale electricity load profile dataset of over 40,000 residential customers in a utility region, we conducted a cross-dimensional analysis of data-driven load forecasting methods. Three regression-based and seven deep learning algorithms with different model configurations were evaluated in terms of their overall and peak load prediction accuracy, and training burdens, across spatial aggregation levels ranging from the transformer, feeder, substation, to neighborhood. We found, first, the load forecasting accuracy is constrained by a predictability boundary, influenced by the forecasting horizon and spatial aggregation level. Specifically, RandomForest, XGBoost, TFT, TSMixer, and TiDE models achieved less than 10 % prediction error for up to 96-h ahead forecasting for district, substation, and feeder levels, while other models struggle at long-horizon predictions; Second, for winter and summer peak load dates, most models were able to predict the peak demand timing within ± 1 h, but the prediction percentage error varied by models, with TFT and TiDE models being the top performers; Third, models with similar prediction accuracy can differ in training burden by an order of magnitude. Therefore, choosing model configurations that balance prediction performance and computational resource is an important practical consideration for large-scale deployment of the machine learning based load forecasting. The outcome of this study can guide researchers and practitioners to choose the proper load forecasting algorithms based on their problem scope, required accuracy, and available resources. The predictability boundary can serve as a benchmark for electricity load forecasting problems with new algorithms and datasets.
A data-driven chaos indicator concept is introduced to characterize the degree of chaos for nonlinear dynamical systems. The indicator is represented by the prediction accuracy of surrogate models established purely from data. It provides a metric for the predictability of nonlinear motions in a given system. When using the indicator to implement a tune-scan for a quadratic Hénon map, the main resonances and their asymmetric stop-band widths can be identified. When applied to particle transportation in a storage ring, as particle motion becomes more chaotic, its surrogate model prediction accuracy decreases correspondingly. So, the prediction accuracy, acting as a chaos indicator, can be used directly as the objective for nonlinear beam dynamics optimization. This method provides a different perspective on nonlinear beam dynamics and an efficient method for nonlinear lattice optimization. Applications in dynamic aperture optimization are demonstrated as real world examples.
A data-driven chaos indicator concept is introduced to characterize the degree of chaos for nonlinear dynamical systems. The indicator is represented by the prediction accuracy of surrogate models established purely from data. It provides a metric for the predictability of nonlinear motions in a given system. When using the indicator to implement a tune-scan for a quadratic Hénon map, the main resonances and their asymmetric stop-band widths can be identified. When applied to particle transportation in a storage ring, as particle motion becomes more chaotic, its surrogate model prediction accuracy decreases correspondingly. Therefore, the prediction accuracy, acting as a chaos indicator, can be used directly as the objective for nonlinear beam dynamics optimization. This method provides a different perspective on nonlinear beam dynamics and an efficient method for nonlinear lattice optimization. Applications in dynamic aperture optimization are demonstrated as real world examples.
Miscanthus is a perennial grass with potential for lignocellulosic ethanol production. To ensure its utility for this purpose, breeding efforts should focus on increasing genetic diversity of the nothospecies Miscanthus × giganteus (M×g) beyond the single clone used in many programs. Germplasm from the corresponding parental species M. sinensis (Msi) and M. sacchariflorus (Msa) could theoretically be used as training sets for genomic prediction of M×g clones with optimal genomic estimated breeding values for biofuel traits. To this end, we first showed that subpopulation structure makes a substantial contribution to the genomic selection (GS) prediction accuracies within a 538-member diversity panel of predominately Msi individuals and a 598-member diversity panels of Msa individuals. We then assessed the ability of these two diversity panels to train GS models that predict breeding values in an interspecific diploid 216-member M×g F2 panel. Low and negative prediction accuracies were observed when various subsets of the two diversity panels were used to train these GS models. To overcome the drawback of having only one interspecific M×g F2 panel available, we also evaluated prediction accuracies for traits simulated in 50 simulated interspecific M×g F2 panels derived from different sets of Msi and diploid Msa parents. The results revealed that genetic architectures with common causal mutations across Msi and Msa yielded the highest prediction accuracies. Ultimately, these results suggest that the ideal training set should contain the same causal mutations segregating within interspecific M×g populations, and thus efforts should be undertaken to ensure that individuals in the training and validation sets are as closely related as possible.
Here, we present a data-centric deep learning (DL) approach using neural networks (NNs) to predict the thermodynamics of ternary solid solutions. We explore how NNs can be trained with a dataset of Gibbs free energies computed from a CALPHAD database to predict ternary systems as a function of composition and temperature. We have chosen the energetics of the FCC solid solution phase in 226 binaries consisting of 23 elements at 11 different temperatures to demonstrate the feasibility. The number of binary data points included in the present study is 102,000. We select six ternaries to augment the binary dataset to investigate their influence on the NN prediction accuracy. We examine the sensitivity of data sampling on the prediction accuracy of NNs over selected ternary systems. It is anticipated that the current DL workflow can be further elevated by integrating advanced descriptors beyond the elemental composition and more curated training datasets to improve prediction accuracy and applicability.