Search NASA⌕ Search

SEARCH · Search NASA

Results for “Encoding”

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,099 records · Page 61

Overcoming a limitation of deterministic dense coding with a nonmaximally entangled initial state

Under two-party deterministic dense coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |{Psi}>. If |{Psi}> represents a maximally entangled state (i.e., each of its Schmidt coefficients is {radical}(1/d)), then Alice can convey to Bob one of d{sup 2} distinct messages. If |{Psi}> is not maximally entangled, then Ji et al. [Phys. Rev. A 73, 034307 (2006)] have shown that under the original deterministic dense-coding protocol, in which messages are encoded by unitary operations performed on Alice's qudit, it is impossible to encode d{sup 2}-1 messages. Encoding d{sup 2}-2 messages is possible; see, for example, the numerical studies by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Answering a question raised by Wu et al. [Phys. Rev. A 73, 042311 (2006)], we show that when |{Psi}> is not maximally entangled, the communications limit of d{sup 2}-2 messages persists even when the requirement that Alice encode by unitary operations on her qudit is weakened to allow encoding by more general quantum operators. We then describe a dense-coding protocol that can overcome this limitation with high probability, assuming the largest Schmidt coefficient of |{Psi}> is sufficiently close to {radical}(1/d). In this protocol, d{sup 2}-2 of the messages are encoded via unitary operations on Alice's qudit, and the final (d{sup 2}-1)-th message is encoded via a non-trace-preserving quantum operation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-E-19: A Novel Method for TrueBeam Jaw Calibration

Purpose: A simple jaw calibration method is proposed for Varian TrueBeam using an EPID-Encoder combination that gives accurate fields sizes and a homogeneous junction dose. This benefits clinical applications such as mono-isocentric half-beam block breast cancer or head and neck cancer treatment with junction/field matching. Methods: We use EPID imager with pixel size 0.392 mm × 0.392 mm to determine the radiation jaw position as measured from radio-opaque markers aligned with the crosshair. We acquire two images with different symmetric field sizes and record each individual jaw encoder values. A linear relationship between each jaw’s position and its encoder value is established, from which we predict the encoder values that produce the jaw positions required by TrueBeam’s calibration procedure. During TrueBeam’s jaw calibration procedure, we move the jaw with the pendant to set the jaw into position using the predicted encoder value. The overall accuracy is under 0.1 mm. Results: Our in-house software analyses images and provides sub-pixel accuracy to determine field centre and radiation edges (50% dose of the profile). We verified the TrueBeam encoder provides a reliable linear relationship for each individual jaw position (R{sup 2}>0.9999) from which the encoder values necessary to set jaw calibration points (1 cm and 19 cm) are predicted. Junction matching dose inhomogeneities were improved from >±20% to <±6% using this new calibration protocol. However, one technical challenge exists for junction matching, if the collimator walkout is large. Conclusion: Our new TrueBeam jaw calibration method can systematically calibrate the jaws to crosshair within sub-pixel accuracy and provides both good junction doses and field sizes. This method does not compensate for a larger collimator walkout, but can be used as the underlying foundation for addressing the walkout issue.

60 APPLIED LIFE SCIENCES↗

Lightweight LSTM for CAN Signal Decoding

This paper describes an approach to identify undecoded Controller Area Network (CAN) data from one vehicle, based on the data similarity to previously decoded CAN data from another vehicle. Modern vehicles communicate data and signals from on-board sensors and controllers through the CAN bus. Networked sensors contain information such as wheel speeds, fuel gauges, turn signals, and radar signals. In the effort to use this information and make cars safer through human-in-the-loop CPS, signals on the CAN bus such as wheel speed and radar can be used to support the driver. However, data from the CAN bus are encoded and in some cases compressed, and different car manufacturers use different encoding schemes to represent data on the CAN bus. With hundreds of messages and thousands of possible encoding schemes to consider, it is laborious to identify the unique bits and encoding schemes that represent signals on each vehicle. In this study, we propose a method for training a Long Short-Term Memory (LSTM) neural network on known radar signals from one vehicle manufacturer, a Toyota, and successfully apply the network to identify the encoding for radar signals on a different vehicle, a Honda. By augmenting the training dataset with varied encoding bit boundaries, a small and lightweight LSTM network can learn to recognize radar data across different encoding schemes. The results are an improvement on exhaustive-search algorithms and other methods previously used in the search for such signals.

