Search NASA⌕ Search

SEARCH · Search NASA

Results for “bipartite 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.

4 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2022

The expanding network of mineral chemistry throughout earth history reveals global shifts in crustal chemistry during the Proterozoic.

Earth surface redox conditions are intimately linked to the co-evolution of the geosphere and biosphere. Minerals provide a record of Earth’s evolving surface and interior chemistry in geologic time due to many diferent processes (e.g. tectonic, volcanic, sedimentary, oxidative, etc.). Here, we show how the bipartite network of minerals and their shared constituent elements expanded and evolved over geologic time. To further investigate network expansion over time, we derive and apply a novel metric (weighted mineral element electronegativity coefcient of variation; wMEECV) to quantify intra-mineral electronegativity variation with respect to redox. We fnd that element electronegativity and hard soft acid base (HSAB) properties are central factors in mineral redox chemistry under a wide range of conditions. Global shifts in mineral element electronegativity and HSAB associations represented by wMEECV changes at 1.8 and 0.6 billion years ago align with decreased continental elevation followed by the transition from the intermediate ocean and glaciation eras to postglaciation, increased atmospheric oxygen in the Phanerozoic, and enhanced continental weathering. Consequently, network analysis of mineral element electronegativity and HSAB properties reveal that orogenic activity, evolving redox state of the mantle, planetary oxygenation, and climatic transitions directly impacted the evolving chemical complexity of Earth’s crust.

Eli K. Moore↗
NASA NTRS2010

Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves

One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.

Mengshoel, Ole J.↗
NASA NTRS2009

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗
NASA NTRS1994

The network data delivery service: A real-time data connectivity system

A network data-sharing system, the Network Data Delivery Service (NDDS), is discussed. The NDDS system relies on a bipartite model consisting of the following: information producers (sources) and information consumers (sinks). The example provided by a dual-arm robotic system is examined.

Pardo-Castellote, Gerardo↗