SEARCH · Search NASA

Results for “Quantization”

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.

SourceResearch connectionFrom yearThrough year

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

At least 595 records · Page 33

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Phase space localization for anti-de Sitter quantum mechanics and its zero curvature limit

Using techniques of geometric quantization and SO(sub 0)(3,2)-coherent states, a notion of optimal localization on phase space is defined for the quantum theory of a massive and spinning particle in anti-de Sitter space time. It is shown that this notion disappears in the zero curvature limit, providing one with a concrete example of the regularizing character of the constant (nonzero) curvature of the anti-de Sitter space time. As a byproduct a geometric characterization of masslessness is obtained.

Elgradechi, Amine M.↗

NASA NTRS1993

The algebra of supertraces for 2+1 super de Sitter gravity

The algebra of the observables for 2+1 super de Sitter gravity, for one genus of the spatial surface is calculated. The algebra turns out to be an infinite Lie algebra subject to non-linear constraints. The constraints are solved explicitly in terms of five independent complex supertraces. These variables are the true degrees of freedom of the system and their quantized algebra generates a new structure which is referred to as a 'central extension' of the quantum algebra SU(2)q.

Urrutia, L. F.↗

NASA NTRS1993

Nonlinear modes of the tensor Dirac equation and CPT violation

Recently, it has been shown that Dirac's bispinor equation can be expressed, in an equivalent tensor form, as a constrained Yang-Mills equation in the limit of an infinitely large coupling constant. It was also shown that the free tensor Dirac equation is a completely integrable Hamiltonian system with Lie algebra type Poisson brackets, from which Fermi quantization can be derived directly without using bispinors. The Yang-Mills equation for a finite coupling constant is investigated. It is shown that the nonlinear Yang-Mills equation has exact plane wave solutions in one-to-one correspondence with the plane wave solutions of Dirac's bispinor equation. The theory of nonlinear dispersive waves is applied to establish the existence of wave packets. The CPT violation of these nonlinear wave packets, which could lead to new observable effects consistent with current experimental bounds, is investigated.

Reifler, Frank J.↗

NASA NTRS1992

Zone plate lens antennas for millimeter and submillimeter wavelengths

Zone plate lenses are a type of focusing element which function essentially as differential phase shifters, having a relatively few, coarsely quantized phase delays across the incident beam of radiation. The major advantages are ease of fabrication and much reduced thickness, compared to conventional refractive focusing elements. These considerations are both of particular importance for the submillimeter range, in which manufacturing tolerances for curved optical elements can pose significant problems, and where the absorption of readily available dielectric materials is quite large. In this presentation we briefly review the theory of zone plate lens operations, present a relatively simple method for calculating the aperture efficiency of zone plate lenses used as antennas, and show some theoretical and measured results in the 100 GHz range.

Goldsmith, Paul F.↗

NASA NTRS1992

Image segmentation using fuzzy LVQ clustering networks

In this note we formulate image segmentation as a clustering problem. Feature vectors extracted from a raw image are clustered into subregions, thereby segmenting the image. A fuzzy generalization of a Kohonen learning vector quantization (LVQ) which integrates the Fuzzy c-Means (FCM) model with the learning rate and updating strategies of the LVQ is used for this task. This network, which segments images in an unsupervised manner, is thus related to the FCM optimization problem. Numerical examples on photographic and magnetic resonance images are given to illustrate this approach to image segmentation.

Tsao, Eric Chen-Kuo↗

NASA NTRS1991

Spatial acquisition and tracking for deep-space optical communication packages

The problem of acquiring and tracking a sun-lit earth, which poses a rather stringent demand on the design of the pointing acquisition and tracking subsystem for a deep-space optical communication package, is addressed. The acquisition subsystem must be capable of locating and tracking the receiver location based on a sun-lit earth image that is blurred by the point spread function of the imaging optics and spatially quantized by the detector pixels. Spatial tracking must be performed at bandwidths in excess of 1 kHz to effectively reject platform jitters. A simple solution of locating the earth limb shows a great potential for providing the necessary acquisition and tracking accuracy. By using separate acquisition and tracking detectors, the system can be implemented without extensive technology development. The slow bandwidth required for the acquisition process can be readily accomplished with an available CCD array, and an analog tracking loop can be implemented using a quadrant tracker and calibrated centroid tracking without the excessive computing overhead of the array detector-based spatial tracker.

Chen, Chien-Chung↗

NASA NTRS1993

GTARG - The TOPEX/Poseidon ground track maintenance maneuver targeting program

