Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “integer”

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 163 records · Page 9

Nth-order flat approximation of the signum function by a polynomial

In the interval studied, the signum function, sgn x, was demonstrated to be uniquely approximated by an odd polynomial f sub n (x) of order 2n-1, for which the approximation is nth order flat with respect to the points (1,1) and (-1,-1). A theorem was proved which states that for even integers n or = 2, the approximating polynomial has a pair of nonzero real roots + or - x sub n such that the x sub n form a monotonically decreasing sequence which converges to the root of 2 as n approaches infinity. For odd n i, f sub n (x) represents a strictly increasing monotonic function for all real x. As n tends to infinity, f sub n (x) converges to sgn x uniformly in two interval ranges.

Hosenthien, H. H.↗

Astronauts' menu problem.

Consideration of the problems involved in choosing appropriate menus for astronauts carrying out SKYLAB missions lasting up to eight weeks. The problem of planning balanced menus on the basis of prepackaged food items within limitations on the intake of calories, protein, and certain elements is noted, as well as a number of other restrictions of both physical and arbitrary nature. The tailoring of a set of menus for each astronaut on the basis of subjective rankings of each food by the astronaut in terms of a 'measure of pleasure' is described, and a computer solution to this problem by means of a mixed integer programming code is presented.

Lesso, W. G.↗

Magnetic flux penetration into superconducting thin films.

The quantum-interference technique developed by Meservey (1965) is used to measure directly the absolute value of the penetration depth in lead in tin superconducting thin films. The technique assumes that the change in phase of the superconducting wave function around any contour within the superconductor must be 2 pi n, where n is a nonnegative integer. Results show that the critical current of a superconducting interferometer with two parallel junctions is not strictly periodic in the applied magnetic flux with a period equal to the flux quantum because of the magnetic field dependence of the critical currents of the junctions.

Peabody, G. E.↗

Binary concatenated coding system

Coding, using 3-bit binary words, is applicable to any measurement having integer scale up to 100. System using 6-bit data words can be expanded to read from 1 to 10,000, and 9-bit data words can increase range to 1,000,000. Code may be ''read'' directly by observation after memorizing simple listing of 9's and 10's.

Monford, L. G., Jr.↗

Serial segment method for measuring remnant

For tracking tasks where a sum of sine waves forcing function is used it is often difficult and/or expensive to obtain the pilot's remnant in the vicinity of the sine waves. For the case where each sine wave has at least four times an integer number of cycle per run length, this paper illustrates the serial segments method for measuring remnant power spectral density in a frequency band centered on each sine wave. This method can be implemented on digital, hybrid, or analog Fourier coefficient analyzers, and is particularly advantageous on the latter since properties of Fourier coefficients are exploited to yield both a remnant measure and an improved estimate of the correlated component.

Magdaleno, R. E.↗

Fast digital noise filter capable of locating spectral peaks and shoulders

Experimental data frequently have a poor signal-to-noise ratio which one would like to enhance before analysis. With the data in digital form, this may be accomplished by means of a digital filter. A fast digital filter based upon the principle of least squares and using the techniques of convoluting integers is described. In addition to smoothing, this filter also is capable of accurately and simultaneously locating spectral peaks and shoulders. This technique has been adapted into a computer subroutine, and results of several test cases are shown, including mass spectral data and data from a proportional counter for the High Energy Astronomy Observatory.

Edwards, T. R.↗

Counting digital filters

Several embodiments of a counting digital filter of the non-recursive type are disclosed. In each embodiment two registers, at least one of which is a shift register, are included. The shift register received j sub x-bit data input words bit by bit. The kth data word is represented by the integer.

Zohar, S.↗

Round-off errors in cutting plane algorithms based on the revised simplex procedure

