arXiv subjects

Lei Liu

Publications and source records attributed to Lei Liu.

At least 253 records · Page 14Linked to original sources

arXiv2022

RescureService: A Benchmark Microservice System for the Research of Mobile Edge and Cloud Computing

The dramatic development of cloud and edge computing allows for better Quality of Service (QoS) in many scenarios by deploying services on cloud and edge servers. Microservice technology is also adopted in these scenarios to decompose complex business logic into many small independent services. Meanwhile, as microservice systems continue to grow, providing stable QoS in these systems becomes a challenge, and many different approaches have been proposed for stable QoS. However, the microservice systems used in the experiments of these work have problems such as the low number of services and a single type of service. Therefore, we developed the open-source benchmark microservice system RescureService with 20+ services, including database, front-end, business logic, data processing, and artificial intelligence services in the disaster relief scenario. Measuring tools are provided to measure the service properties to help researchers prepare experimental data, and the service properties pre-measured are also presented. Meanwhile, the fulfillment of benchmark requirements is detailed, and the results show that our RescureService meets the requirements of a benchmark system in research. Moreover, instructions are given to describe adopting our system in service computing as examples.

cs.DC↗

arXiv2022

Plateau regions for zero-bias peaks within 5% of the quantized conductance value $2e^2/h$

Probing an isolated Majorana zero mode is predicted to reveal a tunneling conductance quantized at $2e^2/h$ at zero temperature. Experimentally, a zero-bias peak (ZBP) is expected and its height should remain robust against relevant parameter tuning, forming a quantized plateau. Here, we report the observation of large ZBPs in a thin InAs-Al hybrid nanowire device. The ZBP height can stick close to $2e^2/h$, mostly within $5\%$ tolerance, by sweeping gate voltages and magnetic field. We further map out the phase diagram and identify two plateau regions in the phase space. Despite the presence of disorder and quantum dots, our result constitutes a step forward towards establishing Majorana zero modes.

cond-mat.mes-hall↗

arXiv2022

Phonon transition across an isotopic interface

Natural materials usually consist of isotopic mixtures, for which different isotopic ratios can lead to distinct material properties such as thermal conductivity and nucleation process. However, the knowledge of isotopic interface remains largely unexplored mainly due to the challenges in isotopic identification and property measurement at an atomic scale. Here, by using monochromated electron energy-loss spectroscopy in a scanning transmission electron microscope, we reveal momentum-transfer-dependent lattice vibration behavior at an artificial h-10BN/h-11BN heterostructure with sub-unit-cell resolution. We find the vibrational energy changes across the isotopic interface gradually, featuring a wide transition regime, which suggests strong delocalization of the out-of-plane optical phonons at the interface. In addition, we identify phonons near the Brillouin zone center have a transition regime ~3.34 nm (10 atomic layers), whereas phonons at the Brillouin zone boundary transition in ~1.66 nm (5 atomic layers). We propose that the isotope-induced charge effect at the interface accounts for the distinct delocalization behavior. Moreover, intra-atomic layer variation of vibration energy is also sensitive to the momentum transfer, thus at the interface it depends on both of momentum transfer and mass change. The revealed lattice vibration behavior at an isotopic interface provides new insights to understand the isotopic effects on properties in natural materials.

cond-mat.mtrl-sci↗

arXiv2022

Solvent quality dependent osmotic pressure of polymer solutions in two dimensions

Confined in two dimensional planes, polymer chains comprising dense monolayer solution are segregated from each other due to topological interaction. Although the segregation is inherent in two dimensions (2D), the solution may display different properties depending on the solvent quality. Among others, it is well known in both theory and experiment that the osmotic pressure ($Π$) in the semi-dilute regime displays solvent quality-dependent increases with the area fraction ($ϕ$) (or monomer concentration, $ρ$), that is, $Π\sim ϕ^3$ for good solvent and $Π\sim ϕ^8$ for $Θ$ solvent. The osmotic pressure can be associated with the Flory exponent (or the correlation length exponent) for the chain size and the pair distribution function of monomers; however, they do not necessarily offer a detailed microscopic picture leading to the difference. To gain microscopic understanding into the different surface pressure isotherms of polymer solution under the two distinct solvent conditions, we study the chain configurations of polymer solution based on our numerical simulations that semi-quantitatively reproduce the expected scaling behaviors. Notably, at the same value of $ϕ$, polymer chains in $Θ$ solvent occupy the surface in a more \emph{inhomogeneous} manner than the chains in good solvent, yielding on average a greater and more heterogeneous interstitial void size, which is related to the fact that the polymer in $Θ$ solvent has a greater correlation length. The polymer configurations and interstitial voids visualized and quantitatively analyzed in this study offer microscopic understanding to the origin of the solvent quality dependent osmotic pressure of 2D polymer solutions.

