Search NASA⌕ Search

SEARCH · Search NASA

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 631 records · Page 35

Two-dimensional mesh embedding for Galerkin B-spline methods

A number of advantages result from using B-splines as basis functions in a Galerkin method for solving partial differential equations. Among them are arbitrary order of accuracy and high resolution similar to that of compact schemes but without the aliasing error. This work develops another property, namely, the ability to treat semi-structured embedded or zonal meshes for two-dimensional geometries. This can drastically reduce the number of grid points in many applications. Both integer and non-integer refinement ratios are allowed. The report begins by developing an algorithm for choosing basis functions that yield the desired mesh resolution. These functions are suitable products of one-dimensional B-splines. Finally, test cases for linear scalar equations such as the Poisson and advection equation are presented. The scheme is conservative and has uniformly high order of accuracy throughout the domain.

Shariff, Karim↗

The Extrapolation of Elementary Sequences

We study sequence extrapolation as a stream-learning problem. Input examples are a stream of data elements of the same type (integers, strings, etc.), and the problem is to construct a hypothesis that both explains the observed sequence of examples and extrapolates the rest of the stream. A primary objective -- and one that distinguishes this work from previous extrapolation algorithms -- is that the same algorithm be able to extrapolate sequences over a variety of different types, including integers, strings, and trees. We define a generous family of constructive data types, and define as our learning bias a stream language called elementary stream descriptions. We then give an algorithm that extrapolates elementary descriptions over constructive datatypes and prove that it learns correctly. For freely-generated types, we prove a polynomial time bound on descriptions of bounded complexity. An especially interesting feature of this work is the ability to provide quantitative measures of confidence in competing hypotheses, using a Bayesian model of prediction.

Laird, Philip↗

UTC Dissemination to the Real-Time User

The current definition of Coordinated Universal Time (UTC) dates from 1972. The duration of a UTC second is defined in terms of the frequency of a hyperfine transition in the ground state of cesium. This standard frequency is realized in a number of different laboratories using ensembles of commercial cesium clocks and a few primary frequency standards. The data from all of these devices are transmitted periodically to the Bureau International des Poids et Mesures (BIPM) in Sevres, France, where they are combined in a statistical procedure to produce International Atomic Time (TAI). The time of this scale is adjusted as needed ('coordinated') by adding or dropping integer seconds so as to keep it within plus or minus 0.9 s of UT1, a time scale based on the observation of the transit times of stars and corrected for the predicted seasonal variations in these observations. When the leap seconds are included into TAI, the result is called UTC. The difference between TAI and UTC is therefore an exact integer number of seconds. This difference is currently 29 s and will become 30 s at 0 UTC on 1 January 1996.

Levine, Judah↗

How Difficult is it to Add 1? A Pedagogical Example of How Theory of Computing May be Useful

We show that while adding two generic b-bit integers requires = b bit operations, adding 1 to an integer requires, on average, only 2 bit operations. This fact explains why the operation of adding 1 is often separately hardware supported, and why this operation is often separately described in high-level programming languages like C++. This result shows that theoretical analysis can help in deciding which operations must be hardware supported, and thus, hopefully, will help in designing faster computers.

Hampton, Michael↗

The Long-term Light Curves of X-ray Binaries Contain Simultaneous Periodic and Random Components

LMC X-3 and Cyg X-2 show large amplitude X-ray fluctuations that have been attributed to a warped accretion disk. Cyg X-3 displays high amplitude, apparently non-periodic oscillations. We reanalyze these systems using RXTE ASM data and time-frequency decomposition techniques. We find that the long-term variations in Cyg X-2 can be completely characterized by excursions whose durations are integer multiples of the orbital period, including one essentially identical to the reported "period" of 78 days. Cyg X-3 can be characterized in terms of integer multiples of a 71-day fundamental period unrelated to the 4.8 day orbital period, but suggestively close to the approximately equal to greater than 60 day reported precession period of the relativistic jet inferred from recent radio observations. The long-term excursions of LMC X-3 are related to each other by rational fractions, suggesting the characteristic time scale is 10.594 days, shorter than any observed excursion to date. We explore the phase space evolution of the light curves using a natural embedding and find that all three systems possess two rotation centers that organize the phase space trajectories, one of low luminosity and the other of high luminosity. The implications of this repeatable behavior on generic models of accretion disk dynamics and mass transfer variability are explored.

White, Nicholas E.↗

Plasma Dispersion Function for the Kappa Distribution

The plasma dispersion function is computed for a homogeneous isotropic plasma in which the particle velocities are distributed according to a Kappa distribution. An ordinary differential equation is derived for the plasma dispersion function and it is shown that the solution can be written in terms of Gauss' hypergeometric function. Using the extensive theory of the hypergeometric function, various mathematical properties of the plasma dispersion function are derived including symmetry relations, series expansions, integral representations, and closed form expressions for integer and half-integer values of K.

