arXiv subjects

Shi Jin

Publications and source records attributed to Shi Jin.

At least 523 records · Page 29Linked to original sources

arXiv2019

Edge Caching with Real-Time Guarantees

In recent years, optimization of the success transmission probability in wireless cache-enabled networks has been studied extensively. However, few works have concerned about the real-time performance of the cache-enabled networks. In this paper, we investigate the performance of the cache-enabled with real-time guarantees by adopting the age of information (AoI) as the metric to characterize the timeliness of the delivered information. We establish a spatial-temporal model by utilizing the stochastic geometry and queuing theory which captures both the temporal traffic dynamics and the interferers' geographic distribution. Under the random caching framework, we achieve the closed-form expression of AoI by adopting the maximum average received power criterion for the user association. Finally, we formulate a convex optimization problem for the minimization of the Peak AoI (PAoI) and obtain the optimal caching probabilities by utilizing the Karush-Kuhn-Tucker (KKT) conditions. Numerical results demonstrate that the random caching strategy is a better choice rather than the most popular content and uniform caching strategy to improve the real-time performance for the cached file as well as maintaining the file diversity at a relatively high level.

cs.IT↗

arXiv2019

The Random Batch Method for $N$-Body Quantum Dynamics

This paper discusses a numerical method for computing the evolution of large interacting system of quantum particles. The idea of the random batch method is to replace the total interaction of each particle with the $N-1$ other particles by the interaction with $p 1$ and independent of the Planck constant $\hbar$.

math.AP↗

arXiv2019

Dynamic Metasurface Antennas for MIMO-OFDM Receivers with Bit-Limited ADCs

The combination of orthogonal frequency modulation (OFDM) and multiple-input multiple-output (MIMO) systems plays an important role in modern communication systems. In order to meet the growing throughput demands, future MIMO-OFDM receivers are expected to utilize a massive number of antennas, operate in dynamic environments, and explore high frequency bands, while satisfying strict constraints in terms of cost, power, and size. An emerging technology to realize massive MIMO receivers of reduced cost and power consumption is based on dynamic metasurface antennas (DMAs), which inherently implement controllable compression in acquisition. In this work we study the application of DMAs for MIMO-OFDM receivers operating with bit-constrained analog-to-digital converters (ADCs). We present a model for DMAs which accounts for the configurable frequency selective profile of its metamaterial elements, resulting in a spectrally flexible hybrid structure. We then exploit previous results in task-based quantization to show how DMAs can be configured to improve recovery in the presence of constrained ADCs, and propose methods for adjusting the DMA parameters based on channel state information. Our numerical results demonstrate that the DMA-based receiver is capable of accurately recovering OFDM signals. In particular, we show that by properly exploiting the spectral diversity of DMAs, notable performance gains are obtained over existing designs of conventional hybrid architectures, demonstrating the potential of DMAs for MIMO-OFDM setups in realizing high performance massive antenna arrays of reduced cost and power consumption.

cs.IT↗

arXiv2019

Expectation Propagation Detector for Extra-Large Scale Massive MIMO

The order-of-magnitude increase in the dimension of antenna arrays, which forms extra-large-scale massive multiple-input-multiple-output (MIMO) systems, enables substantial improvement in spectral efficiency, energy efficiency, and spatial resolution. However, practical challenges, such as excessive computational complexity and excess of baseband data to be transferred and processed, prohibit the use of centralized processing. A promising solution is to distribute baseband data from disjoint subsets of antennas into parallel processing procedures coordinated by a central processing unit. This solution is called subarray-based architecture. In this work, we extend the application of expectation propagation (EP) principle, which effectively balances performance and practical feasibility in conventional centralized MIMO detector design, to fit the subarray-based architecture. Analytical results confirm the convergence of the proposed iterative procedure and that the proposed detector asymptotically approximates Bayesian optimal performance under certain conditions. The proposed subarray-based EP detector is reduced to centralized EP detector when only one subarray exists. In addition, we propose additional strategies for further reducing the complexity and overhead of the information exchange between parallel subarrays and the central processing unit to facilitate the practical implementation of the proposed detector. Simulation results demonstrate that the proposed detector achieves numerical stability within few iterations and outperforms its counterparts.

eess.SP↗

arXiv2019

Computation Offloading in the Untrusted MEC-aided Mobile Blockchain IoT System