cond-mat.soft↗

arXiv2022

Capacity Optimal Generalized Multi-User MIMO: A Theoretical and Practical Framework

Conventional multi-user multiple-input multiple-output (MU-MIMO) mainly focused on Gaussian signaling, independent and identically distributed (IID) channels, and a limited number of users. It will be laborious to cope with the heterogeneous requirements in next-generation wireless communications, such as various transmission data, complicated communication scenarios, and massive user access. Therefore, this paper studies a generalized MU-MIMO (GMU-MIMO) system with more practical constraints, i.e., non-Gaussian signaling, non-IID channel, and massive users and antennas. These generalized assumptions bring new challenges in theory and practice. For example, there is no accurate capacity analysis for GMU-MIMO. In addition, it is unclear how to achieve the capacity optimal performance with practical complexity. To address these challenges, a unified framework is proposed to derive the GMU-MIMO capacity and design a capacity optimal transceiver, which jointly considers encoding, modulation, detection, and decoding. Group asymmetry is developed to make a tradeoff between user rate allocation and implementation complexity. Specifically, the capacity region of group asymmetric GMU-MIMO is characterized by using the celebrated mutual information and minimum mean-square error (MMSE) lemma and the MMSE optimality of orthogonal approximate message passing (OAMP)/vector AMP (VAMP). Furthermore, a theoretically optimal multi-user OAMP/VAMP receiver and practical multi-user low-density parity-check (MU-LDPC) codes are proposed to achieve the capacity region of group asymmetric GMU-MIMO. Numerical results verify that the gaps between theoretical detection thresholds of the proposed framework with optimized MU-LDPC codes and QPSK modulation and the sum capacity of GMU-MIMO are about 0.2 dB. Moreover, their finite-length performances are about 1~2 dB away from the associated sum capacity.

cs.IT↗

arXiv2022

Intelligent Resource Scheduling for Co-located Latency-critical Services: A Multi-Model Collaborative Learning Approach

Latency-critical services have been widely deployed in cloud environments. For cost-efficiency, multiple services are usually co-located on a server. Thus, run-time resource scheduling becomes the pivot for QoS control in these complicated co-location cases. However, the scheduling exploration space enlarges rapidly with the increasing server resources, making the schedulers hardly provide ideal solutions quickly. More importantly, we observe that there are "resource cliffs" in the scheduling exploration space. They affect the exploration efficiency and always lead to severe QoS fluctuations. Resource cliffs cannot be easily avoided in previous schedulers. To address these problems, we propose a novel ML-based intelligent scheduler - OSML. It learns the correlation between architectural hints (e.g., IPC, cache misses, memory footprint, etc.), scheduling solutions and the QoS demands based on a data set we collected from 11 widely deployed services running on off-the-shelf servers. OSML employs multiple ML models to work collaboratively to predict QoS variations, shepherd the scheduling, and recover from QoS violations in complicated co-location cases. OSML can intelligently avoid resource cliffs during scheduling and reach an optimal solution much faster than previous approaches for co-located LC services. Experimental results show that OSML supports higher loads and meets QoS targets with lower scheduling overheads and shorter convergence time than previous studies.

cs.DC↗

arXiv2022

High Speed Rotation Estimation with Dynamic Vision Sensors

Rotational speed is one of the important metrics to be measured for calibrating the electric motors in manufacturing, monitoring engine during car repairing, faults detection on electrical appliance and etc. However, existing measurement techniques either require prohibitive hardware (e.g., high-speed camera) or are inconvenient to use in real-world application scenarios. In this paper, we propose, EV-Tach, an event-based tachometer via efficient dynamic vision sensing on mobile devices. EV-Tach is designed as a high-fidelity and convenient tachometer by introducing dynamic vision sensor as a new sensing modality to capture the high-speed rotation precisely under various real-world scenarios. By designing a series of signal processing algorithms bespoke for dynamic vision sensing on mobile devices, EV-Tach is able to extract the rotational speed accurately from the event stream produced by dynamic vision sensing on rotary targets. According to our extensive evaluations, the Relative Mean Absolute Error (RMAE) of EV-Tach is as low as 0.03% which is comparable to the state-of-the-art laser tachometer under fixed measurement mode. Moreover, EV-Tach is robust to subtle movement of user's hand, therefore, can be used as a handheld device, where the laser tachometer fails to produce reasonable results.

