arXiv subjects

Liang Liu

Publications and source records attributed to Liang Liu.

At least 199 records · Page 11Linked to original sources

arXiv2021

Multilayer Graph Contrastive Clustering Network

Multilayer graph has garnered plenty of research attention in many areas due to their high utility in modeling interdependent systems. However, clustering of multilayer graph, which aims at dividing the graph nodes into categories or communities, is still at a nascent stage. Existing methods are often limited to exploiting the multiview attributes or multiple networks and ignoring more complex and richer network frameworks. To this end, we propose a generic and effective autoencoder framework for multilayer graph clustering named Multilayer Graph Contrastive Clustering Network (MGCCN). MGCCN consists of three modules: (1)Attention mechanism is applied to better capture the relevance between nodes and neighbors for better node embeddings. (2)To better explore the consistent information in different networks, a contrastive fusion strategy is introduced. (3)MGCCN employs a self-supervised component that iteratively strengthens the node embedding and clustering. Extensive experiments on different types of real-world graph data indicate that our proposed method outperforms state-of-the-art techniques.

cs.SI↗

arXiv2021

SelFSR: Self-Conditioned Face Super-Resolution in the Wild via Flow Field Degradation Network

In spite of the success on benchmark datasets, most advanced face super-resolution models perform poorly in real scenarios since the remarkable domain gap between the real images and the synthesized training pairs. To tackle this problem, we propose a novel domain-adaptive degradation network for face super-resolution in the wild. This degradation network predicts a flow field along with an intermediate low resolution image. Then, the degraded counterpart is generated by warping the intermediate image. With the preference of capturing motion blur, such a model performs better at preserving identity consistency between the original images and the degraded. We further present the self-conditioned block for super-resolution network. This block takes the input image as a condition term to effectively utilize facial structure information, eliminating the reliance on explicit priors, e.g. facial landmarks or boundary. Our model achieves state-of-the-art performance on both CelebA and real-world face dataset. The former demonstrates the powerful generative ability of our proposed architecture while the latter shows great identity consistency and perceptual quality in real-world images.

cs.CV↗

arXiv2021

Quasi one-dimensional diffuse laser cooling of atoms

We demonstrate experimentally the generation of one-dimensional cold gases of $^{87}$Rb atoms by diffuse laser cooling (DLC). A horizontal slender vacuum glass tube with length of 105~cm and diameter of 2~cm is used in our experiment. The diffuse laser light inside the tube, which is generated by multi-reflection of injected lasers, cools the background vapor atoms. With 250~mW of cooling light and 50~mW of repumping light, an evenly distributed meter-long profile of atom cloud is obtained. We observe a factor 4 improvement on the atomic OD for a typical cooling duration of 170~ms and a sub-Doppler atomic temperature of 25~$μ$k. The maximum number of detected cold atoms remain constant for a free-fall duration of 30~ms. Such samples are ideal for many quantum optical experiments involving electromagnetically induced transparency, electronically highly excited (Rydberg) atoms and quantum precision measurements.

physics.atom-ph↗

arXiv2021

Development of a Data-Driven Method to Simulate the Detector Response of Anti-neutron at BESIII

In this paper, a data-driven method to precisely simulate the detector response of the anti-neutron depositing in the Electromagnetic Calorimeter (EMC)at BESIII is introduced. A large anti-neutron data sample can be selected using the decay $J/ψ\to p\bar{n}π^{-}$ from the BESIII data sample of 10 billion $J/ψ$ events. The detection efficiency for and various observables of anti-neutrons interacting in the EMC detector are simulated, taking the correlations among the variables into consideration. The systematic uncertainty of this data-driven simulation method is determined to be less than 1\% on average. This method can be widely applied in physics processes that require precise simulation of the detector response of anti-neutrons in the EMC.

hep-ex↗

arXiv2021

Reconstructing the Hubble diagram of gamma-ray bursts using deep learning

We calibrate the distance and reconstruct the Hubble diagram of gamma-ray bursts (GRBs) using deep learning. We construct an artificial neural network, which combines the recurrent neural network and Bayesian neural network, and train the network using the Pantheon compilation of type-Ia supernovae. The trained network is used to calibrate the distance of 174 GRBs based on the Combo-relation. We verify that there is no evident redshift evolution of Combo-relation, and obtain the slope and intercept parameters, $γ=0.856^{+0.083}_{-0.078}$ and $\log A=49.661^{+0.199}_{-0.217}$, with an intrinsic scatter $σ_{\rm int}=0.228^{+0.041}_{-0.040}$. Our calibrating method is independent of cosmological model, thus the calibrated GRBs can be directly used to constrain cosmological parameters. It is shown that GRBs alone can tightly constrain the $Λ$CDM model, with $Ω_{\rm M}=0.280^{+0.049}_{-0.057}$. However, the constraint on the $ω$CDM model is relatively looser, with $Ω_{\rm M}=0.345^{+0.059}_{-0.060}$ and $ω<-1.414$. The combination of GRBs and Pantheon can tightly constrain the $ω$CDM model, with $Ω_{\rm M}=0.336^{+0.055}_{-0.050}$ and $ω=-1.141^{+0.156}_{-0.135}$.

