SEARCH · Engineering Papers

Results for “ENCODER”

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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS2011

A Multi-Encoding Approach for LTL Symbolic Satisfiability Checking

Formal behavioral specifications written early in the system-design process and communicated across all design phases have been shown to increase the efficiency, consistency, and quality of the system under development. To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal logic (LTL). We introduce a novel encoding of symbolic transition-based Buchi automata and a novel, "sloppy," transition encoding, both of which result in improved scalability. We also define novel BDD variable orders based on tree decomposition of formula parse trees. We describe and extensively test a new multi-encoding approach utilizing these novel encoding techniques to create 30 encoding variations. We show that our novel encodings translate to significant, sometimes exponential, improvement over the current standard encoding for symbolic LTL satisfiability checking.

Rozier, Kristin Y.↗

NASA NTRS2012

Method and system for efficient video compression with low-complexity encoder

Disclosed are a method and system for video compression, wherein the video encoder has low computational complexity and high compression efficiency. The disclosed system comprises a video encoder and a video decoder, wherein the method for encoding includes the steps of converting a source frame into a space-frequency representation; estimating conditional statistics of at least one vector of space-frequency coefficients; estimating encoding rates based on the said conditional statistics; and applying Slepian-Wolf codes with the said computed encoding rates. The preferred method for decoding includes the steps of; generating a side-information vector of frequency coefficients based on previously decoded source data, encoder statistics, and previous reconstructions of the source frequency vector; and performing Slepian-Wolf decoding of at least one source frequency vector based on the generated side-information, the Slepian-Wolf code bits and the encoder statistics.

Chen, Jun↗

DOE OSTI2026

Spatiotemporal Dynamics of the Relative Abundance of Soil Nutrient‐Degrading Enzyme‐Encoding Genes Across Continental US Ecoregions

Understanding the spatiotemporal patterns in the relative abundance of soil extracellular enzyme‐encoding genes is critical for predicting microbial responses to environmental change and their potential role in nutrient cycling. Yet, integrating novel metagenomic observations with spatiotemporal environmental gradients to infer regional patterns and future trajectories has remained unclear. To address this gap, we applied a machine learning (ML) approach, integrating soil metagenomic data with environmental variables—soil properties, topography, vegetation, and climate—to predict the relative abundance of enzyme‐encoding genes for soil carbon (C), nitrogen (N), and phosphorus (P) across surface soils of the continental United States. We assessed potential responses under future emission scenarios (SSP2‐4.5 and SSP5‐8.5) by comparing a baseline (1985–2014) to a future period (2071–2100). The ML model explained 57%–63% of baseline variation. Precipitation was identified as the most influential factor for the relative abundance of C‐ and N‐degrading enzyme‐encoding genes, while slope length, representing horizontal distance that water can travel downslope, was the primary driver for P‐degrading enzyme‐encoding genes abundance. Projections revealed spatially heterogeneous shifts across continental US ecoregions: the relative abundance of C‐ and N‐degrading enzyme‐encoding genes decreased in wetter ecoregions and increased in drier ecoregions under future climate, while P‐degrading enzyme‐encoding genes abundance decreased significantly in semiarid and Mediterranean ecoregions. This study demonstrates the utility of metagenomic data for mapping soil genetic potential and predicting its regional response to environmental change, to inform ecosystem management strategies.

extracellular enzyme-encoding genes↗

DOE OSTI2024

An efficient quantum circuit for block encoding a pairing Hamiltonian

We present an efficient quantum circuit for block encoding a pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode the Hamiltonian directly using controlled swap operations. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number of qubits required to represent a quantum state associated with the pairing Hamiltonian. We also show how the block encoding circuit can be combined with the quantum singular value transformation to construct an efficient quantum circuit for approximating the density of states of a pairing Hamiltonian. The techniques presented can be extended to encode more general second-quantized Hamiltonians.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗

NASA NTRS2020

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-of-the-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Deep-learning↗

DOE OSTI2023

Encoding integers and rationals on neuromorphic computers using virtual neuron

Abstract Neuromorphic computers emulate the human brain while being extremely power efficient for computing tasks. In fact, they are poised to be critical for energy-efficient computing in the future. Neuromorphic computers are primarily used in spiking neural network–based machine learning applications. However, they are known to be Turing-complete, and in theory can perform all general-purpose computation. One of the biggest bottlenecks in realizing general-purpose computations on neuromorphic computers today is the inability to efficiently encode data on the neuromorphic computers. To fully realize the potential of neuromorphic computers for energy-efficient general-purpose computing, efficient mechanisms must be devised for encoding numbers. Current encoding mechanisms (e.g., binning, rate-based encoding, and time-based encoding) have limited applicability and are not suited for general-purpose computation. In this paper, we present the virtual neuron abstraction as a mechanism for encoding and adding integers and rational numbers by using spiking neural network primitives. We evaluate the performance of the virtual neuron on physical and simulated neuromorphic hardware. We estimate that the virtual neuron could perform an addition operation using just 23 nJ of energy on average with a mixed-signal, memristor-based neuromorphic processor. We also demonstrate the utility of the virtual neuron by using it in some of the μ -recursive functions, which are the building blocks of general-purpose computation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Contradictory Ambiguous Revocable Assertion Tracker (CARAT) Encoding

