Search NASA⌕ Search

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.

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

At least 91 records · Page 5

Graph Convolutional Network-Strengthened Topic Modeling for Scientific Papers

Machine learning has been woven into statistics to modernize topic modeling over textual documents written in natural language, and scientific paper search and recommendation can consequently offer higher accuracy instead of counting on traditional keyword-based search. However, topic distribution of a paper resulted from existing topic modeling techniques only relies on the statistics of words contained in the paper itself. We argue that community users’ views of a paper may also provide insights at the time of recommendation. For example, if a paper on fake image detection has been cited heavily by machine learning papers, such a feature should be absorbed in the embedding of this paper, so that it can be recommended for future query on machine learning. In this paper, we present a Graph Convolutional Network-strengthened Topic Modeling (GCN-TM) method, which employs GCN technique to refine topic modeling of scientific papers. A citation-oriented knowledge graph is constructed, and topic modeling is mapped to feature embedding of the comprising papers. On top of its own topics carried in its content, each paper learns topics from its neighbors and revise its embedding accordingly. Our empirical studies over real-life scientific literature has proved the necessity and effectiveness of our proposed approach.

Jia Zhang↗

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.↗

Evaluation of the Effect of Surface Finish on High-Cycle Fatigue of SLM-IN718

The surface finish of parts produced by additive manufacturing processes is much rougher than the surface finish generated by machining processes, and a rougher surface can reduce the fatigue strength of a part. This paper discusses an effort to quantify that reduction of strength in high-cycle fatigue for selective laser melt (SLM) coupons. A high-cycle fatigue (HCF) knockdown factor was estimated for Inconel 718, manufactured with the SLM process. This factor is the percentage reduction from the maximum stress in fatigue for low-stress ground (LSG) specimens to the maximum stress of those left with the original surface condition at the same fatigue life. Specimens were provided by a number of vendors, free to use their "best practice"; only one heat treat condition was considered; and several test temperatures were characterized, including room temperature, 800F, 1000F, and 1200F. The 1000F data had a large variance, and was omitted from consideration in this document. A first method used linear approximations extracted from the graphs, and only where data was available for both. A recommended knockdown factor of the as-built surface condition (average roughness of approximately 245 micro-inches/inch) versus low-stress ground condition (roughness no more than 4 micro-inches/inch) was established at approximately 1/3 or 33%. This is to say that for the as-built surface condition, a maximum stress of 2/3 of the stress for LSG can be expected to produce a similar life in the as-built surface condition. In this first evaluation, the knockdown factor did not appear to be a function of temperature. A second approach, the "KP method", incorporated the surface finish measure into a new parameter termed the pseudo-stress intensity factor, Kp, which was formulated to be similar to the fracture mechanics stress intensity factor. Using Kp, the variance seemed to be reduced across all sources, and knockdown factors were estimated using Kp over the range where data occurred. A plot of the results suggests that the knockdown factor is a function of temperature, and that for low lives the knockdown might be lower than the knockdown observed above about one million cycles, where it tended to stabilize. This was not universal for all temperatures tested. The higher temperature tests are thought to be influenced by the test temperature, which perhaps continued the aging process. Further evaluation of the method is suggested.

Lambert, D. M.↗

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗

The Pack Method for Compressive Tests of Thin Specimens of Materials Used in Thin-Wall Structures

The strength of modern lightweight thin-wall structures is generally limited by the strength of the compression members. An adequate design of these members requires a knowledge of the compressive stress-strain graph of the thin-wall material. The "pack" method was developed at the National Bureau of Standards with the support of the National Advisory Committee for Aeronautics to make possible a determination of compressive stress-strain graphs for such material. In the pack test an odd number of specimens are assembled into a relatively stable pack, like a "pack of cards." Additional lateral stability is obtained from lateral supports between the external sheet faces of the pack and outside reactions. The tests seems adequate for many problems in structural research.

Aitchison, C S↗

Application of numerical methods to extend capabilities for optimal rocket guidance: report on reentry guidance of shuttle orbiter

Analytical models are presented for optimal trajectories and reentry guidance of the space shuttle orbiter. Major emphasis is placed on the development of a "footprint', which refers to a set of reachable destination positions attainable by the shuttle at a specified terminal altitude. An unconstrained reentry footprint was calculated for a shuttle vehicle which enters the earth's atmosphere at 93 km initial altitude after a deboost from a near earth orbit. The method of computation is briefly described, and graphs are presented which illustrate the footprint and the variation of state and control variables along it. The effects of constraints and of variations in initial state upon the footprint are discussed.

