Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Infrared remote sensing of the vertical and horizontal distribution of clouds

An algorithm has been developed to derive the horizontal and vertical distribution of clouds from the same set of infrared radiance data used to retrieve atmospheric temperature profiles. The method leads to the determination of the vertical atmospheric temperature structure and the cloud distribution simultaneously, providing information on heat sources and sinks, storage rates and transport phenomena in the atmosphere. Experimental verification of this algorithm was obtained using the 15-micron data measured by the NOAA-VTPR temperature sounder. After correcting for water vapor emission, the results show that the cloud cover derived from 15-micron data is less than that obtained from visible data.

Chahine, M. T.↗
NASA NTRS1988

An adaptive identification and control scheme for large space structures

A unified identification and control scheme capable of achieving space at form performance objectives under nominal or failure conditions is described. Preliminary results are also presented, showing that the methodology offers much promise for effective robust control of large space structures. The control method is a multivariable, adaptive, output predictive controller called Model Predictive Control (MPC). MPC uses a state space model and input reference trajectories of set or tracking points to adaptively generate optimum commands. For a fixed model, MPC processes commands with great efficiency, and is also highly robust. A key feature of MPC is its ability to control either nonminimum phase or open loop unstable systems. As an output controller, MPC does not explicitly require full state feedback, as do most multivariable (e.g., Linear Quadratic) methods. Its features are very useful in LSS operations, as they allow non-collocated actuators and sensors. The identification scheme is based on canonical variate analysis (CVA) of input and output data. The CVA technique is particularly suited for the measurement and identification of structural dynamic processes - that is, unsteady transient or dynamically interacting processes such as between aerodynamics and structural deformation - from short, noisy data. CVA is structured so that the identification can be done in real or near real time, using computationally stable algorithms. Modeling LSS dynamics in 1-g laboratories has always been a major impediment not only to understanding their behavior in orbit, but also to controlling it. In cases where the theoretical model is not confirmed, current methods provide few clues concerning additional dynamical relationships that are not included in the theoretical models. CVA needs no a priori model data, or structure; all statistically significant dynamical states are determined using natural, entropy-based methods. Heretofore, a major limitation in applying adaptive controllers to LSS problems has been the requirement for accurate models. We feel that MPC coupled with the CVA identification scheme will resolve this limitation. The results are based on research performed under an SBIR grant, administered by the Air Force Office of Scientific Research.

Carroll, J. V.↗
NASA NTRS1998

Isosurface Extraction in Time-Varying Fields Using a Temporal Hierarchical Index Tree

Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to large-scale time-varying fields, the storage overhead incurred from storing the search index often becomes overwhelming. this paper proposes an algorithm for locating isosurface cells in time-varying fields. We devise a new data structure, called Temporal Hierarchical Index Tree, which utilizes the temporal coherence that exists in a time-varying field and adoptively coalesces the cells' extreme values over time; the resulting extreme values are then used to create the isosurface cell search index. For a typical time-varying scalar data set, not only does this temporal hierarchical index tree require much less storage space, but also the amount of I/O required to access the indices from the disk at different time steps is substantially reduced. We illustrate the utility and speed of our algorithm with data from several large-scale time-varying CID simulations. Our algorithm can achieve more than 80% of disk-space savings when compared with the existing techniques, while the isosurface extraction time is nearly optimal.

Shen, Han-Wei↗
NASA NTRS1969

Towards an optimal inversion method for remote atmospheric sensing

The inference of atmospheric structure from satellite radiometric observations requires an inversion algorithm. A variety of techniques was spawned to meet these demands. One class, the nonlinear inversion methods, copes with the problem of data noise. Unlike linear techniques which require a priori data smoothing, the nonlinear method can be applied directly to raw data. The algorithm discriminates the noise input by resolving the inferences into two types of solution, associating the real roots with atmospheric structure while ascribing the imaginary roots to noise.

King, J. I. F.↗
NASA NTRS1992

A consistent-mode indicator for the eigensystem realization algorithm

A new method is described for assessing the consistency of structural modal parameters identified with the Eigensystem Realization Algorithm. Identification results show varying consistency in practice due to many sources including high modal density, nonlinearity, and inadequate excitation. Consistency is considered to be a reliable indicator of accuracy. The new method is the culmination of many years of experience in developing a practical implementation of the Eigensystem Realization Algorithm. The effectiveness of the method is illustrated using data from NASA Langley's Controls-Structures-Interaction Evolutionary Model.

Pappa, R. S.↗
NASA NTRS1994

An implementation of a tree code on a SIMD, parallel computer

