arXiv subjects

Rui Li

Publications and source records attributed to Rui Li.

At least 289 records · Page 16Linked to original sources

arXiv2024

The Giant Radio Array for Neutrino Detection (GRAND) Collaboration -- Contributions to the 10th International Workshop on Acoustic and Radio EeV Neutrino Detection Activities (ARENA 2024)

This is an index of the contributions by the Giant Radio Array for Neutrino Detection (GRAND) Collaboration to the 10th International Workshop on Acoustic and Radio EeV Neutrino Detection Activities (ARENA 2024, University of Chicago, June 11-14, 2024). The contributions include an overview of GRAND in its present and future incarnations, methods of radio-detection that are being developed for them, and ongoing joint work between the GRAND and BEACON experiments.

astro-ph.IM↗

arXiv2024

Velocity-Resolved Ionization Mapping of Broad Line Region. I. Insights into Diverse Geometry and Kinematics

Broad emission lines of active galactic nuclei (AGNs) originate from the broad-line region (BLR), consisting of dense gas clouds in orbit around an accreting supermassive black hole. Understanding the geometry and kinematics of the region is crucial for gaining insights into the physics and evolution of AGNs. Conventional velocity-resolved reverberation mapping may face challenges in disentangling the degeneracy between intricate motion and geometry of this region. To address this challenge, new key constraints are required. Here, we report the discovery of an asymmetric BLR using a novel technique: velocity-resolved ionization mapping, which can map the distance of emitting gas clouds by measuring Hydrogen line ratios at different velocities. By analyzing spectroscopic monitoring data, we find that the Balmer decrement is anticorrelated with the continuum and correlated with the lags across broad emission line velocities. Some line ratio profiles deviate from the expectations for a symmetrically virialized BLR, suggesting that the red-shifted and blue-shifted gas clouds may not be equidistant from the supermassive black hole (SMBH). This asymmetric geometry might represent a formation imprint, provide new perspectives on the evolution of AGNs, and influence SMBH mass measurements.

astro-ph.GA↗

arXiv2024

High-dimentional Multipartite Entanglement Structure Detection with Low Cost

Quantum entanglement detection and characterization are crucial for various quantum information processes. Most existing methods for entanglement detection rely heavily on a complete description of the quantum state, which requires numerous measurements and complex setups. This makes these theoretically sound approaches costly and impractical, as the system size increases. In this work, we propose a multi-view neural network model to generate representations suitable for entanglement structure detection. The number of required quantum measurements is polynomial rather than exponential increase with the qubit number. This remarkable reduction in resource costs makes it possible to detect specific entanglement structures in large-scale systems. Numerical simulations show that our method achieves over 95% detection accuracy for up to 19 qubits systems. By enabling a universal, flexible and resource-efficient analysis of entanglement structures, our approach enhances the capability of utilizing quantum states across a wide range of applications.

quant-ph↗

arXiv2024

RePair: Automated Program Repair with Process-based Feedback

The gap between the trepidation of program reliability and the expense of repairs underscores the indispensability of Automated Program Repair (APR). APR is instrumental in transforming vulnerable programs into more robust ones, bolstering program reliability while simultaneously diminishing the financial burden of manual repairs. Commercial-scale language models (LM) have taken APR to unprecedented levels. However, the emergence reveals that for models fewer than 100B parameters, making single-step modifications may be difficult to achieve the desired effect. Moreover, humans interact with the LM through explicit prompts, which hinders the LM from receiving feedback from compiler and test cases to automatically optimize its repair policies. In this literature, we explore how small-scale LM (less than 20B) achieve excellent performance through process supervision and feedback. We start by constructing a dataset named CodeNet4Repair, replete with multiple repair records, which supervises the fine-tuning of a foundational model. Building upon the encouraging outcomes of reinforcement learning, we develop a reward model that serves as a critic, providing feedback for the fine-tuned LM's action, progressively optimizing its policy. During inference, we require the LM to generate solutions iteratively until the repair effect no longer improves or hits the maximum step limit. The results show that process-based not only outperforms larger outcome-based generation methods, but also nearly matches the performance of closed-source commercial large-scale LMs.

cs.SE↗

arXiv2024

Scalable DAQ system operating the CHIPS-5 neutrino detector

