Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive algorithm”

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 1,315 records · Page 73

Investigations on the usefulness of the Massively Parallel Processor for study of electronic properties of atomic and condensed matter systems

The usefulness of the Massively Parallel Processor (MPP) for investigation of electronic structures and hyperfine properties of atomic and condensed matter systems was explored. The major effort was directed towards the preparation of algorithms for parallelization of the computational procedure being used on serial computers for electronic structure calculations in condensed matter systems. Detailed descriptions of investigations and results are reported, including MPP adaptation of self-consistent charge extended Hueckel (SCCEH) procedure, MPP adaptation of the first-principles Hartree-Fock cluster procedure for electronic structures of large molecules and solid state systems, and MPP adaptation of the many-body procedure for atomic systems.

Das, T. P.↗

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

Advances in fluid dynamics

Various papers on advances in fluid dynamics are presented. Individual topics addressed include: nonunique solutions of the Euler equations; numerical solution of the biharmonic equation using a spectral multigrid method; finite-volume shape and placement for efficiency, accuracy, and physics; NND schemes and their application to numerical simulation of complex plume flow problems; symbolic analysis and computational algorithm construction; and velocity and mass flux distribution measurements of spherical glass beads in air flow in a 90-deg vertical-to-horizontal bend. Also discussed are: hyperbolic solution adaptive mesh generation; progress and future directions in CFD; numerical simulation of shock focusing; microbubble formation and splitting in a turbulent boundary layer for turbulence reduction; numerical study of spherical Taylor-Couette flow, trajectories of vortex lines beneath a free surface or above a plane; and a mathematical model for response of the coronary circulation to high sustained gravitational force fields.

Ballhaus, W. F., Jr.↗

Automatic releveling of calibration stands for wind tunnel force and moment measurement instrumentation

Wind tunnel force and moment measuring instrumentation at NASA LaRC are calibrated by applying NIST certified dead loads, to generate forces and moments in three orthogonal axes, in twenty five percent increments, up to full-load and down to no-load in a nine point continuous procedure, using specially built calibration stands. The measuring instruments deflect upon the application of loads. These deflections must be cancelled to minimize loading interactions. The older calibration stands, integrated with AC induction motors, or DC motors, have provisions for manually releveling the loading point after each load. A newer stand, with integrated DC stepper motors, relevels automatically under software control. It was proposed to extend automation to the old stands. An algorithm to control the unwieldy induction motors to relevel a calibration stand, to within two arcseconds of horizontal direction automatically, was developed. The system developed uses coasting prediction and load adaptation in a general type robust stability control configuration with noncoincidental feedback. Automatic releveling cuts the releveling time to approximately half of the time required to do it manually. The principal constraint for shorter times is the time constant of the angular position feedback transducer.

Perazza, Manuel Rodriguez↗

A Comparison of Three Programming Models for Adaptive Applications

We study the performance and programming effort for two major classes of adaptive applications under three leading parallel programming models. We find that all three models can achieve scalable performance on the state-of-the-art multiprocessor machines. The basic parallel algorithms needed for different programming models to deliver their best performance are similar, but the implementations differ greatly, far beyond the fact of using explicit messages versus implicit loads/stores. Compared with MPI and SHMEM, CC-SAS (cache-coherent shared address space) provides substantial ease of programming at the conceptual and program orchestration level, which often leads to the performance gain. However it may also suffer from the poor spatial locality of physically distributed shared data on large number of processors. Our CC-SAS implementation of the PARMETIS partitioner itself runs faster than in the other two programming models, and generates more balanced result for our application.

Shan, Hong-Zhang↗

Exploiting the Free Landsat Archive for Operational Monitoring of Ecosystem Condition and Change Across the Chesapeake Bay Watershed

