arXiv subjects

Ming Chen

Publications and source records attributed to Ming Chen.

At least 109 records · Page 6Linked to original sources

arXiv2021

Optimization of RIS Configurations for Multiple-RIS-Aided mmWave Positioning Systems based on CRLB Analysis

Reconfigurable intelligent surface (RIS) is a promising technology for future millimeter-wave (mmWave) communication systems. However, its potential benefits of adopting RIS for high-precision positioning in mmWave systems are still less understood. In this paper, we study a multiple-RIS-aided mmWave positioning system and derive the Cram$\rm{\acute{e}}$r-Rao error bound. Based on the derived bound, we optimize the phase shift of the RISs by the particle swarm optimization (PSO) algorithm. Numerical results have demonstrated the advantages of using multiple RISs in enhancing the positioning accuracy in mmWave systems.

eess.SP↗

arXiv2021

Scalable Graph Neural Networks via Bidirectional Propagation

Graph Neural Networks (GNN) is an emerging field for learning on non-Euclidean data. Recently, there has been increased interest in designing GNN that scales to large graphs. Most existing methods use "graph sampling" or "layer-wise sampling" techniques to reduce training time. However, these methods still suffer from degrading performance and scalability problems when applying to graphs with billions of edges. This paper presents GBP, a scalable GNN that utilizes a localized bidirectional propagation process from both the feature vectors and the training/testing nodes. Theoretical analysis shows that GBP is the first method that achieves sub-linear time complexity for both the precomputation and the training phases. An extensive empirical study demonstrates that GBP achieves state-of-the-art performance with significantly less training/testing time. Most notably, GBP can deliver superior performance on a graph with over 60 million nodes and 1.8 billion edges in less than half an hour on a single machine. The codes of GBP can be found at https://github.com/chennnM/GBP .

cs.LG↗

arXiv2021

Lie n-algebras and cohomologies of relative Rota-Baxter operators on n-Lie algebras

Based on the differential graded Lie algebra controlling deformations of an $n$-Lie algebra with a representation (called an n-LieRep pair), we construct a Lie n-algebra, whose Maurer-Cartan elements characterize relative Rota-Baxter operators on n-LieRep pairs. The notion of an n-pre-Lie algebra is introduced, which is the underlying algebraic structure of the relative Rota-Baxter operator. We give the cohomology of relative Rota-Baxter operators and study infinitesimal deformations and extensions of order m deformations to order m+1 deformations of relative Rota-Baxter operators through the cohomology groups of relative Rota-Baxter operators. Moreover, we build the relation between the cohomology groups of relative Rota-Baxter operators on n-LieRep pairs and those on (n+1)-LieRep pairs by certain linear functions.

math.RA↗

arXiv2021

Gorenstein syzygy objects in extriangulated categories

We give the definition of Gorenstein syzygy objects in extriangulated categories and obtain a characterization. For a recollement of extriangulated categories, we mainly show that Gorenstein syzygy objects induce a new Gorenstein syzygy objects under certain conditions, and prove that Gorenstein syzygy objects induce a new Gorenstein syzygy objects under certain conditions.

math.KT↗

arXiv2021

Reconfigurable Intelligent Surfaces for 6G Systems: Principles, Applications, and Research Directions

Reconfigurable intelligent surfaces (RISs) or intelligent reflecting surfaces (IRSs), are regarded as one of the most promising and revolutionizing techniques for enhancing the spectrum and/or energy efficiency of wireless systems. These devices are capable of reconfiguring the wireless propagation environment by carefully tuning the phase shifts of a large number of low-cost passive reflecting elements. In this article, we aim for answering four fundmental questions: 1) Why do we need RISs? 2) What is an RIS? 3) What are RIS's applications? 4) What are the relevant challenges and future research directions? In response, eight promising research directions are pointed out.

eess.SP↗

arXiv2021

Energy Efficient Reconfigurable Intelligent Surface Enabled Mobile Edge Computing Networks with NOMA

