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 793 records · Page 44
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

AKPLOT: A plotter routine for IBM PC, XT and AT

The AKPLOT software for the IBM PC, XT, and AT is an efficient and versatile tool that allows X-Y plotting of quantitative information. Features include IBM four-color graphics, which combined with 10 different symbols allows 40 different curves on the same grid, shrink or expansion of the graph size, any combination of log and linear X and Y axes, selective plotting from multiple curves of a previous run, interpolation and polynomial least-squares fit with any degree polynomial, and a 90-degree tilt of the entire graph. These options are independent, and can be invoked individually.

Kantak, Anil↗
NASA NTRS1986

Parallel solution of closely coupled systems

The odd-even permutation and associated unitary transformations for reordering the matrix coefficient A are employed as means of breaking the strong seriality which is characteristic of closely coupled systems. The nested dissection technique is also reviewed, and the equivalence between reordering A and dissecting its network is established. The effect of transforming A with odd-even permutation on its topology and the topology of its Cholesky factors is discussed. This leads to the construction of directed graphs showing the computational steps required for factoring A, their precedence relationships and their sequential and concurrent assignment to the available processors. Expressions for the speed-up and efficiency of using N processors in parallel relative to the sequential use of a single processor are derived from the directed graph. Similar expressions are also derived when the number of available processors is fewer than required.

Utku, S.↗
NASA NTRS1987

Evaluation of flow topology from numerical data

Results obtained from numerical calculations and modern (optical) diagnostics are often too complicated for manual inspection, manipulation and display. A simpler but still accurate description of these results is needed to facilitate data understanding. The paper discusses preliminary investigations into methods for the decomposition of 2-D and 3-D fluid flow data bases into elementary structures for purposes of description, analysis and comparison. An approach which involves the development of scene-like representation of the flow topology is presented. Using features such as critical points and dividing streamlines as a basis, a representation of the global topology of the flow is generated. The topology is then represented by a graph with the various structures represented by the nodes and their relationships in the flow by the connecting lines of the graph. Once the flow field has been placed in this form, it can be studied and compared with other data sets using techniques of syntactic pattern recognition or displayed using 3-D graphics techniques.

Hesselink, Lambertus↗
NASA NTRS1987

Methodology for testing and validating knowledge bases

A test and validation toolset developed for artificial intelligence programs is described. The basic premises of this method are: (1) knowledge bases have a strongly declarative character and represent mostly structural information about different domains, (2) the conditions for integrity, consistency, and correctness can be transformed into structural properties of knowledge bases, and (3) structural information and structural properties can be uniformly represented by graphs and checked by graph algorithms. The interactive test and validation environment have been implemented on a SUN workstation.

Krishnamurthy, C.↗
NASA NTRS1988

Supersonic aerodynamics of delta wings

Through the empirical correlation of experimental data and theoretical analysis, a set of graphs has been developed which summarize the inviscid aerodynamics of delta wings at supersonic speeds. The various graphs which detail the aerodynamic performance of delta wings at both zero-lift and lifting conditions were then employed to define a preliminary wing design approach in which both the low-lift and high-lift design criteria were combined to define a feasible design space.

Wood, Richard M.↗
NASA NTRS1988

Efficient parallel architecture for highly coupled real-time linear system applications

A systematic procedure is developed for exploiting the parallel constructs of computation in a highly coupled, linear system application. An overall top-down design approach is adopted. Differential equations governing the application under consideration are partitioned into subtasks on the basis of a data flow analysis. The interconnected task units constitute a task graph which has to be computed in every update interval. Multiprocessing concepts utilizing parallel integration algorithms are then applied for efficient task graph execution. A simple scheduling routine is developed to handle task allocation while in the multiprocessor mode. Results of simulation and scheduling are compared on the basis of standard performance indices. Processor timing diagrams are developed on the basis of program output accruing to an optimal set of processors. Basic architectural attributes for implementing the system are discussed together with suggestions for processing element design. Emphasis is placed on flexible architectures capable of accommodating widely varying application specifics.

Carroll, Chester C.↗
NASA NTRS1988

Modeling and optimum time performance for concurrent processing

