Passive detection of moving aerial target based on multiple collaborative GPS satellites

Passive localization is an important part of intelligent surveillance in security and emergency applications. Nowadays, Global Navigation Satellite Systems (GNSSs) have been widely deployed. As a result, the satellite signal receiver may receive multiple GPS signals simultaneously, incurring echo signal detection failure. Therefore, in this paper, a passive method leveraging signals from multiple GPS satellites is proposed for moving aerial target detection. In passive detection, the first challenge is the interference caused by multiple GPS signals transmitted upon the same spectrum resources. To address this issue, successive interference cancellation (SIC) is utilized to separate and reconstruct multiple GPS signals on the reference channel. Moreover, on the monitoring channel, direct wave and multi-path interference are eliminated by extensive cancellation algorithm (ECA). After interference from multiple GPS signals is suppressed, the cycle cross ambiguity function (CCAF) of the signal on the monitoring channel is calculated and coordinate transformation method is adopted to map multiple groups of different time delay-Doppler spectrum into the distance−velocity spectrum. The detection statistics are calculated by the superposition of multiple groups of distance-velocity spectrum. Finally, the echo signal is detected based on a properly defined adaptive detection threshold. Simulation results demonstrate the effectiveness of our proposed method. They show that the detection probability of our proposed method can reach 99%, when the echo signal signal-to-noise ratio (SNR) is only −64 dB. Moreover, our proposed method can achieve 5 dB improvement over the detection method using a single GPS satellite

Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell-Free User-Centric Massive MIMO Networks

We consider scalable cell-free massive multiple-input multiple-output networks under an open radio access network paradigm comprising user equipments (UEs), radio units (RUs), and decentralized processing units (DUs). UEs are served by dynamically allocated user-centric clusters of RUs. The corresponding cluster processors (implementing the physical layer for each user) are hosted by the DUs as software-defined virtual network functions. Unlike the current literature, mainly focused on the characterization of the user rates under unrestricted fronthaul communication and computation, in this work we explicitly take into account the fronthaul topology, the limited fronthaul communication capacity, and computation constraints at the DUs. In particular, we systematically address the new problem of joint fronthaul load balancing and allocation of the computation resource. As a consequence of our new optimization framework, we present representative numerical results highlighting the existence of an optimal number of quantization bits in the analog-to-digital conversion at the RUs.Comment: 13 pages, 5 figures, submitted to IEEE Transactions on Wireless Communication

Previous military experience and entrepreneurship toward poverty reduction : evidence from China

Acknowledgements We thank the Editor-in-Chief Brandon Randolph-Seng, the anonymous reviewers, and Shaker A. Zahra and Yong Li for their helpful comments and suggestions. We acknowledge funding from the General Project of Philosophy and Social Science Research in Colleges and Universities of Jiangsu Province (grant number: 2020SJA0254). The usual disclaimers apply.Peer reviewedPostprin

Efficient k-means++ approximation with MapReduce

PublishedJournal Articlek-means is undoubtedly one of the most popular clustering algorithms owing to its simplicity and efficiency. However, this algorithm is highly sensitive to the chosen initial centers and thus a proper initialization is crucial for obtaining an ideal solution. To address this problem, k-means++ is proposed to sequentially choose the centers so as to achieve a solution that is provably close to the optimal one. However, due to its weak scalability, k-means++ becomes inefficient as the size of data increases. To improve its scalability and efficiency, this paper presents MapReduce k-means++ method which can drastically reduce the number of MapReduce jobs by using only one MapReduce job to obtain k centers. The k-means++ initialization algorithm is executed in the Mapper phase and the weighted k-means++ initialization algorithm is run in the Reducer phase. As this new MapReduce k-means++ method replaces the iterations among multiple machines with a single machine, it can reduce the communication and I/O costs significantly. We also prove that the proposed MapReduce k-means++ method obtains O(α2) approximation to the optimal solution of k-means. To reduce the expensive distance computation of the proposed method, we further propose a pruning strategy that can greatly avoid a large number of redundant distance computations. Extensive experiments on real and synthetic data are conducted and the performance results indicate that the proposed MapReduce k-means++ method is much more efficient and can achieve a good approximation.This work was supported by the National Science Foundation for Distinguished Young Scholars of China under Grant No. of 61225010, National Nature Science Foundation of China (Nos. 61173162, 61173165, 61370199, 61300187, 61300189, and 61370198), New Century Excellent Talents (No. NCET-10-0095), the Fundamental Research Funds for the Central Universities (Nos. 2013QN044 and 2012TD008)

Efficient subspace skyline query based on user preference using MapReduce

Subspace skyline, as an important variant of skyline, has been widely applied for multiple-criteria decisions, business planning. With the development of mobile internet, subspace skyline query in mobile distributed environments has recently attracted considerable attention. However, efficiently obtaining the meaningful subset of skyline points in any subspace remains a challenging task in the current mobile internet. For more and more mobile applications, subspace skyline query on mobile units is usually limited by big data and wireless bandwidth. To address this issue, in this paper, we propose a system model that can support subspace skyline query in mobile distributed environment. An efficient algorithm for processing the Subspace Skyline Query using MapReduce (SSQ) is also presented which can obtain the meaningful subset of points from the full set of skyline points in any subspace. The SSQ algorithm divides a subspace skyline query into two processing phases: the preprocess phase and the query phase. The preprocess phase includes the pruning process and constructing index process which is designed to reduce network delay and response time. Additionally, the query phase provides two filtering methods, SQM-filtering and ε-filtering, to filter the skyline points according to user preference and reduce network cost. Extensive experiments on real and synthetic data are conducted and the experimental results indicate that our algorithm is much efficient, meanwhile, the pruning strategy can further improve the efficiency of the algorithm