Searcharxiv⌕ Search

arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 1,171 records · Page 65Linked to original sources

Gravity and Spin Forces in Gravitational Quantum Field Theory

In the new framework of gravitational quantum field theory (GQFT) with spin and scaling gauge invariance developed in Phys. Rev. D\textbf{93} (2016) 024012-1~\cite{Wu:2015wwa}, we make a perturbative expansion for the full action in a background field which accounts for the early inflationary universe. We decompose the bicovariant vector fields of gravifield and spin gauge field with Lorentz and spin symmetries SO(1,3) and SP(1,3) in biframe spacetime into SO(3) representations for deriving the propagators of the basic quantum fields and extract their interaction terms. The leading order Feynman rules are presented. A tree-level 2 to 2 scattering amplitude of the Dirac fermions, through a gravifield and a spin gauge field, is calculated and compared to the Born approximation of the potential. It is shown that the Newton's gravitational law in the early universe is modified due to the background field. The spin dependence of the gravitational potential is demonstrated.

physics.gen-ph↗

Measurement of tW differential cross-sections with ATLAS at 13 TeV

The cross-section to produce a $W$ boson in association with a top quark is measured differentially with respect to several particle-level final-state observable quantities. The measurements are performed using $36.1$~\mbox{fb$^{-1}$} of $pp$ collision data at $\sqrt{s}=13~\mathrm{TeV}$ collected in 2015 and 2016, by the ATLAS detector at the LHC. Cross-sections are measured in a fiducial phase-space defined by the presence of two charged leptons and exactly one jet identified as containing $B$ hadrons. Measurements are normalised to the fiducial cross-section, causing several of the main uncertainties to cancel. The results are found to be in good agreement with predictions from several Monte Carlo generators.

hep-ex↗

On properties of a class of strong limits for supercritical superprocesses

Suppose that $X=\{X_t, t\ge 0; \mathbb{P}_μ\}$ is a supercritical superprocess in a locally compact separable metric space $E$. Let $ϕ_0$ be a positive eigenfunction corresponding to the first eigenvalue $λ_0$ of the generator of the mean semigroup of $X$. Then $M_t:=e^{-λ_0t}\langleϕ_0, X_t\rangle$ is a positive martingale. Let $M_\infty$ be the limit of $M_t$. It is known that $M_\infty$ is non-degenerate iff the $L\log L$ condition is satisfied. When the $L\log L$ condition may not be satisfied, we recently proved in (arXiv:1708.04422) that there exist a non-negative function $γ_t$ on $[0, \infty)$ and a non-degenerate random variable $W$ such that for any finite nonzero Borel measure $μ$ on $E$, $$ \lim_{t\to\infty}γ_t\langle ϕ_0,X_t\rangle =W,\qquad\mbox{a.s.-}\mathbb{P}_μ. $$ In this paper, we mainly investigate properties of $W$. We prove that $W$ has strictly positive density on $(0,\infty)$. We also investigate the small value probability and tail probability problems of $W$.

math.PR↗

Matrix completion with deterministic pattern - a geometric perspective

We consider the matrix completion problem with a deterministic pattern of observed entries. In this setting, we aim to answer the question: under what condition there will be (at least locally) unique solution to the matrix completion problem, i.e., the underlying true matrix is identifiable. We answer the question from a certain point of view and outline a geometric perspective. We give an algebraically verifiable sufficient condition, which we call the well-posedness condition, for the local uniqueness of MRMC solutions. We argue that this condition is necessary for local stability of MRMC solutions, and we show that the condition is generic using the characteristic rank. We also argue that the low-rank approximation approaches are more stable than MRMC and further propose a sequential statistical testing procedure to determine the "true" rank from observed entries. Finally, we provide numerical examples aimed at verifying validity of the presented theory.

cs.LG↗

Neutron spin resonance as a probe of Fermi surface nesting and superconducting gap symmetry in Ba$_{0.67}$K$_{0.33}$(Fe$_{1-x}$Co$_{x}$)$_{2}$As$_{2}$

