arXiv subjects

Yong Zhou

Publications and source records attributed to Yong Zhou.

At least 127 records · Page 7Linked to original sources

arXiv2021

Over-the-Air Computation via Reconfigurable Intelligent Surface

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bottlenecked by the worst channel condition among all links between the IoT devices and the access point. In this paper, a reconfigurable intelligent surface (RIS) assisted AirComp system is proposed to boost the received signal power and thus mitigate the performance bottleneck by reconfiguring the propagation channels. With an objective to minimize the AirComp distortion, we propose a joint design of AirComp transceivers and RIS phase-shifts, which however turns out to be a highly intractable non-convex programming problem. To this end, we develop a novel alternating minimization framework in conjunction with the successive convex approximation technique, which is proved to converge monotonically. To reduce the computational complexity, we transform the subproblem in each alternation as a smooth convex-concave saddle point problem, which is then tackled by proposing a Mirror-Prox method that only involves a sequence of closed-form updates. Simulations show that the computation time of the proposed algorithm can be two orders of magnitude smaller than that of the state-of-the-art algorithms, while achieving a similar distortion performance.

eess.SP↗

arXiv2021

The KOALA Experiment for (anti)proton-proton Elastic Scattering

The KOALA experiment measures the differential cross section of (anti)proton-proton elastic scattering over a wide range of four-momentum transfer squared 0.0008 < |t| < 0.1 (GeV/c)$^2$ . The forward scattering parameters and the absolute luminosity can be deduced by analyzing the characteristic shape of the differential cross-section spectrum. The experiment is based on fixed target kinematics and uses an internal hydrogen cluster jet target. The wide range of |t| is achieved by measuring the total kinetic energy of the recoil protons near 90° with a recoil detector, which consists of silicon and germanium single-sided strip sensors. The energy resolution of the recoil detector is better than 30 keV (FWHM). A forward detector consisting of two layers of plastic scintillators measures the elastically scattered beam particles in the forward direction close to the beam axis. It helps suppress the large background at small recoil angles and improves the identification of elastic scattering events in the low |t| range. The KOALA setup has been installed and commissioned at COSY in order to validate the detector by measuring the proton-proton elastic scattering. The results from this commissioning are presented here.

physics.ins-det↗

arXiv2021

UAV-Assisted Over-the-Air Computation

Over-the-air computation (AirComp) provides a promising way to support ultrafast aggregation of distributed data. However, its performance cannot be guaranteed in long-distance transmission due to the distortion induced by the channel fading and noise. To unleash the full potential of AirComp, this paper proposes to use a low-cost unmanned aerial vehicle (UAV) acting as a mobile base station to assist AirComp systems. Specifically, due to its controllable high-mobility and high-altitude, the UAV can move sufficiently close to the sensors to enable line-of-sight transmission and adaptively adjust all the links' distances, thereby enhancing the signal magnitude alignment and noise suppression. Our goal is to minimize the time-averaging mean-square error for AirComp by jointly optimizing the UAV trajectory, the scaling factor at the UAV, and the transmit power at the sensors, under constraints on the UAV's predetermined locations and flying speed, sensors' average and peak power limits. However, due to the highly coupled optimization variables and time-dependent constraints, the resulting problem is non-convex and challenging. We thus propose an efficient iterative algorithm by applying the block coordinate descent and successive convex optimization techniques. Simulation results verify the convergence of the proposed algorithm and demonstrate the performance gains and robustness of the proposed design compared with benchmarks.

eess.SP↗

arXiv2021

Spatial Focusing of Surface Polaritons Based on Cross-Phase Modulation

We theoretically study the spatial focusing of surface polaritons (SPs) in a negative index metamaterial (NIMM)-atomic gas interface waveguide system, based on cross phase modulation (XPM) in a tripod type double electromagnetically induced transparency (EIT) scheme. In the linear region, we realize the low loss stable propagation of SPs, and the group velocities of the probe and signal fields are well matched via double EIT. In the nonlinear region, we show that giant enhancement of the XPM can be obtained. Using a narrow optical soliton in free space, we realize spatial focusing of the SPs solitons, including bright, multi bright, and dark solitons. The full width at the half-maximum (FWHM) of the SPs soliton can be compressed to about ten nanometers, thus, even nanofucsing can be obtained. The results obtained here have certain theoretical significance for micro-nano optics, and also have application potentials in nano-scale sensing, spectral enhancement and precision measurement.

