SEARCH · Search NASA

Results for “Temporal graphs”

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 19 records

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗

NASA NTRS2014

Spatio-Temporal Video Segmentation with Shape Growth or Shrinkage Constraint

We propose a new method for joint segmentation of monotonously growing or shrinking shapes in a time sequence of noisy images. The task of segmenting the image time series is expressed as an optimization problem using the spatio-temporal graph of pixels, in which we are able to impose the constraint of shape growth or of shrinkage by introducing monodirectional infinite links connecting pixels at the same spatial locations in successive image frames. The globally optimal solution is computed with a graph cut. The performance of the proposed method is validated on three applications: segmentation of melting sea ice floes and of growing burned areas from time series of 2D satellite images, and segmentation of a growing brain tumor from sequences of 3D medical scans. In the latter application, we impose an additional intersequences inclusion constraint by adding directed infinite links between pixels of dependent image structures.

Segmentation↗

NASA NTRS1989

A three-dimensional time-dependent model of the polar wind

A time-dependent three-dimensional multiion model of the polar wind was developed, which covers the altitude range of from 120 to 9000 km and takes into account supersonic ion outflow, shock formation, and ion energization during plasma expansion events. The model was used to study the temporal response of global polar wind to changing magnetospheric conditions, for the winter solstice and for solar-minimum conditions in the northern polar region. Graphs illustrating temporal changes with changes in T(e), T(i), and T(n) along the dawn, the trough, and the dusk convection trajectories and in the O(+), O, and H densities along the same convection trajectories are presented together with conntours of the H(+) and the O(+) densities along the three convection trajectories.

Schunk, R. W.↗

NASA NTRS1977

Spontaneous emission from ScF in a supersonic mixing flame

An investigation was conducted of the two reactions: Sc + F2 yields ScF(asterisk) + F and Y + Cl2 yields YCl(asterisk) + Cl. Experiments were designed for studying the reactions under the relatively high pressure conditions (5-20 torr) appropriate for chemical laser operation. A shock tube was used to provide a short duration flow through a supersonic nozzle array. Shock wave heating is used to dissociate the ScCl3 or YCl3 at temperatures of about 6000 K, before the gases are accelerated and expanded through the supersonic nozzle array. The expanded primary flow is then mixed with a secondary flow of F2 introduced through slots at the trailing edge of each nozzle blade. Graphs show the temporal behavior of the visible spontaneous emission over the range from 3000 to 9000 A for a typical test condition, a microdensitometer tracing of the visible emission over the range from 4000 to 7000 A, and the spontaneous emission from ScF(asterisk) obtained by computer image processing of intensity data.

Fischell, D. R.↗

NASA NTRSDate not supplied

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↗

NASA NTRS1993

Knowledge engineering for temporal dependency networks as operations procedures

This paper presents a case study of the knowledge engineering process employed to support the Link Monitor and Control Operator Assistant (LMCOA). The LMCOA is a prototype system which automates the configuration, calibration, test, and operation (referred to as precalibration) of the communications, data processing, metric data, antenna, and other equipment used to support space-ground communications with deep space spacecraft in NASA's Deep Space Network (DSN). The primary knowledge base in the LMCOA is the Temporal Dependency Network (TDN), a directed graph which provides a procedural representation of the precalibration operation. The TDN incorporates precedence, temporal, and state constraints and uses several supporting knowledge bases and data bases. The paper provides a brief background on the DSN, and describes the evolution of the TDN and supporting knowledge bases, the process used for knowledge engineering, and an analysis of the successes and problems of the knowledge engineering effort.

Fayyad, Kristina E.↗

NASA NTRS2022

A Survey of Mathematical Structures for Lunar Networks

