# Wei Yu - Institute of Astronomy and Astrophysics

## Contact Details

NameWei Yu |
||

AffiliationInstitute of Astronomy and Astrophysics |
||

CityBeijing |
||

CountryChina |
||

## Pubs By Year |
||

## Pub CategoriesComputer Science - Information Theory (18) Mathematics - Information Theory (18) Mathematics - Metric Geometry (7) Computer Science - Computer Vision and Pattern Recognition (5) Instrumentation and Methods for Astrophysics (4) Computer Science - Networking and Internet Architecture (4) Quantum Physics (3) Cosmology and Nongalactic Astrophysics (3) Computer Science - Data Structures and Algorithms (2) Physics - Materials Science (2) Computer Science - Distributed; Parallel; and Cluster Computing (2) Computer Science - Cryptography and Security (2) Mathematics - Combinatorics (2) Physics - Plasma Physics (2) High Energy Physics - Phenomenology (1) Mathematics - Functional Analysis (1) Computer Science - Artificial Intelligence (1) Statistics - Theory (1) Computer Science - Computational Complexity (1) Physics - Physics and Society (1) Physics - Optics (1) Physics - Superconductivity (1) Computer Science - Information Retrieval (1) High Energy Astrophysical Phenomena (1) Mathematics - Statistics (1) |

## Publications Authored By Wei Yu

This paper presents the first study on forecasting human dynamics from static images. The problem is to input a single RGB image and generate a sequence of upcoming human body poses in 3D. To address the problem, we propose the 3D Pose Forecasting Network (3D-PFNet). Read More

In this paper we study the problem of detecting human-object interactions (HOI) in static images, defined as predicting a human and an object bounding box with an interaction class label that connects them. HOI detection is a fundamental problem in computer vision as it provides semantic information about the interactions among the detected objects. We introduce HICO-DET, a new large benchmark for HOI detection, by augmenting the current HICO classification benchmark with instance annotations. Read More

Mobile Crowdsensing is a promising paradigm for ubiquitous sensing, which explores the tremendous data collected by mobile smart devices with prominent spatial-temporal coverage. As a fundamental property of Mobile Crowdsensing Systems, temporally recruited mobile users can provide agile, fine-grained, and economical sensing labors, however their self-interest cannot guarantee the quality of the sensing data, even when there is a fair return. Therefore, a mechanism is required for the system server to recruit well-behaving users for credible sensing, and to stimulate and reward more contributive users based on sensing truth discovery to further increase credible reporting. Read More

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$, $\alpha\in[0,1)$, are called equiangular. The problem of determining the maximum size of $s$-distance sets in various spaces has a long history in mathematics. Read More

Polarization leakage of foreground synchrotron emission is a critical issue in HI intensity mapping experiments. While the sought-after HI emission is unpolarized, polarized foregrounds such as Galactic and extragalactic synchrotron radiation, if coupled with instrumental impurity, can mimic or overwhelm the HI signals. In this paper we present the methodology for polarization calibration at 700-900 MHz, applied on data obtained from the Green Bank Telescope (GBT). Read More

The emergence of interference alignment (IA) as a degrees-of-freedom optimal strategy motivates the need to investigate whether IA can be leveraged to aid conventional network optimization algorithms that are only capable of finding locally optimal solutions. To test the usefulness of IA in this context, this paper proposes a two-stage optimization framework for the downlink of a $G$-cell multi-antenna network with $K$ users/cell. The first stage of the proposed framework focuses on nulling interference from a set of dominant interferers using IA, while the second stage optimizes transmit and receive beamformers to maximize a network-wide utility using the IA solution as the initial condition. Read More

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We derive new upper bounds on the cardinality of equiangular lines. Let us denote the maximum cardinality of equiangular lines in $\mathbb{R}^n$ with the common angle $\arccos \alpha$ by $M_{\alpha}(n)$. Read More