We describe a fast tree algorithm for gravitational N-body simulation on SIMD parallel computers. The tree construction uses fast, parallel sorts. The sorted lists are recursively divided along their x, y and z coordinates. This data structure is a completely balanced tree (i.e., each particle is paired with exactly one other particle) and maintains good spatial locality. An implementation of this tree-building algorithm on a 16k processor Maspar MP-1 performs well and constitutes only a small fraction (approximately 15%) of the entire cycle of finding the accelerations. Each node in the tree is treated as a monopole. The tree search and the summation of accelerations also perform well. During the tree search, node data that is needed from another processor is simply fetched. Roughly 55% of the tree search time is spent in communications between processors. We apply the code to two problems of astrophysical interest. The first is a simulation of the close passage of two gravitationally, interacting, disk galaxies using 65,636 particles. We also simulate the formation of structure in an expanding, model universe using 1,048,576 particles. Our code attains speeds comparable to one head of a Cray Y-MP, so single instruction, multiple data (SIMD) type computers can be used for these simulations. The cost/performance ratio for SIMD machines like the Maspar MP-1 make them an extremely attractive alternative to either vector processors or large multiple instruction, multiple data (MIMD) type parallel computers. With further optimizations (e.g., more careful load balancing), speeds in excess of today's vector processing computers should be possible.

Olson, Kevin M.↗
DOE OSTI2021

Recent Advances in Small Angle X-ray Scattering for Superlattice Study

Small-angle x-ray scattering is used for the structure determination of superlattice for its superior resolution, nondestructive nature, and high penetration power of x rays. With the advent of high brilliance x-ray sources and innovative computing algorithms, there have been notable advances in small angle x-ray scattering analysis of superlattices. High brilliance x-ray beams have made data analyses less model-dependent. Additionally, novel data acquisition systems are faster and more competitive than ever before, enabling a more accurate mapping of the superlattices' reciprocal space. Fast and high-throughput computing systems and algorithms also make possible advanced analysis methods, including iterative phasing algorithms, non-parameterized fitting of scattering data with molecular dynamics simulations, and the use of machine learning algorithms. As a result, solving nanoscale structures with high resolutions has become an attainable task. In this review, we highlight new developments in the field and introduce their applications for the analysis of nanoscale ordered structures, including nanoparticle supercrystals, nanoscale lithography patterns, and supramolecular self-assemblies. Particularly, we highlight the reciprocal space mapping techniques and the use of iterative phase retrieval algorithms. We also cover coherent-beam-based small angle x-ray scattering techniques such as ptychography and ptycho-tomography in view of the traditional small angle x-ray scattering perspective.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1995

Estimation of Boreal Forest Biomass Using Spaceborne SAR Systems

In this paper, we report on the use of a semiempirical algorithm derived from a two layer radar backscatter model for forest canopies. The model stratifies the forest canopy into crown and stem layers, separates the structural and biometric attributes of the canopy. The structural parameters are estimated by training the model with polarimetric SAR (synthetic aperture radar) data acquired over homogeneous stands with known above ground biomass. Given the structural parameters, the semi-empirical algorithm has four remaining parameters, crown biomass, stem biomass, surface soil moisture, and surface rms height that can be estimated by at least four independent SAR measurements. The algorithm has been used to generate biomass maps over the entire images acquired by JPL AIRSAR and SIR-C SAR systems. The semi-empirical algorithms are then modified to be used by single frequency radar systems such as ERS-1, JERS-1, and Radarsat. The accuracy. of biomass estimation from single channel radars is compared with the case when the channels are used together in synergism or in a polarimetric system.

Saatchi, Sassan↗
NASA NTRS1990

Multirate sampled-data yaw-damper and modal suppression system design

A multirate control law synthesized algorithm based on an infinite-time quadratic cost function, was developed along with a method for analyzing the robustness of multirate systems. A generalized multirate sampled-data control law structure (GMCLS) was introduced. A new infinite-time-based parameter optimization multirate sampled-data control law synthesis method and solution algorithm were developed. A singular-value-based method for determining gain and phase margins for multirate systems was also developed. The finite-time-based parameter optimization multirate sampled-data control law synthesis algorithm originally intended to be applied to the aircraft problem was instead demonstrated by application to a simpler problem involving the control of the tip position of a two-link robot arm. The GMCLS, the infinite-time-based parameter optimization multirate control law synthesis method and solution algorithm, and the singular-value based method for determining gain and phase margins were all demonstrated by application to the aircraft control problem originally proposed for this project.

Berg, Martin C.↗
NASA NTRS2010

ICER-3D Hyperspectral Image Compression Software

