Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

An algorithm for recognition and localization of rotated and scaled objects

An algorithm for recognition and localization of objects, which is invariant to displacement and rotation, is extended to the recognition and localization of differently scaled, rotated, and displaced objects. The proposed algorithm provides an optimum way to find if a match exists between two objects that are scaled, rotated, and displaced, while the number of computations is of the same order as for equally scaled objects.

Peli, T.↗
NASA NTRS1981

Simplification of multiple Fourier series - An example of algorithmic approach

This paper describes one example of multiple Fourier series which originate from a problem of spectral analysis of time series data. The example is exercised here with an algorithmic approach which can be generalized for other series manipulation on a computer. The generalized approach is presently pursued towards applications to a variety of multiple series and towards a general purpose algorithm for computer algebra implementation.

Ng, E. W.↗
NASA NTRS1983

TRISCAN Antenna-Positioning Algorithm

TRISCAN scanning algorithm improves alinement between boresight of radar antenna and target. Algorithm originally developed for digitally pointed antennas in deep-space network; however, is possibly used in locating radio sources on Earth. TRISCAN estimates coordinate errors in hour angle and declination between predicted and true locations of radio source.

Bunce, R. C.↗
NASA NTRS1981

Real-time test of MOCS algorithm during Superflux 1980

A remote sensing experiment was conducted in which success depended upon the real-time use of an algorithm, generated from MOCS (multichannel ocean color sensor) data onboard the NASA P-3 aircraft, to direct the NOAA ship Kelez to oceanic stations where vitally needed sea truth could be collected. Remote data sets collected on two consecutive days of the mission were consistent with the sea truth for low concentrations of chlorophyll a. Two oceanic regions of special interest were located. The algorithm and the collected data are described.

Grew, G. W.↗
NASA NTRS1981

An algorithm for computing chlorophyll-a concentrations using a dual-frequency fluorosensor

An algorithm to be used on data from a dual-frequency fluorosensor (i.e. one using two wavelengths for excitation of chlorophyll-a fluorescence) to compute total chlorophyll-a concentration and to partition that chlorophyll between two color groups present in a mixed phytoplankton population is described. The algorithm is based on laboratory and field-testing experience gained with the airborne lidar oceanographic probing experiment fluorosensor.

Campbell, J. W.↗
NASA NTRS1981

Algorithm for fuel conservative horizontal capture trajectories

A real time algorithm for computing constant altitude fuel-conservative approach trajectories for aircraft is described. The characteristics of the trajectory computed were chosen to approximate the extremal trajectories obtained from the optimal control solution to the problem and showed a fuel difference of only 0.5 to 2 percent for the real time algorithm in favor of the extremals. The trajectories may start at any initial position, heading, and speed and end at any other final position, heading, and speed. They consist of straight lines and a series of circular arcs of varying radius to approximate constant bank-angle decelerating turns. Throttle control is maximum thrust, nominal thrust, or zero thrust. Bank-angle control is either zero or aproximately 30 deg.

Neuman, F.↗
NASA NTRS1981

An algorithm for minimum-cost set-point ordering in a cryogenic wind tunnel

An algorithm for minimum cost ordering of set points in a cryogenic wind tunnel is developed. The procedure generates a matrix of dynamic state transition costs, which is evaluated by means of a single-volume lumped model of the cryogenic wind tunnel and the use of some idealized minimum-costs, which is evaluated by means of a single-volume lumped model of the cryogenic wind tunnel and the use of some idealized minimum-cost state-transition control strategies. A branch and bound algorithm is employed to determine the least costly sequence of state transitions from the transition-cost matrix. Some numerical results based on data for the National Transonic Facility are presented which show a strong preference for state transitions that consume to coolant. Results also show that the choice of the terminal set point in an open odering can produce a wide variation in total cost.

Tripp, J. S.↗
NASA NTRS1981

Study of high speed complex number algorithms

A method of evaluating the radiation integral on the curved surface of a reflecting antenna is presented. A three dimensional Fourier transform approach is used to generate a two dimensional radiation cross-section along a planer cut at any angle phi through the far field pattern. Salient to the method is an algorithm for evaluating a subset of the total three dimensional discrete Fourier transform results. The subset elements are selectively evaluated to yield data along a geometric plane of constant. The algorithm is extremely efficient so that computation of the induced surface currents via the physical optics approximation dominates the computer time required to compute a radiation pattern. Application to paraboloid reflectors with off-focus feeds in presented, but the method is easily extended to offset antenna systems and reflectors of arbitrary shapes. Numerical results were computed for both gain and phase and are compared with other published work.

Heisler, R.↗
NASA NTRS1982

