arXiv subjects

Chen Wang

Publications and source records attributed to Chen Wang.

At least 343 records · Page 19Linked to original sources

arXiv2025

Searching radio signals from two magnetars and a high-magnetic field pulsar and the serendipitous discovery of a new radio pulsar PSR J1935+2200

Magnetars are slowly rotating, highly magnetized young neutron stars that can show transient radio phenomena for radio pulses and fast radio bursts. We conducted radio observations of from two magnetars SGR$~$J1935+2154 and 3XMM$~$J185246.6+003317 and a high-magnetic field pulsar PSR$~$J1846$-$0258 using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). We performed single pulse and periodicity searches and did not detect radio signals from them. From the piggyback data recorded by other FAST telescope beams when we observed the magnetar SGR$~$1935+2154, we serendipitously discovered a new radio pulsar, PSR$~$J1935+2200. We carried out the follow-up observations and obtained the timing solution based on these new observations and the archive FAST data. PSR$~$J1935+2200 is an isolated old pulsar, with a spin period of $0.91$s, a spin-period derivative of $9.19 \times 10^{-15}$~s~s$^{-1}$, and a characteristic age of $1.57$ Myr. It is a weak pulsar with a flux density of 9.8 $μ$Jy at 1.25 GHz. Discovery of a new pulsar from the long FAST observations of 30 minutes implies that there may be more weak older pulsars in the Galactic disk to be discovered.

astro-ph.HE↗

arXiv2025

From Data to Action: Charting A Data-Driven Path to Combat Antimicrobial Resistance

Antimicrobial-resistant (AMR) microbes are a growing challenge in healthcare, rendering modern medicines ineffective. AMR arises from antibiotic production and bacterial evolution, but quantifying its transmission remains difficult. With increasing AMR-related data, data-driven methods offer promising insights into its causes and treatments. This paper reviews AMR research from a data analytics and machine learning perspective, summarizing the state-of-the-art and exploring key areas such as surveillance, prediction, drug discovery, stewardship, and driver analysis. It discusses data sources, methods, and challenges, emphasizing standardization and interoperability. Additionally, it surveys statistical and machine learning techniques for AMR analysis, addressing issues like data noise and bias. Strategies for denoising and debiasing are highlighted to enhance fairness and robustness in AMR research. The paper underscores the importance of interdisciplinary collaboration and awareness of data challenges in advancing AMR research, pointing to future directions for innovation and improved methodologies.

cs.LG↗

arXiv2025

Graph-Sequential Alignment and Uniformity: Toward Enhanced Recommendation Systems

Graph-based and sequential methods are two popular recommendation paradigms, each excelling in its domain but lacking the ability to leverage signals from the other. To address this, we propose a novel method that integrates both approaches for enhanced performance. Our framework uses Graph Neural Network (GNN)-based and sequential recommenders as separate submodules while sharing a unified embedding space optimized jointly. To enable positive knowledge transfer, we design a loss function that enforces alignment and uniformity both within and across submodules. Experiments on three real-world datasets demonstrate that the proposed method significantly outperforms using either approach alone and achieves state-of-the-art results. Our implementations are publicly available at https://github.com/YuweiCao-UIC/GSAU.git.

cs.IR↗

arXiv2025

iMatching: Imperative Correspondence Learning

Learning feature correspondence is a foundational task in computer vision, holding immense importance for downstream applications such as visual odometry and 3D reconstruction. Despite recent progress in data-driven models, feature correspondence learning is still limited by the lack of accurate per-pixel correspondence labels. To overcome this difficulty, we introduce a new self-supervised scheme, imperative learning (IL), for training feature correspondence. It enables correspondence learning on arbitrary uninterrupted videos without any camera pose or depth labels, heralding a new era for self-supervised correspondence learning. Specifically, we formulated the problem of correspondence learning as a bilevel optimization, which takes the reprojection error from bundle adjustment as a supervisory signal for the model. To avoid large memory and computation overhead, we leverage the stationary point to effectively back-propagate the implicit gradients through bundle adjustment. Through extensive experiments, we demonstrate superior performance on tasks including feature matching and pose estimation, in which we obtained an average of 30% accuracy gain over the state-of-the-art matching models.

cs.CV↗

arXiv2025

Study on the Distribution Amplitude of the Scalar Meson $K_0^*(1430)$

Based on sum rules, we explore the twist-2 distribution amplitude of the $K_0^*(1430)$ meson, treating it as the ground state of a quark-antiquark system. We posit that the spacetime distance $x$ should be infinitesimally close to the quark separation $ z$. By incorporating quark distance corrections, with $x^2 \approx z^2 \approx x z$, the calculated moments yield additional insights. Moreover, we employ light-cone sum rules to compute the form factors for the semi-leptonic decay process $B_s \rightarrow K$. The reliability of the computed distribution amplitude is confirmed through its comparison with the form factor.

