SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1997

Comparison of Snow Mass Estimates from a Prototype Passive Microwave Snow Algorithm, a Revised Algorithm and a Snow Depth Climatology

While it is recognized that no single snow algorithm is capable of producing accurate global estimates of snow depth, for research purposes it is useful to test an algorithm's performance in different climatic areas in order to see how it responds to a variety of snow conditions. This study is one of the first to develop separate passive microwave snow algorithms for North America and Eurasia by including parameters that consider the effects of variations in forest cover and crystal size on microwave brightness temperature. A new algorithm (GSFC 1996) is compared to a prototype algorithm (Chang et al., 1987) and to a snow depth climatology (SDC), which for this study is considered to be a standard reference or baseline. It is shown that the GSFC 1996 algorithm compares much more favorably to the SDC than does the Chang et al. (1987) algorithm. For example, in North America in February there is a 15% difference between the GSFC 198-96 Algorithm and the SDC, but with the Chang et al. (1987) algorithm the difference is greater than 50%. In Eurasia, also in February, there is only a 1.3% difference between the GSFC 1996 algorithm and the SDC, whereas with the Chang et al. (1987) algorithm the difference is about 20%. As expected, differences tend to be less when the snow cover extent is greater, particularly for Eurasia. The GSFC 1996 algorithm performs better in North America in each month than dose the Chang et al. (1987) algorithm. This is also the case in Eurasia, except in April and May when the Chang et al.(1987) algorithms is in closer accord to the SDC than is GSFC 1996 algorithm.

Foster, J. L.↗

NASA NTRS2000

Motion Cueing Algorithm Development: Initial Investigation and Redesign of the Algorithms

In this project four motion cueing algorithms were initially investigated. The classical algorithm generated results with large distortion and delay and low magnitude. The NASA adaptive algorithm proved to be well tuned with satisfactory performance, while the UTIAS adaptive algorithm produced less desirable results. Modifications were made to the adaptive algorithms to reduce the magnitude of undesirable spikes. The optimal algorithm was found to have the potential for improved performance with further redesign. The center of simulator rotation was redefined. More terms were added to the cost function to enable more tuning flexibility. A new design approach using a Fortran/Matlab/Simulink setup was employed. A new semicircular canals model was incorporated in the algorithm. With these changes results show the optimal algorithm has some advantages over the NASA adaptive algorithm. Two general problems observed in the initial investigation required solutions. A nonlinear gain algorithm was developed that scales the aircraft inputs by a third-order polynomial, maximizing the motion cues while remaining within the operational limits of the motion system. A braking algorithm was developed to bring the simulator to a full stop at its motion limit and later release the brake to follow the cueing algorithm output.

Telban, Robert J.↗

NASA NTRS2005

Motion Cueing Algorithm Development: Piloted Performance Testing of the Cueing Algorithms

The relative effectiveness in simulating aircraft maneuvers with both current and newly developed motion cueing algorithms was assessed with an eleven-subject piloted performance evaluation conducted on the NASA Langley Visual Motion Simulator (VMS). In addition to the current NASA adaptive algorithm, two new cueing algorithms were evaluated: the optimal algorithm and the nonlinear algorithm. The test maneuvers included a straight-in approach with a rotating wind vector, an offset approach with severe turbulence and an on/off lateral gust that occurs as the aircraft approaches the runway threshold, and a takeoff both with and without engine failure after liftoff. The maneuvers were executed with each cueing algorithm with added visual display delay conditions ranging from zero to 200 msec. Two methods, the quasi-objective NASA Task Load Index (TLX), and power spectral density analysis of pilot control, were used to assess pilot workload. Piloted performance parameters for the approach maneuvers, the vertical velocity upon touchdown and the runway touchdown position, were also analyzed but did not show any noticeable difference among the cueing algorithms. TLX analysis reveals, in most cases, less workload and variation among pilots with the nonlinear algorithm. Control input analysis shows pilot-induced oscillations on a straight-in approach were less prevalent compared to the optimal algorithm. The augmented turbulence cues increased workload on an offset approach that the pilots deemed more realistic compared to the NASA adaptive algorithm. The takeoff with engine failure showed the least roll activity for the nonlinear algorithm, with the least rudder pedal activity for the optimal algorithm.