Software has been developed to implement the ICER-3D algorithm. ICER-3D effects progressive, three-dimensional (3D), wavelet-based compression of hyperspectral images. If a compressed data stream is truncated, the progressive nature of the algorithm enables reconstruction of hyperspectral data at fidelity commensurate with the given data volume. The ICER-3D software is capable of providing either lossless or lossy compression, and incorporates an error-containment scheme to limit the effects of data loss during transmission. The compression algorithm, which was derived from the ICER image compression algorithm, includes wavelet-transform, context-modeling, and entropy coding subalgorithms. The 3D wavelet decomposition structure used by ICER-3D exploits correlations in all three dimensions of sets of hyperspectral image data, while facilitating elimination of spectral ringing artifacts, using a technique summarized in "Improving 3D Wavelet-Based Compression of Spectral Images" (NPO-41381), NASA Tech Briefs, Vol. 33, No. 3 (March 2009), page 7a. Correlation is further exploited by a context-modeling subalgorithm, which exploits spectral dependencies in the wavelet-transformed hyperspectral data, using an algorithm that is summarized in "Context Modeler for Wavelet Compression of Hyperspectral Images" (NPO-43239), which follows this article. An important feature of ICER-3D is a scheme for limiting the adverse effects of loss of data during transmission. In this scheme, as in the similar scheme used by ICER, the spatial-frequency domain is partitioned into rectangular error-containment regions. In ICER-3D, the partitions extend through all the wavelength bands. The data in each partition are compressed independently of those in the other partitions, so that loss or corruption of data from any partition does not affect the other partitions. Furthermore, because compression is progressive within each partition, when data are lost, any data from that partition received prior to the loss can be used to reconstruct that partition at lower fidelity. By virtue of the compression improvement it achieves relative to previous means of onboard data compression, this software enables (1) increased return of hyperspectral scientific data in the presence of limits on the rates of transmission of data from spacecraft to Earth via radio communication links and/or (2) reduction in spacecraft radio-communication power and/or cost through reduction in the amounts of data required to be downlinked and stored onboard prior to downlink. The software is also suitable for compressing hyperspectral images for ground storage or archival purposes.

Xie, Hua↗
NASA NTRS1984

Topological grid structure - A data structure for earth science modeling

The automated analysis of land surface features is increasingly important to earth scientists. User-friendly algorithms for studying these features can be integrated into geographic information systems through the use of topological grid structure, which maintains the simplicity and transportability of standard grid structure while providing the essential capability to treat groups of contiguous, identically-classified pixels (corresponding to lakes, forests, fields, etc.) as distinct spatial entities.

Goldberg, M.↗
DOE OSTI2022

Sample IEEE123 Bus system for OEDI SI

Time series load and PV data from an IEEE123 bus system. An example electrical system, named the OEDI SI feeder, is used to test the workflow in a co-simulation. The system used is the IEEE123 test system, which is a well studied test system (see link below to IEEE PES Test Feeder), but some modifications were made to it to add some solar power modules and measurements on the system. The aim of this project is to create an easy-to-use platform where various types of analytics can be performed on a wide range of electrical grid datasets. The aim is to establish an open-source library of algorithms that universities, national labs and other developers can contribute to which can be used on both open-source and proprietary grid data to improve the analysis of electrical distribution systems for the grid modeling community. OEDI Systems Integration (SI) is a grid algorithms and data analytics API created to standardize how data is sent between different modules that are run as part of a co-simulation. The readme file included in the S3 bucket provides information about the directory structure and how to use the algorithms. The sensors.json file is used to define the measurement locations.

123 bus↗
NASA NTRS2004

Filtering in Hybrid Dynamic Bayesian Networks