hep-ph↗

arXiv2025

Blue straggler stars

Blue straggler stars are unique main-sequence stars that appear more luminous, hotter, and therefore younger, than their coeval counterparts. In star clusters, these stars are located above the cluster turn-off in the Hertzsprung-Russell diagram or color-magnitude diagram. First identified in the 1950s, these stars are found across diverse environments, from sparse galactic fields to dense star clusters. They are crucial for understanding stellar and binary evolution and star cluster dynamics. Despite extensive research, many challenges concerning their properties and origin mechanisms remain unresolved. This chapter delves into the properties and origins of blue stragglers, examining how theoretical tools are employed to study them and the implications of each proposed formation mechanism. We assess how contemporary observational data either support or challenge these theoretical predictions. Continued theoretical and observational efforts are essential for advancing our understanding of these enigmatic stars.

astro-ph.SR↗

arXiv2025

Kilometer-Scale E3SM Land Model Simulation over North America

The development of a kilometer-scale E3SM Land Model (km-scale ELM) is an integral part of the E3SM project, which seeks to advance energy-related Earth system science research with state-of-the-art modeling and simulation capabilities on exascale computing systems. Through the utilization of high-fidelity data products, such as atmospheric forcing and soil properties, the km-scale ELM plays a critical role in accurately modeling geographical characteristics and extreme weather occurrences. The model is vital for enhancing our comprehension and prediction of climate patterns, as well as their effects on ecosystems and human activities. This study showcases the first set of full-capability, km-scale ELM simulations over various computational domains, including simulations encompassing 21.6 million land gridcells, reflecting approximately 21.5 million square kilometers of North America at a 1 km x 1 km resolution. We present the largest km-scale ELM simulation using up to 100,800 CPU cores across 2,400 nodes. This continental-scale simulation is 300 times larger than any previous studies, and the computational resources used are about 400 times larger than those used in prior efforts. Both strong and weak scaling tests have been conducted, revealing exceptional performance efficiency and resource utilization. The km-scale ELM uses the common E3SM modeling infrastructure and a general data toolkit known as KiloCraft. Consequently, it can be readily adapted for both fully-coupled E3SM simulations and data-driven simulations over specific areas, ranging from a single gridcell to the entire North America.

cs.CE↗

arXiv2025

Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions

Composite DNA is a recent novel method to increase the information capacity of DNA-based data storage above the theoretical limit of 2 bits/symbol. In this method, every composite symbol does not store a single DNA nucleotide but a mixture of the four nucleotides in a predetermined ratio. By using different mixtures and ratios, the alphabet can be extended to have much more than four symbols in the naive approach. While this method enables higher data content per synthesis cycle, potentially reducing the DNA synthesis cost, it also imposes significant challenges for accurate DNA sequencing since the base-level errors can easily change the mixture of bases and their ratio, resulting in changes to the composite symbols. With this motivation, we propose efficient constrained coding techniques to enforce the biological constraints, including the runlength-limited constraint and the GC-content constraint, into every DNA synthesized oligo, regardless of the mixture of bases in each composite letter and their corresponding ratio. Our goals include computing the capacity of the constrained channel, constructing efficient encoders/decoders, and providing the best options for the composite letters to obtain capacity-approaching codes. For certain codes' parameters, our methods incur only one redundant symbol.

cs.IT↗

arXiv2025

Refinements of Van Hamme's (E.2) and (F.2) supercongruences and two supercongruences by Swisher

In 1997, Van Hamme proposed 13 supercongruences on truncated hypergeometric series. Van Hamme's (B.2) supercongruence was first confirmed by Mortenson and received a WZ proof by Zudilin later. In 2012, using the WZ method again, Sun extended Van Hamme's (B.2) supercongruence to the modulus $p^4$ case, where $p$ is an odd prime. In this paper, by using a more general WZ pair, we generalize Hamme's (E.2) and (F.2) supercongruences, as well as two supercongruences by Swisher, to the modulus $p^4$ case. Our generalizations of these supercongruences are related to Euler polynomials. We also put forward a relevant conjecture on $q$-congruences for further study.

math.NT↗

arXiv2025

Balance Divergence for Knowledge Distillation

