ID 原文 译文
58068 提取时频信息并剔除各类干扰，再通过网台分选后得到各类网台跳时粗估计; Thirdly，the time-frequency information of the signals is extracted and all kinds of interference are eliminated. After the network is sorted，the rough estimation range of the hopping time can be calculated.
58069 最后采用 SPWVD 及修正后的截断门限进行跳变时刻的精估计. Finally，SPWVD algorithm and a truncation threshold are used to deal with the rough estimation range，and then a precise frequency estimation is obtained.
58070 仿真结果表明，该算法在混合网台和低 SNＲ 条件下，跳频参数估计精度较高，算法复杂度较低，有效解决了实际跳频通信系统存在频率转换时间条件下的参数估计问题 Simulations show that the parameter estimation of the algorithm has high accuracy and low complexity under the condition of hybrid networking and low SNＲ. The parameter estimation problem of existing frequency switching time in actual frequency hoppingcommunication system has been effectively solved.
58071 为了解决变种恶意代码、未知威胁行为恶意分析等问题，研究了基于梯度提升树的恶意代码分类方法，从大量样本中学习程序行为特征和指令序列特征，实现了智能恶意代码分类功能. In order to solve the problem of variant malicious code and behavior analysis of unknownthreat，a method for malware classification based on gradient boosting decision tree ( GBDT) algorithm isresearched，which learns the characteristics of code behavior and instruction sequence from a large number of samples，and realizes the intelligent malicious code classification function.
58072 将 GBDT 算法引入恶意代码检测领域，使模型结果行为序列具有可解释性，对恶意代码的检测能力大幅提高. GBDT algorithm is introduced into the field of malicious code detection，so that the behavior sequence of the model is interpretable，and improves its ability to detect malicious code significantly.
58073 GBDT 算法能够客观地反映恶意代码的行为和意图本质，能够准确识别恶意代码. GBDT algorithm can reflect thenature of the behavior and intention of malicious code objectively，and identify malicious code accurately.
58074 针对广义频分复用( GFDM) 在频率选择性信道下的最小均方误差( MMSE) 接收机计算复杂度过高的问题，提出了一种基于矩阵解构的低复杂度 GFDM 系统的 MMSE 接收机解调算法. Aiming at the problem that the computation complexity of the existing minimum mean squareerror ( MMSE) demodulator with generalized frequency division multiplexing ( GFDM) over frequency selective channel is relatively high，a matrix deconstruction based low-complexity MMSE GFDM receiver isproposed.
58075 该方法对涉及的大尺寸矩阵做分块处理，发掘了矩阵的特殊性质 ( 稀疏性、准三对角性和块对称性等) ，进而将一系列大矩阵的相乘和求逆运算转化为相应子块间的相乘和求逆，从而使得其耗费的复数乘法次数比原始的 MMSE 接收机解调算法低 2 ～ 3 个数量级. By utilization of the particular structures ( sparse，quasi-tridiagonal，block-symmetric，etc. )in a series of large-sized matrices involved in the receiver，either of large-sized matrix manipulations ( including matrix multiplication and matrix inversion) is partitioned into small-sized matrix manipulations，thereby considerably reducing the computational complexity. Quantitively speaking，the times of complexmultiplications consumed by the proposed MMSE receiver is 2-3 amount levels lower than the originalMMSE receiver.
58076 仿真结果表明，所提出的接收机不会导致误比特率性能下降，因而在未来移动通信的解调系统中具有较高的应用价值. Moreover，simulation shows that the proposed receiver does not suffer from any bit-errorrate degradation. Therefore，the proposed MMSE GFDM receiver possesses vast potentials for future 5Gdemodulation applications.
58077 针对超密集网络( UDN) 中的上行干扰问题，提出了一种基于多点协作联合接收( JＲ-CoMP) 的分簇与资源分配方法. For uplink interference problem in ultra dense networks( UDN) ，a joint clustering and resource allocation scheme is proposed based on coordinated multiple point joint reception ( JＲ-CoMP) .