Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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,441 records · Page 80

Linear Algorithms for Worst Case Identification in H infinity with Applications to Flexible Structures

This paper is concerned with linear algorithms for identification in which have been studied in [9]. It is shown that the two different linear algorithms in [9] can be unified into a single one which can be further extended to nonuniformly spaced frequency response samples with exponential convergence for the noise free case. Improved upper bounds for the corresponding identification errors are derived. Applications to the identification of lightly damped systems such as flexible structures are also considered.

linear↗

Magellan Recorder Data Recovery Algorithms

This paper describes algorithms implemented by the Magellan High Rate Processor to recover radar data corrupted by the failure of an onboard tape recorder that dropped bits. For data with error correction coding, an algorithm was developed that decodes data in the presence of bit errors and missing bits.

Error↗

Algorithmic Classification of Raman Spectra Biosignatures: Improving Life Detection Confidence

“Agnostic” biosignatures – indicators of life (or the absence of life), independent of a particular biochemistry – are increasingly considered a high standard for life detection. The Ladder of Life Detection (2018) called for investigating how combinations of independent and different potential biosignatures affect confidence. To address this gap, statistical classification of elemental abundances, isotopic fractionation, and reflectance spectroscopy (VNIR) has been implemented. Raman spectroscopy, highly desirable due to its wide availability, has the potential to improve this predictive power. This work implemented biosignature classification algorithms on Raman data alone, in preparation for combination with the other data types. Raman spectroscopy data was collected from published databases and papers as part of a manually curated dataset of “indicative” and “non-indicative of life” samples. These currently include 61 non-indicative samples (meteorites, magnetite); 3 indicative living samples (bacteria); 20 indicative non-living samples (chalk, bone); and 12 indicative mixed (with non-indicative material) samples (soil, microbial mats). Laboratory work is ongoing to characterize additional samples, particularly a greater breadth of mixed systems. Spectra were interpolated, filtered with the Savitzsky-Golay filter, and de-noised. For a preliminary examination, agnostic features were manually extracted including mean intensity, number of peaks, and mean peak width. Different peak prominences and filtering polynomials were used to refine features. Classification algorithms were implemented: k-nearest neighbors (KNN), logistic regression (LR), linear support vector machines (SVM), random forest (RF), Gaussian naïve bayes (GNB). Lastly, Monte Carlo simulations on 1,000 50%-train-test-splits were used to validate classification performance and feature significance. The preliminary feature set achieved its highest AUC of 0.52 with LR, with no strongly discriminatory features. Work to improve feature extraction, such as through deep learning with back propagation, is planned. In future work, the Raman data will be combined with the other data types, and potentially new data types such as enantiomeric excess. This project was partially supported through the NASA Ames Project EXcellence (APEX) incubator program.

Astrobiology↗

Floating Potential Measurement Unit (FPMU) Data Processing Algorithm Development and Analysis Assessment

The NASA Engineering and Safety Center (NESC) was requested to provide space plasma instrumentation data analysis expertise in support of Floating Potential Measurement Unit (FPMU) data analysis and data processing algorithm development. Subject matter expertise was requested to support modification of FPMU data processing algorithms to account for aging of the FPMU instrument suite, improve the science quality of the FPMU data sets that are made available to the science community, and provide analysis of FPMU data for complex spacecraft orientation and geophysical situations. This document contains the results of the NESC assessment.

Floating Potential Measurement Unit↗

Assessment of Cloud Fraction Derived from a New Geostationary Satellite Cloud Retrieval Algorithm for CERES and Progress Towards Cross-platform Continuity

For over two decades The Clouds and the Earth’s Radiant Energy System (CERES) project has produced long-term records of top-of-atmosphere (TOA) and surface irradiances for detecting changes in the Earth’s radiation budget and advancing understanding of how clouds contribute to those changes. Accurate characterization of the spatial and temporal distributions of clouds are a critical component for producing CERES datasets. The CERES Cloud Working Group (CWG) derives cloud properties from both geostationary (GEO) and low-Earth orbit (LEO) satellite sensors in order to provide complete global coverage at hourly temporal resolution. However, the use of multiple sensors to provide this spatiotemporal coverage throughout a long-term record presents some challenges, because the various sensors generally have different spectral band characteristics (e.g., spectral band width and response) and spatial resolution. These differences can result in spatial artifacts at the coverage boundary between two sensors or temporal artifacts when one sensor replaces another in the record. For the upcoming Edition 5 release of CERES products, the CWG is developing cloud retrieval algorithms which utilize only spectral bands common to most modern passive satellite radiometers and account for differences in spectral width and response. The goal with this approach is to provide global cloud properties for CERES with greater cross-platform consistency than the previous Edition 4 products and thus mitigate artifacts which are evident at the interface of two sensors. This study focuses on retrieval of total cloud fraction from various GEO sensors, and we use Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) observations to assess the accuracy of total cloud fraction derived from the various sensors. The Edition 5 cloud mask algorithm depends on estimates of cloud-free TOA spectral radiances to differentiate clear and cloudy conditions, and CALIOP is used to assess the accuracy of those estimates when cloud-free conditions are indeed observed.

CALIOP↗

Leveraging High-Level Synthesis to Migrate Motor Control Algorithms From Microcontroller to FPGA

