ID |
原文 |
译文 |
46366 |
主要关注是否进行卸载,如何选取合适的卸载目标设备,以及如何分配任务的问题。 |
The issues that whether to offload or not was addressed, how to select the suitable mobile device to offload, and how to assign workload. |
46367 |
以上问题使用博弈方法进行定义,并使用分布式算法逼近最优结果。 |
Game theoretic approach was used to formulate this problem, and then, a distributed scheme was designed to achieve the optimal solution. |
46368 |
仿真结果证明了该方法的正确性与有效性。 |
The experimental results validate the rightness and effectiveness of proposed scheme. |
46369 |
I-PRESENT 是一种适用于 RFID、无线传感节点等资源受限环境的代换——置换型分组密码。 |
I-PRESENT was a lightweight SPN block cipher for resource-constraint environments such as RFID tags and sensor networks. |
46370 |
利用中间筛选技术来构造 I-PRESENT 的 biclique 结构,首次对全轮 I-PRESENT-80 和 I-PRESENT-128 算法进行了 biclique攻击。 |
The biclique structures of I-PRESENT with sieve-in-the-middle technique was an constracted. The bi-clique cryptanalysis schemes on full-round I-PRESENT-80 and I-PRESENT-128 were proposed for the first time. |
46371 |
结果表明,biclique 对 I-PRESENT-80 和 I-PRESENT-128 攻击的数据复杂度分别为262 和362 个选择密文;攻击的时间复杂度分别为79.482 和127.332 次加密。 |
The results show that the data complexity of the biclique cryptanalysis on I-PRESENT-80 and I-PRESENT-128 is262 and362 chosen ciphertexts respectively,and the time complexity on them is 79.482 and 127.332 encryptions respectively. |
46372 |
攻击在时间复杂度和数据复杂度上均优于穷举。 |
The time and data complexity are better than that of the exhaustive attack. |
46373 |
利用提出的I-PRESENT 的密钥相关性技术,攻击的时间复杂度可以进一步降低到78.612 和126.482 。 |
In addition, the time complexity on them cane reduced to78.612 and 126.482 encryptions by using related-key technology of I-PRESENT. |
46374 |
针对多小区 MIMO 上行链路中有限反馈干扰对齐方案的不足,给出一种基于优化比特分配的有限反馈干扰对齐方案。 |
A novel limited feedback for interference alignment algorithm was proposed based on the disadvantages of traditional limited feedback interference alignment schemes for MIMO uplink. Unlike the traditional linear interference alignment, an iterative scheme was presented. |
46375 |
为克服低 SNR 时频谱效率的损失,通过最大化用户的信号功率与泄露到其他小区的干扰与噪声功率之和的比值来求预编码,基于最大化每个数据流的信干噪比来设计干扰抑制矩阵。 |
The precorder was designed through maximizing the target signal to the interference leakage and noise ratio, and interference suppression matrix was designed by maximizing the signal to interference plus noise ratio for each data stream, which can come over rate loss in low SNR. |