Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bayesian 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 1,099 records · Page 61

PINN surrogate of Li-ion battery models for parameter inference, Part II: Regularization and application of the pseudo-2D model

Bayesian parameter inference is useful to improve Li-ion battery diagnostics and can help formulate battery aging models. However, it is computationally intensive and cannot be easily repeated for multiple cycles, multiple operating conditions, or multiple replicate cells. To reduce the computational cost of Bayesian calibration, numerical solvers for physics-based models can be replaced with faster surrogates. A physics-informed neural network (PINN) is developed as a surrogate for the pseudo-2D (P2D) battery model calibration. For the P2D surrogate, additional training regularization was needed as compared to the PINN single-particle model (SPM) developed in Part I. Both the PINN SPM and P2D surrogate models are exercised for parameter inference and compared to data obtained from a direct numerical solution of the governing equations. A parameter inference study highlights the ability to use these PINNs to calibrate scaling parameters for the cathode Li diffusion and the anode exchange current density. By realizing computational speed-ups of ~2250x for the P2D model, as compared to using standard integrating methods, the PINN surrogates enable rapid state-of-health diagnostics. Finally, in the low-data availability scenario, the testing error was estimated to ~2 mV for the SPM surrogate and ~10 mV for the P2D surrogate which could be mitigated with additional data.

25 ENERGY STORAGE↗

In-flight polarization angle calibration for LiteBIRD: blind challenge and cosmological implications

We present a demonstration of the in-flight polarization angle calibration for the JAXA/ISAS second strategic large class mission, LiteBIRD, and estimate its impact on the measurement of the tensor-to-scalar ratio parameter, r, using simulated data. We generate a set of simulated sky maps with CMB and polarized foreground emission, and inject instrumental noise and polarization angle offsets to the 22 (partially overlapping) LiteBIRD frequency channels. Our in-flight angle calibration relies on nulling the EB cross correlation of the polarized signal in each channel. This calibration step has been carried out by two independent groups with a blind analysis, allowing an accuracy of the order of a few arc-minutes to be reached on the estimate of the angle offsets. Both the corrected and uncorrected multi-frequency maps are propagated through the foreground cleaning step, with the goal of computing clean CMB maps. We employ two component separation algorithms, the Bayesian-Separation of Components and Residuals Estimate Tool (B-SeCRET), and the Needlet Internal Linear Combination (NILC). We find that the recovered CMB maps obtained with algorithms that do not make any assumptions about the foreground properties, such as NILC, are only mildly affected by the angle miscalibration. However, polarization angle offsets strongly bias results obtained with the parametric fitting method. Once the miscalibration angles are corrected by EB nulling prior to the component separation, both component separation algorithms result in an unbiased estimation of the r parameter. While this work is motivated by the conceptual design study for LiteBIRD, its framework can be broadly applied to any CMB polarization experiment. In particular, the combination of simulation plus blind analysis provides a robust forecast by taking into account not only detector sensitivity but also systematic effects.

79 ASTRONOMY AND ASTROPHYSICS↗

Brain segmentation and the generation of cortical surfaces

This paper describes methods for white matter segmentation in brain images and the generation of cortical surfaces from the segmentations. We have developed a system that allows a user to start with a brain volume, obtained by modalities such as MRI or cryosection, and constructs a complete digital representation of the cortical surface. The methodology consists of three basic components: local parametric modeling and Bayesian segmentation; surface generation and local quadratic coordinate fitting; and surface editing. Segmentations are computed by parametrically fitting known density functions to the histogram of the image using the expectation maximization algorithm [DLR77]. The parametric fits are obtained locally rather than globally over the whole volume to overcome local variations in gray levels. To represent the boundary of the gray and white matter we use triangulated meshes generated using isosurface generation algorithms [GH95]. A complete system of local parametric quadratic charts [JWM+95] is superimposed on the triangulated graph to facilitate smoothing and geodesic curve tracking. Algorithms for surface editing include extraction of the largest closed surface. Results for several macaque brains are presented comparing automated and hand surface generation. Copyright 1999 Academic Press.

