Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “difference 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.

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

At least 217 records · Page 12
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 NTRS1989

Solar particle composition, spectra, and frequency of occurrence

The astrophysical mechanisms involved in solar particle events (SPEs) and the effects of SPEs on the equipment and crews of space missions in earth orbit are reviewed. The major features of class I (radio type III and V) and class II (radio type II and IV) SPEs are summarized; the relative abundances of electrons, protons, and heavier particles in the two SPE classes are discussed; and published observational data showing the contributions of different SPE particle populations to the background radiation are presented in graphs.

Reames, D. V.↗
NASA NTRS1961

The Use of Higher-Order Difference Methods in Beam Vibration Analysis

Simple and higher-order difference methods for the solution for the natural frequencies of vibration of a uniform beam are compared. The same basic higher-order method is used throughout for the interior cells, but three different methods of boundary-condition representation are given. Tables and graphs of the error in mode frequencies, as compared with a continuous beam, are given for the various methods as a function of the number of cells. It is concluded that higher-order methods improve accuracy for a given number of cells, with essentially no change in the quantity of computing equipment required.

Greenwood, Donald T.↗
NASA NTRS2003

Optimal Battery Charging for Damage Mitigation

Our control philosophy is to charge the NiH2 cell in such a way that the damage incurred during the charging period is minimized, thus extending its cycle life. This requires nonlinear dynamic model of NiH2 cell and a damage rate model. We must do this first. This control philosophy is generally considered damage mitigating control or life-extending control. This presentation covers how NiH2 cells function, electrode behavior, an essentialized model, damage mechanisms for NiH2 batteries, battery continuum damage modeling, and battery life models. The presentation includes graphs and a chart illustrating how charging a NiH2 battery with different voltages and currents affects damages the battery and affects its life. The presentation concludes with diagrams of control system architectures for tracking battery recharging.

Hartley, Tom T.↗
NASA NTRS2004

Network Theory: A Primer and Questions for Air Transportation Systems Applications

A new understanding (with potential applications to air transportation systems) has emerged in the past five years in the scientific field of networks. This development emerges in large part because we now have a new laboratory for developing theories about complex networks: The Internet. The premise of this new understanding is that most complex networks of interest, both of nature and of human contrivance, exhibit a fundamentally different behavior than thought for over two hundred years under classical graph theory. Classical theory held that networks exhibited random behavior, characterized by normal, (e.g., Gaussian or Poisson) degree distributions of the connectivity between nodes by links. The new understanding turns this idea on its head: networks of interest exhibit scale-free (or small world) degree distributions of connectivity, characterized by power law distributions. The implications of scale-free behavior for air transportation systems include the potential that some behaviors of complex system architectures might be analyzed through relatively simple approximations of local elements of the system. For air transportation applications, this presentation proposes a framework for constructing topologies (architectures) that represent the relationships between mobility, flight operations, aircraft requirements, and airspace capacity, and the related externalities in airspace procedures and architectures. The proposed architectures or topologies may serve as a framework for posing comparative and combinative analyses of performance, cost, security, environmental, and related metrics.

Holmes, Bruce J.↗
DOE OSTI2025

Application-level benchmarking of quantum computers using nonlocal game strategies

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise.

nonlocal games↗
DOE OSTI2021

A variant selection framework for genome graphs

Abstract Motivation Variation graph representations are projected to either replace or supplement conventional single genome references due to their ability to capture population genetic diversity and reduce reference bias. Vast catalogues of genetic variants for many species now exist, and it is natural to ask which among these are crucial to circumvent reference bias during read mapping. Results In this work, we propose a novel mathematical framework for variant selection, by casting it in terms of minimizing variation graph size subject to preserving paths of length α with at most δ differences. This framework leads to a rich set of problems based on the types of variants [e.g. single nucleotide polymorphisms (SNPs), indels or structural variants (SVs)], and whether the goal is to minimize the number of positions at which variants are listed or to minimize the total number of variants listed. We classify the computational complexity of these problems and provide efficient algorithms along with their software implementation when feasible. We empirically evaluate the magnitude of graph reduction achieved in human chromosome variation graphs using multiple α and δ parameter values corresponding to short and long-read resequencing characteristics. When our algorithm is run with parameter settings amenable to long-read mapping (α = 10 kbp, δ = 1000), 99.99% SNPs and 73% SVs can be safely excluded from human chromosome 1 variation graph. The graph size reduction can benefit downstream pan-genome analysis. Availability and implementation https://github.com/AT-CG/VF. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Equivariant graph convolutional neural networks for the representation of homogenized anisotropic microstructural mechanical response

