SEARCH · Engineering Papers

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

SourceResearch connectionFrom yearThrough year

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

At least 361 records · Page 20

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Reusable rocket engine turbopump health monitoring system, part 3

Degradation mechanisms and sensor identification/selection resulted in a list of degradation modes and a list of sensors that are utilized in the diagnosis of these degradation modes. The sensor list is divided into primary and secondary indicators of the corresponding degradation modes. The signal conditioning requirements are discussed, describing the methods of producing the Space Shuttle Main Engine (SSME) post-hot-fire test data to be utilized by the Health Monitoring System. Development of the diagnostic logic and algorithms is also presented. The knowledge engineering approach, as utilized, includes the knowledge acquisition effort, characterization of the expert's problem solving strategy, conceptually defining the form of the applicable knowledge base, and rule base, and identifying an appropriate inferencing mechanism for the problem domain. The resulting logic flow graphs detail the diagnosis/prognosis procedure as followed by the experts. The nature and content of required support data and databases is also presented. The distinction between deep and shallow types of knowledge is identified. Computer coding of the Health Monitoring System is shown to follow the logical inferencing of the logic flow graphs/algorithms.

Perry, John G.↗

NASA NTRS1998

MAPS of Cancer

Our goal was to produce an interactive visualization from a mathematical model that successfully predicts metastases from head and neck cancer. We met this goal early in the project. The visualization is available for the public to view. Our work appears to fill a need for more information about this deadly disease. The idea of this project was to make an easily interpretable visualization based on what we call "functional maps" of disease. A functional map is a graphic summary of medical data, where distances between parts of the body are determined by the probability of disease, not by anatomical distances. Functional maps often beat little resemblance to anatomical maps, but they can be used to predict the spread of disease. The idea of modeling the spread of disease in an abstract multidimensional space is difficult for many people. Our goal was to make the important predictions easy to see. NASA must face this problem frequently: how to help laypersons and professionals see important trends in abstract, complex data. We took advantage of concepts perfected in NASA's graphics libraries. As an analogy, consider a functional map of early America. Suppose we choose travel times, rather than miles, as our measures of inter-city distances. For Abraham Lincoln, travel times would have been the more meaningful measure of separation between cities. In such a map New Orleans would be close to Memphis because of the Mississippi River. St. Louis would be close to Portland because of the Oregon Trail. Oklahoma City would be far from Little Rock because of the Cheyenne. Such a map would look puzzling to those of us who have always seen physical maps, but the functional map would be more useful in predicting the probabilities of inter-site transit. Continuing the analogy, we could predict the spread of social diseases such as gambling along the rivers and cattle rustling along the trails. We could simply print the functional map of America, but it would be more interesting to show meaningful patterns of dispersal. We had previously published the functional map of the head and neck, but it was difficult to explain to either patients or surgeons because that view of our body did not resemble anatomy. This discrepancy between functional and physical maps is just a mathematical restatement of the well-known fact that some diseases, such as head and neck cancer, spread in complex patterns, not always to the next nearest site. We had discovered that a computer could re-arrange anatomy so that this particular disease spreads to the next nearest site. The functional map explains over 95% of the metastases in 1400 patients. In a sense, we had graphed what our body "looks like" to a tumor. The tumor readily travels between adjacent areas in the functional map. The functional map is a succinct visual display of trends that are not easily appreciated in tables of probabilities.

Gray, Lincoln↗

NASA NTRS2010

Multi Sector Planning Tools for Trajectory-Based Operations

This paper discusses a suite of multi sector planning tools for trajectory-based operations that were developed and evaluated in the Airspace Operations Laboratory (AOL) at the NASA Ames Research Center. The toolset included tools for traffic load and complexity assessment as well as trajectory planning and coordination. The situation assessment tools included an integrated suite of interactive traffic displays, load tables, load graphs, and dynamic aircraft filters. The planning toolset allowed for single and multi aircraft trajectory planning and data communication-based coordination of trajectories between operators. Also newly introduced was a real-time computation of sector complexity into the toolset that operators could use in lieu of aircraft count to better estimate and manage sector workload, especially in situations with convective weather. The tools were used during a joint NASA/FAA multi sector planner simulation in the AOL in 2009 that had multiple objectives with the assessment of the effectiveness of the tools being one of them. Current air traffic control operators who were experienced as area supervisors and traffic management coordinators used the tools throughout the simulation and provided their usefulness and usability ratings in post simulation questionnaires. This paper presents these subjective assessments as well as the actual usage data that was collected during the simulation. The toolset was rated very useful and usable overall. Many elements received high scores by the operators and were used frequently and successfully. Other functions were not used at all, but various requests for new functions and capabilities were received that could be added to the toolset.

Prevot, Thomas↗

NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

NASA NTRS1982

AgRISTARS. Supporting research: Algorithms for scene modelling

