Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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 343 records · Page 19

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗

Image Navigation and Registration Performance Assessment Tool Set for the GOES-R Advanced Baseline Imager and Geostationary Lightning Mapper

The GOES-R Flight Project has developed an Image Navigation and Registration (INR) Performance Assessment Tool Set (IPATS) for measuring Advanced Baseline Imager (ABI) and Geostationary Lightning Mapper (GLM) INR performance metrics in the post-launch period for performance evaluation and long term monitoring. For ABI, these metrics are the 3-sigma errors in navigation (NAV), channel-to-channel registration (CCR), frame-to-frame registration (FFR), swath-to-swath registration (SSR), and within frame registration (WIFR) for the Level 1B image products. For GLM, the single metric of interest is the 3-sigma error in the navigation of background images (GLM NAV) used by the system to navigate lightning strikes. 3-sigma errors are estimates of the 99.73rd percentile of the errors accumulated over a 24-hour data collection period. IPATS utilizes a modular algorithmic design to allow user selection of data processing sequences optimized for generation of each INR metric. This novel modular approach minimizes duplication of common processing elements, thereby maximizing code efficiency and speed. Fast processing is essential given the large number of sub-image registrations required to generate INR metrics for the many images produced over a 24-hour evaluation period. Another aspect of the IPATS design that vastly reduces execution time is the off-line propagation of Landsat based truth images to the fixed grid coordinates system for each of the three GOES-R satellite locations, operational East and West and initial checkout locations. This paper describes the algorithmic design and implementation of IPATS and provides preliminary test results.

Image Navigation↗

Image Navigation and Registration (INR) Performance Assessment Tool Set (IPATS) for the GOES-R Advanced Baseline Imager and Geostationary Lightning Mapper

The GOES-R Flight Project has developed an Image Navigation and Registration (INR) Performance Assessment Tool Set (IPATS) for measuring Advanced Baseline Imager (ABI) and Geostationary Lightning Mapper (GLM) INR performance metrics in the post-launch period for performance evaluation and long term monitoring. For ABI, these metrics are the 3-sigma errors in navigation (NAV), channel-to-channel registration (CCR), frame-to-frame registration (FFR), swath-to-swath registration (SSR), and within frame registration (WIFR) for the Level 1B image products. For GLM, the single metric of interest is the 3-sigma error in the navigation of background images (GLM NAV) used by the system to navigate lightning strikes. 3-sigma errors are estimates of the 99.73rd percentile of the errors accumulated over a 24 hour data collection period. IPATS utilizes a modular algorithmic design to allow user selection of data processing sequences optimized for generation of each INR metric. This novel modular approach minimizes duplication of common processing elements, thereby maximizing code efficiency and speed. Fast processing is essential given the large number of sub-image registrations required to generate INR metrics for the many images produced over a 24 hour evaluation period. Another aspect of the IPATS design that vastly reduces execution time is the off-line propagation of Landsat based truth images to the fixed grid coordinates system for each of the three GOES-R satellite locations, operational East and West and initial checkout locations. This paper describes the algorithmic design and implementation of IPATS and provides preliminary test results.

Image Registration↗

Marine Boundary Layer Cloud Property Retrievals from High-Resolution ASTER Observations: Case Studies and Comparison with Terra MODIS

A research-level retrieval algorithm for cloud optical and microphysical properties is developed for the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) aboard the Terra satellite. It is based on the operational MODIS algorithm. This paper documents the technical details of this algorithm and evaluates the retrievals for selected marine boundary layer cloud scenes through comparisons with the operational MODIS Data Collection 6 (C6) cloud product. The newly developed, ASTERspecific cloud masking algorithm is evaluated through comparison with an independent algorithm reported in Zhao and Di Girolamo (2006). To validate and evaluate the cloud optical thickness (tau) and cloud effective radius (r(sub eff)) from ASTER, the high-spatial-resolution ASTER observations are first aggregated to the same 1000m resolution as MODIS. Subsequently, tau(sub aA) and r(sub eff, aA) retrieved from the aggregated ASTER radiances are compared with the collocated MODIS retrievals. For overcast pixels, the two data sets agree very well with Pearson's product-moment correlation coefficients of R greater than 0.970. However, for partially cloudy pixels there are significant differences between r(sub eff, aA) and the MODIS results which can exceed 10 micrometers. Moreover, it is shown that the numerous delicate cloud structures in the example marine boundary layer scenes, resolved by the high-resolution ASTER retrievals, are smoothed by the MODIS observations. The overall good agreement between the research-level ASTER results and the operational MODIS C6 products proves the feasibility of MODIS-like retrievals from ASTER reflectance measurements and provides the basis for future studies concerning the scale dependency of satellite observations and three-dimensional radiative effects.

