Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compression methods”

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 163 records · Page 9

HGQ: High Granularity Quantization for Real-time Neural Networks on FPGAs

Neural networks with sub-microsecond inference latency are required by many critical applications. Targeting such applications deployed on FPGAs, we present High Granularity Quantization (HGQ), a quantization-aware training framework that optimizes parameter bit-widths through gradient descent. Unlike conventional methods, HGQ determines the optimal bit-width for each parameter independently, making it suitable for hardware platforms supporting heterogeneous arbitrary precision arithmetic. In our experiments, HGQ shows superior performance compared to existing network compression methods, achieving orders of magnitude reduction in resource consumption and latency while maintaining the accuracy on several benchmark tasks. These improvements enable the deployment of complex models previously infeasible due to resource or latency constraints. HGQ is open-source and is used for developing next-generation trigger systems at the CERN ATLAS and CMS experiments for particle physics, enabling the use of advanced machine learning models for real-time data selection with sub-microsecond latency.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Conditional replenishment using motion prediction

Conditional replenishment is an interframe video compression method that uses correlation in time to reduce video transmission rates. This method works by detecting and sending only the changing portions of the image and by having the receiver use the video data from the previous frame for the non-changing portion. The amount of compression that can be achieved through this technique depends to a large extent on the rate of change within the image, and can vary from 10 to 1 to less than 2 to 1. An additional 3 to 1 reduction in rate is obtained by the intraframe coding of data blocks using a 2-dimensional variable rate Hadamard transform coder. A further additional 2 to 1 rate reduction is achieved by using motion prediction. Motion prediction works by measuring the relative displacements of a subpicture from one frame to the next. The subpicture can then be transmitted by sending only the value of the 2-dimensional displacement. Computer simulations have demonstrated that data rates of 2 to 4 Mega-bits/second can be achieved while still retaining good fidelity in the image.

Hein, D. N.↗

A comparison of two incompressible Navier-Stokes algorithms for unsteady internal flow

A comparative study of two different incompressible Navier-Stokes algorithms for solving an unsteady, incompressible, internal flow problem is performed. The first algorithm uses an artificial compressibility method coupled with upwind differencing and a line relaxation scheme. The second algorithm uses a fractional step method with a staggered grid, finite volume approach. Unsteady, viscous, incompressible, internal flow through a channel with a constriction is computed using the first algorithm. A grid resolution study and parameter studies on the artificial compressibility coefficient and the maximum allowable residual of the continuity equation are performed. The periodicity of the solution is examined and several periodic data sets are generated using the first algorithm. These computational results are compared with previously published results computed using the second algorithm and experimental data.

Wiltberger, N. Lyn↗

Method and system for electrochemically compressing gaseous hydrogen

Method and system for electrochemically compressing hydrogen. In one embodiment, the system includes a membrane electrode assembly (MEA) that includes a polymer electrolyte membrane (PEM), an anode, and a cathode. First and second gas diffusion media are positioned adjacent the cathode and anode, respectively. A humidifying membrane is positioned next to the second gas diffusion medium on a side opposite the anode. A water supply is connected to the humidifying membrane, and a hydrogen gas supply is connected to the second gas diffusion medium. A hydrogen gas collector including a back pressure regulator is connected to the first gas diffusion medium. Separators, positioned on opposite sides of the MEA, are connected to a power source. In use, hydrogen is electrochemically pumped across the MEA and collected in the hydrogen gas collector. The PEM is kept properly humidified by the humidifying membrane, which releases water into the second gas diffusion medium.

Hamdan, Monjid↗

Determining Biosignatures by Complexity Analysis in Antarctic Cryptoendolithic Communities

