arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 1,189 records · Page 66Linked to original sources

arXiv2018

UAV-Enabled Radio Access Network: Multi-Mode Communication and Trajectory Design

In this paper, we consider an unmanned aerial vehicle (UAV)-enabled radio access network (RAN) with the UAV acting as an aerial platform to communicate with a set of ground users (GUs) in a variety of modes of practical interest, including data collection in the uplink, data transmission in the downlink, and data relaying between GUs involving both the uplink and downlink. Under this general framework, two UAV operation scenarios are considered: periodic operation, where the UAV serves the GUs in a periodic manner by following a certain trajectory repeatedly, and one-time operation where the UAV serves the GUs with one single fly and then leaves for another mission. In each scenario, we aim to minimize the UAV periodic flight duration or mission completion time, while satisfying the target rate requirement of each GU via a joint UAV trajectory and communication resource allocation design approach. Iterative algorithms are proposed to find efficient locally optimal solutions by utilizing successive convex optimization and block coordinate descent techniques. Moreover, as the quality of the solutions obtained by the proposed algorithms critically depends on the initial UAV trajectory adopted, we propose new methods to design the initial trajectories for both operation scenarios by leveraging the existing results for solving the classic Traveling Salesman Problem (TSP) and Pickup-and-Delivery Problem (PDP). Numerical results show that the proposed trajectory initialization designs lead to significant performance gains compared to the benchmark initialization based on circular trajectory.

cs.IT↗

arXiv2018

#DebateNight: The Role and Influence of Socialbots on Twitter During the 1st 2016 U.S. Presidential Debate