gr-qc↗

arXiv2021

Phase-Noise Compensation for OFDM Systems Exploiting Coherence Bandwidth: Modeling, Algorithms, and Analysis

Phase-noise (PN) estimation and compensation are crucial in millimeter-wave (mmWave) communication systems to achieve high reliability. The PN estimation, however, suffers from high computational complexity due to its fundamental characteristics, such as spectral spreading and fast-varying fluctuations. In this paper, we propose a new framework for low-complexity PN compensation in orthogonal frequency-division multiplexing systems. The proposed framework also includes a pilot allocation strategy to minimize its overhead. The key ideas are to exploit the coherence bandwidth of mmWave systems and to approximate the actual PN spectrum with its dominant components, resulting in a non-iterative solution by using linear minimum mean squared-error estimation. The proposed method obtains a reduction of more than 2.5x in total complexity, as compared to the existing methods. Furthermore, we derive closed-form expressions for normalized mean squared-errors (NMSEs) as a function of critical system parameters, which help in understanding the NMSE behavior in low and high signal-to-noise ratio regimes. Lastly, we study a trade-off between performance and pilot-overhead to provide insight into an appropriate approximation of the PN spectrum.

cs.IT↗

arXiv2021

Detection of Abrupt Change in Channel Covariance Matrix for Multi-Antenna Communication

The knowledge of channel covariance matrices is of paramount importance to the estimation of instantaneous channels and the design of beamforming vectors in multi-antenna systems. In practice, an abrupt change in channel covariance matrices may occur due to the change in the environment and the user location. Although several works have proposed efficient algorithms to estimate the channel covariance matrices after any change occurs, how to detect such a change accurately and quickly is still an open problem in the literature. In this paper, we focus on channel covariance change detection between a multi-antenna base station (BS) and a single-antenna user equipment (UE). To provide theoretical performance limit, we first propose a genie-aided change detector based on the log-likelihood ratio (LLR) test assuming the channel covariance matrix after change is known, and characterize the corresponding missed detection and false alarm probabilities. Then, this paper considers the practical case where the channel covariance matrix after change is unknown. The maximum likelihood (ML) estimation technique is used to predict the covariance matrix based on the received pilot signals over a certain number of coherence blocks, building upon which the LLR-based change detector is employed. Numerical results show that our proposed scheme can detect the change with low error probability even when the number of channel samples is small such that the estimation of the covariance matrix is not that accurate. This result verifies the possibility to detect the channel covariance change both accurately and quickly in practice.

eess.SP↗

arXiv2021

LuMaMi28: Real-Time Millimeter-Wave Massive MIMO Systems with Antenna Selection

This paper presents LuMaMi28, a real-time 28 GHz massive multiple-input multiple-output (MIMO) testbed. In this testbed, the base station has 16 transceiver chains with a fully-digital beamforming architecture (with different pre-coding algorithms) and simultaneously supports multiple user equipments (UEs) with spatial multiplexing. The UEs are equipped with a beam-switchable antenna array for real-time antenna selection where the one with the highest channel magnitude, out of four pre-defined beams, is selected. For the beam-switchable antenna array, we consider two kinds of UE antennas, with different beam-width and different peak-gain. Based on this testbed, we provide measurement results for millimeter-wave (mmWave) massive MIMO performance in different real-life scenarios with static and mobile UEs. We explore the potential benefit of the mmWave massive MIMO systems with antenna selection based on measured channel data, and discuss the performance results through real-time measurements.

eess.SP↗

arXiv2021

Error Analysis of the Light Curve Solution of Contact Binaries Based on the W-D Code

We use the idea of repeat measurement to determine the mean value and error of light curve solution parameters of contact binaries. Our simulation is realized by the Monte Carlo algorithm and Wilson-Devinney code. This method can obtain the systematic and random error simultaneously. Within our 48 models, the systematic errors are smaller than the random errors in most case. According to the numerical calculations, it is found that the relative errors of photometric mass ratios are less than 1% for totally eclipsing contact binaries, while they are generally between 10% and 20% for partly eclipsing ones. The effect of third light on the errors of photometric solution is also investigated. With a third light, these errors are close to 10% for totally eclipsing contact binaries. Specially, it is better to set the third light to zero in flux if that light is very faint (e.g., less than 1% contribution in luminosity), because such faint third light will bring big errors to the light curve solutions.

