Periodic landing zone analysis for earth- orbital missions
Periodic landing zone analysis for earth-orbital missions - graphs
Green, R. I.↗
SEARCH · Engineering Papers
Results for “graph analysis”
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.
Computer analysis of nonlinear networks by recursive decomposition
Nonlinear networks computer analysis by recursive decomposition, discussing network graphs construction rules
Dertouzos, M. L.↗
Lunar Surface Gravimeter Experiment
The lunar surface gravimeter which was emplaced on the moon by the Apollo 17 flight is described and a schematic diagram of the sensor is provided. The objective of the lunar surface gravimeter is to use the moon as an instrumented antenna to detect gravitational waves. Another objective is to measure tidal deformation of the moon. Samples of signals received during lunar sunrise activity and during quiet periods are presented in graph form based on power spectrum analysis
Giganti, J. J.↗
United States data collection activities and requirements, volume 1
The potential market for a data collection system was investigated to determine whether the user needs would be sufficient to support a satellite relay data collection system design. The activities of 107,407 data collections stations were studied to determine user needs in agriculture, climatology, environmental monitoring, forestry, geology, hydrology, meteorology, and oceanography. Descriptions of 50 distinct data collections networks are described and used to form the user data base. The computer program used to analyze the station data base is discussed, and results of the analysis are presented in maps and graphs. Information format and coding is described in the appendix.
Hrin, S.↗
Wind shear modeling for aircraft hazard definition
Mathematical models of wind profiles were developed for use in fast time and manned flight simulation studies aimed at defining and eliminating these wind shear hazards. A set of wind profiles and associated wind shear characteristics for stable and neutral boundary layers, thunderstorms, and frontal winds potentially encounterable by aircraft in the terminal area are given. Engineering models of wind shear for direct hazard analysis are presented in mathematical formulae, graphs, tables, and computer lookup routines. The wind profile data utilized to establish the models are described as to location, how obtained, time of observation and number of data points up to 500 m. Recommendations, engineering interpretations and guidelines for use of the data are given and the range of applicability of the wind shear models is described.
Frost, W.↗
Multispectral determination of soil moisture-2
Soil moisture data obtained using scatterometers, modular multispectral scanners and passive microwave radiometers were revised and grouped into four field cover types for statistical anaysis. Guymon data are grouped as alfalfa, bare, milo with rows perpendicular to the field view, and milo viewed parallel to the field of view. Dalhart data are grouped as bare combo, stubble, disked stubble, and corn field. Summary graphs combine selected analyses to compare the effects of field cover. The analysis for each of the cover types is presented in tables and graphs. Other tables show elementary statistics, correlation matrices, and single variable regressions. Selected eigenvectors and factor analyses are included and the highest correlating sensor typs for each location are summarized.
Estes, J. E.↗
The flow of a compressible fluid past a circular arc profile
The Ackeret iteration process is utilized to obtain higher approximations than that of Prandtl and Glauert for the flow of a compressible fluid past a circular arc profile. The procedure is to expand the velocity potential in a power series of the camber coefficient. The first two terms of the development correspond to the Prandtl-Glauert approximation and yield the well-known correction to the circulation about the profile. The second approximation, involving the square of the camber coefficient, improves the velocity and pressure fields but yields no new results with regard to the circulation, since the circulation about the profile is an odd function of the camber coefficient. The third approximation, involving the cube of the camber coefficient, permits the use of higher values of the camber coefficient and furthermore yields an improvement to the Prandtl-Glauert rule with regard to the effect of compressibility on the circulation of the circular arc profile. Numerical examples with tables and graphs illustrate the results of the analysis.
Kaplan, Carl↗
Distributed Computing Architecture for Image-Based Wavefront Sensing and 2 D FFTs
Image-based wavefront sensing (WFS) provides significant advantages over interferometric-based wavefi-ont sensors such as optical design simplicity and stability. However, the image-based approach is computational intensive, and therefore, specialized high-performance computing architectures are required in applications utilizing the image-based approach. The development and testing of these high-performance computing architectures are essential to such missions as James Webb Space Telescope (JWST), Terrestial Planet Finder-Coronagraph (TPF-C and CorSpec), and Spherical Primary Optical Telescope (SPOT). The development of these specialized computing architectures require numerous two-dimensional Fourier Transforms, which necessitate an all-to-all communication when applied on a distributed computational architecture. Several solutions for distributed computing are presented with an emphasis on a 64 Node cluster of DSPs, multiple DSP FPGAs, and an application of low-diameter graph theory. Timing results and performance analysis will be presented. The solutions offered could be applied to other all-to-all communication and scientifically computationally complex problems.
Smith, Jeffrey S.↗
Network Analytic Approaches for HSRB DAG Development
Explore the source record for details and available documents.
Network Analysis↗
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.
97 MATHEMATICS AND COMPUTING↗
Graph Sparsification by Approximate matrix Multiplication
Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.
97 MATHEMATICS AND COMPUTING↗
A graphics primer for English Teachers
Skills necessary for teaching graphics are addressed. A simple, step by step method of teaching students how to draw different types of graphs is presented. Each step is illustrated by a drawing. Some audience analysis for the determination of appropriateness of the use of different types of graphs is included.
Brillhart, L. V.↗
Comparing Mapper Graphs of Artificial Neuron Activations
The mapper graph is a popular tool from topological data analysis that provides a graphical summary of point cloud data. It has been used to study data from cancer research, sports analytics, neurosciences, and machine learning. In particular, mapper graphs have been used recently to visualize the topology of high-dimensional artificial neural activations from convolutional neural networks and large language models. However, a key question that arises from using mapper graphs across applications is how to compare mapper graphs to study their structural differences. In this paper, we introduce a distance between mapper graphs using tools from optimal transport. We demonstrate the utility of such a distance by studying the topological changes of neural activations across convolutional layers in deep learning, as well as by capturing the loss of structural information for multiscale mapper.
mapper graphs, computational topology, machine lea↗
Sensitivity analysis Progress report, 1 Mar. - 1 May 1967
Flow graph technique for calculating sensitivity coefficients for electric networks
FLOW GRAPH↗
Apollo spacecraft systems analysis program. Preliminary LR reflectivity model
Preliminary lunar reflectivity graphs
Dickerson, E. T.↗
High resolution infrared spectroscopy from space: A preliminary report on the results of the Atmospheric Trace Molecule Spectroscopy (ATMOS) experiment on Spacelab 3
The ATMOS (Atmospheric Trace Molecule Spectroscopy) experiment has the broad purpose of investigating the physical structure, chemistry, and dynamics of the upper atmosphere through the study of the distributions of the neutral minor and trace constituents and their seasonal and long-term variations. The technique used is high-resolution infrared absorption spectroscopy using the Sun as the radiation source, observing the changes in the transmission of the atmosphere as the line-of-sight from the Sun to the spacecraft penetrates the atmosphere close to the Earth's limb at sunrise and sunset. During these periods, interferograms are generated at the rate of one each second which yield, when transformed, high resolution spectra covering the 2.2 to 16 micron region of the infrared. Twenty such occultations were recorded during the Spacelab 3 flight, which have produced concentration profiles for a large number of minor and trace upper atmospheric species in both the Northern and Southern Hemispheres. Several of these species have not previously been observed in spectroscopic data. The data reduction and analysis procedures used following the flight are discussed; a number of examples of the spectra obtained are shown, and a bar graph of the species detected thus far in the analysis is given which shows the altitude ranges for which concentration profiles were retrieved.
Farmer, Crofton B.↗
Hyperspectral Image Analysis Program
Information on imaging spectrometry is given in the forms of outlines, graphs, and charts. Topics covered include impacts on science users, program objectives, expert systems for imaging spectrometry, and imaging spectrometer data analysis methods.
Source record↗
Sensitivity analysis of generic deep geologic repository with focus on spatial heterogeneity induced by stochastic fracture network generation
Geologic Disposal Safety Assessment Framework is a state-of-the-art simulation software toolkit for probabilistic post-closure performance assessment of systems for deep geologic disposal of nuclear waste developed by the United States Department of Energy. This paper presents a generic reference case and shows how it is being used to develop and demonstrate performance assessment methods within the Geologic Disposal Safety Assessment Framework that mitigate some of the challenges posed by high uncertainty and limited computational resources. Variance-based global sensitivity analysis is applied to assess the effects of spatial heterogeneity using graph-based summary measures for scalar and time-varying quantities of interest. Behavior of the system with respect to spatial heterogeneity is further investigated using ratios of water fluxes. This analysis shows that spatial heterogeneity is a dominant uncertainty in predictions of repository performance which can be identified in global sensitivity analysis using proxy variables derived from graph descriptions of discrete fracture networks. New quantities of interest defined using water fluxes proved useful for better understanding overall system behavior.
12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