This paper investigates the compress-and-forward scheme for an uplink cloud radio access network (C-RAN) model, where multi-antenna base-stations (BSs) are connected to a cloud-computing based central processor (CP) via capacity-limited fronthaul links. The BSs compress the received signals with Wyner-Ziv coding and send the representation bits to the CP; the CP performs the decoding of all the users' messages. Under this setup, this paper makes progress toward the optimal structure of the fronthaul compression and CP decoding strategies for the compress-and-forward scheme in C-RAN. Read More

There are two fundamentally different fronthaul techniques in the downlink communication of cloud radio access network (C-RAN): the data-sharing strategy and the compression-based strategy. Under the former strategy, each user's message is multicast from the central processor (CP) to all the serving remote radio heads (RRHs) over the fronthaul network, which then cooperatively serve the users through joint beamforming; while under the latter strategy, the user messages are first beamformed then quantized at the CP, and the compressed signal is unicast to the corresponding RRH, which then decompresses its received signal for wireless transmission. Previous works show that in general the compression-based strategy outperforms the data-sharing strategy. Read More

Uplink-downlink duality refers to the fact that the Gaussian broadcast channel has the same capacity region as the dual Gaussian multiple-access channel under the same sumpower constraint. This paper investigates a similar duality relationship between the uplink and downlink of a cloud radio access network (C-RAN), where a central processor (CP) cooperatively serves multiple mobile users through multiple remote radio heads (RRHs) connected to the CP with finite-capacity fronthaul links. The uplink of such a C-RAN model corresponds to a multipleaccess relay channel; the downlink corresponds to a broadcast relay channel. Read More

**Authors:**Kai-Yang Lin, Hiroaki Nishioka, Fu-Cheng Wang, Chih-Wei Locutus Huang, Yu-Wei Liao, Jiun-Huei Proty Wu, Patrick M. Koch, Keiichi Umetsu, Ming-Tang Chen, Shun-Hsiang Chan, Shu-Hao Chang, Wen-Hsuan Lucky Chang, Tai-An Cheng, Hoang Ngoc Duy, Szu-Yuan Fu, Chih-Chiang Han, Solomon Ho, Ming-Feng Ho, Paul T. P. Ho, Yau-De Huang, Homin Jiang, Derek Y. Kubo, Chao-Te Li, Yu-Chiung Lin, Guo-Chin Liu, Pierre Martin-Cocher, Sandor M. Molnar, Emmanuel Nunez, Peter Oshiro, Shang-Ping Pai, Philippe Raffin, Anthony Ridenour, Chia-You Shih, Sara Stoebner, Giap-Siong Teo, Jia-Long Johnny Yeh, Joshua Williams, Mark Birkinshaw

The Yuan-Tseh Lee Array for Microwave Background Anisotropy (AMiBA) is a co-planar interferometer array operating at a wavelength of 3mm to measure the Sunyaev-Zeldovich effect (SZE) of galaxy clusters. In the first phase of operation -- with a compact 7-element array with 0.6m antennas (AMiBA-7) -- we observed six clusters at angular scales from 5\arcmin to 23\arcmin. Read More

This paper considers the joint fronthaul compression and transmit beamforming design for the uplink cloud radio access network (C-RAN), in which multi-antenna user terminals communicate with a cloud-computing based centralized processor (CP) through multi-antenna base-stations (BSs) serving as relay nodes. A compress-and-forward relaying strategy, named the VMAC scheme, is employed, in which the BSs can either perform single-user compression or Wyner-Ziv coding to quantize the received signals and send the quantization bits to the CP via capacity-limited fronthaul links; the CP performs successive decoding with either successive interference cancellation (SIC) receiver or linear minimum-mean-square-error (MMSE) receiver. Under this setup, this paper investigates the joint optimization of the transmit beamformers at the users and the quantization noise covariance matrices at the BSs for maximizing the network utility. Read More

This paper quantifies the benefits and limitations of cooperative communications by providing a statistical analysis of the downlink in network multiple-input multiple-output (MIMO) systems. We consider an idealized model where the multiple-antenna base-stations (BSs) are distributed according to a homogeneous Poisson point process and cooperate by forming disjoint clusters. We assume that perfect channel state information (CSI) is available at the cooperating BSs without any overhead. Read More

