arXiv subjects

Qian Gong

Publications and source records attributed to Qian Gong.

At least 19 recordsLinked to original sources

arXiv2026

Improving Progressive Compression with Adaptive Interpolation and Coefficient Decomposition

Exascale simulations generate data far faster than it can be stored or analyzed, making efficient data reduction essential. Error-controlled lossy compression offers high compression ratios under user-specified error bounds, but the target tolerance must be fixed at compression time. Progressive compression relaxes this restriction, yet existing methods still rely on fixed refactoring strategies and do not fully exploit correlations among decomposed coefficients, limiting the efficiency of progressive retrieval. In this work, we present an adaptive progressive compression framework that improves retrieval efficiency for two common targets, namely error-bound and peak Signal-to-Noise ratios. Our contributions are fourfold. (1) We propose to leverage two complementary interpolation schemes for adaptive progressive compression toward different targets, and we optimize them to achieve high efficiency. (2) We propose coefficient decomposition, a novel method that exploits the commonly overlooked spatial correlations among decorrelated data, which further improves the efficiency. (3) We develop the adaptive progressive compression workflow with automatic selection of the best-fit refactoring pipeline and tailored optimizations. (4) We evaluate the proposed framework on five real-world scientific datasets against three state-of-the-art progressive compressors. Experimental results demonstrate that the proposed framework improves the compression ratio by up to $42.3\%$ under the same requested error tolerance and up to $92.5\%$ at the same PSNR, compared with the best-performing existing methods. When transferring $512$ GB of scientific data to remote sites, the framework delivers up to $1.26\times$ speedup in the end-to-end data transfer performance. Furthermore, our method achieves the highest visualization quality while retrieving the least amount of data from storage.

cs.DC↗

arXiv2026

BlockMGARD: Accelerating Adaptive Scientific Data Reduction with Region-of-Interest Error Control on GPUs

The growing scale of scientific data makes lossy compression essential for reducing data volume under controllable error. Transformation-based compressors using multilevel decomposition, such as MGARD, achieve strong compression ratios but map poorly to GPU architectures. We propose BlockMGARD, an adaptive, Region-of-Interest (ROI)-supported GPU lossy compressor, with four contributions: (1) an In-cache Block decomposition leveraging GPU on-chip memory and constant lookup tables to accelerate decomposition; (2) a hybrid hierarchy combining In-cache Block and global decomposition to balance speed and compression ratio; (3) an end-to-end pipeline with fine-grained ROI error control for feature preservation; and (4) an evaluation against state-of-the-art methods on five real-world datasets. Compared to MGARD-X, BlockMGARD achieves up to 4.2x and 9.1x higher compression and decompression throughput, and up to 8.63x higher compression ratio than uniform-tolerance baselines under ROI-aware error control. Across four GPUs, BlockMGARD achieves near-ideal linear scaling and up to 1.58x I/O cost reduction over MGARD-X.

cs.DC↗

arXiv2026

QoI-Aware Provisional Rollout and Retrospective Reconciliation for Reduced-State Scientific Twins

Scientific twins may need to continue operating when updates from an authoritative primary system are temporarily unavailable. Once synchronization resumes, the new boundary can also be used to revise the intervening history. We distinguish an immediately available causal provisional trajectory from a delayed, future-conditioned reconciled trajectory. For reduced-state twins, we introduce a deterministic, calibration-based reconciliation method. A smooth temporal bridge carries the residual observed at the next synchronization block backward through the provisional interval. An analytic energy-matching stage then applies smooth regional gains and a global rescaling to match a component-energy trajectory estimated by cubic regression in log-energy space from synchronized frames on both sides of the gap. The method uses no additional correction network and revises decoded history without changing the latent state used for later rollouts. We evaluate 64 spatial patches from 16 JHTDB isotropic-turbulence slices for both velocity components and gaps S in {4, 6, 8}. During the longest gap, field error and gradient-sensitive QoI error degrade at markedly different rates, so field error alone does not characterize provisional fidelity. At S = 8, full reconciliation reduces window-averaged NRMSE by about 60% for both components and global gradient-intensity error from 4.21% to 2.91% for vx, whereas future-aware physical interpolation reaches 20.40% on the same metric. Energy matching additionally makes the reconciled history match its boundary-inferred global energy trajectory exactly. Future boundary information therefore substantially improves scientifically relevant properties within the evaluated regime.

cs.CE↗

arXiv2026