How data is encoded in a knowledge graph directly influences what can be done with that data. A common problem with many encodings is that they have difficulty representing ambiguity and evolution inherent in many real-world data sets. The data encoding represented in this paper (called CARAT) is a graph-level description of our attempt to capture data that is contradictory, ambiguous and evolves over time (including deleting information). The data encoding relies on tracking assertions about subjects rather than directly tracking states. This encoding decision resolves many issues our team had experienced using other data encodings but produces a a larger graph. This is a preliminary presentation of our experience with CARAT.

Cottam, Joseph A. [BATTELLE (PACIFIC NW LAB)]↗

NASA NTRS1975

Space vehicle onboard command encoder

A flexible onboard encoder system was designed for the space shuttle. The following areas were covered: (1) implementation of the encoder design into hardware to demonstrate the various encoding algorithms/code formats, (2) modulation techniques in a single hardware package to maintain comparable reliability and link integrity of the existing link systems and to integrate the various techniques into a single design using current technology. The primary function of the command encoder is to accept input commands, generated either locally onboard the space shuttle or remotely from the ground, format and encode the commands in accordance with the payload input requirements and appropriately modulate a subcarrier for transmission by the baseband RF modulator. The following information was provided: command encoder system design, brassboard hardware design, test set hardware and system packaging, and software.

Source record↗

NASA NTRS1980

Digital encoding of NTSC color video signals using adaptive delta modulation

This paper presents the initial results of our study of the use of adaptive delta modulation to encode color signals. The techniques considered include direct encoding of the color video signal, encoding of each of the three color components, i.e., R, G and B, and encoding of the chrominance and luminance signals I, Y and Q. It is shown that at any transmitted bit rate between 8 Mb/s and 24 Mb/s the best quality picture reproduction occurs when the I, Y and Q signals are encoded and the poorest quality picture reproduction occurs when the composite video signal is encoded. Furthermore, the differences in quality are significant.

Davidovici, S.↗

NASA NTRS1981

Architecture for VLSI design of Reed-Solomon encoders

The logic structure of a universal VLSI chip called the symbol-slice Reed-Solomon (RS) encoder chip is discussed. An RS encoder can be constructed by cascading and properly interconnecting a group of such VLSI chips. As a design example, it is shown that a (255,223) RD encoder requiring around 40 discrete CMOS ICs may be replaced by an RS encoder consisting of four identical interconnected VLSI RS encoder chips. Besides the size advantage, the VLSI RS encoder also has the potential advantages of requiring less power and having a higher reliability.

Liu, K. Y.↗

NASA NTRS2020

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-ofthe-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Hesham ElAbd↗

