Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and theoretical developments”

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 289 records · Page 16

Robustness of continuous-time adaptive control algorithms in the presence of unmodeled dynamics

This paper examines the robustness properties of existing adaptive control algorithms to unmodeled plant high-frequency dynamics and unmeasurable output disturbances. It is demonstrated that there exist two infinite-gain operators in the nonlinear dynamic system which determines the time-evolution of output and parameter errors. The pragmatic implications of the existence of such infinite-gain operators is that: (1) sinusoidal reference inputs at specific frequencies and/or (2) sinusoidal output disturbances at any frequency (including dc), can cause the loop gain to increase without bound, thereby exciting the unmodeled high-frequency dynamics, and yielding an unstable control system. Hence, it is concluded that existing adaptive control algorithms as they are presented in the literature referenced in this paper, cannot be used with confidence in practical designs where the plant contains unmodeled dynamics because instability is likely to result. Further understanding is required to ascertain how the currently implemented adaptive systems differ from the theoretical systems studied here and how further theoretical development can improve the robustness of adaptive controllers.

Rohrs, C. E.↗

Geometric-Optical Modeling of Directional Thermal Radiance for Improvement of Land Surface Temperature Retrievals from MODIS, ASTER, and Landsat-7 Instruments

The general objectives of this project were to improve understanding of the directional emittance properties of land surfaces in the thermal infrared (TIR) region of the electro-magnetic spectrum. To accomplish these objectives our research emphasized a combination of theoretical model development and empirical studies designed to improve land surface temperature (LST) retrievals from space-borne remote sensing instruments. Following the proposal, the main tasks for this project were to: (1) Participate in field campaigns; (2) Acquire and process field, aircraft, and ancillary data; (3) Develop and refine models of LST emission; (4) Develop algorithms for LST retrieval; and (5) Explore LST retrieval methods for use in energy balance models. In general all of these objectives were addressed, and for the most part achieved. The main results from this project are described in the publications arising from this effort. We summarize our efforts related to each of the objectives.

Li, Xiaowen↗

Advanced computing

Advanced concepts in hardware, software and algorithms are being pursued for application in next generation space computers and for ground based analysis of space data. The research program focuses on massively parallel computation and neural networks, as well as optical processing and optical networking which are discussed under photonics. Also included are theoretical programs in neural and nonlinear science, and device development for magnetic and ferroelectric memories.

Source record↗

Binary tree eigen solver in finite element analysis

This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

Akl, F. A.↗

Collision detection for spacecraft proximity operations

Collision Detection for Spacecraft Proximity Operations This thesis describes the development of a new collision detection algorithm to be used when two spacecraft are operating in the same vicinity. The two spacecraft are modelled as unions of convex polyhedra, where the polyhedron resulting from the union may be either convex or nonconvex. The relative motion of the two spacecraft is assumed to be such that one vehicle is moving with constant linear and angular velocity with respect to the other. The algorithm determines if a collision is possible and, if so, predicts the time when the collision will take place. The theoretical basis for the new collision detection algorithm is the C-function formulation of the configuration space approach recently introduced by researchers in robotics. Three different types of C-functions are defined that model the contacts between the vertices, edges, and faces of the polyhedra representing the two spacecraft. These C-functions are used to formulate three "collision" conditions. The first of these conditions limits the points representing potential collisions to the zeros of the C-functions. The new algorithm is fundamentally a search for the smallest zero of any C-function that satisfies the second and third collision conditions. The C-functions are shown to be transcendental functions of time for the assumed trajectory of the moving spacecraft. The zeros of these functions cannot be expressed in dosed form. Therefore, numerical search procedures are developed to find aLl of the zeros of a C-function in specified bounded intervals of time. These bounded intervals of time are found by examining the second and third collision conditions. The capabilities of the new algorithm are demonstrated for several example cases. These include examples of collisions determined by zeros of each of the three different types of C-functions. In addition to predicting the time of first contact of the polyhedra, the algorithm identifies the features of the two polyhedra that are touching at this time. The new collision detection algorithm is the first such algorithm that is capable of solving the collision detection problem exactly for the case where the moving object has constant linear and angular velocities. This is a significant improvement on previous collision detection algorithms described in the literature. In particular, the ability to handle constant angular velocity represents a more realistic type of rotational motion than those which have been used in other algorithms.

Robin M Vaughan↗