One of the most difficult problems of life detection is that of identifying biosignatures across a wide range of scales using multiple co-registered probes. The technique should be of equal utility across a wide range of search spaces from remote sensors probing volumes of space or planetary surfaces, visual eye or camera searches across the surface of a rock in Antarctica, low resolution microscopic scanning of a rock or a space craft in situ, or high resolution electron microscope and computerized tomography scanning of geobiological samples. We describe here an approach to this problem which derives in large part from past work done in the area of astrophysics - namely the analysis of complexity in galactic signals by data compression methods. This approach is a radically new one for geobiology and astrobiology, and allows us to assess the complexity (and thus potential biogenicity) of an object being examined. This is done by considering the information within pixels of an image (regardless the sensor used to gather the information) as an energetic system capable of description in terms of classical thermodynamics. The image data space is searched by an algorithm that judges complexity via data compression (e.g., the more compressible it is, the less complex, and vice versa) and maximum entropy as originally outlined by Shannon. At present we are implementing methods to utilize images from multiple sensors gathering different kinds of information (e.g., visible gray-scale data, color analyses, UV fluorescence, chemical information, etc). We present here preliminary data from deep UV fluorescence and ESEM (Environmental Scanning Electron Microscope) images from a layered cryptoendolithic community of an Antarctic rock.

Storrie-Lombardi, M. C.↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗

Scalable Hybrid Learning Techniques for Scientific Data Compression

Data compression is becoming critical for storing scientific data because many scientific applications need to store large amounts of data and post process this data for scientific discovery. Unlike image and video compression algorithms that limit errors to primary data (PD), scientists require compression techniques that accurately preserve derived quantities of interest (QoIs). Here, this article presents a physics-informed compression technique implemented as an end-to-end, scalable, GPU-based pipeline for data compression that addresses this requirement. Our hybrid compression technique combines machine learning techniques and standard compression methods. Specifically, we combine an autoencoder, an error-bounded lossy compressor to provide guarantees on raw data error, and a constraint satisfaction post-processing step to preserve the QoIs within a minimal error (generally less than floating point error). The effectiveness of the data compression pipeline is demonstrated by compressing nuclear fusion simulation data generated by a large-scale fusion code, XGC, which produces hundreds of terabytes of data in a single day. Our approach works within the ADIOS framework and results in compression by a factor of more than 150 while requiring only a few percent of the computational resources necessary for generating the data, making the overall approach highly effective for practical scenarios.

ITER↗

An efficient user-oriented method for calculating compressible flow about three-dimensional inlets

This method uses a so-called panel method to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained very cheaply. A number of graphical output features are provided to aid the user, including streamline tracing and automatic generation of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. This paper describes the method in some detail and presents calculated results.

Hess, J. L.↗

A Fourier-Chebyshev pseudospectral method for solving steady 3-D Navier-Stokes and heat equations in cylindrical cavities

A Fourier-Chebyshev pseudospectral method for solving steady 3D Navier-Stokes equations in cylindrical cavities is presented and discussed. The general method is pseudo-unsteady and uses a semi-implicit finite difference scheme for the time discretization. The generalized ADI (Alternating Direction Implicit) procedure is then applied to reduce the problem to a successive solution of one-dimensional problems. The spatial approximation uses a Fourier-Galerkin approximation in the periodic direction and a Chebyshev-collocation approximation in the other directions. Difficulties related to the pressure are surmounted by using the artifical compressibility method. A suitable variable change was chosen to avoid the problem of singularity at the axis generated by cylindrical coordinates. The method is first tested on an advection-diffusion equation and then on the Navier-Stokes equations. Finally, the method is illustrated by a convection problem of a differentially heated fluid.

Pulicani, J. P.↗

Adaptive Numerical Dissipative Control in High Order Schemes for Multi-D Non-Ideal MHD