The potential of using of millimeter wave (mmWave) frequency for future wireless cellular communication systems has motivated the study of large-scale antenna arrays for achieving highly directional beamforming. However, the conventional fully digital beamforming methods which require one radio frequency (RF) chain per antenna element is not viable for large-scale antenna arrays due to the high cost and high power consumption of RF chain components in high frequencies. To address the challenge of this hardware limitation, this paper considers a hybrid beamforming architecture in which the overall beamformer consists of a low-dimensional digital beamformer followed by an RF beamformer implemented using analog phase shifters. Read More

We have investigated the polarization of attosecond light bursts generated by nanobunches of electrons from relativistic few-cycle laser pulse interaction with the surface of overdense plasmas. Particle-in-cell simulation shows that the polarization state of the generated attosecond burst depends on the incident-pulse polarization, duration, carrier envelope phase, as well as the plasma scale length. Through laser and plasma parameter control, without compromise of generation efficiency, a linearly polarized laser pulse with azimuth $\theta^i=10^\circ$ can generate an elliptically polarized attosecond burst with azimuth $|\theta^r_{\rm atto}|\approx61^\circ$ and ellipticity $\sigma^r_{\rm atto}\approx0. Read More

This paper studies the energy efficiency of the cloud radio access network (C-RAN), specifically focusing on two fundamental and different downlink transmission strategies, namely the data-sharing strategy and the compression strategy. In the data-sharing strategy, the backhaul links connecting the central processor (CP) and the base-stations (BSs) are used to carry user messages -- each user's messages are sent to multiple BSs; the BSs locally form the beamforming vectors then cooperatively transmit the messages to the user. In the compression strategy, the user messages are precoded centrally at the CP, which forwards a compressed version of the analog beamformed signals to the BSs for cooperative transmission. Read More

Cloud Radio Access Network (C-RAN) refers to the virtualization of base station functionalities by means of cloud computing. This results in a novel cellular architecture in which low-cost wireless access points, known as radio units (RUs) or remote radio heads (RRHs), are centrally managed by a reconfigurable centralized "cloud", or central, unit (CU). C-RAN allows operators to reduce the capital and operating expenses needed to deploy and maintain dense heterogeneous networks. Read More

This paper presents a content-centric transmission design in a cloud radio access network (cloud RAN) by incorporating multicasting and caching. Users requesting a same content form a multicast group and are served by a same cluster of base stations (BSs) cooperatively. Each BS has a local cache and it acquires the requested contents either from its local cache or from the central processor (CP) via backhaul links. Read More

**Authors:**Kiyoshi Masui, Hsiu-Hsien Lin, Jonathan Sievers, Christopher J. Anderson, Tzu-Ching Chang, Xuelei Chen, Apratim Ganguly, Miranda Jarvis, Cheng-Yu Kuo, Yi-Chao Li, Yu-Wei Liao, Maura McLaughlin, Ue-Li Pen, Jeffrey B. Peterson, Alexander Roman, Peter T. Timbie, Tabitha Voytek, Jaswant K. Yadav

Fast Radio Bursts are bright, unresolved, non-repeating, broadband, millisecond flashes, found primarily at high Galactic latitudes, with dispersion measures much larger than expected for a Galactic source. The inferred all-sky burst rate is comparable to the core-collapse supernova rate out to redshift 0.5. Read More

Maximum size of equiangular lines in $\mathbb{R}^{19}$ has been known in the range between 72 to 76 since 1973. Acoording to the nonexistence of strongly regular graph $(75,32,10,16)$ \cite{aza15}, Larmen-Rogers-Seidel Theorem \cite{lar77} and Lemmen-Seidel bounds on equiangular lines with common angle $\frac 1 3$ \cite{lem73}, we can prove that there are no 76 equiangular lines in $\mathbb{R}^{19}$. As a corollary, there is no strongly regular graph $(76,35,18,14)$. Read More

