Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Lookup table”

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 55 records · Page 3

Decision-Tree Formulation With Order-1 Lateral Execution

A compact symbolic formulation enables mapping of an arbitrarily complex decision tree of a certain type into a highly computationally efficient multidimensional software object. The type of decision trees to which this formulation applies is that known in the art as the Boolean class of balanced decision trees. Parallel lateral slices of an object created by means of this formulation can be executed in constant time considerably less time than would otherwise be required. Decision trees of various forms are incorporated into almost all large software systems. A decision tree is a way of hierarchically solving a problem, proceeding through a set of true/false responses to a conclusion. By definition, a decision tree has a tree-like structure, wherein each internal node denotes a test on an attribute, each branch from an internal node represents an outcome of a test, and leaf nodes represent classes or class distributions that, in turn represent possible conclusions. The drawback of decision trees is that execution of them can be computationally expensive (and, hence, time-consuming) because each non-leaf node must be examined to determine whether to progress deeper into a tree structure or to examine an alternative. The present formulation was conceived as an efficient means of representing a decision tree and executing it in as little time as possible. The formulation involves the use of a set of symbolic algorithms to transform a decision tree into a multi-dimensional object, the rank of which equals the number of lateral non-leaf nodes. The tree can then be executed in constant time by means of an order-one table lookup. The sequence of operations performed by the algorithms is summarized as follows: 1. Determination of whether the tree under consideration can be encoded by means of this formulation. 2. Extraction of decision variables. 3. Symbolic optimization of the decision tree to minimize its form. 4. Expansion and transformation of all nested conjunctive-disjunctive paths to a flattened conjunctive form composed only of equality checks when possible. If each reduced conjunctive form contains only equality checks and all of these forms use the same variables, then the decision tree can be reduced to an order-one operation through a table lookup. The speedup to order one is accomplished by distributing each decision variable over a surface of a multidimensional object by mapping the equality constant to an index

James, Mark↗

Target Detection Using Fractal Geometry

The concepts and theory of fractal geometry were applied to the problem of segmenting a 256 x 256 pixel image so that manmade objects could be extracted from natural backgrounds. The two most important measurements necessary to extract these manmade objects were fractal dimension and lacunarity. Provision was made to pass the manmade portion to a lookup table for subsequent identification. A computer program was written to construct cloud backgrounds of fractal dimensions which were allowed to vary between 2.2 and 2.8. Images of three model space targets were combined with these backgrounds to provide a data set for testing the validity of the approach. Once the data set was constructed, computer programs were written to extract estimates of the fractal dimension and lacunarity on 4 x 4 pixel subsets of the image. It was shown that for clouds of fractal dimension 2.7 or less, appropriate thresholding on fractal dimension and lacunarity yielded a 64 x 64 edge-detected image with all or most of the cloud background removed. These images were enhanced by an erosion and dilation to provide the final image passed to the lookup table. While the ultimate goal was to pass the final image to a neural network for identification, this work shows the applicability of fractal geometry to the problems of image segmentation, edge detection and separating a target of interest from a natural background.

Fuller, J. Joseph↗

Measurements of Rainfall Rate, Drop Size Distribution, and Variability at Middle and Higher Latitudes: Application to the Combined DPR-GMI Algorithm

The Global Precipitation Measurement mission is a major U.S.–Japan joint mission to understand the physics of the Earth’s global precipitation as a key component of its weather, climate, and hydrological systems. The core satellite carries a dual-precipitation radar and an advanced microwave imager which provide measurements to retrieve the drop size distribution (DSD) and rain rates using a Combined Radar-Radiometer Algorithm (CORRA). Our objective is to validate key assumptions and parameterizations in CORRA and enable improved estimation of precipitation products, especially in the middle-to-higher latitudes in both hemispheres. The DSD parameters and statistical relationships between DSD parameters and radar measurements are a central part of the rainfall retrieval algorithm, which is complicated by regimes where DSD measurements are abysmally sparse (over the open ocean). In view of this, we have assembled optical disdrometer datasets gathered by research vessels, ground stations, and aircrafts to simulate radar observables and validate the scattering lookup tables used in CORRA. The joint use of all DSD datasets spans a large range of drop concentrations and characteristic drop diameters. The scaling normalization of DSDs defines an intercept parameter N(W), which normalizes the concentrations, and a scaling diameter D(m), which compresses or stretches the diameter coordinate axis. A major finding of this study is that a single relationship between N(W) and D(m), on average, unifies all datasets included, from stratocumulus to heavier rainfall regimes. A comparison with the N(W)–D(m) relation used as a constraint in versions 6 and 7 of CORRA highlights the scope for improvement of rainfall retrievals for small drops (D(m) < 1 mm) and large drops (D(m) > 2 mm). The normalized specific attenuation–reflectivity relationships used in the combined algorithm are also found to match well the equivalent relationships derived using DSDs from the three datasets, suggesting that the currently assumed lookup tables are not a major source of uncertainty in the combined algorithm rainfall estimates.