Deep Investigation of Neutral Gas Origins (DINGO): Options for the Processing and Storage of Radio Astronomy Data for robust Deep Spectral Line Imaging in the SKA-Era using uv-Grids

The next generation of radio astronomy telescopes are challenging existing data analysis paradigms, as they have an order of magnitude more antennas and larger bandwidth. Foremost amongst these are deep spectral line surveys, because these have the largest number of epochs and spectral channels per dataset. For example, the Deep Investigation of Neutral Gas Origins (DINGO) project on the Australian Square Kilometre Array Pathfinder (ASKAP) aims to observe over 3,200 hours spread over hundreds of observing sessions, covering two tiles, two footprints and two frequency settings. The two primary problems encountered when processing this data are the need for storage and that processing is primarily I/O limited. To address these issues, we have implemented a deep imaging pipeline based on the storage of an intermediate data product in the software ASKAPsoft, that of the uv-gridded data, and have demonstrated lossy and lossless compression of this data on ASKAP, using MGARD and ADIOS2 libraries. We find data compression ratios from a factor of 7 (lossless) up to 20 (using lossy compression with an absolute error bound of $10^{-4}$), and processing is significantly faster for lossless compression. We discuss the effectiveness of lossy MGARD compression and its adherence to the designated error bounds, the trade-off between these error bounds and the corresponding compression ratios, as well as the potential consequences of these I/O and storage improvements on the science quality of the data products. As lossless compression allows us to achieve the DINGO goals within the storage limitations for the project, this will be the option adopted.

astro-ph.IM↗

arXiv2026

NIMROD-to-IMAS workflow for extended-magnetohydrodynamic data with reusable datasets and implications for IMAS schema development

Extended magnetohydrodynamic (MHD) simulations of tokamak plasmas regularly produce outputs in multi-dimensional, multiple-field formats; these code-specific formats make it difficult to do cross-code validation/coupling and analyze at a database scale. In this paper, a workflow that converts NIMROD code inputs and outputs to records compatible with version 4 of the ITER IMAS Data Dictionary is presented. The scope of the workflow includes preprocessing of NIMROD code inputs, conversion of hierarchical NIMROD code HDF5 dumps, COCOS-consistent treatment of the coordinate system and sign convention, and encoding finite-element poloidal meshes and toroidal Fourier components through IMAS General Grid Description. Furthermore, the workflow allows for provenance and integrity metadata to be included while providing optimal I/O operations for large array structures. An example conversion based on an NIMROD code simulation of edge harmonic oscillations performed for the DIII-D discharge 163518 [A.Y. Pankin, et al., Nuclear Fusion 60.9 (2020), p. 092004] is used to validate the conservation of essential equilibrium, profile, perturbation, and grid data in the resulting IMAS records. Finally, this implementation exposes gaps in the current IMAS framework that need to be addressed to accommodate extended MHD data, and it highlights the metadata, provenance, and governance needs of the downstream use cases in the form of dataset validation, integration, and machine learning.

physics.plasm-ph↗

arXiv2025

Optical Design Pathways to Fluidic Space-Assembled Reflectors & Dual-Configuration Spectrographs for Characterizing Exo-Earths

$\textbf{Fluidic Telescopes}$ | We present a conceptual framework for optically designing space-assembled telescopes whose primary mirror is formed $\textit{in situ}$ via the enabling, scale-invariant technology of fluidic shaping. In-space assembly of optical reflectors can solve light-gathering aperture scaling, which currently limits space-borne optical telescopes. Our compass reduces the top-level optical design trade to three types of avenues---a fluidic pathway, a legacy one building upon the James Webb Space Telescope, and hybrid solutions---with a focus on exo-Earths. A primarily fluidic pathway leads, in the first place, to a post-prime-focus architecture. We apply this configuration to propose the tentative optical design for a ~1-m technology demonstrator and pathfinder for fluidic-telescope apertures scaling up to many tens of meters in diameter. $\textbf{Dual-Configuration Spectrographs}$ | The Habitable Worlds Observatory (HWO) will be the first mission equipped for the high-contrast direct imaging and remote spectral characterization, in reflected starlight, of exo-Earths in our galactic neighborhood. We present a novel concept for a compact, dual-configuration HWO spectrograph tailored for a broad wavelength range covering at least 600--1000 nm. Our design can interchange dispersive elements via a slider mechanism while preserving the rest of the optical path, enabling both a spectral resolving power $R$~140 integral-field spectrograph and a single- or multi-object spectrograph with $R$ on the order of 10$^3$. Although $R$~140 is near-optimal for the $O_2$ absorption $A$-band around 760 nm, higher values of $R$ can be utilized with spectral cross-correlation matched-filter techniques to enhance, e.g., HWO's atmospheric characterization capabilities.