Deploying mobile edge computing (MEC) server in the mobile blockchain-enabled Internet of things (IoT) system is a promising approach to improve the system performance, however, it imposes a significant challenge on the trust of MEC server. To address this problem, we first propose an untrusted MEC proof of work scheme in mobile blockchain network where plenty of nonce hash computing demands can be offloaded to MEC server. Then, we design a nonce ordering algorithm for this scheme to provide fairer computing resource allocation for all mobile IoT devices/users. Specifically, we formulate the user's nonce selection strategy as a non-cooperative game, where the utilities of individual user are maximized in the untrusted MEC-aided mobile blockchain network. We also prove the existence of Nash equilibrium and analyze that the cooperation behavior is unsuitable for the blockchain-enabled IoT devices by using the repeated game. Finally, we design the blockchain's difficulty adjustment mechanism to ensure stable block times during a long period of time.

cs.IT↗

arXiv2019

Federated Learning with Differential Privacy: Algorithms and Performance Analysis

In this paper, to effectively prevent information leakage, we propose a novel framework based on the concept of differential privacy (DP), in which artificial noises are added to the parameters at the clients side before aggregating, namely, noising before model aggregation FL (NbAFL). First, we prove that the NbAFL can satisfy DP under distinct protection levels by properly adapting different variances of artificial noises. Then we develop a theoretical convergence bound of the loss function of the trained FL model in the NbAFL. Specifically, the theoretical bound reveals the following three key properties: 1) There is a tradeoff between the convergence performance and privacy protection levels, i.e., a better convergence performance leads to a lower protection level; 2) Given a fixed privacy protection level, increasing the number $N$ of overall clients participating in FL can improve the convergence performance; 3) There is an optimal number of maximum aggregation times (communication rounds) in terms of convergence performance for a given protection level. Furthermore, we propose a $K$-random scheduling strategy, where $K$ ($1<K<N$) clients are randomly selected from the $N$ overall clients to participate in each aggregation. We also develop the corresponding convergence bound of the loss function in this case and the $K$-random scheduling strategy can also retain the above three properties. Moreover, we find that there is an optimal $K$ that achieves the best convergence performance at a fixed privacy level. Evaluations demonstrate that our theoretical results are consistent with simulations, thereby facilitating the designs on various privacy-preserving FL algorithms with different tradeoff requirements on convergence performance and privacy levels.

cs.LG↗

arXiv2019

The Vlasov-Fokker-Planck Equation with High Dimensional Parametric Forcing Term

We consider the Vlasov-Fokker-Planck equation with random electric field where the random field is parametrized by countably many infinite random variables due to uncertainty. At the theoretical level, with suitable assumption on the anisotropy of the randomness, adopting the technique employed in elliptic PDEs [Cohen, DeVore, 2015], we prove the best N approximation in the random space breaks the dimension curse and the convergence rate is faster than the Monte Carlo method. For the numerical method, based on the adaptive sparse polynomial interpolation (ASPI) method introduced in [Chkifa, Cohen, Schwab, 2014], we develop a residual-based adaptive sparse polynomial interpolation (RASPI) method which is more efficient for multi-scale linear kinetic equation, when using numerical schemes that are time-dependent and implicit. Numerical experiments show that the numerical error of the RASPI decays faster than the Monte-Carlo method and is also dimension independent.

math.NA↗

arXiv2019

Convergence of a first-order consensus-based global optimization algorithm

Global optimization of a non-convex objective function often appears in large-scale machine-learning and artificial intelligence applications. Recently, consensus-based optimization (in short CBO) methods have been introduced as one of the gradient-free optimization methods. In this paper, we provide a convergence analysis for the first-order CBO method in \cite{C-J-L-Z}. Prior to the current work, the convergence study was carried out for CBO methods on corresponding mean-field limit, a Fokker-Planck equation, which does not imply the convergence of the CBO method {\it per se}. Based on the consensus estimate directly on the first-order CBO model, we provide a convergence analysis of the first-order CBO method \cite{C-J-L-Z} without resorting to the corresponding mean-field model. Our convergence analysis consists of two steps. In the first step, we show that the CBO model exhibits a global consensus time asymptotically for any initial data, and in the second step, we provide a sufficient condition on system parameters--which is dimension independent-- and initial data which guarantee that the converged consensus state lies in a small neighborhood of the global minimum almost surely.

math.OC↗

arXiv2019

An Uncertainty Quantification Approach to the Study of Gene Expression Robustness