NASA Discipline Neuroscience↗

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

Transfer Learning for HVAC System Fault Detection

Faults in HVAC systems degrade thermal comfort and energy efficiency in buildings and have received significant attention from the research community, with data driven methods gaining in popularity. Yet the lack of labeled data, such as normal versus faulty operational status, has slowed the application of machine learning to HVAC systems. In addition, for any particular building, there may be an insufficient number of observed faults over a reasonable amount of time for training. To overcome these challenges, we present a transfer methodology for a novel Bayesian classifier designed to distinguish between normal operations and faulty operations. The key is to train this classifier on a building with a large amount of sensor and fault data (for example, via simulation or standard test data) then transfer the classifier to a new building using a small amount of normal operations data from the new building. We demonstrate a proof-of-concept for transferring a classifier between architecturally similar buildings in different climates and show few samples are required to maintain classification precision and recall.

transfer learning, Building HVAC, Bayesian framewo↗

Load Balancing Using Time Series Analysis for Soft Real Time Systems with Statistically Periodic Loads

This thesis provides design and analysis of techniques for global load balancing on ensemble architectures running soft-real-time object-oriented applications with statistically periodic loads. It focuses on estimating the instantaneous average load over all the processing elements. The major contribution is the use of explicit stochastic process models for both the loading and the averaging itself. These models are exploited via statistical time-series analysis and Bayesian inference to provide improved average load estimates, and thus to facilitate global load balancing. This thesis explains the distributed algorithms used and provides some optimality results. It also describes the algorithms' implementation and gives performance results from simulation. These results show that the authors' techniques allow more accurate estimation of the global system loading, resulting in fewer object migrations than local methods. The authors' method is shown to provide superior performance, relative not only to static load-balancing schemes but also to many adaptive load-balancing methods. Results from a preliminary analysis of another system and from simulation with a synthetic load provide some evidence of more general applicability.

LOAD CONTROL↗

Load Balancing Using Time Series Analysis for Soft Real Time Systems with Statistically Periodic Loads

This thesis provides design and analysis of techniques for global load balancing on ensemble architectures running soft-real-time object-oriented applications with statistically periodic loads. It focuses on estimating the instantaneous average load over all the processing elements. The major contribution is the use of explicit stochastic process models for both the loading and the averaging itself. These models are exploited via statistical time-series analysis and Bayesian inference to provide improved average load estimates, and thus to facilitate global load balancing. This thesis explains the distributed algorithms used and provides some optimality results. It also describes the algorithms' implementation and gives performance results from simulation. These results show that our techniques allow more accurate estimation of the global system load ing, resulting in fewer object migration than local methods. Our method is shown to provide superior performance, relative not only to static load-balancing schemes but also to many adaptive methods.

REAL TIME↗

A consistent, Bayesian, approach to the cross section probability distribution in the unresolved resonance region

The cross sections of neutron-induced reactions can be divided into three energy ranges: the resolved resonance region (RRR), the unresolved resonance region (URR), and the fast region. In general, the cross sections in the URR show significant fluctuations that cannot be predicted and cannot be experimentally resolved, thus, it is commonly assumed that the cross section at a specific energy is given by a probability distribution function (PDF) over a range of values that can span several orders of magnitude. The current methodology used to describe such behavior is to construct the PDF by stochastically generating resonance ladders and numerically measuring the PDF. The resonance ladders are sampled using known resonance statistical properties and average resonance widths and spacings extrapolated from the RRR. Although this is a standard and widely used technique, it is computationally very expensive, therefore, an alternative, analytical, approach would be preferable due to the considerable speed up of the computational time in real life applications. Moreover, the current methodology does not take into account existing experimental data, such for total and capture cross sections, that are available for many nuclei. Finally, this approach was developed to be used in reactor-scale applications and it is not suited for use in single-event applications. In this work we will rethink the entire approach to the PDF construction using a Bayesian mindset. This will allow us to provide a different definition of the PDF that allows a much faster calculation of the higher-temperature PDFs and a proper combination of theoretical and experimental PDFs following the probability theory. We will also show that our definition is well suited for single-event applications and we will make an explicit connection between our method and the standard approach. We do this by showing that the central limit theorem applies and our method leads to the same PDF obtained with the standard methodology, for a large number of events per history.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

