Search NASA⌕ Search

SEARCH · Search NASA

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

28 records · Page 2

Synthesizing 3D Surfaces from Parameterized Strip Charts

We believe 3D information visualization has the power to unlock new levels of productivity in the monitoring and control of complex processes. Our goal is to provide visual methods to allow for rapid human insight into systems consisting of thousands to millions of parameters. We explore this hypothesis in two complex domains: NASA program management and NASA International Space Station (ISS) spacecraft computer operations. We seek to extend a common form of visualization called the strip chart from 2D to 3D. A strip chart can display the time series progression of a parameter and allows for trends and events to be identified. Strip charts can be overlayed when multiple parameters need to visualized in order to correlate their events. When many parameters are involved, the direct overlaying of strip charts can become confusing and may not fully utilize the graphing area to convey the relationships between the parameters. We provide a solution to this problem by generating 3D surfaces from parameterized strip charts. The 3D surface utilizes significantly more screen area to illustrate the differences in the parameters and the overlayed strip charts, and it can rapidly be scanned by humans to gain insight. The selection of the third dimension must be a parallel or parameterized homogenous resource in the target domain, defined using a finite, ordered, enumerated type, and not a heterogeneous type. We demonstrate our concepts with examples from the NASA program management domain (assessing the state of many plans) and the computers of the ISS (assessing the state of many computers). We identify 2D strip charts in each domain and show how to construct the corresponding 3D surfaces. The user can navigate the surface, zooming in on regions of interest, setting a mark and drilling down to source documents from which the data points have been derived. We close by discussing design issues, related work, and implementation challenges.

Robinson, Peter I.↗

Astrobee's Multi-year Activities at the International Space Station's Japanese Experimental Module

The Astrobee free-flying robots recently completed their third successful year of operations, housed in the Japanese Experimental Module (JEM) on the International Space Station. We summarize the three years of operation, giving special attention to JAXA's 1st and 2nd Kibo Robot Programming Challenge (RPC) and the mapping processes and tools that make Astrobees' autonomous operation possible. The JEM is an ever changing, dynamic environment where light settings, cargo, payloads, and crew members constantly move and interact with one another. The 1st JAXA Kibo RPC event, a collaboration between JAXA and NASA, was held in 2020. Students from several countries in the Asia-Pacific region competed in programming challenges with a simulated Astrobee. The finalists were then invited to run their code on an actual Astrobee in the JEM. For the final round, students programmed Astrobee to visit three different locations to obtain data that would instruct the robot to complete a final task with the participation of ISS crew. The first competition was a tremendous success, leading to an equally successful 2nd JAXA Kibo RPC in 2021 with even larger participation. The 3rd JAXA Kibo RPC will occur in 2022 expanding further to incorporate US participants. These activities led to several firsts in Astrobee’s history: operation of an Astrobee free-flying robot without crew supervision in preparation for on-orbit operations, autonomous image acquisition towards updates of the navigation map, non-NASA code running on the robot (both from JAXA and participating students), two heterogeneous free-flying robots from two different space agencies working together (Int-Ball and Astrobee) during the final event in 2020, the first payload using Astrobee, and having Astrobee controlled from a non-NASA location (Tsukuba Space Center). The preparation towards these activities involved constant evaluation of the different components of Astrobee's systems, specially mapping and localization. The paper describes the evolution of these systems such as the improvements made in localization to reduce localization drift by using graph-based optimization instead of the extended Kalman Filter localizer. Additionally, it reports on the mapping process and analysis tools created to validate map consistency across different activities in the constantly changing JEM environment. These enhancements have enabled the Astrobee facility to successfully execute over 100 ISS activities supporting over a dozen researchers and partners around the world.

Astrobee↗

Measurements of mantle wave velocities and inversion for lateral heterogeneity and anisotropy. I - Analysis of great circle phase velocities

The global lateral heterogeneity of the upper mantle is investigated using the classical Fourier-transform method of Sato(1958) and IDA/GDSN data from 25 1980 earthquakes. The great-circle phase velocities of 200 Love and 250 Rayleigh 100-330-sec-period fundamental-mode wave paths are determined and interpreted in terms of regional phase-velocity variation, using additional data on surface tectonics to extrapolate odd-harmonic information from the even-harmonic data. The results are presented in extensive tables, maps, and graphs. Regionalized inversion using the seven-region model of Okal (1977) is found to give maximum variance reductions of 65 percent for Love waves and 85 percent for Rayleigh waves, compared to 60 and 90 percent for l(max) = 2 inversion. Significant interregion differences are found in the regionalized Love-wave phase velocities.