The development of a new graph theoretic model for describing the relation between a decomposed algorithm and its execution in a data flow environment is presented. Called ATAMM, the model consists of a set of Petri net marked graphs useful for representing decision-free algorithms having large-grained, computationally complex primitive operations. Performance time measures which determine computing speed and throughput capacity are defined, and the ATAMM model is used to develop lower bounds for these times. A concurrent processing operating strategy for achieving optimum time performance is presented and illustrated by example.

Mielke, Roland R.↗
NASA NTRS1989

Airplane-Acceleration Display For Low-Gravity Research

Bar-graph display facilitates precise control of trajectories. Overall display system includes accelerometer block, power-supply-and-interface box, thrust-axis display, and pitch-and-lateral-axes display. Accelerometer block includes three servoaccelerometers orthogonally mounted on adjustable triaxial base allowing fine alignment of accelerometers with respect to airplane. Accelerometer block and power-supply-and-interface box located near center of gravity of airplane in lugguage area. LED bar-graph displays take up less panel space and easier to align with axes represented. No moving parts and not subject to parallax. With help of display, pilot adheres to predetermined fraction of g, with minimal lateral acceleration.

Millis, Marc G.↗
NASA NTRS1986

An Ada inference engine for expert systems

The purpose is to investigate the feasibility of using Ada for rule-based expert systems with real-time performance requirements. This includes exploring the Ada features which give improved performance to expert systems as well as optimizing the tradeoffs or workarounds that the use of Ada may require. A prototype inference engine was built using Ada, and rule firing rates in excess of 500 per second were demonstrated on a single MC68000 processor. The knowledge base uses a directed acyclic graph to represent production lines. The graph allows the use of AND, OR, and NOT logical operators. The inference engine uses a combination of both forward and backward chaining in order to reach goals as quickly as possible. Future efforts will include additional investigation of multiprocessing to improve performance and creating a user interface allowing rule input in an Ada-like syntax. Investigation of multitasking and alternate knowledge base representations will help to analyze some of the performance issues as they relate to larger problems.

Lavallee, David B.↗
NASA NTRS1987

Planning assembly/disassembly operations for space telerobotics

Space telerobotic systems will perform complex tasks of assembly, disassembly, and repair of space-based equipment. Planning such tasks requires reasoning about the functional, physical, and geometrical properties of the equipment, as well as a representation of the characteristics and capabilities of the manipulators and sensors available for the task. The And/Or graph is a useful approach to representation of feasible assembly/disassembly sequences and provides the basis for search among alternative strategies. The paper describes the use of parts entropy measures as evaluation criteria for search in the And/Or graph space. This approach leads to candidate task plans which minimize the complexity of intermediate geometrical states.

Sanderson, Arthur C.↗
NASA NTRS1990

Bearing elastohydrodynamic lubrication: A complex calculation made simple

The lubricant elastohydrodynamic (EHD) film thickness formula is reduced to a simplified form whereby only the rolling-element bearing inside and outside diameters and speed (in revolutions per minute) and the lubricant type and viscosity (in centipoise) at temperature are required for its use. Additionally, a graph is provided for the first time that is based upon experimental data giving an EHD film reduction factor as a function of contact lubricant flow number. This reduction factor accounts for lubricant starvation within the Hertzian contact. A graph relating the ratio of minimum film thickness to composite surface roughness and a lubrication-life correction factor is also provided. The life correction factor is used to determine resultant bearing life.

Zaretsky, Erwin V.↗
NASA NTRS1989

Computational dynamics for robotics systems using a non-strict computational approach

A Non-Strict computational approach for real-time robotics control computations is proposed. In contrast to the traditional approach to scheduling such computations, based strictly on task dependence relations, the proposed approach relaxes precedence constraints and scheduling is guided instead by the relative sensitivity of the outputs with respect to the various paths in the task graph. An example of the computation of the Inverse Dynamics of a simple inverted pendulum is used to demonstrate the reduction in effective computational latency through use of the Non-Strict approach. A speedup of 5 has been obtained when the processes of the task graph are scheduled to reduce the latency along the crucial path of the computation. While error is introduced by the relaxation of precedence constraints, the Non-Strict approach has a smaller error than the conventional Strict approach for a wide range of input conditions.

Orin, David E.↗
NASA NTRS1989

A distributed program composition system

