基于Transformer网络的机载雷达多目标跟踪方法

传统的多目标跟踪数据关联算法需要提前知晓目标运动模型和杂波密度等先验信息,然而这些先验信息在跟踪之前无法及时准确地获取。针对这个问题,提出一种基于Transformer网络的多目标跟踪数据关联算法。首先,考虑到传感器会存在漏检的情况,引入虚拟量测来重新建立数据关联模型。在此基础上,提出基于Transformer网络的数据关联方法来解决多目标与多量测的匹配问题。同时,设计了一种掩蔽交叉熵损失与重叠度损失相结合的损失函数(MCD)用于优化网络参数。仿真和实测数据结果表明:在不同检测概率条件下,所提算法性能均优于经典的数据关联算法和基于双向长短时记忆网络的算法。      

Research on encoding and decoding of non-binary polar codes over GF(2m)

Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2^m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.     

CPFinder: Finding an unknown caller's profession from anonymized mobile phone data

Identifying an unfamiliar caller's profession is important to protect citizens' personal safety and property. Owing to the limited data protection of various popular online services in some countries, such as taxi hailing and ordering takeouts, many users presently encounter an increasing number of phone calls from strangers. The situation may be aggravated when criminals pretend to be such service delivery staff, threatening the user individuals as well as the society. In addition, numerous people experience excessive digital marketing and fraudulent phone calls because of personal information leakage. However, previous works on malicious call detection only focused on binary classification, which does not work for the identification of multiple professions. We observed that web service requests issued from users' mobile phones might exhibit their application preferences, spatial and temporal patterns, and other profession-related information. This offers researchers and engineers a hint to identify unfamiliar callers. In fact, some previous works already leveraged raw data from mobile phones (which includes sensitive information) for personality studies. However, accessing users' mobile phone raw data may violate the more and more strict private data protection policies and regulations (e.g., General Data Protection Regulation). We observe that appropriate statistical methods can offer an effective means to eliminate private information and preserve personal characteristics, thus enabling the identification of the types of mobile phone callers without privacy concerns. In this paper, we develop CPFinder —- a system that exploits privacy-preserving mobile data to automatically identify callers who are divided into four categories of users: taxi drivers, delivery and takeouts staffs, telemarketers and fraudsters, and normal users (other professions). Our evaluation of an anonymized dataset of 1,282 users over a period of 3 months in Shanghai City shows that the CPFinder can achieve accuracies of more than 75.0% and 92.4% for multiclass and binary classifications, respectively.     

紫外光通信协作蜂群无人机网络动态能效均衡算法

针对蜂群无人机在复杂战场环境下的能效均衡需求,提出一种紫外光通信协作蜂群无人机网络动态能效均衡算法。该算法结合紫外光抗干扰、高保密的优点,为蜂群无人机提供一种可靠的通信方式,并通过引入自适应节点度、无人机能效和距离稳定度参数加权分簇来选举簇首,使算法更加适用于动态场景。最后结合无线紫外光通信及能量消耗模型,在高斯马尔可夫移动模型下对蜂群无人机进行了仿真分析,结果表明,本算法相比LEACH算法可以将网络生存周期提升16%,同时可将平均簇首数量降低57%,数据传输量提升近两倍。     

通信波段稀土离子掺杂固态量子存储进展

量子互联网是实现多方量子通信、分布式量子计算等量子信息技术的重要基础,量子存储器作为实现互联网的重要部件,对量子信息技术的发展、应用具有举足轻重的作用。如今遍布全球的光纤网络已经是信息传输的有力载体,通信波段的量子存储器因容易嵌入到当前的光纤网络中而备受重视。聚焦于稀土离子掺杂固态体系的通信波段光量子存储,首先介绍稀土离子掺杂固态量子存储的基本原理,包括稀土掺杂材料特性以及存储协议等,然后介绍目前的研究现状,最后简要分析其未来的发展趋势,并对量子互联网的构建做出展望。