astro-ph.SR↗

arXiv2021

High fidelity entanglement of neutral atoms via a Rydberg-mediated single-modulated-pulse controlled-PHASE gate

Neutral atom platform has become an attractive choice to study the science of quantum information and quantum simulation, where intense efforts have been devoted to the entangling processes between individual atoms. For the development of this area, two-qubit controlled-PHASE gate via Rydberg blockade is one of the most essential elements. Recent theoretical studies have suggested the advantages of introducing non-trivial waveform modulation into the gate protocol, which is anticipated to improve its performance towards the next stage. We report our recent experimental results in realizing a two-qubit controlled-PHASE($C_Z$) gate via off-resonant modulated driving(ORMD) embedded in two-photon transition for Rb atoms. It relies upon a single modulated driving pulse with a carefully calculated smooth waveform to gain the appropriate phase accumulations required by the two-qubit gate. Combining this $C_Z$ gate with global microwave pulses, two-atom entanglement is generated with the raw fidelity of 0.945(6). Accounting for state preparation and measurement (SPAM) errors, we extract the entanglement operation fidelity to be 0.980(7). Our work features completing the $C_Z$ gate operation within a single pulse to avoid shelved Rydberg population, thus demonstrate another promising route for realizing high-fidelity two-qubit gate for neutral atom platform.

quant-ph↗

arXiv2021

Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels with Compressing Relays

Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers; the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink.

cs.IT↗

arXiv2021

The Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes

Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper we investigate the impact of coupling memory, block length, decoding window size, and number of iterations on the performance, complexity, and latency of SC-SCCs. Several design tradeoffs are presented to see the relation between these parameters in a wide range. Also, our analysis provides design guidelines for SC-SCCs in different scenarios to make the code design independent of block length. As a result, block length and coupling memory can be exchanged flexibly without changing the latency and complexity. Also, we observe that the performance of SC-SCCs is improved with respect to the uncoupled ensembles for a fixed latency and complexity.

cs.IT↗

arXiv2021

A New Channel Estimation Strategy in Intelligent Reflecting Surface Assisted Networks

Channel estimation is the main hurdle to reaping the benefits promised by the intelligent reflecting surface (IRS), due to its absence of ability to transmit/receive pilot signals as well as the huge number of channel coefficients associated with its reflecting elements. Recently, a breakthrough was made in reducing the channel estimation overhead by revealing that the IRS-BS (base station) channels are common in the cascaded user-IRS-BS channels of all the users, and if the cascaded channel of one typical user is estimated, the other users' cascaded channels can be estimated very quickly based on their correlation with the typical user's channel \cite{b5}. One limitation of this strategy, however, is the waste of user energy, because many users need to keep silent when the typical user's channel is estimated. In this paper, we reveal another correlation hidden in the cascaded user-IRS-BS channels by observing that the user-IRS channel is common in all the cascaded channels from users to each BS antenna as well. Building upon this finding, we propose a novel two-phase channel estimation protocol in the uplink communication. Specifically, in Phase I, the correlation coefficients between the channels of a typical BS antenna and those of the other antennas are estimated; while in Phase II, the cascaded channel of the typical antenna is estimated. In particular, all the users can transmit throughput Phase I and Phase II. Under this strategy, it is theoretically shown that the minimum number of time instants required for perfect channel estimation is the same as that of the aforementioned strategy in the ideal case without BS noise. Then, in the case with BS noise, we show by simulation that the channel estimation error of our proposed scheme is significantly reduced thanks to the full exploitation of the user energy.

eess.SP↗

arXiv2021

Smoothed Multi-View Subspace Clustering

In recent years, multi-view subspace clustering has achieved impressive performance due to the exploitation of complementary imformation across multiple views. However, multi-view data can be very complicated and are not easy to cluster in real-world applications. Most existing methods operate on raw data and may not obtain the optimal solution. In this work, we propose a novel multi-view clustering method named smoothed multi-view subspace clustering (SMVSC) by employing a novel technique, i.e., graph filtering, to obtain a smooth representation for each view, in which similar data points have similar feature values. Specifically, it retains the graph geometric features through applying a low-pass filter. Consequently, it produces a ``clustering-friendly" representation and greatly facilitates the downstream clustering task. Extensive experiments on benchmark datasets validate the superiority of our approach. Analysis shows that graph filtering increases the separability of classes.

cs.CV↗

arXiv2021

User Grouping and Reflective Beamforming for IRS-Aided URLLC