Houck, Jacob A.↗

NASA NTRS1992

Interface of an uncoupled boundary layer algorithm with an inviscid core flow algorithm for unsteady supersonic engine inlets

An uncoupled boundary layer algorithm was combined with an inviscid core flow algorithm to model flows within supersonic engine inlets. The inviscid flow algorithm that was used was the LArge Perturbation INlet Code (LAPIN). The boundary layer and inviscid core flow algorithms were formulated in different manners. The boundary layer algorithm was two dimensional and solved in nonconservation form, while the core flow algorithm was one dimensional and solved in conservation form. In order to interface the two codes, the following modifications were important. The coordinate system was set up to maintain the parabolic nature of the boundary layer algorithm while approaching the one dimensional core flow solution far from a wall. The pressure gradient used in the boundary layer equation was calculated using the core flow values and the boundary layer equations, so the boundary layer solution smoothly approached the core flow values far from the wall. Flaring was used for the advection terms perpendicular to the core flow to maintain the stability of the algorithm. With these modifications, the combined viscous/inviscid algorithm matched well with experimental observations of pressure distributions with a supersonic inlet.

Darling, Douglas↗

NASA NTRS1992

Interface of an uncoupled boundary layer algorithm with an inviscid core flow algorithm for unsteady supersonic engine inlets

An uncoupled boundary layer algorithm was combined with an inviscid core flow algorithm to model flows within supersonic engine inlets. The inviscid flow algorithm that was used was the LArge Perturbation INlet Code (LAPIN). The boundary layer and inviscid core flow algorithms were formulated in different manners. The boundary layer algorithm was two dimensional and solved in nonconservation form, while the core flow algorithm was one dimensional and solved in conservation form. In order to interface the two codes, the following modifications were important. The coordinate system was set up to maintain the parabolic nature of the boundary layer algorithm while approaching the one dimensional core flow solution far from a wall. The pressure gradient used in the boundary layer equation was calculated using the core flow values and the boundary layer equations, so the boundary layer solution smoothly approached the core flow values far from the wall. Flaring was used for the advection terms perpendicular to the core flow to maintain the stability of the algorithm. With these modifications, the combined viscous/inviscid algorithm matched well experimental observations of pressure distributions with a supersonic inlet.

Darling, Douglas↗

NASA NTRS2010

Algorithm That Synthesizes Other Algorithms for Hashing

An algorithm that includes a collection of several subalgorithms has been devised as a means of synthesizing still other algorithms (which could include computer code) that utilize hashing to determine whether an element (typically, a number or other datum) is a member of a set (typically, a list of numbers). Each subalgorithm synthesizes an algorithm (e.g., a block of code) that maps a static set of key hashes to a somewhat linear monotonically increasing sequence of integers. The goal in formulating this mapping is to cause the length of the sequence thus generated to be as close as practicable to the original length of the set and thus to minimize gaps between the elements. The advantage of the approach embodied in this algorithm is that it completely avoids the traditional approach of hash-key look-ups that involve either secondary hash generation and look-up or further searching of a hash table for a desired key in the event of collisions. This algorithm guarantees that it will never be necessary to perform a search or to generate a secondary key in order to determine whether an element is a member of a set. This algorithm further guarantees that any algorithm that it synthesizes can be executed in constant time. To enforce these guarantees, the subalgorithms are formulated to employ a set of techniques, each of which works very effectively covering a certain class of hash-key values. These subalgorithms are of two types, summarized as follows: Given a list of numbers, try to find one or more solutions in which, if each number is shifted to the right by a constant number of bits and then masked with a rotating mask that isolates a set of bits, a unique number is thereby generated. In a variant of the foregoing procedure, omit the masking. Try various combinations of shifting, masking, and/or offsets until the solutions are found. From the set of solutions, select the one that provides the greatest compression for the representation and is executable in the minimum amount of time. Given a list of numbers, try to find one or more solutions in which, if each number is compressed by use of the modulo function by some value, then a unique value is generated.