physics.optics↗

arXiv2021

A new volatility model: GQARCH-Itô model

Volatility asymmetry is a hot topic in high-frequency financial market. In this paper, we propose a new econometric model, which could describe volatility asymmetry based on high-frequency historical data and low-frequency historical data. After providing the quasi-maximum likelihood estimators for the parameters, we establish their asymptotic properties. We also conduct a series of simulation studies to check the finite sample performance and volatility forecasting performance of the proposed methodologies. And an empirical application is demonstrated that the new model has stronger volatility prediction power than GARCH-Itô model in the literature.

stat.ME↗

arXiv2021

Reconfigurable Intelligent Surface for Massive Connectivity

With the rapid development of Internet of Things (IoT), massive machine-type communication has become a promising application scenario, where a large number of devices transmit sporadically to a base station (BS). Reconfigurable intelligent surface (RIS) has been recently proposed as an innovative new technology to achieve energy efficiency and coverage enhancement by establishing favorable signal propagation environments, thereby improving data transmission in massive connectivity. Nevertheless, the BS needs to detect active devices and estimate channels to support data transmission in RIS-assisted massive access systems, which yields unique challenges. This paper shall consider an RIS-assisted uplink IoT network and aims to solve the RIS-related activity detection and channel estimation problem, where the BS detects the active devices and estimates the separated channels of the RIS-to-device link and the RIS-to-BS link. Due to limited scattering between the RIS and the BS, we model the RIS-to-BS channel as a sparse channel. As a result, by simultaneously exploiting both the sparsity of sporadic transmission in massive connectivity and the RIS-to-BS channels, we formulate the RIS-related activity detection and channel estimation problem as a sparse matrix factorization problem. Furthermore, we develop an approximate message passing (AMP) based algorithm to solve the problem based on Bayesian inference framework and reduce the computational complexity by approximating the algorithm with the central limit theorem and Taylor series arguments. Finally, extensive numerical experiments are conducted to verify the effectiveness and improvements of the proposed algorithm.

cs.IT↗

arXiv2021

Optimizing Information Freshness for Cooperative IoT Systems with Stochastic Arrivals

This paper considers a cooperative Internet of Things (IoT) system with a source aiming to transmit randomly generated status updates to a designated destination as timely as possible under the help of a relay. We adopt a recently proposed concept, the age of information (AoI), to characterize the timeliness of the status updates. In the considered system, delivering the status updates via the one-hop direct link will have a shorter transmission time at the cost of incurring a higher error probability, while the delivery of status updates through the two-hop relay link could be more reliable at the cost of suffering longer transmission time. Thus, it is important to design the relaying protocol of the considered system for optimizing the information freshness. Considering the limited capabilities of IoT devices, we propose two low-complexity age-oriented relaying (AoR) protocols, i.e., the source-prioritized AoR (SP-AoR) protocol and the relay-prioritized AoR (RP-AoR) protocol, to reduce the AoI of the considered system. By carefully analyzing the evolution of the instantaneous AoI, we derive closed-form expressions of the average AoI for both proposed AoR protocols. We further optimize the generation probability of the status updates at the source in both protocols. Simulation results validate our theoretical analysis, and demonstrate that the two proposed protocols outperform each other under various system parameters. Moreover, the protocol with better performance can achieve near-optimal performance compared with the optimal scheduling policy attained by applying the Markov decision process (MDP) tool.

cs.IT↗

arXiv2020

Federated Learning via Intelligent Reflecting Surface

