Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph Methods”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Semantic definitions of space flight control center languages using the hierarchical graph technique

In this paper a method is described by which the semantic definitions of the Goddard Space Flight Control Center Command Languages can be specified. The semantic modeling facility used is an extension of the hierarchical graph technique, which has a major benefit of supporting a variety of data structures and a variety of control structures. It is particularly suited for the semantic descriptions of such types of languages where the detailed separation between the underlying operating system and the command language system is system dependent. These definitions were used in the definition of the Systems Test and Operation Language (STOL) of the Goddard Space Flight Center which is a command language that provides means for the user to communicate with payloads, application programs, and other ground system elements.

Zaghloul, M. E.↗
NASA NTRS2004

Finding Minimum-Power Broadcast Trees for Wireless Networks

Some algorithms have been devised for use in a method of constructing tree graphs that represent connections among the nodes of a wireless communication network. These algorithms provide for determining the viability of any given candidate connection tree and for generating an initial set of viable trees that can be used in any of a variety of search algorithms (e.g., a genetic algorithm) to find a tree that enables the network to broadcast from a source node to all other nodes while consuming the minimum amount of total power. The method yields solutions better than those of a prior algorithm known as the broadcast incremental power algorithm, albeit at a slightly greater computational cost.

Arabshahi, Payman↗
NASA NTRS1989

Multiprocessor performance modeling with ADAS

A graph managing strategy referred to as the Algorithm to Architecture Mapping Model (ATAMM) appears useful for the time-optimized execution of application algorithm graphs in embedded multiprocessors and for the performance prediction of graph designs. This paper reports the modeling of ATAMM in the Architecture Design and Assessment System (ADAS) to make an independent verification of ATAMM's performance prediction capability and to provide a user framework for the evaluation of arbitrary algorithm graphs. Following an overview of ATAMM and its major functional rules are descriptions of the ADAS model of ATAMM, methods to enter an arbitrary graph into the model, and techniques to analyze the simulation results. The performance of a 7-node graph example is evaluated using the ADAS model and verifies the ATAMM concept by substantiating previously published performance results.

Hayes, Paul J.↗
NASA NTRS2012

Interactive Web Graphs with Fewer Restrictions

There is growing popularity for interactive, statistical web graphs and programs to generate them. However, it seems that these programs tend to be somewhat restricted in which web browsers and statistical software are supported. For example, the software might use SVG (e.g., Protovis, gridSVG) or HTML canvas, both of which exclude most versions of Internet Explorer, or the software might be made specifically for R (gridSVG, CRanvas), thus excluding users of other stats software. There are more general tools (d3, Rapha lJS) which are compatible with most browsers, but using one of these to make statistical graphs requires more coding than is probably desired, and requires learning a new tool. This talk will present a method for making interactive web graphs, which, by design, attempts to support as many browsers and as many statistical programs as possible, while also aiming to be relatively easy to use and relatively easy to extend.

Fiedler, James↗
NASA NTRS1966

Flowgraph techniques for closed systems.

Flowgraph techniques for closed systems, discussing properties, approximation method, topology equation, frequency response, constraints, oscillatory and stochastic processes, etc

HARMONIC OSCILLATOR↗
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 NTRS1996

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗
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 NTRS2013

Bilayer Protograph Codes for Half-Duplex Relay Channels

