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

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↗

Chaotic neural dynamics facilitate probabilistic computations through sampling

Cortical neurons exhibit highly variable responses over trials and time. Theoretical works posit that this variability arises potentially from chaotic network dynamics of recurrently connected neurons. Here, we demonstrate that chaotic neural dynamics, formed through synaptic learning, allow networks to perform sensory cue integration in a sampling-based implementation. We show that the emergent chaotic dynamics provide neural substrates for generating samples not only of a static variable but also of a dynamical trajectory, where generic recurrent networks acquire these abilities with a biologically plausible learning rule through trial and error. Furthermore, the networks generalize their experience in the stimulus-evoked samples to the inference without partial or all sensory information, which suggests a computational role of spontaneous activity as a representation of the priors as well as a tractable biological computation for marginal distributions. These findings suggest that chaotic neural dynamics may serve for the brain function as a Bayesian generative model.

60 APPLIED LIFE SCIENCES↗

Machine learning for continuous quantum error correction on superconducting qubits

Abstract Continuous quantum error correction has been found to have certain advantages over discrete quantum error correction, such as a reduction in hardware resources and the elimination of error mechanisms introduced by having entangling gates and ancilla qubits. We propose a machine learning algorithm for continuous quantum error correction that is based on the use of a recurrent neural network to identify bit-flip errors from continuous noisy syndrome measurements. The algorithm is designed to operate on measurement signals deviating from the ideal behavior in which the mean value corresponds to a code syndrome value and the measurement has white noise. We analyze continuous measurements taken from a superconducting architecture using three transmon qubits to identify three significant practical examples of non-ideal behavior, namely auto-correlation at temporal short lags, transient syndrome dynamics after each bit-flip, and drift in the steady-state syndrome values over the course of many experiments. Based on these real-world imperfections, we generate synthetic measurement signals from which to train the recurrent neural network, and then test its proficiency when implementing active error correction, comparing this with a traditional double threshold scheme and a discrete Bayesian classifier. The results show that our machine learning protocol is able to outperform the double threshold protocol across all tests, achieving a final state fidelity comparable to the discrete Bayesian classifier.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Feasibility of Vascular Parameter Estimation for Assessing Hypertensive Pregnancy Disorders

Abstract Hypertensive pregnancy disorders (HPDs), such as pre-eclampsia, are leading sources of both maternal and fetal morbidity in pregnancy. Noninvasive imaging, such as ultrasound (US) and magnetic resonance imaging (MRI), is an important tool for predicting and monitoring these high risk pregnancies. While imaging can measure hemodynamic parameters, such as uterine artery pulsatility and resistivity indices (PI and RI), the interpretation of such metrics for disease assessment relies on ad hoc standards, which provide limited insight to the physical mechanisms underlying the emergence of hypertensive pregnancy disorders. To provide meaningful interpretation of measured hemodynamic data in patients, advances in computational fluid dynamics can be brought to bear. In this work, we develop a patient-specific computational framework that combines Bayesian inference with a reduced-order fluid dynamics model to infer parameters, such as vascular resistance, compliance, and vessel cross-sectional area, known to be related to the development of hypertension. The proposed framework enables the prediction of hemodynamic quantities of interest, such as pressure and velocity, directly from sparse and noisy MRI measurements. We illustrate the effectiveness of this approach in two systemic arterial network geometries: an aorta with branching carotid artery and a maternal pelvic arterial network. For both cases, the model can reconstruct the provided measurements and infer parameters of interest. In the case of the maternal pelvic arteries, the model can make a distinction between the pregnancies destined to develop hypertension and those that remain normotensive, expressed through the value range of the predicted absolute pressure.

Biophysics↗

PINN surrogate of Li-ion battery models for parameter inference, Part I: Implementation and multi-fidelity hierarchies for the single-particle model