We study a chemical kinetic system with uncertainty modeling a gene regulatory network in biology. Specifically, we consider a system of two equations for the messenger RNA and micro RNA content of a cell. Our target is to provide a simple framework for noise buffering in gene expression through micro RNA production. Here the uncertainty, modeled by random variables, enters the system through the initial data and the source term. We obtain a sharp decay rate of the solution to the steady state, which reveals that the biology system is not sensitive to the initial perturbation around the steady state. The sharp regularity estimate leads to the stability of the generalized Polynomial Chaos stochastic Galerkin (gPC-SG) method. Based on the smoothness of the solution in the random space and the stability of the numerical method, we conclude the gPC-SG method has spectral accuracy. Numerical experiments are conducted to verify the theoretical findings.

math.NA↗

arXiv2019

Channel Estimation for Extremely Large-Scale Massive MIMO Systems

Extremely large-scale massive multiple-input multiple-output (MIMO) has shown considerable potential in future mobile communications. However, the use of extremely large aperture arrays has led to near-field and spatial non-stationary channel conditions, which result in changes to transceiver design and channel state information that should be acquired. This letter focuses on the channel estimation problem and describes the non-stationary channel through mapping between subarrays and scatterers. We propose subarray-wise and scatterer-wise channel estimation methods to estimate the near-field non-stationary channel from the view of subarray and scatterer, respectively. Numerical results demonstrate that subarray-wise method can derive accurate channel estimation results with low complexity, whereas the scatterer-wise method can accurately position the scatterers and identify almost all the mappings between subarrays and scatterers.

cs.IT↗

arXiv2019

Gaussian wave packet transform based numerical scheme for the semi-classical Schrödinger equation with random inputs

In this work, we study the semi-classical limit of the Schrödinger equation with random inputs, and show that the semi-classical Schrödinger equation produces $O(\varepsilon)$ oscillations in the random variable space. With the Gaussian wave packet transform, the original Schrödinger equation is mapped to an ODE system for the wave packet parameters coupled with a PDE for the quantity $w$ in rescaled variables. Further, we show that the $w$ equation does not produce $\varepsilon$ dependent oscillations, and thus it is more amenable for numerical simulations. We propose multi-level sampling strategy in implementing the Gaussian wave packet transform, where in the most costly part, i.e. simulating the $w$ equation, it is sufficient to use $\varepsilon$ independent samples. We also provide extensive numerical tests as well as meaningful numerical experiments to justify the properties of the numerical algorithm, and hopefully shed light on possible future directions.

math.NA↗

arXiv2019

Fission Dynamics of 240Pu from Saddle-to-Scission and Beyond

Calculations are presented for the time evolution of $^{240}$Pu from the proximity of the outer saddle point until the fission fragments are well separated, using the time-dependent density functional theory extended to superfluid systems. We have tested three families of nuclear energy density functionals and found that all functionals exhibit a similar dynamics: the collective motion is highly dissipative and with little trace of inertial dynamics, due to the one-body dissipation mechanism alone. This finding justifies the validity of using the overdamped collective motion approach and to some extent the main assumptions in statistical models of fission. This conclusion is robust with respect to the nuclear energy density functional used. The configurations and interactions left out of the present theory framework only increase the role of the dissipative couplings. An unexpected finding is varying the pairing strength within a quite large range has only minor effects on the dynamics. We find notable differences in the excitation energy sharing between the fission fragments in the cases of spontaneous and induced fission. With increasing initial excitation energy of the fissioning nucleus more excitation energy is deposited in the heavy fragment, in agreement with experimental data on average neutron multiplicities.

nucl-th↗

arXiv2019

Random batch methods (RBM) for interacting particle systems

We develop Random Batch Methods for interacting particle systems with large number of particles. These methods use small but random batches for particle interactions, thus the computational cost is reduced from $O(N^2)$ per time step to $O(N)$, for a system with $N$ particles with binary interactions. On one hand, these methods are efficient Asymptotic-Preserving schemes for the underlying particle systems, allowing $N$-independent time steps and also capture, in the $N \to \infty$ limit, the solution of the mean field limit which are nonlinear Fokker-Planck equations; on the other hand, the stochastic processes generated by the algorithms can also be regarded as new models for the underlying problems. For one of the methods, we give a particle number independent error estimate under some special interactions. Then, we apply these methods to some representative problems in mathematics, physics, social and data sciences, including the Dyson Brownian motion from random matrix theory, Thomson's problem, distribution of wealth, opinion dynamics and clustering. Numerical results show that the methods can capture both the transient solutions and the global equilibrium in these problems.

math.NA↗

arXiv2019

Bit-level Optimized Neural Network for Multi-antenna Channel Quantization

Quantized channel state information (CSI) plays a critical role in precoding design which helps reap the merits of multiple-input multiple-output (MIMO) technology. In order to reduce the overhead of CSI feedback, we propose a deep learning based CSI quantization method by developing a joint convolutional residual network (JCResNet) which benefits MIMO channel feature extraction and recovery from the perspective of bit-level quantization performance. Experiments show that our proposed method substantially improves the performance.