Serious concerns have been raised about the role of 'socialbots' in manipulating public opinion and influencing the outcome of elections by retweeting partisan content to increase its reach. Here we analyze the role and influence of socialbots on Twitter by determining how they contribute to retweet diffusions. We collect a large dataset of tweets during the 1st U.S. Presidential Debate in 2016 (#DebateNight) and we analyze its 1.5 million users from three perspectives: user influence, political behavior (partisanship and engagement) and botness. First, we define a measure of user influence based on the user's active contributions to information diffusions, i.e. their tweets and retweets. Given that Twitter does not expose the retweet structure - it associates all retweets with the original tweet - we model the latent diffusion structure using only tweet time and user features, and we implement a scalable novel approach to estimate influence over all possible unfoldings. Next, we use partisan hashtag analysis to quantify user political polarization and engagement. Finally, we use the BotOrNot API to measure user botness (the likelihood of being a bot). We build a two-dimensional "polarization map" that allows for a nuanced analysis of the interplay between botness, partisanship and influence. We find that not only social bots are more active on Twitter - starting more retweet cascades and retweeting more -- but they are 2.5 times more influential than humans, and more politically engaged. Moreover, pro-Republican bots are both more influential and more politically engaged than their pro-Democrat counterparts. However we caution against blanket statements that software designed to appear human dominates political debates. We find that many highly influential Twitter users are in fact pro-Democrat and that most pro-Republican users are mid-influential and likely to be human (low botness).

cs.SI↗

arXiv2018

Neural Coreference Resolution with Deep Biaffine Attention by Joint Mention Detection and Mention Clustering

Coreference resolution aims to identify in a text all mentions that refer to the same real-world entity. The state-of-the-art end-to-end neural coreference model considers all text spans in a document as potential mentions and learns to link an antecedent for each possible mention. In this paper, we propose to improve the end-to-end coreference resolution system by (1) using a biaffine attention model to get antecedent scores for each possible mention, and (2) jointly optimizing the mention detection accuracy and the mention clustering log-likelihood given the mention cluster labels. Our model achieves the state-of-the-art performance on the CoNLL-2012 Shared Task English test set.

cs.CL↗

arXiv2018

Trajectory Design for Distributed Estimation in UAV Enabled Wireless Sensor Network

In this paper, we study an unmanned aerial vehicle(UAV)-enabled wireless sensor network, where a UAV is dispatched to collect the sensed data from distributed sensor nodes (SNs) for estimating an unknown parameter. It is revealed that in order to minimize the mean square error (MSE) for the estimation, the UAV should collect the data from as many SNs as possible, based on which an optimization problem is formulated to design the UAV's trajectory subject to its practical mobility constraints. Although the problem is non-convex and NP-hard, we show that the optimal UAV trajectory consists of connected line segments only. With this simplification, an efficient suboptimal solution is proposed by leveraging the classic traveling salesman problem (TSP) method and applying convex optimization techniques. Simulation results show that the proposed trajectory design achieves significant performance gains in terms of the number of SNs whose data are successfully collected, as compared to other benchmark schemes.

cs.IT↗

arXiv2018

TypeSQL: Knowledge-based Type-Aware Neural Text-to-SQL Generation

Interacting with relational databases through natural language helps users of any background easily query and analyze a vast amount of data. This requires a system that understands users' questions and converts them to SQL queries automatically. In this paper we present a novel approach, TypeSQL, which views this problem as a slot filling task. Additionally, TypeSQL utilizes type information to better understand rare entities and numbers in natural language questions. We test this idea on the WikiSQL dataset and outperform the prior state-of-the-art by 5.5% in much less time. We also show that accessing the content of databases can significantly improve the performance when users' queries are not well-formed. TypeSQL gets 82.6% accuracy, a 17.5% absolute improvement compared to the previous content-sensitive model.

cs.CL↗

arXiv2018

Cellular-Connected UAV: Potentials, Challenges and Promising Technologies

Enabling high-rate, low-latency and ultra-reliable wireless communications between unmanned aerial vehicles (UAVs) and their associated ground pilots/users is of paramount importance to realize their large-scale usage in the future. To achieve this goal, cellular-connected UAV, whereby UAVs for various applications are integrated into the cellular network as new aerial users, is a promising technology that has drawn significant attention recently. Compared to the conventional cellular communication with terrestrial users, cellular-connected UAV communication possesses substantially different characteristics that bring in new research challenges as well as opportunities. In this article, we provide an overview of this emerging technology, by firstly discussing its potential benefits, unique communication and spectrum requirements, as well as new design considerations. We then introduce promising technologies to enable the future generation of three-dimensional (3D) heterogeneous wireless networks with coexisting aerial and ground users. Last, we present simulation results to corroborate our discussions and highlight key directions for future research.

cs.IT↗

arXiv2018

Energy Minimization for Wireless Communication with Rotary-Wing UAV

This paper studies unmanned aerial vehicle (UAV) enabled wireless communication, where a rotarywing UAV is dispatched to send/collect data to/from multiple ground nodes (GNs). We aim to minimize the total UAV energy consumption, including both propulsion energy and communication related energy, while satisfying the communication throughput requirement of each GN. To this end, we first derive an analytical propulsion power consumption model for rotary-wing UAVs, and then formulate the energy minimization problem by jointly optimizing the UAV trajectory and communication time allocation among GNs, as well as the total mission completion time. The problem is difficult to be optimally solved, as it is non-convex and involves infinitely many variables over time. To tackle this problem, we first consider the simple fly-hover-communicate design, where the UAV successively visits a set of hovering locations and communicates with one corresponding GN when hovering at each location. For this design, we propose an efficient algorithm to optimize the hovering locations and durations, as well as the flying trajectory connecting these hovering locations, by leveraging the travelling salesman problem (TSP) and convex optimization techniques. Next, we consider the general case where the UAV communicates also when flying. We propose a new path discretization method to transform the original problem into a discretized equivalent with a finite number of optimization variables, for which we obtain a locally optimal solution by applying the successive convex approximation (SCA) technique. Numerical results show the significant performance gains of the proposed designs over benchmark schemes, in achieving energy-efficient communication with rotary-wing UAVs.

cs.IT↗

arXiv2018

Consensus-Based Transfer Linear Support Vector Machines for Decentralized Multi-Task Multi-Agent Learning

Transfer learning has been developed to improve the performances of different but related tasks in machine learning. However, such processes become less efficient with the increase of the size of training data and the number of tasks. Moreover, privacy can be violated as some tasks may contain sensitive and private data, which are communicated between nodes and tasks. We propose a consensus-based distributed transfer learning framework, where several tasks aim to find the best linear support vector machine (SVM) classifiers in a distributed network. With alternating direction method of multipliers, tasks can achieve better classification accuracies more efficiently and privately, as each node and each task train with their own data, and only decision variables are transferred between different tasks and nodes. Numerical experiments on MNIST datasets show that the knowledge transferred from the source tasks can be used to decrease the risks of the target tasks that lack training data or have unbalanced training labels. We show that the risks of the target tasks in the nodes without the data of the source tasks can also be reduced using the information transferred from the nodes who contain the data of the source tasks. We also show that the target tasks can enter and leave in real-time without rerunning the whole algorithm.

cs.LG↗

arXiv2018

Cluster-based Wireless Energy Transfer for Low Complex Energy Receivers

This paper proposes a novel channel estimation method and a cluster-based opportunistic scheduling policy, for a wireless energy transfer (WET) system consisting of multiple low-complex energy receivers (ERs) with limited processing capabilities. Firstly, in the training stage, the energy transmitter (ET) obtains a set of Received Signal Strength Indicator (RSSI) feedback values from all ERs, and these values are used to estimate the channels between the ET and all ERs. Next, based on the channel estimates, the ERs are grouped into clusters, and the cluster that has its members closest to its centroid in phase is selected for dedicated WET. The beamformer that maximizes the minimum harvested energy among all ERs in the selected cluster is found by solving a convex optimization problem. All ERs have the same chance of being selected regardless of their distances from the ET, and hence, this scheduling policy can be considered to be opportunistic as well as fair. It is shown that the proposed method achieves significant performance gains over benchmark schemes.

cs.IT↗

arXiv2018

Fundamentals of Wireless Information and Power Transfer: From RF Energy Harvester Models to Signal and System Designs

Radio waves carry both energy and information simultaneously. Nevertheless, Radio-Frequency (RF) transmission of these quantities have traditionally been treated separately. Currently, we are experiencing a paradigm shift in wireless network design, namely unifying wireless transmission of information and power so as to make the best use of the RF spectrum and radiations as well as the network infrastructure for the dual purpose of communicating and energizing. In this paper, we review and discuss recent progress on laying the foundations of the envisioned dual purpose networks by establishing a signal theory and design for Wireless Information and Power Transmission (WIPT) and identifying the fundamental tradeoff between conveying information and power wirelessly. We start with an overview of WIPT challenges and technologies, namely Simultaneous Wireless Information and Power Transfer (SWIPT),Wirelessly Powered Communication Network (WPCN), and Wirelessly Powered Backscatter Communication (WPBC). We then characterize energy harvesters and show how WIPT signal and system designs crucially revolve around the underlying energy harvester model. To that end, we highlight three different energy harvester models, namely one linear model and two nonlinear models, and show how WIPT designs differ for each of them in single-user and multi-user deployments. Topics discussed include rate-energy region characterization, transmitter and receiver architecture, waveform design, modulation, beamforming and input distribution optimizations, resource allocation, and RF spectrum use. We discuss and check the validity of the different energy harvester models and the resulting signal theory and design based on circuit simulations, prototyping and experimentation. We also point out numerous directions that are promising for future research.

cs.IT↗

arXiv2018

Mobile Edge Computing for Cellular-Connected UAV: Computation Offloading and Trajectory Optimization

This paper studies a new mobile edge computing (MEC) setup where an unmanned aerial vehicle (UAV) is served by cellular ground base stations (GBSs) for computation offloading. The UAV flies between a give pair of initial and final locations, during which it needs to accomplish certain computation tasks by offloading them to some selected GBSs along its trajectory for parallel execution. Under this setup, we aim to minimize the UAV's mission completion time by optimizing its trajectory jointly with the computation offloading scheduling, subject to the maximum speed constraint of the UAV, and the computation capacity constraints at GBSs. The joint UAV trajectory and computation offloading optimization problem is, however, non-convex and thus difficult to be solved optimally. To tackle this problem, we propose an efficient algorithm to obtain a high-quality suboptimal solution. Numerical results show that the proposed design significantly reduces the UAV's mission completion time, as compared to benchmark schemes.

cs.IT↗

arXiv2018

Kaon Distribution Amplitude from Lattice QCD and the Flavor SU(3) Symmetry

We present the first lattice-QCD calculation of the kaon distribution amplitude using the large-momentum effective theory (LaMET) approach. The momentum-smearing technique has been implemented to improve signals at large meson momenta. We subtract the power divergence due to Wilson line to high precision using multiple lattice spacings. The kaon structure clearly shows an asymmetry of the distribution amplitude around $x=1/2$, a clear sign of its skewness. We also study the leading SU(3) flavor symmetry breaking relations for the pion, kaon and eta meson distribution amplitudes, and the results are consistent with the prediction from chiral perturbation theory.

hep-ph↗

arXiv2018

A framework with updateable joint images re-ranking for Person Re-identification

Person re-identification plays an important role in realistic video surveillance with increasing demand for public safety. In this paper, we propose a novel framework with rules of updating images for person re-identification in real-world surveillance system. First, Image Pool is generated by using mean-shift tracking method to automatically select video frame fragments of the target person. Second, features extracted from Image Pool by convolutional network work together to re-rank original ranking list of the main image and matching results will be generated. In addition, updating rules are designed for replacing images in Image Pool when a new image satiating with our updating critical formula in video system. These rules fall into two categories: if the new image is from the same camera as the previous updated image, it will replace one of assist images; otherwise, it will replace the main image directly. Experiments are conduced on Market-1501, iLIDS-VID and PRID-2011 and our ITSD datasets to validate that our framework outperforms on rank-1 accuracy and mAP for person re-identification. Furthermore, the update ability of our framework provides consistently remarkable accuracy rate in real-world surveillance system.

cs.CV↗

arXiv2018

Deep Structured Scene Parsing by Learning with Image Descriptions

This paper addresses a fundamental problem of scene understanding: How to parse the scene image into a structured configuration (i.e., a semantic object hierarchy with object interaction relations) that finely accords with human perception. We propose a deep architecture consisting of two networks: i) a convolutional neural network (CNN) extracting the image representation for pixelwise object labeling and ii) a recursive neural network (RNN) discovering the hierarchical object structure and the inter-object relations. Rather than relying on elaborative user annotations (e.g., manually labeling semantic maps and relations), we train our deep model in a weakly-supervised manner by leveraging the descriptive sentences of the training images. Specifically, we decompose each sentence into a semantic tree consisting of nouns and verb phrases, and facilitate these trees discovering the configurations of the training images. Once these scene configurations are determined, then the parameters of both the CNN and RNN are updated accordingly by back propagation. The entire model training is accomplished through an Expectation-Maximization method. Extensive experiments suggest that our model is capable of producing meaningful and structured scene configurations and achieving more favorable scene labeling performance on PASCAL VOC 2012 over other state-of-the-art weakly-supervised methods.

