arXiv subjects

Wei Yu

Publications and source records attributed to Wei Yu.

At least 199 records · Page 11Linked to original sources

arXiv2018

Transaction Fraud Detection Using GRU-centered Sandwich-structured Model

Rapid growth of modern technologies such as internet and mobile computing are bringing dramatically increased e-commerce payments, as well as the explosion in transaction fraud. Meanwhile, fraudsters are continually refining their tricks, making rule-based fraud detection systems difficult to handle the ever-changing fraud patterns. Many data mining and artificial intelligence methods have been proposed for identifying small anomalies in large transaction data sets, increasing detecting efficiency to some extent. Nevertheless, there is always a contradiction that most methods are irrelevant to transaction sequence, yet sequence-related methods usually cannot learn information at single-transaction level well. In this paper, a new "within->between->within" sandwich-structured sequence learning architecture has been proposed by stacking an ensemble method, a deep sequential learning method and another top-layer ensemble classifier in proper order. Moreover, attention mechanism has also been introduced in to further improve performance. Models in this structure have been manifested to be very efficient in scenarios like fraud detection, where the information sequence is made up of vectors with complex interconnected features.

cs.CR↗

arXiv2018

Massive Connectivity with Massive MIMO-Part II: Achievable Rate Characterization

This two-part paper aims to quantify the cost of device activity detection in an uplink massive connectivity scenario with a large number of devices but device activities are sporadic. Part I of this paper shows that in an asymptotic massive multiple-input multiple-output (MIMO) regime, device activity detection can always be made perfect. Part II of this paper subsequently shows that despite the perfect device activity detection, there is nevertheless significant cost due to device detection in terms of overall achievable rate, because of the fact that non-orthogonal pilot sequences have to be used in order to accommodate the large number of potential devices, resulting in significantly larger channel estimation error as compared to conventional massive MIMO systems with orthogonal pilots. Specifically, this paper characterizes each active user's achievable rate using random matrix theory under either maximal-ratio combining (MRC) or minimum mean-squared error (MMSE) receive beamforming at the base-station (BS), assuming the statistics of their estimated channels as derived in Part I. The characterization of user rate also allows the optimization of pilot sequences length. Moreover, in contrast to the conventional massive MIMO system, the MMSE beamforming is shown to achieve much higher rate than the MRC beamforming for the massive connectivity scenario under consideration. Finally, this paper illustrates the necessity of user scheduling for rate maximization when the number of active users is larger than the number of antennas at the BS.

cs.IT↗

arXiv2018

Massive Connectivity with Massive MIMO-Part I: Device Activity Detection and Channel Estimation

This two-part paper considers an uplink massive device communication scenario in which a large number of devices are connected to a base-station (BS), but user traffic is sporadic so that in any given coherence interval, only a subset of users are active. The objective is to quantify the cost of active user detection and channel estimation and to characterize the overall achievable rate of a grant-free two-phase access scheme in which device activity detection and channel estimation are performed jointly using pilot sequences in the first phase and data is transmitted in the second phase. In order to accommodate a large number of simultaneously transmitting devices, this paper studies an asymptotic regime where the BS is equipped with a massive number of antennas. The main contributions of Part I of this paper are as follows. First, we note that as a consequence of having a large pool of potentially active devices but limited coherence time, the pilot sequences cannot all be orthogonal. However, despite the non-orthogonality, this paper shows that in the asymptotic massive multiple-input multiple-output (MIMO) regime, both the missed device detection and the false alarm probabilities for activity detection can always be made to go to zero by utilizing compressed sensing techniques that exploit sparsity in the user activity pattern. Part II of this paper further characterizes the achievable rates using the proposed scheme and quantifies the cost of using non-orthogonal pilot sequences for channel estimation in achievable rates.

cs.IT↗

arXiv2018

One-Bit Precoding and Constellation Range Design for Massive MIMO with QAM Signaling