Direct to Earth return links are limited by the size and power of lander devices. A standard alternative is provided by a two-hops return link: a proximity link (from lander to orbiter relay) and a deep-space link (from orbiter relay to Earth). Although direct to Earth return links are limited by the size and power of lander devices, using an additional link and a proposed coding for relay channels, one can obtain a more reliable signal. Although significant progress has been made in the relay coding problem, existing codes must be painstakingly optimized to match to a single set of channel conditions, many of them do not offer easy encoding, and most of them do not have structured design. A high-performing LDPC (low-density parity-check) code for the relay channel addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality, and are not easily adapted without extensive re-optimization for various channel conditions. This code for the relay channel combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a pro to graph. In addition to the contribution to relay encoding, an improved family of protograph codes was produced for the point-to-point AWGN (additive white Gaussian noise) channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity. These LDPC relay codes address three important issues in an integrative manner: low encoding complexity, modular structure allowing for easy design, and rate compatibility so that the code can be easily matched to a variety of channel conditions without extensive re-optimization. The main problem of half-duplex relay coding can be reduced to the simultaneous design of two codes at two rates and two SNRs (signal-to-noise ratios), such that one is a subset of the other. This problem can be addressed by forceful optimization, but a clever method of addressing this problem is via the bilayer lengthened (BL) LDPC structure. This method uses a bilayer Tanner graph to make the two codes while using a concept of "parity forwarding" with subsequent successive decoding that removes the need to directly address the issue of uneven SNRs among the symbols of a given codeword. This method is attractive in that it addresses some of the main issues in the design of relay codes, but it does not by itself give rise to highly structured codes with simple encoding, nor does it give rate-compatible codes. The main contribution of this work is to construct a class of codes that simultaneously possess a bilayer parity- forwarding mechanism, while also benefiting from the properties of protograph codes having an easy encoding, a modular design, and being a rate-compatible code.

Divsalar, Dariush↗
NASA NTRS1985

On instruction sets and their formats

Central to instruction set design is the issue of the instruction format. Some common format encoding techniques are discussed, and a method of representing high-level language parse trees by means of formats that cover successively larger portions of a tree is introduced. Variations are introduced on the method that represent directed acyclic graphs as well as simple parse trees, and that encode constants in a special fashion. For a particular representation, the number of times each format is executed to run a sample program to completion is measured.

Flynn, M. J.↗
NASA NTRS1989

Fiber optic links for microwave/millimeter-wave systems

Recent advances in device technology for microwave/mm-wave (M/MMW) analog fiber-optic communication systems are surveyed, with discussion of system parameters, design optimization methods, and hardware selection and manufacturing considerations. Particular attention is given to 1-km-link systems operating at 21, 30, and 12 GHz for satellite-communication, electronic-warfare, and radar applications. The design and fabrication simplicity of direct modulation is weighed against the wide bandwidth, low distortion, and mm-wave and frequency operation advantages of external modulation. Homodyne or heterodyne coherent detection is shown to improve system S/N by 10-20 dB over conventional detection methods. Diagrams, drawings, photographs, and graphs of typical performance data are included.

Pan, J. J.↗
NASA NTRS1943

The Measurement of Fuel-Air Ratio by Analysis for the Oxidized Exhaust Gas

An investigation was made to determine a method of measuring fuel-air ratio that could be used for test purposes in flight and for checking conventional equipment in the laboratory. Two single-cylinder test engines equipped with typical commercial engine cylinders were used. The fuel-air ratio of the mixture delivered to the engines was determined by direct measurement of the quantity of air and of fuel supplied and also by analysis of the oxidized exhaust gas and of the normal exhaust gas. Five fuels were used: gasoline that complied with Army-Navy fuel Specification No. AN-VV-F-781 and four mixtures of this gasoline with toluene, benzene, and xylene. The method of determining the fuel-air ratio described in this report involves the measurement of the carbon-dioxide content of the oxidized exhaust gas and the use of graphs for the presented equation. This method is considered useful in aircraft, in the field, or in the laboratory for a range of fuel-air ratios from 0.047 to 0.124.

Gerrish, Harold C.↗
NASA NTRS1943

The Measurement of Fuel-air Ratio by Analysis of the Oxidized Exhaust Gas

An investigation was made to determine a method of measuring fuel-air ratio that could be used for test purposes in flight and for checking conventional equipment in the laboratory. Two single-cylinder test engines equipped with typical commercial engine cylinders were used. The fuel-air ratio of the mixture delivered to the engines was determined by direct measurement of the quantity of air and of fuel supplied and also by analysis of the oxidized exhaust gas and of the normal exhaust gas. Five fuels were used: gasoline that complied with Army-Navy Fuel Specification, No. AN-VV-F-781 and four mixtures of this gasoline with toluene, benzene, and xylene. The method of determining the fuel-air ratio described in this report involves the measurement of the carbon-dioxide content of the oxidized exhaust gas and the use of graphs or the presented equation. This method is considered useful in aircraft, in the field, or in the laboratory for a range of fuel-air ratios from 0.047 to 0.124

FUELS-TOLUENE↗
NASA NTRS2004

Graphical User Interface Development for Representing Air Flow Patterns

