Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic Bayesian network”

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 91 records · Page 5

a priori uncertainty quantification of reacting turbulence closure models using Bayesian neural networks

While many physics-based closure model forms have been posited for the sub-filter scale (SFS) in large eddy simulation (LES), vast amounts of data available from direct numerical simulations (DNS) create opportunities to leverage data-driven modeling techniques. Albeit flexible, data-driven models still depend on the dataset and the functional form of the model chosen. Increased adoption of such models requires reliable uncertainty estimates both in the data-informed and out-of-distribution regimes. Here, in this work, we employ Bayesian neural networks (BNNs) to capture both epistemic and aleatoric uncertainties in a reacting flow model. In particular, we model the filtered progress variable scalar dissipation rate which plays a key role in the dynamics of turbulent premixed flames. We demonstrate that BNN models can provide unique insights about the structure of uncertainty of the data-driven closure models. We also propose a method for the incorporation of out-of-distribution information in a BNN, which can be used for out-of-distribution query detection. The efficacy of the model is demonstrated by a priori evaluation on a dataset consisting of a variety of flame conditions and fuels.

97 MATHEMATICS AND COMPUTING↗

Bayesian calibration of bubble size dynamics applied to CO 2 gas fermenters

To accelerate the scale-up of gaseous CO 2 fermentation reactors, computational models need to predict gas-to-liquid mass transfer which requires capturing the bubble size dynamics, i.e. bubble breakup and coalescence. However, the applicability of existing models beyond air–water mixtures remains to be established. Here, an inverse modeling approach, accelerated with a neural network surrogate, calibrates the breakup and coalescence closure models, that are used in class methods for population balance modeling (PBM). The calibration is performed based on experimental results obtained in a CO 2 -air–water-coflowing bubble column reactor. Bayesian inference is used to account for noise in the experimental dataset and bias in the simulation results. To accurately capture gas holdup and interphase mass transfer, the results show that the breakage rate needs to be increased by one order of magnitude. In conclusion, the inferred model parameters are then used on a separate configuration and shown to also improve bubble size distribution predictions.

09 BIOMASS FUELS↗

Causal network inference using biochemical kinetics

Motivation: Networks are widely used as structural summaries of biochemical systems. Statistical estimation of networks is usually based on linear or discrete models. However, the dynamics of biochemical systems are generally non-linear, suggesting that suitable non-linear formulations may offer gains with respect to causal network inference and aid in associated prediction problems. Results: We present a general framework for network inference and dynamical prediction using time course data that is rooted in nonlinear biochemical kinetics. This is achieved by considering a dynamical system based on a chemical reaction graph with associated kinetic parameters. Both the graph and kinetic parameters are treated as unknown; inference is carried out within a Bayesian framework. This allows prediction of dynamical behavior even when the underlying reaction graph itself is unknown or uncertain. Results, based on (i) data simulated from a mechanistic model of mitogen-activated protein kinase signaling and (ii) phosphoproteomic data from cancer cell lines, demonstrate that non-linear formulations can yield gains in causal network inference and permit dynamical prediction and uncertainty quantification in the challenging setting where the reaction graph is unknown. Availability and implementation: MATLAB R2014a software is available to download from warwick.ac.uk/chrisoates.

60 APPLIED LIFE SCIENCES↗

Machine-learning-based inversion of nuclear responses

A microscopic description of the interaction of atomic nuclei with external electroweak probes is required for elucidating aspects of short-range nuclear dynamics and for the correct interpretation of neutrino oscillation experiments. Nuclear quantum Monte Carlo methods infer the nuclear electroweak response functions from their Laplace transforms. Inverting the Laplace transform is a notoriously ill-posed problem; and Bayesian techniques, such as maximum entropy, are typically used to reconstruct the original response functions in the quasielastic region. In this work, we present a physics-informed artificial neural network architecture suitable for approximating the inverse of the Laplace transform. Utilizing simulated, albeit realistic, electromagnetic response functions, we show that this physics-informed artificial neural network outperforms maximum entropy in both the low-energy transfer and the quasielastic regions, thereby allowing for robust calculations of electron scattering and neutrino scattering on nuclei and inclusive muon capture rates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Coupled flow accumulation and atmospheric blocking govern flood duration