A finite subset $Y$ on the unit sphere $S^{n-1} \subseteq \mathbb{R}^n$ is called a spherical design of harmonic index $t$, if the following condition is satisfied: $\sum_{\mathbf{x}\in Y}f(\mathbf{x})=0$ for all real homogeneous harmonic polynomials $f(x_1,\ldots,x_n)$ of degree $t$. Also, for a subset $T$ of $\mathbb{N} = \{1,2,\cdots \}$, a finite subset $Y\subset S^{n-1}$ is called a spherical design of harmonic index $T,$ if $\sum_{\mathbf{x}\in Y}f(\mathbf{x})=0$ is satisfied for all real homogeneous harmonic polynomials $f(x_1,\ldots,x_n)$ of degree $k$ with $k\in T$. In the present paper we first study Fisher type lower bounds for the sizes of spherical designs of harmonic index $t$ (or for harmonic index $T$). Read More

This paper discussed some job scheduling algorithms for Hadoop platform, and proposed a jobs scheduling optimization algorithm based on Bayes Classification viewing the shortcoming of those algorithms which are used. The proposed algorithm can be summarized as follows. In the scheduling algorithm based on Bayes Classification, the jobs in job queue will be classified into bad job and good job by Bayes Classification, when JobTracker gets task request, it will select a good job from job queue, and select tasks from good job to allocate JobTracker, then the execution result will feedback to the JobTracker. Read More

A cavity QED implementation of the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with nitrogen-vacancy centers coupled commonly to the whispering-gallery mode of a microsphere cavity, where a universal set of quantum gates can be realized on the qubits. In our implementation, with the assistant of the appropriate driving fields, the quantum evolution is insensitive to the cavity field state, which is only virtually excited. The implemented non-adiabatic holonomies, utilizing optical transitions in the {\Lambda} type of three-level configuration of the nitrogen-vacancy centers, can be used to construct a universal set of quantum gates on the encoded logical qubits. Read More

Multicast transmission and wireless caching are effective ways of reducing air and backhaul traffic load in wireless networks. This paper proposes to incorporate these two key ideas for content-centric multicast transmission in a cloud radio access network (RAN) where multiple base stations (BSs) are connected to a central processor (CP) via finite-capacity backhaul links. Each BS has a cache with finite storage size and is equipped with multiple antennas. Read More

For several decades, image restoration remains an active research topic in low-level computer vision and hence new approaches are constantly emerging. However, many recently proposed algorithms achieve state-of-the-art performance only at the expense of very high computation time, which clearly limits their practical relevance. In this work, we propose a simple but effective approach with both high computational efficiency and high restoration quality. Read More

As a qubit usually has a limited lifetime, its manipulation should be as fast as possible, and thus non-adiabatic operation is more preferable. Moreover, as a qubit inevitably interacts with its surrounding environment, robust operations are of great significance. Here, we propose a scheme for quantum manipulation of the polariton qubit in circuit QED using non-adiabatic holonomy, which is inherently fast and robust. Read More

Ranking problem has attracted much attention in real systems. How to design a robust ranking method is especially significant for online rating systems under the threat of spamming attacks. By building reputation systems for users, many well-performed ranking methods have been applied to address this issue. Read More

Convolutional Neural Networks (CNNs) have achieved comparable error rates to well-trained human on ILSVRC2014 image classification task. To achieve better performance, the complexity of CNNs is continually increasing with deeper and bigger architectures. Though CNNs achieved promising external classification behavior, understanding of their internal work mechanism is still limited. Read More

The joint user association and spectrum allocation problem is studied for multi-tier heterogeneous networks (HetNets) in both downlink and uplink in the interference-limited regime. Users are associated with base-stations (BSs) based on the biased downlink received power. Spectrum is either shared or orthogonally partitioned among the tiers. Read More

This paper considers a downlink cloud radio access network (C-RAN) in which all the base-stations (BSs) are connected to a central computing cloud via digital backhaul links with finite capacities. Each user is associated with a user-centric cluster of BSs; the central processor shares the user's data with the BSs in the cluster, which then cooperatively serve the user through joint beamforming. Under this setup, this paper investigates the user scheduling, BS clustering and beamforming design problem from a network utility maximization perspective. Read More