cs.CV↗

arXiv2018

CoMP in the Sky: UAV Placement and Movement Optimization for Multi-User Communications

Driven by the recent advancement in unmanned aerial vehicle (UAV) technology, this paper proposes a new wireless network architecture of \emph{coordinate multipoint (CoMP) in the sky} to harness both the benefits of interference mitigation via CoMP and high mobility of UAVs. Specifically, we consider uplink communications in a multi-UAV enabled multi-user system, where each UAV forwards its received signals from all ground users to a central processor (CP) for joint decoding. Moreover, we consider the case where the users may move on the ground, thus the UAVs need to adjust their locations in accordance with the user locations over time to maximize the network throughput. Utilizing random matrix theory, we first characterize in closed-form a set of approximated upper and lower bounds of the user's achievable rate in each time episode under a realistic line-of-sight (LoS) channel model with random phase, which are shown very tight both analytically and numerically. UAV placement and movement over different episodes are then optimized based on the derived bounds to maximize the minimum of user average achievable rates over all episodes for both cases of full information (of current and future episodes) and current information on the user's movement. Interestingly, it is shown that the optimized location of each UAV at any particular episode is the weighted average of the ground user locations at the current episode as well as its own location at the previous and/or next episode. Finally, simulation results are provided to validate and compare the performance of the proposed UAV placement and movement designs under different practical application scenarios.