High Speed Research Noise Prediction Code (HSRNOISE) User's and Theoretical Manual

This report describes a computer program, HSRNOISE, that predicts noise levels for a supersonic aircraft powered by mixed flow turbofan engines with rectangular mixer-ejector nozzles. It fully documents the noise prediction algorithms, provides instructions for executing the HSRNOISE code, and provides predicted noise levels for the High Speed Research (HSR) program Technology Concept (TC) aircraft. The component source noise prediction algorithms were developed jointly by Boeing, General Electric Aircraft Engines (GEAE), NASA and Pratt & Whitney during the course of the NASA HSR program. Modern Technologies Corporation developed an alternative mixer ejector jet noise prediction method under contract to GEAE that has also been incorporated into the HSRNOISE prediction code. Algorithms for determining propagation effects and calculating noise metrics were taken from the NASA Aircraft Noise Prediction Program.

Golub, Robert↗

A combined surface/volume scattering retracking algorithm for ice sheet satellite altimetry

An algorithm that is based upon a combined surface-volume scattering model is developed. It can be used to retrack individual altimeter waveforms over ice sheets. An iterative least-squares procedure is used to fit the combined model to the return waveforms. The retracking algorithm comprises two distinct sections. The first generates initial model parameter estimates from a filtered altimeter waveform. The second uses the initial estimates, the theoretical model, and the waveform data to generate corrected parameter estimates. This retracking algorithm can be used to assess the accuracy of elevations produced from current retracking algorithms when subsurface volume scattering is present. This is extremely important so that repeated altimeter elevation measurements can be used to accurately detect changes in the mass balance of the ice sheets. By analyzing the distribution of the model parameters over large portions of the ice sheet, regional and seasonal variations in the near-surface properties of the snowpack can be quantified.

Davis, Curt H.↗

Information-Theoretic Exploration of Multivariate Time-Varying Image Databases

Modern scientific simulations produce very large datasets, making interactive exploration of such data computationally prohibitive. An increasingly common data reduction technique is to store visualizations and other data extracts in a database. The Cinema project is one such approach, storing visualizations in an image database for post hoc exploration and interactive image-based analysis. This work focuses on developing efficient algorithms that can quantify various types of multivariate dependencies existing within multi-variable datasets. It applies specific mutual information measures for the quantification of salient regions from multivariate image data. Here, using such information measures, the opacity of the images is modulated so that the salient regions are automatically highlighted and the domain scientists can interactively explore the most relevant regions for scientific discovery.

97 MATHEMATICS AND COMPUTING↗

Far-Field Lorenz-Mie Scattering in an Absorbing Host Medium: Theoretical Formalism and FORTRAN Program

In this paper we make practical use of the recently developed first-principles approach to electromagnetic scattering by particles immersed in an unbounded absorbing host medium. Specifically, we introduce an actual computational tool for the calculation of pertinent far-field optical observables in the context of the classical Lorenzâ€"Mie theory. The paper summarizes the relevant theoretical formalism, explains various aspects of the corresponding numerical algorithm, specifies the input and output parameters of a FORTRAN program available at https://www.giss.nasa.gov/staff/mmishchenko/Lorenz-Mie.html, and tabulates benchmark results useful for testing purposes. This public-domain FORTRAN program enables one to solve the following two important problems: (i) simulate theoretically the reading of a remote well-collimated radiometer measuring electromagnetic scattering by an individual spherical particle or a small random group of spherical particles; and (ii) compute the single-scattering parameters that enter the vector radiative transfer equation derived directly from the Maxwell equations.

Far-field electromagnetic scattering; Absorbing ho↗

Morphological descriptors of nanoparticles: The link between atomistic structures and x-ray absorption spectra

Understanding and quantifying the morphology of nanoparticles are essential for linking their atomic structure to diverse applications and verifying theoretical models. While experimental information on the structure of nanoparticles in the size range below ∼5 nm can be extracted from x-ray absorption spectroscopy using a small number of descriptors—most commonly coordination numbers—developing an understanding of morphology descriptors from experimental data remains a challenge. Here, in this study, we introduce NanoGene, a genetic algorithm-based method for generating structurally diverse nanoparticle models guided by user-defined descriptors. We establish correlations among structural, size-related, and morphological descriptors and demonstrate how experimentally accessible parameters, such as coordination numbers, can be leveraged to infer otherwise inaccessible ones, such as the generalized coordination number or particle oblateness. Principal component and clustering analyses reveal the relative importance of descriptors, with the number of atoms emerging as a key discriminant of the nanoparticle structure. By providing both the methodology and an extensive dataset of nanoparticle geometries, this work offers a practical foundation for descriptor-based analysis and interpretation of experimental observations, bridging the gap between local atomic coordinates and global morphological characterization.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Secondary pattern computation of an offset reflector antenna