Over-the-air computation (AirComp) based federated learning (FL) is capable of achieving fast model aggregation by exploiting the waveform superposition property of multiple access channels. However, the model aggregation performance is severely limited by the unfavorable wireless propagation channels. In this paper, we propose to leverage intelligent reflecting surface (IRS) to achieve fast yet reliable model aggregation for AirComp-based FL. To optimize the learning performance, we formulate an optimization problem that jointly optimizes the device selection, the aggregation beamformer at the base station (BS), and the phase shifts at the IRS to maximize the number of devices participating in the model aggregation of each communication round under certain mean-squared-error (MSE) requirements. To tackle the formulated highly-intractable problem, we propose a two-step optimization framework. Specifically, we induce the sparsity of device selection in the first step, followed by solving a series of MSE minimization problems to find the maximum feasible device set in the second step. We then propose an alternating optimization framework, supported by the difference-of-convex-functions programming algorithm for low-rank optimization, to efficiently design the aggregation beamformers at the BS and phase shifts at the IRS. Simulation results will demonstrate that our proposed algorithm and the deployment of an IRS can achieve a lower training loss and higher FL prediction accuracy than the baseline algorithms.

cs.IT↗

arXiv2020

Fast Convergence Algorithm for Analog Federated Learning

In this paper, we consider federated learning (FL) over a noisy fading multiple access channel (MAC), where an edge server aggregates the local models transmitted by multiple end devices through over-the-air computation (AirComp). To realize efficient analog federated learning over wireless channels, we propose an AirComp-based FedSplit algorithm, where a threshold-based device selection scheme is adopted to achieve reliable local model uploading. In particular, we analyze the performance of the proposed algorithm and prove that the proposed algorithm linearly converges to the optimal solutions under the assumption that the objective function is strongly convex and smooth. We also characterize the robustness of proposed algorithm to the ill-conditioned problems, thereby achieving fast convergence rates and reducing communication rounds. A finite error bound is further provided to reveal the relationship between the convergence behavior and the channel fading and noise. Our algorithm is theoretically and experimentally verified to be much more robust to the ill-conditioned problems with faster convergence compared with other benchmark FL algorithms.

cs.IT↗

arXiv2020

Stochastic Beamforming for Reconfigurable Intelligent Surface Aided Over-the-Air Computation

Over-the-air computation (AirComp) is a promising technology that is capable of achieving fast data aggregation in Internet of Things (IoT) networks. The mean-squared error (MSE) performance of AirComp is bottlenecked by the unfavorable channel conditions. This limitation can be mitigated by deploying a reconfigurable intelligent surface (RIS), which reconfigures the propagation environment to facilitate the receiving power equalization. The achievable performance of RIS relies on the availability of accurate channel state information (CSI), which however is generally difficult to be obtained. In this paper, we consider an RIS-aided AirComp IoT network, where an access point (AP) aggregates sensing data from distributed devices. Without assuming any prior knowledge on the underlying channel distribution, we formulate a stochastic optimization problem to maximize the probability that the MSE is below a certain threshold. The formulated problem turns out to be non-convex and highly intractable. To this end, we propose a data-driven approach to jointly optimize the receive beamforming vector at the AP and the phase-shift vector at the RIS based on historical channel realizations. After smoothing the objective function by adopting the sigmoid function, we develop an alternating stochastic variance reduced gradient (SVRG) algorithm with a fast convergence rate to solve the problem. Simulation results demonstrate the effectiveness of the proposed algorithm and the importance of deploying an RIS in reducing the MSE outage probability.

cs.IT↗

arXiv2020

Reconfigurable Intelligent Surface Assisted Massive MIMO with Antenna Selection

Antenna selection is capable of reducing the hardware complexity of massive multiple-input multiple-output (MIMO) networks at the cost of certain performance degradation. Reconfigurable intelligent surface (RIS) has emerged as a cost-effective technique that can enhance the spectrum-efficiency of wireless networks by reconfiguring the propagation environment. By employing RIS to compensate the performance loss due to antenna selection, in this paper we propose a new network architecture, i.e., RIS-assisted massive MIMO system with antenna selection, to enhance the system performance while enjoying a low hardware cost. This is achieved by maximizing the channel capacity via joint antenna selection and passive beamforming while taking into account the cardinality constraint of active antennas and the unit-modulus constraints of all RIS elements. However, the formulated problem turns out to be highly intractable due to the non-convex constraints and coupled optimization variables, for which an alternating optimization framework is provided, yielding antenna selection and passive beamforming subproblems. The computationally efficient submodular optimization algorithms are developed to solve the antenna selection subproblem under different channel state information assumptions. The iterative algorithms based on block coordinate descent are further proposed for the passive beamforming design by exploiting the unique problem structures. Experimental results will demonstrate the algorithmic advantages and desirable performance of the proposed algorithms for RIS- assisted massive MIMO systems with antenna selection.