Podesta, John J.↗

Identification of Cyclically Symmetric Resonance in Experimental Data for Engine Failure Analysis

Many structural components are rotationally symmetric. For a perfectly manufactured structure, the modal wave shapes are exactly sinusoidal. These structures can be excited by similarly-shaped forcing functions such as those found frequently in or near turbomachinery. Due to orthogonality, resonance occurs only when the integer wave number of the structure equals the integer wave number of the excitation as well as when the excitation frequency is close to the natural frequency of the mode. This resonance can lead to high-cycle fatigue (HCF) cracking of the structure. To help understand this phenomenon, it is desirable to determine the modal composition of the response and excitation. Once the modal composition is known, either the excitation or the structure can be modified to reduce the response and therefore prevent HCF cracking.

Medley, Steve↗

Data-Rate Estimation for Autonomous Receiver Operation

In this article, we present a series of algorithms for estimating the data rate of a signal whose admissible data rates are integer base, integer powered multiples of a known basic data rate. These algorithms can be applied to the Electra radio currently used in the Deep Space Network (DSN), which employs data rates having the above relationship. The estimation is carried out in an autonomous setting in which very little a priori information is assumed. It is done by exploiting an elegant property of the split symbol moments estimator (SSME), which is traditionally used to estimate the signal-to-noise ratio (SNR) of the received signal. By quantizing the assumed symbol-timing error or jitter, we present an all-digital implementation of the SSME which can be used to jointly estimate the data rate, SNR, and jitter. Simulation results presented show that these joint estimation algorithms perform well, even in the low SNR regions typically encountered in the DSN.

Tkacenko, A.↗

Method and apparatus for reliable inter-antenna baseline determination

Disclosed is a method for inter-antenna baseline determination that uses an antenna configuration comprising a pair of relatively closely spaced antennas and other pairs of distant antennas. The closely spaced pair provides a short baseline having an integer ambiguity that may be searched exhaustively to identify the correct set of integers. This baseline is then used as a priori information to aid the determination of longer baselines that, once determined, may be used for accurate run time attitude determination.

Wilson, John M.↗

Pulsed phase locked loop strain monitor

A pulse phase locked loop system according to the present invention is described. A frequency generator such as a voltage controlled oscillator (VCO) generates an output signal and a reference signal having a frequency equal to that of the output signal. A transmitting gate gates the output frequency signal and this gated signal drives a transmitting transducer which transmits an acoustic wave through a material. A sample/hold samples a signal indicative of the transmitted wave which is received by a receiving transducer. Divide-by-n counters control these gating and sampling functions in response to the reference signal of the frequency generator. Specifically, the output signal is gated at a rate of F/h, wherein F is the frequency of the output signal and h is an integer; and the received signal is sampled at a delay of F/n wherein n is an integer.

Froggatt, Mark E.↗

Curable polyphosphazene copolymers and terpolymers

Copolymers and terpolymers comprising randomly repeating units represented by the general formulae ##EQU1## wherein the R' radicals contain OH functionality and R being at least one member of the group of monovalent radicals selected from alkyl, substituted alkyl, aryl, substituted aryl and arylalkyl, and R' is represented by ##EQU2## wherein Q represents either --(CH.sub.2).sub. n or --C.sub.6 H.sub.4 X(CH.sub.2).sub. m, the --X(CH.sub.2).sub. m group being either meta or para and n is an integer from 1 to 6, m is an integer from 1 to 3, X is O or CH.sub.2, and R is H or a lower alkyl radical with up to four carbon atoms (methyl, ethyl, etc.). The ratio of R to R' is between 99.5 to 0.5 and 65 to 35.

Reynard, Kennard A.↗

Ionene polymers for selectively inhibiting the vitro growth of malignant cells

Ionene polymers of the structure ##STR1## WHERE X AND Y ARE INTEGERS FROM 3 TO 16, Z.sup.- is an anion such as a halogen and n is an integer from 50 to 150 are found to bind negatively charged mammalian cells such as malignant cells and can be utilized to selectively inhibit the growth of malignant cells in vitro.

Rembaum, Alan↗

Lossless Astronomical Image Compression and the Effects of Random Noise

