Search NASA⌕ Search

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.

At least 1,135 records · Page 63
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Augmenting Conceptual Design Trajectory Tradespace Exploration with Graph Theory

Within conceptual design changes occur rapidly due to a combination of uncertainty and shifting requirements. To stay relevant in this fluid time, trade studies must also be performed rapidly. In order to drive down analysis time while improving the information gained by these studies, surrogate models can be created to represent the complex output of a tool or tools within a specified tradespace. In order to create this model however, a large amount of data must be collected in a short amount of time. By this method, the historical approach of relying on subject matter experts to generate the data required is schedule infeasible. However, by implementing automation and distributed analysis the required data can be generated in a fraction of the time. Previous work focused on setting up a tool called multiPOST capable of orchestrating many simultaneous runs of an analysis tool assessing these automated analyses utilizing heuristics gleaned from the best practices of current subject matter experts. In this update to the previous work, elements of graph theory are included to further drive down analysis time by leveraging data previously gathered. It is shown to outperform the previous method in both time required, and the quantity and quality of data produced.

Dees, Patrick D.↗
NASA NTRS2019

Using Graph Coloring to Compute Total Derivatives More Efficiently in OpenMDAO

When they are applicable, gradient based optimization algorithms are the most efficient way to solve design optimization problems. Although gradient based methods are generally efficient, they can be made significantly more so through the usage of analytic techniques to compute the necessary total derivatives. The traditional forward (direct) and reverse (adjoint) analytic techniques have computational costs that scale linearly with the number of design variables and the number of constraints, respectively. In this work, we present an application of a graph coloring algorithm to the analytic techniques for computing total derivative Jacobians in order to achieve much better computational scaling than the pure analytic methods can provide alone. A detailed theoretical explanation of how coloring algorithms interact with analytic derivative methods is presented that illustrates specific types of sparsity patterns that must be present in total derivative Jacobians in order for this coloring technique to be effective. The new technique has been implemented as a feature in the OpenMDAO framework and the implementation is demonstrated on two example problems. The performance on the example problems up to 50% reduction in compute cost for optimizations with bi-directional coloring compared to traditional constraint aggregation. Additionally, the results show how coloring technique alleviates some of the numerical difficulties that constraint aggregation can cause, leading to the ability to solve larger problems. It is expected that the new method will have wide applicability to multidisciplinary optimization problems, and that its availability in OpenMDAO will offer significant computational savings for users without the need for them to implement the coloring algorithm themselves.

Trajectory↗
NASA NTRSDate not supplied

Interpretable Tree-Based and Graph Neural Network Approaches for Novel Solid State Electrolyte Design

All-solid-state batteries with Li metal anode can address the safety issues surrounding traditional Li-ion batteries as well as the demand for higher energy densities. However, the development of solid electrolytes simultaneously possessing high ionic conductivity and good chemical and electrochemical stabilities has proven to be a challenge. I will present our informatics approach to explore the Li compound space for promising solid electrolytes using high-throughput multi-property screening and interpretable machine learning. This is accomplished through the generation of a large database of battery-related materials properties of Li compounds. We use tree-based ensemble learning methods and graph neural network approaches to accurately learn relationships between crystal structures and corresponding thermodynamic and kinetic properties, with interpretability being a major focus. Our models give us the ability to enable rapid discovery and design of novel solid-state battery chemistries.

Materials discovery↗
NASA NTRSDate not supplied

Methods for Determining Subsets of High Impact, Probabilistically Dependent Medical Conditions Represented in a Directed Graph

One of the longest standing questions in network theory is how a component influences other parts in the system, and how that role is affected when restricting the navigation through the network. The Katz score, one of many centrality measures created for this purpose, takes into account all possible walks through the network, penalizing each additional step in a walk by a scalar called the Katz parameter. This centrality measure often covers an infinite number of walks with infinite length. In this paper we identify the maximum path length which has influence on the Katz score. We ultimately provide guidance when deciding which Katz parameter to use as it depends on the path length of interest. We show how changing the Katz parameter affects the ranking of the vertices in some synthetic graphs as well as NASA's expert informed network of medical dependencies called the Susceptibility Inference Network (SIN).

