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 271 records · Page 15

A k-permutation algorithm for Fixed Satellite Service orbital allotments

A satellite system synthesis problem, the satellite location problem (SLP), is addressed in this paper. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the Fixed Satellite Service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: (1) the problem of ordering the satellites and (2) the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed.

Reilly, Charles H.↗

Optimal reconfiguration strategy for a degradable multimodule computing system

The present quantitative approach to the problem of reconfiguring a degradable multimode system assigns some modules to computation and arranges others for reliability. By using expected total reward as the optimal criterion, there emerges an active reconfiguration strategy based not only on the occurrence of failure but the progression of the given mission. This reconfiguration strategy requires specification of the times at which the system should undergo reconfiguration, and the configurations to which the system should change. The optimal reconfiguration problem is converted to integer nonlinear knapsack and fractional programming problems.

Lee, Yann-Hang↗

A satellite system synthesis model for orbital arc allotment optimization

A mixed-integer programming formulation is presented of a satellite system synthesis problem, or geostationary-orbital-planning synthesis problem, which is refered to as the arc allotment problem (AAP). Each satellite administration is to be allotted a weighted-length segment of the geostationary orbital arc within which its satellites may be positioned at any longitude. The objective function maximizes the length of the unweighted arc segment allotted to every administration, subject to single-entry cochannel interference restrictions and constraints imposed by the visible arc for each administration. Useful relationships between special cases of AAP and another satellite synthesis problem are established. Solutions to two example problems are presented.

Reilly, Charles H.↗

Effects of nonlinear damping in flexible space structures

The classical Krylov-Bogoliubov "averaging" technique is used to study a class of nonlinear damping models, for which the damping force is proportional to the product of positive integer or fractional power of absolute values of displacement and that of velocity. The results are compared with linear viscous damping models. The amplitude decrement of free vibration for a single mode system with nonlinear models depends not only on damping ratio, but also on the initial amplitude, the time to measure the response, frequency of the system, and the powers of displacement and velocity. For the distributed system, the action of nonlinear damping is found to reduce energy of the system as well as to pass energy to higher modes. Experimental evidence such as in Spacecraft Control Laboratory Experiment seems to support the need for nonlinear models.

Hu, Anren↗

Engineering calculations for solving the orbital allotment problem

Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.

Reilly, C.↗

A decomposition-based design optimization method with applications

A two-level design optimization metholology is described. A progress report of its application to Printed Wiring Board (PWB) assembly examples is given. The design of PWB assemblies is a complex task which is generally conducted as a sequential process. Individual PWBs are usually designed first, followed by the composition of the PWBs into an assembly. As a result, optimizing design considerations such as assembly reliability cannot be accomplished. This study showed that a two-level decomposition method can be employed to optimize for reliability at both the PWB- and the assembly-level in a coupled manner. The two-level decomposition method also resolved the mixed-integer nonlinear programming nature of the problem rather easily.

Azarm, Shapour↗

Exact computation of the unwrapped phase of a finite-length time series

McGowan and Kuc (1982) showed that a direct relationship between a time series and its unwrapped phase exists. They proposed an algorithm for computing the unwrapped phase by counting the number of sign changes in a Sturm sequence generated from the real and imaginary parts of the discrete Fourier transform. Their algorithm is limited to relatively short sequences by numerical accuracy. An extension of their algorithm is proposed which, by using all-integer arithmetic, permits exact computation of the number of multiples of pi required to determine the unwrapped phase for rational-valued time sequences of arbitrary length. Since the computation is exact, the extended numerical algorithm should be of interest when accurate phase unwrapping is required.

Long, David G.↗

A new Space Station power system

A new concept for a Space Station power system is proposed which reduces the drag effect of the solar panels and eliminates eclipsing by the Earth. The solar generator is physically separated from the Space Station, and power transmitted to the station by a microwave beam. The power station can thus be placed high enough that drag is not a significant factor. For a resonant orbit where the ratio of periods s:p is a ratio of odd integers, and the orbital planes nearly perpendicular, an orbit can be chosen such that the line of sight is never blocked if the lower orbit has an altitude greater than calculatable mininum. For the 1:3 resonance, this minimum altitude is 0.5 r(e). Finally, by placing the power station into a sun-synchronous orbit, it can be made to avoid shadowing by the Earth, thus providing continuous power.

Landis, Geoffrey A.↗

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗

Classical geometries defined by exterior differential systems on higher frame bundles

Exterior differential ideals are discussed, and sets of invariant generators presented, for Reimannian, conformal and projective geometries, and for specializations such as Ricci-flat, self-dual and Einstein-Maxwell theories. The Cartan characteristic integers are explicitly calculated, and involutory basis forms found, for each of these (specialized to four dimensions), exposing their algebraic structure and showing how they generate well-posed sets of partial differential equations.

Estabrook, Frank B.↗

Method of resolving radio phase ambiguity in satellite orbit determination

