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,153 records · Page 64

Comparative genomics of the white-rot fungi, Phanerochaete carnosa and P. chrysosporium, to elucidate the genetic basis of the distinct wood types they colonize

Background Softwood is the predominant form of land plant biomass in the Northern hemisphere, and is among the most recalcitrant biomass resources to bioprocess technologies. The white rot fungus, Phanerochaete carnosa, has been isolated almost exclusively from softwoods, while most other known white-rot species, including Phanerochaete chrysosporium, were mainly isolated from hardwoods. Accordingly, it is anticipated that P. carnosa encodes a distinct set of enzymes and proteins that promote softwood decomposition. To elucidate the genetic basis of softwood bioconversion by a white-rot fungus, the present study reports the P. carnosa genome sequence and its comparative analysis with the previously reported P. chrysosporium genome. Results P. carnosa encodes a complete set of lignocellulose-active enzymes. Comparative genomic analysis revealed that P. carnosa is enriched with genes encoding manganese peroxidase, and that the most divergent glycoside hydrolase families were predicted to encode hemicellulases and glycoprotein degrading enzymes. Most remarkably, P. carnosa possesses one of the largest P450 contingents (266 P450s) among the sequenced and annotated wood-rotting basidiomycetes, nearly double that of P. chrysosporium. Along with metabolic pathway modeling, comparative growth studies on model compounds and chemical analyses of decomposed wood components showed greater tolerance of P. carnosa to various substrates including coniferous heartwood. Conclusions The P. carnosa genome is enriched with genes that encode P450 monooxygenases that can participate in extractives degradation, and manganese peroxidases involved in lignin degradation. The significant expansion of P450s in P. carnosa, along with differences in carbohydrate- and lignin-degrading enzymes, could be correlated to the utilization of heartwood and sapwood preparations from both coniferous and hardwood species.

59 BASIC BIOLOGICAL SCIENCES↗

Final technical report for award NO. DE-FG02-95ER20206

ABSTRACT Initial work focused on the regulation of nitrite reductase, the defining reaction of denitrification as well as nitric oxide (NO) reductase. Expression of the genes encoding both proteins was controlled by NnrR. This regulator was shown to be responsive to NO. More recent work has shown NnrR function is also likely inhibited by oxygen. Therefore, it is this protein that sets the oxygen level at which nitrate respiration takes over from aerobic respiration. The gene encoding NO reductase appears to only require NnrR for expression. Expression of the gene encoding nitrite reductase is more complex. In addition to NnrR, a two component sensor regulator complex termed PrrA and PrrB is also required for expression. These proteins are global regulators and serve to link denitrification with other bioenergetic processes in the cell. They also provide an additional layer of oxygen dependent regulation. The sequencing of the R. sphaeroides 2.4.3 genome allowed us to identify several other genes regulated by NnrR. Surprisingly, most of the genes were not essential for denitrification. Their high level of conservation in related denitrifiers suggests they do provide a selectable benefit to the bacterium, however. We also examined the role of nitrate reductase in contributing to denitrification in R. sphaeroides. Strain 2.4.3 is unusual in having two distinct, but related clusters of genes encoding nitrate reductase. One of these genes clusters is expressed under high oxygen conditions but is repressed, likely by PrrB-PrrA, under low oxygen conditions. The other cluster is expressed only under low oxygen conditions. This cluster expresses the nitrate reductase used during denitrification. The high oxygen expressed cluster encodes a protein used for redox homeostasis. Surprisingly, both clusters are fully expressed even in the absence of nitrate. During the course of this work we found that the type strain of R. sphaeroides, 2.4.1, is a partial denitrifier because it has the nitrate and NO reductases but lacks nitrite reductase. Like 2.4.3 it uses NnrR to regulate NO reductase. This unexpected arrangement suggested that it may use NO reductase to detoxify NO produced in its environment. Using a green fluorescent protein based reporter system we were able to demonstrate that NO produced by a denitrifier such as 2.4.3 can induce expression of NO reductase in 2.4.1. We then went on to show that the NO produced by denitrifiers can induce a stress response in other non-denitrifying bacteria. This suggests that the NO produced during denitrification will have a significant impact on the non-denitrifiers present in the surrounding environment. We also expanded our studies to include the denitrifier Agrobacterium tumefaciens. We demonstrated that the expression of the nitrite and NO reductase genes in this bacterium follows the same general scheme as in R. sphaeroides. We also were able to show that this bacterium would induce NO reductase in response to the NO produced by plants. Importantly, we were able to demonstrate that A. tumefaciens had difficulty transitioning from aerobic respiration to denitrification if the transition was sudden. This difficulty manifested as an accumulation of NO. In some conditions cells were slowly able to switch modes of respiration but in other cases NO accumulations seemed to kill the cells. The difficulty in transition appears to be due to an inability to produce enough energy once the oxygen has been completely consumed.