We use inelastic neutron scattering to study energy and wave vector dependence of the superconductivity-induced resonance in hole-doped Ba$_{0.67}$K$_{0.33}$(Fe$_{1-x}$Co$_{x}$)$_{2}$As$_{2}$ ($x=0,0.08$ with $T_c\approx 37, 28$ K, respectively). In previous work on electron-doped Ba(Fe$_{0.963}$Ni$_{0.037}$)$_2$As$_2$ ($T_N=26$ K and $T_c=17$ K), the resonance is found to peak sharply at the antiferromagnetic (AF) ordering wave vector ${\bf Q}_{\rm AF}$ along the longitudinal direction, but disperses upwards away from ${\bf Q}_{\rm AF}$ along the transverse direction. For hole doped $x=0, 0.08$ without AF order, we find that the resonance displays ring-like upward dispersion away from ${\bf Q}_{\rm AF}$ along both the longitudinal and transverse directions. By comparing these results with calculations using the random phase approximation, we conclude that the dispersive resonance is a direct signature of isotropic superconducting gaps arising from nested hole-electron Fermi surfaces.

cond-mat.supr-con↗

Multi-Beam UAV Communication in Cellular Uplink: Cooperative Interference Cancellation and Sum-Rate Maximization

Integrating unmanned aerial vehicles (UAVs) into the cellular network as new aerial users is a promising solution to meet their ever-increasing communication demands in a plethora of applications. Due to the high UAV altitude, the channels between UAVs and the ground base stations (GBSs) are dominated by the strong line-of-sight (LoS) links, thus severe interference may be generated to/from the GBSs in the uplink/downlink, which renders the interference management with coexisting terrestrial and aerial users a more challenging problem to solve. In this paper, we study the uplink communication from a multi-antenna UAV to a set of GBSs in its signal coverage region. Among these GBSs, we denote available GBSs as the ones that do not serve any terrestrial users at the assigned resource block (RB) of the UAV, and occupied GBSs as the rest that are serving their respectively associated terrestrial users in the same RB. We propose a new cooperative interference cancellation strategy for the multi-beam UAV uplink communication, which aims to eliminate the co-channel interference at each of the occupied GBSs and in the meanwhile maximize the sum-rate to the available GBSs. Specifically, the multi-antenna UAV sends multiple data streams to selected available GBSs, which in turn forward their decoded data streams to their backhaul-connected occupied GBSs for interference cancellation. To draw useful insights, the maximum degrees-of-freedom (DoF) achievable by the multi-beam UAV communication for sum-rate maximization in the high signal-to-noise ratio (SNR) regime is first characterized, subject to the stringent constraint that all the occupied GBSs do not suffer from any interference in the UAV's uplink transmission. Then, based on the DoF-optimal design, the achievable sum-rate at finite SNR is maximized, subject to given maximum allowable interference power constraints at each occupied GBS.

cs.IT↗

Uplink Channel Estimation and Data Transmission in Millimeter-Wave CRAN with Lens Antenna Arrays

Millimeter-wave (mmWave) communication and network densification hold great promise for achieving high-rate communication in next-generation wireless networks. Cloud radio access network (CRAN), in which low-complexity remote radio heads (RRHs) coordinated by a central unit (CU) are deployed to serve users in a distributed manner, is a cost-effective solution to achieve network densification. However, when operating over a large bandwidth in the mmWave frequencies, the digital fronthaul links in a CRAN would be easily saturated by the large amount of sampled and quantized signals to be transferred between RRHs and the CU. To tackle this challenge, we propose in this paper a new architecture for mmWave-based CRAN with advanced lens antenna arrays at the RRHs. Due to the energy focusing property, lens antenna arrays are effective in exploiting the angular sparsity of mmWave channels, and thus help in substantially reducing the fronthaul rate and simplifying the signal processing at the multi-antenna RRHs and the CU, even when the channels are frequency-selective. We consider the uplink transmission in a mmWave CRAN with lens antenna arrays and propose a low-complexity quantization bit allocation scheme for multiple antennas at each RRH to meet the given fronthaul rate constraint. Further, we propose a channel estimation technique that exploits the energy focusing property of the lens array and can be implemented at the CU with low complexity. Finally, we compare the proposed mmWave CRAN using lens antenna arrays with a conventional CRAN using uniform planar arrays at the RRHs, and show that the proposed design achieves significant throughput gains, yet with much lower complexity.