For satellite orbit determination, the most accurate observable available today is microwave radio phase, which can be differenced between observing stations and between satellites to cancel both transmitter- and receiver-related errors. For maximum accuracy, the integer cycle ambiguities of the doubly differenced observations must be resolved. To perform this ambiguity resolution, a bootstrapping strategy is proposed. This strategy requires the tracking stations to have a wide ranging progression of spacings. By conventional 'integrated Doppler' processing of the observations from the most widely spaced stations, the orbits are determined well enough to permit resolution of the ambiguities for the most closely spaced stations. The resolution of these ambiguities reduces the uncertainty of the orbit determination enough to enable ambiguity resolution for more widely spaced stations, which further reduces the orbital uncertainty. In a test of this strategy with six tracking stations, both the formal and the true errors of determining Global Positioning System satellite orbits were reduced by a factor of 2.

Councelman, Charles C., III↗

Carrier phase ambiguity resolution for the Global Positioning System applied to geodetic baselines up to 2000 km

A technique for resolving the ambiguities in the GPS carrier phase data (which are biased by an integer number of cycles) is described which can be applied to geodetic baselines up to 2000 km in length and can be used with dual-frequency P code receivers. The results of such application demonstrated that a factor of 3 improvement in baseline accuracy could be obtained, giving centimeter-level agreement with coordinates inferred by very-long-baseline interferometry in the western United States. It was found that a method using pseudorange data is more reliable than one using ionospheric constraints for baselines longer than 200 km. It is recommended that future GPS networks have a wide spectrum of baseline lengths (ranging from baselines shorter than 100 km to those longer than 1000 km) and that GPS receivers be used which can acquire dual-frequency P code data.

Blewitt, Geoffrey↗

Configuration space representation in parallel coordinates

By means of a system of parallel coordinates, a nonprojective mapping from R exp N to R squared is obtained for any positive integer N. In this way multivariate data and relations can be represented in the Euclidean plane (embedded in the projective plane). Basically, R squared with Cartesian coordinates is augmented by N parallel axes, one for each variable. The N joint variables of a robotic device can be represented graphically by using parallel coordinates. It is pointed out that some properties of the relation are better perceived visually from the parallel coordinate representation, and that new algorithms and data structures can be obtained from this representation. The main features of parallel coordinates are described, and an example is presented of their use for configuration space representation of a mechanical arm (where Cartesian coordinates cannot be used).

Fiorini, Paolo↗

Cumulative Poisson Distribution Program

Overflow and underflow in sums prevented. Cumulative Poisson Distribution Program, CUMPOIS, one of two computer programs that make calculations involving cumulative Poisson distributions. Both programs, CUMPOIS (NPO-17714) and NEWTPOIS (NPO-17715), used independently of one another. CUMPOIS determines cumulative Poisson distribution, used to evaluate cumulative distribution function (cdf) for gamma distributions with integer shape parameters and cdf for X (sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Written in C.

Bowerman, Paul N.↗

Newton/Poisson-Distribution Program

NEWTPOIS, one of two computer programs making calculations involving cumulative Poisson distributions. NEWTPOIS (NPO-17715) and CUMPOIS (NPO-17714) used independently of one another. NEWTPOIS determines Poisson parameter for given cumulative probability, from which one obtains percentiles for gamma distributions with integer shape parameters and percentiles for X(sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Program written in C.

Bowerman, Paul N.↗

An Ada Linear-Algebra Software Package Modeled After HAL/S

New avionics software written more easily. Software package extends Ada programming language to include linear-algebra capabilities similar to those of HAL/S programming language. Designed for such avionics applications as Space Station flight software. In addition to built-in functions of HAL/S, package incorporates quaternion functions used in Space Shuttle and Galileo projects and routines from LINPAK solving systems of equations involving general square matrices. Contains two generic programs: one for floating-point computations and one for integer computations. Written on IBM/AT personal computer running under PC DOS, v.3.1.

Klumpp, Allan R.↗

Cosmic strings and baryon decay catalysis

Cosmic strings, like monopoles, can catalyze proton decay. For integer charged fermions, the cross section for catalysis is not amplified, unlike in the case of monopoles. The catalysis processes are reviewed both in the free quark and skyrmion pictures and the implications for baryogenesis are discussed. A computation of the cross section for monopole catalyzed skyrmion decay is presented using classical physics. Also discussed are some effects which can screen catalysis processes.

Gregory, Ruth↗

Basic mathematical function libraries for scientific computation

Ada packages implementing selected mathematical functions for the support of scientific and engineering applications were written. The packages provide the Ada programmer with the mathematical function support found in the languages Pascal and FORTRAN as well as an extended precision arithmetic and a complete complex arithmetic. The algorithms used are fully described and analyzed. Implementation assumes that the Ada type FLOAT objects fully conform to the IEEE 754-1985 standard for single binary floating-point arithmetic, and that INTEGER objects are 32-bit entities. Codes for the Ada packages are included as appendixes.

Galant, David C.↗