Search NASA⌕ Search

SEARCH · Search NASA

Results for “large 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 145 records · Page 8

Research on the elastic stability of large shells

Tests were conducted to determine the elastic stability of large shell structures. The configuration of the shells and the instrumentation used in the measurements are described. The testing procedures are explained. Results of the stress analysis are plotted in polar graph form to show the areas of strain in micro inches at the outer surface of the skin and the inner lip of the stringer.

Horton, W. H.↗

The nature of comets

The large-scale structure, dynamics, and chemical composition of comets are examined on the basis of preliminary ground-based and space-probe data from the Halley return of 1986. Diagrams, graphs, photographs, and false-color images are provided, and data on Comet Giacobini-Zinner are included for comparison. Features noted include solar-wind interaction with magnetic-field draping around the head region, dramatic disconnection events, an irregularly shaped monolithic primarily water-ice nucleus and a dark surface, and dust with chemical composition like that of (H, C, N, O)-enriched carbonaceous chondrites.

Brandt, J. C.↗

Dynamic Load Balancing for Adaptive Computations on Distributed-Memory Machines

Dynamic load balancing is central to adaptive mesh-based computations on large-scale parallel computers. The principal investigator has investigated various issues on the dynamic load balancing problem under NASA JOVE and JAG rants. The major accomplishments of the project are two graph partitioning algorithms and a load balancing framework. The S-HARP dynamic graph partitioner is known to be the fastest among the known dynamic graph partitioners to date. It can partition a graph of over 100,000 vertices in 0.25 seconds on a 64- processor Cray T3E distributed-memory multiprocessor while maintaining the scalability of over 16-fold speedup. Other known and widely used dynamic graph partitioners take over a second or two while giving low scalability of a few fold speedup on 64 processors. These results have been published in journals and peer-reviewed flagship conferences.

Source record↗

Approximate penetration factors for nuclear reactions of astrophysical interest

The ranges of validity of approximations of P(l), the penetration factor which appears in the parameterization of nuclear-reaction cross sections at low energies and is employed in the extrapolation of laboratory data to even lower energies of astrophysical interest, are investigated analytically. Consideration is given to the WKB approximation, P(l) at the energy of the total barrier, approximations derived from the asymptotic expansion of G(l) for large eta, approximations for small values of the parameter x, applications of P(l) to nuclear reactions, and the dependence of P(l) on channel radius. Numerical results are presented in tables and graphs, and parameter ranges where the danger of serious errors is high are identified.

Humblet, J.↗

Wide binary stars at the Galactic poles

Results are reported from a search for high-Galactic-latitude wide binaries down to visual magnitude 14 on five digitized Schmidt-telescope plates. The data-reduction and analysis techniques are described in detail, and the results are presented in graphs and briefly characterized. The number of wide binaries and the estimated wide-binary number density are both three times smaller than those found by Bahcall and Soneira (1981), but still too large to be consistent with the predictions of physical models. Possible explanations for this discrepancy are explored.

Garnavich, Peter M.↗

Correlations in cosmic density fields

A method is proposed to place constraints on the functional form of the high-order correlation functions zeta(sub n) that arise in cosmic density fields at large scales. This technique is based on a mass-in-cell statistic and a difference of mass in partitions of a cell. The relationship between these measures is sensitive to the formal structure of the zeta(sub n) as well as their amplitudes. This relationship is quantified in several theoretical models of structure, based on the hierarchical clustering paradigm. The results lead to a test for specific types of hierarchical clustering that is sensitive to correlations of all orders. The method is applied to examples of simulated large-scaled structure dominated by cold dark matter. In the preliminary study, the hierarchical paradigm appears to be a realistic approximation over a broad range of the scales. Furthermore, there is evidence that graphs of low-order vertices are dominant. On the basis of simulated data a phenomological model is specified that gives a good representation of clustering from linear scales to the strongly clustered regime (zeta(sub 2) approximately 500).

Bromley, B. C.↗

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

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

Quadratic integer programming for large scale banded matrices

This paper is concerned with the integer quadratic program where the variables are constrained to belong to a given set of discrete values. This quadratic integer program is shown to be equivalent to a problem of finding the shortest path in a particular directed graph called a trellis when the matrix is a positive-definite symmetric banded matrix. An efficient procedure for solving this shortest path problem is presented which allows the solution of the integer quadratic program. This method is particularly effective when the half-bandwidth of the matrix is significantly smaller than its dimension.

Yan, T. Y.↗

Very Large Array observations of Uranus at 2.0 cm

Radio observations of Uranus obtained at 2.0 cm with the B configuration of the VLA during April 1985 are reported. The calibration and data-reduction procedures are described in detail, and the results are presented in tables, maps, and graphs and compared with IRIS 44-micron observations (Hanel et al., 1986). Features discussed include highest brightness centered on the pole rather than on the subearth point, a decrease in brightness temperature (by up to 9 K) at latitudes between -20 and -50 deg (well correlated with the IRIS data), and disk-center position (corrected for the observed radio asymmetry) in good agreement with that found on the basis of the outer contours of the image.

