SEARCH · Search NASA

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

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRS1990

A VLSI decomposition of the deBruijn graph

A new Viterbi decoder for convolutional codes with constraint lengths up to 15, called the Big Viterbi Decoder, is under development for the Deep Space Network. It will be demonstrated by decoding data from the Galileo spacecraft, which has a rate 1/4, constraint-length 15 convolutional encoder on board. Here, the mathematical theory underlying the design of the very-large-scale-integrated (VLSI) chips that are being used to build this decoder is explained. The deBruijn graph B sub n describes the topology of a fully parallel, rate 1/v, constraint length n+2 Viterbi decoder, and it is shown that B sub n can be built by appropriately wiring together (i.e., connecting together with extra edges) many isomorphic copies of a fixed graph called a B sub n building block. The efficiency of such a building block is defined as the fraction of the edges in B sub n that are present in the copies of the building block. It is shown, among other things, that for any alpha less than 1, there exists a graph G which is a B sub n building block of efficiency greater than alpha for all sufficiently large n. These results are illustrated by describing a special hierarchical family of deBruijn building blocks, which has led to the design of the gate-array chips being used in the Big Viterbi Decoder.

Collins, O.↗

NASA NTRS1987

Auroral zone field-aligned currents observed in the magnetotail and at intermediate altitudes - An ISEE perspective

The relationship between low-altitude auroral-zone field-aligned currents and the geomagnetic tail is investigated on the basis of a statistical analysis of ISEE and DE observations. The data are compiled in diagrams and graphs and characterized in detail. It is shown that the large-scale current systems of low-altitude regions 1 and 2 are only reduplicated in 27 percent of the observations at 2-7 earth radii (those associated with the onset of a substorm expansion), while the flow at the plasma-sheet boundary opposes the region 1 polarity (the highest-latitude near-midnight currents being directed earthward).

Elphic, R. C.↗

NASA NTRS2007

Exploring and Visualizing A-Train Instrument Data

The succession of US and international satellites that follow each other in close succession, known as the A-Train, affords an opportunity to atmospheric researchers that no single platform could provide: Increasing the number of observations at any given geographic location.. . a more complete "virtual science platform". However, vertically and horizontally, co-registering and regridding datasets from independently developed missions, Aqua, Calipso, Cloudsat, Parasol, and Aura, so that they can be inter-compared can be daunting to some, and may be repeated by many. Scientists will individually spend much of their time and resources acquiring A-Train datasets of interest residing at various locations, developing algorithms to match up and graph datasets along the A-Train track, and search through large amounts of data for areas and/or phenomena of interest. The aggregate amount of effort that can be expended on repeating pre-science tasks could climb into the tens of millions of dollars. The goal of the A-Train Data Depot (ATDD) is to enable free movement of remotely located A-Train data so that they are combined to create a consolidated vertical view of the Earth's Atmosphere along the A-Train tracks. The innovative approach of analyzing and visualizing atmospheric profiles along the platforms track (i.e., time) is accomplished by through the ATDDs Giovanni data analysis and visualization tool. Giovanni brings together data from Aqua (MODIS, AIRS, AMSR-E), Cloudsat (cloud profiling radar) and Calipso (CALIOP, IIR), as well as the Aura (OMI, MLS, HIRDLS, TES) to create a consolidated vertical view of the Earth's Atmosphere along the A-Train tracks. This easy to learn and use exploration tool will allow users to create vertical profiles of any desired A-Train dataset, for any given time of choice. This presentation shows the power of Giovanni by describing and illustrating how this tool facilitates and aids A-Train science and research. A web based display system Giovanni provides users with the capability of creating co-located profile images of temperature and humidity data from the MODIS, MLS and AIRS instruments for a user specified time and spatial area. In addition, Cloud and Aerosol profiles may also be displayed for the Cloudsat and Caliop instruments. The ability to modify horizontal and vertical axis range, data range and dynamic color range is also provided. Two dimensional strip plots of MODIS, AIRS, OM1 and POLDER parameters, co-located along the Cloudsat reference track, can also be plotted along with the Cloudsat cloud profiling data. Center swath pixels for the same parameters can also be shown as line plots overlaying the Cloudsat or Calipso profile images. Images and subsetted data produced in each analysis run may be downloaded. Users truly can explore and discover data specific to their needs prior to ever transferring data to their analysis tools.