cs.IT↗

Asynchronous Mobile-Edge Computation Offloading: Energy-Efficient Resource Management

Mobile-edge computation offloading (MECO) is an emerging technology for enhancing mobiles' computation capabilities and prolonging their battery lives, by offloading intensive computation from mobiles to nearby servers such as base stations. In this paper, we study the energy-efficient resource-management policy for the asynchronous MECO system, where the mobiles have heterogeneous input-data arrival time instants and computation deadlines. First, we consider the general case with arbitrary arrival-deadline orders. Based on the monomial energy-consumption model for data transmission, an optimization problem is formulated to minimize the total mobile-energy consumption under the time-sharing and computation-deadline constraints. The optimal resource-management policy for data partitioning (for offloading and local computing) and time division (for transmissions) is shown to be computed by using the block coordinate decent method. To gain further insights, we study the optimal resource-management design for two special cases. First, consider the case of identical arrival-deadline orders, i.e., a mobile with input data arriving earlier also needs to complete computation earlier. The optimization problem is reduced to two sequential problems corresponding to the optimal scheduling order and joint data-partitioning and time-division given the optimal order. It is found that the optimal time-division policy tends to balance the defined effective computing power among offloading mobiles via time sharing. Furthermore, this solution approach is extended to the case of reverse arrival-deadline orders. The corresponding time-division policy is derived by a proposed transformation-and-scheduling approach, which first determines the total offloading duration and data size for each mobile in the transformation phase and then specifies the offloading intervals for each mobile in the scheduling phase.

cs.IT↗

Deep Learning the Effects of Photon Sensors on the Event Reconstruction Performance in an Antineutrino Detector

We provide a fast approach incorporating the usage of deep learning for evaluating the effects of photon sensors in an antineutrino detector on the event reconstruction performance therein. This work is an attempt to harness the power of deep learning for detector designing and upgrade planning. Using the Daya Bay detector as a benchmark case and the vertex reconstruction performance as the objective for the deep neural network, we find that the photomultiplier tubes (PMTs) have different relative importance to the vertex reconstruction. More importantly, the vertex position resolutions for the Daya Bay detector follow approximately a multi-exponential relationship with respect to the number of PMTs and hence, the coverage. This could also assist in deciding on the merits of installing additional PMTs for future detector plans. The approach could easily be used with other objectives in place of vertex reconstruction.

physics.data-an↗

Doping effects of Cr on the physical properties of BaFe$_{1.9-x}$Ni$_{0.1}$Cr$_{x}$As$_{2}$

We present a systematic study on the heavily Cr doped iron pnictides BaFe$_{1.9-x}$Ni$_{0.1}$Cr$_{x}$As$_{2}$ by using elastic neutron scattering, high-resolution synchrotron X-ray diffraction (XRD), resistivity and Hall transport measurements. When the Cr concentration increases from $x=$ 0 to 0.8, neutron diffraction experiments suggest that the collinear antiferromagnetism persists in the whole doping range, where the Néel temperature $T_N$ coincides with the tetragonal-to-orthorhombic structural transition temperature $T_s$, and both of them keeps around 35 K. The magnetic ordered moment, on the other hand, increases within increasing $x$ until $x=$ 0.5, and then decreases with further increasing $x$. Detailed refinement of the powder XRD patterns reveals that the Cr substitutions actually stretch the FeAs$_4$ tetrahedron along the $c-$axis and lift the arsenic height away Fe-Fe plane. Transport results indicate that the charge carriers become more localized upon Cr doping, then changes from electron-type to hole-type around $x=$ 0.5. Our results suggest that the ordered moment and the ordered temperature of static magnetism in iron pnictides can be decoupled and tuned separately by chemical doping.

cond-mat.supr-con↗

Spin Waves in Detwinned BaFe$_2$As$_2$