James, Mark↗

NASA NTRS2019

Informing Algorithms from Ground Validation: The GPM Combined Algorithm

Ground validation (GV) for the Global Precipitation Measurement (GPM) mission encompasses in-situ (e.g., gauge, disdrometer) measurements, ground radar products, and comprehensive datasets from dedicated airborne field campaigns. These datasets are used for direct validation of the precipitation products from GPM as well as to inform assumptions used by the algorithms that produce these products. This presentation will focus on current and potential such uses of GV data in the GPM combined radar-radiometer algorithm.The GPM combined algorithm, by virtue of using data from the Dual-frequency Precipitation Radar (DPR) and GPM Microwave Imager (GMI), is the most well-constrained instantaneous precipitation product from GPM. It also plays an important in role the passive microwave algorithms as a basis for the construction of brightness temperature-precipitation profile databases and is a calibrator for the multi- satellite gridded product IMERG. Since both radar and radiometer data are used as observational inputs, and even with these data the retrievals are underconstrained, microphysical properties of the hydrometeor profile that are relevant over the range of GMI and DPR wavelengths and incidence angles need to be assumed by the algorithm forward models. Such properties include the normalized intercept parameter (N w ) and shape parameter () of the particle size distribution, ice size-density relationship, and particle size-aspect ratio relationships. The sub-beam variability must also be prescribed in order to accurately simulate the observed radar reflectivity profiles without introducing significant biases. The sensitivity of the algorithm to these parameters, along with their mean values and variability, will be discussed. Examples of future directions include refinement with new data (particularly the assumptions related to ice), and seeking relationships between assumptions and observable or environmental data.

Munchak, Joe.↗

NASA NTRS1991

G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

Rogers, David↗

NASA NTRS2019

Updated MISR Over-Water Research Aerosol Retrieval Algorithm - Part 2: A Multi-Angle Aerosol Retrieval Algorithm for Shallow, Turbid, Oligotrophic, and Eutrophic Waters

Coastal waters serve as transport pathways to the ocean for all agricultural and other runoff from terrestrial sources, and many are the sites for upwelling of nutrient rich, deep water; they are also some of the most biologically productive on Earth. Estimating the impact coastal waters have on the global carbon budget requires relating satellite-based remote-sensing retrievals of biological productivity (e.g., chlorophyll alpha concentration) to in situ measurements taken in near-surface waters. The Multi-angle Imaging SpectroRadiometer (MISR) can uniquely constrain the "atmospheric correction" needed to derive ocean color from remote-sensing imagers. Here, we retrieve aerosol amount and type from MISR over all types of water. The primary limitation is an upper bound on aerosol optical depth (AOD), as the algorithm must be able to distinguish the surface. This updated MISR research aerosol retrieval algorithm (RA) also assumes that light reflection by the underlying ocean surface is Lambertian. The RA computes the ocean surface reflectance (R (sub rs)) analytically for a given AOD, aerosol optical model, and wind speed. We provide retrieval examples over shallow, turbid, and eutrophic waters and introduce a productivity and turbidity index (PTI), calculated from retrieved spectral R (sub rs), that distinguished water types (similar to the the normalized difference vegetation index, NDVI, over land). We also validate the new algorithm by comparing spectral AOD and Angstrom exponent (ANG) results with 2419 collocated AErosol RObotic NETwork (AERONET) observations. For AERONET 558 nanometer-interpolated AOD less than 1.0, the root-mean square error (RMSE) is 0.04 and linear correlation coefficient is 0.95. For the 502 cloud-free MISR and AERONET collocations with an AERONET AOD greater than 0.20, the ANG RMSE is 0.25 and r is 0.89. Although MISR RA AOD retrieval quality does not appear to be substantially impacted by the presence of turbid water, the MISR-RA-retrieved Angstrom exponent seems to suffer from increased uncertainty under such conditions. MISR supplements current ocean color sources in regions where sunglint precludes retrievals from single-view-angle instruments. MISR atmospheric correction should also be more robust than that derived from single-view instruments such as the Moderate Resolution Imaging Spectroradiometer (MODIS). This is especially true in regions of shallow, turbid, and eutrophic waters, locations where biological productivity can be high, and single-view-angle retrieval algorithms struggle to separate atmospheric from oceanic features.