For the first time, all imagery acquired by the Landsat series of satellites is being made available by the USGS to users at no cost. This represents a key opportunity to use Landsat in a truly operational monitoring framework: large regions of the U.S. such as the Chesapeake Bay Watershed can now be analyzed using "wall-to-wall" imagery at timescales from approximately 1 month to several years. With the future launch of the Landsat Data Continuity Mission (LDCM) and Decadal Survey missions such as the hyperspectral HyspIRI, it is imperative to develop robust processing systems to perform annual ecosystem assessments over large regions such as the Chesapeake Bay. We have been working at NASA's Goddard Space Flight Center (GSFC) to develop an integrative framework for inserting 30m, annual, Landsat based data and derived products into the existing decision support system for the Bay, with a particular focus on ecosystem condition and changes over the entire watershed. The basic goal is to use a 'stack' of Landsat imagery with 40% or less cloud cover to produce multi-date (2005-2009 period), cloud/shadow/gap-free composited surface reflectance products that will support the creation of watershed scale land cover/ use products and the monitoring of ecosystem change across the Bay. Our scientific focus extends beyond the conventional definition of land cover (i.e. a classification of vegetation type) as we propose to monitor both changes in surface type (e.g. forest to urban), vegetation structure (e.g. forest disturbance due to logging or insect damage), as well as winter crop cover. These processes represent a continuum from large, interannual changes in land cover type, to subtler, intra-annual changes associated with short-term disturbance. The free Landsat data are being processed to surface reflectance and composited using the existing Landsat Ecosystem Disturbance Adaptive Processing System here at NASA/ GSFC, and land cover products (type, tree cover, impervious cover, winter cover) are being produced using well-established decision tree and regression tree algorithms. The goal of this session is to present the data products that we have been developing to the Bay science community and to discuss potential avenues for improvements and usage of the products for decision support.

BrowndeColstoun, Eric↗

High-Speed On-Board Data Processing for Science Instruments: HOPS

The project called High-Speed On-Board Data Processing for Science Instruments (HOPS) has been funded by NASA Earth Science Technology Office (ESTO) Advanced Information Systems Technology (AIST) program during April, 2012 â€" April, 2015. HOPS is an enabler for science missions with extremely high data processing rates. In this three-year effort of HOPS, Active Sensing of CO2 Emissions over Nights, Days, and Seasons (ASCENDS) and 3-D Winds were of interest in particular. As for ASCENDS, HOPS replaces time domain data processing with frequency domain processing while making the real-time on-board data processing possible. As for 3-D Winds, HOPS offers real-time high-resolution wind profiling with 4,096-point fast Fourier transform (FFT). HOPS is adaptable with quick turn-around time. Since HOPS offers reusable user-friendly computational elements, its FPGA IP Core can be modified for a shorter development period if the algorithm changes. The FPGA and memory bandwidth of HOPS is 20 GB/sec while the typical maximum processor-to-SDRAM bandwidth of the commercial radiation tolerant high-end processors is about 130-150 MB/sec. The inter-board communication bandwidth of HOPS is 4 GB/sec while the effective processor-to-cPCI bandwidth of commercial radiation tolerant high-end boards is about 50-75 MB/sec. Also, HOPS offers VHDL cores for the easy and efficient implementation of ASCENDS and 3-D Winds, and other similar algorithms. A general overview of the 3-year development of HOPS is the goal of this presentation.

Beyon, Jeffrey↗

Interior Noise Reduction by Adaptive Feedback Vibration Control

The objective of this project is to investigate the possible use of adaptive digital filtering techniques in simultaneous, multiple-mode identification of the modal parameters of a vibrating structure in real-time. It is intended that the results obtained from this project will be used for state estimation needed in adaptive structural acoustics control. The work done in this project is basically an extension of the work on real-time single mode identification, which was performed successfully using a digital signal processor (DSP) at NASA, Langley. Initially, in this investigation the single mode identification work was duplicated on a different processor, namely the Texas Instruments TMS32OC40 DSP. The system identification results for the single mode case were very good. Then an algorithm for simultaneous two mode identification was developed and tested using analytical simulation. When it successfully performed the expected tasks, it was implemented in real-time on the DSP system to identify the first two modes of vibration of a cantilever aluminum beam. The results of the simultaneous two mode case were good but some problems were identified related to frequency warping and spurious mode identification. The frequency warping problem was found to be due to the bilinear transformation used in the algorithm to convert the system transfer function from the continuous-time domain to the discrete-time domain. An alternative approach was developed to rectify the problem. The spurious mode identification problem was found to be associated with high sampling rates. Noise in the signal is suspected to be the cause of this problem but further investigation will be needed to clarify the cause. For simultaneous identification of more than two modes, it was found that theoretically an adaptive digital filter can be designed to identify the required number of modes, but the algebra became very complex which made it impossible to implement in the DSP system used in this study. The on-line identification algorithm developed in this research will be useful in constructing a state estimator for feedback vibration control.