Ngo, Paul↗

Genome description of Phlebia radiata 79 with comparative genomics analysis on lignocellulose decomposition machinery of phlebioid fungi

Background: The white rot fungus Phlebia radiata, a type species of the genus Phlebia, is an efficient decomposer of plant cell wall polysaccharides, modifier of softwood and hardwood lignin, and is able to produce ethanol from various waste lignocellulose substrates. Thus, P. radiata is a promising organism for biotechnological applications aiming at sustainable utilization of plant biomass. Here we report the genome sequence of P. radiata isolate 79 originally isolated from decayed alder wood in South Finland. To better understand the evolution of wood decay mechanisms in this fungus and the Polyporales phlebioid clade, gene content and clustering of genes encoding specific carbohydrate-active enzymes (CAZymes) in seven closely related fungal species was investigated. In addition, other genes encoding proteins reflecting the fungal lifestyle including peptidases, transporters, small secreted proteins and genes involved in secondary metabolism were identified in the genome assembly of P. radiata. Results: The PACBio sequenced nuclear genome of P. radiata was assembled to 93 contigs with 72X sequencing coverage and annotated, revealing a dense genome of 40.4 Mbp with approximately 14 082 predicted protein-coding genes. According to functional annotation, the genome harbors 209 glycoside hydrolase, 27 carbohydrate esterase, 8 polysaccharide lyase, and over 70 auxiliary redox enzyme-encoding genes. Comparisons with the genomes of other phlebioid fungi revealed shared and specific properties among the species with seemingly similar saprobic wood-decay lifestyles. Clustering of especially GH10 and AA9 enzyme-encoding genes according to genomic localization was discovered to be conserved among the phlebioid species. In P. radiata genome, a rich repertoire of genes involved in the production of secondary metabolites was recognized. In addition, 49 genes encoding predicted ABC proteins were identified in P. radiata genome together with 336 genes encoding peptidases, and 430 genes encoding small secreted proteins. Conclusions: The genome assembly of P. radiata contains wide array of carbohydrate polymer attacking CAZyme and oxidoreductase genes in a composition identifiable for phlebioid white rot lifestyle in wood decomposition, and may thus serve as reference for further studies. Comparative genomics also contributed to enlightening fungal decay mechanisms in conversion and cycling of recalcitrant organic carbon in the forest ecosystems.

59 BASIC BIOLOGICAL SCIENCES↗

Comparison of voice types for helicopter voice warning systems

Three related studies were conducted to compare different types of human voice warnings. In the first study, a comparison of three LPC-encoded voices, human female, human male, and phoneme-synthesized, by the criteria of pilot flight task performance showed no differences due to the voice type. In the second study, pilots' preferences were investigated, by comparing preference for direct synthesized speech to the LPC-encoded human female speech and to LPC-encoded synthesized speech. Most pilots were found to prefer direct synthesized speech over both LPC-encoded human female speech and the LPC-encoded synthesized speech. In the third study, phonetically balanced (PB) words heard in simulated helicopter noise were used to compare the intelligibility of direct synthesized and LPC-encoded phoneme-synthesized speech types. PB word intelligibility was found to be better for direct synthesized speech than for the LPC-encodes synthesized speech.

Simpson, C. A.↗

Fault-Tolerant Coding for State Machines

Two reliable fault-tolerant coding schemes have been proposed for state machines that are used in field-programmable gate arrays and application-specific integrated circuits to implement sequential logic functions. The schemes apply to strings of bits in state registers, which are typically implemented in practice as assemblies of flip-flop circuits. If a single-event upset (SEU, a radiation-induced change in the bit in one flip-flop) occurs in a state register, the state machine that contains the register could go into an erroneous state or could hang, by which is meant that the machine could remain in undefined states indefinitely. The proposed fault-tolerant coding schemes are intended to prevent the state machine from going into an erroneous or hang state when an SEU occurs. To ensure reliability of the state machine, the coding scheme for bits in the state register must satisfy the following criteria: 1. All possible states are defined. 2. An SEU brings the state machine to a known state. 3. There is no possibility of a hang state. 4. No false state is entered. 5. An SEU exerts no effect on the state machine. Fault-tolerant coding schemes that have been commonly used include binary encoding and "one-hot" encoding. Binary encoding is the simplest state machine encoding and satisfies criteria 1 through 3 if all possible states are defined. Binary encoding is a binary count of the state machine number in sequence; the table represents an eight-state example. In one-hot encoding, N bits are used to represent N states: All except one of the bits in a string are 0, and the position of the 1 in the string represents the state. With proper circuit design, one-hot encoding can satisfy criteria 1 through 4. Unfortunately, the requirement to use N bits to represent N states makes one-hot coding inefficient.