cs.IT↗

arXiv2018

Cognitive UAV Communication via Joint Trajectory and Power Control

This paper investigates a new spectrum sharing scenario between unmanned aerial vehicle (UAV) and terrestrial wireless communication systems. We consider that a cognitive/secondary UAV transmitter communicates with a ground secondary receiver (SR), in the presence of a number of primary terrestrial communication links that operate over the same frequency band. We exploit the UAV's controllable mobility via trajectory design, to improve the cognitive UAV communication performance while controlling the co-channel interference at each of the primary receivers (PRs). In particular, we maximize the average achievable rate from the UAV to the SR over a finite mission/communication period by jointly optimizing the UAV trajectory and transmit power allocation, subject to constraints on the UAV's maximum speed, initial/final locations, and average transmit power, as well as a set of interference temperature (IT) constraints imposed at each of the PRs for protecting their communications. However, the joint trajectory and power optimization problem is non-convex and thus difficult to be solved optimally. To tackle this problem, we propose an efficient algorithm that ensures to obtain a locally optimal solution by applying the techniques of alternating optimization and successive convex approximation (SCA). Numerical results show that our proposed joint UAV trajectory and power control scheme significantly enhances the achievable rate of the cognitive UAV communication system, as compared to benchmark schemes.

eess.SP↗

