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 253 records · Page 14

All sources NASA NTRS DOE OSTI

NASA NTRS2013

Surface Hold Advisor Using Critical Sections

The Surface Hold Advisor Using Critical Sections is a system and method for providing hold advisories to surface controllers to prevent gridlock and resolve crossing and merging conflicts among vehicles traversing a vertex-edge graph representing a surface traffic network on an airport surface. The Advisor performs pair-wise comparisons of current position and projected path of each vehicle with other surface vehicles to detect conflicts, determine critical sections, and provide hold advisories to traffic controllers recommending vehicles stop at entry points to protected zones around identified critical sections. A critical section defines a segment of the vertex-edge graph where vehicles are in crossing or merging or opposite direction gridlock contention. The Advisor detects critical sections without reference to scheduled, projected or required times along assigned vehicle paths, and generates hold advisories to prevent conflicts without requiring network path direction-of-movement rules and without requiring rerouting, rescheduling or other network optimization solutions.

Law, Caleb Hoi Kei↗

NASA NTRS2014

Biometric Subject Verification Based on Electrocardiographic Signals

A method of authenticating or declining to authenticate an asserted identity of a candidate-person. In an enrollment phase, a reference PQRST heart action graph is provided or constructed from information obtained from a plurality of graphs that resemble each other for a known reference person, using a first graph comparison metric. In a verification phase, a candidate-person asserts his/her identity and presents a plurality of his/her heart cycle graphs. If a sufficient number of the candidate-person's measured graphs resemble each other, a representative composite graph is constructed from the candidate-person's graphs and is compared with a composite reference graph, for the person whose identity is asserted, using a second graph comparison metric. When the second metric value lies in a selected range, the candidate-person's assertion of identity is accepted.

Dusan, Sorin V.↗

NASA NTRS1986

Effect of blunt trailing edge on rotor broadband noise

The production of high-frequency broadband noise by turbulent vortex shedding from rotor blades with blunt trailing edges is investigated analytically. The derivation of the governing equations, analogous to that of Kim and George (1982) for boundary-layer/trailing-edge noise, is explained, and numerical results are compared with the experimental data of Hubbard et al. (1981) and Lowson et al. (1972) in graphs. It is shown that vortex-shedding noise is a significant component of blunt-trailing-edge rotor broadband noise and that the analytical method employed gives reasonable predictions. The need for a better empirical expression for the normalized spectrum and for more measurements of surface pressure fluctuations near blunt trailing edges is indicated.

Chou, S.-T.↗

NASA NTRS1987

Isomorphisms between Petri nets and dataflow graphs

Dataflow graphs are a generalized model of computation. Uninterpreted dataflow graphs with nondeterminism resolved via probabilities are shown to be isomorphic to a class of Petri nets known as free choice nets. Petri net analysis methods are readily available in the literature and this result makes those methods accessible to dataflow research. Nevertheless, combinatorial explosion can render Petri net analysis inoperative. Using a previously known technique for decomposing free choice nets into smaller components, it is demonstrated that, in principle, it is possible to determine aspects of the overall behavior from the particular behavior of components.

Kavi, Krishna M.↗

NASA NTRS1989

A new technique in the global reliability of cyclic communications network

The global reliability of a communications network is the probability that given any pair of nodes, there exists a viable path between them. A characterization of connectivity, for a given class of networks, can enable one to find this reliability. Such a characterization is described for a useful class of undirected networks called daisy-chained or braided networks. This leads to a new method of quickly computing the global reliability of these networks. Asymptotic behavior in terms of component reliability is related to geometric properties of the given graph. Generalization of the technique is discussed.

Sjogren, Jon A.↗

NASA NTRS2011

Determining the Optimal Number of Clusters with the Clustergram

