Searcharxiv⌕ Search

arXiv subjects

Sheng Yang

Publications and source records attributed to Sheng Yang.

At least 181 records · Page 10Linked to original sources

$ρ-ω$ mixing contribution to the measured $CP$ asymmetry of $B^\pm\to ωK^\pm$

We study the $CP$ asymmetry of $B^\pm\to ωK^\pm$ with the inclusion of the $ρ-ω$ mixing mechanism. It is shown that the $CP$ asymmetry of $B^\pm\toωK^\pm$ experimentally measured ($A_{CP}^{\text{exp}}$) and conventionally defined ($A_{CP}^{\text{con}}$) are in fact different, which relation can be illustrated as $A_{CP}^{\text{exp}}=A_{CP}^{\text{con}}+ΔA_{CP}^{ρω}$, with $ΔA_{CP}^{ρω}$ the $ρ-ω$ mixing contribution to $A_{CP}^{\text{exp}}$. $A_{CP}^{\text{exp}}$ is in fact the regional $CP$ asymmetry of $B^\pm\toπ^+π^-π^0 K^\pm$ when the invariant mass of the three pions lies in the vicinity of the $ω$ resonance. The numerical value of $ΔA_{CP}^{ρω}$ is extracted from the experimental data of $B^\pm\toπ^+π^-K^\pm$ and is found to be comparable with $A_{CP}^{\text{exp}}$, hence, nonnegligible. The conventionally defined $CP$ asymmetry, $A_{CP}^{\text{con}}$, is obtained from the values of $A_{CP}^{\text{exp}}$ and $ΔA_{CP}^{ρω}$, and is compared with the theoretical calculations in the literature.

hep-ph↗

Timing analysis of the black hole candidate EXO 1846-031 with Insight-HXMT monitoring

We present the observational results from a detailed timing analysis of the black hole candidate EXO 1846-031 during its outburst in 2019 with the observations of Insight-HXMT, NICER and MAXI. This outburst can be classfied roughly into four different states. Type-C quasi-periodic oscillations (QPOs) observed by NICER (about 0.1-6Hz) and Insight-HXMT (about 0.7-8Hz) are also reported in this work. Meanwhile, we study various physical quantities related to QPO frequency.The QPO rms-frequency relationship in three energy band 1-10 keV indicates that there is a turning pointing in frequency around 2 Hz,which is similar to that of GRS 1915+105. A possible hypothesis for the relationship above may be related to the inclination of the source, which may require a high inclination to explain it. The relationships between QPO frequency and QPO rms,hardness,total fractional rms and count rate have also been found in other transient sources, which can indicate that the origin of type-C QPOs is non-thermal.

astro-ph.HE↗

Discovery of oscillations above 200 keV in a black hole X-ray binary with Insight-HXMT

Low-frequency quasi-periodic oscillations (LFQPOs) are commonly found in black hole X-ray binaries, and their origin is still under debate. The properties of LFQPOs at high energies (above 30 keV) are closely related to the nature of the accretion flow in the innermost regions, and thus play a crucial role in critically testing various theoretical models. The Hard X-ray Modulation Telescope (Insight-HXMT) is capable of detecting emissions above 30 keV, and is therefore an ideal instrument to do so. Here we report the discovery of LFQPOs above 200 keV in the new black hole MAXI J1820+070 in the X-ray hard state, which allows us to understand the behaviours of LFQPOs at hundreds of kiloelectronvolts. The phase lag of the LFQPO is constant around zero below 30 keV, and becomes a soft lag (that is, the high-energy photons arrive first) above 30 keV. The soft lag gradually increases with energy and reaches ~0.9s in the 150-200 keV band. The detection at energies above 200 keV, the large soft lag and the energy-related behaviors of the LFQPO pose a great challenge for most currently existing models, but suggest that the LFQPO probably originates from the precession of a small-scale jet.

astro-ph.HE↗

Cube-Split: A Structured Grassmannian Constellation for Non-Coherent SIMO Communications

In this paper, we propose a practical structured constellation for non-coherent communication with a single transmit antenna over Rayleigh flat and block fading channel without instantaneous channel state information. The constellation symbols belong to the Grassmannian of lines and are defined up to a complex scaling. The constellation is generated by partitioning the Grassmannian of lines into a collection of bent hypercubes and defining a mapping onto each of these bent hypercubes such that the resulting symbols are approximately uniformly distributed on the Grassmannian. With a reasonable choice of parameters, this so-called cube-split constellation has higher packing efficiency, represented by the minimum distance, than the existing structured constellations. Furthermore, exploiting the constellation structure, we propose low-complexity greedy symbol decoder and log-likelihood ratio computation, as well as an efficient way to associate it to a multilevel code with multistage decoding. Numerical results show that the performance of the cube-split constellation is close to that of a numerically optimized constellation and better than other structured constellations. It also outperforms a coherent pilot-based scheme in terms of error probability and achievable data rate in the regime of short coherence time and large constellation size.

