Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms and data structure”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Querying databases of trajectories of differential equations 2: Index functions

Suppose that a large number of parameterized trajectories (gamma) of a dynamical system evolving in R sup N are stored in a database. Let eta is contained R sup N denote a parameterized path in Euclidean space, and let parallel to center dot parallel to denote a norm on the space of paths. A data structures and indices for trajectories are defined and algorithms are given to answer queries of the following forms: Query 1. Given a path eta, determine whether eta occurs as a subtrajectory of any trajectory gamma from the database. If so, return the trajectory; otherwise, return null. Query 2. Given a path eta, return the trajectory gamma from the database which minimizes the norm parallel to eta - gamma parallel.

Grossman, Robert↗
NASA NTRS1992

Efficient use of high performance computers for integrated controls and structures design

Simply transporting design codes from sequential-scalar computers to parallel-vector computers does not fully utilize the computational benefits offered by high performance computers. By performing integrated controls and structures design on an experimental truss platform with both sequential-scalar and parallel-vector design codes, conclusive results are presented to substantiate this claim. The efficiency of a Cholesky factorization scheme in conjunction with a variable-band row data structure is presented. In addition, the Lanczos eigensolution algorithm has been incorporated in the design code for both parallel and vector computations. Comparisons of computational efficiency between the initial design code and the parallel-vector design code are presented. It is shown that the Lanczos algorithm with the Cholesky factorization scheme is far superior to the sub-space iteration method of eigensolution when substantial numbers of eigenvectors are required for control design and/or performance optimization. Integrated design results show the need for continued efficiency studies in the area of element computations and matrix assembly.

Belvin, W. K.↗
NASA NTRS1993

Designing reduced-order linear multivariable controllers using experimentally derived plant data

An iterative numerical algorithm for simultaneously improving multiple performance and stability robustness criteria for multivariable feedback systems is developed. The unsatisfied design criteria are improved by updating the free parameters of an initial, stabilizing controller's state-space matrices. Analytical expressions for the gradients of the design criteria are employed to determine a parameter correction that improves all of the feasible, unsatisfied design criteria at each iteration. A controller design is performed using the algorithm with experimentally derived data from a large space structure test facility. Experimental results of the controller's performance at the facility are presented.

Frazier, W. G.↗
NASA NTRS2015

Explore GPM IMERG and Other Global Precipitation Products with GES DISC GIOVANNI

New features and capabilities in the newly released GIOVANNI allow exploring GPM IMERG (Integrated Multi-satelliE Retrievals for GPM) Early, Late and Final Run global half-hourly and monthly precipitation products as well as other precipitation products distributed by the GES DISC such as TRMM Multi-Satellite Precipitation Analysis (TMPA), MERRA (Modern Era Retrospective-Analysis for Research and Applications), NLDAS (North American Land Data Assimilation Systems), GLDAS (Global Land Data Assimilation Systems), etc. GIOVANNI is a web-based tool developed by the GES DISC (Goddard Earth Sciences and Data Information Services Center) to visualize and analyze Earth science data without having to download data and software. The new interface in GIOVANNI allows searching and filtering precipitation products from different NASA missions and projects and expands the capabilities to inter-compare different precipitation products in one interface. Knowing differences in precipitation products is important to identify issues in retrieval algorithms, biases, uncertainties, etc. Due to different formats, data structures, units and so on, it is not easy to inter-compare precipitation products. Newly added features and capabilities (unit conversion, regridding, etc.) in GIOVANNI make inter-comparisons possible. In this presentation, we will describe these new features and capabilities along with examples.

Giovanni↗
NASA NTRS1993

A new procedure for dynamic adaption of three-dimensional unstructured grids