54 ENVIRONMENTAL SCIENCES↗

Atypical Carboxysome Loci: JEEPs or Junk?

Carboxysomes, responsible for a substantial fraction of CO 2 fixation on Earth, are proteinaceous microcompartments found in many autotrophic members of domain Bacteria, primarily from the phyla Proteobacteria and Cyanobacteria. Carboxysomes facilitate CO 2 fixation by the Calvin-Benson-Bassham (CBB) cycle, particularly under conditions where the CO 2 concentration is variable or low, or O 2 is abundant. These microcompartments are composed of an icosahedral shell containing the enzymes ribulose 1,5-carboxylase/oxygenase (RubisCO) and carbonic anhydrase. They function as part of a CO 2 concentrating mechanism, in which cells accumulate HCO 3 - in the cytoplasm via active transport, HCO 3 - enters the carboxysomes through pores in the carboxysomal shell proteins, and carboxysomal carbonic anhydrase facilitates the conversion of HCO 3 - to CO 2 , which RubisCO fixes. Two forms of carboxysomes have been described: α-carboxysomes and β-carboxysomes, which arose independently from ancestral microcompartments. The α-carboxysomes present in Proteobacteria and some Cyanobacteria have shells comprised of four types of proteins [CsoS1 hexamers, CsoS4 pentamers, CsoS2 assembly proteins, and α-carboxysomal carbonic anhydrase (CsoSCA)], and contain form IA RubisCO (CbbL and CbbS). In the majority of cases, these components are encoded in the genome near each other in a gene locus, and transcribed together as an operon. Interestingly, genome sequencing has revealed some α-carboxysome loci that are missing genes encoding one or more of these components. Some loci lack the genes encoding RubisCO, others lack a gene encoding carbonic anhydrase, some loci are missing shell protein genes, and in some organisms, genes homologous to those encoding the carboxysome-associated carbonic anhydrase are the only carboxysome-related genes present in the genome. Given that RubisCO, assembly factors, carbonic anhydrase, and shell proteins are all essential for carboxysome function, these absences are quite intriguing. In this review, we provide an overview of the most recent studies of the structural components of carboxysomes, describe the genomic context and taxonomic distribution of atypical carboxysome loci, and propose functions for these variants. We suggest that these atypical loci are JEEPs, which have modified functions based on the presence of Just Enough Essential Parts.

59 BASIC BIOLOGICAL SCIENCES↗

A Pattern Dictionary Method for Anomaly Detection

In this paper, we propose a compression-based anomaly detection method for time series and sequence data using a pattern dictionary. The proposed method is capable of learning complex patterns in a training data sequence, using these learned patterns to detect potentially anomalous patterns in a test data sequence. The proposed pattern dictionary method uses a measure of complexity of the test sequence as an anomaly score that can be used to perform stand-alone anomaly detection. We also show that when combined with a universal source coder, the proposed pattern dictionary yields a powerful atypicality detector that is equally applicable to anomaly detection. The pattern dictionary-based atypicality detector uses an anomaly score defined as the difference between the complexity of the test sequence data encoded by the trained pattern dictionary (typical) encoder and the universal (atypical) encoder, respectively. We consider two complexity measures: the number of parsed phrases in the sequence, and the length of the encoded sequence (codelength). Specializing to a particular type of universal encoder, the Tree-Structured Lempel–Ziv (LZ78), we obtain a novel non-asymptotic upper bound, in terms of the Lambert W function, on the number of distinct phrases resulting from the LZ78 parser. This non-asymptotic bound determines the range of anomaly score. As a concrete application, we illustrate the pattern dictionary framework for constructing a baseline of health against which anomalous deviations can be detected.

97 MATHEMATICS AND COMPUTING↗

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↗

Metal resistant plants and phytoremediation of environmental contamination

The present disclosure provides a method of producing transgenic plants which are resistant to at least one metal ion by transforming the plant with a recombinant DNA comprising a nucleic acid encoding a bacterial arsenic reductase under the control of a plant expressible promoter, and a nucleic acid encoding a nucleotide sequence encoding a phytochelatin biosynthetic enzyme under the control of a plant expressible promoter. The invention also relates a method of phytoremediation of a contaminated site by growing in the site a transgenic plant expressing a nucleic acid encoding a bacterial arsenate reductase and a nucleic acid encoding a phytochelatin biosynthetic enzyme.

54 ENVIRONMENTAL SCIENCES↗

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↗