In the Turbine Branch, scientists carry out experimental and computational work to advance the efficiency and diminish the noise production of jet engine turbines. One way to do this is by decreasing the heat that the turbine blades receive. Most of the experimental work is carried out by taking a single turbine blade and analyzing the air flow patterns around it, because this data indicates the sections of the turbine blade that are getting too hot. Since the cost of doing turbine blade air flow experiments is very high, researchers try to do computational work that fits the experimental data. The goal of computational fluid dynamics is for scientists to find a numerical way to predict the complex flow patterns around different turbine blades without physically having to perform tests or costly experiments. When visualizing flow patterns, scientists need a way to represent the flow conditions around a turbine blade. A researcher will assign specific zones that surround the turbine blade. In a two-dimensional view, the zones are usually quadrilaterals. The next step is to assign boundary conditions which define how the flow enters or exits one side of a zone. way of setting up computational zones and grids, visualizing flow patterns, and storing all the flow conditions in a file on the computer for future computation. Such a program is necessary because the only method for creating flow pattern graphs is by hand, which is tedious and time-consuming. By using a computer program to create the zones and grids, the graph would be faster to make and easier to edit. Basically, the user would run a program that is an editable graph. The user could click and drag with the mouse to form various zones and grids, then edit the locations of these grids, add flow and boundary conditions, and finally save the graph for future use and analysis. My goal this summer is to create a graphical user interface (GUI) that incorporates all of these elements. I am writing the program in Java, a language that is portable among platforms, because it can run on different operating systems such as Windows and Unix without having to be rewritten. I had no prior experience of programming in Java at the start of my internship; I am continuously learning as I create the program. I have written the part of the program that enables a user to draw several zones, edit them, and store their locations. The next phase of my project is to allow the user to click on the side of a zone and create a boundary condition for it. A previous intern wrote a program that allows the user to input boundary conditions. I can integrate the two programs to create a larger, more usable program. After that, I will develop a way for the user to save the graph for future reference. Another eventual goal is to make the GUI capable of creating three-dimensional zones as well. Researchers such as my mentor, Dr. David Ashpis, need a quick, user-friendly

Chaudhary, Nilika↗
NASA NTRS1961

Flight Performance Handbook for Orbital Operations: Orbital Mechanics and Astrodynamics Formulae, Theorems, Techniques, and Applications

This handbook provides parametric data useful both to the space vehicle designer and mission analyst. It provides numerical and analytical relationships between missions and gross vehicle characteristics as a function of performance parameters. The effects of missile constraints and gross guidance limitations plus operational constraints such as launch site location, tracking net location, orbit visibility and mission on trajectory and orbit design parameters are exhibited. The influence of state-of- the-art applications of solar power as compared to future applications of nuclear power on orbit design parameters, such as eclipse time, are among the parameters included in the study. The principal aim, however, is in providing the analyst with useful parametric design information to cover the general area of earth satellite missions in the region of near-earth to cislunar space and beyond and from injection to atmospheric entry and controlled descent. The chapters are organized around the central idea of orbital operations in the 1961-1969 era with emphasis on parametric flight mechanics studies for ascent phase and parking orbits, transfer maneuvers, rendezvous maneuver, operational orbit considerations, and operational orbit control. The results are based almost entirely on the principles of flight and celestial mechanics. Numerous practical examples have been worked out in detail. This is especially important where it has been difficult or impossible to represent all possible variations of the parameters. The handbook contains analytical formulae and sufficient textual material to permit their proper use. The analytic methods consist of both exact and rapid, approximate methods. Scores of tables, working graphs and illustrations amplify the mathematical models which, together with important facts and data, cover the engineering and scientific applications of orbital mechanics. Each of the five major chapters are arranged to provide a rapid review of an entire astrodynamic subject. By the use of compact graphical and tabular presentation the full scope of the material is made available in an easy-to-use style. Throughout the volume the analyst is shown, by means of suitable introductions, notes, authoritative examples, and cross-references the vital interrelation of the various orbital mechanics topics in the general field of earth satellites and satellite rendezvous. The handbook is designed to give the analyst rapid, reliable access to the mathematics of orbital mechanics needed for virtually any working requirements.

Ambrosio, Alphonso↗