arXiv2018

Collaborative Learning for Weakly Supervised Object Detection

Weakly supervised object detection has recently received much attention, since it only requires image-level labels instead of the bounding-box labels consumed in strongly supervised learning. Nevertheless, the save in labeling expense is usually at the cost of model accuracy. In this paper, we propose a simple but effective weakly supervised collaborative learning framework to resolve this problem, which trains a weakly supervised learner and a strongly supervised learner jointly by enforcing partial feature sharing and prediction consistency. For object detection, taking WSDDN-like architecture as weakly supervised detector sub-network and Faster-RCNN-like architecture as strongly supervised detector sub-network, we propose an end-to-end Weakly Supervised Collaborative Detection Network. As there is no strong supervision available to train the Faster-RCNN-like sub-network, a new prediction consistency loss is defined to enforce consistency of predictions between the two sub-networks as well as within the Faster-RCNN-like sub-networks. At the same time, the two detectors are designed to partially share features to further guarantee the model consistency at perceptual level. Extensive experiments on PASCAL VOC 2007 and 2012 data sets have demonstrated the effectiveness of the proposed framework.

cs.CV↗

arXiv2018

Direct observation of spin excitation anisotropy in the paramagnetic orthorhombic state of BaFe$_{2-x}$Ni$_x$As$_2$

We use transport and inelastic neutron scattering measurements to investigate single crystals of iron pnictide BaFe$_{2-x}$Ni$_{x}$As$_{2}$ ($x=0,0.03$), which exhibit a tetragonal-to-orthorhombic structural transition at $T_s$ and stripe antiferromagnetic order at $T_N$ ($T_s\geq T_N$). Using a tunable uniaxial pressure device, we detwin the crystals and study their transport and spin excitation properties at antiferromagnetic wave vector $S_1(1,0)$ and its 90$^\circ$ rotated wave vector $S_2(0,1)$ under different pressure conditions. We find that uniaxial pressure necessary to detwin and maintain single domain orthorhombic antiferromagnetic phase of BaFe$_{2-x}$Ni$_{x}$As$_{2}$ induces resistivity and spin excitation anisotropy at temperatures above zero pressure $T_s$. In uniaxial pressure-free detwinned sample, spin excitation anisotropy between $S_1(1,0)$ and $S_2(0,1)$ first appear in the paramagnetic orthorhombic phase below $T_s$. These results are consistent with predictions of spin nematic theory, suggesting the absence of structural or nematic phase transition above $T_s$ in iron pnictides.

cond-mat.supr-con↗