astro-ph.IM↗

arXiv2025

Exploring the Capabilities of the Frontier Large Language Models for Nuclear Energy Research

The AI for Nuclear Energy workshop at Oak Ridge National Laboratory evaluated the potential of Large Language Models (LLMs) to accelerate fusion and fission research. Fourteen interdisciplinary teams explored diverse nuclear science challenges using ChatGPT, Gemini, Claude, and other AI models over a single day. Applications ranged from developing foundation models for fusion reactor control to automating Monte Carlo simulations, predicting material degradation, and designing experimental programs for advanced reactors. Teams employed structured workflows combining prompt engineering, deep research capabilities, and iterative refinement to generate hypotheses, prototype code, and research strategies. Key findings demonstrate that LLMs excel at early-stage exploration, literature synthesis, and workflow design, successfully identifying research gaps and generating plausible experimental frameworks. However, significant limitations emerged, including difficulties with novel materials designs, advanced code generation for modeling and simulation, and domain-specific details requiring expert validation. The successful outcomes resulted from expert-driven prompt engineering and treating AI as a complementary tool rather than a replacement for physics-based methods. The workshop validated AI's potential to accelerate nuclear energy research through rapid iteration and cross-disciplinary synthesis while highlighting the need for curated nuclear-specific datasets, workflow automation, and specialized model development. These results provide a roadmap for integrating AI tools into nuclear science workflows, potentially reducing development cycles for safer, more efficient nuclear energy systems while maintaining rigorous scientific standards.

physics.comp-ph↗

arXiv2025

HP-MDR: High-performance and Portable Data Refactoring and Progressive Retrieval with Advanced GPUs

Scientific applications produce vast amounts of data, posing grand challenges in the underlying data management and analytic tasks. Progressive compression is a promising way to address this problem, as it allows for on-demand data retrieval with significantly reduced data movement cost. However, most existing progressive methods are designed for CPUs, leaving a gap for them to unleash the power of today's heterogeneous computing systems with GPUs. In this work, we propose HP-MDR, a high-performance and portable data refactoring and progressive retrieval framework for GPUs. Our contributions are three-fold: (1) We carefully optimize the bitplane encoding and lossless encoding, two key stages in progressive methods, to achieve high performance on GPUs; (2) We propose pipeline optimization and incorporate it with data refactoring and progressive retrieval workflows to further enhance the performance for large data process; (3) We leverage our framework to enable high-performance data retrieval with guaranteed error control for common Quantities of Interest; (4) We evaluate HP-MDR and compare it with state of the arts using five real-world datasets. Experimental results demonstrate that HP-MDR delivers up to 6.6x throughput in data refactoring and progressive retrieval tasks. It also leads to 10.4x throughput for recomposing required data representations under Quantity-of-Interest error control and 4.2x performance for the corresponding end-to-end data retrieval, when compared with state-of-the-art solutions.

cs.DC↗

arXiv2025

Optimising the Processing and Storage of Visibilities using lossy compression

The next-generation radio astronomy instruments are providing a massive increase in sensitivity and coverage, through increased stations in the array and frequency span. Two primary problems encountered when processing the resultant avalanche of data are the need for abundant storage and I/O. An example of this is the data deluge expected from the SKA Telescopes of more than 60PB per day, all to be stored on the buffer filesystem. Compressing the data is an obvious solution. We used MGARD, an error-controlled compressor, and applied it to simulated and real visibility data, in noise-free and noise-dominated regimes. As the data has an implicit error level in the system temperature, using an error bound in compression provides a natural metric for compression. Measuring the degradation of images reconstructed using the lossy compressed data, we explore the trade-off between these error bounds and the corresponding compression ratios, as well as the impact on science quality derived from the lossy compressed data products through a series of experiments. We studied the global and local impacts on the output images. We found relative error bounds of as much as $10\%$, which provide compression ratios of about 20, have a limited impact on the continuum imaging as the increased noise is less than the image RMS. For extremely sensitive observations and for very precious data, we would recommend a $0.1\%$ error bound with compression ratios of about 4. These have noise impacts two orders of magnitude less than the image RMS levels. At these levels, the limits are due to instabilities in the deconvolution methods. We compared the results to the alternative compression tool DYSCO, in both the impacts on the images and in the relative flexibility. MGARD provides better compression for similar error bounds, and has a host of potentially powerful additional features.