Knowledge distillation has been widely adopted in computer vision task processing, since it can effectively enhance the performance of lightweight student networks by leveraging the knowledge transferred from cumbersome teacher networks. Most existing knowledge distillation methods utilize Kullback-Leibler divergence to mimic the logit output probabilities between the teacher network and the student network. Nonetheless, these methods may neglect the negative parts of the teacher's ''dark knowledge'' because the divergence calculations may ignore the effect of the minute probabilities from the teacher's logit output. This deficiency may lead to suboptimal performance in logit mimicry during the distillation process and result in an imbalance of information acquired by the student network. In this paper, we investigate the impact of this imbalance and propose a novel method, named Balance Divergence Distillation. By introducing a compensatory operation using reverse Kullback-Leibler divergence, our method can improve the modeling of the extremely small values in the negative from the teacher and preserve the learning capacity for the positive. Furthermore, we test the impact of different temperature coefficients adjustments, which may conducted to further balance for knowledge transferring. We evaluate the proposed method on several computer vision tasks, including image classification and semantic segmentation. The evaluation results show that our method achieves an accuracy improvement of 1%~3% for lightweight students on both CIFAR-100 and ImageNet dataset, and a 4.55% improvement in mIoU for PSP-ResNet18 on the Cityscapes dataset. The experiments show that our method is a simple yet highly effective solution that can be smoothly applied to different knowledge distillation methods.

cs.CV↗

arXiv2025

LPRnet: A self-supervised registration network for LiDAR and photogrammetric point clouds

LiDAR and photogrammetry are active and passive remote sensing techniques for point cloud acquisition, respectively, offering complementary advantages and heterogeneous. Due to the fundamental differences in sensing mechanisms, spatial distributions and coordinate systems, their point clouds exhibit significant discrepancies in density, precision, noise, and overlap. Coupled with the lack of ground truth for large-scale scenes, integrating the heterogeneous point clouds is a highly challenging task. This paper proposes a self-supervised registration network based on a masked autoencoder, focusing on heterogeneous LiDAR and photogrammetric point clouds. At its core, the method introduces a multi-scale masked training strategy to extract robust features from heterogeneous point clouds under self-supervision. To further enhance registration performance, a rotation-translation embedding module is designed to effectively capture the key features essential for accurate rigid transformations. Building upon the robust representations, a transformer-based architecture seamlessly integrates local and global features, fostering precise alignment across diverse point cloud datasets. The proposed method demonstrates strong feature extraction capabilities for both LiDAR and photogrammetric point clouds, addressing the challenges of acquiring ground truth at the scene level. Experiments conducted on two real-world datasets validate the effectiveness of the proposed method in solving heterogeneous point cloud registration problems.

cs.CV↗

arXiv2025

Zero-1-to-G: Taming Pretrained 2D Diffusion Model for Direct 3D Generation

Recent advances in 2D image generation have achieved remarkable quality,largely driven by the capacity of diffusion models and the availability of large-scale datasets. However, direct 3D generation is still constrained by the scarcity and lower fidelity of 3D datasets. In this paper, we introduce Zero-1-to-G, a novel approach that addresses this problem by enabling direct single-view generation on Gaussian splats using pretrained 2D diffusion models. Our key insight is that Gaussian splats, a 3D representation, can be decomposed into multi-view images encoding different attributes. This reframes the challenging task of direct 3D generation within a 2D diffusion framework, allowing us to leverage the rich priors of pretrained 2D diffusion models. To incorporate 3D awareness, we introduce cross-view and cross-attribute attention layers, which capture complex correlations and enforce 3D consistency across generated splats. This makes Zero-1-to-G the first direct image-to-3D generative model to effectively utilize pretrained 2D diffusion priors, enabling efficient training and improved generalization to unseen objects. Extensive experiments on both synthetic and in-the-wild datasets demonstrate superior performance in 3D object generation, offering a new approach to high-quality 3D generation.

cs.CV↗

arXiv2025

Recorder: Comprehensive Parallel I/O Tracing and Analysis

This paper presents Recorder, a parallel I/O tracing tool designed to capture comprehensive I/O information on HPC applications. Recorder traces I/O calls across various I/O layers, storing all function parameters for each captured call. The volume of stored information scales linearly the application's execution scale. To address this, we present a sophisticated pattern-recognition-based compression algorithm. This algorithm identifies and compresses recurring I/O patterns both within individual processes and across multiple processes, significantly reducing space and time overheads. We evaluate the proposed compression algorithm using I/O benchmarks and real-world applications, demonstrating that Recorder can store more information while requiring approximately 12x less storage space compared to its predecessor. Notably, for applications with typical parallel I/O patterns, Recorder achieves a constant trace size regardless of execution scale. Additionally, a comparison with the profiling tool Darshan shows that Recorder captures detailed I/O information without incurring substantial overhead. The richer data collected by Recorder enables new insights and facilitates more in-depth I/O studies, offering valuable contributions to the I/O research community.

cs.DC↗

arXiv2024