Berge, G. L.↗

Telemetry and Science Data Software System

The Telemetry and Science Data Software System (TSDSS) was designed to validate the operational health of a spacecraft, ease test verification, assist in debugging system anomalies, and provide trending data and advanced science analysis. In doing so, the system parses, processes, and organizes raw data from the Aquarius instrument both on the ground and while in space. In addition, it provides a user-friendly telemetry viewer, and an instant pushbutton test report generator. Existing ground data systems can parse and provide simple data processing, but have limitations in advanced science analysis and instant report generation. The TSDSS functions as an offline data analysis system during I&T (integration and test) and mission operations phases. After raw data are downloaded from an instrument, TSDSS ingests the data files, parses, converts telemetry to engineering units, and applies advanced algorithms to produce science level 0, 1, and 2 data products. Meanwhile, it automatically schedules upload of the raw data to a remote server and archives all intermediate and final values in a MySQL database in time order. All data saved in the system can be straightforwardly retrieved, exported, and migrated. Using TSDSS s interactive data visualization tool, a user can conveniently choose any combination and mathematical computation of interesting telemetry points from a large range of time periods (life cycle of mission ground data and mission operations testing), and display a graphical and statistical view of the data. With this graphical user interface (GUI), the data queried graphs can be exported and saved in multiple formats. This GUI is especially useful in trending data analysis, debugging anomalies, and advanced data analysis. At the request of the user, mission-specific instrument performance assessment reports can be generated with a simple click of a button on the GUI. From instrument level to observatory level, the TSDSS has been operating supporting functional and performance tests and refining system calibration algorithms and coefficients, in sync with the Aquarius/SAC-D spacecraft. At the time of this reporting, it was prepared and set up to perform anomaly investigation for mission operations preceding the Aquarius/SAC-D spacecraft launch on June 10, 2011.

Bates, Lakesha↗

Longitudinal oscillation of launch vehicles

During powered flight a vehicle may develop longitudinal self-excited oscillations, so-called oscillations, of its structure. The energy supplying the vibration is tapped from the thrust by the activity of the system itself; that is, oscillation of the structure causes oscillation of the propellant system, especially of the pumps. In this way an oscillating thrust can be created that, by a feedback loop, may sustain the structural oscillation under certain circumstances. Two special features of the system proved to be essential for creation of instability. One is the effect of the inherent time interval that the thrust oscillation is lagging behind the structural oscillation. The other is the decreased of system mass caused by the exhausting of gas. The latter feature may cause an initially stable system to become unstable. To examine the stability of the system, a single mass-spring model, which is the result of a one-term Galerkin approach to the equation of motion, has been considered. The Nyquist stability criterion leads to a stability graph that shows the stability conditions in terms of the system parameter and also demonstrates the significance of time lag, feedback magnitude, and loss of mass. An important conclusion can be drawn from the analysis: large relative displacements of the pump-engine masses favor instability. This is also confirmed by flight measurements.

Glaser, R. F.↗

Mathematical modeling and simulation of the space shuttle imaging radar antennas

Simulations of space shuttle synthetic aperture radar antennas under the influence of space environmental conditions were carried out at L, C, and X-band. Mathematical difficulties in modeling large, non-planar array antennas are discussed, and an approximate modeling technique is presented. Results for several antenna error conditions are illustrated in far-field profile patterns, earth surface footprint contours, and summary graphs.

Campbell, R. W.↗

An evaluation of the directed flow graph methodology

The applicability of the Directed Graph Methodology (DGM) to the design and analysis of special purpose image and signal processing hardware was evaluated. A special purpose image processing system was designed and described using DGM. The design, suitable for very large scale integration (VLSI) implements a region labeling technique. Two computer chips were designed, both using metal-nitride-oxide-silicon (MNOS) technology, as well as a functional system utilizing those chips to perform real time region labeling. The system is described in terms of DGM primitives. As it is currently implemented, DGM is inappropriate for describing synchronous, tightly coupled, special purpose systems. The nature of the DGM formalism lends itself more readily to modeling networks of general purpose processors.

Snyder, W. E.↗

Numerical models of thermally and mechanically coupled two-layer convection of highly viscous fluids

Thermal convection in the earth mantle is investigated by means of numerical simulations. The mantle models comprise two horizontal layers of viscous incompressible fluid (with identical or differing properties) separated by a fixed horizontal interface; an isothermal, fixed-heat-flux, or insulating lower boundary; and heat supplied either from below or internally (in the lower layer only, equally in both layers, or primarily in the upper layer). The mathematical formulation of the models is explained, and results for linear stability and finite-amplitude convection are presented in extensive tables and graphs and discussed in detail. Particular attention is given to the presence of thermal coupling without interface distortion in many cases, the predominance of long-wavelength cells in the finite-amplitude models, and the large (50 percent) temperature difference across the interface in all cases.

Ellsworth, Kirk↗

Optimal processor assignment for pipeline computations

The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

Nicol, David M.↗