We give a new upper bound of the cardinality of a set of equiangular lines in $\R^n$ with a fixed angle $\theta$ for each $(n,\theta)$ satisfying certain conditions. Our techniques are based on semi-definite programming methods for spherical codes introduced by Bachoc--Vallentin [J.Amer. Read More

This paper compares two important downlink multicell interference mitigation techniques, namely, large-scale (LS) multiple-input multiple-output (MIMO) and network MIMO. We consider a cooperative wireless cellular system operating in time-division duplex (TDD) mode, wherein each cooperating cluster includes $B$ base-stations (BSs), each equipped with multiple antennas and scheduling $K$ single-antenna users. In an LS-MIMO system, each BS employs $BM$ antennas not only to serve its scheduled users, but also to null out interference caused to the other users within the cooperating cluster using zero-forcing (ZF) beamforming. Read More

This paper considers the optimization of the user and base-station (BS) association in a wireless downlink heterogeneous cellular network under the proportional fairness criterion. We first consider the case where each BS has a single antenna and transmits at fixed power, and propose a distributed price update strategy for a pricing-based user association scheme, in which the users are assigned to the BS based on the value of a utility function minus a price. The proposed price update algorithm is based on a coordinate descent method for solving the dual of the network utility maximization problem, and it has a rigorous performance guarantee. Read More

Sliced inverse regression (Duan and Li [Ann. Statist. 19 (1991) 505-530], Li [J. Read More

A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne -b,$ then a two-distance set that forms a tight frame for $\mathbb{R}^n$ is a spherical embedding of a strongly regular graph, and every strongly regular graph gives rise to two-distance tight frames through standard spherical embeddings. Together with an earlier work by S. Read More

Image retrieval refers to finding relevant images from an image database for a query, which is considered difficult for the gap between low-level representation of images and high-level representation of queries. Recently further developed Deep Neural Network sheds light on automatically learning high-level image representation from raw pixels. In this paper, we proposed a multi-task DNN learned for image retrieval, which contains two parts, i. Read More

This paper investigates the symmetric degrees of freedom (DoF) of MIMO cellular networks with G cells and K users per cell, having N antennas at each base station and M antennas at each user. In particular, we investigate achievability techniques based on either decomposition with asymptotic interference alignment (IA) or linear beamforming schemes, and show that there are distinct regimes of (G,K,M,N) where one outperforms the other. We first note that both one-sided and two-sided decomposition with asymptotic IA achieve the same degrees of freedom. Read More

In this paper, we investigate $\tau^- \to e^-(\mu^-) K\bar{K}(K\bar{K}=K ^+K^-,K^0\bar{K}^0)$ decays in the framework of the RPV SUSY model. We discuss the tree level contribution of the sparticles $\tilde{\nu}$ and $\tilde{u}$ to these decay branching ratios. In the two channels, the $\tilde{\nu}$-mediated channel is more sensitive to the parameter product $|\lambda^{'*}_{i22}\lambda_{i31(2)}|$ than the $\tilde{u}$-mediated channel to $|\lambda^{'*}_{1(2)j2}\lambda'_{3j2}|$. Read More

Helium bubbles nucleation and growth in metals or metal tritide is a long-standing problem attracting considerable attention in nuclear industry but the mechanism remains indistinct and predicting the growth rate of helium bubble is inexistence still up to new. Here, the rate of helium bubbles nucleation and growth in metal tritide is developed based on a dynamical model, which describes the diameter of helium bubbles increasing linearly as t**(1/3) in titanium tritide at room temperature, agreeing quite well with the experimental phenomenon. The way of reducing storage temperature from 300 to 225 K or increasing the helium atoms diffusion barrier from 0. Read More

A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming to improve the upper bounds on this quantity. Improvements are obtained in dimensions $24 \leq n \leq 136$. Read More

We investigate bulk ion heating in solid buried layer targets irradiated by ultra-short laser pulses of relativistic intensities using particle-in-cell simulations. Our study focuses on a CD2-Al-CD2 sandwich target geometry. We find enhanced deuteron ion heating in a layer compressed by the expanding aluminium layer. Read More

Based on integrated infrastructure of resource sharing and computing in distributed environment, cloud computing involves the provision of dynamically scalable and provides virtualized resources as services over the Internet. These applications also bring a large scale heterogeneous and distributed information which pose a great challenge in terms of the semantic ambiguity. It is critical for application services in cloud computing environment to provide users intelligent service and precise information. Read More

**Authors:**Yu-Wei Liao, Kai-Yang Lin, Yau-De Huang, Jiun-Huei Proty Wu, Paul T. P. Ho, Ming-Tang Chen, Chih-Wei Locutus Huang, Patrick M. Koch, Hiroaki Nishioka, Tai-An Cheng, Szu-Yuan Fu, Guo-Chin Liu, Sandor M. Molnar, Keiichi Umetsu, Fu-Cheng Wang, Yu-Yen Chang, Chih-Chiang Han, Chao-Te Li, Pierre Martin-Cocher, Peter Oshiro

We present a new way to solve the platform deformation problem of co-planar interferometers. The platform of a co-planar interferometer can be deformed due to driving forces and gravity. A deformed platform will induce extra components into the geometric delay of each baseline, and change the phases of observed visibilities. Read More

With the first principles calculations of H and He induced energetics change we demonstrate that in W the accumulation of H (up to 9) and He (up to 4) in a single vacancy (V) surprisingly reduce the formation energy of first and second nearest vacancy (as low as 0 eV), which gives the direct evidence of V-H (He) complex mutation mechanism from V-Hn (Hen) to V2-Hn (Hen) and with the potential to lead to the growth of H (He)-vacancy complexes: an initial step to H and He bubble. This finding well explains the long-standing problem of why H and He bubbles being produced on W surface exposed to low-energy (far lower than displacement threshold energy) D or He ions irradiation. The further identified repulsive (attractive) interaction between V-H12 (V-He14) and additional H (He) illustrates the experimentally observed big difference of deposition depth of H (micron) and He (100 angstrom) bubbles in W even the migration rate of He is far larger than that of H. Read More

This paper studies the uplink of a cloud radio access network (C-RAN) where the cell sites are connected to a cloud-computing-based central processor (CP) with noiseless backhaul links with finite capacities. We employ a simple compress-and-forward scheme in which the base-stations(BSs) quantize the received signals and send the quantized signals to the CP using either distributed Wyner-Ziv coding or single-user compression. The CP decodes the quantization codewords first, then decodes the user messages as if the remote users and the cloud center form a virtual multiple-access channel (VMAC). Read More

Information network analysis has drawn a lot attention in recent years. Among all the aspects of network analysis, similarity measure of nodes has been shown useful in many applications, such as clustering, link prediction and community identification, to name a few. As linkage data in a large network is inherently sparse, it is noted that collecting more data can improve the quality of similarity measure. Read More

This paper studies an uplink multicell joint processing model in which the base-stations are connected to a centralized processing server via rate-limited digital backhaul links. Unlike previous studies where the centralized processor jointly decodes all the source messages from all base-stations, this paper proposes a suboptimal achievability scheme in which the Wyner-Ziv compress-and-forward relaying technique is employed on a per-base-station basis, but successive interference cancellation (SIC) is used at the central processor to mitigate multicell interference. This results in an achievable rate region that is easily computable, in contrast to the joint processing schemes in which the rate regions can only be characterized by exponential number of rate constraints. Read More

A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates of the maximum size of spherical two-distance sets. Exact answers are found for dimensions $n=23$ and $40\le n\le 93\; (n\ne 46,78)$ where previous results gave divergent bounds. Read More

We present an universal way to concentrate an arbitrary $N$-particle less-entangled $W$ state into a maximally entangled $W$ state with different parity check gates. It comprises two protocols. The first protocol is based on the linear optical elements say the partial parity check gate and the second one uses the quantum nondemolition (QND) to construct the complete parity check gate. Read More

In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s. This type of structures was investigated by the recent paper of Bille et al. Let n be the size of a context-free grammar that derives a unique string s of length L. Read More