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.

SourceResearch connectionFrom yearThrough year

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

At least 631 records · Page 35

All sources NASA NTRS DOE OSTI

NASA NTRS1984

Augmenting computer networks

Three methods of augmenting computer networks by adding at most one link per processor are discussed: (1) A tree of N nodes may be augmented such that the resulting graph has diameter no greater than 4log sub 2((N+2)/3)-2. Thi O(N(3)) algorithm can be applied to any spanning tree of a connected graph to reduce the diameter of that graph to O(log N); (2) Given a binary tree T and a chain C of N nodes each, C may be augmented to produce C so that T is a subgraph of C. This algorithm is O(N) and may be used to produce augmented chains or rings that have diameter no greater than 2log sub 2((N+2)/3) and are planar; (3) Any rectangular two-dimensional 4 (8) nearest neighbor array of size N = 2(k) may be augmented so that it can emulate a single step shuffle-exchange network of size N/2 in 3(t) time steps.

Bokhari, S. H.↗

NASA NTRS1988

A machine vision identification technique from range images

An orientation-independent identification technique from three-dimensional surface maps or range images is developed. Given the range image of an object, it is decomposed into orientation-independent patches using the sign of Gaussian curvature. A relational graph is then set up such that a node represents a patch and an edge represents the adjacency of two patches. The identification of the object is achieved by matching its graph representation to a number of model graphs. The matching is performed by employing the best-first search strategy. Examples of real range images show the merit of the technique.

Kehtarnavaz, N.↗

NASA NTRS1990

Spatial scales of cirrus cloud properties

Research in studying the spatial scales of the cirrus, used data collected during the flight legs of the NCAR Sabreliner aircraft on four days during the FIRE Cirrus IFO to study the spatial scales of the cirrus, and will concentrate on the scales of horizontal wind. The spatial scales of the cloud features can be described by power spectra (or spectral density graphs) and cumulative variance graphs. The cumulative variance graphs were created by first using a Fast Fourier Transform (FFT) to create variance spectra. The variances were then summed in a cumulative fashion from the largest scalelengths (wavelengths) to the smallest. No detrending was done to the original data, and no smoothing or averaging was done to the spectral points. All the spectral points were included. This means that the values of the first five to ten spectral points of the large scalelengths should only be considered to be qualitatively correct. The cumulative variance at smaller scalelengths should be correct because a more accurate representation of the variance at the larger scalelengths should only redistribute the energy amongst the larger scalelengths.

Hein, Paul F.↗

NASA NTRS1990

Using minimal spanning trees to compare the reliability of network topologies

Graph theoretic methods are applied to compute the reliability for several types of networks of moderate size. The graph theory methods used are minimal spanning trees for networks with bi-directional links and the related concept of strongly connected directed graphs for networks with uni-directional links. A comparison is conducted of ring networks and braided networks. The case is covered where just the links fail and the case where both links and nodes fail. Two different failure modes for the links are considered. For one failure mode, the link no longer carries messages. For the other failure mode, the link delivers incorrect messages. There is a description and comparison of link-redundancy versus path-redundancy as methods to achieve reliability. All the computations are carried out by means of a fault tree program.

Leister, Karen J.↗

NASA NTRS1990

Quantifying fault recovery in multiprocessor systems

Various aspects of reliable computing are formalized and quantified with emphasis on efficient fault recovery. The mathematical model which proves to be most appropriate is provided by the theory of graphs. New measures for fault recovery are developed and the value of elements of the fault recovery vector are observed to depend not only on the computation graph H and the architecture graph G, but also on the specific location of a fault. In the examples, a hypercube is chosen as a representative of parallel computer architecture, and a pipeline as a typical configuration for program execution. Dependability qualities of such a system is defined with or without a fault. These qualities are determined by the resiliency triple defined by three parameters: multiplicity, robustness, and configurability. Parameters for measuring the recovery effectiveness are also introduced in terms of distance, time, and the number of new, used, and moved nodes and edges.

Malek, Miroslaw↗

NASA NTRS1991

Robust fault diagnosis of physical systems in operation