Reconfigurable intelligent surface (RIS) has emerged as a promising technology for achieving high spectrum and energy efficiency in future wireless communication networks. In this paper, we investigate an RIS-aided single-cell multi-user mobile edge computing (MEC) system where an RIS is deployed to support the communication between a base station (BS) equipped with MEC servers and multiple single-antenna users. To utilize the scarce frequency resource efficiently, we assume that users communicate with BS based on a non-orthogonal multiple access (NOMA) protocol. Each user has a computation task which can be computed locally or partially/fully offloaded to the BS. We aim to minimize the sum energy consumption of all users by jointly optimizing the passive phase shifters, the size of transmission data, transmission rate, power control, transmission time and the decoding order. Since the resulting problem is non-convex, we use the block coordinate descent method to alternately optimize two separated subproblems. More specifically, we use the dual method to tackle a subproblem with given phase shift and obtain the closed-form solution; and then we utilize penalty method to solve another subproblem for given power control. Moreover, in order to demonstrate the effectiveness of our proposed algorithm, we propose three benchmark schemes: the time-division multiple access (TDMA)-MEC scheme, the full local computing scheme and the full offloading scheme. We use an alternating 1-D search method and the dual method that can solve the TDMA-based transmission problem well. Numerical results demonstrate that the proposed scheme can increase the energy efficiency and achieve significant performance gains over the three benchmark schemes.

cs.IT↗

arXiv2021

FocusNetv2: Imbalanced Large and Small Organ Segmentation with Adversarial Shape Constraint for Head and Neck CT Images

Radiotherapy is a treatment where radiation is used to eliminate cancer cells. The delineation of organs-at-risk (OARs) is a vital step in radiotherapy treatment planning to avoid damage to healthy organs. For nasopharyngeal cancer, more than 20 OARs are needed to be precisely segmented in advance. The challenge of this task lies in complex anatomical structure, low-contrast organ contours, and the extremely imbalanced size between large and small organs. Common segmentation methods that treat them equally would generally lead to inaccurate small-organ labeling. We propose a novel two-stage deep neural network, FocusNetv2, to solve this challenging problem by automatically locating, ROI-pooling, and segmenting small organs with specifically designed small-organ localization and segmentation sub-networks while maintaining the accuracy of large organ segmentation. In addition to our original FocusNet, we employ a novel adversarial shape constraint on small organs to ensure the consistency between estimated small-organ shapes and organ shape prior knowledge. Our proposed framework is extensively tested on both self-collected dataset of 1,164 CT scans and the MICCAI Head and Neck Auto Segmentation Challenge 2015 dataset, which shows superior performance compared with state-of-the-art head and neck OAR segmentation methods.

eess.IV↗

arXiv2021

Joint Location, Bandwidth and Power Optimization for THz-enabled UAV Communications

In this paper, the problem of unmanned aerial vehicle (UAV) deployment, power allocation, and bandwidth allocation is investigated for a UAV-assisted wireless system operating at terahertz (THz) frequencies. In the studied model, one UAV can service ground users using the THz frequency band. However, the highly uncertain THz channel will introduce new challenges to the UAV location, user power, and bandwidth allocation optimization problems. Therefore, it is necessary to design a novel framework to deploy UAVs in the THz wireless systems. This problem is formally posed as an optimization problem whose goal is to minimize the total delays of the uplink and downlink transmissions between the UAV and the ground users by jointly optimizing the deployment of the UAV, the transmit power and the bandwidth of each user. The communication delay is crucial for emergency communications. To tackle this nonconvex delay minimization problem, an alternating algorithm is proposed while iteratively solving three subproblems: location optimization subproblem, power control subproblem, and bandwidth allocation subproblem. Simulation results show that the proposed algorithm can reduce the transmission delay by up to $59.3\%$, $49.8\%$ and $75.5\%$ respectively compared to baseline algorithms that optimize only UAV location, bandwidth allocation or transmit power control.

cs.IT↗

arXiv2021

Infant Cry Classification with Graph Convolutional Networks