Source record↗

The observed distribution of atmospheric ozone and its variations

It is pointed out that both the total amount and the vertical distribution of atmospheric ozone are presently measured routinely by various ground-based and satellite-borne instruments and by instruments mounted on different carrier platforms such as balloons, aircraft, and rockets. The techniques of observing atmospheric ozone are discussed, taking into account the determination of total ozone, the Dobson spectrophotometer, the Brewer spectrophotometer, the M-83 Filter Ozonometer, and satellite techniques. In a discussion of studies of vertical distribution, remote systems are considered along with in situ measurements. Attention is given to ground-based methods, satellite platforms, backscatter measurements, limb observations, electrochemical methods, chemiluminescent methods, optical methods, and rocket observations. A number of graphs showing the observed distribution of atmospheric ozone are also presented, and changes in this distribution are evaluated.

London, J.↗

On the free vibrations of spinning paraboloids

The dynamic behavior of a spinning linear-elastic paraboloid subject to nonaxisymmetric deformation is investigated analytically, applying the Rayleigh-Ritz procedure described by Utku et al. (1983). Energy-density, strain-displacement, and velocity-displacement expressions are generated; expressions for the generalized strain and position vector are derived; and the discretized dynamic equations are obtained. Numerical results obtained with a computer-program implementation of the method are presented in extensive tables and graphs. The effects of spin rate and bending rigidity and results for the special case of a spinning disk are included.

Shoemaker, W. L.↗

Power flow for spacecraft power systems

A method for constructing the generalized system-level admittance matrix for use with a Newton-Raphson power flow is presented. The network modeling technique presented does not use the standard pi-equivalent models, which assume a lossless return path, for the transmission line and transformer. If the return path cannot be assumed lossless, then the standard algorithms for constructing the system admittance matrix cannot be used. The method presented here uses concepts from linear graph theory to combine network modules to form the system-level admittance matrix. The modeling technique is presented, and the resulting matrix is used with a standard Newton-Raphson power flow to calculate all system voltages and current (power) flows.

Halpin, S. M.↗

Neural Network and Regression Methods Demonstrated in the Design Optimization of a Subsonic Aircraft

The neural network and regression methods of NASA Glenn Research Center s COMETBOARDS design optimization testbed were used to generate approximate analysis and design models for a subsonic aircraft operating at Mach 0.85 cruise speed. The analytical model is defined by nine design variables: wing aspect ratio, engine thrust, wing area, sweep angle, chord-thickness ratio, turbine temperature, pressure ratio, bypass ratio, fan pressure; and eight response parameters: weight, landing velocity, takeoff and landing field lengths, approach thrust, overall efficiency, and compressor pressure and temperature. The variables were adjusted to optimally balance the engines to the airframe. The solution strategy included a sensitivity model and the soft analysis model. Researchers generated the sensitivity model by training the approximators to predict an optimum design. The trained neural network predicted all response variables, within 5-percent error. This was reduced to 1 percent by the regression method. The soft analysis model was developed to replace aircraft analysis as the reanalyzer in design optimization. Soft models have been generated for a neural network method, a regression method, and a hybrid method obtained by combining the approximators. The performance of the models is graphed for aircraft weight versus thrust as well as for wing area and turbine temperature. The regression method followed the analytical solution with little error. The neural network exhibited 5-percent maximum error over all parameters. Performance of the hybrid method was intermediate in comparison to the individual approximators. Error in the response variable is smaller than that shown in the figure because of a distortion scale factor. The overall performance of the approximators was considered to be satisfactory because aircraft analysis with NASA Langley Research Center s FLOPS (Flight Optimization System) code is a synthesis of diverse disciplines: weight estimation, aerodynamic analysis, engine cycle analysis, propulsion data interpolation, mission performance, airfield length for landing and takeoff, noise footprint, and others.

Hopkins, Dale A.↗

On the circulatory subsonic flow of a compressible fluid past a circular cylinder

The circulatory subsonic flow around an infinite circular cylinder is computed using the linearized pressure-volume relation, by a method developed in a previous report. Formulas and graphs are given for the velocity and pressure distributions, the circulation, the lift, and the dependence of the critical Mach number upon the position of the stagnation point.

