Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 973 records · Page 54

Microwave holography of large reflector antennas - Simulation algorithms

The performance of large reflector antennas can be improved by identifying the location and amount of their surface distortions and correcting them. To determine the accuracy of the constructed surface profiles, simulation studies are used to incorporate both the effects of systematic and random distortions, particularly the effects of the displaced surface panels. In this paper, different simulation models are investigated, emphasizing a model based on the vector diffraction analysis of a curved reflector with displaced panels. The simulated far-field patterns are then used to reconstruct the location and amount of displacement of the surface panels by employing a fast Fourier transform/iterative procedure. The sensitivity of the microwave holography technique based on the number of far-field sampled points, level of distortions, polarizations, illumination tapers, etc., is also examined.

Rahmat-Samii, Y.↗

Optimization methods, flux conserving methods for steady state Navier-Stokes equation

Navier-Stokes equation as discretized by new flux conserving method proposed by Chang and Scott results in the system: vector F(vector x) = 0, where F is a vector valued function. The Optimization method we use is based on Quasi-Newton methods: given a nonlinear function vector F(vector x) = 0, we solve, Delta(vector x) = -BF(vector x), where Delta(vector x) is the correction term and B is the inverse Jacobian of F(x). Then, iteratively, vector(x(sub (i+1))) = vector(x (sub i)) + alpha.Delta(vector x(sub i)), where alpha is a line search correction term determined by a line search routine. We use the BFCG's update the Jacobian matrix B(sub k) at each iteration. It is well known that B(sub k) approaches B(*) at the solution X(*). This algorithm has several advantages over the Newton-Raphson method. For example, we do not need to calculate the Jacobian matrix at each iteration which is computationally very expensive.

Adeyeye, John↗

Acoustic Calibration of the Exterior Effects Room at the NASA Langley Research Center

The Exterior Effects Room (EER) at the NASA Langley Research Center is a 39-seat auditorium built for psychoacoustic studies of aircraft community noise. The original reproduction system employed monaural playback and hence lacked sound localization capability. In an effort to more closely recreate field test conditions, a significant upgrade was undertaken to allow simulation of a three-dimensional audio and visual environment. The 3D audio system consists of 27 mid and high frequency satellite speakers and 4 subwoofers, driven by a real-time audio server running an implementation of Vector Base Amplitude Panning. The audio server is part of a larger simulation system, which controls the audio and visual presentation of recorded and synthesized aircraft flyovers. The focus of this work is on the calibration of the 3D audio system, including gains used in the amplitude panning algorithm, speaker equalization, and absolute gain control. Because the speakers are installed in an irregularly shaped room, the speaker equalization includes time delay and gain compensation due to different mounting distances from the focal point, filtering for color compensation due to different installations (half space, corner, baffled/unbaffled), and cross-over filtering.

Faller, Kenneth J., II↗

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-of-the-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Deep-learning↗

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-ofthe-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Hesham ElAbd↗

Universal Decoder for PPM of any Order

A recently developed algorithm for demodulation and decoding of a pulse-position- modulation (PPM) signal is suitable as a basis for designing a single hardware decoding apparatus to be capable of handling any PPM order. Hence, this algorithm offers advantages of greater flexibility and lower cost, in comparison with prior such algorithms, which necessitate the use of a distinct hardware implementation for each PPM order. In addition, in comparison with the prior algorithms, the present algorithm entails less complexity in decoding at large orders. An unavoidably lengthy presentation of background information, including definitions of terms, is prerequisite to a meaningful summary of this development. As an aid to understanding, the figure illustrates the relevant processes of coding, modulation, propagation, demodulation, and decoding. An M-ary PPM signal has M time slots per symbol period. A pulse (signifying 1) is transmitted during one of the time slots; no pulse (signifying 0) is transmitted during the other time slots. The information intended to be conveyed from the transmitting end to the receiving end of a radio or optical communication channel is a K-bit vector u. This vector is encoded by an (N,K) binary error-correcting code, producing an N-bit vector a. In turn, the vector a is subdivided into blocks of m = log2(M) bits and each such block is mapped to an M-ary PPM symbol. The resultant coding/modulation scheme can be regarded as equivalent to a nonlinear binary code. The binary vector of PPM symbols, x is transmitted over a Poisson channel, such that there is obtained, at the receiver, a Poisson-distributed photon count characterized by a mean background count nb during no-pulse time slots and a mean signal-plus-background count of ns+nb during a pulse time slot. In the receiver, demodulation of the signal is effected in an iterative soft decoding process that involves consideration of relationships among photon counts and conditional likelihoods of m-bit vectors of coded bits. Inasmuch as the likelihoods of all the m-bit vectors of coded bits mapping to the same PPM symbol are correlated, the best performance is obtained when the joint mbit conditional likelihoods are utilized. Unfortunately, the complexity of decoding, measured in the number of operations per bit, grows exponentially with m, and can thus become prohibitively expensive for large PPM orders. For a system required to handle multiple PPM orders, the cost is even higher because it is necessary to have separate decoding hardware for each order. This concludes the prerequisite background information. In the present algorithm, the decoding process as described above is modified by, among other things, introduction of an lbit marginalizer sub-algorithm. The term "l-bit marginalizer" signifies that instead of m-bit conditional likelihoods, the decoder computes l-bit conditional likelihoods, where l is fixed. Fixing l, regardless of the value of m, makes it possible to use a single hardware implementation for any PPM order. One could minimize the decoding complexity and obtain an especially simple design by fixing l at 1, but this would entail some loss of performance. An intermediate solution is to fix l at some value, greater than 1, that may be less than or greater than m. This solution makes it possible to obtain the desired flexibility to handle any PPM order while compromising between complexity and loss of performance.