We propose an approach of graph convolutional networks for robust infant cry classification. We construct non-fully connected graphs based on the similarities among the relevant nodes in both supervised and semi-supervised node classification with convolutional neural networks to consider the short-term and long-term effects of infant cry signals related to inner-class and inter-class messages. The approach captures the diversity of variations within infant cries, especially for limited training samples. The effectiveness of this approach is evaluated on Baby Chillanto Database and Baby2020 database. With as limited as 20% of labeled training data, our model outperforms that of CNN model with 80% labeled training data and the accuracy stably improves as the number of labeled training samples increases. The best results give significant improvements of 7.36% and 3.59% compared with the results of the CNN models on Baby Chillanto database and Baby2020 database respectively.

eess.AS↗

arXiv2021

Stochastic Density Functional Theory: Real- and Energy-Space Fragmentation for Noise Reduction

Stochastic density functional theory (sDFT) is becoming a valuable tool for studying ground state properties of extended materials. The computational complexity of describing the Kohn-Sham orbitals is replaced by introducing a set of random (stochastic) orbitals leading to linear and often sub-linear scaling of certain ground-state observable at the account of introducing a statistical error. Schemes to reduce the noise are essential, for example, for determining the structure using the forces obtained from sDFT. Recently we have introduced two embedding schemes to mitigate the statistical fluctuations in the electron density and resultant forces on the nuclei. Both techniques were based on fragmenting the system either in real-space or slicing the occupied space into energy windows, allowing for a significant reduction of the statistical fluctuations. For chemical accuracy further reduction of the noise is required, which could be achieved by increasing the number of stochastic orbitals. However, the convergence is relatively slow as the statistical error scales as $1/\sqrt{N_χ}$ according to the central limit theorem, where $N_χ$ is the number of random orbitals. In this paper we combined the aforementioned embedding schemes and introduced a new approach that builds on overlapped fragments and energy windows. The new approach significantly lowers the noise for ground state properties such as the electron density, total energy, and forces on the nuclei, as demonstrated for a G-center in bulk silicon.

physics.chem-ph↗

arXiv2020

Optimal Resource Allocation for Multi-UAV Assisted Visible Light Communication

In this paper, the optimization of deploying unmanned aerial vehicles (UAVs) over a reconfigurable intelligent surfaces (RISs)-assisted visible light communication (VLC) system is studied. In the considered model, UAVs are required to simultaneously provide wireless services as well as illumination for ground users. To meet the traffic and illumination demands of the ground users while minimizing the energy consumption of the UAVs, one must optimize UAV deployment, phase shift of RISs, user association and RIS association. This problem is formulated as an optimization problem whose goal is to minimize the transmit power of UAVs via adjusting UAV deployment, phase shift of RISs, user association and RIS association. To solve this problem, the original optimization problem is divided into four subproblems and an alternating algorithm is proposed. Specifically, phases alignment method and semidefinite program (SDP) algorithm are proposed to optimize the phase shift of RISs. Then, the UAV deployment optimization is solved by the successive convex approximation (SCA) algorithm. Since the problems of user association and RIS association are integer programming, the fraction relaxation method is adopted before using dual method to find the optimal solution. For simplicity, a greedy algorithm is proposed as an alternative to optimize RIS association. The proposed two schemes demonstrate the superior performance of 34:85% and 32:11% energy consumption reduction over the case without RIS, respectively, through extensive numerical study.

cs.IT↗

arXiv2020

WeChat Neural Machine Translation Systems for WMT20

We participate in the WMT 2020 shared news translation task on Chinese to English. Our system is based on the Transformer (Vaswani et al., 2017a) with effective variants and the DTMT (Meng and Zhang, 2019) architecture. In our experiments, we employ data selection, several synthetic data generation approaches (i.e., back-translation, knowledge distillation, and iterative in-domain knowledge transfer), advanced finetuning approaches and self-bleu based model ensemble. Our constrained Chinese to English system achieves 36.9 case-sensitive BLEU score, which is the highest among all submissions.

cs.CL↗

arXiv2020

Improve black-box sequential anomaly detector relevancy with limited user feedback

Anomaly detectors are often designed to catch statistical anomalies. End-users typically do not have interest in all of the detected outliers, but only those relevant to their application. Given an existing black-box sequential anomaly detector, this paper proposes a method to improve its user relevancy using a small number of human feedback. As our first contribution, the method is agnostic to the detector: it only assumes access to its anomaly scores, without requirement on any additional information inside it. Inspired by a fact that anomalies are of different types, our approach identifies these types and utilizes user feedback to assign relevancy to types. This relevancy score, as our second contribution, is used to adjust the subsequent anomaly selection process. Empirical results on synthetic and real-world datasets show that our approach yields significant improvements on precision and recall over a range of anomaly detectors.