marine boundary layer↗

A balanced submatrix merging algorithm for multiprocessor architectures

In this article, a parallel algorithm which applies Givens rotations to selectively annihilate k(k + 1)/2 nonzero elements from two k x n(k not more than n) upper trapezoidal submatrices is described. The new algorithm is suitable for implementation on either a pair of directly connected local-memory processors or two clusters of multiple tightly-coupled processors. Analyses show that in both cases the proposed algorithms achieve optimal speed-up by balancing the work load distribution and masking interprocessor or intercluster communication by computation if k is much small than n. In the context of solving large scale least squares problems, this submatrix merging step is repetitively needed during the entire computation and, furthermore, there are usually many pairs of such submatrices to be merged with each submatrix stored in the memory of a processor or a cluster of processors. The proposed algorithm can be applied to each pair of submatrices concurrently, and thus parallelizes an important step in solving the least squares problems.

Chu, Eleanor↗

Geoscience Laser Altimeter System: Characteristics and Performance of the Altimeter Receiver

The Geoscience Laser Altimeter System (GLAS) on board ICESat spacecraft measures the surface height (altimetry) via the time of flight of its 1064 nm laser pulse. The GLAS laser transmitter produces 6 ns wide pulses with 70 mJ energy at 1064 nm at a 40 Hz rate. The altimeter receiver consists of a telescope, aft optics, a silicon avalanche photodiode, and electronic amplifiers. The transmitted and echo pulse waveforms are digitized at 1 GHz rate. The laser pulse time of flight is determined on the ground from the two digitized pulse waveforms and their positions in the full waveform record (about 5.4 ms ong) by computing the pulse centroids or by curve fitting. The GLAS receiver algorithms in on board software selects the two waveform segments containing the transmitted and the echo pulses and sends them to ground. The probability of echo pulse detection and the accuracy of time of flight measurement depend on the received signal level, the background light within the receiver field of view, the inherent detector and amplifier noise, the quantization of the digitizer, and some times by cloud obscurations. A receiver model has been developed to calculate the probability of detection and accuracy of the altimeter measurements with these noise sources. From prelaunch testing, the minimum detectable echo pulse energy for 90% detection probability was about 0.1 fj/pulse onto the detector. Such a receiver sensitivity allows GLAS to measure the surface height through clouds with optical density less than 2. The echo pulse energy required to achieve 10 cm ranging accuracy was found to be about 3 times higher than the minimum detectable signal level. The smallest single shot range measurement error, which was determined by ranging to a fixed target with strong echo pulses and no background light, was 2 to 3cm. The maximum linear response echo pulse energy was 10 fJ/pulse for the strongest echo signals, assuming a Lambertian scattering snow surface, clear sky atmosphere transmission, and no pulse width spreading due to surface slopes. Results from the initial 38 days of GLAS operation on-orbit with Laser 1, showed the echo pulse energies varied, as expected, over a wide dynamic range due to the variability of atmosphere transmission and Earth surface characteristics. The receiver was able to reliably detect the ground surface echoes and measure time of flight under such dynamic conditions, except when there were dense clouds. When over Antarctica, the echo pulse energies were several times stronger than predicted. This suggests that the 1064 nm backscattering from the snow pack and ice-sheet &ce are not completely Lambertian but is somewhat peaked at opposit.ion. With Laser 1, the peak amplitude of the echo pulses from flat ice sheets under clear sky conditions exceeded the linear response range of the receiver, causing some pulse waveform distortion due to saturation. We have characterized the effects of receiver saturation on the time of flight, pulse width, and pulse energy measurements for flat surface by testing a night spare detector in the lab with simulated echo pulses. A data processing algorithm that minimizes the errors due to saturation for these measurements are described.

