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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

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.↗
NASA NTRS1991

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↗
NASA NTRS2009

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↗
NASA NTRSDate not supplied

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↗
DOE OSTI2025

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

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

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

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

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

Equivariant graph neural networks↗
DOE OSTI2024

Modern chemical graph theory

Abstract Graph theory has a long history in chemistry. Yet as the breadth and variety of chemical data is rapidly changing, so too do graph encoding methods and analyses that yield qualitative and quantitative insights. Using illustrative cases within a basic mathematical framework, we showcase modern chemical graph theory's utility in Chemists' analysis and model development toolkit. The encoding of both experimental and simulation data is discussed at various levels of granularity of information. This is followed by a discussion of the two major classes of graph theoretical analyses: identifying connectivity patterns and partitioning methods. Measures, metrics, descriptors, and topological indices are then introduced with an emphasis upon enhancing interpretability and incorporation into physical models. Challenging data cases are described that include strategies for studying time dependence. Throughout, we incorporate recent advancements in computer science and applied mathematics that are propelling chemical graph theory into new domains of chemical study. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Structure and Mechanism > Computational Materials Science Structure and Mechanism > Molecular Structures

Leite, Leonardo S. G.↗
DOE OSTI2026

Dense autoencoders, clustering techniques, and semi-supervised learning for HPGe $γ$-spectra

Classifying high-resolution gamma spectra by their isotopic content is an essential task in nuclear forensics and other applications. Traditional analysis methods are often time-intensive, but machine learning (ML) may help analysts quickly process many spectra. Such methods tend to rely on abundant, well-labeled data for training. Historical gamma data exists in various fields but is not uniformly useful for supervised ML due to inconsistent labeling. Here, to address some of these challenges, we present a method to classify and organize unlabeled data from high-purity germanium detectors using an autoencoding neural network (autoencoder). We trained dense autoencoders to compress gamma data into latent representations that enable efficient data characterization. By clustering the encoded spectra or lower-dimensional mappings of them, we identified and removed portions of over-abundant data categories, resulting in a more balanced dataset and improved autoencoder performance. This encoding and clustering pipeline also enabled the organization of spectra into self-consistent categories. Finally, we found that encoded representations showed potential as inputs for semi-supervised learning of nuclide identification (NID) labels, achieving an average F1 score of 0.85 ± 0.03 when mapping encodings to a set of 65 isotope labels.

Autoencoders↗
DOE OSTI2024

Genomics and physiology of Catenibacillus, human gut bacteria capable of polyphenol C-deglycosylation and flavonoid degradation

The genusCatenibacillus(familyLachnospiraceae, phylumBacillota) includes only one cultivated species so far,Catenibacillus scindens,isolated from human faeces and capable of deglycosylating dietary polyphenols and degrading flavonoid aglycones. Another human intestinalCatenibacillusstrain not taxonomically resolved at that time was recently genome-sequenced. We analysed the genome of this novel isolate, designatedCatenibacillus decagia, and showed its ability to deglycosylateC-coupled flavone and xanthone glucosides andO-coupled flavonoid glycosides. Most of the resulting aglycones were further degraded to the corresponding phenolic acids. Including the recently sequenced genome ofC. scindensand ten faecal metagenome-assembled genomes assigned to the genusCatenibacillus, we performed a comparative genome analysis and searched for genes encoding potentialC-glycosidases and other polyphenol-converting enzymes. According to genome data and physiological characterization, the core metabolism ofCatenibacillusstrains is based on a fermentative lifestyle with butyrate production and hydrogen evolution. BothC. scindensandC. decagiaencode a flavonoidO-glycosidase, a flavone reductase, a flavanone/flavanonol-cleaving reductase and a phloretin hydrolase. Several gene clusters encode enzymes similar to those of the flavonoidC-deglycosylation system ofDoreastrain PUE (DgpBC), while separately located genes encode putative polyphenol-glucoside oxidases (DgpA) required forC-deglycosylation. The diversity ofdgpAanddgpBCgene clusters might explain the broadC-glycoside substrate spectrum ofC. scindensandC. decagia. The otherCatenibacillusgenomes encode only a few potential flavonoid-converting enzymes. Our results indicate that severalCatenibacillusspecies are well-equipped to deglycosylate and degrade dietary plant polyphenols and might inhabit a corresponding, specific niche in the gut.

Genetics & Heredity↗
DOE OSTI2025

Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer

We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

3D Deep Learning Joint Inversion of Active Seismic Full Waveform and Passive Seismic Traveltime Data for Reservoir Imaging and Uncertainty Quantification