Hunter Rehm↗
NASA NTRSDate not supplied

Development of A Directed Acyclic Graph for Venous Thromboembolism During Spaceflight

Introduction: Recent studies have reported the development of venous blood flow stasis in astronauts and an occlusive venous thrombosis during spaceflight. Subsequent investigations revealed approximately one quarter of surveilled crew members had some degree of blood flow stasis in the left internal jugular vein. Therefore, NASA’s Human System Risk Board now formally tracks venous thromboembolism (VTE) as a “concern” for human spaceflight. To investigate potential mechanisms by which exposures concomitant with spaceflight (e.g., microgravity, radiation) may contribute to VTE, we developed a causal diagram in the form of a directed acyclic graph (DAG). Methods: The mechanisms by which spaceflight exposures may elevate the risk of VTE and the downstream effects on mission outcomes were critically analyzed, taking into account scientific literature and subject matter expertise consultation, and a DAG was generated. A Level-of-Evidence score for each causal relationship was assigned based on assessing the literature against a set of criteria derived from the A. Bradford Hill Causal Guidelines. Results: The set of three main factors that predispose people to VTE (hypercoagulability, endothelial damage, and blood stasis) is known as Virchow’s Triad. In constructing the DAG for VTE we articulated various mechanisms by which the principal spaceflight hazards (microgravity, radiation, closed hostile environment, isolation and confinement, distance from Earth) are thought to interact with or cause the components in Virchow’s triad. We found sufficient evidence to at least speculate that fluid shifts from microgravity, compensatory alterations in hematologic indices, spaceflight atmospheric conditions, and oxidative stress/inflammation from radiation may be potential contributors to VTE development. Discussion: Developing the DAG entailed a systematic and repeatable approach for visualizing relationships between contributing factors that may lead to VTE in spaceflight. Articulating pathways linking spaceflight exposures to VTE risk factors and possible VTE development enables subject matter experts from different domains to construct a shared mental model. Assignment of levels of evidence scores to the relationships helps identify knowledge and capability gaps that should be considered for further investigation. Furthermore, the DAG highlights modifiable variables and may therefore facilitate the development of new VTE risk mitigation strategies.

Alexander Svoronos↗
NASA NTRS2024

Analyzing EOSDIS Dataset Research Outputs using Knowledge Graphs and Large Language Models

Datasets, unlike publications, can be updated over time, with each new version receiving a DOI but not always being linked to previous ones. This complicates tracking citations across a dataset’s lifecycle. We address this by integrating dataset versions and citations into a knowledge graph (KG), which helps trace dataset citations and analyze dataset usage in applied research. To categorize publications from various journals, we fine-tuned NASA IMPACT INDUS Large Language Model (LLM) on a labeled publication set, assigning publications to one of twenty applied research areas. By linking datasets to these research areas, we improved dataset searchability and discovery through these domains.

open-source↗
NASA NTRSDate not supplied

Discovering Research Areas in Dataset Applications Through Knowledge Graphs and Large Language Models

Scientific datasets are increasingly cited in peer-reviewed journal publications, facilitating easy access to research utilizing those datasets. Datasets undergo a life cycle where older versions of datasets are replaced by newer versions often due to improvements in data resolution, algorithms, and other factors. Unlike peer reviewed documents registered with a single Digital Unique Identifier (DOI), datasets can be updated over time and the newer version of the datasets are registered with a new DOI which is not necessarily linked to the previous version of the dataset. It is challenging when publications citing a dataset need to be traced over the entire life cycle of that dataset. We provide an innovative approach to link the dataset versions and publications using a knowledge graph (KG). KG can help to trace the dataset cited in publications over the entire dataset life cycle and shed light into dataset usage in various applied research areas. We fine-tuned the pretrained NASA IMPACTINDUS Large Language Model (LLM) on a set of labeled publications abstracts. Our results showed that 87% of the publications were classified into one of twenty applied research areas, while the remaining 13% were classified into non-applied research areas. By linking datasets to applied research areas through the KG and employing Global Change Master Directory(GCMD), a well-established controlled vocabulary of scientific keywords describing Earth science datasets, we contribute to a transparent and advanced search and discovery mechanism for datasets across the Earth data ecosystem. The integrated KG and LLM approach is now incorporated and operational in dataset publication management at one of NASA’s Earth science data archival centers.