The use of low-resolution digital-to-analog converters (DACs) for transmit precoding provides crucial energy efficiency advantage for massive multiple-input multiple-output (MIMO) implementation. This paper formulates a quadrature amplitude modulation (QAM) constellation range and one-bit symbol-level precoding design problem for minimizing the average symbol error rate (SER) in downlink massive MIMO transmission. A tight upper-bound for SER with low-resolution DAC precoding is first derived. The derived expression suggests that the performance degradation of one-bit precoding can be interpreted as a decrease in the effective minimum distance of the QAM constellation. Using the obtained SER expression, we propose a QAM constellation range design for the single-user case. It is shown that in the massive MIMO limit, a reasonable choice for constellation range with one-bit precoding is that of the infinite-resolution precoding with per-symbol power constraint, but reduced by a factor of $\sqrt{2/π}$ or about $0.8$. The corresponding minimum distance reduction translates to about 2dB gap between the performance of one-bit precoding and infinite-resolution precoding. This paper further proposes a low-complexity heuristic algorithm for one-bit precoder design. Finally, the proposed QAM constellation range and precoder design are generalized to the multi-user downlink. We propose to scale the constellation range for infinite-resolution zero-forcing (ZF) precoding with per-symbol power constraint by the same factor of $\sqrt{2/π}$ for one-bit precoding. The proposed one-bit precoding scheme is shown to be within 2dB of infinite-resolution ZF. In term of number of antennas, one-bit precoding requires about 50% more antennas to achieve the same performance as infinite-resolution precoding.

cs.IT↗

arXiv2018

Fractional Programming for Communication Systems--Part I: Power Control and Beamforming

This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic transform technique for tackling the multiple-ratio concave-convex FP problem--in contrast to conventional FP techniques that mostly can only deal with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are important for the optimization of communication networks, because system-level design often involves multiple signal-to-interference-plus-noise ratio terms. This paper considers the applications of FP to solving continuous problems in communication system design, particularly for power control, beamforming, and energy efficiency maximization. These application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems. This FP-based problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point. The paper further demonstrates close connections between the proposed FP approach and other well-known algorithms in the literature, such as the fixed-point iteration and the weighted minimum mean-square-error beamforming. The optimization of discrete problems is discussed in Part II of this paper.

cs.IT↗

arXiv2018

Fractional Programming for Communication Systems--Part II: Uplink Scheduling via Matching

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

cs.IT↗

arXiv2018

Channel Diagonalization for Cloud Radio Access

The diagonalization of a conventional multiple-input multiple-output (MIMO) channel into parallel and independent subchannels via singular value decomposition (SVD) is a fundamental strategy that allows the MIMO channel capacity to be achieved using scalar channel codes. This letter establishes a similar channel diagonalization result for the uplink and the downlink of a cloud radio access network (C-RAN), in which a central processor (CP) is connected to a remote radio head (RRH) serving a single user via rate-limit digital fronthaul carrying the compressed baseband signal. Specifically, we show that the diagonalization of the MIMO channel between the RRH and the user via SVD and the subsequent independent and parallel quantization of scalar signals and channel coding in each of the subchannels is optimal. This letter establishes this fact using the majorization theory. Further, an uplink-downlink duality for the multiple-antenna C-RAN is identified for this single-user case.

cs.IT↗

arXiv2018

Sparse Activity Detection for Massive Connectivity

This paper considers the massive connectivity application in which a large number of potential devices communicate with a base-station (BS) in a sporadic fashion. The detection of device activity pattern together with the estimation of the channel are central problems in such a scenario. Due to the large number of potential devices in the network, the devices need to be assigned non-orthogonal signature sequences. The main objective of this paper is to show that by using random signature sequences and by exploiting sparsity in the user activity pattern, the joint user detection and channel estimation problem can be formulated as a compressed sensing single measurement vector (SMV) problem or multiple measurement vector (MMV) problem, depending on whether the BS has a single antenna or multiple antennas, and be efficiently solved using an approximate message passing (AMP) algorithm. This paper proposes an AMP algorithm design that exploits the statistics of the wireless channel and provides an analytical characterization of the probabilities of false alarm and missed detection by using the state evolution. We consider two cases depending on whether the large-scale component of the channel fading is known at the BS and design the minimum mean squared error (MMSE) denoiser for AMP according to the channel statistics. Simulation results demonstrate the substantial advantage of exploiting the statistical channel information in AMP design; however, knowing the large-scale fading component does not offer tangible benefits. For the multiple-antenna case, we employ two different AMP algorithms, namely the AMP with vector denoiser and the parallel AMP-MMV, and quantify the benefit of deploying multiple antennas at the BS.

cs.IT↗

arXiv2017

Hybrid Analog and Digital Beamforming for mmWave OFDM Large-Scale Antenna Arrays

