Search NASA⌕ Search

SEARCH · Search NASA

Results for “ENCODE”

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 1,045 records · Page 58

Applications of satellite technology for regional organizations (Project ASTRO)

The direct arithmetic processing of adaptive delta modulation (ADM) encoded signals, conversion from ADM encoded signals to pulse code modulation (PCM) encoded signals, and conversion from PCM to ADM encoded signals are discussed. It is shown that signals which are ADM encoded can be arithmetically processed directly, without first decoding. Operating on the DM bit stream, and employing only standard digital hardware, the sum, difference and product can be obtained in PCM and ADM format.

Schilling, D. L.↗

Optical image subtraction techniques, 1975-1985

Real- and nonreal-time optical image subtraction (OIS) techniques are reviewed. Real-time OIS techniques include source encoding, polarization modulation, pseudocolor image difference detection, the holographic shear lens technique, and nonlinear optics. Included in the nonreal-time category are speckle diffuser encoding, speckle-pattern encoding, halftone screen encoding, and polarization-shifted encoding. It is concluded that the most useful techniques are the real-time operations. It is noted that some nonreal-time optical techniques can be applied directly while others may be converted into real-time ones through the use of advance real-time spatial light modulators or electrooptic devices.

Liu, Hua-Kuang↗

Optical Image Subtraction

Report reviews optical image subtraction techniques developed during years 1975 through 1985. Useful in such disciplines as studies of earth resources, meteorology, automatic surveillance, pattern recognition, studies of urban growth, and compression of bandwidth in communication systems. Describes following real-time techniques: source encoding, polarization modulation, pseudocolor image-difference detection, holographic-shear-lens technique, and nonlinear electro-optics. Reported non-real-time image-subtraction techniques are following, all of which involve intensity subtraction: speckle-diffuser encoding, speckle-pattern encoding, halftone-screen encoding,and polarization-shifted carrier encoding. Offers an attractive alternative to digital electronic image subtraction, is faster and treats all parts of images simultaneously.

Liu, Hua-Kuang↗

Comparison of transform coding methods with an optimal predictor for the data compression of digital elevation models

Statistical encoding techniques enable the reduction of the number of bits required to encode a set of symbols, and are derived from their probabilities. Huffman encoding is an example of statistical encoding that has been used for error-free data compression. The degree of compression given by Huffman encoding in this application can be improved by the use of prediction methods. These replace the set of elevations by a set of corrections that have a more advantageous probability distribution. In particular, the method of Lagrange Multipliers for minimization of the mean square error has been applied to local geometrical predictors. Using this technique, an 8-point predictor achieved about a 7 percent improvement over an existing simple triangular predictor.

Lewis, Michael↗

Low-complexity wavelet filter design for image compression

Image compression algorithms based on the wavelet transform are an increasingly attractive and flexible alternative to other algorithms based on block orthogonal transforms. While the design of orthogonal wavelet filters has been studied in significant depth, the design of nonorthogonal wavelet filters, such as linear-phase (LP) filters, has not yet reached that point. Of particular interest are wavelet transforms with low complexity at the encoder. In this article, we present known and new parameterizations of the two families of LP perfect reconstruction (PR) filters. The first family is that of all PR LP filters with finite impulse response (FIR), with equal complexity at the encoder and decoder. The second family is one of LP PR filters, which are FIR at the encoder and infinite impulse response (IIR) at the decoder, i.e., with controllable encoder complexity. These parameterizations are used to optimize the subband/wavelet transform coding gain, as defined for nonorthogonal wavelet transforms. Optimal LP wavelet filters are given for low levels of encoder complexity, as well as their corresponding integer approximations, to allow for applications limited to using integer arithmetic. These optimal LP filters yield larger coding gains than orthogonal filters with an equivalent complexity. The parameterizations described in this article can be used for the optimization of any other appropriate objective function.

Majani, E.↗

Error control techniques for satellite and space communications