The CHIPS R&D project focuses on development of low-cost water Cherenkov neutrino detectors through novel design strategies and resourceful engineering. This work presents an end-to-end DAQ solution intended for a recent 5 kt CHIPS prototype, which is largely based on affordable mass-produced components. Much like the detector itself, the presented instrumentation is composed of modular arrays that can be scaled up and easily serviced. A single such array can carry up to 30 photomultiplier tubes (PMTs) accompanied by electronics that generate high voltage in-situ and deliver time resolution of up to 0.69 ns. In addition, the technology is compatible with the White Rabbit timing system, which can synchronize its elements to within 100 ps. While deployment issues did not permit the presented DAQ system to operate beyond initial evaluation, the presented hardware and software successfully passed numerous commissioning tests that demonstrated their viability for use in a large-scale neutrino detector, instrumented with thousands of PMTs.

physics.ins-det↗

arXiv2024

Large Language Models Struggle in Token-Level Clinical Named Entity Recognition

Large Language Models (LLMs) have revolutionized various sectors, including healthcare where they are employed in diverse applications. Their utility is particularly significant in the context of rare diseases, where data scarcity, complexity, and specificity pose considerable challenges. In the clinical domain, Named Entity Recognition (NER) stands out as an essential task and it plays a crucial role in extracting relevant information from clinical texts. Despite the promise of LLMs, current research mostly concentrates on document-level NER, identifying entities in a more general context across entire documents, without extracting their precise location. Additionally, efforts have been directed towards adapting ChatGPT for token-level NER. However, there is a significant research gap when it comes to employing token-level NER for clinical texts, especially with the use of local open-source LLMs. This study aims to bridge this gap by investigating the effectiveness of both proprietary and local LLMs in token-level clinical NER. Essentially, we delve into the capabilities of these models through a series of experiments involving zero-shot prompting, few-shot prompting, retrieval-augmented generation (RAG), and instruction-fine-tuning. Our exploration reveals the inherent challenges LLMs face in token-level NER, particularly in the context of rare diseases, and suggests possible improvements for their application in healthcare. This research contributes to narrowing a significant gap in healthcare informatics and offers insights that could lead to a more refined application of LLMs in the healthcare sector.

cs.CL↗

arXiv2024

Multi-band analysis of strong gravitationally lensed post-blue nugget candidates from the Kilo-Degree Survey