Composite materials with different microstructural material symmetries are common in engineering applications where grain structure, alloying and particle/fiber packing are optimized via controlled manufacturing. In fact these microstructural tunings can be done throughout a part to achieve functional gradation and optimization at a structural level. To predict the performance of particular microstructural configuration and thereby overall performance, constitutive models of materials with microstructure are needed. In this work we provide neural network architectures that provide effective homogenization models of materials with anisotropic components. These models satisfy equivariance and material symmetry principles inherently through a combination of equivariant and tensor basis operations. We demonstrate them on datasets of stochastic volume elements with different textures and phases where the material undergoes elastic and plastic deformation, and show that the these network architectures provide significant performance improvements.

anisotropy↗
NASA NTRS1989

Automatic determination of fault effects on aircraft functionality

The problem of determining the behavior of physical systems subsequent to the occurrence of malfunctions is discussed. It is established that while it was reasonable to assume that the most important fault behavior modes of primitive components and simple subsystems could be known and predicted, interactions within composite systems reached levels of complexity that precluded the use of traditional rule-based expert system techniques. Reasoning from first principles, i.e., on the basis of causal models of the physical system, was required. The first question that arises is, of course, how the causal information required for such reasoning should be represented. The bond graphs presented here occupy a position intermediate between qualitative and quantitative models, allowing the automatic derivation of Kuipers-like qualitative constraint models as well as state equations. Their most salient feature, however, is that entities corresponding to components and interactions in the physical system are explicitly represented in the bond graph model, thus permitting systematic model updates to reflect malfunctions. Researchers show how this is done, as well as presenting a number of techniques for obtaining qualitative information from the state equations derivable from bond graph models. One insight is the fact that one of the most important advantages of the bond graph ontology is the highly systematic approach to model construction it imposes on the modeler, who is forced to classify the relevant physical entities into a small number of categories, and to look for two highly specific types of interactions among them. The systematic nature of bond graph model construction facilitates the process to the point where the guidelines are sufficiently specific to be followed by modelers who are not domain experts. As a result, models of a given system constructed by different modelers will have extensive similarities. Researchers conclude by pointing out that the ease of updating bond graph models to reflect malfunctions is a manifestation of the systematic nature of bond graph construction, and the regularity of the relationship between bond graph models and physical reality.

Feyock, Stefan↗
DOE OSTI2025

Graph Neural Networks for Surrogate Modeling of Offshore Floating Platforms

Floating offshore wind turbines (FOWTs) present an significant opportunity to increase renewable energy generation. However, significant challenges remain before FOWTs can be widely commercialized and deployed. In particular, hydrodynamic loading on the platforms can stress the overall structure, damage the mooring systems, and impact power generation. Studying these loads is difficult and often relies on computationally expensive models or experiments. In this work, we explore the use of graph neural networks (GNNs) to construct flexible, data-driven surrogates for hydrodynamic loads on platforms. We leverage the natural graph-like structure of offshore wind platform designs to enable the GNN model to learn to approximate the loads for different wave conditions and structural designs. We demonstrate potential uses for the surrogate by performing parameter sweeps and ridge analysis on the trained model to identify the impacts of different wave and structural features on the loads.

floating offshore wind turbines↗
DOE OSTI2022

Network-Level Traffic Signal Cooperation: A Higher-Order Conflict Graph Approach