The unequal error protection capabilities of convolutional and trellis codes are studied. In certain environments, a discrepancy in the amount of error protection placed on different information bits is desirable. Examples of environments which have data of varying importance are a number of speech coding algorithms, packet switched networks, multi-user systems, embedded coding systems, and high definition television. Encoders which provide more than one level of error protection to information bits are called unequal error protection (UEP) codes. In this work, the effective free distance vector, d, is defined as an alternative to the free distance as a primary performance parameter for UEP convolutional and trellis encoders. For a given (n, k), convolutional encoder, G, the effective free distance vector is defined as the k-dimensional vector d = (d(sub 0), d(sub 1), ..., d(sub k-1)), where d(sub j), the j(exp th) effective free distance, is the lowest Hamming weight among all code sequences that are generated by input sequences with at least one '1' in the j(exp th) position. It is shown that, although the free distance for a code is unique to the code and independent of the encoder realization, the effective distance vector is dependent on the encoder realization.

Costello, Daniel J., Jr.↗

Trellis coded multilevel DPSK system with doppler correction for mobile satellite channels

A trellis coded multilevel differential phase shift keyed mobile communication system. The system of the present invention includes a trellis encoder for translating input signals into trellis codes; a differential encoder for differentially encoding the trellis coded signals; a transmitter for transmitting the differentially encoded trellis coded signals; a receiver for receiving the transmitted signals; a differential demodulator for demodulating the received differentially encoded trellis coded signals; and a trellis decoder for decoding the differentially demodulated signals.

Divsalar, Dariush↗

Low-Complexity Lossless and Near-Lossless Data Compression Technique for Multispectral Imagery

This work extends the lossless data compression technique described in Fast Lossless Compression of Multispectral- Image Data, (NPO-42517) NASA Tech Briefs, Vol. 30, No. 8 (August 2006), page 26. The original technique was extended to include a near-lossless compression option, allowing substantially smaller compressed file sizes when a small amount of distortion can be tolerated. Near-lossless compression is obtained by including a quantization step prior to encoding of prediction residuals. The original technique uses lossless predictive compression and is designed for use on multispectral imagery. A lossless predictive data compression algorithm compresses a digitized signal one sample at a time as follows: First, a sample value is predicted from previously encoded samples. The difference between the actual sample value and the prediction is called the prediction residual. The prediction residual is encoded into the compressed file. The decompressor can form the same predicted sample and can decode the prediction residual from the compressed file, and so can reconstruct the original sample. A lossless predictive compression algorithm can generally be converted to a near-lossless compression algorithm by quantizing the prediction residuals prior to encoding them. In this case, since the reconstructed sample values will not be identical to the original sample values, the encoder must determine the values that will be reconstructed and use these values for predicting later sample values. The technique described here uses this method, starting with the original technique, to allow near-lossless compression. The extension to allow near-lossless compression adds the ability to achieve much more compression when small amounts of distortion are tolerable, while retaining the low complexity and good overall compression effectiveness of the original algorithm.

Xie, Hua↗

Quantum-Assisted Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