During the early stages of galaxy evolution, a significant fraction of galaxies undergo a transitional phase between the ``blue nugget" systems, which arise from the compaction of large, active star-forming disks, and the ``red nuggets", which are red and passive compact galaxies. These objects are typically only observable with space telescopes, and detailed studies of their size, mass, and stellar population parameters have been conducted on relatively small samples. Strong gravitational lensing can offer a new opportunity to study them in detail, even with ground-based observations. In this study, we present the first 6 \textit{bona fide} sample of strongly lensed post-blue nugget (pBN) galaxies, which were discovered in the Kilo Degree Survey. By using the lensing-magnified luminosity from optical and near-infrared bands, we have derived robust structural and stellar population properties of the multiple images of the background sources. \rui{The pBN galaxies have very small sizes of $\rm R_{eff}<1.3$ kpc, high mass density inside 1 kpc of $ \rm \log (Σ_1/M_{\odot} \mathrm{kpc}^{-2})>9.3$, and low specific star formation rates of $\log (\mathrm{sSFR/Gyr})\lesssim0$, The size-mass and $Σ_1$-mass relations of this sample are consistent with those of the red nuggets, while their sSFR is close to the lower end of compact star-forming blue nugget systems at the same redshift, suggesting a clear evolutionary link between them.

astro-ph.GA↗

arXiv2024

FSSC: Federated Learning of Transformer Neural Networks for Semantic Image Communication

In this paper, we address the problem of image semantic communication in a multi-user deployment scenario and propose a federated learning (FL) strategy for a Swin Transformer-based semantic communication system (FSSC). Firstly, we demonstrate that the adoption of a Swin Transformer for joint source-channel coding (JSCC) effectively extracts semantic information in the communication system. Next, the FL framework is introduced to collaboratively learn a global model by aggregating local model parameters, rather than directly sharing clients' data. This approach enhances user privacy protection and reduces the workload on the server or mobile edge. Simulation evaluations indicate that our method outperforms the typical JSCC algorithm and traditional separate-based communication algorithms. Particularly after integrating local semantics, the global aggregation model has further increased the Peak Signal-to-Noise Ratio (PSNR) by more than 2dB, thoroughly proving the effectiveness of our algorithm.

cs.AI↗

arXiv2024

Semantic Successive Refinement: A Generative AI-aided Semantic Communication Framework

Semantic Communication (SC) is an emerging technology aiming to surpass the Shannon limit. Traditional SC strategies often minimize signal distortion between the original and reconstructed data, neglecting perceptual quality, especially in low Signal-to-Noise Ratio (SNR) environments. To address this issue, we introduce a novel Generative AI Semantic Communication (GSC) system for single-user scenarios. This system leverages deep generative models to establish a new paradigm in SC. Specifically, At the transmitter end, it employs a joint source-channel coding mechanism based on the Swin Transformer for efficient semantic feature extraction and compression. At the receiver end, an advanced Diffusion Model (DM) reconstructs high-quality images from degraded signals, enhancing perceptual details. Additionally, we present a Multi-User Generative Semantic Communication (MU-GSC) system utilizing an asynchronous processing model. This model effectively manages multiple user requests and optimally utilizes system resources for parallel processing. Simulation results on public datasets demonstrate that our generative AI semantic communication systems achieve superior transmission efficiency and enhanced communication content quality across various channel conditions. Compared to CNN-based DeepJSCC, our methods improve the Peak Signal-to-Noise Ratio (PSNR) by 17.75% in Additive White Gaussian Noise (AWGN) channels and by 20.86% in Rayleigh channels.

cs.LG↗

arXiv2024

CSST Strong Lensing Preparation: Forecasting the galaxy-galaxy strong lensing population for the China Space Station Telescope

Galaxy-galaxy strong gravitational lensing (GGSL) is a powerful probe for the formation and evolution of galaxies and cosmology, while the sample size of GGSLs leads to considerable uncertainties and potential bias. The China Space Station Telescope (CSST, to be launched in late 2026) will conduct observations across 17,500 square degrees of the sky, capturing images in the $ugriz$ bands with a spatial resolution comparable to that of the Hubble Space Telescope. We ran a set of Monte Carlo simulations to predict that the CSST's wide-field survey will observe $\sim$160,000 galaxy-galaxy strong lenses over its lifespan, increasing the number of existing galaxy-galaxy strong lens samples by three orders of magnitude. This is comparable to the capabilities of the $\it Euclid$ telescope but with the added benefit of additional color information. Specifically, the CSST can detect strong lenses with Einstein radii about $0.64\pm0.42^{"}$, corresponding to the velocity dispersions of $217.19 \pm 50.55 \, \text{km/s}$. These lenses exhibit a median magnification of $\sim$5. The apparent magnitude of the unlensed sources in the g-band is $25.87 \pm 1.19$. The signal-to-noise ratio of the lensed images covers a range of $\sim 20$ to $\sim 1000$, allowing us to determine the Einstein radius with an accuracy ranging from $\sim 1 \%$ to $\sim 0.1 \%$, ignoring various modeling systematics. Our estimates indicate that CSST can observe rare systems like double source-plane and spiral galaxy lenses. The above selection functions of the CSST strong lensing observation help optimize the strategy of finding and modeling GGSLs.

astro-ph.GA↗

arXiv2024

Enhancing CTR Prediction through Sequential Recommendation Pre-training: Introducing the SRP4CTR Framework

Understanding user interests is crucial for Click-Through Rate (CTR) prediction tasks. In sequential recommendation, pre-training from user historical behaviors through self-supervised learning can better comprehend user dynamic preferences, presenting the potential for direct integration with CTR tasks. Previous methods have integrated pre-trained models into downstream tasks with the sole purpose of extracting semantic information or well-represented user features, which are then incorporated as new features. However, these approaches tend to ignore the additional inference costs to the downstream tasks, and they do not consider how to transfer the effective information from the pre-trained models for specific estimated items in CTR prediction. In this paper, we propose a Sequential Recommendation Pre-training framework for CTR prediction (SRP4CTR) to tackle the above problems. Initially, we discuss the impact of introducing pre-trained models on inference costs. Subsequently, we introduced a pre-trained method to encode sequence side information concurrently.During the fine-tuning process, we incorporate a cross-attention block to establish a bridge between estimated items and the pre-trained model at a low cost. Moreover, we develop a querying transformer technique to facilitate the knowledge transfer from the pre-trained model to industrial CTR models. Offline and online experiments show that our method outperforms previous baseline models.

cs.IR↗

arXiv2024

Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver

Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages; however, most of these algorithms are only expressed in the conventional quantum circuit scheme. The roadblock to developing quantum algorithms with the measurement-based quantum computation (MBQC) scheme is resource cost. Recently, we discovered that the realization of multi-qubit rotation operations requires a constant number of single-qubit measurements with the MBQC scheme, providing a potential advantage in terms of resource cost. The structure of the Hamiltonian variational ansatz (HVA) aligns well with this characteristic. Thus, we propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA). We then demonstrate the effectiveness, efficiency, and advantages of the two-dimensional Heisenberg model and the Fermi-Hubbard chain. Numerical experiments show that MBHVA is expected to reduce resource overhead compared to quantum circuits, especially in the presence of large multi-qubit rotation operations. Furthermore, when compared to Measurement-based Hardware Efficient Ansatz (MBHEA), MBHVA also demonstrates superior performance. We conclude that the MBQC scheme is potentially feasible for achieving near-term quantum advantages in terms of both resource efficiency and error mitigation, particularly for photonic platforms.