cs.IT↗

arXiv2020

On the absence of a universal surface density, and a maximum Newtonian acceleration in dark matter haloes: consequences for MOND

We study the dark matter (DM) surface density using the SPARC sample and {compare} it to Donato et al. (2009) result. By means of MCMC method, we infer the best-fitting parameters for each galaxy. We reobtain the scaling relation between the surface density and luminosity, and several other scaling laws relating the dark matter halo properties to that of the galactic disc properties. We conclude, in contrast with Donato et al. \cite{Donato}, that the dark matter surface density is not a universal (constant) quantity but correlates with the luminosity as well as with other galactic disc properties. A derived posterior probability distribution of $ρ_0 r_0$ shows that the null hypothesis of constancy is rejected at a very high confidence level. These results leave little room for the claimed universality of dark matter surface density. Since MOND has strong prediction on the surface density \cite{Milgrom2009}, we compared our result with those predictions, finding that MOND predictions are violated by data. To strengthen the previous result, we compared our results to another prediction of MOND (Milgrom 2005), the existence of a maximum Newtonian dark matter acceleration in the halo. Also in this case, MOND predictions are in contradiction with data. The dark matter Newtonian acceleration correlates with all the previously presented galactic disc properties, and data are distributed outside the bound predicted by Milgrom $\&$ Sanders (Milgrom 2005). We also find that the null hypothesis (constancy of DM Newtonian acceleration) is rejected at a very high confidence level.

astro-ph.GA↗

arXiv2020

Volatility Analysis with Realized GARCH-Ito Models

This paper introduces a unified approach for modeling high-frequency financial data that can accommodate both the continuous-time jump-diffusion and discrete-time realized GARCH model by embedding the discrete realized GARCH structure in the continuous instantaneous volatility process. The key feature of the proposed model is that the corresponding conditional daily integrated volatility adopts an autoregressive structure where both integrated volatility and jump variation serve as innovations. We name it as the realized GARCH-Ito model. Given the autoregressive structure in the conditional daily integrated volatility, we propose a quasi-likelihood function for parameter estimation and establish its asymptotic properties. To improve the parameter estimation, we propose a joint quasi-likelihood function that is built on the marriage of daily integrated volatility estimated by high-frequency data and nonparametric volatility estimator obtained from option data. We conduct a simulation study to check the finite sample performance of the proposed methodologies and an empirical study with the S&P500 stock index and option data.

stat.ME↗

arXiv2020

Reconfigurable Intelligent Surface Enhanced Cognitive Radio Networks

The cognitive radio (CR) network is a promising network architecture that meets the requirement of enhancing scarce radio spectrum utilization. Meanwhile, reconfigurable intelligent surfaces (RIS) is a promising solution to enhance the energy and spectrum efficiency of wireless networks by properly altering the signal propagation via tuning a large number of passive reflecting units. In this paper, we investigate the downlink transmit power minimization problem for the RIS-enhanced single-cell cognitive radio (CR) network coexisting with a single-cell primary radio (PR) network by jointly optimizing the transmit beamformers at the secondary user (SU) transmitter and the phase shift matrix at the RIS. The investigated problem is a highly intractable due to the coupled optimization variables and unit modulus constraint, for which an alternative minimization framework is presented. Furthermore, a novel difference-of-convex (DC) algorithm is developed to solve the resulting non-convex quadratic program by lifting it into a low-rank matrix optimization problem. We then represent non-convex rank-one constraint as a DC function by exploiting the difference between trace norm and spectral norm. The simulation results validate that our proposed algorithm outperforms the existing state-of-the-art methods.

eess.SP↗

arXiv2020

Outage Minimization for Intelligent Reflecting Surface Aided MISO Communication Systems via Stochastic Beamforming

