SEARCH · Engineering Papers

Results for “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 415 records · Page 23

All sources NASA NTRS DOE OSTI

NASA NTRS1939

Combined Beam-column Stresses of Aluminum-alloy Channel Sections

The results of a research program to obtain design data on the strength of open-channel aluminum-alloy sections subjected to combined column and beam action. The results of the tests of about 70 specimens were graphed for stresses due to axial load and stresses due to bending loading as functions of length to radius of gyration of the specimens. From these graphs a design chart was derived that is suitable for ready use.

COLUMNS, ALUMINUM-ALLOY - ALCOA 24ST - STRENGTH↗

NASA NTRS1954

The normal component of the induced velocity in the vicinity of a lifting rotor and some examples of its application

Paper presents a practical method for computing the approximate values of the normal component of the induced velocity at points in the flow field of a lifting rotor. Tables and graphs of the relative magnitudes of the normal component of the induced velocity are given for selected points in the longitudinal plane of symmetry of the rotor and on the lateral rotor axis. A method is also presented for utilizing the tables and graphs to determine the interference induced velocities arising from the second rotor of a tandem or side-by-side-rotor helicopter and the induced flow angle at a horizontal tail plane. (author)

Castles, Walter, R↗

NASA NTRS1939

The Pack Method for Compressive Tests of Thin Specimens of Materials Used in Thin-Wall Structures

The strength of modern lightweight thin-wall structures is generally limited by the strength of the compression members. An adequate design of these members requires a knowledge of the compressive stress-strain graph of the thin-wall material. The "pack" method was developed at the National Bureau of Standards with the support of the National Advisory Committee for Aeronautics to make possible a determination of compressive stress-strain graphs for such material. In the pack test an odd number of specimens are assembled into a relatively stable pack, like a "pack of cards." Additional lateral stability is obtained from lateral supports between the external sheet faces of the pack and outside reactions. The tests seems adequate for many problems in structural research.

Aitchison, C S↗

NASA NTRS1949

Application of Theodorsen's theory to propeller design

A theoretical analysis is presented for obtaining, by use of Theodorsen's propeller theory, the load distribution along a propeller radius to give the optimum propeller efficiency for any design condition. The efficiencies realized by designing for the optimum load distribution are given in graphs, and the optimum efficiency for any design condition may be read directly from the graph without any laborious calculations. Examples are included to illustrate the method of obtaining the optimum load distributions for both single-rotating and dual-rotating propellers.

Crigler, John L↗

NASA NTRS1948

Application of Theodorsen's Theory to Propeller Design

A theoretical analysis is presented for obtaining by use of Theodorsen's propeller theory the load distribution along a propeller radius to give the optimum propeller efficiency for any design condition.The efficiencies realized by designing for the optimum load distribution are given in graphs, and the optimum efficiency for any design condition may be read directly from the graph without any laborious calculations. Examples are included to illustrate the method of obtaining the optimum load distributions for both single-rotating and dual-rotating propellers.

Crigler, John L↗

NASA NTRS1990

On well-partial-order theory and its application to combinatorial problems of VLSI design

We nonconstructively prove the existence of decision algorithms with low-degree polynomial running times for a number of well-studied graph layout, placement, and routing problems. Some were not previously known to be in p at all; others were only known to be in p by way of brute force or dynamic programming formulations with unboundedly high-degree polynomial running times. Our methods include the application of the recent Robertson-Seymour theorems on the well-partial-ordering of graphs under both the minor and immersion orders. We also briefly address the complexity of search versions of these problems.

Fellows, M.↗

NASA NTRS1993

Software reliability through fault-avoidance and fault-tolerance

Strategies and tools for the testing, risk assessment and risk control of dependable software-based systems were developed. Part of this project consists of studies to enable the transfer of technology to industry, for example the risk management techniques for safety-concious systems. Theoretical investigations of Boolean and Relational Operator (BRO) testing strategy were conducted for condition-based testing. The Basic Graph Generation and Analysis tool (BGG) was extended to fully incorporate several variants of the BRO metric. Single- and multi-phase risk, coverage and time-based models are being developed to provide additional theoretical and empirical basis for estimation of the reliability and availability of large, highly dependable software. A model for software process and risk management was developed. The use of cause-effect graphing for software specification and validation was investigated. Lastly, advanced software fault-tolerance models were studied to provide alternatives and improvements in situations where simple software fault-tolerance strategies break down.

Vouk, Mladen A.↗

NASA NTRS1993

Power optimization in logic isomers

Logic isomers are labeled, 2-isomorphic graphs that implement the same logic function. Logic isomers may have significantly different power requirements even though they have the same number of transistors in the implementation. The power requirements of the isomers depend on the transition activity of the input signals. The power requirements of isomorphic graph isomers of n-input NAND and NOR gates are shown. Choosing the less power-consuming isomer instead of the others can yield significant power savings. Experimental results on a ripple-carry adder are presented to show that the implementation using the least power-consuming isomers requires approximately 10 percent less power than the implementation using the most power-consuming isomers. Simulations of other random logic designs also confirm that designs using less power-consuming isomers can reduce the logic power demand by approximately 10 percent as compared to designs using more power-consuming isomers.

