Beijing University of Posts and Telecommunications

About: Beijing University of Posts and Telecommunications is a education organization based out in Beijing, Beijing, China. It is known for research contribution in the topics: MIMO & Quality of service. The organization has 39576 authors who have published 41525 publications receiving 403759 citations. The organization is also known as: BUPT.

Knowledge-Driven Service Offloading Decision for Vehicular Edge Computing: A Deep Reinforcement Learning Approach

Abstract: The smart vehicles construct Internet of Vehicle (IoV), which can execute various intelligent services. Although the computation capability of a vehicle is limited, multi-type of edge computing nodes provide heterogeneous resources for intelligent vehicular services. When offloading the complex service to the vehicular edge computing node, the decision for its destination should be considered according to numerous factors. This paper mostly formulate the offloading decision as a resource scheduling problem with single or multiple objective function and constraints, where some customized heuristics algorithms are explored. However, offloading multiple data dependence tasks in a complex service is a difficult decision, as an optimal solution must understand the resource requirement, the access network, the user mobility, and importantly the data dependence. Inspired by recent advances in machine learning, we propose a knowledge driven (KD) service offloading decision framework for IoV, which provides the optimal policy directly from the environment. We formulate the offloading decision for the multiple tasks as a long-term planning problem, and explore the recent deep reinforcement learning to obtain the optimal solution. It can scruple the future data dependence of the following tasks when making decision for a current task from the learned offloading knowledge. Moreover, the framework supports the pre-training at the powerful edge computing node and continually online learning when the vehicular service is executed, so that it can adapt the environment changes and can learn policy that are sensible in foresight. The simulation results show that KD service offloading decision converges quickly, adapts to different conditions, and outperforms a greedy offloading decision algorithm.

Integrated Sensing and Communications: Towards Dual-functional Wireless Networks for 6G and Beyond

Abstract: As the standardization of 5G is being solidified, researchers are speculating what 6G will be. Integrating sensing functionality is emerging as a key feature of the 6G Radio Access Network (RAN), allowing to exploit the dense cell infrastructure of 5G for constructing a perceptive network. In this paper, we provide a comprehensive overview on the background, range of key applications and state-of-the-art approaches of Integrated Sensing and Communications (ISAC). We commence by discussing the interplay between sensing and communications (S&C) from a historical point of view, and then consider multiple facets of ISAC and its performance gains. By introducing both ongoing and potential use cases, we shed light on industrial progress and standardization activities related to ISAC. We analyze a number of performance tradeoffs between S&C, spanning from information theoretical limits, tradeoffs in physical layer performance, to the tradeoff in cross-layer designs. Next, we discuss signal processing aspects of ISAC, namely ISAC waveform design and receive signal processing. As a step further, we provide our vision on the deeper integration between S&C within the framework of perceptive networks, where the two functionalities are expected to mutually assist each other, i.e., communication-assisted sensing and sensing-assisted communications. Finally, we summarize the paper by identifying the potential integration between ISAC and other emerging communication technologies, and their positive impact on the future of wireless networks.

A Depression Detection Model Based on Sentiment Analysis in Micro-blog Social Network

Abstract: Datasets originating from social networks are valuable to many fields such as sociology and psychology. But the supports from technical perspective are far from enough, and specific approaches are urgently in need. This paper applies data mining to psychology area for detecting depressed users in social network services. Firstly, a sentiment analysis method is proposed utilizing vocabulary and man-made rules to calculate the depression inclination of each micro-blog. Secondly, a depression detection model is constructed based on the proposed method and 10 features of depressed users derived from psychological research. Then 180 users and 3 kinds of classifiers are used to verify the model, whose precisions are all around 80%. Also, the significance of each feature is analyzed. Lastly, an application is developed within the proposed model for mental health monitoring online. This study is supported by some psychologists, and facilitates them in data-centric aspect in turn.

IEEE 802.11 distributed coordination function (DCF): analysis and enhancement

Abstract: Being a part of IEEE project 802, the 802.11 medium access control (MAC) is used to support asynchronous and time bounded delivery of radio data packets. It is proposed that a distributed coordination function (DCF), which uses carrier sense multiple access with collision avoidance (CSMA/CA) and binary slotted exponential backoff, be the basis of the IEEE 802.11 WLAN MAC protocols. This paper proposes a throughput enhancement mechanism for DCF by adjusting the contention window (CW) resetting scheme. Moreover, an analytical model based on Markov chain is introduced to compute the enhanced throughput of 802.11 DCF. The accuracy of the model and the enhancement of the proposed scheme are verified by elaborate simulations.

New results on Hermitian matrix rank-one decomposition

Abstract: In this paper, we present several new rank-one decomposition theorems for Hermitian positive semidefinite matrices, which generalize our previous results in Huang and Zhang (Math Oper Res 32(3):758–768, 2007), Ai and Zhang (SIAM J Optim 19(4):1735–1756, 2009). The new matrix rank-one decomposition theorems appear to have wide applications in theory as well as in practice. On the theoretical side, for example, we show how to further extend some of the classical results including a lemma due to Yuan (Math Program 47:53–63, 1990), the classical results on the convexity of the joint numerical ranges (Pang and Zhang in Unpublished Manuscript, 2004; Au-Yeung and Poon in Southeast Asian Bull Math 3:85–92, 1979), and the so-called Finsler’s lemma (Bohnenblust in Unpublished Manuscript; Au-Yeung and Poon in Southeast Asian Bull Math 3:85–92, 1979). On the practical side, we show that the new results can be applied to solve two typical problems in signal processing and communication: one for radar code optimization and the other for robust beamforming. The new matrix decomposition theorems are proven by construction in this paper, and we demonstrate that the constructive procedures can be implemented efficiently, stably, and accurately. The URL of our Matlab programs is given in this paper. We strongly believe that the new decomposition procedures, as a means to solve non-convex quadratic optimization with a few quadratic constraints, are useful for many other potential engineering applications.