cs.IT↗

Scalable Content Delivery with Coded Caching in Multi-Antenna Fading Channels

We consider the content delivery problem in a fading multi-input single-output channel with cache-aided users. We are interested in the scalability of the equivalent content delivery rate when the number of users, $K$, is large. Analytical results show that, using coded caching and wireless multicasting, without channel state information at the transmitter (CSIT), linear scaling of the content delivery rate with respect to $K$ can be achieved in some different ways. First, if the multicast transmission spans over $L$ independent sub-channels, e.g., in quasi-static fading if $L = 1$, and in block fading or multi-carrier systems if $L>1$, linear scaling can be obtained when the product of the number of transmit antennas and the number of sub-channels scales logarithmically with $K$. Second, even with a fixed number of antennas, we can achieve the linear scaling with a threshold-based user selection requiring only one-bit feedbacks from the users. When CSIT is available, we propose a mixed strategy that combines spatial multiplexing and multicasting. Numerical results show that, by optimizing the power split between spatial multiplexing and multicasting, we can achieve a significant gain of the content delivery rate with moderate cache size.

cs.IT↗

Multi-User Detection Based on Expectation Propagation for the Non-Coherent SIMO Multiple Access Channel

We consider the non-coherent single-input multiple-output (SIMO) multiple access channel with general signaling under spatially correlated Rayleigh block fading. We propose a novel soft-output multi-user detector that computes an approximate marginal posterior of each transmitted signal using only the knowledge about the channel distribution. Our detector is based on expectation propagation (EP) approximate inference and has polynomial complexity in the number of users, the number of receive antennas, and channel coherence time. We also propose two simplifications of this detector with reduced complexity. With Grassmannian signaling, the proposed detectors outperform a state-of-the-art non-coherent detector with projection-based interference mitigation. With pilot-assisted signaling, the EP detector outperforms, in terms of symbol error rate, some conventional coherent pilot-based detectors, including a sphere decoder and a joint channel estimation-data detection scheme. Our EP-based detectors produce accurate approximates of the true posterior leading to high achievable sum-rates. The gains of these detectors are further observed in terms of the bit error rate when using their soft outputs for a turbo channel decoder.

cs.IT↗

A Fundamental Storage-Communication Tradeoff for Distributed Computing with Straggling Nodes

Placement delivery arrays for distributed computing (Comp-PDAs) have recently been proposed as a framework to construct universal computing schemes for MapReduce-like systems. In this work, we extend this concept to systems with straggling nodes, i.e., to systems where a subset of the nodes cannot accomplish the assigned map computations in due time. Unlike most previous works that focused on computing linear functions, our results are universal and apply for arbitrary map and reduce functions. Our contributions are as follows. Firstly, we show how to construct a universal coded computing scheme for MapReduce-like systems with straggling nodes from any given Comp-PDA. We also characterize the storage and communication loads of the resulting scheme in terms of the Comp-PDA parameters. Then, we prove an information-theoretic converse bound on the storage-communication (SC) tradeoff achieved by universal computing schemes with straggling nodes. We show that the information-theoretic bound matches the performance achieved by the coded computing schemes with straggling nodes corresponding to the Maddah-Ali and Niesen (MAN) PDAs, i.e., to the Comp-PDAs describing Maddah-Ali and Niesen's coded caching scheme. Interestingly, the same Comp-PDAs (the MAN-PDAs) are optimal for any number of straggling nodes, which implies that the map phase of optimal coded computing schemes does not need to be adapted to the number of stragglers in the system. We finally prove that while the points that lie exactly on the fundamental SC tradeoff cannot be achieved with Comp-PDAs that require smaller number of files than the MAN-PDAs, this is possible for some of the points that lie close to the SC tradeoff. For these latter points, the decrease in the requested number of files can be exponential in the number of nodes of the system.

cs.IT↗

ClusterVO: Clustering Moving Instances and Estimating Visual Odometry for Self and Surroundings