Reflector antennas are widely used in communications satellite systems because they provide high gain at low cost. In analyzing reflector antennas the computation of the secondary pattern is the main concern. A computer program for calculating the secondary pattern of an offset reflector has been developed and implemented at the NASA Lewis Research Center. The theoretical foundation for this program is based on the use of geometrical optics to describe the fields from the feed to the reflector surface and to the aperture plane. The resulting aperture field distribution is then transformed to the far-field zone by the fast Fourier transform algorithm. Comparing this technique with other well-known techniques (the geometrical theory of diffraction, physical optics (Jacobi-Bessel), etc.) shows good agreement for large (diameter of 100 lambda or greater) reflector antennas.

Acosta, R. J.↗

Space Shuttle Main Engine Propellant Path Leak Detection Using Sequential Image Processing

Initial research in this study using theoretical radiation transport models established that the occurrence of a leak is accompanies by a sudden but sustained change in intensity in a given region of an image. In this phase, temporal processing of video images on a frame-by-frame basis was used to detect leaks within a given field of view. The leak detection algorithm developed in this study consists of a digital highpass filter cascaded with a moving average filter. The absolute value of the resulting discrete sequence is then taken and compared to a threshold value to produce the binary leak/no leak decision at each point in the image. Alternatively, averaging over the full frame of the output image produces a single time-varying mean value estimate that is indicative of the intensity and extent of a leak. Laboratory experiments were conducted in which artificially created leaks on a simulated SSME background were produced and recorded from a visible wavelength video camera. This data was processed frame-by-frame over the time interval of interest using an image processor implementation of the leak detection algorithm. In addition, a 20 second video sequence of an actual SSME failure was analyzed using this technique. The resulting output image sequences and plots of the full frame mean value versus time verify the effectiveness of the system.

Smith, L. Montgomery↗

Satellite Remote Sensing of Tropical Precipitation and Ice Clouds for GCM Verification