Kempler, S.↗

NASA NTRSDate not supplied

Information Extraction on an Earth Science Knowledge Graphs with Semantic Parsing

Knowledge graphs are an important tool, both for representing knowledge and for retrieving information. Fundamentally, they are semantic networks that represent entities and relationships in the form of nodes and edges. A large corpus of natural language text can bebroken down into discrete entities and relationships to form a useful knowledge graph. Existing research breaks down text into a subject, object, and verb relationship triple. Although this is a useful first step, it loses much of the original contextual information encoded within the text. Our process uses a novel 7-tuple approach, in which elements of sentences are programmatically parsed into seven categories: initiator, impacted, receiver, beneficiary, result, and context. In this presentation, we show a knowledge graph built using this 7-tupleprocessing of an Earth science corpus. We explain the techniques used to create the graph and analyze its information retrieval capability while assessing the accuracy and limitations of the results.

Carson Davis↗

NASA NTRS1993

Experience with parametric binary dissection

Parametric Binary Dissection (PBD) is a new algorithm that can be used for partitioning graphs embedded in 2- or 3-dimensional space. It partitions explicitly on the basis of nodes + (lambda)x(edges cut), where lambda is the ratio of time to communicate over an edge to the time to compute at a node. The new algorithm is faster than the original binary dissection algorithm and attempts to obtain better partitions than the older algorithm, which only takes nodes into account. The performance of parametric dissection with plain binary dissection on 3 large unstructured 3-d meshes obtained from computational fluid dynamics and on 2 random graphs were compared. It was showm that the new algorithm can usually yield partitions that are substantially superior, but that its performance is heavily dependent on the input data.

Bokhari, Shahid H.↗

NASA NTRS1975

Computer graphics for management: An abstract of capabilities and applications of the EIS system

The Executive Information Services (EIS) system, developed as a computer-based, time-sharing tool for making and implementing management decisions, and including computer graphics capabilities, was described. The following resources are available through the EIS languages: centralized corporate/gov't data base, customized and working data bases, report writing, general computational capability, specialized routines, modeling/programming capability, and graphics. Nearly all EIS graphs can be created by a single, on-line instruction. A large number of options are available, such as selection of graphic form, line control, shading, placement on the page, multiple images on a page, control of scaling and labeling, plotting of cum data sets, optical grid lines, and stack charts. The following are examples of areas in which the EIS system may be used: research, estimating services, planning, budgeting, and performance measurement, national computer hook-up negotiations.

Solem, B. J.↗

NASA NTRS1983

Space station: Cost and benefits

Costs for developing, producing, operating, and supporting the initial space station, a 4 to 8 man space station, and a 4 to 24 man space station are estimated and compared. These costs include contractor hardware; space station assembly and logistics flight costs; and payload support elements. Transportation system options examined include orbiter modules; standard and extended duration STS fights; reusable spacebased perigee kick motor OTV; and upper stages. Space station service charges assessed include crew hours; energy requirements; payload support module storage; pressurized port usage; and OTV service facility. Graphs show costs for science missions, space processing research, small communication satellites; large GEO transportation; OVT launch costs; DOD payload costs, and user costs.

Source record↗

NASA NTRS1992

Planning Assembly Of Large Truss Structures In Outer Space

Report dicusses developmental algorithm used in systematic planning of sequences of operations in which large truss structures assembled in outer space. Assembly sequence represented by directed graph called "assembly graph", in which each arc represents joining of two parts or subassemblies. Algorithm generates assembly graph, working backward from state of complete assembly to initial state, in which all parts disassembled. Working backward more efficient than working forward because it avoids intermediate dead ends.

De Mello, Luiz S. Homem↗

NASA NTRS2016

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Space Networking↗

NASA NTRS2005

Online Tools for Astronomy and Cosmochemistry

Over the past year, the Webnucleo Group at Clemson University has been developing a web site with a number of interactive online tools for astronomy and cosmochemistry applications. The site uses SHP (Simplified Hypertext Preprocessor), which, because of its flexibility, allows us to embed almost any computer language into our web pages. For a description of SHP, please see http://www.joeldenny.com/ At our web site, an internet user may mine large and complex data sets, such as our stellar evolution models, and make graphs or tables of the results. The user may also run some of our detailed nuclear physics and astrophysics codes, such as our nuclear statistical equilibrium code, which is written in fortran and C. Again, the user may make graphs and tables and download the results.