Viswanathan Bringi↗

Preliminary Work for Examining the Scalability of Reinforcement Learning

Researchers began studying automated agents that learn to perform multiple-step tasks early in the history of artificial intelligence (Samuel, 1963; Samuel, 1967; Waterman, 1970; Fikes, Hart & Nilsonn, 1972). Multiple-step tasks are tasks that can only be solved via a sequence of decisions, such as control problems, robotics problems, classic problem-solving, and game-playing. The objective of agents attempting to learn such tasks is to use the resources they have available in order to become more proficient at the tasks. In particular, each agent attempts to develop a good policy, a mapping from states to actions, that allows it to select actions that optimize a measure of its performance on the task; for example, reducing the number of steps necessary to complete the task successfully. Our study focuses on reinforcement learning, a set of learning techniques where the learner performs trial-and-error experiments in the task and adapts its policy based on the outcome of those experiments. Much of the work in reinforcement learning has focused on a particular, simple representation, where every problem state is represented explicitly in a table, and associated with each state are the actions that can be chosen in that state. A major advantage of this table lookup representation is that one can prove that certain reinforcement learning techniques will develop an optimal policy for the current task. The drawback is that the representation limits the application of reinforcement learning to multiple-step tasks with relatively small state-spaces. There has been a little theoretical work that proves that convergence to optimal solutions can be obtained when using generalization structures, but the structures are quite simple. The theory says little about complex structures, such as multi-layer, feedforward artificial neural networks (Rumelhart & McClelland, 1986), but empirical results indicate that the use of reinforcement learning with such structures is promising. These empirical results make no theoretical claims, nor compare the policies produced to optimal policies. A goal of our work is to be able to make the comparison between an optimal policy and one stored in an artificial neural network. A difficulty of performing such a study is finding a multiple-step task that is small enough that one can find an optimal policy using table lookup, yet large enough that, for practical purposes, an artificial neural network is really required. We have identified a limited form of the game OTHELLO as satisfying these requirements. The work we report here is in the very preliminary stages of research, but this paper provides background for the problem being studied and a description of our initial approach to examining the problem. In the remainder of this paper, we first describe reinforcement learning in more detail. Next, we present the game OTHELLO. Finally we argue that a restricted form of the game meets the requirements of our study, and describe our preliminary approach to finding an optimal solution to the problem.

Clouse, Jeff↗

A Comprehensive Forward Model for Spaceborne Radar Instruments

We present the development and validation of a comprehensive forward model designed to enhance remote sensing capabilities of spaceborne radar instruments. To overcome limitations in existing models, we integrated a Discrete Dipole Approximation (DDA) cloud scattering database into our Radiative Transfer Model (RTM), focusing on microwave frequencies. By simulating the optical properties of non-spherical frozen hydrometeors, the DDA technique effectively reduced discrepancies between simulated and observed values, surpassing traditional Mie tables. The evaluation of DDA lookup tables involved comparisons with a collocated dataset comprising short-term forecasts and satellite microwave data, providing evidence of their superiority. Additionally, we address the challenges of assimilating active radar measurements, which offer vertically resolved insights into clouds and precipitation. We explored the assimilation of spaceborne radar measurements in Numerical Weather Prediction (NWP) models by integrating a forward radar model, along with its adjoint and tangent linear, into the data assimilation system. Evaluation using CloudSat measurements demonstrated promising agreement between simulations and observations, particularly when the input hydrometeor profiles aligned with the measured reflectivity profiles, showcasing the potential of the developed forward radar model. Moreover, we discuss other challenges in radar measurement assimilation within NWP models, including potential observation errors and biases.

Isaac Moradi↗

Algorithm for Atmospheric and Glint Corrections of Satellite Measurements of Ocean Pigment