As motor control algorithms become increasingly complex, traditional microcontroller-based implementations are reaching computational limits that prevent the controller from operating at the required speed. This paper presents a novel workflow leveraging High-Level Synthesis (HLS) to migrate motor control algorithms from a microcontroller implementation to a Field-Programmable Gate Array (FPGA) implementation. The proposed approach utilizes the free Vitis HLS software to automatically convert Embedded Coder-generated C code from a Simulink model into Hardware Description Language (HDL) code suitable for FPGA deployment.

FPGA↗

Leveraging High-Level Synthesis to Migrate Motor Control Algorithms From Microcontroller to FPGA

As motor control algorithms become increasingly complex, traditional microcontroller-based implementations are reaching computational limits that prevent the controller from operating at the required speed. This paper presents a novel workflow leveraging High-Level Synthesis (HLS) to migrate motor control algorithms from a microcontroller implementation to a Field-Programmable Gate Array (FPGA) implementation. The proposed approach utilizes the free Vitis HLS software to automatically convert Embedded Coder-generated C code from a Simulink model into Hardware Description Language (HDL) code suitable for FPGA deployment.

FPGA↗

Linear systems of equations solved using mathematical algorithms

New mathematical algorithm solves linear systems of equations, AX equals B, and preserves the integer properties of the coefficients. The algorithms presented can also be used for the efficient evaluation of determinates and their leading minors.

Bareiss, E. H.↗

Algorithms for pattern classification.

Deterministic pattern classification algorithms, discussing abstraction problem, stochastic algorithms, minimum error scheme and modified least squares scheme

Kashyap, R. L.↗

Terminal-Area Guidance Algorithms for Automated Air-Traffic Control

Terminal-area guidance problems are solved in the form of computer-oriented algorithms. A flyable, three-dimensional trajectory is constructed that begins at the current aircraft position, heading, speed, and altitude, and that terminates at a prescribed position, heading, speed, altitude, and time. The terminal position is a waypoint and the terminal time is the assigned landing slot. The algorithms developed are applicable to all possible combinations of initial and final conditiions, and thus can be used in a closed-loop feedback law.

Erzberger, H.↗

An algorithm for control system design via parameter optimization

An algorithm for design via parameter optimization has been developed for linear-time-invariant control systems based on the model reference adaptive control concept. A cost functional is defined to evaluate the system response relative to nominal, which involves in general the error between the system and nominal response, its derivatives and the control signals. A program for the practical implementation of this algorithm has been developed, with the computational scheme for the evaluation of the performance index based on Lyapunov's theorem for stability of linear invariant systems.

Sinha, P. K.↗

An improved general algorithm for arbitrary pole assignment.

A new pole-placement algorithm for multi-input controllable systems is presented. The algorithm can be used to obtain real-valued feedback gains for arbitrarily specified real and complex, distinct or multiple eigenvalues. The multi-input controllable time-invariant system is converted to a single-input system. Pole assignment is achieved by making use of certain properties of the equation TF - AT = D, where A is the open-loop system matrix and F represents a matrix having the desired closed-loop eigenvalues.

Willner, L.↗

A new algorithm for finding survival coefficients employed in reliability equations

Product reliabilities are predicted from past failure rates and reasonable estimate of future failure rates. Algorithm is used to calculate probability that product will function correctly. Algorithm sums the probabilities of each survival pattern and number of permutations for that pattern, over all possible ways in which product can survive.

Bouricius, W. G.↗

An algorithm for targeting finite burn maneuvers

An algorithm was developed to solve the following problem: given the characteristics of the engine to be used to make a finite burn maneuver and given the desired orbit, when must the engine be ignited and what must be the orientation of the thrust vector so as to obtain the desired orbit? The desired orbit is characterized by classical elements and functions of these elements whereas the control parameters are characterized by the time to initiate the maneuver and three direction cosines which locate the thrust vector. The algorithm was built with a Monte Carlo capability whereby samples are taken from the distribution of errors associated with the estimate of the state and from the distribution of errors associated with the engine to be used to make the maneuver.

Barbieri, R. W.↗

An Evaluation of an Algorithm for Linear Inequalities and Its Applications

An algorithm is presented for obtaining a solution alpha to a set of inequalities (A alpha) 0 where A is an N x m-matrix and alpha is an m-vector. If the set of inequalities is consistant, then the algorithm is guaranteed to arrive at a solution in a finite number of steps. Also, if in the iteration, a negative vector is obtained, then the initial set of inequalities is inconsistant, and the iteration is terminated.

Jurgensen, J.↗

A comparison of discrete linear filtering algorithms.

Seven filter algorithms were presented in a recent survey paper (Kaminski, 1971), and were compared computationally (operations count) when relatively few observations were to be processed. These algorithms are now elaborated further. Details of the computations are presented, and it is shown that for problems with even moderately large amounts of data, the information matrix and square-root information matrix formulations are computationally more efficient than the other methods considered (conventional Kalman, stabilized Kalman, and square-root covariance mechanizations). It is pointed out that Schmidt's matrix factorization-Householder transformation technique leads to the same equations as those obtained via Potter's method. Several improvements in the equation mechanization are given.

Bierman, G. J.↗