Terrain-Relative Navigation with Neuro-Inspired Elevation Encoding
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
The invention generally relates to linear-bottlebrush-linear copolymer blocks and methods of making and using same. The disclosed copolymer blocks can be useful in, for example, the formation of polymer networks that replicate biological stress-strain behavior. This abstract is intended as a scanning tool for purposes of searching in the particular art and is not intended to be limiting of the present invention.
Explore the source record for details and available documents.
X-ray free electron lasers (X-FEL{sub s}) will soon offer femtosecond pulses of laterally coherent x-rays with sufficient intensity to record single-shot coherent scattering patterns for nanoscale imaging. Pulse trains created by splitand-delay techniques even open the door for cinematography on unprecedented nanometer length and femtosecond time scales. A key to real space ultrafast motion pictures is fast and reliable inversion of the recorded reciprocal space scattering patterns. Here we for the first time demonstrate in the x-ray regime the power of a novel technique for lensless high resolution imaging, previously suggested by Guizar-Sicairos and Fienup termed holography with extended reference by autocorrelation linear differential operation, HERALD0. We have achieved superior resolution over conventional x-ray Fourier transform holography (FTH) without sacrifices in SNR or significant increase in algorithmic complexity. By combining images obtained from individual sharp features on an extended reference, we further show that the resolution can be even extended beyond the reference fabrication limits. Direct comparison to iterative phase retrieval image reconstruction and images recorded with stateof- the-art zone plate microscopes is presented. Our results demonstrate the power of HERALDO as a favorable candidate for robust inversion of single-shot coherent scattering patterns.
In one general embodiment, a method for ultrafast optical signal detecting is provided. In operation, a first optical input signal is propagated through a first wave guiding layer of a waveguide. Additionally, a second optical input signal is propagated through a second wave guiding layer of the waveguide. Furthermore, an optical control signal is applied to a top of the waveguide, the optical control signal being oriented diagonally relative to the top of the waveguide such that the application is used to influence at least a portion of the first optical input signal propagating through the first wave guiding layer of the waveguide. In addition, the first and the second optical input signals output from the waveguide are combined. Further, the combined optical signals output from the waveguide are detected. In another general embodiment, a system for ultrafast optical signal recording is provided comprising a waveguide including a plurality of wave guiding layers, an optical control source positioned to propagate an optical control signal towards the waveguide in a diagonal orientation relative to a top of the waveguide, at least one optical input source positioned to input an optical input signal into at least a first and a second wave guiding layer of the waveguide, and a detector for detecting at least one interference pattern output from the waveguide, where at least one of the interference patterns results from a combination of the optical input signals input into the first and the second wave guiding layer. Furthermore, propagation of the optical control signal is used to influence at least a portion of the optical input signal propagating through the first wave guiding layer of the waveguide.
The permanent draft genome sequence of Actinotignum schaalii DSM 15541 T is presented. The annotated genome includes 2,130,987 bp, with 1777 protein-coding and 58 rRNA-coding genes. Genome sequence analysis revealed absence of genes encoding for: components of the PTS systems, enzymes of the TCA cycle, glyoxylate shunt and gluconeogensis. Genomic data revealed that A. schaalii is able to oxidize carbohydrates via glycolysis, the nonoxidative pentose phosphate and the Entner-Doudoroff pathways. Besides, the genome harbors genes encoding for enzymes involved in the conversion of pyruvate to lactate, acetate and ethanol, which are found to be the end products of carbohydrate fermentation. The genome contained the gene encoding Type I fatty acid synthase required for de novo FAS biosynthesis. The plsY and plsX genes encoding the acyltransferases necessary for phosphatidic acid biosynthesis were absent from the genome. The genome harbors genes encoding enzymes responsible for isoprene biosynthesis via the mevalonate (MVA) pathway. Genes encoding enzymes that confer resistance to reactive oxygen species (ROS) were identified. In addition, A. schaalii harbors genes that protect the genome against viral infections. These include restriction-modification (RM) systems, type II toxin-antitoxin (TA), CRISPR-Cas and abortive infection system. A. schaalii genome also encodes several virulence factors that contribute to adhesion and internalization of this pathogen such as the tad genes encoding proteins required for pili assembly, the nanI gene encoding exo-alpha-sialidase, genes encoding heat shock proteins and genes encoding type VII secretion system. These features are consistent with anaerobic and pathogenic lifestyles. Finally, resistance to ciprofloxacin occurs by mutation in chromosomal genes that encode the subunits of DNA-gyrase (GyrA) and topisomerase IV (ParC) enzymes, while resistant to metronidazole was due to the frxA gene, which encodes NADPH-flavin oxidoreductase.
Several improved turbo code apparatuses and methods. The invention encompasses several classes: (1) A data source is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each encoder outputs a code element which may be transmitted or stored. A parallel decoder provides the ability to decode the code elements to derive the original source information d without use of a received data signal corresponding to d. The output may be coupled to a multilevel trellis-coded modulator (TCM). (2) A data source d is applied to two or more encoders with an interleaver between the source and each of the second and subsequent encoders. Each of the encoders outputs a code element. In addition, the original data source d is output from the encoder. All of the output elements are coupled to a TCM. (3) At least two data sources are applied to two or more encoders with an interleaver between each source and each of the second and subsequent encoders. The output may be coupled to a TCM. (4) At least two data sources are applied to two or more encoders with at least two interleavers between each source and each of the second and subsequent encoders. (5) At least one data source is applied to one or more serially linked encoders through at least one interleaver. The output may be coupled to a TCM. The invention includes a novel way of terminating a turbo coder.
Small genes (<150nucleotides) have been systematically overlooked in phage genomes. We employ a large scale comparative genomics approach to predict >40,000 small-gene families in 2.3 million phage genome contigs. We find that small genes in phage genomes are approximately 3-fold more prevalent than in host prokaryotic genomes. Our approach enriches for small genes that are translated in microbiomes, suggesting the small genes identified are coding. More than 9,000 families encode potentially secreted or transmembrane proteins, more than 5,000families encode predicted anti-CRISPR proteins, and more than500families encode predicted antimicrobial proteins. By combining homology and genomic-neighborhood analyses, we reveal substantial novelty and diversity within phage biology, including small phage genes found in multiple host phyla, small genes encoding proteins that play essential roles in host infection, and small genes that share genomic neighborhoods and whose encoded proteins may share related functions.
The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.
A communication device includes a data source that generates data for transmission over a bus, and a data encoder that receives and encodes outgoing data. An encoder system receives outgoing data from a data source and stores the outgoing data in a first queue. An encoder encodes outgoing data with a header type that is based upon a header type indication from a controller and stores the encoded data that may be a packet or a data word with at least one layered header in a second queue for transmission. The device is configured to receive at a payload extractor, a packet protocol change command from the controller and to remove the encoded data and to re-encode the data to create a re-encoded data packet and placing the re-encoded data packet in the second queue for transmission.
We study the robustness of quantum error correction in a one-parameter ensemble of codes generated by the Brownian SYK model, where the parameter quantifies the encoding complexity. The robustness of error correction by a quantum code is upper bounded by the “mutual purity” of a certain entangled state between the code subspace and environment in the isometric extension of the error channel, where the mutual purity of a density matrix ρAB is the difference $\mathcal{F}$ p ($A : B$) ≡ $\mathrm{T}$r $p^{2}_{AB}$ - $\mathrm{T}$r $p^{2}_{A}$ $\mathrm{T}$r $p^{2}_{B}$. We show that when the encoding complexity is small, the mutual purity is O(1) for the erasure of a small number of qubits (i.e., the encoding is fragile). However, this quantity decays exponentially, becoming O(1/N) for O(log N) encoding complexity. Further, at polynomial encoding complexity, the mutual purity saturates to a plateau of O(e -N ). We also find a hierarchy of complexity scales associated to a tower of subleading contributions to the mutual purity that quantitatively, but not qualitatively, adjust our error correction bound as encoding complexity increases. In the AdS/CFT context, our results suggest that any portion of the entanglement wedge of a general boundary subregion A with sufficiently high encoding complexity is robustly protected against low-rank errors acting on A with no prior access to the encoding map. From the bulk point of view, we expect such bulk degrees of freedom to be causally inaccessible from the region A despite being encoded in it.
Neuromorphic computing is steadily gaining popularity in many scientific and engineering disciplines. However, one of the biggest problems that has prevented widespread usage of neuromorphic computing is the lack of efficient encoding methods. Traditional encoding methods such as binning, rate encoding, and temporal encoding are based on unary encoding and generate a large number of spikes for certain applications, making them less energy efficient. Lack of better encoding methods has also prevented preprocessing operations from being carried out on neuromorphic computers. As a result, over 99% of the time can be spent on data preprocessing and data transfer operations in some cases, leading to an inefficient workflow. In this paper, we present preliminary results that would enable us to efficiently encode data and perform basic arithmetic operations on neuromorphic computers. First, we present a neuromorphic approach for the two’s complement encoding of numbers and leverage it to devise addition and multiplication circuits, which could be used in preprocessing operations on neuromorphic computers. We test our approach on the SuperNeuroMAT simulator. Our results indicate that two’s complement is a highly efficient encoding method in terms of time, space, and energy complexity and that the addition and multiplication circuits produce accurate results on two numbers having arbitrary precision.
Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.
The unifying structural characteristic of members of the bacterial order Thermotogales is an unusual cell envelope that includes a loose-fitting sheath around each cell, often called a toga. Only two toga-associated structural proteins have been identified in Thermotoga maritima: the anchor protein OmpA1 (previously termed Ompα) and the porin OmpB (previously termed Ompβ). The gene encoding OmpA (ompA1) was assigned in the genome sequence to TM0477, but because no peptide sequence was available for OmpB, its gene (ompB) was not annotated. Here we identify the ompB gene as TM0476, determined by LC/MS/MS analysis of the native OmpB protein purified from T. maritima cells. The purified OmpB had β-sheet secondary structure as determined by circular dichroism. Analysis of the sequence of ompB product shows it has porin characteristics including a carboxy terminus anchoring motif and a porin-specific amino acid composition. Orthologs of ompB were found in the genomes of some, but not all, Thermotogales. Those without orthologs have putative analogs. Phylogenetic analyses of OmpA1 revealed that each species of the Thermotogales has one to three OmpA homologs. T. maritima has two OmpA homologs, encoded by ompA1(TM0477) and ompA2 (TM1729), both of which were found in the toga protein-enriched cell extracts. These annotations of the genes encoding toga structural proteins will guide future examinations of the structure and function of this unusual lineage-defining cell sheath.
Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multithreaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0× and 6.8× on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3× over the multithread encoder on two 28-core Xeon Platinum 8280 CPUs.
Abstract Alicyclobacillus acidocaldarius is a thermoacidophilic bacterium capable of growth on sugars from plant biomass. Carbon catabolite repression (CCR) allows bacteria to focus cellular resources on a sugar that provides efficient growth, but also allows sequential, rather than simultaneous use when more than one sugar is present. The A. acidocaldarius genome encodes all components of CCR, but transporters encoded are multifacilitator superfamily and ATP-binding cassette-type transporters, uncommon for CCR. Therefore, global transcriptome analysis of A. acidocaldarius grown on xylose or fructose was performed in chemostats, followed by attempted induction of CCR with glucose or arabinose. Alicyclobacillus acidocaldarius grew while simultaneously metabolizing xylose and glucose, xylose and arabinose, and fructose and glucose, indicating that CCR did not control carbon metabolism. Microarrays showed down-regulation of genes during growth on one sugar compared to two, and occurred primarily in genes encoding: (1) regulators; (2) enzymes for cell wall synthesis; and (3) sugar transporters.
In the genome of Shewanella oneidensis, a napDAGHB gene cluster encoding periplasmic nitrate reductase (NapA) and accessory proteins and an nrfA gene encoding periplasmic nitrite reductase (NrfA) have been identified. These two systems seem to be atypical because the genome lacks genes encoding cytoplasmic membrane electron transport proteins, NapC for NAP and NrfBCD/NrfH for NRF, respectively. Here, we present evidence that reduction of nitrate to ammonium in S. oneidensis is carried out by these atypical systems in a two-step manner. Transcriptional and mutational analyses suggest that CymA, a cytoplasmic membrane electron transport protein, is likely to be the functional replacement of both NapC and NrfH in S. oneidensis. Surprisingly, a strain devoid of napB encoding the small subunit of nitrate reductase exhibited the maximum cell density sooner than the wild type. Further characterization of this strain showed that nitrite was not detected as a free intermediate in its culture and NapB provides a fitness gain for S. oneidensis to compete for nitrate in the environments. On the basis results from mutational analyses of napA, napB, nrfA and napBnrfA in-frame deletion mutants, we propose that NapB is able to favor nitrate reduction by routing electrons to NapA exclusively.