Lim, Tae W.↗

An Efficient Area-Based Algorithm for SAR Radiometric Terrain Correction and Map Projection

This article presents a projection algorithm based on the representation of radar samples as area elements, rather than point elements as traditionally done in previous works. Each area element in the geographic grid (geogrid) is associated with a set of samples in the radar grid that intersect completely or partially the area element according to the topography and the radar geometry. Accurate geocoding with adaptive multi-looking is achieved by successively assigning the weighted average of the radar samples to the corresponding geogrid elements. Analogously, the slant-range projection of geocoded data is improved by projecting the geogrid pixels onto the radar grid according to their projected area. When our slant-range projection approach is used within previously-published radiometric terrain correction (RTC) algorithms, the processing time is significantly reduced, performing 3.6 to 5.2 times faster over multi-looked data and up to 8.9 over single-look data. We demonstrate the strength of the area projection algorithm for RTC and geocoding using UAVSAR and Sentinel-1 data, and evaluate the results in the context of the upcoming NISAR mission.

Shiroma, Gustavo H↗

On the Hilbert-Huang Transform Theoretical Developments

One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as linearity, of being stationary, and of satisfying the Dirichlet conditions. A recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT), proposes a novel approach to the solution for the nonlinear class of spectrum analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposition data, the HHT allows spectrum analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a near orthogonal adaptive basis, a basis that is derived from the data. The IMFs can be further analyzed for spectrum interpretation by the classical Hilbert Transform. A new engineering spectrum analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications post additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs near orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the developments of new HHT processing options, such as real-time and 2-D processing using Field Programmable Array (FPGA) computational resources, enhanced HHT synthesis, and broaden the scope of HHT applications for signal processing.

Kizhner, Semion↗

On Certain Theoretical Developments Underlying the Hilbert-Huang Transform

One of the main traditional tools used in scientific and engineering data spectral analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as being linear and stationary, and of satisfying the Dirichlet conditions. A recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT), proposes a novel approach to the solution for the nonlinear class of spectral analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposed data, the HHT allows spectral analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real-value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a nearly orthogonal derived from the data (adaptive) basis. The IMFs can be further analyzed for spectrum content by using the classical Hilbert Transform. A new engineering spectral analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications pose additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs nearly orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the development of new HHT processing options, such as real-time and 2-D processing using Field Programmable Gate Array (FPGA) computational resources,

Kizhner, Semion↗

An improved algorithm for optimum structural design with multiple frequency constraints

An optimality criterion (OC) method for minimum-weight design of structures having multiple constraints on natural frequencies is presented. In this work a new resizing strategy is developed based on relaxation techniques. A computationally adaptive control parameter is used in conjunction with existing OC recursive formulae to promote convergence of optimum structural designs. Some considerations regarding the coupling of the modified Aitken accelerator with the OC method are discussed. Improved and rapidly converged minimum-weight designs are obtained when using an under-relaxed recursive scheme combined with the modified Aitken accelerator.

Mcgee, Oliver G.↗

MODIS Collection 6 MAIAC Algorithm