Naegle, Stephanie Taft↗

Method and System for Temporal Filtering in Video Compression Systems

Three related innovations combine improved non-linear motion estimation, video coding, and video compression. The first system comprises a method in which side information is generated using an adaptive, non-linear motion model. This method enables extrapolating and interpolating a visual signal, including determining the first motion vector between the first pixel position in a first image to a second pixel position in a second image; determining a second motion vector between the second pixel position in the second image and a third pixel position in a third image; determining a third motion vector between the first pixel position in the first image and the second pixel position in the second image, the second pixel position in the second image, and the third pixel position in the third image using a non-linear model; and determining a position of the fourth pixel in a fourth image based upon the third motion vector. For the video compression element, the video encoder has low computational complexity and high compression efficiency. The disclosed system comprises a video encoder and a decoder. The encoder converts the source frame into a space-frequency representation, estimates the conditional statistics of at least one vector of space-frequency coefficients with similar frequencies, and is conditioned on previously encoded data. It estimates an encoding rate based on the conditional statistics and applies a Slepian-Wolf code with the computed encoding rate. The method for decoding includes generating a side-information vector of frequency coefficients based on previously decoded source data and encoder statistics and previous reconstructions of the source frequency vector. It also performs Slepian-Wolf decoding of a source frequency vector based on the generated side-information and the Slepian-Wolf code bits. The video coding element includes receiving a first reference frame having a first pixel value at a first pixel position, a second reference frame having a second pixel value at a second pixel position, and a third reference frame having a third pixel value at a third pixel position. It determines a first motion vector between the first pixel position and the second pixel position, a second motion vector between the second pixel position and the third pixel position, and a fourth pixel value for a fourth frame based upon a linear or nonlinear combination of the first pixel value, the second pixel value, and the third pixel value. A stationary filtering process determines the estimated pixel values. The parameters of the filter may be predetermined constants.

Lu, Ligang↗

Bilayer Protograph Codes for Half-Duplex Relay Channels

Direct to Earth return links are limited by the size and power of lander devices. A standard alternative is provided by a two-hops return link: a proximity link (from lander to orbiter relay) and a deep-space link (from orbiter relay to Earth). Although direct to Earth return links are limited by the size and power of lander devices, using an additional link and a proposed coding for relay channels, one can obtain a more reliable signal. Although significant progress has been made in the relay coding problem, existing codes must be painstakingly optimized to match to a single set of channel conditions, many of them do not offer easy encoding, and most of them do not have structured design. A high-performing LDPC (low-density parity-check) code for the relay channel addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality, and are not easily adapted without extensive re-optimization for various channel conditions. This code for the relay channel combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a pro to graph. In addition to the contribution to relay encoding, an improved family of protograph codes was produced for the point-to-point AWGN (additive white Gaussian noise) channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity. These LDPC relay codes address three important issues in an integrative manner: low encoding complexity, modular structure allowing for easy design, and rate compatibility so that the code can be easily matched to a variety of channel conditions without extensive re-optimization. The main problem of half-duplex relay coding can be reduced to the simultaneous design of two codes at two rates and two SNRs (signal-to-noise ratios), such that one is a subset of the other. This problem can be addressed by forceful optimization, but a clever method of addressing this problem is via the bilayer lengthened (BL) LDPC structure. This method uses a bilayer Tanner graph to make the two codes while using a concept of "parity forwarding" with subsequent successive decoding that removes the need to directly address the issue of uneven SNRs among the symbols of a given codeword. This method is attractive in that it addresses some of the main issues in the design of relay codes, but it does not by itself give rise to highly structured codes with simple encoding, nor does it give rate-compatible codes. The main contribution of this work is to construct a class of codes that simultaneously possess a bilayer parity- forwarding mechanism, while also benefiting from the properties of protograph codes having an easy encoding, a modular design, and being a rate-compatible code.

Divsalar, Dariush↗

Author Correction: Genome-guided isolation of the hyperthermophilic aerobe Fervidibacter sacchari reveals conserved polysaccharide metabolism in the Armatimonadota