Nakanishi, I.↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Development of deterministic transport methods for low energy neutrons for shielding in space

Transport of low energy neutrons associated with the galactic cosmic ray cascade is analyzed in this dissertation. A benchmark quality analytical algorithm is demonstrated for use with BRYNTRN, a computer program written by the High Energy Physics Division of NASA Langley Research Center, which is used to design and analyze shielding against the radiation created by the cascade. BRYNTRN uses numerical methods to solve the integral transport equations for baryons with the straight-ahead approximation, and numerical and empirical methods to generate the interaction probabilities. The straight-ahead approximation is adequate for charged particles, but not for neutrons. As NASA Langley improves BRYNTRN to include low energy neutrons, a benchmark quality solution is needed for comparison. The neutron transport algorithm demonstrated in this dissertation uses the closed-form Green's function solution to the galactic cosmic ray cascade transport equations to generate a source of neutrons. A basis function expansion for finite heterogeneous and semi-infinite homogeneous slabs with multiple energy groups and isotropic scattering is used to generate neutron fluxes resulting from the cascade. This method, called the FN method, is used to solve the neutral particle linear Boltzmann transport equation. As a demonstration of the algorithm coded in the programs MGSLAB and MGSEMI, neutron and ion fluxes are shown for a beam of fluorine ions at 1000 MeV per nucleon incident on semi-infinite and finite aluminum slabs. Also, to demonstrate that the shielding effectiveness against the radiation from the galactic cosmic ray cascade is not directly proportional to shield thickness, a graph of transmitted total neutron scalar flux versus slab thickness is shown. A simple model based on the nuclear liquid drop assumption is used to generate cross sections for the galactic cosmic ray cascade. The ENDF/B V database is used to generate the total and scattering cross sections for neutrons in aluminum. As an external verification, the results from MGSLAB and MGSEMI were compared to ANISN/PC, a routinely used neutron transport code, showing excellent agreement. In an application to an aluminum shield, the FN method seems to generate reasonable results.

Ganapol, Barry↗

Anomaly Detection in Flight Operational Data Using Deep Learning

In this session, we demonstrate two recently developed deep learning models for anomaly detection in flight operational data by the Data Sciences Group at NASA Ames Research Center. The first model is Convolutional Variational Auto-Encoder (CVAE) [1], which is an unsupervised deep encoder-decoder model, designed specifically for finding anomalies in heterogeneous multivariate time series data. We will demonstrate its application to finding anomalies in streaming data from NASA’s Digital Information Platform’s Fuser source. CVAE identifies data instances that are not representative of expected nominal behavior as anomalous. Since it is an unsupervised approach, the flagged anomalies will need to be reviewed by the subject matter experts (SMEs) for validation and labeling and is designed to assist with vulnerability discovery within Safety Monitoring System programs. The second model is Robust and Explainable Semi-supervised Anomaly Detection (RESAD) model [2], which builds on CVAE to allow learning from both minimally labeled data (previously reviewed by the SMEs) as well as majority unlabeled data. RESAD takes advantage of graph theoretic techniques to propagate the labels from the labeled data to the unlabeled data based on a pre-defined similarity metric and structures the learned feature space from flight time-series so that data of the same class would cluster tightly together. This model characteristic is enabled by training with an augmented loss function and allows learning of a more informative feature space for down-stream tasks such as search and active learning. We demonstrate RESAD using data from the NASA DASHlink project [3].

anomaly detection↗

Towards Sheaf Theoretic Analyses for Delay Tolerant Networking