astro-ph.IM↗

arXiv2025

HPDR: High-Performance Portable Scientific Data Reduction Framework

The rapid growth of scientific data is surpassing advancements in computing, creating challenges in storage, transfer, and analysis, particularly at the exascale. While data reduction techniques such as lossless and lossy compression help mitigate these issues, their computational overhead introduces new bottlenecks. GPU-accelerated approaches improve performance but face challenges in portability, memory transfer, and scalability on multi-GPU systems. To address these, we propose HPDR, a high-performance, portable data reduction framework. HPDR supports diverse processor architectures, reducing memory transfer overhead to 2.3% and achieving up to 3.5x faster throughput than existing solutions. It attains 96% of the theoretical speedup in multi-GPU settings. Evaluations on the Frontier supercomputer demonstrate 103 TB/s throughput and up to 4x acceleration in parallel I/O performance at scale. HPDR offers a scalable, efficient solution for managing massive data volumes in exascale computing environments.

cs.DC↗

arXiv2025

Mid-infrared laser chaos lidar

Chaos lidars detect targets through the cross-correlation between the back-scattered chaos signal from the target and the local reference one. Chaos lidars have excellent anti-jamming and anti-interference capabilities, owing to the random nature of chaotic oscillations. However, most chaos lidars operate in the near-infrared spectral regime, where the atmospheric attenuation is significant. Here we show a mid-infrared chaos lidar, which is suitable for long-reach ranging and imaging applications within the low-loss transmission window of the atmosphere. The proof-of-concept mid-infrared chaos lidar utilizes an interband cascade laser with optical feedback as the laser chaos source. Experimental results reveal that the chaos lidar achieves an accuracy better than 0.9 cm and a precision better than 0.3 cm for ranging distances up to 300 cm. In addition, it is found that a minimum signal-to-noise ratio of only 1 dB is required to sustain both sub-cm accuracy and sub-cm precision. This work paves the way for developing remote chaos lidar systems in the mid-infrared spectral regime.

physics.optics↗

arXiv2025

NASA Innovative Advanced Concepts Phase I Final Report -- A Lunar Long-Baseline UV/Optical Imaging Interferometer: Artemis-enabled Stellar Imager (AeSI)

This report presents the findings of a NIAC Phase I feasibility study for the Artemis-enabled Stellar Imager (AeSI), a proposed high-resolution, UV/Optical interferometer designed for deployment on the lunar surface. Its primary science goal is to image the surfaces and interiors of stars with unprecedented detail, revealing new details about their magnetic processes and dynamic evolution and enabling the creation of a truly predictive solar/stellar dynamo model. This capability will transform our understanding of stellar physics and has broad applicability across astrophysics, from resolving the cores of Active Galactic Nuclei (AGN) to studying supernovae, planetary nebulae, and the late stages of stellar evolution. By leveraging the stable vacuum environment of the Moon and the infrastructure being established for the Artemis Program, AeSI presents a compelling case for a lunar-based interferometer. In this study, the AeSI Team, working with the NASA Goddard Space Flight Center's Integrated Design Center (IDC), has firmly established the feasibility of building and operating a reconfigurable, dispersed aperture telescope (i.e., an interferometer) on the lunar surface. The collaboration produced a credible Baseline design featuring 15 primary mirrors arranged in an elliptical array with a 1 km major axis, with the potential to expand to 30 mirrors and larger array sizes through staged deployments. Additionally, this study identified numerous opportunities for optimization and the necessary trade studies to refine the design further. These will be pursued in follow-up investigations, such as a NIAC Phase II study, to advance the concept toward implementation.

astro-ph.IM↗

arXiv2025

A General Framework for Error-controlled Unstructured Scientific Data Compression