Abstract We present a physically based Bayesian network model for inference and prediction of flood duration that allows for a deeper understanding of the nexus of antecedent flow regime, atmospheric blocking, and moisture transport/release mechanisms. Distinct scaling factors at the land surface and regional atmospheric levels are unraveled using this Bayesian network model. Land surface scaling explains the variability in flood duration as a function of cumulative exceedance index, a new measure that represents the evolution of the flood in the basin. Dynamic atmospheric scaling explains the cumulative exceedance index using the interaction between atmospheric blocking system and the synergistic model of wind divergence and atmospheric water vapor. Our findings underline that the synergy between a large persistent low-pressure blocking system and a higher rate of divergent wind often triggers a long-duration flood, even in the presence of moderate moisture supply in the atmosphere. This condition in turn causes an extremely long-duration flood if the basin-wide cumulative flow prior to the flood event was already high. Thus, this new land-atmospheric interaction framework integrates regional flood duration scaling and dynamic atmospheric scaling to enable the coupling of ‘horizontal’ (for example, streamflow accumulation inside the basin) and ‘vertical’ flow of information (for example, interrelated land and ocean-atmosphere interactions), providing an improved understanding of the critical forcing of regional hydroclimatic systems. This Bayesian model approach is applied to the Missouri River Basin, which has the largest system of reservoirs in the United States. Our predictive model can aid in decision support systems for the protection of national infrastructure against long-duration flood events.

Najibi, Nasser (ORCID:0000000205157192)↗

A game theoretic investigation of deception in network security

We perform a game theoretic investigation of the effects of deception on the interactions between an attacker and a defender of a computer network. The defender can employ camouflage by either disguising a normal system as a honeypot or by disguising a honeypot as a normal system. We model the interactions between defender and attacker using a signaling game, a non-cooperative two player dynamic game of incomplete information. For this model, we determine which strategies admit perfect Bayesian equilibria. These equilibria are refined Nash equilibria in which neither the defender nor the attacker will unilaterally choose to deviate from their strategies. Finally, we discuss the benefits of employing deceptive equilibrium strategies in the defense of a computer network.

99 GENERAL AND MISCELLANEOUS↗

Scaling of Floods With Geomorphologic Characteristics and Precipitation Variability Across the Conterminous United States

Abstract Accurate flood risk assessment requires a comprehensive understanding of flood sensitivity to regional drivers and climate factors. This paper presents the scaling of floods (duration, peak, volume) with geomorphologic characteristics of the basin (i.e., drainage area, slope, elevation) and precipitation patterns (rainfall accumulation, variability). Long‐term daily streamflow observations over the 20th and early 21st centuries from Hydro‐Climatic Data Network streamgages across the conterminous United States are used to create a flood event database based on their flood stage information. Antecedent daily rainfall accumulation and variability corresponding to these floods are computed using Global Historical Climatology Network daily data set. Two Bayesian scaling models are developed, and the spatial organization of scaling exponents is investigated. The baseline model quantifies the scaling of floods to geomorphologic characteristics. The dynamic model quantifies the scaling of floods to antecedent precipitation distribution which is further conditioned on geomorphologic characteristics. Results show that small and low‐elevation basins have a stronger response to antecedent rainfall distribution in amplifying flood peaks, while high‐elevation steeper basins have a lower response for flood duration and volume. The dynamic models demonstrate that there are significant variations in the flood scaling rates, with the largest rates up to 40% and 4.5% for flood duration, 64% and 44% for peak, and 98% and 40% for volume found across the Northeast, Coastal Southeast, and Northwest with intensifying rainfall accumulation and variability, respectively. This study advances flood predictions by better informing the flood attributes in the context of dynamical land‐atmosphere perturbations.

54 ENVIRONMENTAL SCIENCES↗

A Bayesian Framework for Landing Site Selection During Autonomous Spacecraft Descent

The success of a landed space exploration mission depends largely on the final landing site. Factors influencing site selection include safety, fuel-consumption, and scientific return. This paper addresses the problem of selecting the best available landing site based on these factors in real-time during autonomous spacecraft descent onto a planetary surface. The problem is modeled probabilistically using Bayesian Networks (BNs). BNs provide a means of representing the causal relationships between variables that impact the quality of a landing site. The final landing site is determined via probabilistic reasoning based on terrain safety derived from on-board sensors, available fuel based on spacecraft descent dynamics, and regions of interest defined by mission scientists.

