Establishing Pattern Sequences Using Stochastic Trees and Bayesian Belief Networks With an Application to Security Patterns
Not Available
Matovič, Viktor [Faculty of Informatics and Inform↗
SEARCH · Search NASA
Results for “Belief Networks”
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.
Loop series expansions for tensor networks
Belief propagation (BP) can be a useful tool to approximately contract a tensor network, provided that the contributions from any closed loops in the network are sufficiently weak. In this article, we describe how a loop series expansion can be applied to systematically improve the accuracy of a BP approximation to a tensor network contraction, in principle converging arbitrarily close to the exact result. More generally, our result provides a framework for expanding a tensor network as a sum of component networks in a hierarchy of increasing complexity. We benchmark this proposal for the contraction of infinite projected entangled pair states, either representing the ground state of an Affleck-Kennedy-Lieb-Tasaki (AKLT) model or with randomly defined tensors, where it is shown to improve in accuracy over standard BP by several orders of magnitude while incurring only a minor increase in computational cost. These results indicate that the proposed series expansions could be a useful tool to accurately evaluate tensor networks in cases that otherwise exceed the limits of established contraction routines.
Evenbly, Glen [AWS Center for Quantum Computing, P↗
A Risk-Informed Approach to Trustworthiness Assessment in Digital Twins-Based Autonomous Control
In autonomous control systems, digital twins (DTs) are used to perform diagnostic and prognostic functions. The trustworthiness of these DTs is dependent on quality and coverage of the training data, model accuracy and integrity of sensor data. This work introduces a methodology to determine the trustworthiness of a DT system given faulty sensor data using a risk informed approach. Bayesian Belief Networks (BBNs) are used to propagate uncertainties and determine the probability of trustable recommendations. The decision to trust the control action provided by the DT is based on the DT output, expert opinion, and severity of problems. The performance of DTs is reliant on the data they are trained on. When they encounter out of distribution data, the trustworthiness of the recommendations decreases. To address this issue, we include an expert component that provides input on sensor degradation. For this, we utilize a generative artificial intelligence (AI) model, such as Generative Pretrained Transformer (GPT). The GPT functions as an expert with broad knowledge. The GPT is fine-tuned to understand and discriminate sensor degradation scenarios using manufactured data. This methodology is demonstrated through a case study on a Nearly Autonomous Management and Control System (NAMAC) during a steady state scenario. Various sensor degradation types with different severity levels are considered. Degraded sensor data is processed by the DT system and the fine-tuned GPT. Finally, using the BBN, we combine the GPT information and the DT output with its sources of uncertainty. This provides an output regarding the trustworthiness of the DT recommendation.
22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design
SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.
58 GEOSCIENCES↗
Climate warming enhances biodiversity and stability of grassland soil phosphorus-cycling microbial communities
Abstract Climate warming poses significant challenges to global phosphorus sustainability, an essential component of Earth biogeochemistry cycling and water-food-energy nexus. Despite the crucial role of polyphosphate-accumulating organism as key functional microbial agents in phosphorus cycling, the impacts of global climate warming on polyphosphate accumulating organism communities remain largely enigmatic. This study investigates the effects of climate warming on the taxonomic, network, and functional profiles of soil bacterial polyphosphate-accumulating organisms, leveraging fluorescence-activated cell sorting and single-cell Raman spectroscopy. Climate warming enhances both taxonomic and functional biodiversity of polyphosphate-accumulating organisms via biotic interactions and environmental filtering, with observed functionality-biodiversity relationships supporting the functional redundancy theory. Furthermore, polyphosphate-accumulating organism network complexity and stability rise under warming with strengthened positive relationships, supporting stress gradient hypothesis and the belief that complexity begets stability. Finally, polyphosphate-accumulating organisms are significantly correlated to key ecosystem functioning in carbon and phosphorus cycling under warming. Our study suggests that preserving polyphosphate-accumulating organism communities is crucial for maintaining soil ecosystem functioning and sustainable phosphorus management in a warming world and opens avenues for predicting the responses of other functional microbial groups to climate change, beneficially or maliciously.
Environmental Sciences & Ecology↗
Distribution of centrality measures on undirected random networks via the cavity method
The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Qubit Regularization of Quantum Field Theories
To study quantum field theories on a quantum computer, we must begin with Hamiltonians defined on a finite-dimensional Hilbert space and then take appropriate limits. This approach can be seen as a new type of regularization for quantum field theories, which we refer to as qubit regularization. A related finite-dimensional regularization, known as the D-theory approach, was proposed long ago as a general framework for all quantum field theories. In this framework, the dimensionality of the local Hilbert space at each spatial point can increase as needed through an additional flavor index. To reproduce asymptotically free QFTs, most studies assume that qubit-regularized theories require extending the local Hilbert space to infinity. However, contrary to this common belief, recent discoveries in (1+1) dimensions have revealed two examples where asymptotic freedom appears to emerge within a strictly finite-dimensional local Hilbert space through a novel renormalization group (RG) flow. These findings motivate further investigation into whether asymptotically free gauge theories could also emerge within a strictly finite-dimensional local Hilbert space. To support these explorations, we propose an orthonormal basis called the monomer-dimer-tensor-network (MDTN) basis and use it to construct new types of qubit-regularized lattice gauge theories.
Chandrasekharan, Shailesh [Duke Univ., Durham, NC ↗