Here, we present deep learning (DL) networks for three-dimensional (3D) joint inversion of active seismic full waveform and passive seismic traveltime data to image reservoirs and their properties and quantify imaging uncertainties. Active seismic full-waveform data can provide high-resolution monitoring images but are collected only intermittently because of their high acquisition cost. In contrast, passive seismic data can be gathered at relatively low cost between regular active surveys, although their imaging quality can be compromised by factors such as low signal-to-noise ratios and limited ray coverage of the target. Although these datasets are routinely acquired together at CO 2 storage sites, their combined inversion within a 3D DL framework has not been previously demonstrated. To our knowledge, this is the first study to address this gap, combining the strength of both data types. For efficient data storage and DL training with large 3D seismic datasets, we use a 3D data matrix in which a random number of passive seismic traveltime data are stored as parabolic envelopes using one-hot encoding and a 3D full-waveform data matrix in which multiple shot gathers are summed. Two network architectures are evaluated: a single-encoder U-Net for single-data type inversion and a dual-encoder U-Net for joint inversion of active and passive seismic data. We also evaluate the single-encoder U-Net for joint inversion by concatenating full-waveform data and traveltime data. We propose a systematic approach for selecting an optimal dropout rate that balances regularization during training and Monte Carlo dropout-based uncertainty quantification during prediction by examining the correlation coefficient between standard deviation and prediction error, along with the training misfit, across a range of dropout rates. 3D DL inversion experiments include five different network configurations, with evaluations under ideal, noisy and dropout-enabled conditions. Both model and data uncertainties are assessed, as well as their combined effects. Across all conditions, the networks consistently predict accurate CO 2 saturation models with low prediction errors, such as a structural similarity index of 0.993 and CO 2 difference of 1.1%. Uncertainty estimates show strong spatial correlation with prediction errors, confirming the effectiveness of the proposed dropout selection approach. The results demonstrate that our DL approach, utilizing compact data representations and appropriate uncertainty quantification, yields accurate subsurface images under various inversion conditions and provides valuable insights into the reliability of predictions.