stat.ML↗

arXiv2020

SBAT: Video Captioning with Sparse Boundary-Aware Transformer

In this paper, we focus on the problem of applying the transformer structure to video captioning effectively. The vanilla transformer is proposed for uni-modal language generation task such as machine translation. However, video captioning is a multimodal learning problem, and the video features have much redundancy between different time steps. Based on these concerns, we propose a novel method called sparse boundary-aware transformer (SBAT) to reduce the redundancy in video representation. SBAT employs boundary-aware pooling operation for scores from multihead attention and selects diverse features from different scenarios. Also, SBAT includes a local correlation scheme to compensate for the local information loss brought by sparse operation. Based on SBAT, we further propose an aligned cross-modal encoding scheme to boost the multimodal interaction. Experimental results on two benchmark datasets show that SBAT outperforms the state-of-the-art methods under most of the metrics.

cs.CV↗

arXiv2020

Simple and Deep Graph Convolutional Networks

Graph convolutional networks (GCNs) are a powerful deep learning approach for graph-structured data. Recently, GCNs and subsequent variants have shown superior performance in various application areas on real-world datasets. Despite their success, most of the current GCN models are shallow, due to the {\em over-smoothing} problem. In this paper, we study the problem of designing and analyzing deep graph convolutional networks. We propose the GCNII, an extension of the vanilla GCN model with two simple yet effective techniques: {\em Initial residual} and {\em Identity mapping}. We provide theoretical and empirical evidence that the two techniques effectively relieves the problem of over-smoothing. Our experiments show that the deep GCNII model outperforms the state-of-the-art methods on various semi- and full-supervised tasks. Code is available at https://github.com/chennnM/GCNII .

cs.LG↗

arXiv2020

Reflections in the Sky: Joint Trajectory and Passive Beamforming Design for Secure UAV Networks with Reconfigurable Intelligent Surface

This paper investigates the problem of secure energy efficiency maximization for a reconfigurable intelligent surface (RIS) assisted uplink wireless communication system, where an unmanned aerial vehicle (UAV) equipped with an RIS works as a mobile relay between the base station (BS) and a group of users. We focus on maximizing the secure energy efficiency of the system via jointly optimizing the UAV's trajectory, the RIS's phase shift, users' association and transmit power. To tackle this problem, we divide the original problem into three sub-problems, and propose an efficient iterative algorithm. In particular, the successive convex approximation method (SCA) is applied to solve the nonconvex UAV trajectory, the RIS's phase shift, and transmit power optimization sub-problems. We further provide two schemes to simplify the solution of phase and trajectory sub-problem. Simulation results demonstrate that the proposed algorithm converges fast, and the proposed design can enhance the secure energy efficiency by up to 38\% gains, as compared to the traditional schemes without any RIS.

eess.SP↗

arXiv2020

Cooperative Rate-Splitting for Secrecy Sum-Rate Enhancement in Multi-antenna Broadcast Channels

In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and time-slot allocation are jointly optimized by solving the non-convex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in multi-antenna BC systems.

eess.SP↗

arXiv2020

Range-Separated Stochastic Resolution of Identity: Formulation and Application to Second Order Green's Function Theory

We develop a range-separated stochastic resolution of identity approach for the $4$-index electron repulsion integrals, where the larger terms (above a predefined threshold) are treated using a deterministic resolution of identity and the remaining terms are treated using a stochastic resolution of identity. The approach is implemented within a second-order Greens function formalism with an improved $O(N^3)$ scaling with the size of the basis set, $N$. Moreover, the range-separated approach greatly reduces the statistical error compared to the full stochastic version ({\it J. Chem. Phys.} {\bf 151}, 044144 (2019)), resulting in computational speedups of ground and excited state energies of nearly two orders of magnitude, as demonstrated for hydrogen dimer chains.

physics.chem-ph↗