Searcharxiv⌕ Search

arXiv subjects

Rui Chen

Publications and source records attributed to Rui Chen.

458 records · Page 26Linked to original sources

Identifying exotic hidden-charm pentaquarks

The LHCb Collaboration at the Large Hadron Collider at CERN discovered two pentaquark states $P_c(4380)$ and $P_c(4450)$. These two hidden-charm states are interpreted as the loosely bound $Σ_c(2455)D^*$ and $Σ_c^*(2520)D^*$ molecular states in the boson exchange interaction model, which provides an explanation for why the experimental width of $P_c(4450)$ is much narrower than that of $P_c(4380)$. The discovery of the new resonances $P_c(4380)$ and $P_c(4450)$, indeed, opens a new page for hadron physics. The partners of $P_c(4380)$ and $P_c(4450)$ should be pursued in future experiments.

hep-ph↗

A High-contrast Imaging Algorithm: Optimized Image Rotation and Subtraction

Image Rotation and Subtraction (IRS) is a high-contrast imaging technique which can be used to suppress the speckles noise and facilitate the direct detection of exoplanets. IRS is different from Angular Differential Imaging (ADI), in which it will subtract a copy of the image with 180 degrees rotated around its PSF center, rather than the subtraction of the median of all of the PSF images. Since the planet itself will be rotated to the other side of the PSF, IRS does not suffer from planet self-subtraction. In this paper, we have introduced an optimization algorithm to IRS (OIRS), which can provide an extra contrast gain at small angular separations. The performance of OIRS has been demonstrated with ADI data. We then made a comparison of the signal to noise ratio (S/N) achieved by algorithms of locally optimized combination of images (LOCI) and OIRS. Finally we found that OIRS algorithm can deliver a better S/N for small angular separations.

astro-ph.IM↗

Predicting exotic molecular states composed of nucleon and P-wave charmed meson

In this work, we study the interaction between a nucleon and a $P$-wave charmed meson in the $T$ doublet by exchanging a pion. Our calculations indicate that a nucleon and a $P$-wave charmed meson with $J^P=0^+$ or $J^P=1^+$ in the $T$ doublet can form bound states. We propose the experimental search for these exotic molecular states near the $D_1(2420)N$ and $D_2^*(2460)N$ thresholds, where Belle, LHCb and the forthcoming Belle II have the discovery potential for them.

hep-ph↗

Privacy Preserving Record Linkage via grams Projections

Record linkage has been extensively used in various data mining applications involving sharing data. While the amount of available data is growing, the concern of disclosing sensitive information poses the problem of utility vs privacy. In this paper, we study the problem of private record linkage via secure data transformations. In contrast to the existing techniques in this area, we propose a novel approach that provides strong privacy guarantees under the formal framework of differential privacy. We develop an embedding strategy based on frequent variable length grams mined in a private way from the original data. We also introduce personalized threshold for matching individual records in the embedded space which achieves better linkage accuracy than the existing global threshold approach. Compared with the state-of-the-art secure matching schema, our approach provides formal, provable privacy guarantees and achieves better scalability while providing comparable utility.

cs.DB↗

On the Achievability of Interference Alignment for Three-Cell Constant Cellular Interfering Networks

For a three-cell constant cellular interfering network, a new property of alignment is identified, i.e., interference alignment (IA) solution obtained in an user-cooperation scenario can also be applied in a non-cooperation environment. By using this property, an algorithm is proposed by jointly designing transmit and receive beamforming matrices. Analysis and numerical results show that more degree of freedom (DoF) can be achieved compared with conventional schemes in most cases.

cs.IT↗

Differentially Private Trajectory Data Publication

With the increasing prevalence of location-aware devices, trajectory data has been generated and collected in various application domains. Trajectory data carries rich information that is useful for many data analysis tasks. Yet, improper publishing and use of trajectory data could jeopardize individual privacy. However, it has been shown that existing privacy-preserving trajectory data publishing methods derived from partition-based privacy models, for example k-anonymity, are unable to provide sufficient privacy protection. In this paper, motivated by the data publishing scenario at the Societe de transport de Montreal (STM), the public transit agency in Montreal area, we study the problem of publishing trajectory data under the rigorous differential privacy model. We propose an efficient data-dependent yet differentially private sanitization algorithm, which is applicable to different types of trajectory data. The efficiency of our approach comes from adaptively narrowing down the output domain by building a noisy prefix tree based on the underlying data. Moreover, as a post-processing step, we make use of the inherent constraints of a prefix tree to conduct constrained inferences, which lead to better utility. This is the first paper to introduce a practical solution for publishing large volume of trajectory data under differential privacy. We examine the utility of sanitized data in terms of count queries and frequent sequential pattern mining. Extensive experiments on real-life trajectory data from the STM demonstrate that our approach maintains high utility and is scalable to large trajectory datasets.

cs.DB↗

Distributed Interference Alignment with Low Overhead

Based on closed-form interference alignment (IA) solutions, a low overhead distributed interference alignment (LOIA) scheme is proposed in this paper for the $K$-user SISO interference channel, and extension to multiple antenna scenario is also considered. Compared with the iterative interference alignment (IIA) algorithm proposed by Gomadam et al., the overhead is greatly reduced. Simulation results show that the IIA algorithm is strictly suboptimal compared with our LOIA algorithm in the overhead-limited scenario.

cs.IT↗

Group Based Interference Alignment

In the $K$-user single-input single-output (SISO) frequency-selective fading interference channel, it is shown that the maximal achievable multiplexing gain is almost surely $K/2$ by using interference alignment (IA). However, when the signaling dimensions are limited, allocating all the resources to all users simultaneously is not optimal. So, a group based interference alignment (GIA) scheme is proposed, and it is formulated as an unbounded knapsack problem. Optimal and greedy search algorithms are proposed to obtain group patterns. Analysis and numerical results show that the GIA scheme can obtain a higher multiplexing gain when the resources are limited.

cs.IT↗