ID 原文 译文
4563 最后根据核值表的核值决策规则，完成所有决策规则的约简，从而实现对未评分的用户进行预测评分。 Finally, according to the nuclear value decision rule of the core value table, the reduc-tions of all decision rules were utilized to predict the rating scores of un-rated items.
4564 实验结果表明，所提方法可以有效地缓解稀疏数据对协同过滤带来的负面影响，提高推荐结果的准确度。 Experimental results suggest that the proposed approach can alleviate the data sparsity problem of CF, and provide recommendations with higher accuracy.
4565 针对认知正交频分多址接入（OFDMA）上行通信系统，提出了一种基于干扰效率最大的稳健功率与子载波分配算法。 For the cognitive OFDMA uplink communication system, a robust power and subcarrier allocation algorithm based on maximum interference efficiency was proposed.
4566 首先，考虑主用户干扰约束、次用户发射功率约束、子载波分配约束和次用户最小速率约束，建立基于中断概率的稳健资源优化模型。 Firstly, considering primary user interference constraint, sec-ondary user transmit power constraint, subcarrier allocation constraint and secondary user minimum rate constraint, a ro-bust resource optimization model based on outage probability was established.
4567 然后，利用伯恩斯坦近似和 Dinkelbach 法，将原基于中断概率的非凸问题转换成等价凸优化问题，并利用拉格朗日对偶函数法求得解析解。 Then, by using Bernstein approximationand Dinkelbach's method, the original non-convex problem based on outage probability was transformed into an equiva-lent convex optimization one, and the analytical solution was obtained by Lagrangian dual function method.
4568 同时，分析了算法的计算复杂度和稳健灵敏度。 Meanwhile,the computational complexity and robust sensitivity of the algorithm were analyzed.
4569 仿真结果表明，所提算法具有较好的干扰效率和稳健性。 The simulation results show that the proposed algorithm has better interference efficiency and robustness.
4570 轻量级分组密码算法 GRANULE 和 MANTRA 结构简单，加密速度快且易于软硬件实现，特别适用于资源受限环境。 The lightweight block cipher algorithms called GRANULE and MANTRA have a simple structure, fast en-cryption speed, and they can be easy implemented in software and hardware. Two algorithms are especially suitable forresource-constrained environments.
4571 为对这 2 种算法进行安全性分析，提出一种不可能差分区分器的自动化搜索方法。 To analyze the security of two algorithms, an automatic search method of impossibledifferential distinguishers was proposed.
4572 基于 GRANULE和 MANTRA 算法结构特性，通过分析其 S 盒的差分分布表得到 S 盒差分特征，再利用中间相遇思想，分别对从加/解密方向得到的差分路径进行遍历，筛选出概率为 0 的最优差分路径。 Based on the structural characteristics of the GRANALE and MANTRA, the S-boxdifferential characteristics were obtained by analyzing the S-box differential distribution table, and then the idea of interme-diate encounter was used to traverse from the difference path obtained from the encryption/decryption direction seperately toselect the optimal differential path with probability 0.