Moision, Bruce E.↗

Results of the Magnetometer Navigation (MAGNAV) Inflight Experiment

The Magnetometer Navigation (MAGNAV) algorithm is currently running as a flight experiment as part of the Wide Field Infrarad Explorer Post-Science Engineer- ing Testbed. Initialization of MAGNAV occured on September 4, 2004. MAGNAV is designed to autonomously estimate the spacecraft orbit, attitude, and rate using magnetometer and sun sensor data. Since the earth s magnetic field is a function of time and position, and since time is known quite precisely, the differences between the computed magnetic field and measured magnetic field components, as measured by the magnetometer throughout the entire spacecraft orbit, are a function of the spacecraft trajectory and attitude errors. Therefore, these errors are used to estimate both trajec- tory and attitude. In addition, the time rate of change of the magnetic field vector is used to estimate the spacecraft rotation rate. The estimation of the attitude and tra- jectory is augmented with the rate estimation into an Extended Kalman filter blended with a pseudc-linear Kalman filter. Sun sensor data is also used to improve the accu- racy and observability of the attitude and rate estimates. This test serves to validate MAGNAV as a single low cost navigation system which utilizes reliable, flight qualified sensors. MAGNAV is intended as a backup algorithm, an initialization algorithm, or possibly a prime navigation algorithm for a mission with coarse constraints.

Thienel, Julie↗

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗

Color graphics techniques for shaded surface displays of aerodynamic flowfield parameters

A variety of algorithms are presented that are useful in the color graphics displays of large sets of three-dimensional aerodynamic data. These methods augment established techniques for rapidly and interactively reviewing an assortment of smooth-shaded, color-coded illustrations for experimental and computational distributions of both scalar and vector quantities.

Weston, Robert P.↗

A Study of Fluid Interface Configurations in Exploration Vehicle Propellant Tanks

The equilibrium shape and location of fluid interfaces in spacecraft propellant tanks while in low-gravity is of interest to system designers, but can be challenging to predict. The propellant position can affect many aspects of the spacecraft such as the spacecraft center of mass, response to thruster firing due to sloshing, liquid acquisition, propellant mass gauging, and thermal control systems. We use Surface Evolver, a fluid interface energy minimizing algorithm, to investigate theoretical equilibrium liquid-vapor interfaces for spacecraft propellant tanks similar to those that have been considered for NASA's new class of Exploration vehicles. The choice of tank design parameters we consider are derived from the NASA Exploration Systems Architecture Study report. The local acceleration vector employed in the computations is determined by estimating low-Earth orbit (LEO) atmospheric drag effects and centrifugal forces due to a fixed spacecraft orientation with respect to the Earth or Moon, and rotisserie-type spacecraft rotation. Propellant/vapor interface positions are computed for the Earth Departure Stage and Altair lunar lander descent and ascent stage tanks for propellant loads applicable to LEO and low-lunar orbit. In some of the cases investigated the vapor ullage bubble is located at the drain end of the tank, where propellant management device hardware is often located.

Zimmerli, Gregory A.↗

Geometrical analysis of Cys-Cys bridges in proteins and their prediction from incomplete structural information