The requirements for a comprehensive analysis of LANDSAT or other visual data scenes are defined. The development of a general model of a scene and a computer algorithm for finding the particular model for a given scene is discussed. The modelling system includes a boundary analysis subsystem, which detects all the boundaries and lines in the image and builds a boundary graph; a continuous variation analysis subsystem, which finds gradual variations not well approximated by a boundary structure; and a miscellaneous features analysis, which includes texture, line parallelism, etc. The noise reduction capabilities of this method and its use in image rectification and registration are discussed.

Rassbach, M. E.↗

NASA NTRS1986

Reducing the diameters of computer networks

Three methods of reducing the diameters of computer networks by adding additional processor to processor links under the constraint that no more than one I/O port be added to each processor are discussed. This is equivalent to adding edges to a given graph under the constraint that the degree of any node be increased, at most, by one.

Bokhari, S. H.↗

NASA NTRSDate not supplied

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗

NASA NTRS2005

Online Tools for Astronomy and Cosmochemistry

Over the past year, the Webnucleo Group at Clemson University has been developing a web site with a number of interactive online tools for astronomy and cosmochemistry applications. The site uses SHP (Simplified Hypertext Preprocessor), which, because of its flexibility, allows us to embed almost any computer language into our web pages. For a description of SHP, please see http://www.joeldenny.com/ At our web site, an internet user may mine large and complex data sets, such as our stellar evolution models, and make graphs or tables of the results. The user may also run some of our detailed nuclear physics and astrophysics codes, such as our nuclear statistical equilibrium code, which is written in fortran and C. Again, the user may make graphs and tables and download the results.

Meyer, B. S.↗

NASA NTRS2003

Mechanisms of Rotating Instability in Axial Compressors Investigated

Rotating instability is a phenomenon that occurs in the tip flow region of axial compressor stages during stable operation. It can be observed in highly staggered rotors with significant tip clearance and is strongest at high-load operating points where the characteristic levels off. In this condition, the single-stage fan under investigation radiates an audible, whistling tone, and wall pressure spectra in the vicinity of the rotor disk exhibit nonrotational components. The graph shows the spectrum of static pressure at a point on the endwall near the leading edge. A hump appears at roughly half of the blade passing frequency (BPF) and is characteristic of rotating instability. A computational model was developed at the NASA Glenn Research Center to investigate the mechanism behind this phenomenon. A three-dimensional steady Navier-Stokes code that has been successfully tested for a wide range of turbomachinery flows was modified to execute a time-accurate simulation of the full annulus of the compressor. At the inlet of the computational domain, the total pressure, total temperature, and two velocity components are specified. Since no unsteady measurements of static pressure or other flow variables were available downstream of the rotor, circumferentially averaged static pressure was specified on the shroud at the outlet of the computational domain. A three-dimensional view of the vortex from the numerical model is shown. Particle traces released near the leading edge tip have rolled up to illustrate the tip clearance vortex. Flow near the trailing edge is pushed forward by the axially reversed flow. It then interacts with the tip clearance flow and the incoming flow and results in the rotating instability vortex, the core of which is illustrated by total pressure shading on planes located successively downstream. The rotating instability vortex is formed periodically midway between the blades and moves toward the pressure side of the passage. The unsteady behavior of this vortex structure is the main mechanism of the rotating instability is shown. The numerical model can be used to detect any possible occurrence of rotating instability when the tip clearance increases during engine service.

Hah, Chunill↗

NASA NTRS1975

Performance simulation for the design of solar heating and cooling systems

Suitable approaches for evaluating the performance and the cost of a solar heating and cooling system are considered, taking into account the value of a computer simulation concerning the entire system in connection with the large number of parameters involved. Operational relations concerning the collector efficiency in the case of a new improved collector and a reference collector are presented in a graph. Total costs for solar and conventional heating, ventilation, and air conditioning systems as a function of time are shown in another graph.

Mccormick, P. O.↗

NASA NTRS1989

Computer-aided boundary delineation of agricultural lands

The National Agricultural Statistics Service of the United States Department of Agriculture (USDA) presently uses labor-intensive aerial photographic interpretation techniques to divide large geographical areas into manageable-sized units for estimating domestic crop and livestock production. Prototype software, the computer-aided stratification (CAS) system, was developed to automate the procedure, and currently runs on a Sun-based image processing system. With a background display of LANDSAT Thematic Mapper and United States Geological Survey Digital Line Graph data, the operator uses a cursor to delineate agricultural areas, called sampling units, which are assigned to strata of land-use and land-cover types. The resultant stratified sampling units are used as input into subsequent USDA sampling procedures. As a test, three counties in Missouri were chosen for application of the CAS procedures. Subsequent analysis indicates that CAS was five times faster in creating sampling units than the manual techniques were.

Cheng, Thomas D.↗