data provenance↗
NASA NTRSDate not supplied

Enhancing Dataset Discovery and Usage Tracking in Earth Sciences: Integrating Knowledge Graphs and Large Language Models

NASA's Data Active Archive Centers (DAACs) have played a crucial role in supporting a wide range of applied research in Earth and Environmental sciences. To date, over 20,000 publications have been collected, citing more than 3,000 NASA Earth science datasets. We present an innovative approach that links datasets and collected publications through a knowledge graph (KG). This KG enables the tracking of dataset citations throughout the dataset's lifecycle, revealing patterns of dataset usage across various applied research areas. We fine-tuned the pre-trained NASA IMPACT INDUS-Base Retriever Large Language Model (LLM) using a set of labeled publication abstracts. Our results indicate that 87% of the publications were classified into one of twenty applied research areas, while the remaining 13% were categorized into non-applied research areas. The classified publications linked to datasets are used to discover datasets by users interested in specific applied research and by dataset providers to determine dataset usage for applications.

open-source↗
NASA NTRSDate not supplied

Incorporation of Human Risk Directed Acyclic Graphs (DAG) With Mishap Investigations to Un-Silo Knowledge

NASA’s Human System Risk Board (HSRB) has been a central driver in efforts to understand, mitigate, and communicate the 29 human systems risks monitored by the board. As a result of the collaboration between research, operations, and technical authorities, large bodies of knowledge have been collected and digested to represent the current understanding of the risks. As a part of these bodies of knowledge, directed acyclic graphs (DAGs) have been developed to communicate the current understanding of the causal relationship of the hazards, contributing factors, countermeasures, other risks, and outcomes that contribute to the overall risk. This risk knowledge is applied in a theoretical sense for potential incidents during exploration even while informed by surveillance data. However, there have been mishaps and close calls during past space exploration that intersect with one or more of the Human System Risks DAGs and knowledge bases. The purpose of this exercise was to un-silo this risk knowledge and connect it to the close call of EVA 23 through the development of a DAG representing the intersection of the HSRB Risks and the events of the close call. The development of the DAG occurred through an iterative process, with each iteration expanding and/or refining the nodes and connections described by the source materials. In addition to the risk documentation developed by the HSRB, lessons learned and other mishap investigation documents were utilized to understand the events that led to water entering the helmet of a crewmember on the EVA. New nodes specific to the events of EVA 23 were interconnected with existing HSRB DAG nodes and edges. Nodes within the DAG were defined within a “DAG-tionary” with any updates to a definition that may have previously existed from the HSRB DAGs, and edges were recorded in a matrix. Both the DAG-tionary and matrix describe where nodes and edges are present across the Risk and Mishap DAG. This DAG will then be reviewed by experts outside of HSRB and HRP to confirm that interpretations of the non-health related events (such as the engineering nodes) are represented accurately. DISCUSSION This process highlighted a method by which the knowledge generated among the contributing members of the HSRB Risks can be effectively adapted and utilized through the tools employed by the Risk Custodian teams. By leveraging these tools, new context and insights to the information at hand can be brought forward to address current spaceflight challenges. Moreover, un-siloing this knowledge through future DAGs and other efforts can drive interprofessional collaboration and foster communication. This will enable teams to work together more effectively, leveraging their diverse expertise to tackle the complex challenges of space exploration and human research. Ultimately, this collaboration will bring NASA closer to achieve agency goals and contribute to the overall shared mission and vision.

Samuel Jacobs↗
DOE OSTI2014

Graph-theoretic analysis of discrete-phase-space states for condition change detection and quantification of information

Data collected from devices and human condition may be used to forewarn of critical events such as machine/structural failure or events from brain/heart wave data stroke. By monitoring the data, and determining what values are indicative of a failure forewarning, one can provide adequate notice of the impending failure in order to take preventive measures. This disclosure teaches a computer-based method to convert dynamical numeric data representing physical objects (unstructured data) into discrete-phase-space states, and hence into a graph (structured data) for extraction of condition change.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

Bayati Kim Saberi random graph sampler