Cluster analysis aids research in many different fields, from business to biology to aerospace. It consists of using statistical techniques to group objects in large sets of data into meaningful classes. However, this process of ordering data points presents much uncertainty because it involves several steps, many of which are subject to researcher judgment as well as inconsistencies depending on the specific data type and research goals. These steps include the method used to cluster the data, the variables on which the cluster analysis will be operating, the number of resulting clusters, and parts of the interpretation process. In most cases, the number of clusters must be guessed or estimated before employing the clustering method. Many remedies have been proposed, but none is unassailable and certainly not for all data types. Thus, the aim of current research for better techniques of determining the number of clusters is generally confined to demonstrating that the new technique excels other methods in performance for several disparate data types. Our research makes use of a new cluster-number-determination technique based on the clustergram: a graph that shows how the number of objects in the cluster and the cluster mean (the ordinate) change with the number of clusters (the abscissa). We use the features of the clustergram to make the best determination of the cluster-number.

Fluegemann, Joseph K.↗

NASA NTRS2016

Augmenting Conceptual Design Trajectory Tradespace Exploration with Graph Theory

Within conceptual design changes occur rapidly due to a combination of uncertainty and shifting requirements. To stay relevant in this fluid time, trade studies must also be performed rapidly. In order to drive down analysis time while improving the information gained by these studies, surrogate models can be created to represent the complex output of a tool or tools within a specified tradespace. In order to create this model however, a large amount of data must be collected in a short amount of time. By this method, the historical approach of relying on subject matter experts to generate the data required is schedule infeasible. However, by implementing automation and distributed analysis the required data can be generated in a fraction of the time. Previous work focused on setting up a tool called multiPOST capable of orchestrating many simultaneous runs of an analysis tool assessing these automated analyses utilizing heuristics gleaned from the best practices of current subject matter experts. In this update to the previous work, elements of graph theory are included to further drive down analysis time by leveraging data previously gathered. It is shown to outperform the previous method in both time required, and the quantity and quality of data produced.

Dees, Patrick D.↗

NASA NTRS2016

Augmenting Conceptual Design Trajectory Tradespace Exploration with Graph Theory

Dees, Patrick D.↗

NASA NTRS1984

Aeroacoustics of turbulent shear flows

Recent analytical, numerical-simulation and experimental studies of sound generation by high-Reynolds-number turbulent shear flows are reviewed, with a focus on the application of linear rapid-distortion theory to the calculation of the unsteady flow field producing the sound. This approach is considered the most important alternative to acoustic-analogy methods. Topics surveyed include the linear theory of solid-surface interactions, the jet-noise problem, extensions to more complex turbulent flows, and supersonic flows. Graphs comparing theoretical and experimental results are shown.

Goldstein, M. E.↗

NASA NTRS1988

Instrumentation for gamma-ray astronomy

The current status of gamma-ray-telescope technology for ground, airborne, and space observations is surveyed and illustrated with drawings, diagrams, and graphs and tables of typical data. For the low- and medium-energy ranges, consideration is given to detectors and detector cooling systems, background-rejection methods, radiation damage, large-area detectors, gamma-ray imaging, data analysis, and the Compton-interaction region. Also discussed are the gamma-ray interaction process at high energies; multilevel automated spark-chamber gamma-ray telescopes; the Soviet Gamma-1 telescope; the EGRET instrument for the NASA Gamma-Ray Observatory; and Cerenkov, air-shower, and particle-detector instruments for the TeV and PeV ranges. Significant improvements in resolution and sensitivity are predicted for the near future.

Bertsch, David L.↗

NASA NTRS1979

Flow and Force Equations for a Body Revolving in a Fluid

A general method for finding the steady flow velocity relative to a body in plane curvilinear motion, whence the pressure is found by Bernoulli's energy principle is described. Integration of the pressure supplies basic formulas for the zonal forces and moments on the revolving body. The application of the steady flow method for calculating the velocity and pressure at all points of the flow inside and outside an ellipsoid and some of its limiting forms is presented and graphs those quantities for the latter forms. In some useful cases experimental pressures are plotted for comparison with theoretical. The pressure, and thence the zonal force and moment, on hulls in plane curvilinear flight are calculated. General equations for the resultant fluid forces and moments on trisymmetrical bodies moving through a perfect fluid are derived. Formulas for potential coefficients and inertia coefficients for an ellipsoid and its limiting forms are presented.