A new procedure is presented for the simultaneous coarsening and refinement of three-dimensional unstructured tetrahedral meshes. This algorithm allows for localized grid adaption that is used to capture aerodynamic flow features such as vortices and shock waves in helicopter flowfield simulations. The mesh-adaption algorithm is implemented in the C programming language and uses a data structure consisting of a series of dynamically-allocated linked lists. These lists allow the mesh connectivity to be rapidly reconstructed when individual mesh points are added and/or deleted. The algorithm allows the mesh to change in an anisotropic manner in order to efficiently resolve directional flow features. The procedure has been successfully implemented on a single processor of a Cray Y-MP computer. Two sample cases are presented involving three-dimensional transonic flow. Computed results show good agreement with conventional structured-grid solutions for the Euler equations.

Biswas, Rupak↗
NASA NTRS2005

Self-Organizing-Map Program for Analyzing Multivariate Data

SOM_VIS is a computer program for analysis and display of multidimensional sets of Earth-image data typified by the data acquired by the Multi-angle Imaging Spectro-Radiometer [MISR (a spaceborne instrument)]. In SOM_VIS, an enhanced self-organizing-map (SOM) algorithm is first used to project a multidimensional set of data into a nonuniform three-dimensional lattice structure. The lattice structure is mapped to a color space to obtain a color map for an image. The Voronoi cell-refinement algorithm is used to map the SOM lattice structure to various levels of color resolution. The final result is a false-color image in which similar colors represent similar characteristics across all its data dimensions. SOM_VIS provides a control panel for selection of a subset of suitably preprocessed MISR radiance data, and a control panel for choosing parameters to run SOM training. SOM_VIS also includes a component for displaying the false-color SOM image, a color map for the trained SOM lattice, a plot showing an original input vector in 36 dimensions of a selected pixel from the SOM image, the SOM vector that represents the input vector, and the Euclidean distance between the two vectors.

Li, P. Peggy↗
NASA NTRS1987

Reverse time migration: A seismic processing application on the connection machine

The implementation of a reverse time migration algorithm on the Connection Machine, a massively parallel computer is described. Essential architectural features of this machine as well as programming concepts are presented. The data structures and parallel operations for the implementation of the reverse time migration algorithm are described. The algorithm matches the Connection Machine architecture closely and executes almost at the peak performance of this machine.

Fiebrich, Rolf-Dieter↗
NASA NTRS2005

A Constraint-Based Planner for Data Production

This paper presents a graph-based backtracking algorithm designed to support constrain-tbased planning in data production domains. This algorithm performs backtracking at two nested levels: the outer- backtracking following the structure of the planning graph to select planner subgoals and actions to achieve them and the inner-backtracking inside a subproblem associated with a selected action to find action parameter values. We show this algorithm works well in a planner applied to automating data production in an ecological forecasting system. We also discuss how the idea of multi-level backtracking may improve efficiency of solving semi-structured constraint problems.

Pang, Wanlin↗
NASA NTRS2018

Applications of the Dynamic N-Dimensional K-Vector

The n-dimensional k-vector (NDKV) is an appealing alternative to binary tress for resolving complex queries in large relational databases. The method has excelled in several applications involving static databases. The present paper extends the theory supporting the NDKV to handle dynamic databases, where the data is updated frequently. This includes deleting records, adding new entries, or editing existing elements. The merit of this new version of the NDKV, the dynamic n-dimensional k-vector (DNDKV), is that it is no longer necessary to recompute the entire k-vector (the main structure that indexes the data) every time a record changes. The algorithm updates the four constituents of the standard NDKV on the fly: the database, sorted database, index, and k-vector tables. As a result, the DNDKV becomes comparable in terms of capabilities and flexibility to stateof-the-art storage engines relying on structured query languages (SQL). The performance of the DNDKV is assessed by running typical read/write operations on a database that contains millions of pre-computed missions to celestial bodies. This database requires frequent updates whenever an orbit solution is refined or new bodies are discovered. The DNDKV is faster than rebuilding the k-vector tables completely, provided that the number of elements being added or removed is not excessively large. Direct runtime comparisons with MySQL suggest that the DNDKV is several times faster for reading but might be slower for writing and updating the database. One limit of the technique is the elements being added must be within the range of the current k-vector tables. If this is not the case, the technique cannot be used and the k-vector tables must be rebuilt from scratch.