This report statistically analyzes computational round-off errors associated with the cutting plane approach to solving linear integer programming problems. Cutting plane methods require that the inverse of a sequence of matrices be computed. The problem basically reduces to one of minimizing round-off errors in the sequence of inverses. Two procedures for minimizing this problem are presented, and their influence on error accumulation is statistically analyzed. One procedure employs a very small tolerance factor to round computed values to zero. The other procedure is a numerical analysis technique for reinverting or improving the approximate inverse of a matrix. The results indicated that round-off accumulation can be effectively minimized by employing a tolerance factor which reflects the number of significant digits carried for each calculation and by applying the reinversion procedure once to each computed inverse. If 18 significant digits plus an exponent are carried for each variable during computations, then a tolerance value of 0.1 x 10 to the minus 12th power is reasonable.

Moore, J. E.↗

Modular arithmetic weight and cyclic shifting.

This note shows that the modular arithmetic weight of an integer is invariant to the cyclic shifts of its radix-2 form. This result leads to a reduced search for the minimum weight codeword in a cyclic AN-code as well as to a better understanding of previous work.

Hartman, W. F.↗

An analytic study on bounds for the associated Legendre functions

The bounds for the normalized associated Legendre functions P sub nm were studied to provide a rational basis for the truncation of the geopotential series in spherical harmonics in various orbital analyses. The conjecture is made that the largest maximum of the normalized associated Legendre function lies in the interval which indicates the greatest integer function. A procedure is developed for verifying this conjecture. An on-line algebraic manipulator, IAM, is used to implement the procedure and the verification is carried out for all n equal to or less than 2m, for m = 1 through 6. A rigorous proof of the conjecture is not available.

Payne, M. H.↗

Frequency modulation television analysis: Threshold impulse analysis

A computer program is developed to calculate the FM threshold impulse rates as a function of the carrier-to-noise ratio for a specified FM system. The system parameters and a vector of 1024 integers, representing the probability density of the modulating voltage, are required as input parameters. The computer program is utilized to calculate threshold impulse rates for twenty-four sets of measured probability data supplied by NASA and for sinusoidal and Gaussian modulating waveforms. As a result of the analysis several conclusions are drawn: (1) The use of preemphasis in an FM television system improves the threshold by reducing the impulse rate. (2) Sinusoidal modulation produces a total impulse rate which is a practical upper bound for the impulse rates of TV signals providing the same peak deviations. (3) As the moment of the FM spectrum about the center frequency of the predetection filter increases, the impulse rate tends to increase. (4) A spectrum having an expected frequency above (below) the center frequency of the predetection filter produces a higher negative (positive) than positive (negative) impulse rate.

Hodge, W. H.↗

DORMAN computer program (study 2.5). Volume 2: User's guide and programmer's guide

The DORMAN program was developed to create and modify a data bank containing data decks which serve as input to the DORCA Computer Program. Via a remote terminal a user can access the bank, extract any data deck, modify that deck, output the modified deck to be input to the DORCA program, and save the modified deck in the data bank. This computer program is an assist in the utilization of the DORCA program. The program is dimensionless and operates almost entirely in integer mode. The program was developed on the CDC 6400/7600 complex for implementation on a UNIVAC 1108 computer.

Wray, S. T., Jr.↗

Time-fixed rendezvous by impulse factoring with an intermediate timing constraint

A method is presented for factoring a two-impulse orbital transfer into a three- or four-impulse transfer which solves the rendezvous problem and satisfies an intermediate timing constraint. Both the time of rendezvous and the intermediate time of a alinement are formulated as any element of a finite sequence of times. These times are integer multiples of a constant plus an additive constant. The rendezvous condition is an equality constraint, whereas the intermediate alinement is an inequality constraint. The two timing constraints are satisfied by factoring the impulses into collinear parts that vectorially sum to the original impulse and by varying the resultant period differences and the number of revolutions in each orbit. Five different types of solutions arise by considering factoring either or both of the two impulses into two or three parts with a limit for four total impulses. The impulse-factoring technique may be applied to any two-impulse transfer which has distinct orbital periods.

Green, R. N.↗

A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applications

Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.

Dupnick, E.↗

HAL/S programmer's guide

HAL/S is a programming language developed to satisfy the flight software requirements for the space shuttle program. The user's guide explains pertinent language operating procedures and described the various HAL/S facilities for manipulating integer, scalar, vector, and matrix data types.

Newbold, P. M.↗