In this paper we compare a variety of modern image compression methods on a large sample of astronomical images. We begin by demonstrating from first principles how the amount of noise in the image pixel values sets a theoretical upper limit on the lossless compression ratio of the image. We derive simple procedures for measuring the amount of noise in an image and for quantitatively predicting how much compression will be possible. We then compare the traditional technique of using the GZIP utility to externally compress the image, with a newer technique of dividing the image into tiles, and then compressing and storing each tile in a FITS binary table structure. This tiled-image compression technique offers a choice of other compression algorithms besides GZIP, some of which are much better suited to compressing astronomical images. Our tests on a large sample of images show that the Rice algorithm provides the best combination of speed and compression efficiency. In particular, Rice typically produces 1.5 times greater compression and provides much faster compression speed than GZIP. Floating point images generally contain too much noise to be effectively compressed with any lossless algorithm. We have developed a compression technique which discards some of the useless noise bits by quantizing the pixel values as scaled integers. The integer images can then be compressed by a factor of 4 or more. Our image compression and uncompression utilities (called fpack and funpack) that were used in this study are publicly available from the HEASARC web site.Users may run these stand-alone programs to compress and uncompress their own images.

Pence, William↗

Quantum-Inspired Maximizer

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

Zak, Michail↗

Optimal Compression of Floating-Point Astronomical Images Without Significant Loss of Information

We describe a compression method for floating-point astronomical images that gives compression ratios of 6 - 10 while still preserving the scientifically important information in the image. The pixel values are first preprocessed by quantizing them into scaled integer intensity levels, which removes some of the uncompressible noise in the image. The integers are then losslessly compressed using the fast and efficient Rice algorithm and stored in a portable FITS format file. Quantizing an image more coarsely gives greater image compression, but it also increases the noise and degrades the precision of the photometric and astrometric measurements in the quantized image. Dithering the pixel values during the quantization process greatly improves the precision of measurements in the more coarsely quantized images. We perform a series of experiments on both synthetic and real astronomical CCD images to quantitatively demonstrate that the magnitudes and positions of stars in the quantized images can be measured with the predicted amount of precision. In order to encourage wider use of these image compression methods, we have made available a pair of general-purpose image compression programs, called fpack and funpack, which can be used to compress any FITS format image.

Pence, William D.↗

Squeezing Alters Frequency Tuning of WGM Optical Resonator

Mechanical squeezing has been found to alter the frequency tuning of a whispering-gallery-mode (WGM) optical resonator that has an elliptical shape and is made of lithium niobate. It may be possible to exploit this effect to design reconfigurable optical filters for optical communications and for scientific experiments involving quantum electrodynamics. Some background information is prerequisite to a meaningful description of the squeezing-induced alteration of frequency tuning: The spectrum of a WGM resonator is represented by a comblike plot of intensity versus frequency. Each peak of the comblike plot corresponds to an electromagnetic mode represented by an integer mode number, and the modes are grouped into sets represented by integer mode indices. Because lithium niobate is an electro-optically active material, the WGM resonator can be tuned (that is, the resonance frequencies can be shifted) by applying a suitable bias potential. The frequency shift of each mode is quantified by a tuning rate defined as the ratio between the frequency shift and the applied potential. In the absence of squeezing, all modes exhibit the same tuning rate. This concludes the background information. It has been demonstrated experimentally that when the resonator is squeezed along part of either of its two principal axes, tuning rates differ among the groups of modes represented by different indices (see figure). The differences in tuning rates could be utilized to configure the resonance spectrum to obtain a desired effect; for example, through a combination of squeezing and electrical biasing, two resonances represented by different mode indices could be set at a specified frequency difference something that could not be done through electrical biasing alone.

Mohageg, Makan↗

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗

Single-Receiver GPS Phase Bias Resolution

Existing software has been modified to yield the benefits of integer fixed double-differenced GPS-phased ambiguities when processing data from a single GPS receiver with no access to any other GPS receiver data. When the double-differenced combination of phase biases can be fixed reliably, a significant improvement in solution accuracy is obtained. This innovation uses a large global set of GPS receivers (40 to 80 receivers) to solve for the GPS satellite orbits and clocks (along with any other parameters). In this process, integer ambiguities are fixed and information on the ambiguity constraints is saved. For each GPS transmitter/receiver pair, the process saves the arc start and stop times, the wide-lane average value for the arc, the standard deviation of the wide lane, and the dual-frequency phase bias after bias fixing for the arc. The second step of the process uses the orbit and clock information, the bias information from the global solution, and only data from the single receiver to resolve double-differenced phase combinations. It is called "resolved" instead of "fixed" because constraints are introduced into the problem with a finite data weight to better account for possible errors. A receiver in orbit has much shorter continuous passes of data than a receiver fixed to the Earth. The method has parameters to account for this. In particular, differences in drifting wide-lane values must be handled differently. The first step of the process is automated, using two JPL software sets, Longarc and Gipsy-Oasis. The resulting orbit/clock and bias information files are posted on anonymous ftp for use by any licensed Gipsy-Oasis user. The second step is implemented in the Gipsy-Oasis executable, gd2p.pl, which automates the entire process, including fetching the information from anonymous ftp

Bertiger, William I.↗