Hybrid analog and digital beamforming is a promising candidate for large-scale mmWave MIMO systems because of its ability to significantly reduce the hardware complexity of the conventional fully-digital beamforming schemes while being capable of approaching the performance of fully-digital schemes. Most of the prior work on hybrid beamforming considers narrowband channels. However, broadband systems such as mmWave systems are frequency-selective. In broadband systems, it is desirable to design common analog beamformer for the entire band while employing different digital beamformers in different frequency sub-bands. This paper considers hybrid beamforming design for systems with OFDM modulation. First, for a SU-MIMO system where the hybrid beamforming architecture is employed at both transmitter and receiver, we show that hybrid beamforming with a small number of RF chains can asymptotically approach the performance of fully-digital beamforming for a sufficiently large number of transceiver antennas due to the sparse nature of the mmWave channels. For systems with a practical number of antennas, we then propose a unified heuristic design for two different hybrid beamforming structures, the fully-connected and the partially-connected structures, to maximize the overall spectral efficiency of a mmWave MIMO system. Numerical results are provided to show that the proposed algorithm outperforms the existing hybrid beamforming methods and for the fully-connected architecture the proposed algorithm can achieve spectral efficiency very close to that of the optimal fully-digital beamforming but with much fewer RF chains. Second, for the MU-MISO case, we propose a heuristic hybrid percoding design to maximize the weighted sum rate in the downlink and show numerically that the proposed algorithm with practical number of RF chains can already approach the performance of fully-digital beamforming.

cs.IT↗

arXiv2017

Full-Duplex Cloud Radio Access Network: Stochastic Design and Analysis

Full-duplex (FD) has emerged as a disruptive communications paradigm for enhancing the achievable spectral efficiency (SE), thanks to the recent major breakthroughs in self-interference (SI) mitigation. The FD versus half-duplex (HD) SE gain, in cellular networks, is however largely limited by the mutual-interference (MI) between the downlink (DL) and the uplink (UL). A potential remedy for tackling the MI bottleneck is through cooperative communications. This paper provides a stochastic design and analysis of FD enabled cloud radio access network (C-RAN) under the Poisson point process (PPP)-based abstraction model of multi-antenna radio units (RUs) and user equipments (UEs). We consider different disjoint and user-centric approaches towards the formation of finite clusters in the C-RAN. Contrary to most existing studies, we explicitly take into consideration non-isotropic fading channel conditions and finite-capacity fronthaul links. Accordingly, upper-bound expressions for the C-RAN DL and UL SEs, involving the statistics of all intended and interfering signals, are derived. The performance of the FD C-RAN is investigated through the proposed theoretical framework and Monte-Carlo (MC) simulations. The results indicate that significant FD versus HD C-RAN SE gains can be achieved, particularly in the presence of sufficient-capacity fronthaul links and advanced interference cancellation capabilities.

cs.IT↗

arXiv2017

Extreme case of Faraday effect: magnetic splitting of ultrashort laser pulses in plasmas

The Faraday effect, caused by a magnetic-field-induced change in the optical properties, takes place in a vast variety of systems from a single atomic layer of graphenes to huge galaxies. Currently, it plays a pivot role in many applications such as the manipulation of light and the probing of magnetic fields and material's properties. Basically, this effect causes a polarization rotation of light during its propagation along the magnetic field in a medium. Here, we report an extreme case of the Faraday effect where a linearly polarized ultrashort laser pulse splits in time into two circularly polarized pulses of opposite handedness during its propagation in a highly magnetized plasma. This offers a new degree of freedom for manipulating ultrashort and ultrahigh power laser pulses. Together with technologies of ultra-strong magnetic fields, it may pave the way for novel optical devices, such as magnetized plasma polarizers. In addition, it may offer a powerful means to measure strong magnetic fields in laser-produced plasmas.

physics.plasm-ph↗

arXiv2017

Energy-efficient Analytics for Geographically Distributed Big Data

Big data analytics on geographically distributed datasets (across data centers or clusters) has been attracting increasing interests from both academia and industry, but also significantly complicates the system and algorithm designs. In this article, we systematically investigate the geo-distributed big-data analytics framework by analyzing the fine-grained paradigm and the key design principles. We present a dynamic global manager selection algorithm (GMSA) to minimize energy consumption cost by fully exploiting the system diversities in geography and variation over time. The algorithm makes real-time decisions based on the measurable system parameters through stochastic optimization methods, while achieving the performance balances between energy cost and latency. Extensive trace-driven simulations verify the effectiveness and efficiency of the proposed algorithm. We also highlight several potential research directions that remain open and require future elaborations in analyzing geo-distributed big data.

cs.DC↗

arXiv2017

Optimization of Heterogeneous Coded Caching