We demonstrate experimentally that inference in a complex hybrid Dynamic Bayesian Network (DBN) is possible using the 2 - T i e Slice DBN (2T-DBN) from [Koller & Lerner, 20001 to model fault detection in a watertank system. In [Koller & Lerner, 20001 a generic Particle Filter (PF) is used for inference. We extend the experiment and perform approximate inference using The Extended Kalman Filter (EKF) and the Unscented Kalman Filter (UKF). Furthermore, we combine these techniques in a 'non-strict' Rao-Blackwellisation framework and apply it to the watertank system. We show that UKF and UKF in a PF framework outperfom the generic PF, EKF and EKF in a PF framework with respect to accuracy and robustness in terms of estimation RMSE. Especially we demonstrate the superiority of UKF in a PF framework when our beliefs of how data was generated are wrong. We also show that the choice of network structure is very important for the performance of the generic PF and the EKF algorithms, but not for the UKF algorithms. Furthermore, we investigate the influence of data noise in the water[ank simulation. Theory and implementation is based on the theory presented.

Andersen, Morten Nonboe↗
NASA NTRS1993

Adaptive laser link reconfiguration using constraint propagation

This paper describes Harris AI research performed on the Adaptive Link Reconfiguration (ALR) study for Rome Lab, and focuses on the application of constraint propagation to the problem of link reconfiguration for the proposed space based Strategic Defense System (SDS) Brilliant Pebbles (BP) communications system. According to the concept of operations at the time of the study, laser communications will exist between BP's and to ground entry points. Long-term links typical of RF transmission will not exist. This study addressed an initial implementation of BP's based on the Global Protection Against Limited Strikes (GPALS) SDI mission. The number of satellites and rings studied was representative of this problem. An orbital dynamics program was used to generate line-of-site data for the modeled architecture. This was input into a discrete event simulation implemented in the Harris developed COnstraint Propagation Expert System (COPES) Shell, developed initially on the Rome Lab BM/C3 study. Using a model of the network and several heuristics, the COPES shell was used to develop the Heuristic Adaptive Link Ordering (HALO) Algorithm to rank and order potential laser links according to probability of communication. A reduced set of links based on this ranking would then be used by a routing algorithm to select the next hop. This paper includes an overview of Constraint Propagation as an Artificial Intelligence technique and its embodiment in the COPES shell. It describes the design and implementation of both the simulation of the GPALS BP network and the HALO algorithm in COPES. This is described using a 59 Data Flow Diagram, State Transition Diagrams, and Structured English PDL. It describes a laser communications model and the heuristics involved in rank-ordering the potential communication links. The generation of simulation data is described along with its interface via COPES to the Harris developed View Net graphical tool for visual analysis of communications networks. Conclusions are presented, including a graphical analysis of results depicting the ordered set of links versus the set of all possible links based on the computed Bit Error Rate (BER). Finally, future research is discussed which includes enhancements to the HALO algorithm, network simulation, and the addition of an intelligent routing algorithm for BP.

Crone, M. S.↗
NASA NTRS1982

Experiences with explicit finite-difference schemes for complex fluid dynamics problems on STAR-100 and CYBER-203 computers

Several two- and three-dimensional external and internal flow problems solved on the STAR-100 and CYBER-203 vector processing computers are described. The flow field was described by the full Navier-Stokes equations which were then solved by explicit finite-difference algorithms. Problem results and computer system requirements are presented. Program organization and data base structure for three-dimensional computer codes which will eliminate or improve on page faulting, are discussed. Storage requirements for three-dimensional codes are reduced by calculating transformation metric data in each step. As a result, in-core grid points were increased in number by 50% to 150,000, with a 10% execution time increase. An assessment of current and future machine requirements shows that even on the CYBER-205 computer only a few problems can be solved realistically. Estimates reveal that the present situation is more storage limited than compute rate limited, but advancements in both storage and speed are essential to realistically calculate three-dimensional flow.

Kumar, A.↗
NASA NTRS1986

Systolic VLSI for Kalman filters

A novel two-dimensional parallel computing method for real-time Kalman filtering is presented. The mathematical formulation of a Kalman filter algorithm is rearranged to be the type of Faddeev algorithm for generalizing signal processing. The data flow mapping from the Faddeev algorithm to a two-dimensional concurrent computing structure is developed. The architecture of the resulting processor cells is regular, simple, expandable, and therefore naturally suitable for VLSI chip implementation. The computing methodology and the two-dimensional systolic arrays are useful for Kalman filter applications as well as other matrix/vector based algebraic computations.

Yeh, H.-G.↗
NASA NTRS1989

Adaptive clutter rejection filters for airborne Doppler weather radar applied to the detection of low altitude windshear

An optimum adaptive clutter rejection filter for use with airborne Doppler weather radar is presented. The radar system is being designed to operate at low-altitudes for the detection of windshear in an airport terminal area where ground clutter returns may mask the weather return. The coefficients of the adaptive clutter rejection filter are obtained using a complex form of a square root normalized recursive least squares lattice estimation algorithm which models the clutter return data as an autoregressive process. The normalized lattice structure implementation of the adaptive modeling process for determining the filter coefficients assures that the resulting coefficients will yield a stable filter and offers possible fixed point implementation. A 10th order FIR clutter rejection filter indexed by geographical location is designed through autoregressive modeling of simulated clutter data. Filtered data, containing simulated dry microburst and clutter return, are analyzed using pulse-pair estimation techniques. To measure the ability of the clutter rejection filters to remove the clutter, results are compared to pulse-pair estimates of windspeed within a simulated dry microburst without clutter. In the filter evaluation process, post-filtered pulse-pair width estimates and power levels are also used to measure the effectiveness of the filters. The results support the use of an adaptive clutter rejection filter for reducing the clutter induced bias in pulse-pair estimates of windspeed.

Keel, Byron M.↗
NASA NTRS1994

Computer code for controller partitioning with IFPC application: A user's manual

A user's manual for the computer code for partitioning a centralized controller into decentralized subcontrollers with applicability to Integrated Flight/Propulsion Control (IFPC) is presented. Partitioning of a centralized controller into two subcontrollers is described and the algorithm on which the code is based is discussed. The algorithm uses parameter optimization of a cost function which is described. The major data structures and functions are described. Specific instructions are given. The user is led through an example of an IFCP application.

Schmidt, Phillip H.↗