Meyer, B. S.↗

NASA NTRS1987

Optical and near-infrared observations of BL Lacertae objects and active quasars

UBVRI and JHK photometric and polarimetric observations, obtained using the 1.5-m UCSD/UM telescope at Mount Lemmon, AZ during 1982-1984, are reported for a sample of 10 BL Lac objects, eight optically violent variable quasars, and the low-polarization quasar 3C 273. The data are presented in extensive tables and graphs and analyzed in detail. Most of the objects are found to have undergone large polarization variations on time scales ranging from 1 d to several months; five objects had fractional linear polarization P greater than 30 percent at least once during the period of observation, but four never had P greater than 10 percent. Of four objects which exhibited a preferred polarization position angle (theta), three had theta within 20 deg of the jet position angle determined by VLBI.

Smith, Paul S.↗

NASA NTRS1987

Strategies for concurrent processing of complex algorithms in data driven architectures

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗

NASA NTRS1988

Strategies for concurrent processing of complex algorithms in data driven architectures

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗

NASA NTRS1993

Software reliability through fault-avoidance and fault-tolerance

Strategies and tools for the testing, risk assessment and risk control of dependable software-based systems were developed. Part of this project consists of studies to enable the transfer of technology to industry, for example the risk management techniques for safety-concious systems. Theoretical investigations of Boolean and Relational Operator (BRO) testing strategy were conducted for condition-based testing. The Basic Graph Generation and Analysis tool (BGG) was extended to fully incorporate several variants of the BRO metric. Single- and multi-phase risk, coverage and time-based models are being developed to provide additional theoretical and empirical basis for estimation of the reliability and availability of large, highly dependable software. A model for software process and risk management was developed. The use of cause-effect graphing for software specification and validation was investigated. Lastly, advanced software fault-tolerance models were studied to provide alternatives and improvements in situations where simple software fault-tolerance strategies break down.

Vouk, Mladen A.↗

NASA NTRS2021

Predicting the Functional State of Protein Kinases Using Interpretable Graph Neural Networks

Kinases are a family of proteins that function as molecular switches, regulating several essential cellular activities such as cell proliferation. Dysfunctional kinases are implicated in several types of cancers and hence they are actively pursued as drug targets. Given the vast number of complex kinase structures that are available in the protein data bank (PDB), there is a necessity to develop methodologies that can identify structurally important moieties of the kinases in an automated fashion, for such techniques can be instrumental in identifying novel drug targets. In this work, we develop a graph neural network (GNN) based deep learning framework for classifying the functionally active and inactive states of a large set of eukaryotic protein kinases, making use of their 3D structure from the PDB. We show that GNN based machine learning models can classify protein states with an accuracy greater than 97%. We further use the GNN models to automatically identify regions of the kinases that are important for its function. For this purpose, Gradient-weighted Class Activation Mapping (Grad-CAM) was implemented on the protein graphs. Remarkably, Grad-CAM consistently identifies the highly conserved DFG motif as the most important part of the protein across the entire kinome, without any prior input. Other regions of the hydrophobic core such as the HRD motif were also identified by the interpretable GNN framework, consistent with the literature. We discuss the significance of each of these regions in detail.

Ashwin Ravichandran↗

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↗

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 NTRS1992

A VLSI decomposition of the deBruijn graph

The nth order deBruijn graph Bn is the state diagram for an n-stage binary shift register. It is a directed graph with 2 to the n vertices, each labeled with an n-bit binary string, and 2 to the n+1 edges, each labeled with an (n+1)-bit binary string. It is shown that Bn can be built by appropriately connecting together with extra edges many isomorphic copies of a fixed graph, which is called a building block for Bn. The efficiency of such a building block is refined as the fraction of the edges of Bn which are present in the copies of the building block. It is then shown that for any alpha less than 1, there exists a graph which is a building block for Bn of efficiency greater than alpha for all sufficiently large n. The results are illustrated by showing how a special hierarchical family of building blocks has been used to construct a very large Viterbi decoder which will be used on the Galileo mission.

Collins, Oliver↗