To plan and optimize energy storage demands that account for Li-ion battery aging dynamics, techniques need to be developed to diagnose battery internal states accurately and rapidly. Here, this study seeks to reduce the computational resources needed to determine a battery's internal states by replacing physics-based Li-ion battery models - such as the single-particle model (SPM) and the pseudo-2D (P2D) model - with a physics-informed neural network (PINN) surrogate. The surrogate model makes high-throughput techniques, such as Bayesian calibration, tractable to determine battery internal parameters from voltage responses. This manuscript is the first of a two-part series that introduces PINN surrogates of Li-ion battery models for parameter inference (i.e., state-of-health diagnostics). In this first part, a method is presented for constructing a PINN surrogate of the SPM. A multi-fidelity hierarchical training, where several neural nets are trained with multiple physics-loss fidelities is shown to significantly improve the surrogate accuracy when only training on the governing equation residuals. The implementation is made available in a companion repository (https://github.com/NREL/PINNSTRIPES). The techniques used to develop a PINN surrogate of the SPM are extended in Part II for the PINN surrogate for the P2D battery model, and explore the Bayesian calibration capabilities of both surrogates.

25 ENERGY STORAGE↗

A Multirange Vehicle Speed Prediction With Application to Model Predictive Control-Based Integrated Power and Thermal Management of Connected Hybrid Electric Vehicles

Abstract Connectivity and automated driving technologies have opened up new research directions in the energy management of vehicles which exploit look-ahead preview and enhance the situational awareness. Despite this advancement, the vehicle speed preview that can be obtained from vehicle-to-vehicle/infrastructure (V2V/I) communications is often limited to a relatively short time-horizon. The vehicular energy systems, specifically those of the electrified vehicles, consist of multiple interacting power and thermal subsystems that respond over different time-scales. Consequently, their optimal energy management can greatly benefit from long-term speed prediction beyond that available through V2V/I communications. Accurately extending the look-ahead preview, on the other hand, is fundamentally challenging due to the dynamic nature of the traffic environment. To address this challenge, we propose a data-driven multirange vehicle speed prediction strategy for arterial corridors with signalized intersections, providing the vehicle speed preview for three different ranges, i.e., short-, medium-, and long-range. The short-range preview is obtained by V2V/I communications. The medium-range preview is realized using a neural network (NN), while the long-range preview is predicted based on a Bayesian network (BN). The predictions are updated in real-time based on the current state of traffic and incorporated into a multihorizon model predictive control (MH-MPC) for integrated power and thermal management (iPTM) of connected vehicles. The results of design and evaluation of the performance of the proposed data-informed MH-MPC for iPTM of connected hybrid electric vehicles (HEVs) using traffic data for real-world city driving are reported.

Automation & Control Systems↗

Towards a data-driven model of hadronization using normalizing flows

We introduce a model of hadronization based on invertible neural networks that faithfully reproduces a simplified version of the Lund string model for meson hadronization. Additionally, we introduce a new training method for normalizing flows, termed MAGIC, that improves the agreement between simulated and experimental distributions of high-level (macroscopic) observables by adjusting single-emission (microscopic) dynamics. Our results constitute an important step toward realizing a machine-learning based model of hadronization that utilizes experimental data during training. Finally, we demonstrate how a Bayesian extension to this normalizing-flow architecture can be used to provide analysis of statistical and modeling uncertainties on the generated observable distributions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dynamic Matrix Completion Based State Estimation in Distribution Grids

The power distribution network is undergoing tremendous transformation due to an increase in the penetration of renewable energy resources and electric vehicles. These changes have resulted in greater uncertainty and dynamics in the distribution grid states. Therefore, the ability to track and monitor system states has become a critical need for accurate and timely control actions. In this paper, we propose two dynamic sparsity-based state estimation approaches for distribution systems: (1) locally weighted matrix completion (LW-MC) and (2) Bayesian matrix completion with Kalman filter prediction (BMC-KF). The performance of the proposed dynamic state estimation strategies is compared with the classic/static matrix completion (static-MC) approach using the IEEE 37 and IEEE 123 bus test systems. Finally, results indicate that BMC-KF approach outperforms both LW-MC as well as static-MC even when 30% of the measurement data is available. Computational complexity associated with both approaches is quantified.