Sun, Xiao-Li↗

Efficient demultiplexing algorithm for noncontiguous carriers

A channel separation algorithm for the frequency division multiple access/time division multiplexing (FDMA/TDM) scheme is presented. It is shown that implementation using this algorithm can be more effective than the fast Fourier transform (FFT) algorithm when only a small number of carriers need to be selected from many, such as satellite Earth terminals. The algorithm is based on polyphase filtering followed by application of a generalized Walsh-Hadamard transform (GWHT). Comparison of the transform technique used in this algorithm with discrete Fourier transform (DFT) and FFT is given. Estimates of the computational rates and power requirements to implement this system are also given.

Thanawala, A. A.↗

Quantum Adiabatic Algorithms and Large Spin Tunnelling

We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.

Boulatov, A.↗

On the feasibility of closed-loop control of intra-aortic balloon pumping

A closed-loop control scheme for the control of intra-aortic balloon pumping has been developed and tested in dog experiments. A performance index reflecting the general objectives of balloon-assist pumping is developed and a modified steepest ascent control algorithm is utilized for the selection of a proper operating point for the balloon during its pumping cycle. This paper attempts to indicate the feasibility of closed-loop control of balloon pumping, and particularly its flexibility in achieving both diastolic augmentation of mean aortic pressure and control of the level of end-diastolic pressure (EDP) an important factor in reducing heart work.

Clark, J. W., Jr.↗

A state-of-the-art review of transportation systems evaluation techniques relevant to air transportation, volume 1

Mathematical and philosophical approaches are presented for evaluation and implementation of ground and air transportation systems. Basic decision processes are examined that are used for cost analyses and planning (i.e, statistical decision theory, linear and dynamic programming, optimization, game theory). The effects on the environment and the community that a transportation system may have are discussed and modelled. Algorithmic structures are examined and selected bibliographic annotations are included. Transportation dynamic models were developed. Citizen participation in transportation projects (i.e, in Maryland and Massachusetts) is discussed. The relevance of the modelling and evaluation approaches to air transportation (i.e, airport planning) is examined in a case study in St. Louis, Missouri.

Haefner, L. E.↗

Wing design by numerical optimization

A study was conducted to assess the feasibility of performing computerized wing design by numerical optimization. The design program combined a full potential, inviscid aerodynamics code with a conjugate gradient optimization algorithm. Three design problems were selected to demonstrate the design technique. The first involved modifying the upper surface of the inboard 50% of a swept wing to reduce the shock drag subject to a constraint on wing volume. The second involved modifying the entire upper surface of the same swept wing (except the tip section) to increase the lift-drag ratio subject to constraints on wing volume and lift coefficient. The final problem involved modifying the inboard 50% of a low-speed wing to achieve good stall progression. Results from the three cases indicate that the technique is sufficiently accurate to permit substantial improvement in the design objectives.

Hicks, R. M.↗

Landsat digital data application to forest vegetation and land use classification in Minnesota

Landsat digital data were used to map eleven categories of land cover in north central Minnesota. The classification accuracy of these maps was found to be very low and they were not adequate for use by field level resource managers. A discussion of the advantages and disadvantages of various processing systems, different algorithms, and the problems in selecting training sets, is included.

Mead, R. A.↗

Transient natural convection heat and mass transfer in crystal growth

A numerical analysis of transient combined heat and mass transfer across a rectangular cavity is performed by a numerical method based on the SIMPLE algorithm. The physical parameters are selected to represent a range of possible crystal growth in solutions. Numerical results are compared with available experimental data to confirm the accuracy of the results. Good qualitative agreements are obtained for the average mass transfer rate across the cavity. Also, qualitative agreements are observed for the global development of thermal and solute fields. It is found that the thermal and solute fields become highly oscillatory when the thermal and solute Grashof numbers are large. Oscillations are probably caused by a number of different instability mechanisms. By reducing the gravity some of these instabilities were made to disappear at the lower Grashof numbers. Transient temperature and solute distribution near the crystal growing surface are highly non-uniform at the higher Grashof numbers. These non-uniformities are less severe in the reduced gravity environments but still exist. The effects of convection on the rate of average mass transfer are more than one order of magnitude higher than those of conduction in the range of Grashof numbers studied. Dependency of mass transfer rate on the Grashof number indicates that the convection effects many not be negligible even in the microgravity environments for the range of parameters investigated.