entry, descent, landing (EDL)↗

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗

Characterization of partial wetting by CMAS droplets using multiphase many-body dissipative particle dynamics and data-driven discovery based on PINNs

The molten sand that is a mixture of calcia, magnesia, alumina and silicate, known as CMAS, is characterized by its high viscosity, density and surface tension. The unique properties of CMAS make it a challenging material to deal with in high-temperature applications, requiring innovative solutions and materials to prevent its buildup and damage to critical equipment. Here, we use multiphase many-body dissipative particle dynamics simulations to study the wetting dynamics of highly viscous molten CMAS droplets. The simulations are performed in three dimensions, with varying initial droplet sizes and equilibrium contact angles. We propose a parametric ordinary differential equation (ODE) that captures the spreading radius behaviour of the CMAS droplets. The ODE parameters are then identified based on the physics-informed neural network (PINN) framework. Subsequently, the closed-form dependency of parameter values found by the PINN on the initial radii and contact angles are given using symbolic regression. Finally, we employ Bayesian PINNs (B-PINNs) to assess and quantify the uncertainty associated with the discovered parameters. In brief, this study provides insight into spreading dynamics of CMAS droplets by fusing simple parametric ODE modelling and state-of-the-art machine-learning techniques.

Mechanics↗

Online LIBS–ML Framework for Dynamic Characterization of Heterogeneous Waste-Derived Gasification Feedstocks

LIBS−ML framework for real time feedstock characterization during continuous conveyor transport Heterogeneous waste derived feedstocks (e.g., waste coal, biomass and blends) introduce rapid variability in heating value and ash chemistry that affect gasifier operation, yet conventional laboratory characterization techniques are too slow to support proactive control. To address this gap, this study reports on an online, in situ, dynamic characterization framework that couple’s laser-induced breakdown spectroscopy (LIBS) with leakage safe machine learning (ML) regression to deliver real time, decision quality predictions of gasifier relevant properties. A controlled sample matrix spanning two different waste coals, two different biomasses, and engineered blends under two particle size conditions were constructed and benchmarked using standardized laboratory analyses for proximate/ultimate properties and ash composition. LIBS spectra were acquired dynamically as material flowed on a conveyor belt, using high energy 1064 nm laser ablation and shot averaging to improve repeatability and precision. Supervised regression models (multi layer perceptron (MLP) /artificial neural network (ANN), random forest (RF), and support vector regression (SVR)) and an optimized weighted ensemble were trained on emission line feature sets using nested cross validation with Bayesian hyperparameter tuning and validated against an independent hold out set. The proposed LIBS−ML workflow achieves near laboratory predictive fidelity across parametric targets (including higher heating value (HHV), ash content, fixed carbon, sulfur, major ash forming oxides, and initial deformation temperature (IDT)), with the weighted ensemble providing a robust default predictor under dynamic measurement conditions. These results demonstrate a practical pathway for real time feedstock characterization that can enable feedforward adjustments and more resilient gasifier operation for variable quality waste derived fuels.

Biomass↗

Enhancing Power Grid Resilience with Causal Loops Diagram and Bayesian Networks

Enhancing power grid resilience through improved analysis and planning of Distributed Energy Resources is a key for power system planner. This paper explores the integration of Causal Loop Diagrams (CLDs) and Bayesian Networks (BNs) for enhancing resilience in power systems, focusing on Distributed Energy Resources (DER) planning. By automating CLD analysis in Python's matplotlib, we present a tool for rapid model validation and structural accuracy, crucial for power system planners. This hybrid approach utilizes BNs for inferential depth and CLDs for dynamic system modeling, offering a comprehensive framework for policy formulation and collaborative strategy development against disruptions. Here, we highlight the tool's capability to identify and analyze interconnected feedback loops, facilitating a deeper understanding of DER integration's impact on network resilience. This work aims to bridge quantitative analysis and qualitative insights, addressing the limitations of each method while providing a robust model for power system resilience assessment.

14 SOLAR ENERGY↗

Inference of Transmission Network Structure from HIV Phylogenetic Trees