Satellite Remote Sensing↗

NASA NTRS1989

MT's algorithm: A new algorithm to search for the optimum set of modulation indices for simultaneous range, command, and telemetry

MT's algorithm was developed as an aid in the design of space telecommunications systems when utilized with simultaneous range/command/telemetry operations. This algorithm provides selection of modulation indices for: (1) suppression of undesired signals to achieve desired link performance margins and/or to allow for a specified performance degradation in the data channel (command/telemetry) due to the presence of undesired signals (interferers); and (2) optimum power division between the carrier, the range, and the data channel. A software program using this algorithm was developed for use with MathCAD software. This software program, called the MT program, provides the computation of optimum modulation indices for all possible cases that are recommended by the Consultative Committee on Space Data System (CCSDS) (with emphasis on the squarewave, NASA/JPL ranging system).

Nguyen, Tien Manh↗

NASA NTRS2004

Support the Design of Improved IUE NEWSIPS High Dispersion Extraction Algorithms: Improved IUE High Dispersion Extraction Algorithms

The objective of this work was to support the design of improved IUE NEWSIPS high dispersion extraction algorithms. The purpose of this work was to evaluate use of the Linearized Image (LIHI) file versus the Re-Sampled Image (SIHI) file, evaluate various extraction, and design algorithms for evaluation of IUE High Dispersion spectra. It was concluded the use of the Re-Sampled Image (SIHI) file was acceptable. Since the Gaussian profile worked well for the core and the Lorentzian profile worked well for the wings, the Voigt profile was chosen for use in the extraction algorithm. It was found that the gamma and sigma parameters varied significantly across the detector, so gamma and sigma masks for the SWP detector were developed. Extraction code was written.

Lawton, Pat↗

NASA NTRSDate not supplied

Standardizing Algorithm Documentation For Improved Scientific Data Understanding: The Algorithm Publication Tool Prototype

Algorithm Theoretical Basis Documents (ATBDs) are documents which accompany Earth observation data products generated from algorithms. While ATBDs are essential to scientific reproducibility, these key documents are not standardized and are often difficult to find. In this paper, we present the prototype Algorithm Publication Tool (APT), a cloud-based ATBD authoring and editing tool for NASA’s Earth science data systems. A standardized ATBD information model is also described as well as lessons learned from developing the prototype tool.

Kaylin Bugbee↗

NASA NTRS2020

SNPP VIIRS RSB on-orbit radiometric calibration algorithms Version 2.0 and the performances. Part I: The algorithms

The first VIIRS instrument is aboard the Suomi National Polar-orbiting Partnership satellite. The instrument has 14 reflective solar bands (RSBs) to passively collect photons reflected from the Earth surface in the design wavelengths from 412 to 2250 nm. The instrument uses a solar diffuser (SD) to radiometrically calibrate its RSBs. When lit by the Sun through an attenuation screen (the SD screen), the SD diffusely reflects off the incident sunlight to act as a radiance source for the calibration. An onboard solar diffuser stability monitor (SDSM) yields the on-orbit change of the SD bidirectional reflectance distribution function (BRDF) by comparing the signal strength from the SD with that from the Sun attenuated by another attenuation screen (the SDSM screen). Complications arise due to the discovery that the on-orbit change of the BRDF is angle dependent. Additionally, the SDSM does not cover the wavelengths for the short-wave infrared bands in the RSBs. Furthermore, satellite yaw maneuvers were performed in the early mission to yield data for refining the prelaunch SDSM screen relative effective transmittance and the relative product of the SD screen transmittance and the BRDF at the mission start. But the yaw maneuver data are coarse in the solar azimuth angles and thus are unable to yield accurate values between the measurement angles. Over the years of performing on-orbit radiometric calibration through the SD for the VIIRSRSBs, we have developed several highly effective calibration algorithms to address the issues mentioned above. This paper reviews these algorithms.