Correction to: Nature Communicationshttps://doi.org/10.1038/s41467-024-53784-3, published online 4 November 2024 In the version of this article initially published, Table 1 did not include the properties of the taxa being proposed or refer directly to another location in the main manuscript describing the properties. As such, the original manuscript did not comply with Rule 27 (2)(c) of the ICNP. Also, Table 1 listed the order Fervidibacterales as the nomenclatural type for the class Fervidibacteria, which violates latest emended version of Rule 15 stating that the nomenclatural type for a class must be a genus. Below we provide a modification of Table 1 containing protologues with these errors corrected. We have also changed the order of the taxa in the table to meet the most common ordering. (Table presented.) Taxon names proposed under the ICNP Proposed taxon Etymology Description Genus Fervidibacter Fer.vi.di.bac’ter. L. masc. adj. fervidus, hot, steaming; N.L. masc. n. bacter, a rod; N.L. masc. n. Fervidibacter, a hot rod Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic, with high-affinity and/or low-affinity terminal oxidases present in the genomes. The oxidative pentose phosphate pathway and the tricarboxylic acid cycle are complete in genomes belonging to the genus. Gram-stain-negative and diderm cell envelope structure. Ovoid- to rod-shaped morphology. Spores are not formed. The genus is a distinct phylogenetic lineage in the family Fervidibacteraceae, the order Fervidibacterales, and the class Fervidibacteria in the phylum Armatimonadota. The type species is Fervidibacter sacchariT. Species Fervidibacter sacchari sac’cha.ri. N.L. gen. n. sacchari, of sugar Hyperthermophilic, microaerophilic, facultatively anaerobic, and grows chemoheterotrophically on monosaccharides and polysaccharides. Cells are ovoid- to rod-shaped, Gram-stain negative, and are 0.9–1.3 µm in width and 1.6–3.6 µm in length. Grows between 65 and 87.5 °C and an optimum temperature of 80 °C, and a pH range of 6.5–8.6 with an optimum pH of 7.5. Grows at an optimum O2 concentration of 5–10%. Grows on D-arabinose, D-galactose, D-glucose, D-rhamnose, D-ribose, D-xylose, chondroitin sulfate, colloidal chitin, galactan, gellan gum, guar gum, karaya gum, locust bean gum, xantham gum, xyloglucan, β-glucan, glycogen, starch, AFEX-pretreated corn stover, miscanthus, sugarcane bagasse, acetate and casamino acids. Grows weakly on xyloglucan under fermentation conditions. The major fatty acids (>10%) are C16:0, C18:0 and/or cyclo-C17:0, and iso-C16:0. The major respiratory quinones (>10%) are MK-8 and MK-9. The isolate and genomes of the species have been recovered from geothermal springs in the Great Basin, Nevada, USA. GC content of genomes range between 51–52%. Subunits for both the high-affinity and low-affinity terminal oxidases are encoded in the genomes. Genomes also encode a Group 3d [NiFe] hydrogenase, which produces hydrogen as an electron sink for NAD+ regeneration. The type strain PD1T (= JCM 39283T = DSM 113467T) was isolated from Great Boiling Spring in Nevada, USA. Family Fervidibacteraceae Fer.vi.di.bac.te.ra’ce.ae. N.L. masc. n. Fervidibacter type genus of the family; L. suff. -aceae ending to denote a family; N.L. fem. pl. n. Fervidibacteraceae the family of the genus Fervidibacter Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic, with high-affinity and/or low-affinity terminal oxidases present in the genomes. The oxidative pentose phosphate pathway and the tricarboxylic acid cycle are complete in genomes belonging to the family. The family is a distinct phylogenetic lineage in the order Fervidibacterales and the class Fervidibacteria in the phylum Armatimonadota. The type genus is Fervidibacter. Order Fervidibacterales Fer.vi.di.bac.te.ra’les. N.L. masc. n. Fervidibacter type genus of the order; L. suff. -ales ending to denote an order; N.L. fem. pl. n. Fervidibacterales the order of the genus Fervidibacter Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic or strictly anaerobic. Phylogenomic placement of this lineage within the Fervidibacteria and relative evolutionary divergence supports delineation of this lineage as an order within the class Fervidibacteria and phylum Armatimonadota. The type genus is Fervidibacter. Class Fervidibacteria Fer.vi.di.bac.te’ri.a. N.L. masc. n. Fervidibacter type genus of the type order of the class; L. suff. -ia ending to denote a class; N.L. neut. pl. n. Fervidibacteria the class of the order Fervidibacterales Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic or strictly anaerobic. Phylogenomic placement of this lineage within the Armatimonadota and relative evolutionary divergence supports delineation of this lineage as a class within the Armatimonadota. The type genus is Fervidibacter. The error has not been corrected in the PDF or HTML versions of the Article.