Understanding magnetic interactions in the parent compounds of high-temperature superconductors forms the basis for determining their role for the mechanism of superconductivity. For parent compounds of iron pnictide superconductors such as $A$Fe$_2$As$_2$ ($A=$ Ba, Ca, Sr), although spin excitations have been mapped out throughout the entire Brillouin zone (BZ), measurements were carried out on twinned samples and did not allow for a conclusive determination of the spin dynamics. Here we use inelastic neutron scattering to completely map out spin excitations of $\sim$100\% detwinned BaFe$_2$As$_2$. By comparing observed spectra with theoretical calculations, we conclude that the spin excitations can be well described by an itinerant model with important contributions from electronic correlations.

cond-mat.supr-con↗

Artwork Identification from Wearable Camera Images for Enhancing Experience of Museum Audiences

Recommendation systems based on image recognition could prove a vital tool in enhancing the experience of museum audiences. However, for practical systems utilizing wearable cameras, a number of challenges exist which affect the quality of image recognition. In this pilot study, we focus on recognition of museum collections by using a wearable camera in three different museum spaces. We discuss the application of wearable cameras, and the practical and technical challenges in devising a robust system that can recognize artworks viewed by the visitors to create a detailed record of their visit. Specifically, to illustrate the impact of different kinds of museum spaces on image recognition, we collect three training datasets of museum exhibits containing variety of paintings, clocks, and sculptures. Subsequently, we equip selected visitors with wearable cameras to capture artworks viewed by them as they stroll along exhibitions. We use Convolutional Neural Networks (CNN) which are pre-trained on the ImageNet dataset and fine-tuned on each of the training sets for the purpose of artwork identification. In the testing stage, we use CNNs to identify artworks captured by the visitors with a wearable camera. We analyze the accuracy of their recognition and provide an insight into the applicability of such a system to further engage audiences with museum exhibitions.

cs.CV↗

Improving Text-to-SQL Evaluation Methodology

To be informative, an evaluation must measure how well systems generalize to realistic unseen data. We identify limitations of and propose improvements to current evaluations of text-to-SQL systems. First, we compare human-generated and automatically generated questions, characterizing properties of queries necessary for real-world applications. To facilitate evaluation on multiple datasets, we release standardized and improved versions of seven existing datasets and one new text-to-SQL dataset. Second, we show that the current division of data into training and test sets measures robustness to variations in the way questions are asked, but only partially tests how well systems generalize to new queries; therefore, we propose a complementary dataset split for evaluation of future work. Finally, we demonstrate how the common practice of anonymizing variables during evaluation removes an important challenge of the task. Our observations highlight key difficulties, and our methodology enables effective measurement of future development.

cs.CL↗

Optimal Resource Allocation in Full-Duplex Ambient Backscatter Communication Networks for Wireless-Powered IoT

This paper considers an ambient backscatter communication (AmBC) network in which a full-duplex access point (FAP) simultaneously transmits downlink orthogonal frequency division multiplexing (OFDM) signals to its legacy user (LU) and receives uplink signals backscattered from multiple BDs in a time-division-multiple-access manner. To maximize the system throughput and ensure fairness, we aim to maximize the minimum throughput among all BDs by jointly optimizing the backscatter time and reflection coefficients of the BDs, and the FAP's subcarrier power allocation, subject to the LU's throughput constraint, the BDs' harvested-energy constraints, and other practical constraints. For the case with a single BD, we obtain closed-form solutions and propose an efficient algorithm by using the Lagrange duality method. For the general case with multiple BDs, we propose an iterative algorithm by leveraging the block coordinated decent and successive convex optimization techniques. We further show the convergence performances of the proposed algorithms and analyze their complexities. In addition, we study the throughput region which characterizes the Pareto-optimal throughput trade-offs among all BDs. Finally, extensive simulation results show that the proposed joint design achieves significant throughput gain as compared to the benchmark schemes.

cs.IT↗

Cyclical Multiple Access in UAV-Aided Communications: A Throughput-Delay Tradeoff

This letter studies a wireless system consisting of distributed ground terminals (GTs) communicating with an unmanned aerial vehicle (UAV) that serves as a mobile base station (BS). The UAV flies cyclically above the GTs at a fixed altitude, which results in a cyclical pattern of the strength of the UAV-GT channels. To exploit such periodic channel variations, we propose a new cyclical multiple access (CMA) scheme to schedule the communications between the UAV and GTs in a cyclical time-division manner based on the flying UAV's position. The time allocations to different GTs are optimized to maximize their minimum throughput. It is revealed that there is a fundamental tradeoff between throughput and access delay in the proposed CMA. Simulation results show significant throughput gains over the case of a static UAV BS in delay-tolerant applications.

