Processing and transmission of information
Effects of noise in picture processing & coding color pictures, sequential decoding facility, and error bound for fixed-time continuous channels
SEARCH · Engineering Papers
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.
Effects of noise in picture processing & coding color pictures, sequential decoding facility, and error bound for fixed-time continuous channels
Encoding and decoding equipment for magnetic tape recording of slowly varying meteorological parameters
Digital command detector and decoder for Ranger Block III command system
Application of sequential decoding algorithm to measurement problems
Distribution of matrices resulting from Newtons identities in field of characteristic two - decoding
Probability distribution study of data transmission time random variable - sequential decoding technique
Concatenation method for decoding of complex short codes
Information content of q-level m-sequences restricted to sums of n - analysis of enumeration, encoding, and decoding problems
Information theory in fabricating decoding schemes
Integrated circuit decoder for Apollo spacecraft up-data link
Computer program documentation of engineering analysis, decoding, program listing, input and output data display sheets, and computations
Adaptive telemetry conference on adaptive data control and processing, prediction, data compression, encoding, decoding, and modulation.
Pathcount and coding matrices for sequence time encoding and decoding for data compression
We propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2 bits/sec/Hz with 8PSK and 16QAM signal constellations.
Exploding dataset sizes from extreme-scale scientific simulations necessitates efficient data management and reduction schemes to mitigate I/O costs. With the discrepancy between I/O bandwidth and computational power, scientists are forced to capture data infrequently, thereby making data collection an inherently lossy process. Although data compression can be an effective solution, the random nature of real-valued scientific datasets renders lossless compression routines ineffective. These techniques also impose significant overhead during decompression, making them unsuitable for data analysis and visualization, which require repeated data access. To address this problem, we propose an effective method for In situ Sort-And-B-spline Error-bounded Lossy Abatement (ISABELA) of scientific data that is widely regarded as effectively incompressible. With ISABELA, we apply a pre-conditioner to seemingly random and noisy data along spatial resolution to achieve an accurate fitting model that guarantees a ≥0.99 correlation with the original data. We further take advantage of temporal patterns in scientific data to compress data b ≈ 85%, while introducing only a negligible overhead on simulations in terms of runtime. ISABELA significantly outperforms existing lossy compression methods, such as wavelet compression, in terms of data reduction and accuracy. We extend upon our previous paper by additionally building a communication-free, scalable parallel storage framework on top of ISABELA-compressed data that is ideally suited for extreme-scale analytical processing. The basis for our storage framework is an inherently local decompression method (it need not decode the entire data), which allows for random access decompression and low-overhead task division that can be exploited over heterogeneous architectures. Furthermore, analytical operations such as correlation and query processing run quickly and accurately over data in the compressed space. Copyright © 2012 John Wiley & Sons, Ltd.
Individual phases are commonly considered as the building blocks of materials. However, the accurate theoretical prediction of properties of individual phases remains elusive. The top-down approach by decoding genomic building blocks of individual phases from experimental observations is nonunique. The density functional theory (DFT), as a state-of-the-art solution of quantum mechanics, prescribes the existence of a ground-state configuration at 0 K for a given system. It is self-evident that the ground-state configuration alone is insufficient to describe a phase at finite temperatures as symmetry-breaking non-ground-state configurations are excited statistically at temperatures above 0 K. Our multiscale entropy approach (recently terms as Zentropy theory) postulates that the entropy of a phase is composed of the sum of the entropy of each configuration weighted by its probability plus the configurational entropy among all configurations. Consequently, the partition function of each configuration in statistical mechanics needs to be evaluated by its free energy rather than total energy. The combination of the ground-state and symmetry-breaking non-ground-state configurations represents the building blocks of materials and can be used to quantitatively predict free energy of individual phases with the free energy of each configuration predicted from DFT as well as all properties derived from free energy of individual phases.
Graph foundation models using graph neural networks promise sustainable, efficient atomistic modeling. To tackle challenges of processing multi-source, multi-fidelity data during pre-training, recent studies employ multi-task learning, in which shared message passing layers initially process input atomistic structures regardless of source, then route them to multiple decoding heads that predict data-specific outputs. This approach stabilizes pre-training and enhances a model’s transferability to unexplored chemical regions. Preliminary results on approximately four million structures are encouraging, yet questions remain about generalizability to larger, more diverse datasets and scalability on supercomputers. We propose a multi-task parallelism method that distributes each head across computing resources with GPU acceleration. Implemented in the open-source HydraGNN architecture, our method was trained on over 24 million structures from five datasets and tested on the Perlmutter, Aurora, and Frontier supercomputers, demonstrating efficient scaling on all three highly heterogeneous super-computing architectures.