The goal is to extend our adaptive numerical dissipation control in high order filter schemes and our new divergence-free methods for ideal MHD to non-ideal MHD that include viscosity and resistivity. The key idea consists of automatic detection of different flow features as distinct sensors to signal the appropriate type and amount of numerical dissipation/filter where needed and leave the rest of the region free of numerical dissipation contamination. These scheme-independent detectors are capable of distinguishing shocks/shears, flame sheets, turbulent fluctuations and spurious high-frequency oscillations. The detection algorithm is based on an artificial compression method (ACM) (for shocks/shears), and redundant multi-resolution wavelets (WAV) (for the above types of flow feature). These filter approaches also provide a natural and efficient way for the minimization of Div(B) numerical error. The filter scheme consists of spatially sixth order or higher non-dissipative spatial difference operators as the base scheme for the inviscid flux derivatives. If necessary, a small amount of high order linear dissipation is used to remove spurious high frequency oscillations. For example, an eighth-order centered linear dissipation (AD8) might be included in conjunction with a spatially sixth-order base scheme. The inviscid difference operator is applied twice for the viscous flux derivatives. After the completion of a full time step of the base scheme step, the solution is adaptively filtered by the product of a 'flow detector' and the 'nonlinear dissipative portion' of a high-resolution shock-capturing scheme. In addition, the scheme independent wavelet flow detector can be used in conjunction with spatially compact, spectral or spectral element type of base schemes. The ACM and wavelet filter schemes using the dissipative portion of a second-order shock-capturing scheme with sixth-order spatial central base scheme for both the inviscid and viscous MHD flux derivatives and a fourth-order Runge-Kutta method are denoted.

Yee, H. C.↗

Adaptive Numerical Dissipation Control in High Order Schemes for Multi-D Non-Ideal MHD

The required type and amount of numerical dissipation/filter to accurately resolve all relevant multiscales of complex MHD unsteady high-speed shock/shear/turbulence/combustion problems are not only physical problem dependent, but also vary from one flow region to another. In addition, proper and efficient control of the divergence of the magnetic field (Div(B)) numerical error for high order shock-capturing methods poses extra requirements for the considered type of CPU intensive computations. The goal is to extend our adaptive numerical dissipation control in high order filter schemes and our new divergence-free methods for ideal MHD to non-ideal MHD that include viscosity and resistivity. The key idea consists of automatic detection of different flow features as distinct sensors to signal the appropriate type and amount of numerical dissipation/filter where needed and leave the rest of the region free from numerical dissipation contamination. These scheme-independent detectors are capable of distinguishing shocks/shears, flame sheets, turbulent fluctuations and spurious high-frequency oscillations. The detection algorithm is based on an artificial compression method (ACM) (for shocks/shears), and redundant multiresolution wavelets (WAV) (for the above types of flow feature). These filters also provide a natural and efficient way for the minimization of Div(B) numerical error.

Yee, H. C.↗

Investigating Access Performance of Long Time Series with Restructured Big Model Data

Data sets generated by models are substantially increasing in volume, due to increases in spatial and temporal resolution, and the number of output variables. Many users wish to download subsetted data in preferred data formats and structures, as it is getting increasingly difficult to handle the original full-size data files. For example, application research users such as those involved with wind or solar energy, or extreme weather events are likely only interested in daily or hourly model data at a single point (or for a small area) for a long time period, and prefer to have the data downloaded in a single file. With native model file structures, such as hourly data from NASA Modern-Era Retrospective analysis for Research and Applications Version-2 (MERRA-2), it may take over 10 hours for the extraction of parameters-of-interest at a single point for 30 years. The NASA Goddard Earth Sciences Data and Information Services Center (GES DISC) is exploring methods to address this particular user need. One approach is to create value-added data by reconstructing the data files. Taking MERRA-2 data as an example, we have tested converting hourly data from one-day-per-file into different data cubes, such as one-month, or one-year. Performance is compared for reading local data files and accessing data through interoperable services, such as OPeNDAP. Results show that, compared to the original file structure, the new data cubes offer much better performance for accessing long time series. We have noticed that performance is associated with the cube size and structure, the compression method, and how the data are accessed. An optimized data cube structure will not only improve data access, but also may enable better online analysis services

reanalysis↗

Non-Gaussianity in the weak lensing correlation function likelihood – implications for cosmological parameter biases