Analysis of C-alpha atom positions from cysteines involved in disulphide bridges in protein crystals shows that their geometric characteristics are unique with respect to other Cys-Cys, non-bridging pairs. They may be used for predicting disulphide connections in incompletely determined protein structures, such as low resolution crystallography or theoretical folding experiments. The basic unit for analysis and prediction is the 3 x 3 distance matrix for Cx positions of residues (i - 1), Cys(i), (i +1) with (j - 1), Cys(j), (j + 1). In each of its columns, row and diagonal vector--outer distances are larger than the central distance. This analysis is compared with some analytical models.

NASA Discipline Exobiology↗

Automated thematic mapping and change detection of ERTS-1 images

Results of an automated thematic mapping investigation using ERTS-1 MSS images are presented. A diffraction pattern analysis of MSS images led to the development of spatial signatures for farm land, urban areas, and mountains. Four spatial features are employed to describe the spatial characteristics of image cells in the digital data. Three spectral features are combined with the spatial features to form a seven dimensional vector describing each cell. Then, the classification of the feature vectors is accomplished by using the maximum likelihood criterion. Three ERTS-1 images from the Phoenix, Arizona area were processed, and recognition rates between 85% and 100% were obtained for the terrain classes of desert, farms, mountains and urban areas. To eliminate the need for training data, a new clustering algorithm has also been developed.

Gramenopoulos, N.↗

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure distributions and drag-to-lift ration minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure disributions and drag-to-lift ratio minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗

Comparison of Seasat scatterometer winds with tropical Pacific observations

The Seasat-A satellite scatterometer (SASS) observed near-surface vector winds over the world ocean from an 800-km orbit by measuring radar backscatter from the wind-roughened surface. To increase the geographical range of SASS and in situ comparison experiments, data from nine islands in the tropical Pacific and contemporaneous scatterometer winds were compared. The SASS-2 algorithm due to Wentz provides clearly better agreement in wind speed than the earlier SASS-1 algorithm. SASS-1 speeds tend to be higher than the island measurements by about 1 m/s, while daily mean SASS-2 minus island wind speed differences average -0.07 m/s. The rms differences between SASS-2 and the daily mean island data average 1.7 m/s, the SASS-1 rms differences average 2.2 m/s.

Davison, Jerry↗

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗

Comments regarding two upwind methods for solving two-dimensional external flows using unstructured grids

Steady flow over the leading portion of a multicomponent airfoil section is studied using computational fluid dynamics (CFD) employing an unstructured grid. To simplify the problem, only the inviscid terms are retained from the Reynolds-averaged Navier-Stokes equations - leaving the Euler equations. The algorithm is derived using the finite-volume approach, incorporating explicit time-marching of the unsteady Euler equations to a time-asymptotic, steady-state solution. The inviscid fluxes are obtained through either of two approximate Riemann solvers: Roe's flux difference splitting or van Leer's flux vector splitting. Results are presented which contrast the solutions given by the two flux functions as a function of Mach number and grid resolution. Additional information is presented concerning code verification techniques, flow recirculation regions, convergence histories, and computational resources.

Kleb, W. L.↗

Adjoint Methods for Adjusting Three-Dimensional Atmosphere and Surface Properties to Fit Multi-Angle/Multi-Pixel Polarimetric Measurements

This paper derives an efficient procedure for using the three-dimensional (3D) vector radiative transfer equation (VRTE) to adjust atmosphere and surface properties and improve their fit with multi-angle/multi-pixel radiometric and polarimetric measurements of scattered sunlight. The proposed adjoint method uses the 3D VRTE to compute the measurement misfit function and the adjoint 3D VRTE to compute its gradient with respect to all unknown parameters. In the remote sensing problems of interest, the scalar-valued misfit function quantifies agreement with data as a function of atmosphere and surface properties, and its gradient guides the search through this parameter space. Remote sensing of the atmosphere and surface in a three-dimensional region may require thousands of unknown parameters and millions of data points. Many approaches would require calls to the 3D VRTE solver in proportion to the number of unknown parameters or measurements. To avoid this issue of scale, we focus on computing the gradient of the misfit function as an alternative to the Jacobian of the measurement operator. The resulting adjoint method provides a way to adjust 3D atmosphere and surface properties with only two calls to the 3D VRTE solver for each spectral channel, regardless of the number of retrieval parameters, measurement view angles or pixels. This gives a procedure for adjusting atmosphere and surface parameters that will scale to the large problems of 3D remote sensing. For certain types of multi-angle/multi-pixel polarimetric measurements, this encourages the development of a new class of three-dimensional retrieval algorithms with more flexible parametrizations of spatial heterogeneity, less reliance on data screening procedures, and improved coverage in terms of the resolved physical processes in the Earth's atmosphere.

linearization↗