Search NASA⌕ Search

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.

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

At least 703 records · Page 39

Mixed time slicing in path integral simulations

A simple and efficient scheme is presented for using different time slices for different degrees of freedom in path integral calculations. This method bridges the gap between full quantization and the standard mixed quantum-classical (MQC) scheme and, therefore, still provides quantum mechanical effects in the less-quantized variables. Underlying the algorithm is the notion that time slices (beads) may be 'collapsed' in a manner that preserves quantization in the less quantum mechanical degrees of freedom. The method is shown to be analogous to multiple-time step integration techniques in classical molecular dynamics. The algorithm and its associated error are demonstrated on model systems containing coupled high- and low-frequency modes; results indicate that convergence of quantum mechanical observables can be achieved with disparate bead numbers in the different modes. Cost estimates indicate that this procedure, much like the MQC method, is most efficient for only a relatively few quantum mechanical degrees of freedom, such as proton transfer. In this regime, however, the cost of a fully quantum mechanical simulation is determined by the quantization of the least quantum mechanical degrees of freedom.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Geometric momentum for a particle constrained on a curved hypersurface

The canonical quantization is a procedure for quantizing a classical theory while preserving the formal algebraic structure among observables in the classical theory to the extent possible. For a system without constraint, we have the so-called fundamental commutation relations (CRs) among positions and momenta, whose algebraic relations are the same as those given by the Poisson brackets in classical mechanics. For the constrained motion on a curved hypersurface, we need more fundamental CRs otherwise neither momentum nor kinetic energy can be properly quantized, and we propose an enlarged canonical quantization scheme with introduction of the second category of fundamental CRs between Hamiltonian and positions, and those between Hamiltonian and momenta, whereas the original ones are categorized into the first. As an N − 1 (N ⩾ 2) dimensional hypersurface is embedded in an N dimensional Euclidean space, we obtain the proper momentum that depends on the mean curvature. For the spherical surface, a long-standing problem in the form of the geometric potential is resolved in a lucid and unambiguous manner, which turns out to be identical to that given by the so-called confining potential technique. In addition, a new dynamical group SO(N, 1) symmetry for the motion on the sphere is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum of area {Delta}A=8{pi}l{sub P}{sup 2} and a statistical interpretation of black hole entropy

In contrast to alternative values, the quantum of area {Delta}A=8{pi}l{sub P}{sup 2} does not follow from the usual statistical interpretation of black hole entropy; on the contrary, a statistical interpretation follows from it. This interpretation is based on the two concepts: nonadditivity of black hole entropy and Landau quantization. Using nonadditivity a microcanonical distribution for a black hole is found and it is shown that the statistical weight of a black hole should be proportional to its area. By analogy with conventional Landau quantization, it is shown that quantization of a black hole is nothing but the Landau quantization. The Landau levels of a black hole and their degeneracy are found. The degree of degeneracy is equal to the number of ways to distribute a patch of area 8{pi}l{sub P}{sup 2} over the horizon. Taking into account these results, it is argued that the black hole entropy should be of the form S{sub bh}=2{pi}{center_dot}{Delta}{Gamma}, where the number of microstates is {Delta}{Gamma}=A/8{pi}l{sub P}{sup 2}. The nature of the degrees of freedom responsible for black hole entropy is elucidated. The applications of the new interpretation are presented. The effect of noncommuting coordinates is discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

Improving image segmentation by learning region affinities

We utilize the context information of other regions in hierarchical image segmentation to learn new regions affinities. It is well known that a single choice of quantization of an image space is highly unlikely to be a common optimal quantization level for all categories. Each level of quantization has its own benefits. Therefore, we utilize the hierarchical information among different quantizations as well as spatial proximity of their regions. The proposed affinity learning takes into account higher order relations among image regions, both local and long range relations, making it robust to instabilities and errors of the original, pairwise region affinities. Once the learnt affinities are obtained, we use a standard image segmentation algorithm to get the final segmentation. Moreover, the learnt affinities can be naturally unutilized in interactive segmentation. Experimental results on Berkeley Segmentation Dataset and MSRC Object Recognition Dataset are comparable and in some aspects better than the state-of-art methods.

47 OTHER INSTRUMENTATION↗

Artificial dynamical effects in quantum field theory