Data compression plays a key role in reducing storage and I/O costs. Traditional lossy methods primarily target data on rectilinear grids and cannot leverage the spatial coherence in unstructured mesh data, leading to suboptimal compression ratios. We present a multi-component, error-bounded compression framework designed to enhance the compression of floating-point unstructured mesh data, which is common in scientific applications. Our approach involves interpolating mesh data onto a rectilinear grid and then separately compressing the grid interpolation and the interpolation residuals. This method is general, independent of mesh types and typologies, and can be seamlessly integrated with existing lossy compressors for improved performance. We evaluated our framework across twelve variables from two synthetic datasets and two real-world simulation datasets. The results indicate that the multi-component framework consistently outperforms state-of-the-art lossy compressors on unstructured data, achieving, on average, a $2.3-3.5\times$ improvement in compression ratios, with error bounds ranging from $\num{1e-6}$ to $\num{1e-2}$. We further investigate the impact of hyperparameters, such as grid spacing and error allocation, to deliver optimal compression ratios in diverse datasets.

cs.IT↗

arXiv2024

Lifting MGARD: construction of (pre)wavelets on the interval using polynomial predictors of arbitrary order

MGARD (MultiGrid Adaptive Reduction of Data) is an algorithm for compressing and refactoring scientific data, based on the theory of multigrid methods. The core algorithm is built around stable multilevel decompositions of conforming piecewise linear $C^0$ finite element spaces, enabling accurate error control in various norms and derived quantities of interest. In this work, we extend this construction to arbitrary order Lagrange finite elements $\mathbb{Q}_p$, $p \geq 0$, and propose a reformulation of the algorithm as a lifting scheme with polynomial predictors of arbitrary order. Additionally, a new formulation using a compactly supported wavelet basis is discussed, and an explicit construction of the proposed wavelet transform for uniform dyadic grids is described.

math.NA↗

arXiv2024

Error-controlled Progressive Retrieval of Scientific Data under Derivable Quantities of Interest

The unprecedented amount of scientific data has introduced heavy pressure on the current data storage and transmission systems. Progressive compression has been proposed to mitigate this problem, which offers data access with on-demand precision. However, existing approaches only consider precision control on primary data, leaving uncertainties on the quantities of interest (QoIs) derived from it. In this work, we present a progressive data retrieval framework with guaranteed error control on derivable QoIs. Our contributions are three-fold. (1) We carefully derive the theories to strictly control QoI errors during progressive retrieval. Our theory is generic and can be applied to any QoIs that can be composited by the basis of derivable QoIs proved in the paper. (2) We design and develop a generic progressive retrieval framework based on the proposed theories, and optimize it by exploring feasible progressive representations. (3) We evaluate our framework using five real-world datasets with a diverse set of QoIs. Experiments demonstrate that our framework can faithfully respect any user-specified QoI error bounds in the evaluated applications. This leads to over 2.02x performance gain in data transfer tasks compared to transferring the primary data while guaranteeing a QoI error that is less than 1E-5.

cs.DC↗

arXiv2024

A framework for compressing unstructured scientific data via serialization

We present a general framework for compressing unstructured scientific data with known local connectivity. A common application is simulation data defined on arbitrary finite element meshes. The framework employs a greedy topology preserving reordering of original nodes which allows for seamless integration into existing data processing pipelines. This reordering process depends solely on mesh connectivity and can be performed offline for optimal efficiency. However, the algorithm's greedy nature also supports on-the-fly implementation. The proposed method is compatible with any compression algorithm that leverages spatial correlations within the data. The effectiveness of this approach is demonstrated on a large-scale real dataset using several compression methods, including MGARD, SZ, and ZFP.

cs.CV↗

arXiv2024

Utilizing Photometry from Multiple Sources to Mitigate Stellar Variability in Precise Radial Velocities: A Case Study of Kepler-21

We present a new analysis of Kepler-21, the brightest (V = 8.5) Kepler system with a known transiting exoplanet, Kepler-21 b. Kepler-21 b is a radius valley planet ($R = 1.6\pm 0.2 R_{\oplus}$) with an Earth-like composition (8.38$\pm$1.62 g/cc), though its mass and radius fall in the regime of possible "water worlds." We utilize new Keck/HIRES and WIYN/NEID radial velocity (RV) data in conjunction with Kepler and TESS photometry to perform a detailed study of activity mitigation between photometry and RVs. We additionally refine the system parameters, and we utilize Gaia astrometry to place constraints on a long-term RV trend. Our activity analysis affirms the quality of Kepler photometry for removing correlated noise from RVs, despite its temporal distance, though we reveal some cases where TESS may be superior. Using refined orbital parameters and updated composition curves, we rule out a ``water world" scenario for Kepler-21 b, and we identify a long period super-Jupiter planetary candidate, Kepler-21 (c).

astro-ph.EP↗

arXiv2024

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. In this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

cs.GR↗