The quantum computing community has been searching for suitable applications to demonstrate the potential of near-term quantum devices. Quantum machine learning is a potential candidate, particularly using models that cannot be efficiently simulated with classical computers [1, 2]. This work focuses on a transition phase of quantum computers where the quantum machine learning model is still simulable classically but projected not to be simulable as the size of the model grows. Ultimately quantum computers may have advantages for high-dimensional real-world problems. Due to the limited number of qubits in current noisy intermediate-scale quantum (NISQ) devices, the direct application of quantum computers in high dimensional data is not feasible. To remedy this problem, an encoder-decoder architecture can be utilized. The encoder model would transform the high-dimensional data into a compact representation, to a level that small quantum computers can be used today (or in the near future), and the decoder would take the quantum processed outputs back to the high-dimensional space. Addressing the two challenges of quantum machine learning, this work investigates a hybrid supervised generative model with a quantum Ising Born machine embedded as the latent distribution. The model contains four main parts (Figure 1.a.): (1) a U-NET architecture responsible for learning segmentation flow, (2) a Prior network responsible for learning an encoded latent distribution of the input data, (3) a Born machine which represents the latent distribution, and (4) a Posterior network in charge of learning the joint encoded latent distribution of inputs and target data. The initial model, proposed by [3], is optimized by (1) maximizing the overlap of the prior and posterior latent distributions, and (2) minimizing the segmentation loss. The proposed model is designed to be investigated in a simulation environment applied to the real-world application of wildfire segmentation. Specifically, the model is designed to solve the patchy wildfire segmentations of Moderate Resolution Imaging Spectroradiometer (MODIS) by taking the MODIS observations and using Visible Infrared Imaging Radiometer Suite’s (VIIRS) consistent wildfire product as the target. The model solves patchy wildfire segmentations and provides insight into the epistemic errors sourced from model variation. The model utilizes the Born machine as a QUBO solver to represent the latent space as a Bernoulli distribution. The proposed configuration allows the variational segmentation model to leverage the true quantum probabilistic nature and derive a more expressive latent configuration, increasing the model performance in describing wildfire segmentations. The quantum probabilistic information of the Born machine is directly incorporated in the Kullback-Leibler divergence loss in the prior and posterior distributions, forcing the Bernoulli latent distribution to maximize the overlap of input and joint input-target distributions. The proposed model is then trained and compared with a baseline only consisting of direct Bernoulli latent distribution with no Born machine representing the latent space. The models are evaluated based on the segmentation metrics, such as precision, recall, intersect of union, with uncertainty boundaries accounting for the stochastic nature of the model. Our findings show that even in low latent-dimensional space (due to the limit in computational power of the classical quantum simulator), we are able to effectively capture the latent representation and hence the model performs better than the baseline. The findings are a projection for scaling the model into higher dimensional latent space with the Born machine surpassing the baseline performance. Figure 1. Sub-figure (a) demonstrates the architecture for the training phase. The model consists of a Prior and Posterior network that encode inputs and joint input-target data into compact representations, respectively. The Born machine represents the latent distribution, and the U-NET branch learns the segmentation patterns of the data. The stochasticity is introduced to the U-NET through its last layer to create meaningful but stochastic segmentations. Sub-figure (b) represents the inference phase where the model takes the stochastic behavior from the prior network and injects that into the U-NET. Each attempt of inference will generate different but similar segmentations from the same distribution of the wildfire event. REFERENCES [1] Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020). The Born supremacy: quantum advantage and training of an Ising Born machine. npj Quantum Information, 6(1), 1-11. [2] Liu, J. G., & Wang, L. (2018). Differentiable learning of quantum circuit born machines. Physical Review A, 98(6), 062324. [3] Kohl, S., Romera-Paredes, B., Meyer, C., De Fauw, J., Ledsam, J. R., Maier-Hein, K., ... & Ronneberger, O. (2018). A probabilistic u-net for segmentation of ambiguous images. Advances in neural information processing systems, 31.

quantum machine learning↗

Magnetic resonance imaging of living systems by remote detection

A novel approach to magnetic resonance imaging is disclosed. Blood flowing through a living system is prepolarized, and then encoded. The polarization can be achieved using permanent or superconducting magnets. The polarization may be carried out upstream of the region to be encoded or at the place of encoding. In the case of an MRI of a brain, polarization of flowing blood can be effected by placing a magnet over a section of the body such as the heart upstream of the head. Alternatively, polarization and encoding can be effected at the same location. Detection occurs at a remote location, using a separate detection device such as an optical atomic magnetometer, or an inductive Faraday coil. The detector may be placed on the surface of the skin next to a blood vessel such as a jugular vein carrying blood away from the encoded region.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Demonstration of provably secure quantum key distribution (QKD)