We present ClusterVO, a stereo Visual Odometry which simultaneously clusters and estimates the motion of both ego and surrounding rigid clusters/objects. Unlike previous solutions relying on batch input or imposing priors on scene structure or dynamic object models, ClusterVO is online, general and thus can be used in various scenarios including indoor scene understanding and autonomous driving. At the core of our system lies a multi-level probabilistic association mechanism and a heterogeneous Conditional Random Field (CRF) clustering approach combining semantic, spatial and motion information to jointly infer cluster segmentations online for every frame. The poses of camera and dynamic objects are instantly solved through a sliding-window optimization. Our system is evaluated on Oxford Multimotion and KITTI dataset both quantitatively and qualitatively, reaching comparable results to state-of-the-art solutions on both odometry and dynamic trajectory recovery.

cs.CV↗

The Background Model of the Medium Energy X-ray telescope of Insight-HXMT

The Medium Energy X-ray Telescope (ME) is one of the main payloads of the Hard X-ray Modulation Telescope (dubbed as Insight-HXMT). The background of Insight-HXMT/ME is mainly caused by the environmental charged particles and the background intensity is modulated remarkably by the geomagnetic field, as well as the geographical location. At the same geographical location, the background spectral shape is stable but the intensity varies with the level of the environmental charged particles. In this paper, we develop a model to estimate the ME background based on the ME database that is established with the two-year blank sky observations of the high Galactic latitude. In this model, the entire geographical area covered by Insight-HXMT is divided into grids of $5^{\circ}\times5^{\circ}$ in geographical coordinate system. For each grid, the background spectral shape can be obtained from the background database and the intensity can be corrected by the contemporary count rate of the blind FOV detectors. Thus the background spectrum can be obtained by accumulating the background of all the grids passed by Insight-HXMT during the effective observational time. The model test with the blank sky observations shows that the systematic error of the background estimation in $8.9-44.0$ keV is $\sim1.3\%$ for a pointing observation with an average exposure $\sim5.5$ ks. We also find that the systematic error is anti-correlated with the exposure, which indicates the systematic error is partly contributed by the statistical error of count rate measured by the blind FOV detectors.

astro-ph.IM↗

Rate Splitting for Multi-Antenna Downlink: Precoder Design and Practical Implementation

Rate splitting (RS) is a potentially powerful and flexible technique for multi-antenna downlink transmission. In this paper, we address several technical challenges towards its practical implementation for beyond 5G systems. To this end, we focus on a single-cell system with a multi-antenna base station (BS) and K single-antenna receivers. We consider RS in its most general form, and joint decoding to fully exploit the potential of RS. First, we investigate the achievable rates under joint decoding and formulate the precoder design problems to maximize a general utility function, or to minimize the transmit power under pre-defined rate targets. Building upon the concave-convex procedure (CCCP), we propose precoder design algorithms for an arbitrary number of users. Our proposed algorithms approximate the intractable non-convex problems with a number of successively refined convex problems, and provably converge to stationary points of the original problems. Then, to reduce the decoding complexity, we consider the optimization of the precoder and the decoding order under successive decoding. Further, we propose a stream selection algorithm to reduce the number of precoded signals. With a reduced number of streams and successive decoding at the receivers, our proposed algorithm can even be implemented when the number of users is relatively large, whereas the complexity was previously considered as prohibitively high in the same setting. Finally, we propose a simple adaptation of our algorithms to account for the imperfection of the channel state information at the transmitter. Numerical results demonstrate that the general RS scheme provides a substantial performance gain as compared to state-of-the-art linear precoding schemes, especially with a moderately large number of users.

cs.IT↗

Placement Delivery Array Design for Combination Networks with Edge Caching

A major practical limitation of the Maddah-Ali-Niesen coded caching techniques is their high subpacketization level. For the simple network with a single server and multiple users, Yan \emph{et al.} proposed an alternative scheme with the so-called placement delivery arrays (PDA). Such a scheme requires slightly higher transmission rates but significantly reduces the subpacketization level. In this paper, we extend the PDA framework and propose three low-subpacketization schemes for combination networks, i.e., networks with a single server, multiple relays, and multiple cache-aided users that are connected to subsets of relays. One of the schemes achieves the cutset lower bound on the link rate when the cache memories are sufficiently large. Our other two schemes apply only to \emph{resolvable} combination networks. For these networks and for a wide range of cache sizes, the new schemes perform closely to the coded caching schemes that directly apply Maddah-Ali-Niesen scheme while having significantly reduced subpacketization levels.

cs.IT↗

A Storage-Computation-Communication Tradeoff for Distributed Computing