This software package implements the algorithm from a paper by Bayati, Kim, and Saberi (first reference below) to generate a uniformly random sample of a graph with a prescribed degree distribution.

Gleich, David F.↗
DOE OSTI2012

Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

Source record↗
DOE OSTI2016

Data graphing methods, articles of manufacture, and computing devices

Data graphing methods, articles of manufacture, and computing devices are described. In one aspect, a method includes accessing a data set, displaying a graphical representation including data of the data set which is arranged according to a first of different hierarchical levels, wherein the first hierarchical level represents the data at a first of a plurality of different resolutions which respectively correspond to respective ones of the hierarchical levels, selecting a portion of the graphical representation wherein the data of the portion is arranged according to the first hierarchical level at the first resolution, modifying the graphical representation by arranging the data of the portion according to a second of the hierarchal levels at a second of the resolutions, and after the modifying, displaying the graphical representation wherein the data of the portion is arranged according to the second hierarchal level at the second resolution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Realistic Simulation of Property Graphs

Building on the existing Multiplicative Attribute Graph (MAG) model, the software relaxes the assumptions of the MAG model allowing dataset expansion while replicating statistical properties.

Source record↗
DOE OSTI2019

Behavior specification, finding main, and call graph visualizations

A process transforms compiled software into a semantic form. The process transforms the code into a semantic form. The process analyzes behavior functionality by processing precise programming behavior abstractions stored in a memory and classifies the code as malware based on the code behavior. Another method identifies the starting point of execution of a compiled program. The method calculates a complexity measure by calculating the number of potential execution paths of local functions; identifies the number of arguments passed to local functions; and identifies the starting point of execution of the compiled program. Another method provides interactive, dynamic visualization of a group of related functions wherein a user can explore the rendered graph and select a specific function and display functions that are color coded by their ancestral relation and their function call distance to the selected function.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Graph Generation with a Focusing Lexicon

Reference datasets are an essential part of developing effective data exploration tools. Many reference datasets are synthetic in nature, seeding real-world properties into generation routines. Others are laboriously curated from original source materials. This is a time-consuming process that requires significant domain expertise all along the process. This paper presents a third path: deriving a network from real-world source materials using automated tools. By properly grounding the tools in a small collection of curated documents, a larger corpus be automatically processed with greater confidence. The end system leverages human knowledge (in the initial document curation), but with much less time commitment enabled by automation. Our ultimate goal is to produce reference datasets, derived from real-world data that capture aspects salient to a specific activity in the context of all of the activities in the data-set. Our reference datasets take the form of graphs.

Chandra Shekar, Mayanka↗
DOE OSTI2020

Computer processing through distance-based quality score method in geospatial-temporal semantic graphs

A computer-implemented method of improving processing of overhead image data by a processor using a distance-based quality score in a geospatial-temporal semantic graph. An allowable range for each attribute in the subgraph search template is defined. For each match in a comparison, attribute values of each match element are compared against the preferred range and the allowable range to compute a corresponding distance of each match attribute from the subgraph search template. A corresponding overall match quality score is determined for each match from the subgraph search template, wherein determining the corresponding overall match qualities is performed using a corresponding required quality score and a corresponding optional quality score. All corresponding overall match quality scores are sorted into an ordered list and then displayed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due to its structural similarities to matrix-multiplication is well suited for highly parallel GPU architectures. To achieve high parallel efficiency, we address two key algorithmic challenges: reducing high communication overhead and addressing limited GPU memory. To reduce high communication costs, we redesign the parallel (a) to expose more parallelism, (b) aggressively overlap communication and computation with pipelined and asynchronous scheduling of operations, and (c) tailored MPI-collective. To cope with limited GPU memory, we employ an offload model, where the data resides on the host and is transferred to GPU on-demand. The proposed optimizations are supported with detailed performance models for tuning. Our optimized parallel Floyd-Warshall implementation is up to 5x faster than a strong baseline and achieves 8.1 PetaFLOPS/sec on 256~nodes of the Summit supercomputer at Oak Ridge National Laboratory. This performance represents 70% of the theoretical peak and 80% parallel efficiency. The offload algorithm can handle 2.5x larger graphs with a 20% increase in overall running time.

Sao, Piyush↗