on-orbit cailbration↗

NASA NTRS1976

Set covering algorithm, a subprogram of the scheduling algorithm for mission planning and logistic evaluation

A computer program using Lemke, Salkin and Spielberg's Set Covering Algorithm (SCA) to optimize a traffic model problem in the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) was documented. SCA forms a submodule of SAMPLE and provides for input and output, subroutines, and an interactive feature for performing the optimization and arranging the results in a readily understandable form for output.

Chang, H.↗

NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes: An Iterative Decoding Algorithm for Linear Block Codes Based on a Low-Weight Trellis Search - Part 3

For long linear block codes, maximum likelihood decoding based on full code trellises would be very hard to implement if not impossible. In this case, we may wish to trade error performance for the reduction in decoding complexity. Sub-optimum soft-decision decoding of a linear block code based on a low-weight sub-trellis can be devised to provide an effective trade-off between error performance and decoding complexity. This chapter presents such a suboptimal decoding algorithm for linear block codes. This decoding algorithm is iterative in nature and based on an optimality test. It has the following important features: (1) a simple method to generate a sequence of candidate code-words, one at a time, for test; (2) a sufficient condition for testing a candidate code-word for optimality; and (3) a low-weight sub-trellis search for finding the most likely (ML) code-word.

Lin, Shu↗

NASA NTRS2000

Obstacle Detection Algorithms for Aircraft Navigation: Performance Characterization of Obstacle Detection Algorithms for Aircraft Navigation

The research reported here is a part of NASA's Synthetic Vision System (SVS) project for the development of a High Speed Civil Transport Aircraft (HSCT). One of the components of the SVS is a module for detection of potential obstacles in the aircraft's flight path by analyzing the images captured by an on-board camera in real-time. Design of such a module includes the selection and characterization of robust, reliable, and fast techniques and their implementation for execution in real-time. This report describes the results of our research in realizing such a design. It is organized into three parts. Part I. Data modeling and camera characterization; Part II. Algorithms for detecting airborne obstacles; and Part III. Real time implementation of obstacle detection algorithms on the Datacube MaxPCI architecture. A list of publications resulting from this grant as well as a list of relevant publications resulting from prior NASA grants on this topic are presented.

Kasturi, Rangachar↗

NASA NTRS2020

SNPP VIIRS RSB on-orbit radiometric calibration algorithms Version 2.0 and the performances. Part I: The algorithms

Ning Lei↗

NASA NTRSDate not supplied

Enhancing accessibility and usability of Algorithm Theoretical Basis Documents through the Algorithm Publication Tool

Effective communication of scientific theories is crucial for transforming raw instrument data into valuable Earth observation products. The NASA Earth science data community disseminates this knowledge through Algorithm Theoretical Basis Documents (ATBDs). Historically, these documents lacked a standardized format, were designed for human readability rather than machine interpretation, and were challenging to locate due to the absence of a centralized repository. The Algorithm Publication Tool (APT) transforms how ATBD content is presented, simplifying the processes of creating, updating, and locating these documents. APT offers authors the option to use its user-friendly cloud-based interface or standardized templates for ATBD development. The primary advantage of the interface is its capability to manage the entire ATBD creation process within a single environment, ensuring comprehensive tracking of all activities and facilitating user tasks. Conversely, the use of standardized ATBD templates allows users to create documents using familiar tools like Google Docs, Microsoft Word, or Overleaf for LaTeX. APT also provides a centralized repository, enabling easy search and discovery of published ATBDs. This presentation showcases APT's functionalities, illustrates its contributions to advancing open science, and highlights potential benefits for broader community adoption.

Bradley Baker↗