This paper investigates distributed computing systems where computations are split into "Map" and "Reduce" functions. A new coded scheme, called distributed computing and coded communication (D3C), is proposed, and its communication load is analyzed as a function of the available storage space and the number of intermediate values (IVA) to be computed. D3C achieves the smallest possible communication load for a given storage space, while a smaller number of IVAs need to be computed compared to Li et al.'s coded distributed computing (CDC) scheme. More generally, our scheme can flexibly trade between storage space and the number of IVAs to be computed. Communication load is then analyzed for any given tradeoff.

cs.IT↗

Storage, Computation, and Communication: A Fundamental Tradeoff in Distributed Computing

We consider a MapReduce-like distributed computing system. We derive a lower bound on the communication cost for any given storage and computation costs. This lower bound matches the achievable bound we proposed recently. As a result, we completely characterize the optimal tradeoff between the storage, the computation, and the communication. Our result generalizes the previous one by Li et al. to also account for the number of computed intermediate values.

cs.IT↗

Joint Constellation Design for the Two-User Non-Coherent Multiple-Access Channel

We consider the joint constellation design problem for the two-user non-coherent multiple-access channel (MAC). Based on an analysis on the non-coherent maximum-likelihood (ML) detection error, we propose novel design criteria so as to minimize the error probability. Based on these criteria, we propose a simple and efficient construction consisting in partitioning a single-user constellation. Numerical results show that our proposed metrics are meaningful, and can be used as objectives to generate constellations through numerical optimization that perform better than other schemes for the same transmission rate and power.

cs.IT↗

Morphing and Sampling Network for Dense Point Cloud Completion

3D point cloud completion, the task of inferring the complete geometric shape from a partial point cloud, has been attracting attention in the community. For acquiring high-fidelity dense point clouds and avoiding uneven distribution, blurred details, or structural loss of existing methods' results, we propose a novel approach to complete the partial point cloud in two stages. Specifically, in the first stage, the approach predicts a complete but coarse-grained point cloud with a collection of parametric surface elements. Then, in the second stage, it merges the coarse-grained prediction with the input point cloud by a novel sampling algorithm. Our method utilizes a joint loss function to guide the distribution of the points. Extensive experiments verify the effectiveness of our method and demonstrate that it outperforms the existing methods in both the Earth Mover's Distance (EMD) and the Chamfer Distance (CD).

cs.CV↗

Overview to the Hard X-ray Modulation Telescope (Insight-HXMT) Satellite

As China's first X-ray astronomical satellite, the Hard X-ray Modulation Telescope (HXMT), which was dubbed as Insight-HXMT after the launch on June 15, 2017, is a wide-band (1-250 keV) slat-collimator-based X-ray astronomy satellite with the capability of all-sky monitoring in 0.2-3 MeV. It was designed to perform pointing, scanning and gamma-ray burst (GRB) observations and, based on the Direct Demodulation Method (DDM), the image of the scanned sky region can be reconstructed. Here we give an overview of the mission and its progresses, including payload, core sciences, ground calibration/facility, ground segment, data archive, software, in-orbit performance, calibration, background model, observations and some preliminary results.

astro-ph.IM↗

Studies on the time response distribution of Insigh}-HXMT/LE

The Hard X-ray Modulation Telescope (HXMT) named Insight is China's first X-ray astronomical satellite. The Low Energy X-ray Telescope (LE) is one of its main payloads onboard. The detectors of LE adopt swept charge device CCD236 with L-shaped transfer electrodes. Charges in detection area are read out continuously along specific paths, which leads to a time response distribution of photons readout time. We designed a long exposure readout mode to measure the time response distribution. In this mode, CCD236 firstly performs exposure without readout, then all charges generated in preceding exposure phase are read out completely. Through analysis of the photons readout time in this mode, we obtained the probability distribution of photons readout time.

astro-ph.IM↗

The Medium Energy (ME) X-ray telescope onboard the Insight-HXMT astronomy satellite

The Medium Energy X-ray telescope (ME) is one of the three main telescopes on board the Insight Hard X-ray Modulation Telescope (Insight-HXMT) astronomy satellite. ME contains 1728 pixels of Si-PIN detectors sensitive in 5-30 keV with a total geometrical area of 952 cm2. Application Specific Integrated Circuit (ASIC) chips, VA32TA6, is used to achieve low power consumption and low readout noise. The collimators define three kinds of field of views (FOVs) for the telescope, 1°{\times}4°, 4°{\times}4°, and blocked ones. Combination of such FOVs can be used to estimate the in-orbit X-ray and particle background components. The energy resolution of ME is ~3 keV at 17.8 keV (FWHM) and the time resolution is 255 μs. In this paper, we introduce the design and performance of ME.

astro-ph.IM↗