quant-ph↗

arXiv2024

Single entanglement connection architecture between multi-layer bipartite Hardware Efficient Ansatz

Variational quantum algorithms (VQAs) are among the most promising algorithms to achieve quantum advantages in the NISQ era. One important challenge in implementing such algorithms is to construct an effective parameterized quantum circuit (also called an ansatz). In this work, we propose a single entanglement connection architecture (SECA) for a bipartite hardware efficient ansatz (HEA) by balancing its expressibility, entangling capability, and trainability. Numerical simulations with a one-dimensional Heisenberg model and quadratic unconstrained binary optimization (QUBO) issues were conducted. Our results indicate the superiority of SECA over the common full entanglement connection architecture (FECA) in terms of computational performance. Furthermore, combining SECA with gate-cutting technology to construct distributed quantum computation (DQC) can efficiently expand the size of NISQ devices under low overhead. We also demonstrated the effectiveness and scalability of the DQC scheme. Our study is a useful indication for understanding the characteristics associated with an effective training circuit.

quant-ph↗

arXiv2024

Training-Free Large Model Priors for Multiple-in-One Image Restoration

Image restoration aims to reconstruct the latent clear images from their degraded versions. Despite the notable achievement, existing methods predominantly focus on handling specific degradation types and thus require specialized models, impeding real-world applications in dynamic degradation scenarios. To address this issue, we propose Large Model Driven Image Restoration framework (LMDIR), a novel multiple-in-one image restoration paradigm that leverages the generic priors from large multi-modal language models (MMLMs) and the pretrained diffusion models. In detail, LMDIR integrates three key prior knowledges: 1) global degradation knowledge from MMLMs, 2) scene-aware contextual descriptions generated by MMLMs, and 3) fine-grained high-quality reference images synthesized by diffusion models guided by MMLM descriptions. Standing on above priors, our architecture comprises a query-based prompt encoder, degradation-aware transformer block injecting global degradation knowledge, content-aware transformer block incorporating scene description, and reference-based transformer block incorporating fine-grained image priors. This design facilitates single-stage training paradigm to address various degradations while supporting both automatic and user-guided restoration. Extensive experiments demonstrate that our designed method outperforms state-of-the-art competitors on multiple evaluation benchmarks.

cs.CV↗

arXiv2024

Decomposition Betters Tracking Everything Everywhere

Recent studies on motion estimation have advocated an optimized motion representation that is globally consistent across the entire video, preferably for every pixel. This is challenging as a uniform representation may not account for the complex and diverse motion and appearance of natural videos. We address this problem and propose a new test-time optimization method, named DecoMotion, for estimating per-pixel and long-range motion. DecoMotion explicitly decomposes video content into static scenes and dynamic objects, either of which uses a quasi-3D canonical volume to represent. DecoMotion separately coordinates the transformations between local and canonical spaces, facilitating an affine transformation for the static scene that corresponds to camera motion. For the dynamic volume, DecoMotion leverages discriminative and temporally consistent features to rectify the non-rigid transformation. The two volumes are finally fused to fully represent motion and appearance. This divide-and-conquer strategy leads to more robust tracking through occlusions and deformations and meanwhile obtains decomposed appearances. We conduct evaluations on the TAP-Vid benchmark. The results demonstrate our method boosts the point-tracking accuracy by a large margin and performs on par with some state-of-the-art dedicated point-tracking solutions.