To sustain the current and increasing accessibility of space, a scalable communications infrastructure (i.e. the Solar System Internet, SSI) is necessary. The goal of this paper is to begin the discovery of the fundamental underlying mathematical structure of space networks to help the research community harness these structures for algorithm development and optimization. To ensure the applicability of the research, the approaches are considered through the lens of simulated scenarios inspired by the Artemis Back-to-the-Moon mission set for 2024. We note that any approach to an SSI must fit under the umbrella of Delay Tolerant Networking (DTN), due to celestial mobility, high link latencies, high variance in link latencies, disconnections, lack of end-to-end paths, and so on. These difficulties are exacerbated by the fact that the underlying structure of a space network is a time-evolving network and may experience multiple discontinuities in its topology. In this paper we propose several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory. These techniques include methods from Topological Data Analysis, Dynamic Graph Analysis, Applied Algebraic Geometry, Probability Theory, and Game Theory. Some of these methods include tools adapted to the study of dynamic metric spaces, such as zigzag persistent homology and their higher parameter analogs. We find that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting. While each approach is theoretical, they are also algorithmic in nature and offer immediate practical applications. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay tolerant networking↗

NASA NTRS1985

Photoelectric photometry of asteroid 69 Hesperia

UBV photometric observations of the M asteroid 69 Hesperia, obtained using single-channel photometers on the 31-in. and 42-in. reflectors at Lowell Observatory and on the 24-in. reflector at Mauna Kea Observatory during the apparition of August-November 1977, are reported. The data are presented in tables and graphs and analyzed. Findings presented include minimal temporal or phase-angle-dependent light-curve fluctuations, evidence for large-scale albedo variegation of a few percent, synodic rotation period 5.65537 + or - 0.00064 h, zero-phase color indices B-V = 0.68 mag and U-B = 0.24 mag, B-V phase reddening 0.003 mag/deg, and absolute zero-phase primary maximum magnitude V = 7.04.

Poutanen, M.↗

NASA NTRS1987

Long-term gamma-ray spectral variability of Cygnus X-1

Data from HEAO 3 observations of 0.05-10-MeV gamma-ray emission from Cyg X-1 during two 90-d periods (in fall 1979 and spring 1980) are compiled in tables and graphs and analyzed statistically to determine the temporal and spectral variability. It is found that a steady increase in 100-keV emission is accompanied by a decrease (and eventual disappearance) of MeV emission. The mechanisms which could theoretically be responsible for these phenomena are discussed.

Ling, J. C.↗

NASA NTRS1988

H2 spectroscopy and a diurnally changing cloud on Jupiter

Spectroscopic observations of H2 in specific longitude regions of Jupiter as they rotate from limb to limb are reported. Data obtained in the 3-0 S(0) and S(1) lines using a CCD detector and a spectrograph with either echelle or plane gratings at the Cassegrain focus of the 24-inch telescope at Whipple Observatory during April-June 1983 are presented in extensive tables and graphs and analyzed in detail, modeling spatial and temporal variations at seven latitudes. An east-to-west increase in the equivalent line widths is attributed to the combined action of internal and solar heating of a convective layer, resulting in diurnal changes in the vertical cloud structure. It is inferred that the hydrogen observed is mainly in an equilibrium thermodynamic state, with small amounts of nonequilibrium hydrogen at high altitudes.

Cunningham, Cindy C.↗

NASA NTRSDate not supplied

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗

NASA NTRS1981

Unbiased estimation of oceanic mean rainfall from satellite borne radiometer measurements

The statistical properties of the radar derived rainfall obtained during the GARP Atlantic Tropical Experiment (GATE) are used to derive quantitative estimates of the spatial and temporal sampling errors associated with estimating rainfall from brightness temperature measurements such as would be obtained from a satelliteborne microwave radiometer employing a practical size antenna aperture. A basis for a method of correcting the so called beam filling problem, i.e., for the effect of nonuniformity of rainfall over the radiometer beamwidth is provided. The method presented employs the statistical properties of the observations themselves without need for physical assumptions beyond those associated with the radiative transfer model. The simulation results presented offer a validation of the estimated accuracy that can be achieved and the graphs included permit evaluation of the effect of the antenna resolution on both the temporal and spatial sampling errors.