Optimized Quantum Key Distribution (QKD) protocols revolutionize the cyber security by leveraging the quantum phenomenon for development of unbreakable security. Configurable quantum networks are necessary for accessible quantum applications amongst multiple users. Quantum key distribution is particularly interesting because of the many ways in which the key exchange can be carried out. Keys can be exchanged by encoding the key into a weak photon source using classical methods, or the keys can be exchanged using pairs of photons entangled at the source, or the keys can even be exchanged by encoding with classical hardware at the source with an entangling measurement which occurs at the photons destination. Each type of quantum key exchange has its own requirements that must be met for point-to-point implementations which makes it exceedingly difficult to implement multi-node quantum networks. We propose a programmable network model to time encoded quantum key distribution; this version of QKD sends entangled photons to two users and the hardware is setup such that the relative time shift in the coincident photons encodes which measurement basis was used. The protocols were first simulated by modifying previous software which used the CHP quantum simulator, and then a point-to-point key exchange was setup in hardware to demonstrate the time encoding aspects of the protocol.

Dasari, Venkat↗

Device and method for constructing and displaying high quality images from imaging data by transforming a data structure utilizing machine learning techniques

Constructing a computer image from raw imaging data or encoded imaging data by transforming a first data structure in which the raw imaging data or the encoded imaging data is stored into a second data structure storing reorganized imaging data. The raw imaging data or the encoded imaging data is received, stored in the first data structure. The computer reorganizes the raw imaging data or the encoded imaging data into the reorganized data and stores the reorganized data in the second data structure, which is a multi-dimensional array having subarrays containing local information needed by a convolutional neural network for processing the reorganized data. Other portions of the multi-dimensional array store other portions of the raw imaging data or the encoded imaging data. The computer also processes the reorganized data using the convolutional neural network to construct the image, whereby a constructed image is formed.

Korbin, John P.↗

Compositions and methods for engineering oil content in plants

Compositions and methods for producing plants with enhanced oil content and higher seed yield are disclosed. The transgenic plant comprises a polynucleotide encoding a monoacylglycerol O-acyltransferase 1 (MGAT1) operatively linked to a plant-expressible promoter; a polynucleotide encoding a phosphatidylcholine diacylglycerol cholinephosphotransferase 1 (PDCT1) operatively linked to a plant-expressible promoter; a polynucleotide encoding a suppressor of expression of Sugar Dependent 1 (SPD1) operatively linked to a plant-expressible promoter; a polynucleotide encoding a diacylglyerol acyltransferase (DGAT1) operatively linked to a plant-expressible promoter and a polynucleotide encoding a glycerol-3-phosphate dehydrogenase (GPD1) operatively linked to a plant-expressible promoter; or a combination thereof.

Dhankher, Om Parkash↗

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]↗

When does global attention help: a unified empirical study on atomistic graph learning

Graph neural networks (GNNs) are widely used as surrogates for costly experiments and first-principles simulations to study the behavior of compounds at atomistic scale, and their architectural complexity is constantly increasing to enable the modeling of complex physics. While most recent GNNs combine more traditional message passing neural networks (MPNNs) layers to model short-range interactions with more advanced graph transformers (GTs) with global attention mechanisms to model long-range interactions, it is still unclear when global attention mechanisms provide real benefits over well-tuned MPNN layers due to inconsistent implementations, features, or hyperparameter tuning. We introduce the first unified, reproducible benchmarking framework–built on HydraGNN–that enables seamless switching among four controlled model classes: MPNN, MPNN with chemistry/topology encoders, GPS-style hybrids of MPNN with global attention, and fully fused localglobal models with encoders. Using seven diverse open-source datasets for benchmarking across regression and classification tasks, we systematically isolate the contributions of message passing, global attention, and encoder-based feature augmentation. Our study shows that encoder-augmented MPNNs form a robust baseline, while fused localglobal models yield the clearest benefits for properties governed by long-range interaction effects. We further quantify the accuracycompute trade-offs of attention, reporting its overhead in memory. Together, these results establish the first controlled evaluation of global attention in atomistic graph learning and provide a reproducible testbed for future model development.

Equivariant graph neural networks↗

Metagenomic strategies identify diverse integron–integrase and antibiotic resistance genes in the Antarctic environment