Nou, Nancy O↗

Noisy quantum trees: infinite protection without correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by the delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d ≥ 2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encodes the received qubit in the binary repetition code with distance d = 1.

Quantum information↗

A Highly Tilted Binding Mode by a Self-Reactive T Cell Receptor Results in Altered Engagement of Peptide and MHC

Self-reactive T cells that escape elimination in the thymus can cause autoimmune pathology, and it is therefore important to understand the structural mechanisms of self-antigen recognition. We report the crystal structure of a T cell receptor (TCR) from a patient with relapsing-remitting multiple sclerosis that engages its self-peptide-major histocompatibility complex (pMHC) ligand in an unusual manner. The TCR is bound in a highly tilted orientation that prevents interaction of the TCR-{alpha} chain with the MHC class II {beta} chain helix. In this structure, only a single germline-encoded TCR loop engages the MHC protein, whereas in most other TCR-pMHC structures all four germline-encoded TCR loops bind to the MHC helices. The tilted binding mode also prevents peptide contacts by the short complementarity-determining region (CDR) 3{beta} loop, and interactions that contribute to peptide side chain specificity are focused on the CDR3{alpha} loop. This structure is the first example in which only a single germline-encoded TCR loop contacts the MHC helices. Furthermore, the reduced interaction surface with the peptide may facilitate TCR cross-reactivity. The structural alterations in the trimolecular complex are distinct from previously characterized self-reactive TCRs, indicating that there are multiple unusual ways for self-reactive TCRs to bind their pMHC ligand.

59 BASIC BIOLOGICAL SCIENCES↗

The tortoise and the hare: a causality puzzle in AdS/CFT

Here, we pose and resolve a holographic puzzle regarding an apparent violation of causality in anti-de Sitter (AdS)/conformal field theory. If a point in the bulk of AdS moves at the speed of light, the boundary subregion that encodes it may need to move superluminally to keep up. With AdS 3 as our main example, we prove that the finite extent of the encoding regions prevents a paradox. We show that the length of the minimal-size encoding interval gives rise to a tortoise coordinate on AdS that measures the nonlocality of the encoding. We use this coordinate to explore circular and radial motion in the bulk before passing to the analysis of bulk null geodesics. For these null geodesics, there is always a critical encoding where the possible violation of causality is barely avoided. We show that in any other encoding, the possible violation is subcritical.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Mo than meets the eye: genomic insights into molybdoenzyme diversity of Seleniivibrio woodruffii strain S4T

Abstract Seleniivibrio woodruffii strain S4T is an obligate anaerobe belonging to the phylum Deferribacterota. It was isolated for its ability to respire selenate and was also found to respire arsenate. The high-quality draft genome of this bacterium is 2.9 Mbp, has a G+C content of 48%, 2762 predicted genes of which 2709 are protein-coding, and 53 RNA genes. An analysis of the genome focusing on the genes encoding for molybdenum-containing enzymes (molybdoenzymes) uncovered a remarkable number of genes encoding for members of the dimethylsulfoxide reductase family of proteins (DMSOR), including putative reductases for selenate and arsenate respiration, as well as genes for nitrogen fixation. Respiratory molybdoenzymes catalyze redox reactions that transfer electrons to a variety of substrates that can act as terminal electron acceptors for energy generation. Seleniivibrio woodruffii strain S4T also has essential genes for molybdate transporters and the biosynthesis of the molybdopterin guanine dinucleotide cofactors characteristic of the active centers of DMSORs. Phylogenetic analysis revealed candidate respiratory DMSORs spanning nine subfamilies encoded within the genome. Our analysis revealed the untapped potential of this interesting microorganism and expanded our knowledge of molybdoenzyme co-occurrence.

Louie, Tiffany S.↗

The State of the Art in Visualizing Dynamic Multivariate Networks