A graphical technique for creating distributed computer programs is investigated and a prototype implementation is described which serves as a testbed for the concepts. The type of programs under examination is restricted to those comprising relatively heavyweight parts that intercommunicate by passing messages of typed objects. Such programs are often presented visually as a directed graph with computer program parts as the nodes and communication channels as the edges. This class of programs, called parts-based programs, is not well supported by existing computer systems; much manual work is required to describe the program to the system, establish the communication paths, accommodate the heterogeneity of data types, and to locate the parts of the program on the various systems involved. The work described solves most of these problems by providing an interface for describing parts-based programs in this class in a way that closely models the way programmers think about them: using sketches of diagraphs. Program parts, the computational modes of the larger program system are categorized in libraries and are accessed with browsers. The process of programming has the programmer draw the program graph interactively. Heterogeneity is automatically accommodated by the insertion of type translators where necessary between the parts. Many decisions are necessary in the creation of a comprehensive tool for interactive creation of programs in this class. Possibilities are explored and the issues behind such decisions are presented. An approach to program composition is described, not a carefully implemented programming environment. However, a prototype implementation is described that can demonstrate the ideas presented.

Brown, Robert L.↗
NASA NTRS1989

Modeling and analysis of multiprocessor architectures

Some technologies developed for system level modeling and analysis of algorithms/architectures using an architecture design and development system are reviewed. Modeling and analysis is described with attention given to modeling constraints and analysis using constrained software graphs. An example is presented of an ADAS graph and its associated attributes, such as firing delay, token consume rate, token produce rate, firing threshold, firing condition, arc queue lengths, associated C or Ada functional model, and stochastic behavior.

Yalamanchili, S.↗
NASA NTRS1990

Surrogate oracles, generalized dependency and simpler models

Software reliability models require the sequence of interfailure times from the debugging process as input. It was previously illustrated that using data from replicated debugging could greatly improve reliability predictions. However, inexpensive replication of the debugging process requires the existence of a cheap, fast error detector. Laboratory experiments can be designed around a gold version which is used as an oracle or around an n-version error detector. Unfortunately, software developers can not be expected to have an oracle or to bear the expense of n-versions. A generic technique is being investigated for approximating replicated data by using the partially debugged software as a difference detector. It is believed that the failure rate of each fault has significant dependence on the presence or absence of other faults. Thus, in order to discuss a failure rate for a known fault, the presence or absence of each of the other known faults needs to be specified. Also, in simpler models which use shorter input sequences without sacrificing accuracy are of interest. In fact, a possible gain in performance is conjectured. To investigate these propositions, NASA computers running LIC (RTI) versions are used to generate data. This data will be used to label the debugging graph associated with each version. These labeled graphs will be used to test the utility of a surrogate oracle, to analyze the dependent nature of fault failure rates and to explore the feasibility of reliability models which use the data of only the most recent failures.

Wilson, Larry↗
NASA NTRS1990

Dissolving variables in connectionist combinatory logic

A connectionist system which can represent and execute combinator expressions to elegantly solve the variable binding problem in connectionist networks is presented. This system is a graph reduction machine utilizing graph representations and traversal mechanisms similar to ones described in the BoltzCONS system of Touretzky (1986). It is shown that, as combinators eliminate variables by introducing special functions, these functions can be connectionistically implemented without reintroducing variable binding. This approach 'dissolves' an important part of the variable binding problem, in that a connectionist system still has to manipulate complex data structures, but those structures and their manipulations are rendered more uniform.

Barnden, John↗
NASA NTRS1990

Atmospheric absorption of sound - Update

Best current expressions for the vibrational relaxation times of oxygen and nitrogen in the atmosphere are used to compute total absorption. The resulting graphs of total absorption as a function of frequency for different humidities should be used in lieu of the graph published earlier by Evans et al (1972).

Bass, H. E.↗
NASA NTRS1991

Representations of mechanical assembly sequences

Five types of representations for assembly sequences are reviewed: the directed graph of feasible assembly sequences, the AND/OR graph of feasible assembly sequences, the set of establishment conditions, and two types of sets of precedence relationships. (precedence relationships between the establishment of one connection between parts and the establishment of another connection, and precedence relationships between the establishment of one connection and states of the assembly process). The mappings of one representation into the others are established. The correctness and completeness of these representations are established. The results presented are needed in the proof of correctness and completeness of algorithms for the generation of mechanical assembly sequences.

Homem De Mello, Luiz S.↗