Ideas are presented and demonstrated for improved robustness in diagnostic problem solving of complex physical systems in operation, or operative diagnosis. The first idea is that graceful degradation can be viewed as reasoning at higher levels of abstraction whenever the more detailed levels proved to be incomplete or inadequate. A form of abstraction is defined that applies this view to the problem of diagnosis. In this form of abstraction, named status abstraction, two levels are defined. The lower level of abstraction corresponds to the level of detail at which most current knowledge-based diagnosis systems reason. At the higher level, a graph representation is presented that describes the real-world physical system. An incremental, constructive approach to manipulating this graph representation is demonstrated that supports certain characteristics of operative diagnosis. The suitability of this constructive approach is shown for diagnosing fault propagation behavior over time, and for sometimes diagnosing systems with feedback. A way is shown to represent different semantics in the same type of graph representation to characterize different types of fault propagation behavior. An approach is demonstrated that threats these different behaviors as different fault classes, and the approach moves to other classes when previous classes fail to generate suitable hypotheses. These ideas are implemented in a computer program named Draphys (Diagnostic Reasoning About Physical Systems) and demonstrated for the domain of inflight aircraft subsystems, specifically a propulsion system (containing two turbofan systems and a fuel system) and hydraulic subsystem.

Abbott, Kathy Hamilton↗

NASA NTRS1990

Mapping unstructured grid problems to the connection machine

We present a highly parallel graph mapping technique that enables one to solve unstructured grid problems on massively parallel computers. Many implicit and explicit methods for solving discretizated partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The time spent communicating can limit the high performance promised by massively parallel computing. To eliminate this bottleneck, we map the graph of the irregular problem to the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. We show that, in comparison to a naive assignment of processors, our heuristic mapping algorithm significantly reduces the communication time on the Connection Machine, CM-2.

Hammond, Steven W.↗

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 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 NTRS1991

Application of machine learning and expert systems to Statistical Process Control (SPC) chart interpretation

Statistical Process Control (SPC) charts are one of several tools used in quality control. Other tools include flow charts, histograms, cause and effect diagrams, check sheets, Pareto diagrams, graphs, and scatter diagrams. A control chart is simply a graph which indicates process variation over time. The purpose of drawing a control chart is to detect any changes in the process signalled by abnormal points or patterns on the graph. The Artificial Intelligence Support Center (AISC) of the Acquisition Logistics Division has developed a hybrid machine learning expert system prototype which automates the process of constructing and interpreting control charts.

Shewhart, Mark↗

NASA NTRS1992

Evaluation of force-torque displays for use with space station telerobotic activities

Recent experiments which addressed Space Station remote manipulation tasks found that tactile force feedback (reflecting forces and torques encountered at the end-effector through the manipulator hand controller) does not improve performance significantly. Subjective response from astronaut and non-astronaut test subjects indicated that force information, provided visually, could be useful. No research exists which specifically investigates methods of presenting force-torque information visually. This experiment was designed to evaluate seven different visual force-torque displays which were found in an informal telephone survey. The displays were prototyped in the HyperCard programming environment. In a within-subjects experiment, 14 subjects nullified forces and torques presented statically, using response buttons located at the bottom of the screen. Dependent measures included questionnaire data, errors, and response time. Subjective data generally demonstrate that subjects rated variations of pseudo-perspective displays consistently better than bar graph and digital displays. Subjects commented that the bar graph and digital displays could be used, but were not compatible with using hand controllers. Quantitative data show similar trends to the subjective data, except that the bar graph and digital displays both provided good performance, perhaps do to the mapping of response buttons to display elements. Results indicate that for this set of displays, the pseudo-perspective displays generally represent a more intuitive format for presenting force-torque information.

Hendrich, Robert C.↗

NASA NTRS1990

Solving unstructured grid problems on massively parallel computers

A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Hammond, Steven W.↗

NASA NTRS1990

Assembly, disassembly and repair of large truss structures in space

This paper addresses the problem of planning assembly, disassembly and repair sequences for large truss structures in space. First, the AND/OR graph representation scheme for mechanical assemblies is reviewed and extended to truss structures. The assembly, disassembly and repair sequence planning problem is then formulated as a graph search problem using assembly's AND/OR graph and appropriate cost functions. The general search problem, which is known to be exponential, is simplified by taking advantage of the symmetries that exist in truss structures. General cost functions for truss assembly are discussed.

Desai, Rajiv S.↗

NASA NTRS1989

Generation of precedence relations for mechanical assemblies

Planning of assembly sequences is essential to the manufacturing system design process. Several methodologies have been proposed to represent all the feasible assembly sequences. In this thesis, three algorithms are presented to generate three sets of precedence relations based on all the infeasible assembly tasks, all the infeasible assembly states, and all the feasible assembly sequences, respectively. The equivalence of the resulting sets of precedence relations to the AND/OR graph is established. A new property, the real time property, of a representation of assembly sequences is defined and discussed. A representation of assembly sequences is said to have the real time property, if it is possible to generate the next assembly task by testing locally in the representation, and it will guarantee that the generated assembly task will not lead the assembly sequence to a dead end situation, in which no feasible assembly task can be performed any more. It is shown that the correctness and completeness of one representation can not guarantee the real time property of the representation. It is proven that the directed graph representation and the set of precedence relations based on all the infeasible assembly states have the real time property, while the AND/OR graph representation and the set of precedence relations based on all the infeasible assembly tasks do not have the real time property. Finally in the thesis, the PLEIDEAS system, a PLanning Environment for Integrated DEsign of Assembly Systems, is described and illustrated by an example.