Traffic signal control and cooperation are extremely important to alleviate traffic congestion in a large traffic network. This study develops a higher-order conflict graph approach for network-wide traffic signal control and cooperation. A conflict graph is applied to model the traffic signal configurations, which identifies the conflict and unconflicted movements for each intersection. In conflict graph, the node represents each movement. The weight of each node can be defined as traffic volume, queue length, fuel consumption, or any weighted combinations of these measurements. The calculation of the optimal green light duration and green light sequence (for different movements) is equivalent to sequentially finding the maximum weight independent set (MWIS) in the conflict graph. The conflict graph also provides a uniform and efficient way to connect traffic signal operations among nearby intersections spatially. Then, we introduced the concept of the k -th order neighborhood to model the degree of connectivity between each movement to the movements at upstream or downstream intersections. The weight of each node in the higher-order conflict graph not only represents its own congestion level, but also relates to the traffic conditions of nearby intersections. Through this approach, the cooperation of multiple intersections can be realized by incorporating their spatial connectivity into conflict graph and solving the MWIS problem. A simulation network is built in SUMO to test the effectiveness of the proposed method. Results suggested that the proposed model outperformed other state-of-the-art signal control methods. Also, the scheme maintains good performance under varying traffic demands.

42 ENGINEERING↗
DOE OSTI2023

User Manual - HydraGNN: Distributed PyTorch Implementation of Multi-Headed Graph Convolutional Neural Networks

This document serves as user manual for HydraGNN, a scalable graph neural network (GNN) architecture that allows for a simultaneous prediction of multiple target properties using multi-task learning (MTL). The HydraGNN architecture is constructed by successive superposition of three different sets of layers. The first set is made of message-passing layers to exchange information across nodes in the graph and use this to update the nodal features. The second set is made of global pooling layers that aggregate information from all the nodes in the graph and map it into a scalar, and is needed only for global target properties that are related to the entire graph. The third set of layers is dedicated to the implementation of MTL, which is enabled by forking of the architecture into separate heads, each one of them dedicated to the predictive task of one specific target property. Through an object-oriented programming paradigm, HydraGNN is templated over different message-passing policies, which allows for a user-friendly hyperparameter study to assess the sensitivity of the predictive performance of the HydraGNN architecture on a specific dataset with respect to the choice of the message-passing policy. The object-oriented paradigm used by HydraGNN also allows for a user-friendly inclusion of newly developed message passing policies within the existing framework. HydraGNN supports distributed computing capabilities for scalable data reading and scalable training on leadership-class supercomputers.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

Data Link Performance Analysis for LVLASO Experiments

Low-visibility Landing and Surface Operations System (LVLASO) is currently being prototyped and tested at NASA Langley Research Center. Since the main objective of the system is to maintain the aircraft landings and take-offs even during low-visibility conditions, timely exchange of positional and other information between the aircraft and the ground control is critical. For safety and reliability reasons, there are several redundant sources on the ground (e.g., ASDE, AMASS) that collect and disseminate information about the environment to the aircrafts. The data link subsystem of LVLASO is responsible for supporting the timely transfer of information between the aircrafts and the ground controllers. In fact, if not properly designed, the data link subsystem could become a bottleneck in the proper functioning of LVLASO. Currently, the other components of the system are being designed assuming that the data link has adequate capacity and is capable of delivering the information in a timely manner. During August 1-28, 1997, several flight experiments were conducted to test the prototypes of subsystems developed under LVLASO project, The back-round and details of the tests are described in the next section. The test results have been collected in two CDs by FAA and Rockwell-Collins. Under the current grant, we have analyzed the data and evaluated the performance of the Mode S datalink. In this report, we summarize the results of our analysis. Much of the results are shown in terms of graphs or histograms. The test date (or experiment number) was often taken as the X-axis and the Y-axis denotes whatever metric of focus in that chart. In interpreting these charts, one need to take into account the vehicular traffic during a particular experiment. In general, the performance of the data link was found to be quite satisfactory in terms of delivering long and short Mode S squitters from the vehicles to the ground receiver, Similarly, its performance in delivering control messages from the ground control to the vehicles (aircrafts) was also satisfactory. The report is organized as follows. In Section 2, we describe the background information for the LVLASO and the system flight experiments. Section 3 contains formats of the performance data that was analyzed during our research. Section 4 describes different experiments flight experiments and their setup. Section 5 analyzes each of the graphs produced in this report. Finally, Section 6 has a summary of observations that we make based on our research.