This paper describes the latest version of the algorithm MAIAC (Multi-Angle Implementation of Atmospheric Correction) used for processing the MODIS (Moderate-resolution Imaging Spectroradiometer) Collection6 data record. Since initial publication in 2011-2012, MAIAC has changed considerably to adapt to global processing and improve cloud/snow detection, aerosol retrievals and atmospheric correction of MODIS data. The main changes include (1) transition from a 25 to 1 km scale for retrieval of the spectral regression coefficient (SRC) which helped to remove occasional blockiness at 25 km scale in the aerosol optical depth (AOD) and in the surface reflectance, (2) continuous improvements of cloud detection, (3) introduction of smoke and dust tests to discriminate absorbing fine- and coarse mode aerosols, (4) adding over-water processing, (5) general optimization of the LUT (LookUp-Table)-based radiative transfer for the global processing, and others. MAIAC provides an interdisciplinary suite of atmospheric and land products, including cloud mask (CM), column water vapor (CWV), AOD at 0.47 and 0.55 m, aerosol type (background, smoke or dust) and fine-mode fraction over water; spectral bidirectional reflectance factors (BRF), parameters of Ross-thick Lisparse (RTLS) bidirectional reflectance distribution function (BRDF) model and instantaneous albedo. For snow-covered surfaces, we provide subpixel snow fraction and snow grain size. All products come in standard HDF4 (software library) format at 1 km resolution, except for BRF, which is also provided at 500 m resolution on a sinusoidal grid adopted by the MODIS Land team. All products are provided on per-observation basis in daily files except for the BRDF/Albedo product, which is reported every 8 days. Because MAIAC uses a time series approach, BRDF/Albedo is naturally gap-filled over land where missing values are filled-in with results from the previous retrieval. While the BRDF model is reported for MODIS Land bands 1-7 and ocean band 8, BRF is reported for both land and ocean bands 1-12. This paper focuses on MAIAC cloud detection, aerosol retrievals and atmospheric correction and describes MCD19 data products and quality assurance (QA) flags.

MAIAC Algorithm↗

A successive overrelaxation iterative technique for an adaptive equalizer

An adaptive strategy for the equalization of pulse-amplitude-modulated signals in the presence of intersymbol interference and additive noise is reported. The successive overrelaxation iterative technique is used as the algorithm for the iterative adjustment of the equalizer coefficents during a training period for the minimization of the mean square error. With 2-cyclic and nonnegative Jacobi matrices substantial improvement is demonstrated in the rate of convergence over the commonly used gradient techniques. The Jacobi theorems are also extended to nonpositive Jacobi matrices. Numerical examples strongly indicate that the improvements obtained for the special cases are possible for general channel characteristics. The technique is analytically demonstrated to decrease the mean square error at each iteration for a large range of parameter values for light or moderate intersymbol interference and for small intervals for general channels. Analytically, convergence of the relaxation algorithm was proven in a noisy environment and the coefficient variance was demonstrated to be bounded.

Kosovych, O. S.↗

Edge-following algorithm for tracking geological features

Sequential edge-tracking algorithm employs circular scanning to point permit effective real-time tracking of coastlines and rivers from earth resources satellites. Technique eliminates expensive high-resolution cameras. System might also be adaptable for application in monitoring automated assembly lines, inspecting conveyor belts, or analyzing thermographs, or x ray images.

Tietz, J. C.↗

PASS: A computer program for Preliminary Aircraft Structural Synthesis

A computer code for Preliminary Aircraft Structural Synthesis provides rapid and accurate analysis for aircraft structures that can be adequately modeled by beam finite elements. The philosophy used in developing the program was to provide a basic framework that can be used for structural synthesis. It is anticipated that a user will need to add detail to this framework in order to perform his specific task. With this philosophy in mind, the program was written so that it is easily divided into segments, thereby making it readily adaptable. The theoretical portion of this manual describes the basic structure of the program and details the development of the unique beam element that is used. The present capability of the algorithm is stated and suggestions are made regarding enhancements to this capability. User information is also given that provides an overview of the program's construction, identifies the required inputs, describes the program output, provides some comments on the program use, and exhibits results for a simple example.

Johnson, E. H.↗

Investigation of the Multiple Method Adaptive Control (MMAC) method for flight control systems

The stochastic adaptive control of the NASA F-8C digital-fly-by-wire aircraft using the multiple model adaptive control (MMAC) method is presented. The selection of the performance criteria for the lateral and the longitudinal dynamics, the design of the Kalman filters for different operating conditions, the identification algorithm associated with the MMAC method, the control system design, and simulation results obtained using the real time simulator of the F-8 aircraft at the NASA Langley Research Center are discussed.

Athans, M.↗

A data compression technique for synthetic aperture radar images

A data compression technique is developed for synthetic aperture radar (SAR) imagery. The technique is based on an SAR image model and is designed to preserve the local statistics in the image by an adaptive variable rate modification of block truncation coding (BTC). A data rate of approximately 1.6 bit/pixel is achieved with the technique while maintaining the image quality and cultural (pointlike) targets. The algorithm requires no large data storage and is computationally simple.

Frost, V. S.↗