FLOW, COMPRESSIBLE-MEASUREMENT↗

Decision net, directed graph, and neural net processing of imaging spectrometer data

A decision-net solution involving a novel hierarchical classifier and a set of multiple directed graphs, as well as a neural-net solution, are respectively presented for large-class problem and mixture problem treatments of imaging spectrometer data. The clustering method for hierarchical classifier design, when used with multiple directed graphs, yields an efficient decision net. New directed-graph rules for reducing local maxima as well as the number of perturbations required, and the new starting-node rules for extending the reachability and reducing the search time of the graphs, are noted to yield superior results, as indicated by an illustrative 500-class imaging spectrometer problem.

Casasent, David↗

Populating a Graph Database to Run a Usage-Based Discovery Tool

Most dataset discovery tools for Earth Observation data rely on descriptions and other metadata of the datasets, using keyword searches or attribute filtering to determine relevance. However, these descriptions often do not include the potential uses of the data. Thus, a user working on floods will rarely see few if any rainfall datasets show up in such a search. The Usage Based Discovery tool, on the other hand, offers usage instances to the user, either research articles or applications, along with the datasets that those usage instances used. This allows a user, particularly one new to the world of Earth Observation data, to investigate which datasets are used in similar cases. The information that powers Usage-Based Discovery is a graph database of relationships of usage to dataset and usage to topic, allowing the user to narrow their search for similar cases. In order to scale out to a graph database rich enough to provide a satisfactory user experience, we combine manual and automated processes to populate the graph. The initial content of the graph has been seeded primarily via human-aided data curation methods, using sites like Google Scholar. To scale up this effort, we’ve employed crowdsourcing. It is easy for anyone to contribute to our graph using their Open Researcher and Contributor Identifier for authorization. We’re now experimenting with Machine Learning and Natural Language Processing to help automate population of the graph, starting with the classification of research articles by topic. Finding adequate training data in the absence of a comprehensive and open research article API continues to be a significant challenge.

Vincent Inverso↗

Geoid undulation computations at laser tracking stations

The accuracy of numerical computations of gravimetric undulations using recently proposed modifications of the classical Stokes formula is investigated. The basic formulations of the methods are outlined, and results from trial computations are presented in tables and graphs and compared with actual gravity data and/or GEOS-3/Seasat sea-surface heights. Although all of the methods gave similar results, the method of Sjoberg (1986) is recommended because of its superior theoretical precision. The importance of including terrain-corrected free-air anomalies in the computations is indicated.

Despotakis, Vasilios K.↗

Towards a theory of automated elliptic mesh generation

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

Cordova, J. Q.↗

Contingency Planning for Planetary Rovers

There has been considerable work in AI on planning under uncertainty. But this work generally assumes an extremely simple model of action that does not consider continuous time and resources. These assumptions are not reasonable for a Mars rover, which must cope with uncertainty about the duration of tasks, the power required, the data storage necessary, along with its position and orientation. In this paper, we outline an approach to generating contingency plans when the sources of uncertainty involve continuous quantities such as time and resources. The approach involves first constructing a "seed" plan, and then incrementally adding contingent branches to this plan in order to improve utility. The challenge is to figure out the best places to insert contingency branches. This requires an estimate of how much utility could be gained by building a contingent branch at any given place in the seed plan. Computing this utility exactly is intractable, but we outline an approximation method that back propagates utility distributions through a graph structure similar to that of a plan graph.

Dearden, Richard↗

Incremental Contingency Planning

There has been considerable work in AI on planning under uncertainty. However, this work generally assumes an extremely simple model of action that does not consider continuous time and resources. These assumptions are not reasonable for a Mars rover, which must cope with uncertainty about the duration of tasks, the energy required, the data storage necessary, and its current position and orientation. In this paper, we outline an approach to generating contingency plans when the sources of uncertainty involve continuous quantities such as time and resources. The approach involves first constructing a "seed" plan, and then incrementally adding contingent branches to this plan in order to improve utility. The challenge is to figure out the best places to insert contingency branches. This requires an estimate of how much utility could be gained by building a contingent branch at any given place in the seed plan. Computing this utility exactly is intractable, but we outline an approximation method that back propagates utility distributions through a graph structure similar to that of a plan graph.

Dearden, Richard↗