Mukkamala, Ravi↗
NASA NTRS1994

Separated and Recovering Turbulent Boundary Layer Flow Behind a Backward Facing Step For Different Reynolds Numbers

Experimental results for a two-dimensional separated turbulent boundary layer behind a backward facing step for five different Reynolds numbers are reported. Results are presented in the form of tables, graphs and a floppy disk for an easy access of the data. Reynolds number based on the step height was varied by changing the reference velocity upstream of the step, U(sub o), and the step height, h. Hot-wire measurement techniques were used to measure three Reynolds stresses and four triple-velocity correlations. In addition, surface pressure and skin friction coefficients were measured. All hot-wire measurements were acquired in a measuring domain which excluded recirculating flow region due to the directional insensitivity of hot-wires. The downstream extent of the domain from the step was 51 h for the largest and I 14h for the smallest step height. This significant downstream length permitted extensive study of the flow recovery. Prediction of perturbed flows and their recovery is particularly attractive for popular turbulence models since variations of turbulence length and time scales and flow interactions in different regions are generally inadequately predicted. The data indicate that the flow in the free shear layer region behaves like the plane mixing layer up to about 2/3 of the mean reattachment length when the flow interaction with the wall commences the flow recovery to that of an ordinary turbulent boundary layer structure. These changes of the flow do not occur abruptly with the change of boundary conditions. A reattachment region represents a transitional region where the flow undergoes the most dramatic adjustments to the new boundary conditions. Large eddies, created in the upstream free-shear layer region, are being torn, recirculated, reentrained back into the main stream interacting with the incoming flow structure. It is foreseeable that it is quite difficult to describe the physics of this region in a rational and quantitative manner other than statistical. Downstream of the reattachment point the flow recovers at different rates near the wall, in the newly developing internal boundary layer, and in the outer part of the flow. It appears that Reynolds stresses do not fully recover up to the longest recovery length of 114 h.

Jovic, Srba↗
NASA NTRS1977

Reflection and radiation due to a quadrupole near a fluid interface

The reflection of sound at an interface between two fluid half-space in relative motion (one in motion and the other at rest), but with different density and different sound speed, is considered. The reflection coefficient is found in an explicitly closed form. A brief discussion of the effect of mean velocity, i.e., corresponding Mach number on different noise generating quadrupole directivities concludes the presentation of the paper. The graphs provided illustrate this aspect in a rather more convincing way.

Dash, R.↗
NASA NTRS1986

Initiation of breakdown in slender compressible vortices

The onset of vortex breakdown in compressible flows is investigated analytically for the case in which the flow is axially symmetric, the vortex is isolated, its axis is parallel to the main flow, and the vortex radius is small compared to the breakdown length. The conservation equations for mass, momentum, and energy are formulated and solved numerically using a finite-difference scheme, as described by Krause (1985); numerical results are presented in graphs and briefly characterized.

Krause, E.↗
NASA NTRS1951

Investigation of Separation of the Turbulent Boundary Layer

An investigation was conducted on a turbulent boundary layer near a smooth surface with pressure gradients sufficient to cause flow separation. The reynolds number was high, but the speeds were entirely within the incompressible flow range. The investigation consisted of measurements of mean flow, three components of turbulence intensity, turbulent shearing stress, and correlations between two fluctuation components at a point and between the same component of different points. The results are given in the form of tables and graphs. The discussion deals first with separation and then with the more fundamental question of basic concepts of turbulent flow.

Schubauer, G B↗
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↗