Xidian University

About: Xidian University is a education organization based out in Xi'an, China. It is known for research contribution in the topics: Antenna (radio) & Computer science. The organization has 32099 authors who have published 38961 publications receiving 431820 citations. The organization is also known as: University of Electronic Science and Technology at Xi'an & Xīān Diànzǐ Kējì Dàxué.

Learning-Based Content Caching and Sharing for Wireless Networks

Abstract: Content caching at base stations (BSs) is a promising technique for future wireless networks by reducing network traffic and alleviating server bottleneck. However, in practice, the content popularity distribution may change with spatio-temporal variation but be unknown for BSs, which is an intractable obstacle for efficient caching strategy design. In this paper, considering unknown popularity distribution, we explore the content caching problem by jointly optimizing the content caching in cooperative BSs, content sharing among BSs, and cost of content retrieving. We tackle the problem from a multi-armed bandit learning perspective, where the learning of the popularity distribution is incorporated with the content caching and sharing process. Specifically, we first propose a centralized algorithm by employing a semidefinite relaxation approach, and we prove that this centralized algorithm learns efficient caching by deriving a sub-linear learning regret bound. To further reduce computational complexity, we propose a distributed algorithm based on alternating direction method of multipliers, where each BS only solves their own problems by exchanging local information with neighbor BSs. Extensive simulation results show the effectiveness of the proposed algorithms in terms of learning content popularity distributions of individual BSs, offloading traffic from the content server, and reducing cost of content retrieving.

Common Bayesian Network for Classification of EEG-Based Multiclass Motor Imagery BCI

Abstract: Modeling and learning of brain activity patterns represent a huge challenge to the brain-computer interface (BCI) based on electroencephalography (EEG). Many existing methods estimate the uncorrelated instantaneous demixing of EEG signals to classify multiclass motor imagery (MI). However, the condition of uncorrelation does not hold true in practice, because the brain regions work with partial or complete collaboration. This work proposes a novel method, termed as a common Bayesian network (CBN), to discriminate multiclass MI EEG signals. First, with the constraints of a Gaussian mixture model on every channel, only related channels are selected to construct a normal Bayesian network. Second, the nodes that have both common and varying edges are selected to construct a CBN. Third, the probabilities on common edges are used to learn about the support vector machine for classification. To validate the proposed method, we conduct experiments on two well-known BCI datasets and perform a numerical analysis of the propose algorithm for EEG classification in a multiclass MI BCI. Experimental results show that the proposed CBN method not only has excellent classification performance, but also is highly efficient. Hence, it is suitable for the cases where a system is required to respond within a second.

Hypochlorous Acid Promoted Platinum Drug Chemotherapy by Myeloperoxidase-Encapsulated Therapeutic Metal Phenolic Nanoparticles

Abstract: This study applies in situ production of hypochlorous acid (HOCl) to improve the therapeutic efficacy of platinum drugs. The phagocytic enzyme myeloperoxidase (MPO) is coated with two functional polyphenol derivatives (platinum prodrug polyphenols and PEG polyphenols) and ferric ion by metal phenolic coordination, which can shield MPO from degradation by other compounds in the blood. Moreover, the platinum prodrug can be reduced to cisplatin in cells and produce hydrogen peroxide (H2O2). The MPO catalyzes the conversion of H2O2 to HOCl in the intercellular environment. The as-prepared MPO Pt PEG nanoparticles (MPP NPs) can be employed as a reactive oxygen species cascade bioreaction to enhance platinum drug therapy. The MPP NPs show prolonged blood circulation and high tumor accumulation as evidenced by 89Zr-based positron emission tomography imaging. The MPP NPs effectively inhibit tumor growth in vivo. As a first-in-class platform to harness the highly toxic HOCl in nanomedicine for cancer therapy, this...

ISAR Imaging of Targets With Complex Motion Based on the Chirp Rate–Quadratic Chirp Rate Distribution

Abstract: In inverse synthetic aperture radar (ISAR) imaging of targets with complex motion such as fluctuating ships with oceanic waves and high maneuvering airplanes, the azimuth echo signals can be modeled as cubic phase signals (CPSs) after the migration compensation. The chirp rate (CR) and the quadratic chirp rate (QCR) are two important physical quantities of the CPS, which deteriorate the azimuth focusing quality due to the Doppler frequency shift. With these two quantities, other parameters can be estimated by using the fast Fourier transform (FFT). Therefore, the CPS can be uniquely determined by both CR and QCR. In this paper, based on the proposed generalized keystone transform and the parametric instantaneous autocorrelation function, a novel distribution of the CPS, known as the CR–QCR distribution (CRQCRD), is presented and applied in a newly proposed ISAR imaging algorithm for targets with complex motion. The CRQCRD is simple and only requires the FFT and the nonuniform FFT (NUFFT). Owing to the application of the NUFFT, the computational cost is saved, and the searching procedure is unnecessary for the nonuniformly spaced signal. Compared to other four representative methods for CPSs, the CRQCRD, which can acquire higher antinoise performance and no error propagation, is searching-free and more suitable for the situation of multitargets. Several simulation examples, analyses of the antinoise performance, and ISAR images validate the effectiveness of the CRQCRD and the corresponding ISAR imaging algorithm.