GTARG is a computer program used to design orbit maintenance maneuvers for the TOPEX/Poseidon satellite. These maneuvers ensure that the ground track is kept within +/-1 km with of an = 9.9 day exact repeat pattern. Maneuver parameters are determined using either of two targeting strategies: longitude targeting, which maximizes the time between maneuvers, and time targeting, in which maneuvers are targeted to occur at specific intervals. The GTARG algorithm propagates nonsingular mean elements, taking into account anticipated error sigma's in orbit determination, Delta v execution, drag prediction and Delta v quantization. A satellite unique drag model is used which incorporates an approximate mean orbital Jacchia-Roberts atmosphere and a variable mean area model. Maneuver Delta v magnitudes are targeted to precisely maintain either the unbiased ground track itself, or a comfortable (3 sigma) error envelope about the unbiased ground track.

Shapiro, Bruce E.↗

NASA NTRS1993

Neurocomputing strategies in decomposition based structural design

The present paper explores the applicability of neurocomputing strategies in decomposition based structural optimization problems. It is shown that the modeling capability of a backpropagation neural network can be used to detect weak couplings in a system, and to effectively decompose it into smaller, more tractable, subsystems. When such partitioning of a design space is possible, parallel optimization can be performed in each subsystem, with a penalty term added to its objective function to account for constraint violations in all other subsystems. Dependencies among subsystems are represented in terms of global design variables, and a neural network is used to map the relations between these variables and all subsystem constraints. A vector quantization technique, referred to as a z-Network, can effectively be used for this purpose. The approach is illustrated with applications to minimum weight sizing of truss structures with multiple design constraints.

Szewczyk, Z.↗

NASA NTRS1992

Learning and optimization with cascaded VLSI neural network building-block chips

To demonstrate the versatility of the building-block approach, two neural network applications were implemented on cascaded analog VLSI chips. Weights were implemented using 7-b multiplying digital-to-analog converter (MDAC) synapse circuits, with 31 x 32 and 32 x 32 synapses per chip. A novel learning algorithm compatible with analog VLSI was applied to the two-input parity problem. The algorithm combines dynamically evolving architecture with limited gradient-descent backpropagation for efficient and versatile supervised learning. To implement the learning algorithm in hardware, synapse circuits were paralleled for additional quantization levels. The hardware-in-the-loop learning system allocated 2-5 hidden neurons for parity problems. Also, a 7 x 7 assignment problem was mapped onto a cascaded 64-neuron fully connected feedback network. In 100 randomly selected problems, the network found optimal or good solutions in most cases, with settling times in the range of 7-100 microseconds.

Duong, T.↗

NASA NTRS1991

Improvement in detection of small wildfires

Detecting and imaging small wildfires with an Airborne Scanner is done against generally high background levels. The Airborne Scanner System used is a two-channel thermal IR scanner, with one channel selected for imaging the terrain and the other channel sensitive to hotter targets. If a relationship can be determined between the two channels that quantifies the background signal for hotter targets, then an algorithm can be determined that removes the background signal in that channel leaving only the fire signal. The relationship can be determined anywhere between various points in the signal processing of the radiometric data from the radiometric input to the quantized output of the system. As long as only linear operations are performed on the signal, the relationship will only depend on the system gain and offsets within the range of interest. The algorithm can be implemented either by using a look-up table or performing the calculation in the system computer. The current presentation will describe the algorithm, its derivation, and its implementation in the Firefly Wildfire Detection System by means of an off-the-shelf commercial scanner. Improvement over the previous algorithm used and the margin gained for improving the imaging of the terrain will be demonstrated.

Sleigh, William J.↗

NASA NTRS1993

A radar altitude and line of sight attachment

This paper describes a method of overcoming much of the computational expense of finding radar altitude and determining lines of sight in flight simulations over databases built from polygons. Methods are described for quantizing polygonal databases and for searching through them quickly. Various tuning parameters are explained and run-time performance figures are offered.

Sansom, Russell↗

NASA NTRS1993

Visual information processing II; Proceedings of the Meeting, Orlando, FL, Apr. 14-16, 1993

Various papers on visual information processing are presented. Individual topics addressed include: aliasing as noise, satellite image processing using a hammering neural network, edge-detetion method using visual perception, adaptive vector median filters, design of a reading test for low-vision image warping, spatial transformation architectures, automatic image-enhancement method, redundancy reduction in image coding, lossless gray-scale image compression by predictive GDF, information efficiency in visual communication, optimizing JPEG quantization matrices for different applications, use of forward error correction to maintain image fidelity, effect of peanoscanning on image compression. Also discussed are: computer vision for autonomous robotics in space, optical processor for zero-crossing edge detection, fractal-based image edge detection, simulation of the neon spreading effect by bandpass filtering, wavelet transform (WT) on parallel SIMD architectures, nonseparable 2D wavelet image representation, adaptive image halftoning based on WT, wavelet analysis of global warming, use of the WT for signal detection, perfect reconstruction two-channel rational filter banks, N-wavelet coding for pattern classification, simulation of image of natural objects, number-theoretic coding for iconic systems.

