The number of terms in the general gain formulas for Coates and Mason signal-flow- graphs
Number of terms in general gain formulas for Coates and Mason signal flow graphs
GAIN↗
SEARCH · Search NASA
Results for “graph”
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.
Coding graphs and information lossless automata
Coding graphs and information lossless automata
INFORMATION↗
Systematics of organic molecules, graph topology and Hamilton circuits. A general outline of the Dendral system Interim report
Systematics of organic molecules, graph topology and Hamilton circuits
MOLECULE↗
On certain information-theoretic concepts in the theory of graphs
Information-theoretic concepts in theory of random graphs - entropy functions for probability distributions and Markov chains
ENTROPY↗
Air radiation graphs - Spectrally integrated fluxes including line contributions and self absorption
Air radiation graphs - spectrally integrated fluxes including line contributions and self- absorption
RADIATION EMISSION↗
The product form of inverses of sparse matrices and graph theory.
Geometric interpretation of product form of inverse applied to sparse matrices in linear programming, using graph theory
LINEAR PROGRAMMING↗
Requirement Discovery Using Embedded Knowledge Graph with ChatGPT
- NASA’s Air Traffic Management-Exploration (ATM-X) Urban Air Mobility (UAM) Airspace Subproject is conducting research that evolves UAM airspace towards a highly automated and operationally flexible system of the future. - (see https://www.nasa.gov/uam-overview/ for more information) - The complexity of UAM airspace, and its evolution through a series of transformative epochs, requires a planning tool to effectively organize, integrate, and communicate the research that will guide the evolution of UAM operations in the National Airspace System (NAS). - The planning tool, called the UAM airspace research roadmap (or just roadmap), is being developed as a new system engineering methodology leveraging model based system engineering (MBSE) and artificial intelligence capabilities. This presentation gives an overview of the Knowledge Graph and ChatGPT applications within this system engineering methodology and will describe how it is being used to meet the ATM-X UAM Airspace Subproject’s overarching research goals.
systems engineering↗
Trust-Informed Large Language Models via Word Embedding-Knowledge Graph Alignment
A major weakness of a Large Language Model (LLM) is its tendency to accept information at face value, often leading to injection of erroneous information and inducing a greater probability of hallucinating non-existent information. While Retrieval Augmented Generation (RAG) uses external knowledge sources to bolster LLMs through grounded truth, this work seeks to explore methods to engender a LLM with an intrinsic capability to evaluate an input’s believability without relying on external knowledge sources. We investigate unifying a LLM with a Knowledge Graph (KG) and using the KG to reinforce the LLM’s internal word embedding while also maintaining belief metrics along the edge’s in the KG.
Large Language Model↗
Nasa Genelab - Knowledge Graph Fabric Enables Deep Biomedical Analysis of Multi-Omics Datasets
The limited number of astronauts and human samples from long-duration space missions pose significant challenges for studying the health risks associated with spaceflight and developing new treatments. As a result, much of our understanding of the biological impact of space travel relies on samples from model organisms. NASA GeneLab, integrated into Open Science Data Repository (OSDR) is a centralized multi-omics resource containing almost 1000 datasets from over 500 space-related studies from human and model organism samples. Previous studies have demonstrated that human phenotypes and physiological changes caused by spaceflight can be identified by connecting gene expression data from model organisms flown in space to a biomedical knowledge graph (SPOKE). In this work, we present a data fabric connecting OSDR datasets to SPOKE that empowers biomedical analyses through the GeneLab visualization portal. This collaboration is funded by NSF’s Proto-OKN program.
data fabric↗
Graph-Theoretic Approaches to Quantifying Power System Resiliency
Although gaining growing importance, the subject of power system resiliency still lacks a commonly acknowledged metric. As a contribution to solving this complication, in this paper we leverage the concepts of spanning trees and Fiedler value from graph theory to propose two topology-based indices for quantifying the resiliency of power systems. The proposed indices require least information and may be applied to any other flow network, such as water or gas pipeline networks.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Knowledge Graphs and Large Language Models for Safety Analysis in Nuclear Reactors - Raul Razo Intern Poster
This is my Intern poster and deliverable. It is about using knowledge graphs and large language models for safety analysis in nuclear reactors.
99 - GENERAL AND MISCELLANEOUS↗
Uncertainty quantification of graph convolution neural network models of evolving processes
The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.
36 MATERIALS SCIENCE↗
Boosting efficiency and reducing graph reliance: Basis adaptation integration in Bayesian multi-fidelity networks
The computational cost of high-fidelity numerical models makes outer-loop analysis, which requires repeated interrogation of the model such as uncertainty quantification, computationally demanding. Multi-fidelity methods, which construct a surrogate model using data from an ensemble of models of varying cost and accuracy, can substantially reduce the cost of outer-loop analysis. However, these methods can be difficult to apply when the model ensemble does not admit a clear hierarchy a priori and the correlations between models are low. Consequently, in this paper, we present a multi-fidelity method that leverages dimension reduction to enhance the correlation between models, thereby reducing the amount of data needed to train a surrogate from an unordered ensemble of models. Our method utilizes basis adaptation to build low-dimensional polynomial chaos expansions of each model and employs Multi-fidelity Networks to encode the relationships among models. We show that the resulting method exhibit two notable advantages over its counterpart: (1) enhanced accuracy (both reduced bias and variance); and (2) reduced dependency on the graph structure encoding relationships among models. We demonstrate the approach on an analytical test problem and a challenging finite element model for a spent nuclear fuel. Our method produces a surrogate model that is significantly more accurate than either a single-fidelity surrogate or a multi-fidelity surrogate constructed without basis adaptation.
42 ENGINEERING↗
Design and simulation of a SiPM-on-tile ZDC for the future EIC, and its performance with graph neural networks
We present a design for a high-granularity zero-degree calorimeter (ZDC) for the upcoming Electron-Ion Collider (EIC). The design uses SiPM-on-tile technology and features a novel staggered-layer arrangement that improves spatial resolution. To fully leverage the design’s high granularity and non-trivial geometry, we employ graph neural networks (GNNs) for energy and angle regression as well as signal classification. The GNN-boosted performance metrics meet, and in some cases, significantly surpass the requirements set in the report on science requirements and detector requirements for the EIC (Yellow Report), laying the groundwork for enhanced measurements that will facilitate a wide physics program. Our studies show that GNNs can significantly enhance the performance of high-granularity CALICE-style calorimeters by automating and optimizing the software compensation algorithms required for these systems. This improvement holds true even in the case of complicated geometries that pose challenges for image-based AI/ML methods.
Calorimeter↗
Bounce-averaged theory in arbitrary multi-well plasmas: solution domains and the graph structure of their connections
Bounce-averaged theories provide a framework for simulating relatively slow processes, such as collisional transport and quasilinear diffusion, by averaging these processes over the fast periodic motions of a particle on a closed orbit. This procedure dramatically increases the characteristic time scale and reduces the dimensionality of the modelled system. The natural coordinates for such calculations are the constants of motion (COM) of the fast particle motion, which by definition do not change during an orbit. However, for sufficiently complicated fields – particularly in the presence of local maxima of the electric potential and magnetic field – the COM are not sufficient to specify the particle trajectory. In such cases, multiple domains in COM space must be used to solve the problem, with boundary conditions enforced between the domains to ensure continuity and particle conservation. Previously, these domains have been imposed by hand, or by recognising local maxima in the fields, limiting the flexibility of bounce-averaged simulations. Here, we present a general set of conditions for identifying consistent domains and the boundary condition connections between the domains, allowing the application of bounce-averaged theories in arbitrarily complicated and dynamically evolving electromagnetic field geometries. We also show how the connections between the domains can be represented by a directed graph, which can help to succinctly represent the trajectory bifurcation structure.
fusion plasma↗
Defect Diffusion Graph Neural Networks for Materials Discovery in High-Temperature Energy Applications
Here, the migration of crystallographic defects dictates material properties and performance for a plethora of technological applications. Density functional theory (DFT)-based nudged elastic band (NEB) calculations are a powerful computational technique for predicting defect migration activation energy barriers, yet they become prohibitively expensive for high-throughput screening of defect diffusivities. Without introducing hand-crafted (i.e., chemistry- or structure-specific) descriptors, we propose a generalized deep learning approach to train surrogate models for NEB energies of vacancy migration by hybridizing graph neural networks with transformer encoders and simply using pristine host structures as input. With sufficient training data, computationally efficient and simultaneous inference of vacancy defect thermodynamics and migration activation energies can be obtained to compute temperature-dependent vacancy diffusivities and to down-select candidates for more thorough DFT analysis or experiments. Thus, as we specifically demonstrate for potential water-splitting materials, candidates with desired defect thermodynamics, kinetics, and host stability properties can be more rapidly targeted from open-source databases of experimentally validated or hypothetical materials.
14 SOLAR ENERGY↗
HEPOM: Using Graph Neural Networks for the Accelerated Predictions of Hydrolysis Free Energies in Different pH Conditions
Hydrolysis is a fundamental family of chemical reactions where water facilitates the cleavage of bonds. The process is ubiquitous in biological and chemical systems, owing to water’s remarkable versatility as a solvent. However, accurately predicting the feasibility of hydrolysis through computational techniques is a difficult task, as subtle changes in reactant structure like heteroatom substitutions or neighboring functional groups can influence the reaction outcome. Furthermore, hydrolysis is sensitive to the pH of the aqueous medium, and the same reaction can have different reaction properties at different pH conditions. In this work, we have combined reaction templates and high-throughput ab initio calculations to construct a diverse data set of hydrolysis free energies. The developed framework automatically identifies reaction centers, generates hydrolysis products, and utilizes a trained graph neural network (GNN) model to predict ΔG values for all potential hydrolysis reactions in a given molecule. The long-term goal of the work is to develop a data-driven, computational tool for high-throughput screening of pH-specific hydrolytic stability and the rapid prediction of reaction products, which can then be applied in a wide array of applications including chemical recycling of polymers and ion-conducting membranes for clean energy generation and storage.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