DOE OSTI2026

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Hadfield, Stuart [RIACS, Mtn. View] (ORCID:0000000↗

DOE OSTI2023

Glass Additive and Subtractive Manufacturing of a Fiber Optic Rotary Encoder for Downhole Pressure Sensing

This article presents a fiber optic rotary encoder-based pressure sensor for downhole applications. The rotary encoder, which is composed of an encoding pad and an all-glass optical fiber sensing head, converts the rotation angles of a pressure transducer to digital codes. The optical fiber only serves as the telemetry channel to directly transmit the data in digital format such that the environmental temperature influence and the long-time drift are minimized. The glass additive and subtractive manufacturing (ASM) techniques are used to embed the multichannel optical fibers into a bulk-fused silica glass substrate. Because the fused silica glass shares a similar material property to the optical fiber (e.g., thermal expansion coefficient), the optical fiber sensing head is well sealed and fixed even at an elevated temperature. The picosecond laser blackening technique is used to fabricate the high reflectivity contrast encoding pad with high accuracy. Here, the proposed pressure sensor was manufactured and experimentally verified to have a signal-to-noise ratio (SNR) of 23 dB and a linear pressure response with a root-mean-square error (RMSE) of 0.37. During the 400-h 250 °C long-term stability test, there was no digital code variation. In addition, a mathematical model to study the relationships between the sensor’s performances and design parameters was established. According to the model, a 12-bit encoder (0.02% pressure sensitivity) can be achieved with a radius of 20 mm.

02 PETROLEUM↗

DOE OSTI2019

Design and analysis of multi-hexagonal reversible encoder using photonic crystals

In this paper, a 4 × 2 reversible encoder with hexagonal lattice has been designed using two-dimensional photonic crystals with non-linear refractive index. In order to demonstrate the working of the encoder, we have used the multi-hexagonal shaped structure arranged in parallel with appropriate inclination to get the desired output. During its functionality as an encoder, more than 98% of the power is coupled at the output port to obtain logic 1 and less than 17.2% of the power is coupled for obtaining logic 0. In addition, during its functionality as a reversible encoder, the logic 1 and logic 0 correspond to 97.5% and 15.1%, respectively. The proposed encoder provides an improved contrast ratio of 12.18 dB and 11.5 dB for logical states of 01 and 10, respectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2012

Reduction of nuclear encoded enzymes of mitochondrial energy metabolism in cells devoid of mitochondrial DNA

Highlights: Black-Right-Pointing-Pointer We examined OXPHOS and citrate synthase enzyme activities in HEK293 cells devoid of mtDNA. Black-Right-Pointing-Pointer Enzymes partially encoded by mtDNA show reduced activities. Black-Right-Pointing-Pointer Also the entirely nuclear encoded complex II and citrate synthase exhibit reduced activities. Black-Right-Pointing-Pointer Loss of mtDNA induces a feedback mechanism that downregulates complex II and citrate synthase. -- Abstract: Mitochondrial DNA (mtDNA) depletion syndromes are generally associated with reduced activities of oxidative phosphorylation (OXPHOS) enzymes that contain subunits encoded by mtDNA. Conversely, entirely nuclear encoded mitochondrial enzymes in these syndromes, such as the tricarboxylic acid cycle enzyme citrate synthase (CS) and OXPHOS complex II, usually exhibit normal or compensatory enhanced activities. Here we report that a human cell line devoid of mtDNA (HEK293 {rho}{sup 0} cells) has diminished activities of both complex II and CS. This finding indicates the existence of a feedback mechanism in {rho}{sup 0} cells that downregulates the expression of entirely nuclear encoded components of mitochondrial energy metabolism.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2012

TsPAP1 encodes a novel plant prolyl aminopeptidase whose expression is induced in response to suboptimal growth conditions

Highlights: Black-Right-Pointing-Pointer A cDNA encoding a novel plant prolyl aminopeptidase, TsPAP1, was obtained from triticale. Black-Right-Pointing-Pointer The cloned TsPAP1 cDNA is 1387 bp long and encodes a protein of 390 amino acids. Black-Right-Pointing-Pointer The deduced TsPAP1 protein revealed characteristics of the monomeric bacterial PAPs. Black-Right-Pointing-Pointer The TsPAP1 mRNA level increased under drought, salinity and in the presence of metal ions. -- Abstract: A triticale cDNA encoding a prolyl aminopeptidase (PAP) was obtained by RT-PCR and has been designated as TsPAP1. The cloned cDNA is 1387 bp long and encodes a protein of 390 amino acids with a calculated molecular mass of 43.9 kDa. The deduced TsPAP1 protein exhibits a considerable sequence identity with the biochemically characterized bacterial and fungal PAP proteins of small molecular masses ({approx}35 kDa). Moreover, the presence of conserved regions that are characteristic for bacterial monomeric PAP enzymes (the GGSWG motif, the localization of the catalytic triad residues and the segment involved in substrate binding) has also been noted. Primary structure analysis and phylogenetic analysis revealed that TsPAP1 encodes a novel plant PAP protein that is distinct from the multimeric proteins that have thus far been characterized in plants and whose counterparts have been recognized only in bacteria and fungi. A significant increase in the TsPAP1 transcript level in the shoots of triticale plants was observed under drought and saline conditions as well as in the presence of cadmium and aluminium ions in the nutrient medium. This paper is the first report describing changes in the transcript levels of any plant PAP in response to suboptimal growth conditions.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2026

Fault-tolerant resource comparison of qudit and qubit encodings for diagonal quadratic operators

Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by 𝑈 = 𝑒$^{−𝑖⁢𝑡⁢𝜙^2_𝑥}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical 𝑑-level qudit or 𝑛 𝑏 = ⌈log 2⁡ 𝑑⌉ logical qubits. We analyze two standard settings: product-formula simulation and linear combination of unitaries (LCU) per block encoding, taking the resource metric to be the number of non-Clifford gates after synthesis into a discrete logical gate set. Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU⁡(2) rotations and derive explicit finite-𝑑 break-even conditions for their synthesis cost; these serve as compiler targets for when qudit encodings can outperform the qubit baseline. Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in 𝑑. Nevertheless, the finite-𝑑 threshold analysis identifies low-dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations. As a secondary analysis of the LCU construction, we use an idealized negligible-overhead qubit-qudit code-switching model to give an absolute 𝑇-count comparison and reinterpret the savings as an allowable per-switch overhead budget.

Godwood, Samuel [Univ. of Liverpool (United Kingdo↗