Search NASA⌕ Search

SEARCH · Search NASA

Results for “FLOW 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Thrust Augmentation Measurements for a Pulse Detonation Engine Driven Ejector

Thrust augmentation results of an ongoing study of pulse detonation engine driven ejectors are presented and discussed. The experiments were conducted using a pulse detonation engine (PDE) setup with various ejector configurations. The PDE used in these experiments utilizes ethylene (C2H4) as the fuel, and an equi-molar mixture of oxygen and nitrogen as the oxidizer at an equivalence ratio of one. High fidelity thrust measurements were made using an integrated spring damper system. The baseline thrust of the PDE engine was first measured and agrees with experimental and modeling results found in the literature. Thrust augmentation measurements were then made for constant diameter ejectors. The parameter space for the study included ejector length, PDE tube exit to ejector tube inlet overlap distance, and straight versus rounded ejector inlets. The relationship between the thrust augmentation results and various physical phenomena is described. To further understand the flow dynamics, shadow graph images of the exiting shock wave front from the PDE were also made. For the studied parameter space, the results showed a maximum augmentation of 40%. Further increase in augmentation is possible if the geometry of the ejector is tailored, a topic currently studied by numerous groups in the field.

Pal, S.↗
NASA NTRS1987

Prospects for Eulerian CFD analysis of helicopter vortex flows

The applicability of current finite-volume CFD algorithms based on the Euler equations to the vortex flow over a helicopter in forward flight is investigated analytically. The general characteristics of the flow are reviewed; existing Euler, Navier-Stokes, perturbation, high-order, and adaptive methods are briefly characterized; and a novel Eulerian/Lagrangian approach with entropy and vorticity corrections is presented in detail. Numerical results for simple convection of a finite-core Lamb vortex moving downstream with its axis perpendicular to the flow are presented in graphs, and the possibility of extending the method to three-dimensional, viscous, and shock flows is discussed.

Drela, Mark↗
NASA NTRS1992

Approximation methods for stochastic petri nets

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Jungnitz, Hauke Joerg↗
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 NTRS1994

A simple hyperbolic model for communication in parallel processing environments

We introduce a model for communication costs in parallel processing environments called the 'hyperbolic model,' which generalizes two-parameter dedicated-link models in an analytically simple way. Dedicated interprocessor links parameterized by a latency and a transfer rate that are independent of load are assumed by many existing communication models; such models are unrealistic for workstation networks. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes that initiate the sending and receiving of the information and in which internal nodes, called communication blocks (CBs), reflect the layered structure of the underlying communication architecture. The direction of graph edges specifies the flow of the information carried through messages. Each CB is characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. The parameters are evaluated in the limits of very large and very small messages. Rules are given for reducing a communication graph consisting of many to an equivalent two-parameter form, while maintaining an approximation for the service time that is exact in both large and small limits. The model is validated on a dedicated Ethernet network of workstations by experiments with communication subprograms arising in scientific applications, for which a tight fit of the model predictions with actual measurements of the communication and synchronization time between end processes is demonstrated. The model is then used to evaluate the performance of two simple parallel scientific applications from partial differential equations: domain decomposition and time-parallel multigrid. In an appropriate limit, we also show the compatibility of the hyperbolic model with the recently proposed LogP model.

Stoica, Ion↗
NASA NTRS1970

Simplified computation of compressible fluid flow parameters

Mathematical techniques analyze fluid flow through circular duct, enlarged or constricted circular duct, and across an orifice or nozzle. Using subsonic Mach number as basic flow parameter, a series of working graphs displays the variation of various physical parameters in each of the flow conditions.

Beimgraben, H. W.↗
NASA NTRS1985

Accelerated stress testing of amorphous silicon solar cells

A technique for performing accelerated stress tests of large-area thin a-Si solar cells is presented. A computer-controlled short-interval test system employing low-cost ac-powered ELH illumination and a simulated a-Si reference cell (seven individually bandpass-filtered zero-biased crystalline PIN photodiodes) calibrated to the response of an a-Si control cell is described and illustrated with flow diagrams, drawings, and graphs. Preliminary results indicate that while most tests of a program developed for c-Si cells are applicable to a-Si cells, spurious degradation may appear in a-Si cells tested at temperatures above 130 C.

Stoddard, W. G.↗
NASA NTRS2010

BGen: A UML Behavior Network Generator Tool

BGen software was designed for autogeneration of code based on a graphical representation of a behavior network used for controlling automatic vehicles. A common format used for describing a behavior network, such as that used in the JPL-developed behavior-based control system, CARACaS ["Control Architecture for Robotic Agent Command and Sensing" (NPO-43635), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 40] includes a graph with sensory inputs flowing through the behaviors in order to generate the signals for the actuators that drive and steer the vehicle. A computer program to translate Unified Modeling Language (UML) Freeform Implementation Diagrams into a legacy C implementation of Behavior Network has been developed in order to simplify the development of C-code for behavior-based control systems. UML is a popular standard developed by the Object Management Group (OMG) to model software architectures graphically. The C implementation of a Behavior Network is functioning as a decision tree.

Huntsberger, Terry↗
NASA NTRSDate not supplied

Towards Sheaf Theoretic Analyses for Delay Tolerant Networking