In Newtonian mechanics, studying a system in a non-Galilean reference frame can lead to inertial pseudoforces appearing, such as the centrifugal force that seems to arise in dynamics analysed in a rotating frame. Likewise, artificial effects may arise in relativistic quantum field theory (QFT) if a system is studied in a framework that violates Poincaré invariance. Here, we highlight how such issues complicate the traditional canonical quantization of QFTs and can lead to a subjective description of natural phenomena. By contrast, the treatment of the same problem using light-front quantization is free from spurious pseudoeffects because Poincaré invariance is effectively preserved for all practical intents and purposes. We illustrate these statements using several examples: the Gerasimov-Drell-Hearn (GDH) relation, a fundamental feature of QFT; the absence of any measurable impact of Lorentz contraction in high-energy collisions; and the fictitious character of vacuum fluctuation contributions to the cosmological constant.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Observation of half-quantum flux in the unconventional superconductor β-Bi2Pd

Magnetic flux quantization is one of the defining properties of a superconductor. We report the observation of half-integer magnetic flux quantization in mesoscopic rings of superconducting β-Bi 2 Pd thin films. The half-quantum fluxoid manifests itself as a π phase shift in the quantum oscillation of the superconducting critical temperature. This result verifies unconventional superconductivity of β-Bi 2 Pd and is consistent with a spin-triplet pairing symmetry. Our findings may have implications for flux quantum bits in the context of quantum computing.

phonons, thermal conductivity, thermoelectric, spi↗

Constraints in Quantum Geometrodynamics

We compare different treatments of the constraints in canonical quantum gravity. The standard approach on the superspace of 3-geometries treats the constraints as the sole carriers of the dynamic content of the theory, thus rendering the traditional dynamical equations obsolete. Quantization of the constraints in both the Dirac and ADM square root Hamiltonian approaches leads to the well known problems of time evolution. These problems of time are of both an interpretational and technical nature. In contrast, the geometrodynamic quantization procedure on the superspace of the true dynamical variables separates the issues of quantization from the enforcement of the constraints. The resulting theory takes into account states that are off-shell with respect to the constraints, and thus avoids the problems of time. We develop, for the first time, the geometrodynamic quantization formalism in a general setting and show that it retains all essential features previously illustrated in the context of homogeneous cosmologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pythia8 Quark and Gluon Jets (float8 e4m3FN)

A float8 (e4m3FN) quantized version of the quark and gluon jet dataset originally published by Komiske, Metodiev, and Thaler (Zenodo record 3164691). Only the 20-file subset without charm and bottom quark jets is included here. All simulation parameters and jet selection criteria are identical to the original: Pythia 8.226, √s = 14 TeV Quarks from WeakBosonAndParton:qg2gmZq, gluons from WeakBosonAndParton:qqbar2gmZg with the Z decaying to neutrinos FastJet 3.3.0, anti-k_t jets with R = 0.4 p_T^jet ∈ [500, 550] GeV, |y^jet| < 1.7 There are 20 files, each in compressed NumPy format (QG_jets_fp8e4m3fn_0.npz through QG_jets_fp8e4m3fn_19.npz). Each file contains two arrays: X: (100000, M, 4) — 50k quark and 50k gluon jets, randomly sorted, padded to max multiplicity M, with particle features (pt, rapidity, azimuthal angle, pdgid) y: (100000,) — jet labels, gluon = 0, quark = 1 Since NumPy has no native fp8 dtype, X is stored as float32, but the values have been quantized through TensorFlow's float8_e4m3fn type and carry only fp8 precision. The quantization procedure is as follows: a global per-channel scale factor is computed from the absolute maximum value across all 20 chunks (with FP8_MAX = 448.0, the maximum representable value of e4m3FN). Each chunk is then scaled into the fp8 dynamic range, round-tripped through tf.experimental.float8_e4m3fn, and scaled back. This global scaling ensures a consistent quantization grid across the full dataset. The y labels are unchanged. Users should be aware that e4m3FN has limited dynamic range and precision. We recommend verifying this format is appropriate for your application; for a less aggressive reduction see the float16 and float32 versions linked below. If you use this dataset, please cite the original Zenodo record and its associated paper: Komiske, Metodiev, Thaler, Energy Flow Networks: Deep Sets for Particle Jets, JHEP 01 (2019) 121, arXiv:1810.05165