Intelligent reflecting surface (IRS) has the potential to significantly enhance the network performance by reconfiguring the wireless propagation environments. It is however difficult to obtain the accurate downlink channel state information (CSI) for efficient beamforming design in IRS-aided wireless networks. In this article, we consider an IRS-aided downlink multiple-input single-output (MISO) network, where the base station (BS) is not required to know the underlying channel distribution. We formulate an outage probability minimization problem by jointly optimizing the beamforming vector at the BS and the phase-shift matrix at the IRS, while taking into account the transmit power and unimodular constraints. The formulated problem turns out to be a non-convex non-smooth stochastic optimization problem. To this end, we employ the sigmoid function as the surrogate to tackle the non-smoothness of the objective function. In addition, we propose a data-driven efficient alternating stochastic gradient descent (SGD) algorithm to solve the problem by utilizing the historical channel samples. Simulation results demonstrate the performance gains of the proposed algorithm over the benchmark methods in terms of minimizing the outage probability.

cs.IT↗

arXiv2020

Reconfigurable Intelligent Surface for Interference Alignment in MIMO Device-to-Device Networks

In multiple-input multiple-output (MIMO) device-to-device (D2D) networks, interference and rank-deficient channels are the critical bottlenecks for achieving high degrees of freedom (DoFs). In this paper, we propose a reconfigurable intelligent surface (RIS) assisted interference alignment strategy to simultaneous mitigate the co-channel interference and cope with rank-deficient channels, thereby improving the feasibility of interference alignment conditions and in turn increasing the achievable DoFs. The key enabler is a general low-rank optimization approach that maximizes the achievable DoFs by jointly designing the phase-shift and transceiver matrices. To address the unique challenges of the coupled optimization variables, we develop a block-structured Riemannian pursuit method by solving fixed-rank and unit modulus constrained least square subproblems along with rank increase. Finally, to reduce the computational complexity and achieve good DoF performance, we develop unified Riemannian conjugate gradient algorithms to alternately optimize the fixed-rank transceiver matrix and the unit modulus constrained phase shifter by exploiting the non-compact Stiefel manifold and the complex circle manifold, respectively. Numerical results demonstrate the effectiveness of deploying an RIS and the superiority of the proposed block-structured Riemannian pursuit method in terms of the achievable DoFs and the achievable sum rate.

eess.SP↗

arXiv2020

Vehicle Re-Identification Based on Complementary Features

In this work, we present our solution to the vehicle re-identification (vehicle Re-ID) track in AI City Challenge 2020 (AIC2020). The purpose of vehicle Re-ID is to retrieve the same vehicle appeared across multiple cameras, and it could make a great contribution to the Intelligent Traffic System(ITS) and smart city. Due to the vehicle's orientation, lighting and inter-class similarity, it is difficult to achieve robust and discriminative representation feature. For the vehicle Re-ID track in AIC2020, our method is to fuse features extracted from different networks in order to take advantages of these networks and achieve complementary features. For each single model, several methods such as multi-loss, filter grafting, semi-supervised are used to increase the representation ability as better as possible. Top performance in City-Scale Multi-Camera Vehicle Re-Identification demonstrated the advantage of our methods, and we got 5-th place in the vehicle Re-ID track of AIC2020. The codes are available at https://github.com/gggcy/AIC2020_ReID.

cs.CV↗

arXiv2020

Towards Reconfigurable Intelligent Surfaces Powered Green Wireless Networks

The adoption of reconfigurable intelligent surface (RIS) in wireless networks can enhance the spectrum- and energy-efficiency by controlling the propagation environment. Although the RIS does not consume any transmit power, the circuit power of the RIS cannot be ignored, especially when the number of reflecting elements is large. In this paper, we propose the joint design of beamforming vectors at the base station, active RIS set, and phase-shift matrices at the active RISs to minimize the network power consumption, including the RIS circuit power consumption, while taking into account each user's target data rate requirement and each reflecting element's constant modulus constraint. However, the formulated problem is a mixed-integer quadratic programming (MIQP) problem, which is NP-hard. To this end, we present an alternating optimization method, which alternately solves second order cone programming (SOCP) and MIQP problems to update the optimization variables. Specifically, the MIQP problem is further transformed into a semidefinite programming problem by applying binary relaxation and semidefinite relaxation. Finally, an efficient algorithm is developed to solve the problem. Simulation results show that the proposed algorithm significantly reduces the network power consumption and reveal the importance of taking into account the RIS circuit power consumption.

cs.IT↗