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.

SourceResearch connectionFrom yearThrough year

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

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

NASA NTRS2003

A Graph Based Backtracking Algorithm for Solving General CSPs

Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.

Pang, Wanlin↗

NASA NTRS1988

Overview and extensions of a system for routing directed graphs on SIMD architectures

Many problems can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from adjacent vertices. A method is given for parallelizing such problems on an SIMD machine model that uses only nearest neighbor connections for communication, and has no facility for local indirect addressing. Each vertex of the graph will be assigned to a processor in the machine. Rules for a labeling are introduced that support the use of a simple algorithm for movement of data along the edges of the graph. Additional algorithms are defined for addition and deletion of edges. Modifying or adding a new edge takes the same time as parallel traversal. This combination of architecture and algorithms defines a system that is relatively simple to build and can do fast graph processing. All edges can be traversed in parallel in time O(T), where T is empirically proportional to the average path length in the embedding times the average degree of the graph. Additionally, researchers present an extension to the above method which allows for enhanced performance by allowing some broadcasting capabilities.

Tomboulian, Sherryl↗

NASA NTRS1985

Unsteady aerodynamic characterization of a military aircraft in vertical gusts

The effects of 2.5-m/sec vertical gusts on the flight characteristics of a 1:8.6 scale model of a Mirage 2000 aircraft in free flight at 35 m/sec over a distance of 30 m are investigated. The wind-tunnel setup and instrumentation are described; the impulse-response and local-coefficient-identification analysis methods applied are discussed in detail; and the modification and calibration of the gust-detection probes are reviewed. The results are presented in graphs, and good general agreement is obtained between model calculations using the two analysis methods and the experimental measurements.

Lebozec, A.↗

NASA NTRS1979

Performance evaluation of a liquid solar collector

Report describes thermal performance and structural-load tests on commercial single glazed flat-plate solar collector with gross area of 63.5 sq ft that uses water as heat-transfer medium. Report documents test instrumentation and procedures and presents data as tables and graphs. Results are analyzed by standard data-reduction methods.

Source record↗

NASA NTRS1984

Development of acceptance criteria for batches of silane primer for external tank thermal protection system bonding applications

Silane primers for use as thermal protection on external tanks were subjected to various analytic techniques to determine the most effective testing method for silane lot evaluation. The analytic methods included high performance liquid chromatography, gas chromatography, thermogravimetry (TGA), and fourier transform infrared spectroscopy (FTIR). It is suggested that FTIR be used as the method for silane lot evaluation. Chromatograms, TGA profiles, bar graphs showing IR absorbances, and FTIR spectra are presented.

Mikes, F.↗

NASA NTRS1986

Universal amplitude ratios and the interfacial tension near consolute points of binary liquid mixtures

The interfacial tension of the binary liquid mixtures triethylamine/heavy water, triethylamine/water, and cyclohexane/methanol near their consolute temperatures is determined experimentally by measuring the densities of the phases and the capillary lengths. The results are presented in tables and graphs and compared with published data obtained by other methods and with theoretical predictions. The findings are shown to be in good agreement with previous experiments, confirming the discrepancy between temperature-independent universal amplitude ratios calculated from such data and those predicted by renormalization-group calculations or Monte Carlo simulations of Ising models.

Moldover, M. R.↗

NASA NTRS1987

The role of damage-softened material behavior in the fracture of composites and adhesives

The failure mechanism of polymer composites and adhesives with high strain in the zone near and ahead of the crack tip is investigated analytically, summarizing the findings of Ungsuwarungsri (1986). A double-cantilever-beam specimen with the nonlinear material confined to a thin strip between two wedge-loaded elastic beams is modeled as a beam on a nonlinear foundation; the two-point boundary-value problem for stationary and propagating cracks is solved numerically; and an FEM approach is applied to study the behavior of the nonlinear strip in detail. Typical results are presented in extensive graphs, and the accuracy and efficiency of the present method are shown to be superior to those of the Berry (1963) procedure.

Ungsuwarungsri, T.↗

NASA NTRS1988

Transonic unsteady aerodynamic and aeroelastic calculations about airfoils and wings

Recent advances in the numerical simulation of unsteady transonic flow around airfoils and wings are surveyed, with an emphasis on the treatment of aeroelastic effects. The fundamental physical principles involved are discussed, and the numerical implementation of the methods is considered. Typical results are presented in extensive graphs and diagrams and briefly characterized, with reference to experimental data.

Goorjian, Peter M.↗

NASA NTRS1990

Bipolar supernova remnants and the obliquity dependence of shock acceleration

The diffusive shock acceleration mechanism proposed to explain the bipolarity observed in the synchrotron radio emission of young adiabatically expanding shell SNRs is investigated by means of numerical simulations. The theoretical basis of the SNR models and the numerical computation methods are explained, and the results are presented in graphs and synthetic radio maps and discussed in detail. It is found that the efficiency of the acceleration process depends on the obliquity angle theta(Bn) between the shock normal and the uniform magnetic field: models with theta(Bn) of about 90 deg can reproduce the observed azimuthal intensity ratios in most cases, but models with theta(Bn) near 0 deg cannot.

Fulbright, Michael S.↗

NASA NTRS1991

Translating expert system rules into Ada code with validation and verification

The purpose of this ongoing research and development program is to develop software tools which enable the rapid development, upgrading, and maintenance of embedded real-time artificial intelligence systems. The goals of this phase of the research were to investigate the feasibility of developing software tools which automatically translate expert system rules into Ada code and develop methods for performing validation and verification testing of the resultant expert system. A prototype system was demonstrated which automatically translated rules from an Air Force expert system was demonstrated which detected errors in the execution of the resultant system. The method and prototype tools for converting AI representations into Ada code by converting the rules into Ada code modules and then linking them with an Activation Framework based run-time environment to form an executable load module are discussed. This method is based upon the use of Evidence Flow Graphs which are a data flow representation for intelligent systems. The development of prototype test generation and evaluation software which was used to test the resultant code is discussed. This testing was performed automatically using Monte-Carlo techniques based upon a constraint based description of the required performance for the system.