The objective of this study is to identify and analyze integrons and antibiotic resistance genes (ARGs) in samples collected from diverse sites in terrestrial Antarctica. Integrons were studied using two independent methods. One involved the construction and analysis of intI gene amplicon libraries. In addition, we sequenced 17 metagenomes of microbial mats and soil by high-throughput sequencing and analyzed these data using the IntegronFinder program. As expected, the metagenomic analysis allowed for the identification of novel predicted intI integrases and gene cassettes (GCs), which mostly encode unknown functions. However, some intI genes are similar to sequences previously identified by amplicon library analysis in soil samples collected from non-Antarctic sites. ARGs were analyzed in the metagenomes using ABRIcate with CARD database and verified if these genes could be classified as GCs by IntegronFinder. We identified 53 ARGs in 15 metagenomes, but only four were classified as GCs, one in MTG12 metagenome (Continental Antarctica), encoding an aminoglycoside-modifying enzyme (AAC(6´)acetyltransferase) and the other three in CS1 metagenome (Maritime Antarctica). One of these genes encodes a class D β-lactamase (blaOXA-205) and the other two are located in the same contig. One is part of a gene encoding the first 76 amino acids of aminoglycoside adenyltransferase (aadA6), and the other is a qacG2 gene.

59 BASIC BIOLOGICAL SCIENCES↗

The Yersinia enterocolitica Ysa type III secretion system is expressed during infections both in vitro and in vivo

Yersinia enterocolitica biovar 1B maintains two type III secretion systems (T3SS) that are involved in pathogenesis, the plasmid encoded Ysc T3SS and the chromosomally encoded Ysa T3SS. In vitro, the Ysa T3SS has been shown to be expressed only at 26°C in a high-nutrient medium containing an exceptionally high concentration of salt – an artificial condition that provides no clear insight on the nature of signal that Y. enterocolitica responds to in a host. However, previous research has indicated that the Ysa system plays a role in the colonization of gastrointestinal tissues of mice. In this study, a series of Ysa promoter fusions to green fluorescent protein gene (gƒp) were created to analyze the expression of this T3SS during infection. Using reporter strains, infections were carried out in vitro using HeLa cells and in vivo using the mouse model of yersiniosis. Expression of green fluorescent protein (GFP) was measured from the promoters of yspP (encoding a secreted effector protein) and orƒ6 (encoding a structural component of the T3SS apparatus) in vitro and in vivo. During the infection of HeLa cells GFP intensity was measured by fluorescence microscopy, while during murine infections GFP expression in tissues was measured by flow cytometry. These approaches, combined with quantification of yspP mRNA transcripts by quantitative reverse transcriptase-polymerase chain reaction (qRT-PCR), demonstrate that the Ysa system is expressed in vitro in a contactdependent manner, and is expressed in vivo during infection of mice.

59 BASIC BIOLOGICAL SCIENCES↗

Novel pore size-controlled, susceptibility matched, 3D-printed MRI phantoms

We report the design concept and fabrication of MRI phantoms, containing blocks of aligned microcapillaires that can be stacked into larger arrays to construct diameter distribution phantoms or fractured, to create a “powder-averaged” emulsion of randomly oriented blocks for vetting or calibrating advanced MRI methods, that is, diffusion tensor imaging, AxCaliber MRI, MAP-MRI, and multiple pulsed field gradient or double diffusion-encoded microstructure imaging methods. The goal was to create a susceptibility-matched microscopically anisotropic but macroscopically isotropic phantom with a ground truth diameter that could be used to vet advanced diffusion methods for diameter determination in fibrous tissues. Two-photon polymerization, a novel three-dimensional printing method is used to fabricate blocks of capillaries. Double diffusion encoding methods were employed and analyzed to estimate the expected MRI diameter. Susceptibility-matched microcapillary blocks or modules that can be assembled into large-scale MRI phantoms have been fabricated and measured using advanced diffusion methods, resulting in microscopic anisotropy and random orientation. This phantom can vet and calibrate various advanced MRI methods and multiple pulsed field gradient or diffusion-encoded microstructure imaging methods. We demonstrated that two double diffusion encoding methods underestimated the ground truth diameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