NASA NTRS1992

Program Models Propagation Of Failures

FIRM is software tool for identification of failure and management of risk based on directed-graph ("digraph") approach. Three core algorithms optimized for processing singletons and doubletons and also handle tripletons. FIRM identifies loops in digraphs and displays direct failure paths between any two nodes. Solves for reachability for given node without computing reachability for entire digraph. Represents hybrid between schematic-diagram and fault-tree approaches. Written in C.

Hackler, Donald B.↗

NASA NTRS2005

Project Integration Architecture: A Practical Demonstration of Information Propagation

One of the goals of the Project Integration Architecture (PIA) effort is to provide the ability to propagate information between disparate applications. With this ability, applications may then be formed into an application graph constituting a super-application. Such a super-application would then provide all of the analysis appropriate to a given technical system. This paper reports on a small demonstration of this concept in which a Computer Aided Design (CAD) application was connected to an inlet analysis code and geometry information automatically propagated from one to the other. The majority of the work reported involved not the technology of information propagation, but rather the conversion of propagated information into a form usable by the receiving application.

Jones, William Henry↗

NASA NTRS2023

AMORE-Isoprene v1.0: A New Reduced Mechanism for Gas-Phase Isoprene Oxidation

Gas-phase oxidation of isoprene by ozone (O 3 ) and the hydroxyl (OH) and nitrate (NO 3 ) radicals significantly impacts tropospheric oxidant levels and secondary organic aerosol formation. The most comprehensive and up-to-date chemical mechanism for isoprene oxidation consists of several hundred species and over 800 reactions. Therefore, the computational expense of including the entire mechanism in large-scale atmospheric chemical transport models is usually prohibitive, and most models employ reduced isoprene mechanisms ranging in size from ∼ 10 to ∼ 200 species. We have developed a new reduced isoprene oxidation mechanism using a directed-graph path-based automated model reduction approach, with minimal manual adjustment of the output mechanism. The approach takes as inputs a full isoprene oxidation mechanism, the environmental parameter space, and a list of priority species which are protected from elimination during the reduction process. Our reduced mechanism, AMORE-Isoprene (where AMORE stands for Automated Model Reduction), consists of 12 species which are unique to the isoprene mechanism as well as 22 reactions. We demonstrate its performance in a box model in comparison with experimental data from the literature and other current isoprene oxidation mechanisms. AMORE-Isoprene's performance with respect to predicting the time evolution of isoprene oxidation products, including isoprene epoxydiols (IEPOX) and formaldehyde, is favorable compared with other similarly sized mechanisms. When AMORE-Isoprene is included in the Community Regional Atmospheric Chemistry Multiphase Mechanism 1.0 (CRACMM1AMORE) in the Community Multiscale Air Quality Model (CMAQ, v5.3.3), O 3 and formaldehyde agreement with Environmental Protection Agency (EPA) Air Quality System observations is improved. O 3 bias is reduced by 3.4 ppb under daytime conditions for O 3 concentrations over 50 ppb. Formaldehyde bias is reduced by 0.26 ppb on average for all formaldehyde measurements compared with the base CRACMM1. There was no significant change in computation time between CRACMM1AMORE and the base CRACMM. AMORE-Isoprene shows a 35 % improvement in agreement between simulated IEPOX concentrations and chamber data over the base CRACMM1 mechanism when compared in the Framework for 0-D Atmospheric Modeling (F0AM) box model framework. This work demonstrates a new highly reduced isoprene mechanism and shows the potential value of automated model reduction for complex reaction systems.

Automated Model Reduction↗

NASA NTRS1976

Ground state properties of solid and liquid spin-aligned atomic hydrogen

Calculations of the ground state energy in the solid phase were performed with the aid of a variational approach. The Morse potential form of the atomic triple potential computed by Kolos and Wolniewicz (1965) was employed for the calculations. The ground state energies of both the liquid and solid phases of spin-aligned atomic hydrogen around the volume of the transition are presented in a graph.

Danilowicz, R. L.↗

NASA NTRS1977

Superconductivity in sputtered CuMo6S8

The superconducting transition temperature and the superconducting upper critical fields for sputtered films of copper-containing ternary molybdenum chalcogenides (chevrel phases) were determined. The theory presented by Werthamer, Helfand, and Hohenberg (WHH) (1966) was used to make computer-generated plots of the superconducting upper critical field values versus the superconducting transition temperature values for various values of the Maki paramagnetic pair-breaking parameter and the spin-orbit scattering parameter. The interpretation of the graph suggests that the experimental data for at least one sample are above the maximum WHH theoretical limit in the lower temperature range. Possible explanations of this situation are discussed. In other calculations, a scaling law was found suitable for determining pinning force densities; this data was used to calculate critical current values. The relation between resistivity and temperature was studied.

Alterovitz, S.↗

NASA NTRS2009

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