Zahm, A. F.↗

NASA NTRS1988

Prediction of oscillating thick cambered aerofoil aerodynamics by a locally analytic method

The effects of mean-flow incidence, airfoil camber, and airfoil thickness on the incompressible aerodynamics of an oscillating airfoil are investigated theoretically, developing and applying a first-order FEM based on locally analytical solutions (LASs). Laplace equations are used to describe the steady and unsteady harmonic velocity potentials; a body-fitted computational grid is employed; grid-element solutions for both potentials are determined using a numerical LAS method; and the LASs are then assembled to obtain a complete solution. Results for a series of flat-plate and Joukowski airfoils are presented in extensive graphs and discussed in detail.

Chiang, Hsiao-Wei D.↗

NASA NTRS2001

The Logic of Reachability

In recent years, Graphplan style reachability analysis and mutual exclusion reasoning have been used in many high performance planning systems. While numerous refinements and extensions have been developed, the basic plan graph structure and reasoning mechanisms used in these systems are tied to the very simple STRIPS model of action. In 1999, Smith and Weld generalized the Graphplan methods for reachability and mutex reasoning to allow actions to have differing durations. However, the representation of actions still has some severe limitations that prevent the use of these techniques for many real-world planning systems. In this paper, we 1) separate the logic of reachability from the particular representation and inference methods used in Graphplan, and 2) extend the notions of reachability and mutual exclusion to more general notions of time and action. As it turns out, the general rules for mutual exclusion reasoning take on a remarkably clean and simple form. However, practical instantiations of them turn out to be messy, and require that we make representation and reasoning choices.

Smith, David E.↗

NASA NTRS1975

Development of ultrasonic methods of hemodynamic measurements

A pulsed ultrasonic Doppler velocity meter which can be used (by modifying transducers) as a flowmeter for blood circulation was experimentally studied. Calculations and profiles of turbulent and laminar flow within blood vessels are shown. Graphs and charts of transducers are included.

Histand, M. B.↗

NASA NTRS1970

Simple data-smoothing and noise-suppression technique

Algorithm, based on the Borel method of summing divergent sequences, is used for smoothing noisy data where knowledge of frequency content is not required. Technique's effectiveness is demonstrated by a series of graphs.

Duty, R. L.↗

NASA NTRS1976

Heat flow anomaly associated with dike intrusion. II

An investigation reported by Horai (1974) is continued. A special case of the steady state temperature field associated with dike intrusion is studied, taking into account an infinite vertical downward extension of the isotherm of rectangular shape approximating the dike. The considered case represents a problem of two-dimensional steady state thermal conduction. The technique of conformal mapping used is identical to the method employed by Horai (1974). The characteristics of surface heat flow associated with an infinitesimal thin dike of certain temperature with the considered extension are shown in a graph.

Horai, K.-I.↗

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 NTRS1994

A new test method for the assessment of the arc tracking properties of wire insulation in air, oxygen enriched atmospheres and vacuum

Development of a new test method suitable for the assessment of the resistance of aerospace cables to arc tracking for different specific environmental and network conditions of spacecraft is given in view-graph format. The equipment can be easily adapted for tests at different realistic electrical network conditions incorporating circuit protection and the test system works equally well whatever the test atmosphere. Test results confirm that pure Kapton insulated wire has bad arcing characteristics and ETFE insulated wire is considerably better in air. For certain wires, arc tracking effects are increased at higher oxygen concentrations and significantly increased under vacuum. All tests on different cable insulation materials and in different environments, including enriched oxygen atmospheres, resulted in a more or less rapid extinguishing of all high temperature effects at the beginning of the post-test phase. In no case was a self-maintained fire initiated by the arc.

Koenig, Dieter↗