Search NASA⌕ Search

SEARCH · Search NASA

Results for “graph”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 145 records · Page 8
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 NTRS1981

Graph theory approach to the eigenvalue problem of large space structures

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Reddy, A. S. S. R.↗
NASA NTRS1984

An evaluation of the directed flow graph methodology

The applicability of the Directed Graph Methodology (DGM) to the design and analysis of special purpose image and signal processing hardware was evaluated. A special purpose image processing system was designed and described using DGM. The design, suitable for very large scale integration (VLSI) implements a region labeling technique. Two computer chips were designed, both using metal-nitride-oxide-silicon (MNOS) technology, as well as a functional system utilizing those chips to perform real time region labeling. The system is described in terms of DGM primitives. As it is currently implemented, DGM is inappropriate for describing synchronous, tightly coupled, special purpose systems. The nature of the DGM formalism lends itself more readily to modeling networks of general purpose processors.

Snyder, W. E.↗
NASA NTRS1985

When Is a Bernstein-bezier Curve the Graph of a Function?

The question of determining when a Bernstein-Bezier cubic curve in the plane can be represented as the graph of function in some fixed orthogonal coordinate system is considered. The notion of a curve being monotone in a given direction is introduced to aid in the analysis.

Mclaughlin, H. W.↗
NASA NTRS1988

Multiple degree of freedom object recognition using optical relational graph decision nets

Multiple-degree-of-freedom object recognition concerns objects with no stable rest position with all scale, rotation, and aspect distortions possible. It is assumed that the objects are in a fairly benign background, so that feature extractors are usable. In-plane distortion invariance is provided by use of a polar-log coordinate transform feature space, and out-of-plane distortion invariance is provided by linear discriminant function design. Relational graph decision nets are considered for multiple-degree-of-freedom pattern recognition. The design of Fisher (1936) linear discriminant functions and synthetic discriminant function for use at the nodes of binary and multidecision nets is discussed. Case studies are detailed for two-class and multiclass problems. Simulation results demonstrate the robustness of the processors to quantization of the filter coefficients and to noise.

Casasent, David P.↗
NASA NTRS1988

Planning repair sequences using the AND/OR graph representation of assembly plans

A simple modification is shown in the set of goal nodes of the AND/OR graph that allows its use in planning repairs such as the replacement of a part or a subassembly. An algorithm for the generation of all feasible sequences for disassembly and reassembly of parts that will achieve a repair is shown. This approach has been demonstrated for the example of the repair of space-based satellite equipment.

Homem De Mello, L. S.↗
NASA NTRS1989

Optimal trajectories for the aeroassisted flight experiment. Part 4: Data, tables, and graphs

The determination of optimal trajectories for the aeroassisted flight experiment (AFE) is discussed. Data, tables, and graphs relative to the following transfers are presented: (IA) indirect ascent to a 178 NM perigee via a 197 NM apogee; and (DA) direct ascent to a 178 NM apogee. For both transfers, two cases are investigated: (1) the bank angle is continuously variable; and (2) the trajectory is divided into segments along which the bank angle is constant. For case (2), the following subcases are studied: two segments, three segments, four segments, and five segments; because the time duration of each segment is optimized, the above subcases involve four, six, eight, and ten parameters, respectively. Presented here are systematic data on a total of ten optimal trajectories (OT), five for Transfer IA and five for Transfer DA. For comparison purposes and only for Transfer IA, a five-segment reference trajectory RT is also considered.

Miele, A.↗
NASA NTRS1990

Optimal trajectories for an aerospace plane. Part 2: Data, tables, and graphs

Data, tables, and graphs relative to the optimal trajectories for an aerospace plane are presented. A single-stage-to-orbit (SSTO) configuration is considered, and the transition from low supersonic speeds to orbital speeds is studied for a single aerodynamic model (GHAME) and three engine models. Four optimization problems are solved using the sequential gradient-restoration algorithm for optimal control problems: (1) minimization of the weight of fuel consumed; (2) minimization of the peak dynamic pressure; (3) minimization of the peak heating rate; and (4) minimization of the peak tangential acceleration. The above optimization studies are carried out for different combinations of constraints, specifically: initial path inclination that is either free or given; dynamic pressure that is either free or bounded; and tangential acceleration that is either free or bounded.

Miele, Angelo↗
NASA NTRS1990

Coverability graphs for a class of synchronously executed unbounded Petri net

After detailing a variant of the concurrent-execution rule for firing of maximal subsets, in which the simultaneous firing of conflicting transitions is prohibited, an algorithm is constructed for generating the coverability graph of a net executed under this synchronous firing rule. The omega insertion criteria in the algorithm are shown to be valid for any net on which the algorithm terminates. It is accordingly shown that the set of nets on which the algorithm terminates includes the 'conflict-free' class.

Stotts, P. David↗
NASA NTRS1992

Software For Generating Graphs And Charts

Common Graphics Library (CGL) computer program designed to enable users to generate graphs and charts of quality sufficient for publication or optical projection. Quickly and easily generates linear, logarithmic, bar, pie, and composite charts. Features of linear charts include automatic scaling, increasing or decreasing numerical axes, and character axes. Features of pie charts include segment labels, exploded segments, and chart keys. One of general features, horizontal or vertical orientation of figures. Written in ANSI FORTRAN 77.

Hammond, Dana P.↗
NASA NTRS1993

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗
NASA NTRS1993

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment-distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗
NASA NTRS1994

Weighted graph based ordering techniques for preconditioned conjugate gradient methods