Mortari, Daniele↗
NASA NTRS2012

Smart Composite Overwrapped Pressure Vessel - Integrated Structural Health Monitoring System to Meet Space Exploration and International Space Station Mission Assurance Needs

Currently there are no integrated NDE methods for baselining and monitoring defect levels in fleet for Composite Overwrapped Pressure Vessels (COPVs) or related fracture critical composites, or for performing life-cycle maintenance inspections either in a traditional remove-and-inspect mode or in a more modern in situ inspection structural health monitoring (SHM) mode. Implicit in SHM and autonomous inspection is the existence of quantitative accept-reject criteria. To be effective, these criteria must correlate with levels of damage known to cause composite failure. Furthermore, implicit in SHM is the existence of effective remote sensing hardware and automated techniques and algorithms for interpretation of SHM data. SHM of facture critical composite structures, especially high pressure COPVs, is critical to the success of nearly every future NASA space exploration program as well as life extension of the International Space Station. It has been clearly stated that future NASA missions may not be successful without SHM [1]. Otherwise, crews will be busy addressing subsystem health issues and not focusing on the real NASA mission

Saulsberry, Regor↗
NASA NTRS1993

A review and analysis of neural networks for classification of remotely sensed multispectral imagery

A literature survey and analysis of the use of neural networks for the classification of remotely sensed multispectral imagery is presented. As part of a brief mathematical review, the backpropagation algorithm, which is the most common method of training multi-layer networks, is discussed with an emphasis on its application to pattern recognition. The analysis is divided into five aspects of neural network classification: (1) input data preprocessing, structure, and encoding; (2) output encoding and extraction of classes; (3) network architecture, (4) training algorithms; and (5) comparisons to conventional classifiers. The advantages of the neural network method over traditional classifiers are its non-parametric nature, arbitrary decision boundary capabilities, easy adaptation to different types of data and input structures, fuzzy output values that can enhance classification, and good generalization for use with multiple images. The disadvantages of the method are slow training time, inconsistent results due to random initial weights, and the requirement of obscure initialization values (e.g., learning rate and hidden layer size). Possible techniques for ameliorating these problems are discussed. It is concluded that, although the neural network method has several unique capabilities, it will become a useful tool in remote sensing only if it is made faster, more predictable, and easier to use.

Paola, Justin D.↗
NASA NTRS1991

Comparison of several system identification methods for flexible structures

In the last few years various methods of identifying structural dynamics models from modal testing data have appeared. A comparison is presented of four of these algorithms: the Eigensystem Realization Algorithm (ERA), the modified version ERA/DC where DC indicated that it makes use of data correlation, the Q-Markov Cover algorithm, and an algorithm due to Moonen, DeMoor, Vandenberghe, and Vandewalle. The comparison is made using a five mode computer module of the 20 meter Mini-Mast truss structure at NASA Langley Research Center, and various noise levels are superimposed to produced simulated data. The results show that for the example considered ERA/DC generally gives the best results; that ERA/DC is always at least as good as ERA which is shown to be a special case of ERA/DC; that Q-Markov requires the use of significantly more data than ERA/DC to produce comparable results; and that is some situations Q-Markov cannot produce comparable results.

Lew, J.-S.↗
NASA NTRS2005

Development and Testing of Data Mining Algorithms for Earth Observation

The new algorithms developed under this project included a principled procedure for classification of objects, events or circumstances according to a target variable when a very large number of potential predictor variables is available but the number of cases that can be used for training a classifier is relatively small. These "high dimensional" problems require finding a minimal set of variables -called the Markov Blanket-- sufficient for predicting the value of the target variable. An algorithm, the Markov Blanket Fan Search, was developed, implemented and tested on both simulated and real data in conjunction with a graphical model classifier, which was also implemented. Another algorithm developed and implemented in TETRAD IV for time series elaborated on work by C. Granger and N. Swanson, which in turn exploited some of our earlier work. The algorithms in question learn a linear time series model from data. Given such a time series, the simultaneous residual covariances, after factoring out time dependencies, may provide information about causal processes that occur more rapidly than the time series representation allow, so called simultaneous or contemporaneous causal processes. Working with A. Monetta, a graduate student from Italy, we produced the correct statistics for estimating the contemporaneous causal structure from time series data using the TETRAD IV suite of algorithms. Two economists, David Bessler and Kevin Hoover, have independently published applications using TETRAD style algorithms to the same purpose. These implementations and algorithmic developments were separately used in two kinds of studies of climate data: Short time series of geographically proximate climate variables predicting agricultural effects in California, and longer duration climate measurements of temperature teleconnections.

