ID 原文 译文
4263 最后，提出异步最佳响应算法迭代出最优无线接入策略。 Finally, the asynchronous optimal response algorithm was proposed to iterateout the optimal radio access strategy.
4264 仿真结果表明，与现有服务迁移策略相比较，所提算法能够在保证服务迁移成本稳定的情况下降低用户服务请求的感知时延。 Simulation results validate the proposed algorithm can reduce the perceived delay un-der the service migration cost constraint while comparing with other existing algorithms.
4265 针对现有加密图像检索方案未考虑不同密钥加密图像集的情况，基于局部敏感哈希、安全近邻及代理重加密技术提出了基于边缘计算的支持多密钥的加密图像检索系统（包含基础方案和改进方案）。 Aiming at the fact that the existing encrypted image retrieval schemes do not consider different keys to encryptimages, a multi-key encrypted image retrieval system based on edge computing (including basic scheme and enhancedscheme) based on local sensitive hashing, secure nearest neighbor and proxy re-encryption technologies was proposed.
4266 所提方案不但提高了图像查询效率、精度，而且降低了查询用户的额外计算开销。 The retrieval efficiency and accuracy were improved and the extra computational cost of query users was reduced.
4267 安全性分析表明，所提基础方案仅可抵抗已知密文攻击，而所提改进方案可抵抗已知背景攻击。 Secu-rity analysis shows that the basic scheme can only resist the known ciphertext attack, while the enhanced scheme can res-ist the known background attack.
4268 基于实际数据集的实验性能测试表明，所提方案在实际应用场景中是可行的。 The experimental performance test based on the real-world dataset shows that the pro-posed schemes are feasible in practical application scenarios.
4269 以最大化缓存收益为目标，针对部署缓存的 NOMA 异构网络下的基站用户匹配及功率分配问题，结合消息传递及 DC 规划提出了 NOMA 联合优化算法。 Aiming at maximizing the cache revenue, a joint user association and power allocation algorithm was proposed forthe matching of base stations with users and power allocation in a NOMA heterogeneous network with caches, a NOMA jointoptimization algorithm which was achieved by combing with message passing and DC programming was proposed.
4270 首先将约束条件合并到目标函数中，通过计算新的优化问题中函数节点与变量节点间消息传递的边缘得到用户协同结果； First,the constraints were incorporated into the objective function, and the user association result was obtained by calculating themarginal of the message passing between the function node and the variable node in the new optimization problem.
4271 然后将原优化问题变形为 2 个凸函数差的形式，通过 DC 规划对功率资源进行分配； Then, theoriginal optimization problem was transformed into the form of the difference between two convex functions, and allocatepower resources through DC programming.
4272 最后迭代计算得到最终的用户协同及功率分配结果。 Finally, the final user association and power allocation results are obtained throughiterative calculations.