cs.IT↗

UAV-Aided Offloading for Cellular Hotspot

In conventional terrestrial cellular networks, mobile terminals (MTs) at the cell edge often pose a performance bottleneck due to their long distances from the serving ground base station (GBS), especially in hotspot period when the GBS is heavily loaded. This paper proposes a new hybrid network architecture by leveraging the use of unmanned aerial vehicle (UAV) as an aerial mobile base station, which flies cyclically along the cell edge to offload data traffic for cell-edge MTs. We aim to maximize the minimum throughput of all MTs by jointly optimizing the UAV's trajectory, bandwidth allocation and user partitioning. We first consider orthogonal spectrum sharing between the UAV and GBS, and then extend to spectrum reuse where the total bandwidth is shared by both the GBS and UAV with their mutual interference effectively avoided. Numerical results show that the proposed hybrid network with optimized spectrum sharing and cyclical multiple access design significantly improves the spatial throughput over the conventional GBS-only network; while the spectrum reuse scheme provides further throughput gains at the cost of slightly higher complexity for interference control. Moreover, compared to the conventional small-cell offloading scheme, the proposed UAV offloading scheme is shown to outperform in terms of throughput, besides saving the infrastructure cost.

cs.IT↗

Fundamental Tradeoffs in Communication and Trajectory Design for UAV-Enabled Wireless Network

The use of unmanned aerial vehicles (UAVs) as aerial communication platforms is of high practical value for future wireless systems such as 5G, especially for swift and on-demand deployment in temporary events and emergency situations. Compared to traditional terrestrial base stations (BSs) in cellular network, UAV-mounted aerial BSs possess stronger line-of-sight (LoS) links with the ground users due to their high altitude as well as high and flexible mobility in three-dimensional (3D) space, which can be exploited to enhance the communication performance. On the other hand, unlike terrestrial BSs that have reliable power supply, aerial BSs in practice have limited on-board energy, but require significant propulsion energy to stay airborne and support high mobility. Motivated by the above new considerations, this article aims to revisit some fundamental tradeoffs in UAV-enabled communication and trajectory design. Specifically, it is shown that communication throughput, delay, and (propulsion) energy consumption can be traded off among each other by adopting different UAV trajectory designs, which sheds new light on their traditional tradeoffs in terrestrial communication. Promising directions for future research are also discussed.

cs.IT↗

Cellular-Enabled UAV Communication: A Connectivity-Constrained Trajectory Optimization Perspective

Integrating the unmanned aerial vehicles (UAVs) into the cellular network is envisioned to be a promising technology to significantly enhance the communication performance of both UAVs and existing terrestrial users. In this paper, we first provide an overview on the two main paradigms in cellular UAV communications, i.e., cellular-enabled UAV communication with UAVs as new aerial users served by the ground base stations (GBSs), and UAV-assisted cellular communication with UAVs as new aerial communication platforms serving the terrestrial users. Then, we focus on the former paradigm and study a new UAV trajectory design problem subject to practical communication connectivity constraints with the GBSs. Specifically, we consider a cellular-connected UAV in the mission of flying from an initial location to a final location, during which it needs to maintain reliable communication with the cellular network by associating with one GBS at each time instant. We aim to minimize the UAV's mission completion time by optimizing its trajectory, subject to a quality-of-connectivity constraint of the GBS-UAV link specified by a minimum receive signal-to-noise ratio target. To tackle this challenging non-convex problem, we first propose a graph connectivity based method to verify its feasibility. Next, by examining the GBS-UAV association sequence over time, we obtain useful structural results on the optimal UAV trajectory, based on which two efficient methods are proposed to find high-quality approximate trajectory solutions by leveraging graph theory and convex optimization techniques. The proposed methods are analytically shown to be capable of achieving a flexible trade-off between complexity and performance, and yielding a solution that is arbitrarily close to the optimal solution in polynomial time. Finally, we make concluding remarks and point out some promising directions for future work.

cs.IT↗