We describe the basis of a matrix ordering heuristic for improving the incomplete factorization used in preconditioned conjugate gradient techniques applied to anisotropic PDE's. Several new matrix ordering techniques, derived from well-known algorithms in combinatorial graph theory, which attempt to implement this heuristic, are described. These ordering techniques are tested against a number of matrices arising from linear anisotropic PDE's, and compared with other matrix ordering techniques. A variation of RCM is shown to generally improve the quality of incomplete factorization preconditioners.

Clift, Simon S.↗
NASA NTRS1997

Graph Embedding Techniques for Bounding Condition Numbers of Incomplete Factor Preconditioning

We extend graph embedding techniques for bounding the spectral condition number of preconditioned systems involving symmetric, irreducibly diagonally dominant M-matrices to systems where the preconditioner is not diagonally dominant. In particular, this allows us to bound the spectral condition number when the preconditioner is based on an incomplete factorization. We provide a review of previous techniques, describe our extension, and give examples both of a bound for a model problem, and of ways in which our techniques give intuitive way of looking at incomplete factor preconditioners.

Guattery, Stephen↗
NASA NTRS2004

Website of the Systems and Analysis Branch Supported Projects and Graph Analysis

Throughout the past few weeks I have learned a great amount of information about many interesting aspects that go on here at NASA Glenn Research Center Branch 7820. Branch 7820 is the Systems and Analysis Branch. The people involved in this Branch deal with in a nutshell the analysis of propulsion systems for Earth to orbit and space transportation systems. The first project that I had worked on was helping my mentor learn more about lunar geography and the most recommended way to maintain communication for our future lunar missions. During this time I studied the craters of the moon, especially the South Pole, to provide her with information so that she can make decisions. I also researched to provide her with contact information on those people who are specialized in lunar geography so that she may talk to them to find out more in depth information. Most of my time spent here has been helping to develop a comprehensive explanation and background of the different projects our Branch has supported. When I first came to NASA Glenn and started working with the 7820 Branch there website had many holes that needed to be filled in. I have spent numerous weeks researching information about topics such as Project Prometheus itself and one of its components Jupiter s Icy Moons Orbiter (JIMO). I have also done a large amount of research on propulsion systems and how different kinds work. I have learned many facts about Nuclear Electric Propulsion (NEP) all the way to Nuclear Thermal Propulsion (NTP) systems. I will continue to do this until all the holes are filled and find out about Global Integrated Design Environment (GLIDE) and Next Generation Launch technology (NGLT). Since most of my job was providing information to go onto a website I has to learn how to put my information into a HTML format. I had no previous knowledge on how to do that kind of task and had to study how to do it and am now able to create a document in HTML format. There has been reorganizing done here at NASA Glenn and our Branch was moved to another building. Therefore, our library had to be moved with us. I spent time helping to put together the boxes, pack the library, and label them accordingly. This was not an easy task but was an experience in itself. I was able to see old posters that NASA had produced about different space missions and look at Russian map of the US and books on space missions. I was also about to see what was in the library in terms of reference material helped because now I can make use of the information for my research on the website. Throughout my internship my mentor will provide me with graphs to analyze and recreate so that she may use them to her advantage. I will learn from every piece of data that comes my way. Later, I will study and analysis gravity-loss for Earth departure trajectories. Since I haven't done that yet I cannot really describe what 1 will learn or what exactly the project entails. The whole experience has been great and I have no doubt that it will exceed every expectation previously thought.

Kellerman, Corinne↗
NASA NTRS2005

Knowledge Representation Standards and Interchange Formats for Causal Graphs

In many domains, automated reasoning tools must represent graphs of causally linked events. These include fault-tree analysis, probabilistic risk assessment (PRA), planning, procedures, medical reasoning about disease progression, and functional architectures. Each of these fields has its own requirements for the representation of causation, events, actors and conditions. The representations include ontologies of function and cause, data dictionaries for causal dependency, failure and hazard, and interchange formats between some existing tools. In none of the domains has a generally accepted interchange format emerged. The paper makes progress towards interoperability across the wide range of causal analysis methodologies. We survey existing practice and emerging interchange formats in each of these fields. Setting forth a set of terms and concepts that are broadly shared across the domains, we examine the several ways in which current practice represents them. Some phenomena are difficult to represent or to analyze in several domains. These include mode transitions, reachability analysis, positive and negative feedback loops, conditions correlated but not causally linked and bimodal probability distributions. We work through examples and contrast the differing methods for addressing them. We detail recent work in knowledge interchange formats for causal trees in aerospace analysis applications in early design, safety and reliability. Several examples are discussed, with a particular focus on reachability analysis and mode transitions. We generalize the aerospace analysis work across the several other domains. We also recommend features and capabilities for the next generation of causal knowledge representation standards.

Throop, David R.↗
NASA NTRS2008

The Analysis of Image Segmentation Hierarchies with a Graph-based Knowledge Discovery System

Currently available pixel-based analysis techniques do not effectively extract the information content from the increasingly available high spatial resolution remotely sensed imagery data. A general consensus is that object-based image analysis (OBIA) is required to effectively analyze this type of data. OBIA is usually a two-stage process; image segmentation followed by an analysis of the segmented objects. We are exploring an approach to OBIA in which hierarchical image segmentations provided by the Recursive Hierarchical Segmentation (RHSEG) software developed at NASA GSFC are analyzed by the Subdue graph-based knowledge discovery system developed by a team at Washington State University. In this paper we discuss out initial approach to representing the RHSEG-produced hierarchical image segmentations in a graphical form understandable by Subdue, and provide results on real and simulated data. We also discuss planned improvements designed to more effectively and completely convey the hierarchical segmentation information to Subdue and to improve processing efficiency.

Tilton, James C.↗