Panwar, Ramesh↗

NASA NTRS1993

Experience with parametric binary dissection

Parametric Binary Dissection (PBD) is a new algorithm that can be used for partitioning graphs embedded in 2- or 3-dimensional space. It partitions explicitly on the basis of nodes + (lambda)x(edges cut), where lambda is the ratio of time to communicate over an edge to the time to compute at a node. The new algorithm is faster than the original binary dissection algorithm and attempts to obtain better partitions than the older algorithm, which only takes nodes into account. The performance of parametric dissection with plain binary dissection on 3 large unstructured 3-d meshes obtained from computational fluid dynamics and on 2 random graphs were compared. It was showm that the new algorithm can usually yield partitions that are substantially superior, but that its performance is heavily dependent on the input data.

Bokhari, Shahid H.↗

NASA NTRS1993

Kinetic parameters from thermogravimetric analysis

High performance polymeric materials are finding increased use in aerospace applications. Proposed high speed aircraft will require materials to withstand high temperatures in an oxidative atmosphere for long periods of time. It is essential that accurate estimates be made of the performance of these materials at the given conditions of temperature and time. Temperatures of 350 F (177 C) and times of 60,000 to 100,000 hours are anticipated. In order to survey a large number of high performance polymeric materials on a reasonable time scale, some form of accelerated testing must be performed. A knowledge of the rate of a process can be used to predict the lifetime of that process. Thermogravimetric analysis (TGA) has frequently been used to determine kinetic information for degradation reactions in polymeric materials. Flynn and Wall studied a number of methods for using TGA experiments to determine kinetic information in polymer reactions. Kinetic parameters, such as the apparent activation energy and the frequency factor, can be determined in such experiments. Recently, researchers at the McDonnell Douglas Research Laboratory suggested that a graph of the logarithm of the frequency factor against the apparent activation energy can be used to predict long-term thermo-oxidative stability for polymeric materials. Such a graph has been called a kinetic map. In this study, thermogravimetric analyses were performed in air to study the thermo-oxidative degradation of several high performance polymers and to plot their kinetic parameters on a kinetic map.

Kiefer, Richard L.↗

NASA NTRS1994

Modeling heterogeneous processor scheduling for real time systems

A new model is presented to describe dataflow algorithms implemented in a multiprocessing system. Called the resource/data flow graph (RDFG), the model explicitly represents cyclo-static processor schedules as circuits of processor arcs which reflect the order that processors execute graph nodes. The model also allows the guarantee of meeting hard real-time deadlines. When unfolded, the model identifies statically the processor schedule. The model therefore is useful for determining the throughput and latency of systems with heterogeneous processors. The applicability of the model is demonstrated using a space surveillance algorithm.

Leathrum, J. F.↗

NASA NTRS1994

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic 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. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗

NASA NTRS1994

Array distribution in data-parallel programs

We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.

Chatterjee, Siddhartha↗

NASA NTRS1994

Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations

Basic algorithms for unstructured mesh generation and fluid flow calculation are discussed. In particular the following are addressed: preliminaries of graphs and meshes; duality and data structures; basic graph operations important in CFD (Computational Fluid Dynamics); triangulation methods, including Varonoi diagrams and Delaunay triangulation; maximum principle analysis; finite volume schemes for scalar conservation law equations; finite volume schemes for the Euler and Navier-Stokes equations; and convergence acceleration for steady state calculations.

Barth, T. J.↗

NASA NTRS1994

Burst-by-burst laser frequency monitor

The invention is a system for real-time frequency monitoring and display of an RF burst where the burst frequency is analyzed and displayed on a burst-by-burst basis in order to allow for frequency control. Although the invention was made for monitoring the laser frequency of a LIDAR system, it has other applications where realtime monitoring is required. The novelty of the invention resides in the use of a counter that is reset at the beginning of each unit time of monitoring and then gated for a unit of time. The invention also has an LED bar graph for displaying the measure of frequency at the end of each unit time in either a bar length mode or a moving dot mode. In the latter mode, the operator makes necessary adjustments to maintain the dot at the center of the bar graph.

Esproles, Carlos↗

NASA NTRS1996

Dataflow Design Tool: User's Manual

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Jones, Robert L., III↗

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 NTRS1996

Accelerometer Method and Apparatus for Integral Display and Control Functions

Method and apparatus for detecting mechanical vibrations and outputting a signal in response thereto. Art accelerometer package having integral display and control functions is suitable for mounting upon the machinery to be monitored. Display circuitry provides signals to a bar graph display which may be used to monitor machine conditions over a period of time. Control switches may be set which correspond to elements in the bar graph to provide an alert if vibration signals increase in amplitude over a selected trip point. The circuitry is shock mounted within the accelerometer housing. The method provides for outputting a broadband analog accelerometer signal, integrating this signal to produce a velocity signal, integrating and calibrating the velocity signal before application to a display driver, and selecting a trip point at which a digitally compatible output signal is generated.

Bozeman, Richard J., Jr.↗