An algorithm is developed to correct satellite measurements of ocean color for atmospheric and surface reflection effects. The algorithm depends on taking the difference between measured and tabulated radiances for deriving water-leaving radiances. 'ne tabulated radiances are related to the measured radiance where the water-leaving radiance is negligible (670 nm). The tabulated radiances are calculated for rough surface reflection, polarization of the scattered light, and multiple scattering. The accuracy of the tables is discussed. The method is validated by simulating the effect of different wind speeds than that for which the lookup table is calculated, and aerosol models different from the maritime model for which the table is computed. The derived water-leaving radiances are accurate enough to compute the pigment concentration with an error of less than q 15% for wind speeds of 6 and 10 m/s and an urban atmosphere with aerosol optical thickness of 0.20 at lambda 443 nm and decreasing to 0.10 at lambda 670 nm. The pigment accuracy is less for wind speeds less than 6 m/s and is about 30% for a model with aeolian dust. On the other hand, in a preliminary comparison with coastal zone color scanner (CZCS) measurements this algorithm and the CZCS operational algorithm produced values of pigment concentration in one image that agreed closely.

Fraser, Robert S.↗

Impacts of aerosol size-dependent below-cloud scavenging on tropospheric aerosol in the NASA GEOS model

Wet deposition is the major sink for a suite of tropospheric aerosols, and thus largely affects the global distribution and lifetime of aerosols as well as the formation of clouds in the atmosphere. In this study, we implement the aerosol size-dependent below-cloud scavenging (BCS; washout) parameterization of Croft et al. (Atmos. Chem. Phys., 2009; hereafter referred to as C09) in the GOCART bulk aerosol scheme coupled with the NASA Goddard Earth Observing System (GEOS) model, and evaluate the simulated tropospheric aerosols against surface, airborne, and satellite observations. The current below-cloud scavenging in GOCART employs a first-order removal function with a constant scavenging coefficient that is independent of aerosol sizes and precipitation fluxes. The C09 BCS parameterization instead calculates aerosol below-cloud scavenging coefficients based on a size-dependent collision efficiency between aerosol particles and raindrops (or snow crystals). A look-up table of compiled collision efficiencies provides scavenging coefficients for sixty aerosol sizes and nine rain flux rates. We determine instantaneous coefficients according to the C09 BCS look-up table, precipitation fluxes, and a log-normal size distribution of aerosols. The implemented BCS parameterization tends to result in a large diversity of scavenging coefficient values with higher magnitudes, leading to more efficient scavenging. The model-simulated global mean tropospheric Pb-210 aerosol lifetime decreases from 7.4 days to 5.8 days. The separate consideration of rain and snow conditions in the scavenging coefficient lookup table leads to a bi-mode distribution of scavenging coefficients. These changes also cause increased mass fractions of smaller aerosols compared to the current simulation. We examine the impacts of the C09 BCS parameterization on the simulated aerosol vertical profiles, tropospheric lifetimes, and deposition fluxes through comparisons with NASA aircraft measurements (ATom), surface observations of aerosol concentrations (IMPROVE) and wet deposition fluxes (NADP and APQMP), and MODIS aerosol optical depth (AOD) retrievals.

Aerosols↗

Surface and Atmospheric Shortwave Radiative Fluxes From ISCCP Data and Fu-Liou Algorithm at Higher Spatial and Vertical Resolution

NASA/GEWEX Surface Radiation Budget (SRB) has provided surface and TOA shortwave and longwave radiative fluxes using International Satellite Cloud Climatology data as the primary input. Release 4.0 came out in 2019, with data from July 1983 through June 2017, and improved validation stats relative to Release 3.0 (Stackhouse et al., 2012). Release 4.0 used the newly reprocessed ISCCP H data set. The shortwave algorithm for versions 3 and 4 has been based on the Pinker and Laszlo (1992) algorithm, which relies on the satellite-measured shortwave radiance to produce a TOA albedo. This background TOA albedo is made utilizing the background clear-sky visible radiance (called clear-sky composite radiance in the ISCCP data) and applying narrowband-to-broadband angular distribution models. Using a climatological aerosol assumption, the surface albedo is estimated using radiative transfer based (i.e., Fu/Liou radiative transfer model; Fu and Liou, 1993) look-up tables. Using this surface albedo and an instantaneous TOA albedo, the look-up tables are used to adjust both the aerosol optical depth (for clear sky) and cloud optical depth (for cloudy sky) for each scene. These properties and look up tables are then used to generate surface fluxes. While this has worked well to provide useful fluxes, it has occasionally resulted in inaccurate direct and diffuse surface SW fluxes due to the overreliance on aerosol optical depth. With increased computational power and storage now available, a more direct approach is now possible. Here we present a different approach for a future high resolution SRB Release 5.0. We replace the Pinker-Laszlo lookup table approach with a forward call to the Fu-Liou radiative transfer model as modified by the CERES team (Rose et al., 2006). In addition to being a proven radiation code, Fu-Liou allows the calculation of fluxes at different atmospheric levels and spectral bands, which will provide more insight into the surface radiation budget, its variability and attribution. It is expected that horizontal resolution will increase to at least 0.5°x0.5° from the current 1°x1°. Here we demonstrate a preliminary look at the next SRB, and show comparisons with the current release.