Algorithmic aspects of transient heat transfer problems in structures

It is noted that the application of finite element or finite difference techniques to the solution of transient heat transfer problems in structures often results in a stiff system of ordinary differential equations. Such systems are usually handled most efficiently by implicit integration techniques which require the solution of large and sparse systems of algebraic equations. The assembly and solution of these systems using the incomplete Cholesky conjugate gradient algorithm is examined. Several examples are used to demonstrate the advantage of the algorithm over other techniques.

Haftka, R. T.↗
NASA NTRS1981

An algorithm for automating the registration of USDA segment ground data to LANDSAT MSS data

The algorithm is referred to as the Automatic Segment Matching Algorithm (ASMA). The ASMA uses control points or the annotation record of a P-format LANDSAT compter compatible tape as the initial registration to relate latitude and longitude to LANDSAT rows and columns. It searches a given area of LANDSAT data with a 2x2 sliding window and computes gradient values for bands 5 and 7 to match the segment boundaries. The gradient values are held in memory during the shifting (or matching) process. The reconstructed segment array, containing ones (1's) for boundaries and zeros elsewhere are computer compared to the LANDSAT array and the best match computed. Initial testing of the ASMA indicates that it has good potential for replacing the manual technique.

Graham, M. H.↗
NASA NTRS1980

Algorithms for autonomous star identification

Algorithms for onboard autonomous star identification are presented. The algorithms are applicable to two types of spacecraft missions, those flown with nearly inertially fixed attitude (solar maximum mission type); and those flown with smoothly time varying attitude (LANDSAT-D type).

Source record↗
NASA NTRS1982

Algorithms for software development version control and change detection

Simple computer algorithms for processing source program and text data files in order to extract change detection, version control, version history, and current status information are described. These algorithms presuppose that it is possible to attach to each record of the source files a 6-character code, placed within delimiters that will cause the compiler, or other using program, to ignore this code field. The code contains a 2-character code for a character-by-character position-sensitive checksum of the record, another for the record number in the file, and a third for the data on which the encoding took place. Once the source file has been thus encoded, it is possible to detect the following transactions on the file since the most recent version coding; (1) addition of new records (having no version code), (2) modification of existing records, (3) deletion of a number of records, (4) movement and/or duplication of existing records, and (5) modification and duplication of records. In addition, it is possible to extract a version history of the number of records created or modified by date. A special file listing program is described which prints the file records without showing the version codes, but places a "change bar" at the right margin whenever a change is detected. The program also provides a list of changed pages and a version history.

Tausworthe, R. C.↗
NASA NTRS1982

A generalized memory test algorithm

A general algorithm for testing digital computer memory is presented. The test checks that (1) every bit can be cleared and set in each memory work, and (2) bits are not erroneously cleared and/or set elsewhere in memory at the same time. The algorithm can be applied to any size memory block and any size memory word. It is concise and efficient, requiring the very few cycles through memory. For example, a test of 16-bit-word-size memory requries only 384 cycles through memory. Approximately 15 seconds were required to test a 32K block of such memory, using a microcomputer having a cycle time of 133 nanoseconds.

Milner, E. J.↗
NASA NTRS1982

Research on numerical algorithms for large space structures

Numerical algorithms for large space structures were investigated with particular emphasis on decoupling method for analysis and design. Numerous aspects of the analysis of large systems ranging from the algebraic theory to lambda matrices to identification algorithms were considered. A general treatment of the algebraic theory of lambda matrices is presented and the theory is applied to second order lambda matrices.

Denman, E. D.↗
NASA NTRS1982

The VLSI design of a Reed-Solomon encoder using Berlekamps bit-serial multiplier algorithm

Realization of a bit-serial multiplication algorithm for the encoding of Reed-Solomon (RS) codes on a single VLSI chip using NMOS technology is demonstrated to be feasible. A dual basis (255, 223) over a Galois field is used. The conventional RS encoder for long codes ofter requires look-up tables to perform the multiplication of two field elements. Berlekamp's algorithm requires only shifting and exclusive-OR operations.

Truong, T. K.↗
NASA NTRS1982

Performance analysis for the expanding search PN acquisition algorithm

An approach is described for approximating the cumulative probability distribution of the acquisition time of the serial pseudonoise (PN) search algorithm. The results are applicable to both variable and fixed dwell time systems. The theory is developed for the case where some a priori information is available on the PN code epoch (reacquisition problem or acquisition of very long codes). Also considered is the special case of a search over the whole code. The accuracy of the approximation is demonstrated by comparisons with published exact results for the fixed dwell time algorithm.

Braun, W. R.↗