Phylogenetic inference is an attractive means to reconstruct transmission histories and epidemics. However, there is not a perfect correspondence between transmission history and virus phylogeny. Both node height and topological differences may occur, depending on the interaction between within-host evolutionary dynamics and between-host transmission patterns. To investigate these interactions, we added a within-host evolutionary model in epidemiological simulations and examined if the resulting phylogeny could recover different types of contact networks. To further improve realism, we also introduced patient-specific differences in infectivity across disease stages, and on the epidemic level we considered incomplete sampling and the age of the epidemic. Second, we implemented an inference method based on approximate Bayesian computation (ABC) to discriminate among three well-studied network models and jointly estimate both network parameters and key epidemiological quantities such as the infection rate. Our ABC framework used both topological and distance-based tree statistics for comparison between simulated and observed trees. Overall, our simulations showed that a virus time-scaled phylogeny (genealogy) may be substantially different from the between-host transmission tree. This has important implications for the interpretation of what a phylogeny reveals about the underlying epidemic contact network. In particular, we found that while the within-host evolutionary process obscures the transmission tree, the diversification process and infectivity dynamics also add discriminatory power to differentiate between different types of contact networks. We also found that the possibility to differentiate contact networks depends on how far an epidemic has progressed, where distance-based tree statistics have more power early in an epidemic. Finally, we applied our ABC inference on two different outbreaks from the Swedish HIV-1 epidemic.

60 APPLIED LIFE SCIENCES↗

Implementation of Dynamic Extensible Adaptive Locally Exchangeable Measures (IDEALEM) v 0.1

Handling large streaming data is essential for various applications such as network traffic analysis, social networks, energy cost trends, and environment modeling. However, it is in general intractable to store, compute, search, and retrieve large streaming data. This software addresses a fundamental issue, which is to reduce the size of large streaming data and still obtain accurate statistical analysis. As an example, when a high-speed network such as 100 Gbps network is monitored, the collected measurement data rapidly grows so that polynomial time algorithms (e.g., Gaussian processes) become intractable. One possible solution to reduce the storage of vast amounts of measured data is to store a random sample, such as one out of 1000 network packets. However, such static sampling methods (linear sampling) have drawbacks: (1) it is not scalable for high-rate streaming data, and (2) there is no guarantee of reflecting the underlying distribution. In this software, we implemented a dynamic sampling algorithm, based on the recent technology from the relational dynamic bayesian online locally exchangeable measures, that reduces the storage of data records in a large scale, and still provides accurate analysis of large streaming data. The software can be used for both online and offline data records.

Sim, Alex↗

Dynamical heating across the Milky Way disc using APOGEE and Gaia

Abstract The kinematics of the Milky Way disc as a function of age are well measured at the solar radius, but have not been studied over a wider range of Galactocentric radii. Here, we measure the kinematics of mono-age, mono-[Fe/H] populations in the low and high [α/Fe] discs between 4 ≲ R ≲ 13 kpc and |z| ≲ 2 kpc using 65 719 stars in common between APOGEE DR14 and Gaia DR2 for which we estimate ages using a Bayesian neural network model trained on asteroseismic ages. We determine the vertical and radial velocity dispersions, finding that the low and high [α/Fe] discs display markedly different age–velocity dispersion relations (AVRs) and shapes σz/σR. The high [α/Fe] disc has roughly flat AVRs and constant σz/σR = 0.64 ± 0.04, whereas the low [α/Fe] disc has large variations in this ratio that positively correlate with the mean orbital radius of the population at fixed age. The high [α/Fe] disc component’s flat AVRs and constant σz/σR clearly indicate an entirely different heating history. Outer disc populations also have flatter radial AVRs than those in the inner disc, likely due to the waning effect of spiral arms. Our detailed measurements of AVRs and σz/σR across the disc indicate that low [α/Fe], inner disc ($R \lesssim 10\, \mathrm{kpc}$) stellar populations are likely dynamically heated by both giant molecular clouds and spiral arms, while the observed trends for outer disc populations require a significant contribution from another heating mechanism such as satellite perturbations. We also find that outer disc populations have slightly positive mean vertical and radial velocities likely because they are part of the warped disc.

Mackereth, J. Ted↗

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↗

Continuous Time Group Discovery in Dynamic Graphs

With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

97 MATHEMATICS AND COMPUTING↗