Abstract Most real‐world networks are both dynamic and multivariate in nature, meaning that the network is associated with various attributes and both the network structure and attributes evolve over time. Visualizing dynamic multivariate networks is of great significance to the visualization community because of their wide applications across multiple domains. However, it remains challenging because the techniques should focus on representing the network structure, attributes and their evolution concurrently. Many real‐world network analysis tasks require the concurrent usage of the three aspects of the dynamic multivariate networks. In this paper, we analyze current techniques and present a taxonomy to classify the existing visualization techniques based on three aspects: temporal encoding, topology encoding, and attribute encoding. Finally, we survey application areas and evaluation methods; and discuss challenges for future research.

Kale, Bharat↗

A TonB-Dependent Transporter Is Responsible for Methanobactin Uptake by Methylosinus trichosporium OB3b

Methanobactin, a small modified polypeptide synthesized by methanotrophs for copper uptake, has been found to be chromosomally encoded. The gene encoding the polypeptide precursor of methanobactin, mbnA , is part of a gene cluster that also includes several genes encoding proteins of unknown function (but speculated to be involved in methanobactin formation) as well as mbnT , which encodes a TonB-dependent transporter hypothesized to be responsible for methanobactin uptake. In order to determine if mbnT is truly responsible for methanobactin uptake, a knockout was constructed in Methylosinus trichosporium OB3b using marker exchange mutagenesis. The resulting M. trichosporium mbnT::Gm r mutant was found to be able to produce methanobactin but was unable to internalize it. Further, if this mutant was grown in the presence of copper and exogenous methanobactin, copper uptake was significantly reduced. Expression of mmoX and pmoA , encoding polypeptides of the soluble methane monooxygenase (sMMO) and particulate methane monooxygenase (pMMO), respectively, also changed significantly when methanobactin was added, which indicates that the mutant was unable to collect copper under these conditions. Copper uptake and gene expression, however, were not affected in wild-type M. trichosporium OB3b, indicating that the TonB-dependent transporter encoded by mbnT is responsible for methanobactin uptake and that methanobactin is a key mechanism used by methanotrophs for copper uptake. When the mbnT::Gm r mutant was grown under a range of copper concentrations in the absence of methanobactin, however, the phenotype of the mutant was indistinguishable from that of wild-type M. trichosporium OB3b, indicating that this methanotroph has multiple mechanisms for copper uptake.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A recursive technique for adaptive vector quantization

Vector Quantization (VQ) is fast becoming an accepted, if not preferred method for image compression. The VQ performs well when compressing all types of imagery including Video, Electro-Optical (EO), Infrared (IR), Synthetic Aperture Radar (SAR), Multi-Spectral (MS), and digital map data. The only requirement is to change the codebook to switch the compressor from one image sensor to another. There are several approaches for designing codebooks for a vector quantizer. Adaptive Vector Quantization is a procedure that simultaneously designs codebooks as the data is being encoded or quantized. This is done by computing the centroid as a recursive moving average where the centroids move after every vector is encoded. When computing the centroid of a fixed set of vectors the resultant centroid is identical to the previous centroid calculation. This method of centroid calculation can be easily combined with VQ encoding techniques. The defined quantizer changes after every encoded vector by recursively updating the centroid of minimum distance which is the selected by the encoder. Since the quantizer is changing definition or states after every encoded vector, the decoder must now receive updates to the codebook. This is done as side information by multiplexing bits into the compressed source data.

Lindsay, Robert A.↗

Noiseless compression using non-Markov models

Adaptive data compression techniques can be viewed as consisting of a model specified by a database common to the encoder and decoder, an encoding rule and a rule for updating the model to ensure that the encoder and decoder always agree on the interpretation of the next transmission. The techniques which fit this framework range from run-length coding, to adaptive Huffman and arithmetic coding, to the string-matching techniques of Lempel and Ziv. The compression obtained by arithmetic coding is dependent on the generality of the source model. For many sources, an independent-letter model is clearly insufficient. Unfortunately, a straightforward implementation of a Markov model requires an amount of space exponential in the number of letters remembered. The Directed Acyclic Word Graph (DAWG) can be constructed in time and space proportional to the text encoded, and can be used to estimate the probabilities required for arithmetic coding based on an amount of memory which varies naturally depending on the encoded text. The tail of that portion of the text which was encoded is the longest suffix that has occurred previously. The frequencies of letters following these previous occurrences can be used to estimate the probability distribution of the next letter. Experimental results indicate that compression is often far better than that obtained using independent-letter models, and sometimes also significantly better than other non-independent techniques.

Blumer, Anselm↗