Huck, Friedrich O.↗

NASA NTRS1990

Research on conceptual/innovative design for the life cycle

The goal of this research is developing and integrating qualitative and quantitative methods for life cycle design. The definition of the problem includes formal computer-based methods limited to final detailing stages of design; CAD data bases do not capture design intent or design history; and life cycle issues were ignored during early stages of design. Viewgraphs outline research in conceptual design; the SYMON (SYmbolic MONotonicity analyzer) algorithm; multistart vector quantization optimization algorithm; intelligent manufacturing: IDES - Influence Diagram Architecture; and 1st PRINCE (FIRST PRINciple Computational Evaluator).

Cagan, Jonathan↗

NASA NTRS1993

Geometric aspects of uncertainty and correlation

The fact that the metric induced on the quantum evolution submanifold of the protective Hilbert space describes the uncertainties and correlations of the operators generating the quantum-state evolution and exhibits the inherently-quantized geometry is discussed.

Abe, Sumiyoshi↗

NASA NTRS1993

Non-stationary and non-linear dispersive medium as external field which generates the squeezed states

The theory of quantum effects in nonlinear dielectric media is developed. The nonlinear dielectric media is influenced by an external pumping field. The diagonalization of the Hamiltonian of a quantized field is obtained by the canonical Bogoliubov transformations. The transformations allow us to obtain the general expressions for the number of created photons and for the degree of squeezing. In the case of a plane pumping wave, for example, the results are calculated by using the zero order of the secular perturbation theory, with small parameters characterizing the medium nonlinearity. The Heisenberg equations of motion are obtained for non-stationary case and a commonly used Hamiltonian is derived from the first principles of quantum electrodynamics.

Lobashov, A. A.↗

NASA NTRS1992

Spatially-varying IIR filter banks for image coding

This paper reports on the application of spatially variant infinite impulse response (IIR) filter banks to subband image coding. The new filter bank is based on computationally efficient recursive polyphase decompositions that dynamically change in response to the input signal. In the absence of quantization, reconstruction can be made exact. However, by proper choice of an adaptation scheme, we show that subband image coding based on time varying filter banks can yield improvement over the use of conventional filter banks.

Chung, Wilson C.↗

NASA NTRS1992

Recursive time-varying filter banks for subband image coding

Filter banks and wavelet decompositions that employ recursive filters have been considered previously and are recognized for their efficiency in partitioning the frequency spectrum. This paper presents an analysis of a new infinite impulse response (IIR) filter bank in which these computationally efficient filters may be changed adaptively in response to the input. The filter bank is presented and discussed in the context of finite-support signals with the intended application in subband image coding. In the absence of quantization errors, exact reconstruction can be achieved and by the proper choice of an adaptation scheme, it is shown that IIR time-varying filter banks can yield improvement over conventional ones.

Smith, Mark J. T.↗

NASA NTRS1993

Parametric binary dissection

Binary dissection is widely used to partition non-uniform domains over parallel computers. This algorithm does not consider the perimeter, surface area, or aspect ratio of the regions being generated and can yield decompositions that have poor communication to computation ratio. Parametric Binary Dissection (PBD) is a new algorithm in which each cut is chosen to minimize load + lambda x(shape). In a 2 (or 3) dimensional problem, load is the amount of computation to be performed in a subregion and shape could refer to the perimeter (respectively surface) of that subregion. Shape is a measure of communication overhead and the parameter permits us to trade off load imbalance against communication overhead. When A is zero, the algorithm reduces to plain binary dissection. This algorithm can be used to partition graphs embedded in 2 or 3-d. Load is the number of nodes in a subregion, shape the number of edges that leave that subregion, and lambda the ratio of time to communicate over an edge to the time to compute at a node. An algorithm is presented that finds the depth d parametric dissection of an embedded graph with n vertices and e edges in O(max(n log n, de)) time, which is an improvement over the O(dn log n) time of plain binary dissection. Parallel versions of this algorithm are also presented; the best of these requires O((n/p) log(sup 3)p) time on a p processor hypercube, assuming graphs of bounded degree. How PBD is applied to 3-d unstructured meshes and yields partitions that are better than those obtained by plain dissection is described. Its application to the color image quantization problem is also discussed, in which samples in a high-resolution color space are mapped onto a lower resolution space in a way that minimizes the color error.

Bokhari, Shahid H.↗