DiLullo, Nicholas [Brown University] (ORCID:000000↗

Research study on stabilization and control. Modern sampled-data control theory: Stability analysis of the low cost large space telescope system

The pointing stability of the low-cost large space telescope (LST) system was investigated. The low-cost LST is characterized by the use of reaction wheels for the generation of control torques. Because of the critical requirement on the pointing accuracy of the LST, the nonlinear frictional characteristics of the bearings of the reaction wheels were studied which can cause limit cycles in a closed-loop system. Another possible source of pointing error in the LST is due to the effect of quantization and sensor noise. Since the LST is a digital system, digital to analog and analog to digital converters and sensors for positional and rate feedbacks were used. Sensor noise and amplitude quantization causes pointing error in the LST and, in addition, quantization is a nonlinear phenomenon which can cause self-sustained oscillations in the closed-loop system. The dynamic modeling of the single-axis LST is described, and several methods of evaluating the attitude error of the digital LST due to quantization and noise inputs are given.

Kuo, B. C.↗

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗

Image data compression having minimum perceptual error

A method for performing image compression that eliminates redundant and invisible image components is described. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The present invention adapts or customizes the quantization matrix to the image being compressed. The quantization matrix comprises visual masking by luminance and contrast techniques and by an error pooling technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

Watson, Andrew B.↗

DCTune Perceptual Optimization of Compressed Dental X-Rays

In current dental practice, x-rays of completed dental work are often sent to the insurer for verification. It is faster and cheaper to transmit instead digital scans of the x-rays. Further economies result if the images are sent in compressed form. DCTune is a technology for optimizing DCT (digital communication technology) quantization matrices to yield maximum perceptual quality for a given bit-rate, or minimum bit-rate for a given perceptual quality. Perceptual optimization of DCT color quantization matrices. In addition, the technology provides a means of setting the perceptual quality of compressed imagery in a systematic way. The purpose of this research was, with respect to dental x-rays, 1) to verify the advantage of DCTune over standard JPEG (Joint Photographic Experts Group), 2) to verify the quality control feature of DCTune, and 3) to discover regularities in the optimized matrices of a set of images. We optimized matrices for a total of 20 images at two resolutions (150 and 300 dpi) and four bit-rates (0.25, 0.5, 0.75, 1.0 bits/pixel), and examined structural regularities in the resulting matrices. We also conducted psychophysical studies (1) to discover the DCTune quality level at which the images became 'visually lossless,' and (2) to rate the relative quality of DCTune and standard JPEG images at various bitrates. Results include: (1) At both resolutions, DCTune quality is a linear function of bit-rate. (2) DCTune quantization matrices for all images at all bitrates and resolutions are modeled well by an inverse Gaussian, with parameters of amplitude and width. (3) As bit-rate is varied, optimal values of both amplitude and width covary in an approximately linear fashion. (4) Both amplitude and width vary in systematic and orderly fashion with either bit-rate or DCTune quality; simple mathematical functions serve to describe these relationships. (5) In going from 150 to 300 dpi, amplitude parameters are substantially lower and widths larger at corresponding bit-rates or qualities. (6) Visually lossless compression occurs at a DCTune quality value of about 1. (7) At 0.25 bits/pixel, comparative ratings give DCTune a substantial advantage over standard JPEG. As visually lossless bit-rates are approached, this advantage of necessity diminishes. We have concluded that DCTune optimized quantization matrices provide better visual quality than standard JPEG. Meaningful quality levels may be specified by means of the DCTune metric. Optimized matrices are very similar across the class of dental x-rays, suggesting the possibility of a 'class-optimal' matrix. DCTune technology appears to provide some value in the context of compressed dental x-rays.

Watson, Andrew B.↗

Improved Compression of Wavelet-Transformed Images