The goal of Delay Tolerant Networking (DTN) is to take a collection of heterogeneous, disparate connections between satellites, space assets, ground stations, and ground infrastructure and bring it together into a cohesive, functioning overlay network. Depending on the systems being considered, one can find links with a one-way light time exceeding minutes (and hours),periodic links which can sometimes be predicted by orbital mechanics, and restrictions based on the variety of capabilities built into these systems. These characteristics preclude traditional network models and routing techniques and have classically led to either rigid routing tables or purely probabilistic models. As the deeper underlying structures remain unknown, development of more DTN-optimized algorithms has lacked the necessary foundation. In a continuation of previous work, the goal of this paper is to identify and study these fundamental structures that exist in delay tolerant networks (DTN), with a focus on space networks. The current routing methodology has been to use contact graph routing (CGR) algorithms. CGR models a series of known contacts as a static graph. For CGR to work, this graph must be globally consistent and must have an accurate picture of the network. Because this is a globally controlled structure, there is little room for flexibility in the event of changes to the network which would naturally occur as the network grows. As a response to the desire for flexibility as the network changes, we introduced the mathematical structure known as sheaves to DTNs last year. The tag-line for sheaves is that they are a mathematically precise way of gluing local data together into unique global data. Thus, sheaves lend extra power to traditional models(and routing algorithms) by taking additional information and merging it, in as consistent a manner as possible, with the representation itself. The clearest example of how Earth-bound networks exhibit behavior that is “sheafy” is link state routers, which build a local-to-global picture of their network by gluing local information together into a global network, exactly as a sheaf would do. For routing within delay tolerant networks to truly exploit this structure, a deeper structure than a graph is required. In this paper, we develop sheaves that can work over directed graphs such as temporal flow networks, we construct a sheaf representation for Dijkstra’s algorithm, and we outline a construction for routing sheaves capable of modeling multicast scenarios. Finally, there is a section of future work suggesting follow-on research.

Robert Short↗

Querying Semi-Structured Data

The amount of data of all kinds available electronically has increased dramatically in recent years. The data resides in different forms, ranging from unstructured data in the systems to highly structured in relational database systems. Data is accessible through a variety of interfaces including Web browsers, database query languages, application-specic interfaces, or data exchange formats. Some of this data is raw data, e.g., images or sound. Some of it has structure even if the structure is often implicit, and not as rigid or regular as that found in standard database systems. Sometimes the structure exists but has to be extracted from the data. Sometimes also it exists but we prefer to ignore it for certain purposes such as browsing. We call here semi-structured data this data that is (from a particular viewpoint) neither raw data nor strictly typed, i.e., not table-oriented as in a relational model or sorted-graph as in object databases. As will seen later when the notion of semi-structured data is more precisely de ned, the need for semi-structured data arises naturally in the context of data integration, even when the data sources are themselves well-structured. Although data integration is an old topic, the need to integrate a wider variety of data- formats (e.g., SGML or ASN.1 data) and data found on the Web has brought the topic of semi-structured data to the forefront of research. The main purpose of the paper is to isolate the essential aspects of semi- structured data. We also survey some proposals of models and query languages for semi-structured data. In particular, we consider recent works at Stanford U. and U. Penn on semi-structured data. In both cases, the motivation is found in the integration of heterogeneous data.

DATA MANAGEMENT↗

Oxidation States of Grim Glasses in EET79001 Based on Vanadium Valence

Gas-rich impact-melt (GRIM) glasses in SNC meteorites are very rich in Martian atmospheric noble gases and sulfur suggesting a possible occurrence of regolith-derived secondary mineral assemblages in these samples. Previously, we have studied two GRIM glasses, 506 and 507, from EET79001 Lith A and Lith B, respectively, for elemental abundances and spatial distribution of sulfur using EMPA (WDS) and FE-SEM (EDS) techniques and for sulfur-speciation using K-edge XANES techniques. These elemental and FE-SEM micro-graph data at several locations in the GRIM glasses from Shergotty (DBS), Zagami 994 and EET79001, Lith B showed that FeO and SO3 are positively correlated (SO3 represents a mixture of sulfide and sulfate). FE-SEM (EDS) study revealed that the sulfur-rich pockets in these glasses contain numerous micron-sized iron-sulfide (Fe-S) globules sequestered throughout the volume. However, in some areas (though less frequently), we detected significant Fe-S-O signals suggesting the occurrence of iron sulfate. These GRIM glasses were studied by K-edge microXANES techniques for sulfur speciation in association with iron in sulfur-rich areas. In both samples, we found the sulfur speciation dominated by sulfide with minor oxidized sulfur mixed in with various proportions. The abundance of oxidized sulfur was greater in 506 than in 507. Based on these results, we hypothesize that sulfur initially existed as sulfate in the glass precursor materials and, on shock-impact melting of the precursor materials producing these glasses, the oxidized sulfur was reduced to predominately sulfide. In order to further test this hypothesis, we have used microXANES to measure the valence states of vanadium in GRIM glasses from Lith A and Lith B to complement and compare with previous analogous measurements on Lith C (note: 506 and 507 contain the largest amounts of martian atmospheric gases but the gas-contents in Lith C measured by are unknown). Vanadium is ideal for addressing this re-dox issue because it has multiple valence states and is a well-studied element. Ferrous-dominated iron valences determined by microXANES on the Lith A and Lith B glasses provide little redox sensitivity. Vanadium valence measurements for impact glass in Lith C at three different locations yielded valence values of 3.1, 3.2 and 3.4 with inferred fO2 values of IW-0.7, IW-0.1 and IW+0.7, respectively. This range of oxygen-fugacity values is understandable because the glasses are shock-molten impact glasses which are heterogeneous in nature. Oxygen fugacity values obtained from the analysis of Fe-Ti oxides and Eu partitioning in pyroxenes from EET79001 Lith A and Lith B (host lithologies) were in the range of IW+0.3 to IW+1.9 suggesting that V in the Lith C impact glass was reduced in the impact process. Here, we examine whether the 506 from Lith A and 507 from Lith B GRIM glasses yield similar or different fO2 values from those of Lith C using the vanadium K-edge microXANES technique.