Zhang, Hui↗

NASA NTRS1993

Parametric binary dissection

Binary dissection is widely used to partition non-uniform domains over parallel computers. This algorithm does not consider the perimeter, surface area, or aspect ratio of the regions being generated and can yield decompositions that have poor communication to computation ratio. Parametric Binary Dissection (PBD) is a new algorithm in which each cut is chosen to minimize load + lambda x(shape). In a 2 (or 3) dimensional problem, load is the amount of computation to be performed in a subregion and shape could refer to the perimeter (respectively surface) of that subregion. Shape is a measure of communication overhead and the parameter permits us to trade off load imbalance against communication overhead. When A is zero, the algorithm reduces to plain binary dissection. This algorithm can be used to partition graphs embedded in 2 or 3-d. Load is the number of nodes in a subregion, shape the number of edges that leave that subregion, and lambda the ratio of time to communicate over an edge to the time to compute at a node. An algorithm is presented that finds the depth d parametric dissection of an embedded graph with n vertices and e edges in O(max(n log n, de)) time, which is an improvement over the O(dn log n) time of plain binary dissection. Parallel versions of this algorithm are also presented; the best of these requires O((n/p) log(sup 3)p) time on a p processor hypercube, assuming graphs of bounded degree. How PBD is applied to 3-d unstructured meshes and yields partitions that are better than those obtained by plain dissection is described. Its application to the color image quantization problem is also discussed, in which samples in a high-resolution color space are mapped onto a lower resolution space in a way that minimizes the color error.

Bokhari, Shahid H.↗

NASA NTRS1993

Fault management for data systems

Issues related to automating the process of fault management (fault diagnosis and response) for data management systems are considered. Substantial benefits are to be gained by successful automation of this process, particularly for large, complex systems. The use of graph-based models to develop a computer assisted fault management system is advocated. The general problem is described and the motivation behind choosing graph-based models over other approaches for developing fault diagnosis computer programs is outlined. Some existing work in the area of graph-based fault diagnosis is reviewed, and a new fault management method which was developed from existing methods is offered. Our method is applied to an automatic telescope system intended as a prototype for future lunar telescope programs. Finally, an application of our method to general data management systems is described.

Boyd, Mark A.↗

NASA NTRS1993

A dataflow analysis tool for parallel processing of algorithms

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on a set of identical parallel processors. Typical applications include signal processing and control law problems. Graph analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool is shown to facilitate the application of the design process to a given problem.

Jones, Robert L., III↗

NASA NTRS1994

MUADEE: Mars Upper Atmosphere Dynamics, Energetics, and Evolution discovery mission. Executive summary volume

This document is the final report of the MAUDEE (Mars Upper Atmosphere Dynamics, Energetics, and Evolution) consortium. It describes a low cost Discovery mission to investigate the upper atmosphere of Mars and to understand the manner in which Mars has evolved over geologic time. In keeping with the innovative philosophy permeating the Discovery Program and in order to minimize the burden of reading an extensive prose exposition, a new presentation format has been adopted. The format involves a series of view graphs with facing text. The view graphs form the basis of a complete oral presentation of the MAUDEE mission and the facing text provides more detailed, but still brief, explanatory descriptions. Readers can scan the view graphs and/or read the facing text at their discretion. The oral presentation of this study was given to code SL personnel at NASA Headquarters on February 23, 1994. MAUDEE is an essential component of the Mars Exploration Program. It provides the information required to understand the evolution of the planet via the escape of volatiles. It provides the key measurements needed to understand the upper atmosphere of the last of the three terrestrial planets to be so studied. It connects and supplements investigations based on other Mars missions: Mars Surveyor, Planet-B and Mars-96. The MAUDEE mission plan involves a combination of remote and in-situ sensors, housed in three instrument packages. The sensors make measurements of the atmospheric regions between 60-200 km. These instruments are based on extensive heritage from Earth explorers and Pioneer Venus. The mission scenario has several phases and employs aerobraking maneuvers to lower initial apoapsis, thereby reducing fuel requirements. The spacecraft has body-mounted solar cells, enabling deep diving into the Martian atmosphere. The orbital inclination allows for pole-to-pole latitudinal sweeps in an initial elliptical phase, followed by a circular phase affording detailed diurnal measurements. The nominal mission duration at Mars is one Mars year.

Killeen, Timothy L.↗