Mittal, M. C.↗

NASA NTRS2012

Intelligent Data Visualization for Cross-Checking Spacecraft System Diagnosis

Any reasoning system is fallible, so crew members and flight controllers must be able to cross-check automated diagnoses of spacecraft or habitat problems by considering alternate diagnoses and analyzing related evidence. Cross-checking improves diagnostic accuracy because people can apply information processing heuristics, pattern recognition techniques, and reasoning methods that the automated diagnostic system may not possess. Over time, cross-checking also enables crew members to become comfortable with how the diagnostic reasoning system performs, so the system can earn the crew s trust. We developed intelligent data visualization software that helps users cross-check automated diagnoses of system faults more effectively. The user interface displays scrollable arrays of timelines and time-series graphs, which are tightly integrated with an interactive, color-coded system schematic to show important spatial-temporal data patterns. Signal processing and rule-based diagnostic reasoning automatically identify alternate hypotheses and data patterns that support or rebut the original and alternate diagnoses. A color-coded matrix display summarizes the supporting or rebutting evidence for each diagnosis, and a drill-down capability enables crew members to quickly view graphs and timelines of the underlying data. This system demonstrates that modest amounts of diagnostic reasoning, combined with interactive, information-dense data visualizations, can accelerate system diagnosis and cross-checking.

Ong, James C.↗

NASA NTRS1997

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Singh, Jatinder↗

NASA NTRS1984

Plasma response to the injection of an electron beam

The results of Vlasov-Poisson-solver numerical simulations of the detailed temporal response of a Maxwellian plasma to the sudden injection of an electron beam are presented in graphs and maps and discussed. Phenomena characterized include ion bursts, electron shocks and holes, plasma heating and expulsion, density gradients; cavitons, deep-density-front and solitary-pulse propagation down the density gradient, and Bunemann-mode excitation leading to formation of a virtual cathode and double layers which are at first monotonic or have low-potential-side dips or high-potential-side bumps and become strong as the electron-current density decreases. The strength of the double layer is found to be roughly proportional to the beam energy.

Singh, N.↗

NASA NTRS2005

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Alexandrov, Natalia↗

NASA NTRS1990

Assembly planning based on subassembly extraction

A method is presented for the automatic determination of assembly partial orders from a liaison graph representation of an assembly through the extraction of preferred subassemblies. In particular, the authors show how to select a set of tentative subassemblies by decomposing a liaison graph into a set of subgraphs based on feasibility and difficulty of disassembly, how to evaluate each of the tentative subassemblies in terms of assembly cost using the subassembly selection indices, and how to construct a hierarchical partial order graph (HPOG) as an assembly plan. The method provides an approach to assembly planning by identifying spatial parallelism in assembly as a means of constructing temporal relationships among assembly operations and solves the problem of finding a cost-effective assembly plan in a flexible environment. A case study of the assembly planning of a mechanical assembly is presented.

Lee, Sukhan↗

NASA NTRS1984

Nonlocal effects on the convective properties of the electrostatic current-driven ion-cyclotron instability

The convective behavior of the current-driven ion-cyclotron instability (CDICI) in the presence of nonlocal magnetic-shear and current-channel-width effects is investigated theoretically using the analytical approach of Bakshi et al. (1983). The results are presented in graphs and discussed. Three different CDICI regimes defined by the ratio of the channel width to the shear length are obtained: a purely nonlocal regime with reduced temporal growth rate and group velocity in the z direction going to zero (ratios greater than about 0.1); a regime corresponding to the results of local theory (ratios less than 0.01); and a regime characterized by decreasing temporal growth rate and by z and y group velocities which become negative when the channel width becomes less than the mean ion Larmor radius (ratios 0.001 or less).

Ganguli, G.↗