Glymour, Clark↗
NASA NTRS1996

An Analysis of Gamma-ray Burst Time Profiles from the Burst and Transient Source Experiment

This proposal requested funding to measure the durations of gamma-ray bursts (GRB) in the 4B catalog as well as to study the structure of GRB time profiles returned by the Burst And Transient Source Experiment (BATSE) on board the Compton Gamma-Ray Observatory. The duration (T90) was to be measured using the same techniques and algorithms developed by the principal investigator for the 3B data. The profile structure studies fall into the two categories of variability and fractal analyses.

Lestrade, John Patrick↗
NASA NTRS2008

Inter-comparison between AIRS and IASI through Retrieved Parameters

A State-of-the-art retrieval algorithm dealing with all-weather conditions has been applied to satellite/aircraft instruments retrieving cloud/surface and atmospheric conditions. High quality retrievals have been achieved from IASI data. Surface, cloud, and atmospheric structure and variation are well captured by IASI measurements and/or retrievals. The same retrieval algorithm is also applied to AIRS for retrieval inter-comparison. Both AIRS and IASI have a similar FOV size but AIRS has a higher horizontal resolution. AIRS data can be interpolated to IASI horizontal resolution for inter-comparison at the same geophysical locations, however a temporal variation between AIRS and IASI observations need to be considered. JAIVEx has employed aircraft to obtain the atmospheric variation filling the temporal gap between two satellites. First results show that both AIRS and IASI have a very similar vertical resolving power, atmospheric conditions are well captured by both instruments, and radiances are well calibrated. AIRS data shown in retrievals (e.g., surface emissivity and moisture) have a relatively higher noise level. Since the this type of retrieval is very sensitive to its radiance quality, retrieval products inter-comparison is an effective way to identify/compare their radiance quality, in terms of a combination of spectral resolution and noise level, and to assess instrument performance. Additional validation analyses are needed to provide more-definitive conclusions.

Zhou, Daniel K.↗
NASA NTRS1991

Comparison of several system identification methods for flexible structures

In the last few years various methods of identifying structural dynamics models from modal testing data have appeared. This paper presents a comparison of four of these algorithms: the Eigensystem Realization Algorithm (ERA), the modified version ERA/DC where DC indicates that it makes use of data correlations, the Q-Markov Cover algorithm, and an algorithm due to Moonen, DeMoor, Vandenberghe and Vandewalle. The comparison is made using a five mode computer model of the 20 meter Mini-Mast truss structure at NASA Langley Research Center, and various noise levels are superimposed to produce simulated data. The results show that for the example considered ERA/DC generally gives the best results; that ERA/DC is always at least as good as ERA which is shown to be a special case of ERA/DC; that Q-Markov requires the use of significantly more data than ERA/DC to produce comparable results; and that in some situations Q-Markov cannot produce comparable results.

Lew, J.-S.↗
NASA NTRS1983

A flexible grid embedding technique with application to the Euler equations

An automated grid embedding procedure for solution of flows about complex geometries is described. The physical domain is subdivided into regions that can accommodate easily generated grids. The grids are organized in a hierarchical structure, and communication among grids is accomplished by interpolation of the flow variables at mesh boundaries. Algorithms for locating embedded boundaries, special treatment of the embedded grids, and the data structures required for manipulating the solution data are described. The method is demonstrated by solution of the Euler equations for transonic flow about a supercritical airfoil and a flapped airfoil.

Benek, J. A.↗