Sutton, S. R.↗

Organization of P, S, and Fe Inclusions in a Freshwater Magnetococcus

Magnetotactic bacteria are a heterogeneous group of motile, mainly aquatic procaryotes that align and swim along geomagnetic field lines. They are of interest to astrobiologists because of the magnetite crystals found in the Mars meteorite ALH84001 which share many characteristics with the magnetite produced intracellularly by magnetotactic bacteria. These bacteria are diverse morphologically, physiologically and phylogenetically, sharing a few key characteristics: 1) the presence of intracellular membrane-bound magnetic crystals (magnetosomes), usually but not always arranged in chains; 2) motility by means of flagella; and 3) microaerophillic or anaerobic physiology. The bilophotrichous (having two flagella bundles) magnetotactic cocci (MC) are ubiquitous in aquatic habitats but have proven extremely difficult to cultivate. Because only several marine strains have been isolated and grown in axenic culture, little is known about the physiology and the biogeochemical roles of the MC. We studied the composition and distribution of intracellular structures in an uncultured MC, designated ARB-1. To do this, a combination of light microscopy, environmental scanning electron microscopy (ESEM), transmission electron microscopy (TEM) and energy dispersive X-ray spectroscopy (EDS) were used. Cells of ARB-1 were separated from sediments collected from Baldwin Lake (Los Angeles Arboretum, Arcadia, CA). They are large spherical to oblate spheroidal Gram-negative cells, ranging from 1 to 4 micrometers along the maximum dimension, which is perpendicular to the direction of swimming. Cells have two large phosphorus-containing inclusions that comprise a large percentage of the cell volume. Many smaller sulfur inclusions are located at the convex end of the cell. Most of the cellular Fe is present in the magnetosomes. These may be arranged as a clump at the concave end of the cell, near the two flagella bundles, or as chains, or as both a clump and chains. The magnetosomes were identified as magnetite (Fe3O4) by selected area electron diffraction (SAED) and high resolution TEM. We saw a trend between cell size and organization of the magnetosomes. Smaller, more spherical cells were more likely to have chains than were larger, more oblate cells. This may indicate different populations of cells, or it may be attributed to variations in cell growth cycle. The size distribution (length) of magnetosomes in chains was similar to that of magnetosomes in clusters, except that there was a larger size range for clustered magnetosomes. Magnetosomes from ARB-1 cells average 82 nm in length. If plotted on a graph of length as a function of aspect ratio, they fall within the single domain region of the plot. If compared with the size distributions of magnetite from ALH84001 and magnetosomes from the cultured magnetotactic vibrio MV-1, the magnetites produced by ARB-1 cells are, on average, larger and have a wider range of aspect ratio. ARB-1 cells have a specific organization of the P, S, and Fe inclusions. The P inclusions always occupy the majority of the cell volume and separate the S inclusions from the disorganized clumps of magnetosomes and the flagella bundles. The P inclusions may contain polyphosphate, which could play several roles in motility, adaptation to stress, growth and division, buoyancy, and energy. The S inclusions might be a way to store S, a potential energy source, when the cells move from sulfide to oxygen zones. The consistency of P, S, and Fe organization in ARB-1 cells suggests that these inclusions have some specific and interactive functions.

Cox, Lea↗