cs.IT↗

arXiv2019

Asymptotic-preserving schemes for two-species binary collisional kinetic system with disparate masses I: time discretization and asymptotic analysis

We develop efficient asymptotic-preserving time discretization schemes to solve the disparate mass kinetic system of a binary gas or plasma in the "relaxation time scale" relevant to the epochal relaxation phenomenon. Since the resulting model is associated to a parameter given by the square of the mass ratio between the light and heavy particles, we develop an asymptotic-preserving scheme in a novel decomposition strategy using the penalization method for multiscale collisional kinetic equations. Both the Boltzmann and Fokker-Planck-Landau (FPL) binary collision operators will be considered. Other than utilizing several AP strategies for single-species binary kinetic equations, we also introduce a novel splitting and a carefully designed explicit-implicit approximation, which are guided by the asymptotic analysis of the system. We also conduct asymptotic-preserving analysis for the time discretization, for both space homogenous and inhomogeneous systems.

math.NA↗

arXiv2019

Sharp Decay Estimates in Local Sensitivity Analysis for Evolution Equations with Uncertainties: from ODEs to Linear Kinetic Equations

We review the Lyapunov functional method for linear ODEs and give an explicit construction of such functionals that yields sharp decay estimates, including an extension to defective ODE systems. As an application, we consider three evolution equations, namely the linear convection-diffusion equation, the two velocity BGK model and the Fokker-Planck equation. Adding an uncertainty parameter to the equations and analyzing its linear sensitivity leads to defective ODE systems. By applying the Lyapunov functional construction, we prove sharp long time behavior of order $(1+t^{M})e^{-μt}$, where $M$ is the defect and $μ$ is the spectral gap of the system. The appearance of the uncertainty parameter in the three applications makes it important to have decay estimates that are uniform in the non-defective limit.

math.AP↗

arXiv2019

3-D Positioning and Environment Mapping for mmWave Communication Systems

Millimeter-wave (mmWave) cloud radio access networks (CRANs) provide new opportunities for accurate cooperative localization, in which large bandwidths, large antenna arrays, and increased densities of base stations allow for their unparalleled delay and angular resolution. Combining localization into communications and designing simultaneous localization and mapping (SLAM) algorithms are challenging problems. This study considers the joint position and velocity estimation and environment mapping problem in a three-dimensional mmWave CRAN architecture. We first embed cooperative localization into communications and establish the joint estimation and mapping model with hybrid delay and angle measurements. Then, we propose a closed-form weighted least square (WLS) solution for the joint estimation and mapping problems. The proposed WLS estimator is proven asymptotically unbiased and confirmed by simulations as effective in achieving the Cramer-Rao lower bound (CRLB) and the desired decimeter-level accuracy. Furthermore, we propose a WLS-Net-based SLAM algorithm by embedding neural networks into the proposed WLS estimators to replace the linear approximations. The solution possesses both powerful learning ability of the neural network and robustness of the proposed geometric model, and the ensemble learning is applied to further improve positioning accuracy. A public ray-tracing dataset is used in the simulations to test the performance of the WLS-Net-based SLAM algorithm, which is proven fast and effective in attaining the centimeter-level accuracy.

cs.IT↗

arXiv2019

An Overview of Enhanced Massive MIMO with Array Signal Processing Techniques

In the past ten years, there have been tremendous research progresses on massive MIMO systems, most of which stand from the communications viewpoint. A new trend of investigating massive MIMO, especially for the sparse scenario like millimeter wave (mmWave) transmission, is to re-build the transceiver design from array signal processing viewpoint that could deeply exploit the half-wavelength array and provide enhanced performances in many aspects. For example, the high dimensional channel could be decomposed into small amount of physical parameters, e.g., angle of arrival (AoA), angle of departure (AoD), multi-path delay, Doppler shift, etc. As a consequence, transceiver techniques like synchronization, channel estimation, beamforming, precoding, multi-user access, etc., can be re-shaped with these physical parameters, as opposed to those designed directly with channel state information (CSI). Interestingly, parameters like AoA/AoD and multi-path delay are frequency insensitive and thus can be used to guide the down-link transmission from uplink training even for FDD systems. Moreover, some phenomena of massive MIMO that were vaguely revealed previously can be better explained now with array signal processing, e.g., the beam squint effect. In all, the target of this paper is to present an overview of recent progress on merging array signal processing into massive MIMO communications as well as its promising future directions.

eess.SP↗