Um, Evan Schankee [Lawrence Berkeley National Labo↗
DOE OSTI2025

Tonoplast Sucrose Transporter SUT4-Dependent Sugar Partitioning Modulates Phenological Transitions and Reproductive Success in Poplar

Climate uncertainty is intensifying the need for greater plasticity in carbohydrate reserve utilization to support winter survival and spring growth in woody perennials. In poplar, the single-copy SUT4, which encodes a tonoplast-localized sucrose transporter, and the SUT5/SUT6 genome duplicates, which encode plasma membrane-localized transporters, are expressed year-round, with SUT4 showing the highest expression during cool seasons. Given its role in vacuolar sucrose efflux and winter-predominant expression, SUT4 may play a key role in modulating seasonal carbohydrate dynamics. While SUT4-knockdown and knockout effects have been studied under greenhouse conditions, their impact under field conditions remains unexplored. Here, we report a field-based study comparing CRISPR knockout mutants of winter-expressed SUT4 and SUT5/SUT6 in Populus tremula x alba. We show that sut4, but not sut5/6, mutants exhibited earlier autumn leaf senescence, delayed spring bud flush, reduced stem growth, and altered sugar partitioning in winter xylem and bark relative to controls. After 2 years in the field, all genotypes flowered before leaf flush in early spring; however, sut4 mutants produced sterile ovules despite developing normal-looking catkins. Metabolic profiling revealed disrupted sucrose and raffinose dynamics in elongating sut4 catkins. This was accompanied by transcriptomic signatures of elevated stress and downregulation of proanthocyanidin biosynthesis and circadian clock genes. These findings highlight the critical role of SUT4 in coordinating sugar allocation, stress responses, and seasonal development in poplar.

09 BIOMASS FUELS↗
DOE OSTI2025

The mevalonate pathway of isoprenoid biosynthesis supports metabolic flexibility in Mycobacterium marinum

ABSTRACT Isoprenoids are a diverse class of natural products that are essential in all domains of life. Most bacteria synthesize isoprenoids through either the methylerythritol phosphate (MEP) pathway or the mevalonate (MEV) pathway, while a small subset encodes both pathways, including the pathogen Mycobacterium marinum (Mm). It is unclear whether the MEV pathway is functional in Mm, or why Mm encodes seemingly redundant metabolic pathways. Here, we show that the MEP pathway is essential in Mm, while the MEV pathway is dispensable in culture, with the ΔMEV mutant having no growth defect in axenic culture but a competitive growth defect compared to WT Mm. We found that the MEV pathway does not play a role in ex vivo or in vivo acute infection but does play a role in survival of peroxide stress. Metabolite profiling revealed that modulation of the MEV pathway causes compensatory changes in the concentration of MEP intermediates DOXP and CDP-ME, suggesting that the MEV pathway is functional and that the pathways interact at the metabolic level. Finally, the MEV pathway is upregulated early in the shift down to hypoxia, suggesting that it may provide metabolic flexibility to this bacterium. Interestingly, we found that our complemented strains, which vary in copy number of the polyprenyl synthetase idsB2 , responded differently to peroxide and UV stresses, suggesting a role for this gene as a determinant of downstream prenyl phosphate metabolism. Together, these findings suggest that MEV may serve as an anaplerotic pathway to make isoprenoids under stress conditions. IMPORTANCE Organisms from all domains of life utilize isoprenoids to carry out thousands of critical and auxiliary cellular processes, including signaling, maintaining membrane integrity, stress response, and host-pathogen interactions. The common precursor of all isoprenoids is synthesized via one of two biosynthetic pathways. Importantly, some bacteria encode both pathways, including M. marinum . We found that only one pathway is essential in M. marinum , while the nonessential pathway may confer metabolic flexibility to help the bacterium better adapt to various environmental conditions. We also found that the polyprenyl synthetase IdsB2 plays an important role in driving such phenotypes. Further, we demonstrate metabolic interplay between both functional pathways. These insights represent the first characterization of isoprenoid biosynthesis in dual pathway-encoding mycobacteria.

Qabar, Christine M. [Department of Plant and Micro↗
DOE OSTI2025

Floodplain nitrifiers harbor the genetic potential for utilizing a wide range of organic nitrogen compounds

Organic compounds such as urea and cyanate can serve as nitrogen (N) sources for nitrifying microorganisms, including ammonia-oxidizing archaea (AOA) and bacteria (AOB), complete ammonia-oxidizing (comammox) bacteria, and nitrite-oxidizing bacteria (NOB). Here we investigated metagenome-assembled genomes (MAGs) for all four nitrifier guilds generated from hydrologically variable floodplain sediments of the Wind River Basin (WRB; Riverton, WY, USA) for their genetic potential to utilize organic N compounds. A vast majority of WRB nitrifier MAGs harbored urease (ure) and at least one urea transporter ( utp, urt, dur3 ). AOA were the most abundant and phylogenetically diverse nitrifiers in WRB floodplain sediments. Several AOA MAGs encoded cyanase ( cynS ), nitrilase ( nit1 ), omega-amidase ( nit2 ), nitrile hydratase ( nthA ), and genes related to purine degradation, including biuret hydrolase ( biuH ), oxamic transcarbamylase ( allFGH ), and catabolic carbamate kinase ( allK ). AOA often encoded an uncharacterized amidohydrolase collocated with biuH , rather than allophanate hydrolase ( atzF ). A small number of AOA encoded atzF , functioning in an unknown pathway. AOB and comammox were of relatively low abundance and taxonomic diversity and were present only at certain depths in WRB; however, they encoded triuret/biuret degradation genes ( trtA, biuH , and atzH ), and in comammox, these genes were also collocated with allFGHK . The genetic potential of ammonia oxidizers in the WRB floodplain suggests that organic N may support nitrification in this system. The proposed pathways for utilizing purine degradation products other than urea potentially expand the known metabolic capabilities of AOA, AOB, and comammox bacteria and reveal the possibility for cryptic N cycling between microbial community members.

floodplain↗
DOE OSTI2024

LLNL FESP Theory Highlights: October 2024

I. Novikau, I. Y. Dodin, E. A. Startsev, I. Joseph, Quantum algorithms for simulating dissipative linear and nonlinear dynamics of plasmas. Invited talk at the 66th Annual Meeting of the APS Division of Plasma Physics, Atlanta, Georgia. Novikau I., Dodin I.Y., Startsev E.A., Encoding of linear kinetic plasma problems in quantum circuits via data compression, Journal of Plasma Physics. 2024;90(4):805900401, doi:10.1017/S0022377824000795. We propose an algorithm for encoding linear kinetic plasma problems in quantum circuits. The focus is on modelling electrostatic linear waves in a one-dimensional Maxwellian electron plasma. The waves are described by the linearized Vlasov–Ampère system with a spatially localized external current that drives plasma oscillations. This system is formulated as a boundary-value problem and cast in the form of a linear vector equation to be solved by using the quantum signal processing algorithm. The latter requires encoding of a matrix in a quantum circuit as a sub-block of a unitary matrix. We propose how to encode in a circuit in a compressed form and discuss how the resulting circuit scales with the problem size and the desired precision.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

The Baby Universe is Fine and the CFT Knows It: On Holography for Closed Universes

Big bang/big crunch closed universes can be realized in AdS/CFT, even though they lack asymptotically AdS boundaries. With enough bulk entanglement, the bulk Hilbert space of a closed universe can be holographically encoded in the CFT. We clarify the relation of this encoding to observer-clone proposals and refute recent arguments about the breakdown of semiclassical physics in such spaces. In the limit of no bulk entanglement, the holographic encoding breaks down. The oft-cited one-dimensional nature of the closed universe Hilbert space represents the limitation of the external (CFT) Hilbert space to access the quantum information in the closed universe, similar to the limitations imposed on observers outside a perfectly isolated quantum lab. We advocate that the CFT nevertheless continues to determine the physical properties of the closed universe in this regime, showing how to interpret this relationship in terms of a final state projection in the closed universe. We provide a dictionary between the final state wavefunction and CFT data. We propose a model of the emergence of an arrow of time in the universe with a given initial or final state projection. Finally, we show that the conventional EFT in the closed universe, without any projection, can be recovered as a maximally ignorant description of the final state. This conventional EFT is encoded in CFT data, and it can be probed by computing coarse-grained observables. We provide an example of one such observable. Taken together, these results amount to a clean bill of health for baby universes born of AdS/CFT.

FOS: Physical sciences↗
DOE OSTI2025

NLR HPC Eagle GPU Node Metrics

Ganglia node metrics and iLO (Integrated Lights Out) power data captured from six representative Eagle GPU nodes The Eagle HPC operated at NLR from 2019 through 2024. Eagle was a 2,000-node, 8-petaflop system. This dataset is a representative sample of metrics for 6 of the GPU nodes. Each GPU node contained 2 CPUs and 2 GPUs. Data provided in compressed CSV format. Ganglia and iLO Power Time Series Fields ts: Timestamp dv: Device / Node - Rack and Unit - r103u17 == r(ack)103u(nit)17 mt: Metric (only present for Ganglia) vl: Value - Value in watts for iLO power (instantaneous value at sampling time) or specified Ganglia metric below Ganglia Metrics Metric name -- Metric description -- Unit cpu_aidle -- Percent of time since boot idle CPU -- Percent cpu_idle -- Percent CPU idle -- Percent cpu_nice -- Percent CPU nice -- Percent cpu_speed -- Speed in MHz of CPU -- MHz cpu_user -- Percent CPU user -- Percent cpu_wio -- The percentage of CPU Wait I/O -- Percent gpu0_bar1_memory -- Used GPU bar1 memory -- MB gpu0_decoder_util -- GPU decoder utilization -- Percent gpu0_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu0_encoder_util -- GPU encoder utilization -- Percent gpu0_fan -- Fan speed -- RPM gpu0_fb_memory -- Used GPU framebuffer memory -- MB gpu0_graphics_clock_report -- Current clock speeds for the device -- MHz gpu0_mem_total -- Memory total -- MB gpu0_mem_util -- Memory utilization -- Percent gpu0_power_usage_report -- Power usage report -- Watts gpu0_temp -- GPU 1 temperature -- Celsius gpu1_bar1_memory -- Used GPU bar1 memory -- MB gpu1_decoder_util -- GPU decoder utilization -- Percent gpu1_ecc_db_error -- Total ECC error counts for the GPU -- Number gpu1_encoder_util -- GPU encoder utilization -- Percent gpu1_fan -- Fan speed -- RPM gpu1_fb_memory -- Used GPU framebuffer memory -- MB gpu1_graphics_clock_report -- Current clock speeds for the GPU -- MHz gpu1_mem_total -- Memory total -- MB gpu1_mem_util -- Memory utilization -- MB gpu1_power_usage_report -- Power usage report -- Watts gpu1_temp -- GPU 1 temperature -- Celsius ipmi_cpu1_temp -- CPU 1 temperature -- Celsius ipmi_cpu2_temp -- CPU 2 temperature -- Celsius ipmi_inlet_ambient_temp -- Temperature measured at intake -- Celsius ipmi_vr_p1_temp -- CPU 1 voltage regulator temperature -- Celsius ipmi_vr_p2_temp -- CPU 2 voltage regulator temperature -- Celsius mem_buffers -- Amount of buffered memory -- Bytes mem_cached -- Amount of cached memory -- Bytes mem_free -- Amount of available memory -- Bytes mem_shared -- Amount of shared memory -- Bytes mem_total -- Amount of available memory -- Bytes

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Bandwidth compression of color video signals

The different encoder/decoder strategies to digitally encode video using an adaptive delta modulation are described. The techniques employed are: (1) separately encoding the R, G, and B components; (2) separately encoding the I, Y, and Q components; and (3) encoding the picture in a line sequential manner.

Schilling, D. L.↗