cs.CV↗

arXiv2022

Reinforcement Learning with Prior Policy Guidance for Motion Planning of Dual-Arm Free-Floating Space Robot

Reinforcement learning methods as a promising technique have achieved superior results in the motion planning of free-floating space robots. However, due to the increase in planning dimension and the intensification of system dynamics coupling, the motion planning of dual-arm free-floating space robots remains an open challenge. In particular, the current study cannot handle the task of capturing a non-cooperative object due to the lack of the pose constraint of the end-effectors. To address the problem, we propose a novel algorithm, EfficientLPT, to facilitate RL-based methods to improve planning accuracy efficiently. Our core contributions are constructing a mixed policy with prior knowledge guidance and introducing infinite norm to build a more reasonable reward function. Furthermore, our method successfully captures a rotating object with different spinning speeds.

cs.RO↗

arXiv2022

RIS-Aided Multiuser MIMO-OFDM with Linear Precoding and Iterative Detection: Analysis and Optimization

In this paper, we consider a reconfigurable intelligence surface (RIS) aided uplink multiuser multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) system, where the receiver is assumed to conduct low-complexity iterative detection. We aim to minimize the total transmit power by jointly designing the precoder of the transmitter and the passive beamforming of the RIS. This problem can be tackled from the perspective of information theory. But this information-theoretic approach may involve prohibitively high complexity since the number of rate constraints that specify the capacity region of the uplink multiuser channel is exponential in the number of users. To avoid this difficulty, we formulate the design problem of the iterative receiver under the constraints of a maximal iteration number and target bit error rates of users. To tackle this challenging problem, we propose a groupwise successive interference cancellation (SIC) optimization approach, where the signals of users are decoded and cancelled in a group-by-group manner. We present a heuristic user grouping strategy, and resort to the alternating optimization technique to iteratively solve the precoding and passive beamforming sub-problems. Specifically, for the precoding sub-problem, we employ fractional programming to convert it to a convex problem; for the passive beamforming sub-problem, we adopt successive convex approximation to deal with the unit-modulus constraints of the RIS. We show that the proposed groupwise SIC approach has significant advantages in both performance and computational complexity, as compared with the counterpart approaches.

cs.IT↗

arXiv2022

Investigate the Essence of Long-Tailed Recognition from a Unified Perspective

As the data scale grows, deep recognition models often suffer from long-tailed data distributions due to the heavy imbalanced sample number across categories. Indeed, real-world data usually exhibit some similarity relation among different categories (e.g., pigeons and sparrows), called category similarity in this work. It is doubly difficult when the imbalance occurs between such categories with similar appearances. However, existing solutions mainly focus on the sample number to re-balance data distribution. In this work, we systematically investigate the essence of the long-tailed problem from a unified perspective. Specifically, we demonstrate that long-tailed recognition suffers from both sample number and category similarity. Intuitively, using a toy example, we first show that sample number is not the unique influence factor for performance dropping of long-tailed recognition. Theoretically, we demonstrate that (1) category similarity, as an inevitable factor, would also influence the model learning under long-tailed distribution via similar samples, (2) using more discriminative representation methods (e.g., self-supervised learning) for similarity reduction, the classifier bias can be further alleviated with greatly improved performance. Extensive experiments on several long-tailed datasets verify the rationality of our theoretical analysis, and show that based on existing state-of-the-arts (SOTAs), the performance could be further improved by similarity reduction. Our investigations highlight the essence behind the long-tailed problem, and claim several feasible directions for future work.

cs.CV↗

arXiv2022

An LSTM-Aided Hybrid Random Access Scheme for 6G Machine Type Communication Networks