ABSTRACT We study the significance of non-Gaussianity in the likelihood of weak lensing shear two-point correlation functions, detecting significantly non-zero skewness and kurtosis in 1D marginal distributions of shear two-point correlation functions in simulated weak lensing data. We examine the implications in the context of future surveys, in particular LSST, with derivations of how the non-Gaussianity scales with survey area. We show that there is no significant bias in 1D posteriors of Ωm and σ8 due to the non-Gaussian likelihood distributions of shear correlations functions using the mock data (100 deg2). We also present a systematic approach to constructing approximate multivariate likelihoods with 1D parametric functions by assuming independence or more flexible non-parametric multivariate methods after decorrelating the data points using principal component analysis (PCA). While the use of PCA does not modify the non-Gaussianity of the multivariate likelihood, we find empirically that the 1D marginal sampling distributions of the PCA components exhibit less skewness and kurtosis than the original shear correlation functions. Modelling the likelihood with marginal parametric functions based on the assumption of independence between PCA components thus gives a lower limit for the biases. We further demonstrate that the difference in cosmological parameter constraints between the multivariate Gaussian likelihood model and more complex non-Gaussian likelihood models would be even smaller for an LSST-like survey. In addition, the PCA approach automatically serves as a data compression method, enabling the retention of the majority of the cosmological information while reducing the dimensionality of the data vector by a factor of ∼5.

79 ASTRONOMY AND ASTROPHYSICS↗

ExtremeMETA: High-speed Lightweight Image Segmentation Model by Remodeling Multi-channel Metamaterial Imagers

Deep neural networks (DNNs) have heavily relied on traditional computational units, such as CPUs and GPUs. However, this conventional approach brings significant computational burden, latency issues, and high power consumption, limiting their effectiveness. This has sparked the need for lightweight networks such as ExtremeC3Net. Meanwhile, there have been notable advancements in optical computational units, particularly with metamaterials, offering the exciting prospect of energy-efficient neural networks operating at the speed of light. Yet, the digital design of metamaterial neural networks (MNNs) faces precision, noise, and bandwidth challenges, limiting their application to intuitive tasks and low-resolution images. In this study, we proposed a large kernel lightweight segmentation model, ExtremeMETA. Based on ExtremeC3Net, our proposed model, ExtremeMETA maximized the ability of the first convolution layer by exploring a larger convolution kernel and multiple processing paths. With the large kernel convolution model, we extended the optic neural network application boundary to the segmentation task. To further lighten the computation burden of the digital processing part, a set of model compression methods was applied to improve model efficiency in the inference stage. The experimental results on three publicly available datasets demonstrated that the optimized efficient design improved segmentation performance from 92.45 to 95.97 on mIoU while reducing computational FLOPs from 461.07 MMacs to 166.03 MMacs. The large kernel lightweight model ExtremeMETA showcased the hybrid design’s ability on complex tasks.

large convolution kernel↗

Photoinduced electronic excitations drive polymerization of carbon monoxide: A first-principles study

Under pressure, carbon monoxide (CO) transforms into a polymer that can be recovered to ambient conditions. While this transformation can occur without additional stimuli, experimental observations have shown that laser irradiation can induce a similar transformation at reduced pressure. The resulting polymeric phase, which is metastable under ambient conditions, releases energy through decomposition into more stable configurations. Using time-dependent density functional theory and Born–Oppenheimer molecular dynamics simulations, we investigate the mechanism by which electronic excitation facilitates CO polymerization. Our calculations reveal that electronic excitation enhances carbon–carbon bonding, enabling polymerization at pressures significantly lower than those required by conventional compression methods. In conclusion, these findings suggest that a photo-assisted approach could be employed to synthesize novel, potentially energetic materials under less demanding pressure conditions.

Born-Oppenheimer molecular dynamics↗

An analysis of parameter compression and Full-Modeling techniques with Velocileptors for DESI 2024 and beyond