A recently developed data-compression method is an adaptive technique for coding quantized wavelet-transformed data, nominally as part of a complete image-data compressor. Unlike some other approaches, this method admits a simple implementation and does not rely on the use of large code tables. A common data compression approach, particularly for images, is to perform a wavelet transform on the input data, and then losslessly compress a quantized version of the wavelet-transformed data. Under this compression approach, it is common for the quantized data to include long sequences, or runs, of zeros. The new coding method uses prefixfree codes for the nonnegative integers as part of an adaptive algorithm for compressing the quantized wavelet-transformed data by run-length coding. In the form of run-length coding used here, the data sequence to be encoded is parsed into strings consisting of some number (possibly 0) of zeros, followed by a nonzero value. The nonzero value and the length of the run of zeros are encoded. For a data stream that contains a sufficiently high frequency of zeros, this method is known to be more effective than using a single variable length code to encode each symbol. The specific prefix-free codes used are from two classes of variable-length codes: a class known as Golomb codes, and a class known as exponential-Golomb codes. The codes within each class are indexed by a single integer parameter. The present method uses exponential-Golomb codes for the lengths of the runs of zeros, and Golomb codes for the nonzero values. The code parameters within each code class are determined adaptively on the fly as compression proceeds, on the basis of statistics from previously encoded values. In particular, a simple adaptive method has been devised to select the parameter identifying the particular exponential-Golomb code to use. The method tracks the average number of bits used to encode recent runlengths, and takes the difference between this average length and the code parameter. When this difference falls outside a fixed range, the code parameter is updated (increased or decreased). The Golomb code parameter is selected based on the average magnitude of recently encoded nonzero samples. The coding method requires no floating- point operations, and more readily adapts to local statistics than other methods. The method can also accommodate arbitrarily large input values and arbitrarily long runs of zeros. In practice, this means that changes in the dynamic range or size of the input data set would not require a change to the compressor. The algorithm has been tested in computational experiments on test images. A comparison with a previously developed algorithm that uses large code tables (generated via Huffman coding on training data) suggests that the data-compression effectiveness of the present algorithm is comparable to the best performance achievable by the previously developed algorithm.

Kiely, Aaron↗

Method and system employing finite state machine modeling to identify one of a plurality of different electric load types

A system is for a plurality of different electric load types. The system includes a plurality of sensors structured to sense a voltage signal and a current signal for each of the different electric loads; and a processor. The processor acquires a voltage and current waveform from the sensors for a corresponding one of the different electric load types; calculates a power or current RMS profile of the waveform; quantizes the power or current RMS profile into a set of quantized state-values; evaluates a state-duration for each of the quantized state-values; evaluates a plurality of state-types based on the power or current RMS profile and the quantized state-values; generates a state-sequence that describes a corresponding finite state machine model of a generalized load start-up or transient profile for the corresponding electric load type; and identifies the corresponding electric load type.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

To the Theory of the Polarized Radiation Absorption in a Semiconductor (001) Quantum Well

The paper considers absorption of linearly polarized radiation in a semiconductor size-quantized well related to optical transitions both between the branches of light and heavy holes and between the size-quantized subbands. Main features of the light absorption in an infinitely deep symmetric well are elucidated. These features are characterized by intraband absorption of light and associated with the direct optical transitions of holes between the subbands of the semiconductor valence band formed due to the size quantization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An exactly solvable deformation of the Coulomb problem associated with the Taub–NUT metric

In this paper we quantize the N-dimensional classical Hamiltonian system H=(|q|)/(2(η+|q|)) p{sup 2}−k/(η+|q|) , that can be regarded as a deformation of the Coulomb problem with coupling constant k, that it is smoothly recovered in the limit η→0. Moreover, the kinetic energy term in H is just the one corresponding to an N-dimensional Taub–NUT space, a fact that makes this system relevant from a geometric viewpoint. Since the Hamiltonian H is known to be maximally superintegrable, we propose a quantization prescription that preserves such superintegrability in the quantum mechanical setting. We show that, to this end, one must choose as the kinetic part of the Hamiltonian the conformal Laplacian of the underlying Riemannian manifold, which combines the usual Laplace–Beltrami operator on the Taub–NUT manifold and a multiple of its scalar curvature. As a consequence, we obtain a novel exactly solvable deformation of the quantum Coulomb problem, whose spectrum is computed in closed form for positive values of η and k, and showing that the well-known maximal degeneracy of the flat system is preserved in the deformed case. Several interesting algebraic and physical features of this new exactly solvable quantum system are analyzed, and the quantization problem for negative values of η and/or k is also sketched.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