R2U2: Monitoring and Diagnosis of Security Threats for Unmanned Aerial Systems

We present R2U2, a novel framework for runtime monitoring of security properties and diagnosing of security threats on-board Unmanned Aerial Systems (UAS). R2U2, implemented in FPGA hardware, is a real-time, REALIZABLE, RESPONSIVE, UNOBTRUSIVE Unit for security threat detection. R2U2 is designed to continuously monitor inputs from the GPS and the ground control station, sensor readings, actuator outputs, and flight software status. By simultaneously monitoring and performing statistical reasoning, attack patterns and post-attack discrepancies in the UAS behavior can be detected. R2U2 uses runtime observer pairs for linear and metric temporal logics for property monitoring and Bayesian networks for diagnosis of security threats. We discuss the design and implementation that now enables R2U2 to handle security threats and present simulation results of several attack scenarios on the NASA DragonEye UAS.

Formal Methods↗

A Sub-Neptune and a Non-Transiting Neptune-Mass Companion Unveiled by ESPRESSO Around the Bright Late-F Dwarf HD 5278 (TOI-130)

Context. Transiting sub-Neptune-type planets, with radii approximately between 2 and 4R⊕, are of particular interest as their study allows us to gain insight into the formation and evolution of a class of planets that are not found in our Solar System. Aims. We exploit the extreme radial velocity (RV) precision of the ultra-stable echelle spectrograph ESPRESSO on the VLT to unveil the physical properties of the transiting sub-Neptune TOI-130 b, uncovered by the TESS mission orbiting the nearby, bright, late F-typestar HD 5278 (TOI-130) with a period of Pb=14.3 days. Methods. We used 43 ESPRESSO high-resolution spectra and broad-band photometry information to derive accurate stellar atmospheric and physical parameters of HD 5278. We exploited the TESS light curve and spectroscopic diagnostics to gauge the impact of stellar activity on the ESPRESSO RVs. We performed separate as well as joint analyses of the TESS photometry and the ESPRESSORVs using fully Bayesian frameworks to determine the system parameters. Results. Based on the ESPRESSO spectra, the updated stellar parameters of HD 5278 are Teff=6203±64K, logg=4.50±0.11dex, [Fe/H] =−0.12±0.04dex,M?=1.126+0.036−0.035M, and R?=1.194+0.017−0.016R. We determine HD 5278 b’s mass and radius to be Mb=7.8+1.5−1.4M⊕ and Rb=2.45±0.05R⊕. The derived mean density, %b=2.9+0.6−0.5g cm−3, is consistent with the bulk composition of a sub-Neptune with a substantial (∼30%) water mass fraction and with a gas envelope comprising ∼17% of the measured radius. Given the host brightness and irradiation levels, HD 5278 b is one of the best targets orbiting G-F primaries for follow-up atmospheric characterization measurements with HST and JWST. We discover a second, non-transiting companion in the system, with a period of Pc=40.87+0.18−0.17days and a minimum mass of Mcsinic=18.4+1.8−1.9M⊕. We study emerging trends in parameters space (e.g., mass, radius, stellar insolation, and mean density) of the growing population of transiting sub-Neptunes, and provide statistical evidence for a low occurrence of close-in,10−15M⊕companions around G-F primaries withTeff&5500K.

planetary systems↗