42 ENGINEERING↗

Quantified limits of the nuclear landscape

The chart of the nuclides is limited by particle drip lines beyond which nuclear stability to proton or neutron emission is lost. Predicting the range of particle-bound isotopes poses an appreciable challenge for nuclear theory as it involves extreme extrapolations of nuclear masses well beyond the regions where experimental information is available. Still, quantified extrapolations are crucial for a wide variety of applications, including the modeling of stellar nucleosynthesis. We use microscopic nuclear global mass models, current mass data, and Bayesian methodology to provide quantified predictions of proton and neutron separation energies as well as Bayesian probabilities of existence throughout the nuclear landscape all the way to the particle drip lines. Here, we apply nuclear density functional theory with several energy density functionals. We also consider two global mass models often used in astrophysical nucleosynthesis simulations. To account for uncertainties, Bayesian Gaussian processes are trained on the separation-energy residuals for each individual model, and the resulting predictions are combined via Bayesian model averaging. This framework allows to account for systematic and statistical uncertainties and propagate them to extrapolative predictions. We establish and characterize the drip-line regions where the probability that the nucleus is particle- bound decreases from 1 to 0. In these regions, we provide quantified predictions for one- and two-nucleon separation energies. According to our Bayesian model averaging analysis, 7759 nuclei with Z ≤ 119 have a probability of existence ≥ 0.5. The extrapolation results obtained in this study will be put through stringent tests when new experimental information on existence and masses of exotic nuclei becomes available. In this respect, the quantified landscape of nuclear existence obtained in this study should be viewed as a dynamical prediction that will be fine-tuned when new experimental information and improved global mass models become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Anomaly Detection in Dynamic Networks

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

97 MATHEMATICS AND COMPUTING↗

Advance Liquid Metal Reactor Discrete Dynamic Event Tree/Bayesian Network Analysis and Incident Management Guidelines (Risk Management for Sodium Fast Reactors)

Accident management is an important component to maintaining risk at acceptable levels for all complex systems, such as nuclear power plants. With the introduction of self-correcting, or inherently safe, reactor designs the focus has shifted from management by operators to allowing the system's design to manage the accident. Inherently and passively safe designs are laudable, but nonetheless extreme boundary conditions can interfere with the design attributes which facilitate inherent safety, thus resulting in unanticipated and undesirable end states. This report examines an inherently safe and small sodium fast reactor experiencing a beyond design basis seismic event with the intent of exploring two issues: (1) can human intervention either improve or worsen the potential end states and (2) can a Bayesian Network be constructed to infer the state of the reactor to inform.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Machine Learning

The absence of a robust and unified theory of cyber dynamics presents challenges and opportunities for using machine learning based data-driven approaches to further the understanding of the behavior of such complex systems. Analysts can also use machine learning approaches to gain operational insights. In order to be operationally beneficial, cybersecurity machine learning based models need to have the ability to: (1) represent a real-world system, (2) infer system properties, and (3) learn and adapt based on expert knowledge and observations. Probabilistic models and Probabilistic graphical models provide these necessary properties and are further explored in this chapter. Bayesian Networks and Hidden Markov Models are introduced as an example of a widely used data driven classification/modeling strategy.

Anomaly detection↗

Workshop on Current Issues in Predictive Approaches to Intelligence and Security Analytics: Fostering the Creation of Decision Advantage through Model Integration and Evaluation

The increasing asymmetric nature of threats to the security, health and sustainable growth of our society requires that anticipatory reasoning become an everyday activity. Currently, the use of anticipatory reasoning is hindered by the lack of systematic methods for combining knowledge- and evidence-based models, integrating modeling algorithms, and assessing model validity, accuracy and utility. The workshop addresses these gaps with the intent of fostering the creation of a community of interest on model integration and evaluation that may serve as an aggregation point for existing efforts and a launch pad for new approaches.

97 MATHEMATICS AND COMPUTING↗