Parallel I/O Characterization and Optimization on Large-Scale HPC Systems: A 360-Degree Survey

Driven by artificial intelligence, data science, and high-resolution simulations, I/O workloads and hardware on high-performance computing (HPC) systems have become increasingly complex. This complexity can lead to large I/O overheads and overall performance degradation. These inefficiencies are often mitigated using tools and techniques for characterizing, analyzing, and optimizing the I/O behavior of HPC applications. That said, the myriad number of tools and techniques available makes it challenging to navigate to the best approach. In response, this paper surveys 131 papers from the ACM Digital Library, IEEE Xplore, and other reputable journals to provide a comprehensive analysis, synthesized in the form of a taxonomy, of the current landscape of parallel I/O characterization, analysis, and optimization of large-scale HPC systems. We anticipate that this taxonomy will serve as a valuable resource for enhancing I/O performance of HPC applications.

cs.DC↗

arXiv2024

Zero-Indexing Internet Search Augmented Generation for Large Language Models

Retrieval augmented generation has emerged as an effective method to enhance large language model performance. This approach typically relies on an internal retrieval module that uses various indexing mechanisms to manage a static pre-processed corpus. However, such a paradigm often falls short when it is necessary to integrate the most up-to-date information that has not been updated into the corpus during generative inference time. In this paper, we explore an alternative approach that leverages standard search engine APIs to dynamically integrate the latest online information (without maintaining any index for any fixed corpus), thereby improving the quality of generated content. We design a collaborative LLM-based paradigm, where we include: (i) a parser-LLM that determines if the Internet augmented generation is demanded and extracts the search keywords if so with a single inference; (ii) a mixed ranking strategy that re-ranks the retrieved HTML files to eliminate bias introduced from the search engine API; and (iii) an extractor-LLM that can accurately and efficiently extract relevant information from the fresh content in each HTML file. We conduct extensive empirical studies to evaluate the performance of this Internet search augmented generation paradigm. The experimental results demonstrate that our method generates content with significantly improved quality. Our system has been successfully deployed in a production environment to serve 01.AI's generative inference requests.

cs.IR↗

arXiv2024

Transport resistance dominates the fill factor losses in record organic solar cells

Organic photovoltaics are a promising solar cell technology well-suited to mass production using roll-to-roll processes. The efficiency of lab-scale solar cells has exceeded 20% and considerable attention is currently being given to understanding and minimising the remaining loss mechanisms preventing higher efficiencies. While recent efficiency improvements are partly owed to reducing non-radiative recombination losses at open-circuit, the low fill factor due to a significant transport resistance is becoming the Achilles heel of organic photovoltaics. The term transport resistance refers to a voltage and light intensity dependent charge collection loss in low-mobility materials. In this Perspective, we demonstrate that even the highest efficiency organic solar cells reported to-date have significant performance losses that can be attributed to transport resistance and that lead to high fill factor losses. We provide a closer look at the transport resistance and the material properties influencing it. We describe how to experimentally characterise and quantify the transport resistance by providing easy to follow instructions. Furthermore, the causes and theory behind transport resistance are detailed. In particular, we integrate the relevant figures of merit and different viewpoints on the transport resistance. Finally, we outline strategies that can be followed to minimise these charge collection losses in future solar cells.

cond-mat.mtrl-sci↗

arXiv2024

Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor

In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62% and 99.18%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately $6.4\times 10^9$ years to replicate the task. This leap in processing power places the classical simulation cost six orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Nature 634, 328(2024)], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.

quant-ph↗

arXiv2024

Deep Learning-Enhanced Preconditioning for Efficient Conjugate Gradient Solvers in Large-Scale PDE Systems

Preconditioning techniques are crucial for enhancing the efficiency of solving large-scale linear equation systems that arise from partial differential equation (PDE) discretization. These techniques, such as Incomplete Cholesky factorization (IC) and data-driven neural network methods, accelerate the convergence of iterative solvers like Conjugate Gradient (CG) by approximating the original matrices. This paper introduces a novel approach that integrates Graph Neural Network (GNN) with traditional IC, addressing the shortcomings of direct generation methods based on GNN and achieving significant improvements in computational efficiency and scalability. Experimental results demonstrate an average reduction in iteration counts by 24.8% compared to IC and a two-order-of-magnitude increase in training scale compared to previous methods. A three-dimensional static structural analysis utilizing finite element methods was validated on training sparse matrices of up to 5 million dimensions and inference scales of up to 10 million. Furthermore, the approach demon-strates robust generalization capabilities across scales, facilitating the effective acceleration of CG solvers for large-scale linear equations using small-scale data on modest hardware. The method's robustness and scalability make it a practical solution for computational science.

cs.LG↗