Detection of Vegetation Trends in Highly Variable Environments After Grazing Exclusion in Mongolia

Aims: Environmental variability (e.g. in precipitation) has a large effect on vegetation dynamics, and this often makes it difficult to assess the recovery of vegetation after a disturbance. In this study, we assessed vegetation recovery trends in response to grazing exclusion while considering for the annual environmental variability. Location: Two regions with highly variable precipitation: a steppe near Mandalgobi, in Mongolia's Central Gobi province, and a desert steppe near Bulgan, in Mongolia's South Gobi province. Methods: Changes in vegetation were observed along grazing gradients at the above two sites, and vegetation thresholds were identified. We established reference plots in pre-threshold areas along the grazing gradients. We removed the impact of livestock grazing at various locations along the grazing gradients by establishing exclosures, and investigated vegetation from 2005 to 2013. We developed a smoothed hierarchical model within a Bayesian framework, and examined the effect of grazing exclusion on vegetation, focusing especially on the extent of grass cover recovery. In addition, we compared soil nutrient conditions in the reference plots and inside and outside each exclosure along the grazing gradients. Results: Temporal trends in the cover of perennial grass in each plot inside and outside of the exclosures largely coincided, irrespective of grazing intensity, and exclosure had no effect (Bulgan) or a negative effect (Mandalgobi) on vegetation recovery. Soil nutrient content was not significantly affected by exclosure at a given distance from the grazing source, but decreased significantly with decreasing grazing intensity. Thus, recovery of the land from a post-threshold state may not be apparent even after 9 yr of grazing exclusion in environments with highly variable precipitation. Conclusion: The effect of exclosure duration on perennial grass cover was limited, even after controlling for environmental variability. Once a vegetation threshold has been crossed, merely removing livestock from the landscape may not be sufficient for that area to recover.

Bayesian statistics;Drought;Environmental variabil↗

State of Stress Uncertainty Quantification and Geomechanical Risk Analysis for Subsurface Engineering

All subsurface stress measurement methods available for deep subsurface applications are indirect and involve a significant amount of uncertainty. Quantifying these uncertainties is critical for applications where the state of stress is a component of a risk analysis with significant safety, environmental, and economic considerations. A publicly available and open source tool called the State of Stress Analysis Tool (SOSAT) has been developed to aid in performing a Bayesian uncertainty quantification and geomechanical risk analysis using many types of commonly available data. A new feature of this tool is using data from the FutureGen 2.0 site. The new feature of the tool was uses information about the absence or presence of borehole breakouts to constrain the state of stress. This new feature allows the user to specify probability distributions for the relevant parameters such as the drilling mud pressure, temperature, and the formation strength properties. The tool computes the posterior joint probability distribution of the horizontal principal stresses. Using random samples from this posterior distribution the tool then computes the probability of activating a critically oriented fault at a range of pore pressures. This latter feature can be used to aid in the assessment of the risk of induced seismicity and leakage in geologic carbon sequestration and enhanced geothermal systems.

Burghardt, Jeffrey A.↗

Leveraging prior mean models for faster Bayesian optimization of particle accelerators

Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.

43 PARTICLE ACCELERATORS↗

Automated calculation and convergence of defect transport tensors

Defect diffusion is a key process in materials science and catalysis, but as migration mechanisms are often too complex to enumerate a priori, calculation of transport tensors typically have no measure of convergence and require significant end-user intervention. These two bottlenecks prevent high-throughput implementations essential to propagate model-form uncertainty from interatomic interactions to predictive simulations. In order to address these issues, we extend a massively parallel accelerated sampling scheme, autonomously controlled by Bayesian estimators of statewide sampling completeness, to build atomistic kinetic Monte Carlo models on a state-space irreducible under exchange and space group symmetries. Focusing on isolated defects, we derive analytic expressions for drift and diffusion coefficients, providing a convergence metric by calculating the Kullback–Leibler divergence across the ensemble of diffusion processes consistent with the sampling uncertainty. The autonomy and efficacy of the method is demonstrated on surface trimers in tungsten and Hexa-interstitials in magnesium oxide, both of which exhibit complex, correlated migration mechanisms.

