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

Evaluation of GPS position and attitude determination for automated rendezvous and docking missions

The use of the Global Positioning System for position and attitude determination is evaluated for an automated rendezvous and docking mission. The typical mission scenario involves the chaser docking with the target for resupply or repair purposes, and is divided into three sections. During the homing phase, the chaser utilizes coarse acquisition pseudorange data to approach the target; guidance laws for this stage are investigated. In the second phase, differential carrier phase positioning is utilized. The chaser must maintain a quasiconstant distance from the target, in order to resolve the initial integer ambiguities. Once the ambiguities are determined, the terminal phase is entered, and the rendezvous is completed with continuous carrier phase tracking. Attitude knowledge is maintained in all phases through the use of the carrier phase observable. A Kalman filter is utilized to estimate all states from the noisy measurement data. The effects of selective availability and cycle slips are also investigated.

Diprinzio, Marc D.↗

Orbital resonances and Poynting-Robertson drag

The phenomenon of resonance trapping with Poynting-Robertson drag in the simplest case - the circular restricted three-body problem - is elucidated. Attention is given to what determines whether a grain of a given size passes through a given resonance or is trapped there, to how and why a trapped particle's orbit evolves with time, and to why Poynting-Robertson drag resonances are only temporary, while gas-drag resonances appear to be stable. The possibility of trapping a grain into resonance with a planet depends on the combination of the following parameters: the ratio of radiation pressure force to solar gravity, the mass of the perturbing planet normalized to the solar mass, an integer, and eccentricity. In general, the peak eccentricity and sometimes the threshold value are large enough so that crossing orbits and close approaches to the planet can inhibit capture and aid escape from resonance.

Weidenschilling, S. J.↗

Blocking reduction of Landsat Thematic Mapper JPEG browse images using optimal PSNR estimated spectra adaptive postfiltering

Two representative sample images of Band 4 of the Landsat Thematic Mapper are compressed with the JPEG algorithm at 8:1, 16:1 and 24:1 Compression Ratios for experimental browsing purposes. We then apply the Optimal PSNR Estimated Spectra Adaptive Postfiltering (ESAP) algorithm to reduce the DCT blocking distortion. ESAP reduces the blocking distortion while preserving most of the image's edge information by adaptively postfiltering the decoded image using the block's spectral information already obtainable from each block's DCT coefficients. The algorithm iteratively applied a one dimensional log-sigmoid weighting function to the separable interpolated local block estimated spectra of the decoded image until it converges to the optimal PSNR with respect to the original using a 2-D steepest ascent search. Convergence is obtained in a few iterations for integer parameters. The optimal logsig parameters are transmitted to the decoder as a negligible byte of overhead data. A unique maxima is guaranteed due to the 2-D asymptotic exponential overshoot shape of the surface generated by the algorithm. ESAP is based on a DFT analysis of the DCT basis functions. It is implemented with pixel-by-pixel spatially adaptive separable FIR postfilters. PSNR objective improvements between 0.4 to 0.8 dB are shown together with their corresponding optimal PSNR adaptive postfiltered images.

Linares, Irving↗

Fast computational scheme of image compression for 32-bit microprocessors

This paper presents a new computational scheme of image compression based on the discrete cosine transform (DCT), underlying JPEG and MPEG International Standards. The algorithm for the 2-d DCT computation uses integer operations (register shifts and additions / subtractions only); its computational complexity is about 8 additions per image pixel. As a meaningful example of an on-board image compression application we consider the software implementation of the algorithm for the Mars Rover (Marsokhod, in Russian) imaging system being developed as a part of Mars-96 International Space Project. It's shown that fast software solution for 32-bit microprocessors may compete with the DCT-based image compression hardware.

Kasperovich, Leonid↗

An algorithm for extraction of periodic signals from sparse, irregularly sampled data

Temporal gaps in discrete sampling sequences produce spurious Fourier components at the intermodulation frequencies of an oscillatory signal and the temporal gaps, thus significantly complicating spectral analysis of such sparsely sampled data. A new fast Fourier transform (FFT)-based algorithm has been developed, suitable for spectral analysis of sparsely sampled data with a relatively small number of oscillatory components buried in background noise. The algorithm's principal idea has its origin in the so-called 'clean' algorithm used to sharpen images of scenes corrupted by atmospheric and sensor aperture effects. It identifies as the signal's 'true' frequency that oscillatory component which, when passed through the same sampling sequence as the original data, produces a Fourier image that is the best match to the original Fourier space. The algorithm has generally met with succession trials with simulated data with a low signal-to-noise ratio, including those of a type similar to hourly residuals for Earth orientation parameters extracted from VLBI data. For eight oscillatory components in the diurnal and semidiurnal bands, all components with an amplitude-noise ratio greater than 0.2 were successfully extracted for all sequences and duty cycles (greater than 0.1) tested; the amplitude-noise ratios of the extracted signals were as low as 0.05 for high duty cycles and long sampling sequences. When, in addition to these high frequencies, strong low-frequency components are present in the data, the low-frequency components are generally eliminated first, by employing a version of the algorithm that searches for non-integer multiples of the discrete FET minimum frequency.