This project, supported by the NASA New Investigator Program, has primarily been funding a graduate student, Darren McKague. Since August 1999 Darren has been working part time at Raytheon, while continuing his PhD research. Darren is planning to finish his thesis work in May 2001, thus some of the work described here is ongoing. The proposed research was to use GOES visible and infrared imager data and SSM/I microwave data to obtain joint distributions of cirrus cloud ice mass and precipitation for a study region in the Eastern Tropical Pacific. These joint distributions of cirrus cloud and rainfall were to be compared to those from the CSU general circulation model to evaluate the cloud microphysical amd cumulus parameterizations in the GCM. Existing algorithms were to be used for the retrieval of cloud ice water path from GOES (Minnis) and rainfall from SSM/I (Wilheit). A theoretical study using radiative transfer models and realistic variations in cloud and precipitation profiles was to be used to estimate the retrieval errors. Due to the unavailability of the GOES satellite cloud retrieval algorithm from Dr. Minnis (a co-PI), there was a change in the approach and emphasis of the project. The new approach was to develop a completely new type of remote sensing algorithm - one to directly retrieve joint probability density functions (pdf's) of cloud properties from multi-dimensional histograms of satellite radiances. The usual approach is to retrieve individual pixels of variables (i.e. cloud optical depth), and then aggregate the information. Only statistical information is actually needed, however, and so a more direct method is desirable. We developed forward radiative transfer models for the SSM/I and GOES channels, originally for testing the retrieval algorithms. The visible and near infrared ice scattering information is obtained from geometric ray tracing of fractal ice crystals (Andreas Macke), while the mid-infrared and microwave scattering is computed with Mie scattering. The radiative transfer is performed with the Spherical Harmonic Discrete Ordinate Method (developed by the PI), and infrared molecular absorption is included with the correlated k-distribution method. The SHDOM radiances have been validated by comparison to version 2 of DISORT (the community "standard" discrete-ordinates radiative transfer model), however we use SHDOM since it is computationally more efficient.

Evans, K. Franklin↗

Theoretical studies of massive stars. I - Evolution of a 15-solar-mass star from the zero-age main sequence to neon ignition

The evolution of a star with mass 15 times that of the sun from the zero-age main sequence to neon ignition has been computed by the Henyey method. The hydrogen-rich envelope and all shell sources were explicitly included in the models. An algorithm has been developed for approximating the results of carbon burning, including the branching ratio for the C-12 + C-12 reaction and taking some secondary reactions into account. Penetration of the convective envelope into the core is found to be unimportant during the stages covered by the models. Energy transfer from the carbon-burning shell to the core by degenerate electron conduction becomes important after the core carbon-burning stage. Neon ignition will occur in a semidegenerate core and will lead to a mild 'flash.' Detailed numerical results are given in an appendix. Continuation of the calculations into later stages and variations with the total mass of the star will be discussed in later papers.

Endal, A. S.↗

Assimilation of ERBE data with a nonlinear programming technique to improve cloud-cover diagnosis

A method is developed to assimilate satellite data for the purpose of improving the diagnosis of fractional cloud cover within a numerical weather prediction model. The method makes use of a nonlinear programming technique to find a set of parameters for the cloud diagnosis that minimizes the difference between the observed and model-produced outgoing longwave radiation (OLR). The algorithm and theoretical basis of the method are presented. The method has been applied in two forecast experiments using a numerical weather prediction model. The results from a winter case demonstrate that the root-mean-square (rms) difference between the observed and forecasted OLR can be reduced by 50 percent when the optimized cloud diagnosis is used, with the remaining rms difference within the background noise.

Wu, Xiangqian↗

Advanced Control Algorithms for Compensating the Phase Distortion Due to Transport Delay in Human-Machine Systems

The desire to create more complex visual scenes in modern flight simulators outpaces recent increases in processor speed. As a result, simulation transport delay remains a problem. New approaches for compensating the transport delay in a flight simulator have been developed and are presented in this report. The lead/lag filter, the McFarland compensator and the Sobiski/Cardullo state space filter are three prominent compensators. The lead/lag filter provides some phase lead, while introducing significant gain distortion in the same frequency interval. The McFarland predictor can compensate for much longer delay and cause smaller gain error in low frequencies than the lead/lag filter, but the gain distortion beyond the design frequency interval is still significant, and it also causes large spikes in prediction. Though, theoretically, the Sobiski/Cardullo predictor, a state space filter, can compensate the longest delay with the least gain distortion among the three, it has remained in laboratory use due to several limitations. The first novel compensator is an adaptive predictor that makes use of the Kalman filter algorithm in a unique manner. In this manner the predictor can accurately provide the desired amount of prediction, while significantly reducing the large spikes caused by the McFarland predictor. Among several simplified online adaptive predictors, this report illustrates mathematically why the stochastic approximation algorithm achieves the best compensation results. A second novel approach employed a reference aircraft dynamics model to implement a state space predictor on a flight simulator. The practical implementation formed the filter state vector from the operator s control input and the aircraft states. The relationship between the reference model and the compensator performance was investigated in great detail, and the best performing reference model was selected for implementation in the final tests. Theoretical analyses of data from offline simulations with time delay compensation show that both novel predictors effectively suppress the large spikes caused by the McFarland compensator. The phase errors of the three predictors are not significant. The adaptive predictor yields greater gain errors than the McFarland predictor for short delays (96 and 138 ms), but shows smaller errors for long delays (186 and 282 ms). The advantage of the adaptive predictor becomes more obvious for a longer time delay. Conversely, the state space predictor results in substantially smaller gain error than the other two predictors for all four delay cases.

Guo, Liwen↗

Robustness of adaptive control algorithms in the presence of unmodeled dynamics

This paper reports the outcome of an exhaustive analytical and numerical investigation of stability and robustness properties of a wide class of adaptive control algorithms in the presence of unmodeled dynamics and output disturbances. The class of adaptive algorithms considered are those commonly referred to as model-reference adaptive control algorithms, self-tuning controllers, and dead-beat adaptive controllers; they have been developed for both continuous-time systems and discrete-time systems. The existing adaptive control algorithms have been proven to be globally asymptotically stable under certain assumptions, the key ones being (1) that the number of poles and zeroes of the unknown plant are known, and (2) that the primary performance criterion is related to good command following. These theoretical assumptions are too restrictive from an engineering point of view. Real plants always contain unmodeled high-frequency dynamics and small delays, and hence no upper bound on the number of the plant poles and zeroes exists. Also real plants are always subject to unmeasurable output additive disturbances, although these may be guide small. Hence, it is important to critically examine the stability robustness properties of the existing adaptive algorithms when some of the theoretical assumptions are removed; in particular, their stability and performance properties in the presence of unmodeled dynamics and output disturbances. Previously announced in STAR as N83-16061

Rohrs, C. E.↗

Oak Ridge National Laboratory Pilot Demonstration of an Attestation and Anomaly Detection Framework using Distributed Ledger Technology for Power Grid Infrastructure

This report summarizes the design and pilot demonstration of a framework called Grid Guard that was created to provide increased data and device trustworthiness to electric grid devices by leveraging distributed ledger technology (DLT), specifically blockchain. Grid Guard contains a combination of core cryptographic methods such as the secure hash algorithm (SHA), and asymmetric cryptography, private permissioned blockchain, baselining configuration data, consensus algorithm (Raft) and the Hyperledger Fabric (HLF) framework. The system implements a low energy, fast, and robust enhancement to system trustworthiness within and across electric grid systems such as substations, control centers and metering infrastructures. Blockchain is a distributed database structured that provides a practically unalterable (immutable) timeline of stored transactions. By relying on hashing and the Raft consensus algorithm, if an entity tries to illegitimately alter a record at one instance of the database the other ledger nodes are not altered. They work to cross-reference each other and easily locate any incorrectly added data and remove it. The bulk raw data is stored in an off-chain storage (outside of the blockchain ledger) and a hash of this baseline data is stored in the Blockchain ledger via hashing windows of time-series and configuration data, after aggregation and filtering. The bulk off-chain data repository is then considered to be trust-anchored using the hashes stored in the blockchain. To secure the electric grid testbed devices and data, device configuration baselines were compared to those baselines that had been previously stored in the ledger. Statistical baselines for device configurations, network communication patterns, and high-speed sensor data are calculated and then stored off-chain and hashes stored in the ledger. Measurements such as three-phase voltage and current, frequency, breaker status, protection scheme settings, network configuration settings (and other device configuration artifacts) and network traffic features (packet interarrival times) are compared every minute or other selected time windows. During phase 1 of the Grid Guard DLT project different DLT technologies were studies, and an assessment was performed on DLT technology vulnerabilities, uses, and key characteristics. DLT consensus protocols were studies (e.g., RAFT, named after Reliable, Replicated, Redundant, And Fault-Tolerant). Also, cryptography, public, private and permissioned or permissionless systems were assessed. Grid Guard implements a permissioned private DLT. Consensus algorithm selection and choice of DLT implementation depended heavily on the use-case. For this use-case, parameters were selected to measure performance and existing tools for assessment. Benchmarking was performed theoretically and practically. During phase 2 hashed transactions/blocks were inserted into the ledger every second. During phase 2 of the Grid Guard DLT project, a prototype framework was developed and demonstrated for attestation of critical substation devices and data using precision timing systems that use PTP and IRIG-B protocols) on a testbed of operational devices that emulated a distribution substation, control center, and power metering infrastructure using real Operational Technology (OT). The testbed includes OT devices such as protective relays, human machine interfaces (HMI), and power meters. To determine when to collect and compare system and network baselines, an initial examination of an anomaly detection capability to identify malicious manipulation of data streams was conducted. The resulting anomaly detection was demonstrated in a set of experiments and leveraged to trigger device artifact attestation checks. Attestation checks occur against device configuration baselines when compared with the immutable blockchain-stored baselines, which provided a cryptographically supported means by which to store baselines. The electrical substation-grid testbed was created to test the Grid Guard framework. The testbed emulates the operations of a portion of a power grid and SCADA systems as closely as possible. The testbed integrates real protocols, mainly IEC 61850 standard protocols, such as the Sampled Value (SV) and the GOOSE protocols. The testbed also supports DNP3 and other layer 2 and layer 3 protocols such as Telnet, SSH, SFTP/FTP and other proprietary protocols needed to connect to industrial control system equipment. The testbed emulates real power conditions using the OpalRT hardware-in-the-loop (HIL) device which can create fault situations that cannot be easily tested on real systems. The electrical substation-grid testbed was created using real measurement, communication, and protection devices that electrical utilities commonly use.

24 POWER TRANSMISSION AND DISTRIBUTION↗