Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Data Structures and Algorithms”

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

An Efficient, Multi-Layered Crown Delineation Algorithm for Mapping Individual Tree Structure Across Multiple Ecosystems

Deriving individual tree information from discrete return, small footprint LiDAR data may improve forest above ground biomass estimates, and provide tree-level information that is important in many ecological studies. Several crown delineation algorithms have been developed to extract individual tree information from LiDAR point clouds or rasterized canopy height models (CHM), but many of these algorithms have difficulty discriminating between overlapping crowns, and also may fail to detect understory trees. Our approach uses a watershed based delineation of a CHM, which is subsequently refined using the LiDAR point cloud. Individual tree detection was validated with stem mapped field data from the Smithsonian Environmental Research Center (SERC), Maryland, and on a plot and stand level through comparisons of stem density and basal area to delineated metrics at both SERC and a study area in the Sierra Nevada, California. For individual tree detection, the algorithm correctly identified 70% of dominant trees, 58% of co-dominant trees, 35% of intermediate trees and 21% of suppressed trees at SERC. The algorithm had difficulty distinguishing between crowns of small, dense understory trees of approximately the same height. Delineated crown volume alone explained 53% and 84% of the variability in basal area at the SERC and Sierra Nevada sites, respectively. The algorithm produced crown area distributions comparable to diameter at breast height (DBH) size class distributions observed in the field in both study sites. The algorithm detected understory crowns better in the conifer-dominated Sierra Nevada site than in the closed-canopy deciduous site in Maryland. The ability for the algorithm to reproduce both accurate tree size distributions and individual crown geometries in two dissimilar and complex forests suggests great promise for applicability to a wide range of forest systems.

LiDAR↗

NASTRAN thermal analyzer in a unified finite-element treatment of thermo-structural analyses

The NASTRAN thermal analyzer (NTA) which performs large-scale unified thermo-structural analyses with the NASTRAN (NASA structural analysis) computer program is described. The mathematical similitude between these two distinct disciplines of thermal and structure is examined. It serves as the theoretical basis upon which the implementation of the thermal capability in NASTRAN was accomplished. The program structure, the functional flow, the solution algorithms, the organization of an input data deck and the solution capabilities of NTA are summarized. Emphasis is placed on the interface of the unified approach in thermo-structural analyses where stresses, deflections, vibrations and bucklings induced by the effect of temperature change are of concern. Attentions are also directed to the preprocessor and post processors. As a specially designed preprocessor, the VIEW program is capable of generating exchange factors which can be output, at user's option, in formats compatible with that required by NTA. Two post processors that serve specific objectives are included. They are the thermal variance analysis and the graphical displaying capability of temperatures in color or black and white.

Lee, H. P.↗

Modal identification using single-mode projection filters and comparison with ERA and MLE results

The Single-Mode Projection Filter (SPF) is a newly developed algorithm for eigensystem parameter identification from both analytical results and test data. The SPF is formulated with a single mode only and practical for parallel processing implementation. Explicit formulations of SPF are derived for the multi-input multi-output (MIMO) system by using the orthogonal matrices of the controllability and observability matrices in the general sense. The modal parameters of SPF are initially obtained from an analytical model in modal space. The experimental data are then processed through SPF to update its modal parameters and to minimize a cost function defined by the norm of an error matrix. The updated modal parameters represent the characteristics of the test data. A two-dimensional global minimum optimization algorithm is developed and applied for the filter update by using the interval analysis method. The SPF is developed based on a single-mode subsystem and identifies only one modal frequency and one modal damping within a specified region. For an n-modes structure, n SPF can be implemented for parallel processing to reduce the computational burden. The SPF is applied to analyze the simulated data for the MAST beam structure. The estimated modal parameters are comparable to those from the Eigensystem Realization Algorithm (ERA) and repeated modal frequencies are identified. The modal analysis of the Spacecraft Control Laboratory Experiment (SCOLE) data is also performed by using the ERA and the Maximum Likelihood Estimate (MLE). The result shows that the first five modal frequencies are very close from ERA and MLE. However, there are slight disparities in the damping rates and the computational burdens are quite different among these two algorithms.