Wilcox, J. Z.↗

SEQ-GEN: A comprehensive multimission sequencing system

SEQ-GEN is a user-interactive computer program used to plan and generate a sequence of commands for spacecraft. Desired activities are specified by the user of SEQ-GEN; SEQ-GEN in turn expands these activities, deriving the spacecraft commands necessary to accomplish the desired activities. SEQ-GEN models the effects on the spacecraft of the commands, predicting the state as a function of time, flagging any conflicts and rule violations. These states, conflicts, and violations are viewable both graphically and textually at the user's request. SEQ-GEN also displays the entire sequence graphically, showing each requested activity as a bar on its graphical timeline. SEQ-GEN immediately revalidates the sequence, updating its models and calculations along with its displays based on these changes. Because it has the ability to recalculate spacecraft states immediately, the user is able to perform 'what-if' sessions easily. SEQ-GEN, a multimission tool, is adaptable to any flight project. A flight project writes its adaptation files containing project unique information including in its simplest form, only spacecraft commands. For more involved projects the adaptation files may also contain flight and mission rules, description of the spacecraft and ground models, and the definition of activities. SEQ-GEN operates at whatever level of detail the adaptation files imply. Simple adaptations are straight forward to do. There is, however, no limit to the complexity of activity definitions or of spacecraft models: both may involve unlimited logical decision points. Commands and activities may involve any number of parameters of a wide variety of data types, including integer, float, time, boolean, and character strings. SEQ-GEN will be used by the Mars Pathfinder, Cassini, and VIM (Voyager Interstellar Mission) project in an effort to speed up adaptation time and to keep sequence generation costs down. SEQ-GEN is hosted on UNIX workstations. It uses MOTIF and X for windowing, and was designed and coded in an object-oriented style in the language C++.

Salcedo, Jose↗

Multidisciplinary design optimization using genetic algorithms

Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

Unal, Resit↗

The orbital characteristics of debris particle rings as derived from IDE observations of multiple orbit intersections with LDEF

During the first 346 days of the LDEF's almost 6 year stay in space, the metal oxide silicon detectors of the Interplanetary Dust Experiment (IDE) recorded over 15,000 impacts, most of which were separated in time by integer multiples of the LDEF orbital period (called multiple orbit event sequences, or MOES). Simple celestial mechanics provides ample reason to expect that a good deal of information about the orbits of the impacting debris particles can be extracted from these MOES, and so a procedure, based on the work of Greenberg, has been developed and applied to one of these events, the so-called 'May swarm'. This technique, the 'Method of Differential Precession,' allows for the determination of the geometrical elements of a particle orbit from the change in the position of the impact point with time. The application of this approach to the May swarm gave the following orbital elements for the orbit of the particles striking LDEF during this MOES: a = 6746.5 km; 0.0165 less than e less than 0.025; i = 66.55 deg; Omega(sub 0) = 179.0 deg plus or minus 0.2 deg; omega = 178.1 deg plus or minus 0.2 deg.

Cooke, William J.↗

