ID	原文	译文
18185	最后，在主信号抑制的基础上，利用分形理论中盒维数完成对信号的特征提取，并利用单核支持向量机验证个体识别性能。	Finally, a feature extraction based on box-counting dimension and a classification based on support vector machine are exploited to verify theidentification performance.
18186	实验结果表明，与主信号抑制之前相比，主信号抑制算法下个体识别率提升了10%左右，验证了同步压缩小波变换的主信号抑制算法对辐射源个体识别率提升的有效性。	The simulation results show that the correct identification rate of SEI using theproposed primary signal suppression outperforms the conventional SEI with 10%, which proves the practicalimprovement of the proposed primary signal suppression algorithm on specific emitter identification.
18187	针对车联网业务的低时延、低功耗需求及海量设备计算卸载引起的网络拥塞问题，该文提出一种在云雾混合网络架构下的联合计算卸载、计算资源和无线资源分配算法(JODRAA)。	For the problems of low delay, low power requirement and access congestion caused by computational unloading of mass devices, a Joint Offloading Decision and Resource Allocation Algorithm (JODRAA) is proposed based on cloud-fog hybrid network architecture.
18188	首先，该算法考虑将云计算与雾计算结合，以最大时延作为约束，建立最小化系统能耗和资源成本的资源优化模型。	Firstly, the algorithm considers the combination of cloud and fog computing, and establishes a resource optimization model to minimize system energy consumption and resource cost with maximum delay as constraint.
18189	其次，将原问题转化为标准二次约束二次规划(QCQP)问题，并设计一种低复杂度的联合卸载决策和计算资源分配算法。	Secondly, the original problem istransformed into a standard Quadratically Constrained Quadratic Program (QCQP) problem, and a low-complexity joint unloading decision-making and computational resource allocation algorithm is designed.
18190	进一步，针对海量设备计算卸载引起的网络拥塞问题，建立卸载用户接入请求队列的上溢概率估计模型，提出一种基于在线测量的雾节点时频资源配置算法。	Furthermore, considering the access congestion problem caused by massive computing of unloading devices, anestimation model of the overflow probability of unloading user access request queue is established, and an on-line measurement based time-frequency resource allocation algorithm for fog nodes is proposed.
18191	最后，借助分式规划理论和拉格朗日对偶分解方法得到迭代的带宽和功率分配策略。	Finally, theiterative bandwidth and power allocation strategy is obtained by using fractional programming theory andLagrange dual decomposition method.
18192	仿真结果表明，该文算法可以在满足时延需求的前提下，最小化系统能耗和资源成本。	The simulation results show that the proposed algorithm can minimizethe system energy consumption and resource cost on the premise of time delay.
18193	针对经典轨迹与实时轨迹之间的大差异性，该文利用最长公共子序列理论，提出一种鲁棒的轨迹相似度量方法。	In view of the great difference between classical trajectory and real-time trajectory, a robust trajectory similarity measurement method is proposed based on the longest common subsequence theory.
18194	该方法首先利用点到线段之间的距离判断经典轨迹的点与实时轨迹的线段是否一致；	Firstly, the distance between point and line segment is used to judge whether the point of classical trajectory isconsistent with the line segment of real-time trajectory.