This paper aims to provide an optimization framework for coded caching that accounts for various heterogeneous aspects of practical systems. An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah Ali and Niesen is first developed, whereas it is proved that the coded caching scheme presented in that work is the optimal scheme among a large, non-trivial family of possible caching schemes. The optimization framework is then used to develop a coded caching scheme capable of handling simultaneous non-uniform file length, non-uniform file popularity, and non-uniform user cache size. Although the resulting full optimization problem scales exponentially with the problem size, this paper shows that tractable simplifications of the problem that scale as a polynomial function of the problem size can still perform well compared to the original problem. By considering these heterogeneities both individually and in conjunction with one another, insights into their interactions and influence on optimal cache content are obtained.

cs.IT↗

arXiv2017

Flexible Multiple Base Station Association and Activation for Downlink Heterogeneous Networks

This letter shows that the flexible association of possibly multiple base stations (BSs) to each user over multiple frequency bands, along with the joint optimization of BS transmit power that encourages the turning-off of the BSs at off-peak time, can significantly improve the performance of a downlink heterogeneous wireless cellular network. We propose a gradient projection algorithm for optimizing BS association and an iteratively reweighting scheme together with a novel proximal gradient method for optimizing power in order to find the optimal tradeoff between network utility and power consumption. Simulation results reveal significant performance improvement as compared to the conventional single-BS association.

cs.NI↗

arXiv2017

Low-cost high-efficiency solar steam generation by wick material with graphite micro/nano particles

Generating water steam by solar energy is a significant process for many fields. In this paper, a low-cost high-efficiency wick type steam generator is proposed. It's based on the heat localization and thin-film evaporation. The measurements show that the energy efficiency is 84 % at 1 kw/m2. Besides, the dependence of efficiency on particle concentration and size are discussed. The optimal particle concentration is found at 60 g/m2, and a smaller particle size gives higher efficiency. The experimental results agree well with the theoretical prediction based on thin-film evaporation theory. Our study offers a new in-depth understanding of low-cost high-efficiency solar steam generation.

cond-mat.mes-hall↗

arXiv2017

Fronthaul Compression and Transmit Beamforming Optimization for Multi-Antenna Uplink C-RAN

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. A novel weighted minimum-mean-square-error successive convex approximation (WMMSE-SCA) algorithm is first proposed for maximizing the weighted sum rate under the user transmit power and fronthaul capacity constraints with single-user compression. Assuming a heuristic decompression order, the proposed algorithm is then adapted for optimizing the transmit beamforming and fronthaul compression under Wyner-Ziv coding. This paper also proposes a low-complexity separate design consisting of optimizing transmit beamformers for the Gaussian vector multiple-access channel along with per-antenna quantizers with uniform quantization noise levels across the antennas at each BS. Numerical results show that with optimized beamforming and fronthaul compression, C-RAN can significantly outperform conventional cellular networks. Furthermore, the low complexity separate design already performs very close to the optimized joint design in regime of practical interest.

cs.IT↗

arXiv2017

Cheating-Resilient Incentive Scheme for Mobile Crowdsensing Systems

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. In this paper, we develop a novel Cheating-Resilient Incentive (CRI) scheme for Mobile Crowdsensing Systems, which achieves credibility-driven user recruitment and payback maximization for honest users with quality data. Via theoretical analysis, we demonstrate the correctness of our design. The performance of our scheme is evaluated based on extensive realworld trace-driven simulations. Our evaluation results show that our scheme is proven to be effective in terms of both guaranteeing sensing accuracy and resisting potential cheating behaviors, as demonstrated in practical scenarios, as well as those that are intentionally harsher.

cs.NI↗

arXiv2016

On Optimal Fronthaul Compression and Decoding Strategies for Uplink Cloud Radio Access Networks

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. On the CP decoding strategy design, this paper shows that under a sum fronthaul capacity constraint, a generalized successive decoding strategy of the quantization and user message codewords that allows arbitrary interleaved order at the CP achieves the same rate region as the optimal joint decoding. Further, it is shown that a practical strategy of successively decoding the quantization codewords first, then the user messages, achieves the same maximum sum rate as joint decoding under individual fronthaul constraints. On the joint optimization of user transmission and BS quantization strategies, this paper shows that if the input distributions are assumed to be Gaussian, then under joint decoding, the optimal quantization scheme for maximizing the achievable rate region is Gaussian. Moreover, Gaussian input and Gaussian quantization with joint decoding achieve to within a constant gap of the capacity region of the Gaussian multiple-input multiple-output (MIMO) uplink C-RAN model. Finally, this paper addresses the computational aspect of optimizing uplink MIMO C-RAN by showing that under fixed Gaussian input, the sum rate maximization problem over the Gaussian quantization noise covariance matrices can be formulated as convex optimization problems, thereby facilitating its efficient solution.

cs.IT↗