In this paper, an LSTM-aided hybrid random access scheme (LSTMH-RA) is proposed to support diverse quality of service (QoS) requirements in 6G machine-type communication (MTC) networks, where massive MTC (mMTC) devices and ultra-reliable low latency communications (URLLC) devices coexist. In the proposed LSTMH-RA scheme, mMTC devices access the network via a timing advance (TA)-aided four-step procedure to meet massive access requirement, while the access procedure of the URLLC devices is completed in two steps coupled with the mMTC devices' access procedure to reduce latency. Furthermore, we propose an attention-based LSTM prediction model to predict the number of active URLLC devices, thereby determining the parameters of the multi-user detection algorithm to guarantee the latency and reliability access requirements of URLLC devices. We analyze the successful access probability of the LSTMH-RA scheme. Numerical results show that, compared with the benchmark schemes, the proposed LSTMH-RA scheme can significantly improve the successful access probability, and thus satisfy the diverse QoS requirements of URLLC and mMTC devices.

eess.SP↗

arXiv2022

QuCloud+: A Holistic Qubit Mapping Scheme for Single/Multi-programming on 2D/3D NISQ Quantum Computers

Qubit mapping is essential to quantum computing's fidelity and quantum computers' resource utilization. Yet, the existing qubit mapping schemes meet some challenges (e.g., crosstalk, SWAP overheads, diverse device topologies, etc.), leading to qubit resource under-utilization, high error rate, and low fidelity in computing results. This paper presents QuCloud+, a new qubit mapping scheme capable of handling these challenges. QuCloud+ has several new designs. (1) QuCloud+ enables multi-programming quantum computing on quantum chips with 2D/3D topology. (2) It partitions physical qubits for concurrent quantum programs with the crosstalk-aware community detection technique and further allocates qubits according to qubit degree, improving fidelity and resource utilization. (3) QuCloud+ includes an X-SWAP mechanism that avoids SWAPs with high crosstalk errors and enables inter-program SWAPs to reduce the SWAP overheads. (4) QuCloud+ schedules concurrent quantum programs to be mapped and executed based on estimated fidelity for the best practice. QuCloud+ outperforms the previous multi-programming work on various devices by 6.84% on fidelity and saves 40.9% additional gates required during mapping transition.

cs.AR↗

arXiv2022

The $C^0$-convergence at the Neumann boundary for Liouville equations

In this paper, we study the blow-up analysis for a sequence of solutions to the Liouville type equation with exponential Neumann boundary condition. For interior case, i.e. the blow-up point is an interior point, Li \cite{Li} gave a uniform asymptotic estimate. Later, Zhang \cite{Zhang} and Gluck \cite{Gluck} improved Li's estimate in the sense of $C^0$-convergence by using the method of moving planes or classification of solutions of the linearized version of Liouville equation. If the sequence blows up at a boundary point, Bao-Wang-Zhou \cite{Bao-Wang-Zhou} proved a similar asymptotic estimate of Li \cite{Li}. In this paper, we will prove a $C^0$-convergence result in this boundary blow-up process. Our method is different from \cite{Zhang,Gluck}.

math.AP↗

arXiv2022

Capacity Optimal Coded Generalized MU-MIMO

With the complication of future communication scenarios, most conventional signal processing technologies of multi-user multiple-input multiple-output (MU-MIMO) become unreliable, which are designed based on ideal assumptions, such as Gaussian signaling and independent identically distributed (IID) channel matrices. As a result, this paper considers a generalized MU-MIMO (GMU-MIMO) system with more general assumptions, i.e., arbitrarily fixed input distributions, and general unitarily-invariant channel matrices. However, there is still no accurate capacity analysis and capacity optimal transceiver with practical complexity for GMU-MIMO under the constraint of coding. To address these issues, inspired by the replica method, the constrained sum capacity of coded GMU-MIMO with fixed input distribution is calculated by using the celebrated mutual information and minimum mean-square error (MMSE) lemma and the MMSE optimality of orthogonal/vector approximate message passing (OAMP/VAMP). Then, a capacity optimal multiuser OAMP/VAMP receiver is proposed, whose achievable rate is proved to be equal to the constrained sum capacity. Moreover, a design principle of multi-user codes is presented for the multiuser OAMP/VAMP, based on which a kind of practical multi-user low-density parity-check (MU-LDPC) code is designed. Numerical results show that finite-length performances of the proposed MU-LDPC codes with multi-user OAMP/VAMP are about 2 dB away from the constrained sum capacity and outperform those of the existing state-of-art methods.

cs.IT↗

arXiv2022