Data parallel sorting for particle simulation

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O (N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimun performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analyzed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

Dagum, Leonardo↗

Coagulation algorithms with size binning

The Smoluchowski equation describes the time evolution of an aerosol particle size distribution due to aggregation or coagulation. Any algorithm for computerized solution of this equation requires a scheme for describing the continuum of aerosol particle sizes as a discrete set. One standard form of the Smoluchowski equation accomplishes this by restricting the particle sizes to integer multiples of a basic unit particle size (the monomer size). This can be inefficient when particle concentrations over a large range of particle sizes must be calculated. Two algorithms employing a geometric size binning convention are examined: the first assumes that the aerosol particle concentration as a function of size can be considered constant within each size bin; the second approximates the concentration as a linear function of particle size within each size bin. The output of each algorithm is compared to an analytical solution in a special case of the Smoluchowski equation for which an exact solution is known . The range of parameters more appropriate for each algorithm is examined.

Statton, David M.↗

Nonaxisymmetric secular instabilities driven by star/disk coupling

We determine conditions for the onset of nonaxisymmetric secular instabilities in polytropes with a wide range of angular momentum distributions using Lagrangian techniques, and then calculate the growth rate of such instabilities when driven by the coupling of the perturbed star to a circumstellar disk. We use Langrangian displacement vectors with azimuthal dependence proportional to exp (im phi), where m is an integer and phi is the azimuthal coordinate. The onset of secular instability in terms of the quantity T/absolute value of W, the ratio of rotational kinetic energy to gravitational potential energy, is affected by both the compressibility and the angular momentum distribution of the polytrope. The largest effects occur when the angular momentum distribution is varied. For polytropic index n = 3/2, the onset of secular instability for the m = 2 mode (the bar mode), as determined by its neutral point, shifts from T/absolute value of W = 0.141 to 0.093, while the m = 5 mode neutral point shifts from T/absolute value of W = 0.088 to 0.031 over the range of angular momentum distributions we consider. The smallest critical T/absolute value of W-values occur for the angular momentum distributions which are the most peaked toward the equator. For the angular momentum distribution of a Maclaurin spheroid, as the polytropic index n is increased from 3/2 to 5/2, the neutral point for m = 2 shifts from T/absolute value of W = 0.141 to 0.144 and the netural point for m = 5 shifts from T/absolute value of W = 0.069 to 0.078. The netural points for m = 2 and 5 for the Maclaurin sequence (n = 0) are 0.137 and 0.0629, respectively. As the angular momentum distribution becomes more peaked toward the equatorial radius of the polytropes, the critical T/absolute value of W-values generally become less sensitive to the compressibility of the polytrope. Star/disk coupling can drive the secular instability in systems where the star is surrounded by a massive disk and, if the instability can grow to moderate amplitude, then the coupling can transport significant amounts of angular momentum from the star into the circumstellar disk. We find, for the particular case of rotating protostars during the accretion phase, that the instability growth time can be shorter than the accretion time. Further, if the instability can grow to amplitudes on the order of several percent, the star/disk coupling can remove angular momentum from the forming star faster than it is added by accretion.

Imamura, James, N.↗

Pseudocoherent Demodulation Of DPSK Radio Signals

Three schemes for pseudocoherent demodulation of differential-phase-shift keyed (DPSK) radio signals proposed for use in land-mobile/satellite communications. Enables fast reacquisition. Also amounts to compromise between two extremes of coherent demodulation and differentially coherent demodulation, for which bit-error rates greater than those of coherent demodulation by amounts corresponding to difference of about 1 dB in bit-energy/noise-energy ratio. Based on maximum-likelihood estimation and detection during N-symbol observation periods, where N integer typically chosen between 5 and 15.

Divsalar, Dariush↗

Computing Tolerance Factors And Noncentral t Distribution

TF, Tolerance Factors and Noncentral t Distribution computer program, computes tolerance factor from normal-distribution sample for arbitrarily specified coverage probability, confidence level, and any positive (integer or noninteger) number of degrees of freedom. Used extensively in engineering and quality analyses. Used in place of reference tables. Written in Microsoft QuickBasic v2.0.

Huang, Zhaofeng↗

Extracting Periodic Signals From Irregularly Sampled Data

Successive approximations formed in Fourier space. Algorithm extracts periodic signals from sparse, irregularly sampled sets of measurement data. Pertains to data processed via fast Fourier transforms (FFTs). Data represents signal components with initially unknown frequencies spanning large spectral range and includes frequencies not integer multiples of minimum FFT frequency.

Wilcox, Jaroslava Z.↗

Software For Tie-Point Registration Of SAR Data

SAR-REG software package registers synthetic-aperture-radar (SAR) image data to common reference frame based on manual tie-pointing. Image data can be in binary, integer, floating-point, or AIRSAR compressed format. For example, with map of soil characteristics, vegetation map, digital elevation map, or SPOT multispectral image, as long as user can generate binary image to be used by tie-pointing routine and data are available in one of the previously mentioned formats. Written in FORTRAN 77.

Rignot, Eric↗

Method for coding low entrophy data

A method of lossless data compression for efficient coding of an electronic signal of information sources of very low information rate is disclosed. In this method, S represents a non-negative source symbol set, (s(sub 0), s(sub 1), s(sub 2), ..., s(sub N-1)) of N symbols with s(sub i) = i. The difference between binary digital data is mapped into symbol set S. Consecutive symbols in symbol set S are then paired into a new symbol set Gamma which defines a non-negative symbol set containing the symbols (gamma(sub m)) obtained as the extension of the original symbol set S. These pairs are then mapped into a comma code which is defined as a coding scheme in which every codeword is terminated with the same comma pattern, such as a 1. This allows a direct coding and decoding of the n-bit positive integer digital data differences without the use of codebooks.

Yeh, Pen-Shu↗

Selecting a general-purpose data compression algorithm

The National Space Science Data Center's Common Data Formate (CDF) is capable of storing many types of data such as scalar data items, vectors, and multidimensional arrays of bytes, integers, or floating point values. However, regardless of the dimensionality and data type, the data break down into a sequence of bytes that can be fed into a data compression function to reduce the amount of data without losing data integrity and thus remaining fully reconstructible. Because of the diversity of data types and high performance speed requirements, a general-purpose, fast, simple data compression algorithm is required to incorporate data compression into CDF. The questions to ask are how to evaluate and compare compression algorithms, and what compression algorithm meets all requirements. The object of this paper is to address these questions and determine the most appropriate compression algorithm to use within the CDF data management package that would be applicable to other software packages with similar data compression needs.

Mathews, Gary Jason↗

A Bitvectors Library for PVS

This paper describes a bitvectors library that has been developed for PVS. The library defines a bitvector as a function from a subrange of the integers into (0,1). The library provides functions that interpret a bitvector as a natural number, as a 2's complement number, as a vector of logical values and as a 2's complement fraction. The library provides a concatenation operator and an extractor. Shift, extend and rotate operations are also, defined. Fundamental properties of each of these operations have been proved in PVS.

Butler, Ricky W.↗