36 MATERIALS SCIENCE↗

Posterior Regularized Bayesian Neural Network

Traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs(BNNs) could help measure the confidence level by using distributions in NNs modeling. Besides, knowledge is commonly available and could improve the performance of BNNs if it can be properly incorporated. In this work, we propose a novel Posterior-Regularized BNN(PR-BNN) model by incorporating soft and hard constraints as a posterior regularization term. We also propose an augmented Lagrangian method and stochastic optimization algorithm for efficient updating via Monte Carlo sampling. The simulations and case studies for solar PV plants have shown the performance improvement of the proposed model over traditional BNNs.

97 MATHEMATICS AND COMPUTING↗

Posterior Regularized Bayesian Neural Network

Traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs(BNNs) could help measure the confidence level by using distributions in NNs modeling. Besides, knowledge is commonly available and could improve the performance of BNNs if it can be properly incorporated. In this work, we propose a novel Posterior-Regularized BNN(PR-BNN) model by incorporating soft and hard constraints as a posterior regularization term. We also propose an augmented Lagrangian method and stochastic optimization algorithm for efficient updating via Monte Carlo sampling. The simulations and case studies in solar energy prediction have shown the performance improvement of the proposed model over traditional BNNs.

14 SOLAR ENERGY↗

A bi-level advanced control framework for large-scale control of buildings with system-level impact

Increased electricity consumption combined with new forms of generation is testing the reliability of our grid infrastructure. This work describes a method to improve the reliability of the grid through large-scale advanced building control. This paper develops a bi-level distributed control framework to shift the load of 153 buildings to achieve a system-level objective of tracking a power reference signal. This bi-level control is based on the previously-developed ANPV-MPC, a predictive controller that uses a Bayesian neural network to generate an accurate control model and adapt to changing conditions over time. By shifting the building electricity demand to better match the available power, the grid system supplying the buildings is more reliable as evidenced by the analysis of node voltages across an IEEE 13-bus distribution system. The proposed bi-level control framework tracks the system-level power reference with enough accuracy to regulate node voltages across the IEEE 13-bus distribution system within ANSI limits of ±5%. Additionally, the adaptive nature of ANPV-MPC allows each building across the system to adapt to changing conditions, further amplifying the system-level reliability.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Uncertainty quantification for Multiphase-CFD simulations of bubbly flows: a machine learning-based Bayesian approach supported by high-resolution experiments

In this paper, we developed a machine learning-based Bayesian approach to inversely quantify and reduce the uncertainties of multiphase computational fluid dynamics (MCFD) simulations for bubbly flows. The proposed approach is supported by high-resolution two-phase flow measurements, including those by double-sensor conductivity probes, high-speed imaging, and particle image velocimetry. Local distributions of key physical quantities of interest (QoIs), including the void fraction and phasic velocities, are obtained to support the Bayesian inference. In the process, the epistemic uncertainties of the closure relations are inversely quantified while the aleatory uncertainties from stochastic fluctuations of the system are evaluated based on experimental uncertainty analysis. The combined uncertainties are then propagated through the MCFD solver to obtain uncertainties of the QoIs, based on which probability-boxes are constructed for validation. The proposed approach relies on three machine learning methods: feedforward neural networks and principal component analysis for surrogate modeling, and Gaussian processes for model form uncertainty modeling. The whole process is implemented within the framework of an open-source deep learning library PyTorch with graphics processing unit (GPU) acceleration, thus ensuring the efficiency of the computation. The results demonstrate that with the support of high-resolution data, the uncertainties of MCFD simulations can be significantly reduced. The proposed approach has the potential for other applications that involve numerical models with empirical parameters.

42 ENGINEERING↗