Earth Radiation Budget↗

Status of the MODIS Level 1B Algorithms and Calibration Tables

The Moderate Resolution Imaging Spectroradiometer (MODIS) makes observations using 36 spectral bands with wavelengths from 0.41 to 14.4 m and nadir spatial resolutions of 0.25km, 0.5km, and 1km. It is currently operating onboard the NASA Earth Observing System (EOS) Terra and Aqua satellites, launched in December 1999 and May 2002, respectively. The MODIS Level 1B (L1B) program converts the sensor's on-orbit responses in digital numbers to radiometrically calibrated and geo-located data products for the duration of each mission. Its primary data products are top of the atmosphere (TOA) reflectance factors for the sensor's reflective solar bands (RSB) and TOA spectral radiances for the thermal emissive bands (TEB). The L1B algorithms perform the TEB calibration on a scan-by-scan basis using the sensor's response to the on-board blackbody (BB) and other parameters which are stored in Lookup Tables (LUTs). The RSB calibration coefficients are processed offline and regularly updated through LUTs. In this paper we provide a brief description of the MODIS L1B calibration algorithms and associated LUTs with emphasis on their recent improvements and updates developed for the MODIS collection 5 processing. We will also discuss sensor on-orbit calibration and performance issues that are critical to maintaining L1B data product quality, such as changes in the sensor's response versus scan-angle.

MODIS LEVEL 1B ALGORITHMS↗

Control of a Thrust Alignment Table for Modeling the Coning Dynamics of a Spinning Spacecraft with a Follower Force

This document presents a system controlling the motion of a spherical air bearing used in the modeling of spacecraft dynamics and controls in a laboratory environment. The system is part of the Spinning Rocket Simulator (SRS), used to simulate the coning of spacecraft during a thrusting stage. The reaction force at the spherical air bearing supporting the spacecraft model must coincide with the thrust axis of the model for proper simulation. Therefore, the bearing is translated in a circular path to introduce a centrifugal force. This horizontal force along with the gravitational reaction force at the bearing combines to simulate the direction of the spacecraft's thrust force. The control system receives attitude information from the spacecraft model via a laser beam embedded in the model that impinges on a photosensitive array. The non-linear system is controlled using high-speed lookup tables and digital techniques. A vector-controlled motor and a stepper motor are given the necessary signals to accurately control the turntable and platform supporting the air bearing. Preliminary performance data is presented. Mechanical elements of the table and platform are described in detail. A wireless (RF) data path for all devices on the spacecraft model to an off-table command computer is also described.

Halsmer, Dominic↗

MMIC Amplifiers and Wafer Probes for 350 to 500 GHz

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Samoska, Lorene A.↗

Interface Supports Lightweight Subsystem Routing for Flight Applications

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Lux, James P.↗

JPSS-1 VIIRS Solar Diffuser Witness Sample BRF Calibration Using a Table-Top Goniometer at NASA GSFC

In support of the prelaunch calibration of the Joint Polar Satellite System-1 (JPSS-1) Visible Infrared Imaging Radiometer Suite (VIIRS), the Bidirectional Reflectance Factor (BRF) and Bidirectional Reflectance Distribution Function (BRDF) of a VIIRS solar diffuser (SD) witness sample were determined using the table-top goniometer (TTG) located in the NASA GSFC Diffuser Calibration Laboratory (DCL). The BRF of the sample was measured for VIIRS bands in the reflected solar wavelength region from 410 nm to 2250 nm. The new TTG was developed to extend the laboratory’s BRF and BRDF measurement capability to wavelengths from 1600 to 2250 nm and specifically for the VIIRS M11 band centered at 2250 nm. We show the new features and capabilities of the new scatterometer and present the BRF and BRDF results for the incident/scatter test configuration of 0°/45° and for a set of angles representing of the VIIRS on-orbit solar diffuser calibration. The BRF and BRDF results of the SD witness were used to assist in finalizing the set of BRF values of J1 VIIRS SD to be used on-orbit. Comparison of the BRF results between the JPSS-1 VIIRS SD witness sample and the flight SD panel was made by varying different sample clocking orientations and by analyzing the ratio of BRF to total hemispherical reflectance in effort to minimize the uncertainty of the extrapolated flight BRF value at 2250 nm. Furthermore, differences between the prelaunch BRF results and those used in the VIIRS on-orbit BRF lookup table were examined to improve the VIIRS BRF calibration for future missions.