In anticipation of forthcoming data releases of current and future spectroscopic surveys, we present the validation tests and analysis of systematic effects within velocileptors modeling pipeline when fitting mock data from the AbacusSummit N-body simulations. We compare the constraints obtained from parameter compression methods to the direct fitting (Full-Modeling) approaches of modeling the galaxy power spectra, and show that the ShapeFit extension to the traditional template method is consistent with the Full-Modeling method within the standard ΛCDM parameter space. We show the dependence on scale cuts when fitting the different redshift bins using the ShapeFit and Full-Modeling methods. We test the ability to jointly fit data from multiple redshift bins as well as joint analysis of the pre-reconstruction power spectrum with the post-reconstruction BAO correlation function signal. We further demonstrate the behavior of the model when opening up the parameter space beyond ΛCDM and also when combining likelihoods with external datasets, namely the Planck CMB priors. Finally, we describe different parametrization options for the galaxy bias, counterterm, and stochastic parameters, and employ the halo model in order to physically motivate suitable priors that are necessary to ensure the stability of the perturbation theory.

79 ASTRONOMY AND ASTROPHYSICS↗

Refueling Infrastructure Scoping and Feasibility Assessment for Hydrogen Rail Applications

The feasibility and component cost of hydrogen rail refueling infrastructure is examined. Example reference stations can inform future studies on components and systems specifically for hydrogen rail refueling facilities. All of the 5 designs considered assumed the bulk storage of liquid hydrogen on-site, from which either gaseous or liquid hydrogen would be dispensed. The first design was estimated to refuel 10 multiple unit trains per day, each train containing 260 kg of gaseous hydrogen at 350 bar on-board. The second base design targeted the refueling of 50 passenger locomotives, each with 400 kg of gaseous hydrogen on-board at 350 bar. Variations from this basic design were made to consider the effect of two different filling times, two different hydrogen compression methods, and two different station design approaches. For each design variation, components were sized, approximate costs were estimated for major components, and physical layouts were created. For both gaseous hydrogen-dispensing base designs, the design of direct-fill using a cryopump design was the lowest cost due to the high cost of the cascade storage system and gas compressor. The last three base designs all assumed that liquid hydrogen was dispensed into tender cars for freight locomotives that required 7,500 kg of liquid hydrogen, and the three different designs assumed that 5, 50, or 200 tender cars were refueled every day. The total component costs are very different for each design, because each design has a very different dispensing capacity. The total component cost for these three designs are driven by the cost of the liquid hydrogen tank; additionally, delivering that much liquid hydrogen to the refueling facility may not be practical. Many of the designs needed the use of multiple evaporators, compressors, and cryopumps operating in parallel to meet required flow rates. In the future, the components identified here can be improved and scaled-up to better fit the needs of heavy-duty refueling facilities. This study provides basic feasibility and first-order design guidance for hydrogen refueling facilities serving emerging rail applications.

08 HYDROGEN↗

Microwave-Assisted Dehydroaromatization of Flare Gas: Reactor Modeling, Plant-Wide Simulation and Economic Feasibility Analysis

Flaring is widely practiced in the oil, gas, and petrochemical sectors to ensure safety during upsets and maintenance but emits large amounts of GHGs, causing energy and economic losses. In the U.S., about one-third of Bakken gas (~250 MMSCFD) and ~100 MMSCFD from Eagle Ford are flared. Recovering this gas is essential for sustainability. Existing recovery methods—compression and reinjection (EOR), conversion to NGL, LNG/CNG, GTL, and GTW—are often limited by flowrate, composition, and variability, especially in unconventional wells. This study develops a microwave-assisted dehydroaromatization (DHA) process to convert flare gas into benzene, toluene, ethylene, and naphthalene. A laboratory reactor model is scaled up into a modular plant-wide system. Techno-economic (TEA) and life-cycle (LCA) analyses evaluate performance and sustainability, with sensitivity studies on plant capacity, electricity cost, and catalyst price confirming strong economic potential.

dehydroaromatization↗