cs.CV↗

arXiv2024

Solving the inverse problem of microscopy deconvolution with a residual Beylkin-Coifman-Rokhlin neural network

Optic deconvolution in light microscopy (LM) refers to recovering the object details from images, revealing the ground truth of samples. Traditional explicit methods in LM rely on the point spread function (PSF) during image acquisition. Yet, these approaches often fall short due to inaccurate PSF models and noise artifacts, hampering the overall restoration quality. In this paper, we approached the optic deconvolution as an inverse problem. Motivated by the nonstandard-form compression scheme introduced by Beylkin, Coifman, and Rokhlin (BCR), we proposed an innovative physics-informed neural network Multi-Stage Residual-BCR Net (m-rBCR) to approximate the optic deconvolution. We validated the m-rBCR model on four microscopy datasets - two simulated microscopy datasets from ImageNet and BioSR, real dSTORM microscopy images, and real widefield microscopy images. In contrast to the explicit deconvolution methods (e.g. Richardson-Lucy) and other state-of-the-art NN models (U-Net, DDPM, CARE, DnCNN, ESRGAN, RCAN, Noise2Noise, MPRNet, and MIMO-U-Net), the m-rBCR model demonstrates superior performance to other candidates by PSNR and SSIM in two real microscopy datasets and the simulated BioSR dataset. In the simulated ImageNet dataset, m-rBCR ranks the second-best place (right after MIMO-U-Net). With the backbone from the optical physics, m-rBCR exploits the trainable parameters with better performances (from ~30 times fewer than the benchmark MIMO-U-Net to ~210 times than ESRGAN). This enables m-rBCR to achieve a shorter runtime (from ~3 times faster than MIMO-U-Net to ~300 times faster than DDPM). To summarize, by leveraging physics constraints our model reduced potentially redundant parameters significantly in expertise-oriented NN candidates and achieved high efficiency with superior performance.

q-bio.QM↗

arXiv2024

Introducing GPU-acceleration into the Python-based Simulations of Chemistry Framework

We introduce the first version of GPU4PySCF, a module that provides GPU acceleration of methods in PySCF. As a core functionality, this provides a GPU implementation of two-electron repulsion integrals (ERIs) for contracted basis sets comprising up to g functions using Rys quadrature. As an illustration of how this can accelerate a quantum chemistry workflow, we describe how to use the ERIs efficiently in the integral-direct Hartree-Fock Fock build and nuclear gradient construction. Benchmark calculations show a significant speedup of two orders of magnitude with respect to the multi-threaded CPU Hartree-Fock code of PySCF, and performance comparable to other GPU-accelerated quantum chemical packages including GAMESS and QUICK on a single NVIDIA A100 GPU.

physics.comp-ph↗

arXiv2024

Erasing Doppler Dephasing Error in Rydberg Quantum Gates

The Doppler dephasing error due to residual thermal motion of qubit atoms is a major cause of fidelity loss in neutral-atom quantum gates. Besides cooling and trapping advancements, few effective methods exist to mitigate this error. In the present work, we introduce an error-erasing strategy that utilizes a pair of off-resonant fields to continuously dress the protected Rydberg state with an auxiliary state, which induces an opposite but enhanced sensitivity to the same source of Doppler dephasing error. Combining with an optimal control of laser pulses, we realize a family of Rydberg two-qubit controlled-NOT gates in Rb and Cs atoms that are fully robust to the Doppler dephasing error. We benchmark this gate operation with fidelity $F\approx0.9906$ at ${\it any}$ temperature for a lower-excited auxiliary state, and a higher fidelity of $F\approx0.9965$ can be attained for a ground-state auxiliary state at a temperature of 50 $μ$K. Our results significantly reduce atomic temperature requirements for high-fidelity quantum gates, and may provide fundamental guidance to practical error-tolerant quantum computing with neutral atoms.

quant-ph↗