Huang, Jen-Kuang↗

Cloud-Resolving Model and GPM

Over the past twenty years, rainfall retrieval algorithms have been developed to retrieve rainfall and vertical hydrometeor structures from passive microwave observations by making use of the fact that weighting functions for various frequencies peak at different levels within a rainy atmosphere. GPROF is one of two TMI rainfall algorithms. It is physically based retrieval that finds the vertical hydrometeor profile that best fits the brightness temperatures in the available passive radiometer channels. Matching is achieved using a library of hydrometeor profiles generated by cloud-resolving models (CRMs). The hydrometeor profiles have a corresponding surface precipitation rate. The algorithm retrieves the hydrometeor profiles and associated surface rainfall using a Bayesian approach that gives the estimated expected values. The ability of CRMs to produce cloud structures that are reliable and representative of observed storms is crucial for the success of GPROF. The cloud mycrophysics are one of the keys to achieving this. In addition, CRMs have been a very useful tool for GPM-algorithm developers through Cloud-Radiation Simulations (CRS), one of the nine GPM disciplinary research themes. This paper will discuss how to generate consistent and comprehensive 4D cloud datasets from an improved (i.e., in regard to bulk and multi-moment microphysics) CRM for TRMM and GPM rainfall retrieval algorithm developers. These cloud datasets include CRM-simulated clouds and cloud systems from different geographic locations in the tropics and midlatitudes. By linking the CRM with a passive microwave radiative-transfer model and using satellite and airborne data, the performance of the "cloud physics" can be assessed and in turn modified and improved. This paper will also address how to assess and improve the performance of various latent and diabatic heating algorithms and develop an algorithm to retrieve the vertical structure of apparent moistening (Q2). Considering that the GPM will produce high (temporal and spatial) resolution heating and rainfall data, these algorithms will be used to obtain the temporal and spatial distributions of surface rainfall and the associated vertical heating and moistening profiles throughout the subtropical and midlatitudes.

Tao, Wei-Kuo↗

Three-dimensional flow over a conical afterbody containing a centered propulsive jet - A numerical simulation

The supersonic flow field over a body of revolution incident to the free stream is simulated numerically on a large, array processor (the CDC Cyber 205). The configuration is composed of a cone-cylinder forebody followed by a conical afterbody from which emanates a centered, supersonic propulsive jet. The free-stream Mach number is 2, the jet-exit Mach number is 2.5, and the jet-to-free-stream static pressure ratio is 3. Both the external flow and the exhaust are ideal air at a common total temperature. The thin-layer approximation to the time-dependent, compressible, Reynolds-averaged Navier-Stokes equations are solved using an implicit finite-difference algorithm. The data base, of 5 million words, is structured in a 'pencil' format so that efficient use of the array processor can be realized. The computer code is completely vectorized to take advantage of the data structure. Turbulence closure is achieved using an empirical algebraic eddy-viscosity model. The configuration and flow conditions correspond to published experimental tests and the computed solutions are consistent with the experimental data.

Deiwert, G. S.↗

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↗

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

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

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↗

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↗

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↗

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↗

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↗

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↗

Comparison of two matrix data structures for advanced CSM testbed applications

The first section describes data storage schemes presently used by the Computational Structural Mechanics (CSM) testbed sparse matrix facilities and similar skyline (profile) matrix facilities. The second section contains a discussion of certain features required for the implementation of particular advanced CSM algorithms, and how these features might be incorporated into the data storage schemes described previously. The third section presents recommendations, based on the discussions of the prior sections, for directing future CSM testbed development to provide necessary matrix facilities for advanced algorithm implementation and use. The objective is to lend insight into the matrix structures discussed and to help explain the process of evaluating alternative matrix data structures and utilities for subsequent use in the CSM testbed.

Regelbrugge, M. E.↗

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

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

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↗