Han, Samuel S.↗

Knowledge-based low-level image analysis for computer vision systems

Two algorithms for entry-level image analysis and preliminary segmentation are proposed which are flexible enough to incorporate local properties of the image. The first algorithm involves pyramid-based multiresolution processing and a strategy to define and use interlevel and intralevel link strengths. The second algorithm, which is designed for selected window processing, extracts regions adaptively using local histograms. The preliminary segmentation and a set of features are employed as the input to an efficient rule-based low-level analysis system, resulting in suboptimal meaningful segmentation.

Dhawan, Atam P.↗

Doppler centroid estimation ambiguity for synthetic aperture radars

A technique for estimation of the Doppler centroid of an SAR in the presence of large uncertainty in antenna boresight pointing is described. Also investigated is the image degradation resulting from data processing that uses an ambiguous centroid. Two approaches for resolving ambiguities in Doppler centroid estimation (DCE) are presented: the range cross-correlation technique and the multiple-PRF (pulse repetition frequency) technique. Because other design factors control the PRF selection for SAR, a generalized algorithm is derived for PRFs not containing a common divisor. An example using the SIR-C parameters illustrates that this algorithm is capable of resolving the C-band DCE ambiguities for antenna pointing uncertainties of about 2-3 deg.

Chang, C. Y.↗

Functional expansion representations of artificial neural networks

In the past few years, significant interest has developed in using artificial neural networks to model and control nonlinear dynamical systems. While there exists many proposed schemes for accomplishing this and a wealth of supporting empirical results, most approaches to date tend to be ad hoc in nature and rely mainly on heuristic justifications. The purpose of this project was to further develop some analytical tools for representing nonlinear discrete-time input-output systems, which when applied to neural networks would give insight on architecture selection, pruning strategies, and learning algorithms. A long term goal is to determine in what sense, if any, a neural network can be used as a universal approximator for nonliner input-output maps with memory (i.e., realized by a dynamical system). This property is well known for the case of static or memoryless input-output maps. The general architecture under consideration in this project was a single-input, single-output recurrent feedforward network.

Gray, W. Steven↗

Performance considerations for the application of the lossless browse and residual model

A hybrid lossless compression model employing both the (lossy) JPEG DCT algorithm and one of a selection of lossless image compression methods has been tested. The hybrid model decomposes the original image into a low-loss quick-look browse and a residual image. The lossless compression methods tested in the model are Huffman, arithmetic, LZW, lossless JPEG, and diagonal coding. For both the direct and the hybrid application of these lossless methods, the compression ratios (CR's) are calculated and compared on three test images. For each lossless method tested, the hybrid model had no more than a nominal loss in compression efficiency relative to the direct approach. In many cases, the hybrid model provided a significant compression gain. When used in the hybrid model, lossless JPEG outperformed the other lossless methods over a broad range of browse image qualities.

Abbott, Walter D., III↗

Performance prediction: A case study using a multi-ring KSR-1 machine

While computers with tens of thousands of processors have successfully delivered high performance power for solving some of the so-called 'grand-challenge' applications, the notion of scalability is becoming an important metric in the evaluation of parallel machine architectures and algorithms. In this study, the prediction of scalability and its application are carefully investigated. A simple formula is presented to show the relation between scalability, single processor computing power, and degradation of parallelism. A case study is conducted on a multi-ring KSR1 shared virtual memory machine. Experimental and theoretical results show that the influence of topology variation of an architecture is predictable. Therefore, the performance of an algorithm on a sophisticated, heirarchical architecture can be predicted and the best algorithm-machine combination can be selected for a given application.

Sun, Xian-He↗