Memory AMP

Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions. AMP only applies to independent identically distributed (IID) transform matrices, but may become unreliable (e.g., perform poorly or even diverge) for other matrix ensembles, especially for ill-conditioned ones. To solve this issue, orthogonal/vector AMP (OAMP/VAMP) was proposed for general right-unitarily-invariant matrices. However, the Bayes-optimal OAMP/VAMP (BO-OAMP/VAMP) requires a high-complexity linear minimum mean square error (MMSE) estimator. This prevents OAMP/VAMP from being used in large-scale systems. To address the drawbacks of AMP and BO-OAMP/VAMP, this paper offers a memory AMP (MAMP) framework based on the orthogonality principle, which ensures that estimation errors in MAMP are asymptotically IID Gaussian. To realize the required orthogonality for MAMP, we provide an orthogonalization procedure for the local memory estimators. In addition, we propose a Bayes-optimal MAMP (BO-MAMP), in which a long-memory matched filter is used for interference suppression. The complexity of BO-MAMP is comparable to AMP. To asymptotically characterize the performance of BO-MAMP, a state evolution is derived. The relaxation parameters and damping vector in BO-MAMP are optimized based on state evolution. Most crucially, the state evolution of the optimized BO-MAMP converges to the same fixed point as that of the high-complexity BO-OAMP/VAMP for all right-unitarily-invariant matrices, and achieves the Bayes optimal MSE predicted by the replica method if its state evolution has a unique fixed point. Finally, simulations are provided to verify the theoretical results' validity and accuracy.

cs.IT↗

arXiv2022

Sufficient Statistic Memory Approximate Message Passing

Approximate message passing (AMP) type algorithms have been widely used in the signal reconstruction of certain large random linear systems. A key feature of the AMP-type algorithms is that their dynamics can be correctly described by state evolution. However, state evolution does not necessarily guarantee the convergence of iterative algorithms. To solve the convergence problem of AMP-type algorithms in principle, this paper proposes a memory AMP (MAMP) under a sufficient statistic condition, named sufficient statistic MAMP (SS-MAMP). We show that the covariance matrices of SS-MAMP are L-banded and convergent. Given an arbitrary MAMP, we can construct the SS-MAMP by damping, which not only ensures the convergence, but also preserves the orthogonality, i.e., its dynamics can be correctly described by state evolution.

cs.IT↗

arXiv2022

Capacity Optimality of OAMP in Coded Large Unitarily Invariant Systems

This paper investigates a large unitarily invariant system (LUIS) involving a unitarily invariant sensing matrix, an arbitrary fixed signal distribution, and forward error control (FEC) coding. Several area properties are established based on the state evolution of orthogonal approximate message passing (OAMP) in an un-coded LUIS. Under the assumptions that the state evolution for joint OAMP and FEC decoding is correct and the replica method is reliable, we analyze the achievable rate of OAMP. We prove that OAMP reaches the constrained capacity predicted by the replica method of the LUIS with an arbitrary signal distribution based on matched FEC coding. Meanwhile, we elaborate a constrained capacity-achieving coding principle for LUIS, based on which irregular low-density parity-check (LDPC) codes are optimized for binary signaling in the simulation results. We show that OAMP with the optimized codes has significant performance improvement over the un-optimized ones and the well-known Turbo linear MMSE algorithm. For quadrature phase-shift keying (QPSK) modulation, constrained capacity-approaching bit error rate (BER) performances are observed under various channel conditions.

cs.IT↗

arXiv2022

Antarctic Survey Telescope 3-3: Overview, System Performance and Preliminary Observations at Yaoan, Yunnan

The third Antarctic Survey Telescope array instrument at Dome A in Antarctica, the AST3-3 telescope, has been in commissioning from March 2021. We deployed AST3-3 at the Yaoan astronomical station in Yunnan Province for an automatic time-domain survey and follow-up observations with an optimised observation and protection system. The telescope system of AST3-3 is similar to that of AST3-1 and AST3-2, except that it is equipped with a 14K~$ \times$~10K QHY411 CMOS camera. AST3-3 has a field of view of $1.65^\circ \times 1.23^\circ$ and is currently using the $g$ band filter. During commissioning at Yaoan, AST3-3 aims to conduct an extragalactic transient survey, coupled with prompt follow-ups of opportunity targets. In this paper, we present the architecture of the AST3-3 automatic observation system. We demonstrate the data processing of observations by representatives SN 2022eyw and GRB 210420B.

astro-ph.IM↗