The goal of Delay Tolerant Networking (DTN) is to take a collection of heterogeneous, disparate connections between satellites, space assets, ground stations, and ground infrastructure and bring it together into a cohesive, functioning overlay network. Depending on the systems being considered, one can find links with a one-way light time exceeding minutes (and hours),periodic links which can sometimes be predicted by orbital mechanics, and restrictions based on the variety of capabilities built into these systems. These characteristics preclude traditional network models and routing techniques and have classically led to either rigid routing tables or purely probabilistic models. As the deeper underlying structures remain unknown, development of more DTN-optimized algorithms has lacked the necessary foundation. In a continuation of previous work, the goal of this paper is to identify and study these fundamental structures that exist in delay tolerant networks (DTN), with a focus on space networks. The current routing methodology has been to use contact graph routing (CGR) algorithms. CGR models a series of known contacts as a static graph. For CGR to work, this graph must be globally consistent and must have an accurate picture of the network. Because this is a globally controlled structure, there is little room for flexibility in the event of changes to the network which would naturally occur as the network grows. As a response to the desire for flexibility as the network changes, we introduced the mathematical structure known as sheaves to DTNs last year. The tag-line for sheaves is that they are a mathematically precise way of gluing local data together into unique global data. Thus, sheaves lend extra power to traditional models(and routing algorithms) by taking additional information and merging it, in as consistent a manner as possible, with the representation itself. The clearest example of how Earth-bound networks exhibit behavior that is “sheafy” is link state routers, which build a local-to-global picture of their network by gluing local information together into a global network, exactly as a sheaf would do. For routing within delay tolerant networks to truly exploit this structure, a deeper structure than a graph is required. In this paper, we develop sheaves that can work over directed graphs such as temporal flow networks, we construct a sheaf representation for Dijkstra’s algorithm, and we outline a construction for routing sheaves capable of modeling multicast scenarios. Finally, there is a section of future work suggesting follow-on research.

Robert Short↗
NASA NTRS1986

An optimization model for the US Air-Traffic System

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Mulvey, J. M.↗
NASA NTRS1989

Advances in the computation of transonic separated flows over finite wings

Problems encountered in numerical simulations of transonic wind-tunnel experiments with low-aspect-ratio wings are surveyed and illustrated. The focus is on the zonal Euler/Navier-Stokes program developed by Holst et al. (1985) and its application to shock-induced separation. The physical basis and numerical implementation of the method are reviewed, and results are presented from studies of the effects of artificial dissipation, boundary conditions, grid refinement, the turbulence model, and geometry representation on the simulation accuracy. Extensive graphs and diagrams and typical flow visualizations are provided.

Kaynak, Unver↗
NASA NTRS1996

Computational and Experimental Efforts in Gravity Probe B Microthruster Analysis

Gravity Probe B, an experiment to test the theory of relativity, will be launched near the turn of the millennium. Due to the precise pointing requirements need to successfully carry out this experiment, the satellite will use sixteen proportionally controlled microthrusters as a main component of the attitude control system. These microthrusters use the helium boil-off from the on-board dewar as propellant. Marshall Space Flight Center, verified the design of the thruster flow path by both computational and experimental methods. The flow performance of the thruster has been adequately characterized. Graphs show specific impulse, thrust coefficient, discharge coefficient, and mass flow rate trends. Value was added to the program through gained confidence in the design of the thruster and through valuation of some design trade-offs.

Droege, Alan↗
NASA NTRS1988

Element-by-element and implicit-explicit finite element formulations for computational fluid dynamics

Preconditioner algorithms to reduce the computational effort in FEM analyses of large-scale fluid-dynamics problems are presented. A general model problem is constructed on the basis of the convection-diffusion equation and the two-dimensional vorticity/stream-function formulation of the Navier-Stokes equations; this problem is then analyzed using element-by-element, implicit-explicit, and adaptive implicit-explicit approximation schemes. Numerical results for the two-dimensional advection and rigid-body rotation of a cosine hill, flow past a circular cylinder, and driven cavity flow are presented in extensive graphs and shown to be in good agreement with those obtained using implicit methods.

Tezduyar, T. E.↗
NASA NTRS1973

Heat flow experiment

The heat flow experiment conducted during the Apollo 17 flight in the Taurus-Littrow area of the moon is discussed. The concept of the experiment is based on the direct measurement of the vertical flow of heat through the regolith. The measurement is made far enough below the surface so that the time-varying heat flow resulting from the very large diurnal variations of the surface temperature is small as compared with the flow from the interior. The equipment used for the experiment is described and illustrated. Graphs are developed to present the results of heat flow and surface temperature measurements.

Langseth, M. G., Jr.↗
NASA NTRS1993

Equations For Elastohydrodynamic Lubrication Of Bearings

Equation for thickness of elastohydrodynamic (EHD) lubricant film in rolling-element bearing reduced to simplified form involving only inside and outside diameters of bearing, speed of rotation, parameter related to type of lubricant, and viscosity of lubricant at temperature of bearing. In addition, experimentally derived graph of EHD-film-thickness-reduction factor as function of contact-lubricant-flow number. Accounts for lubricant starvation within Hertzian contact. Graph relating ratio of minimum film thickness to composite roughness of bearing surfaces and to lubrication-life correction factor also provided. Life-correction factor used to determine resultant life of bearing.

Zaretsky, Erwin V.↗
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 NTRS1987

High power lasers: Sources, laser-material interactions, high excitations, and fast dynamics in laser processing and industrial applications; Proceedings of the Meeting, The Hague, Netherlands, Mar. 31-Apr. 3, 1987

The design and operation of high-power lasers for industrial applications are discussed in reviews and reports. Topics addressed include the status of optical technology in the Netherlands, laser design, the deposition of optical energy, laser diagnostics, nonmetal processing, and energy coupling and plasma formation. Consideration is given to laser-induced damage to materials, fluid and gas flow dynamics, metal processing, and manufacturing. Graphs, diagrams, micrographs, and photographs are provided.

Kreutz, E. W.↗