Zeng, Jinan↗

JPSS-1 VIIRS Solar Diffuser Witness Sample BRF Calibration Using a Table-Top Goniometer at NASA GSFC

In support of the prelaunch calibration of the Joint Polar Satellite System-1 (JPSS-1) Visible Infrared Imaging Radiometer Suite (VIIRS), the Bidirectional Reflectance Factor (BRF) and Bidirectional Reflectance Distribution Function (BRDF) of a VIIRS solar diffuser (SD) witness sample were determined using the table-top goniometer (TTG) located in the NASA GSFC Diffuser Calibration Laboratory (DCL). The BRF of the sample was measured for VIIRS bands in the reflected solar wavelength region from 410 nm to 2250 nm. The new TTG was developed to extend the laboratory’s BRF and BRDF measurement capability to wavelengths from 1600 to 2250 nm and specifically for the VIIRS M11 band centered at 2250 nm. We show the new features and capabilities of the new scatterometer and present the BRF and BRDF results for the incident/scatter test configuration of 0°/45° and for a set of angles representing of the VIIRS on-orbit solar diffuser calibration. The BRF and BRDF results of the SD witness were used to assist in finalizing the set of BRF values of J1 VIIRS SD to be used on-orbit. Comparison of the BRF results between the JPSS-1 VIIRS SD witness sample and the flight SD panel was made by varying different sample clocking orientations and by analyzing the ratio of BRF to total hemispherical reflectance in effort to minimize the uncertainty of the extrapolated flight BRF value at 2250 nm. Furthermore, differences between the prelaunch BRF results and those used in the VIIRS on-orbit BRF lookup table were examined to improve the VIIRS BRF calibration for future missions.

Zeng, Jinan↗

Development of equilibrium air computer programs suitable for numerical computation using time-dependent or shock-capturing methods

Computer programs were developed which compute the thermodynamic properties of equilibrium air for use in either the time-dependent or shock-capturing computational methods. For the time-dependent method, tne NASA-ARC RGAS computer program was modified to allow internal energy and density to be used as the independent variables. In addition, simplified-curve fits for p = p(e,rho), a = a(e,rho), and T = T(p,rho) were devised to reduce computer time. For the shock-capturing method a simplified curve fit for h = h(p,rho) was made. These approximate curve fits may be particularly useful when employed on advanced computers such as the Illiac 4 or the CDC Star since they avoid the cumbersome table-lookup feature of the RGAS program.

Tannehill, J. C.↗

South Louisiana remote-sensing environmental information system

Satellite gathered remote sensor data were used to update a basic environmental atlas of southern Louisiana to reflect recent dynamic geological changes, such as erosion by wave action along the coast and active delta building in the lower part of the Mississippi Basin. Standard pattern recognition programs were utilized to update LANDSAT pictures for three categories (generalized land use, ecological zones and vegetation) to obtain a simulated color photomap for LANDSAT frames for further rectification by a table lookup program.

Gordon, J. P.↗

Soil, water, and vegetation conditions in south Texas

The author has identified the following significant results. The best wavelengths in the 0.4 to 2.5 micron interval were determined for detecting lead toxicity and ozone damage, distinguishing succulent from woody species, and detecting silverleaf sunflower. A perpendicular vegetation index, a measure of the distance from the soil background line, in MSS 5 and MSS 7 data space, of pixels containing vegetation was developed and tested as an indicator of vegetation development and crop vigor. A table lookup procedure was devised that permits rapid identification of soil background and green biomass or phenological development in LANDSAT scenes without the need for training data.

Wiegand, C. L.↗

Flight through thunderstorm outflows

Computer simulation of aircraft landing through thunderstorm gust fronts is carried out. The two-dimensional, nonlinear equations or aircraft motion containing all wind shear terms are solved numerically. The gust front spatial wind field inputs are provided in the form of tabulated experimental data which are coupled with a computer table lookup routine to provide the required wind components and shear at any given position within an approximate 500 m by 1 km vertical plane. The aircraft is considered to enter the wind field at a specified position under trimmed conditions. Both fixed control and automatic control landings are simulated. Flight paths, as well as control inputs necessary to maintain specified trajectories, are presented and discussed for aircraft having characteristics of a DC-8, B-747, augmentor-wing STOL, and a DHC-6.

Frost, W.↗