This paper studies an intelligent reflecting surface (IRS)-aided downlink ultra-reliable and low-latency communication (URLLC) system, in which an IRS is dedicatedly deployed to assist a base station (BS) to send individual short-packet messages to multiple users. To enhance the URLLC performance, the users are divided into different groups and the messages for users in each group are encoded into a single codeword. By considering the time division multiple access (TDMA) protocol among different groups, our objective is to minimize the total latency for all users subject to their individual reliability requirements, via jointly optimizing the user grouping and block-length allocation at the BS together with the reflective beamforming at the IRS. We solve the latency minimization problem via the alternating optimization, in which the blocklengths and the reflective beamforming are optimized by using the techniques of successive convex approximation (SCA) and semi-definite relaxation (SDR), while the user grouping is updated by K-means and greedy-based methods. Numerical results show that the proposed designs can significantly reduce the communication latency, as compared to various benchmark schemes, which unveil the importance of user grouping and reflective beamforming optimization for exploiting the joint encoding gain and enhancing the worst-case user performance.

cs.IT↗

arXiv2021

On Massive IoT Connectivity with Temporally-Correlated User Activity

This paper considers joint device activity detection and channel estimation in Internet of Things (IoT) networks, where a large number of IoT devices exist but merely a random subset of them become active for short-packet transmission at each time slot. In particular, we propose to leverage the temporal correlation in user activity, i.e., a device active at the previous time slot is more likely to be still active at the current moment, to improve the detection performance. Despite the temporally-correlated user activity in consecutive time slots, it is challenging to unveil the connection between the activity pattern estimated previously, which is imperfect but the only available side information (SI), and the true activity pattern at the current moment due to the unknown estimation error. In this work, we manage to tackle this challenge under the framework of approximate message passing (AMP). Specifically, thanks to the state evolution, the correlation between the activity pattern estimated by AMP at the previous time slot and the real activity pattern at the previous and current moment is quantified explicitly. Based on the well-defined temporal correlation, we further manage to embed this useful SI into the design of the minimum mean-squared error (MMSE) denoisers and log-likelihood ratio (LLR) test based activity detectors under the AMP framework. Theoretical comparison between the SI-aided AMP algorithm and its counterpart without utilizing temporal correlation is provided. Moreover, numerical results are given to show the significant gain in activity detection accuracy brought by the SI-aided algorithm.

cs.IT↗

arXiv2021

The Deep and Low-Mass-Ratio Contact Binary CSS J022914.4+044340 with A Luminous Additional Companion

The first B-, V-, Rc-, and Ic-band light curves of CSS J022914.4+044340 are presented and analyzed. It is found that CSS J022914.4+044340 is a low mass ratio (0.198 +- 0.005) deep (63.7 +- 7.9%) contact binary, indicating that it has been already at the end evolutionary stage of tidally-locked evolution via magnetized wind. Because of the totally eclipsing character, the photometric solutions are reliable. The temperature and the metallicity are determined from the spectroscopic data as T = 5855 +- 15 K, and [Fe/H] = -0.842 +- 0.031, respectively. Based on the parallax of Gaia EDR3, the physical parameters of CSS J022914.4+044340 are estimated as M1 = 1.44 (+0.25,-0.22) solar mass, M2 = 0.29 (+0.05,-0.05) solar mass, R1 = 1.26 (+0.08,-0.06) solar radius, R2 = 0.65 (+0.03,-0.04) solar radius, L1 = 1.718 (+0.186,-0.191) solar luminosity, L2 = 0.416 (+0.039,-0.050) solar luminosity. Combined the fraction in light of the third body via the photometric solution (54%), the luminosity of the third body is estimated as 2.705 solar luminosity. The third body may be inferred as a subgiant. Thus, it is explained that why the primary component of CSS J022914.4+044340 has higher mass among the similar systems, and why its metallicity is so poor.

astro-ph.SR↗

arXiv2021

An Efficient Algorithm for Device Detection and Channel Estimation in Asynchronous IoT Systems

A great amount of endeavour has recently been devoted to the joint device activity detection and channel estimation problem in massive machine-type communications. This paper targets at two practical issues along this line that have not been addressed before: asynchronous transmission from uncoordinated users and efficient algorithms for real-time implementation in systems with a massive number of devices. Specifically, this paper considers a practical system where the preamble sent by each active device is delayed by some unknown number of symbols due to the lack of coordination. We manage to cast the problem of detecting the active devices and estimating their delay and channels into a group LASSO problem. Then, a block coordinate descent algorithm is proposed to solve this problem globally, where the closed-form solution is available when updating each block of variables with the other blocks of variables being fixed, thanks to the special structure of our interested problem. Our analysis shows that the overall complexity of the proposed algorithm is low, making it suitable for real-time application.

eess.SP↗