Becker, Lee↗

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 NTRS1985

Soil Surveys

An accurate method of surveying the soil was developed by NASA and the Department of Agriculture. The method involves using ground penetrating radar to produce subsurface graphs. By examining printouts from the system's recorder, scientists can determine whether a site is appropriate for building, etc.

Source record↗

NASA NTRS2009

A Comparison of Risk Sensitive Path Planning Methods for Aircraft Emergency Landing

Determining the best site to land a damaged aircraft presents some interesting challenges for standard path planning techniques. There are multiple possible locations to consider, the space is 3-dimensional with dynamics, the criteria for a good path is determined by overall risk rather than distance or time, and optimization really matters, since an improved path corresponds to greater expected survival rate. We have investigated a number of different path planning methods for solving this problem, including cell decomposition, visibility graphs, probabilistic road maps (PRMs), and local search techniques. In their pure form, none of these techniques have proven to be entirely satisfactory - some are too slow or unpredictable, some produce highly non-optimal paths or do not find certain types of paths, and some do not cope well with the dynamic constraints when controllability is limited. In the end, we are converging towards a hybrid technique that involves seeding a roadmap with a layered visibility graph, using PRM to extend that roadmap, and using local search to further optimize the resulting paths. We describe the techniques we have investigated, report on our experiments with these techniques, and discuss when and why various techniques were unsatisfactory.

Meuleau, Nicolas↗

NASA NTRS2018

PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs

Phase unwrapping is a key problem in many coherent imaging systems, such as syntheticapertureradar(SAR)interferometry. Ageneralformulationforredundant integration of ﬁnite differences for phase unwrapping (Costantini et al., 2010) was shown to produce a more reliable solution by exploiting redundant differential estimates. However, this technique requires a commercial linear programming solver for large-scale problems. For a linear cost function, we propose a method based on Dual Decomposition that breaks the given problem deﬁned over a nonplanar graph into tractable sub-problems over planar subgraphs. We also propose a decomposition technique that exploits the underlying graph structure for solving thesub-problemsefﬁcientlyandguaranteesasymptoticconvergencetotheglobally optimal solution. The experimental results demonstrate that the proposed approach is comparable to the existing state-of-the-art methods in terms of the estimate with a better runtime and memory footprint.

Lanka, Ravi↗

NASA NTRS1990

A nonrecursive order N preconditioned conjugate gradient: Range space formulation of MDOF dynamics

While excellent progress has been made in deriving algorithms that are efficient for certain combinations of system topologies and concurrent multiprocessing hardware, several issues must be resolved to incorporate transient simulation in the control design process for large space structures. Specifically, strategies must be developed that are applicable to systems with numerous degrees of freedom. In addition, the algorithms must have a growth potential in that they must also be amenable to implementation on forthcoming parallel system architectures. For mechanical system simulation, this fact implies that algorithms are required that induce parallelism on a fine scale, suitable for the emerging class of highly parallel processors; and transient simulation methods must be automatically load balancing for a wider collection of system topologies and hardware configurations. These problems are addressed by employing a combination range space/preconditioned conjugate gradient formulation of multi-degree-of-freedom dynamics. The method described has several advantages. In a sequential computing environment, the method has the features that: by employing regular ordering of the system connectivity graph, an extremely efficient preconditioner can be derived from the 'range space metric', as opposed to the system coefficient matrix; because of the effectiveness of the preconditioner, preliminary studies indicate that the method can achieve performance rates that depend linearly upon the number of substructures, hence the title 'Order N'; and the method is non-assembling. Furthermore, the approach is promising as a potential parallel processing algorithm in that the method exhibits a fine parallel granularity suitable for a wide collection of combinations of physical system topologies/computer architectures; and the method is easily load balanced among processors, and does not rely upon system topology to induce parallelism.

Kurdila, Andrew J.↗

NASA NTRS1988

Implications of truncating semi-infinite physical domains on the accuracy of the solutions to the N-S equations

Numerical techniques for solving the Navier-Stokes equations of laminar incompressible flow over a forward-facing step on a semiinfinite flat plate are evaluated analytically and by means of sample computations. A primitive-variable method with pseudocompressibility and full mapping of the semiinfinite domain is compared with a vorticity/stream-function method with a truncated domain, applying a flux-corrected explicit finite-difference procedure to solve the discretized transport equations. The results are presented in graphs and compared with published experimental data. The solutions obtained with the truncated-domain methods are shown to be inaccurate, even in cases when they are smooth.

Dekruif, Jeffery S.↗

NASA NTRS1989

A finite-element method for large-amplitude, two-dimensional panel flutter at hypersonic speeds

The nonlinear flutter behavior of a two-dimensional panel in hypersonic flow is investigated analytically. An FEM formulation based unsteady third-order piston theory (Ashley and Zartarian, 1956; McIntosh, 1970) and taking nonlinear structural and aerodynamic phenomena into account is derived; the solution procedure is outlined; and typical results are presented in extensive tables and graphs. A 12-element finite-element solution obtained using an alternative method for linearizing the assumed limit-cycle time function is shown to give predictions in good agreement with classical analytical results for large-amplitude vibration in a vacuum and large-amplitude panel flutter, using linear aerodynamics.

Mei, Chuh↗

NASA NTRS1991

A graph theoretic approach to scene matching

The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

Ranganath, Heggere S.↗