ID	原文	译文
5434	此外，还提出了一种基于 NFV 的前置中间盒的实现方法，使这种 UDM 机制更为经济和有效，实现了基于该机制的原型系统，并对其进行大量测试。	An NFV-based method of implementing the up-front middlebox was put forward, which made the UDM mechanism be economical and effective. A prototype systembased on this mechanism was implemented and lots experiments were tested.
5435	实验结果表明，基于 NFV 的 UDM 机制能够实时有效地检测和防止对控制器的 DDoS 攻击。	The experimental results show that the UDMmechanism based on NFV can real-time and effectively detect and prevent against DDoS attacks on SDN controllers.
5436	研究了口碑参与模式下参与用户之间的博弈行为，探究个体利益最大化的最佳策略。	The behavior of mobile contributors in mobile crowd sourcing with the WoM was investigated. It was supposed that each mobile contributor was rational, seeking for the highest utility.
5437	首先，给出了口碑参与模式下移动用户行为交互场景和相关定义，提出的移动用户效应函数不仅考虑了用户的数据贡献量，还考虑了用户邀请与合作因素，能激励用户之间相互合作；	The behavior of mobile contributors with a two-level Stackelberg game was formulated. In the first-level game, a mobile contributor who directly worked for the crowdsourcer acted as the leader, while contributors invited by first-level con-tributors were followers called the second-level contributors. In the second-level game, the second-level contributors were the leaders and contributors invited by them were followers.
5438	然后，基于博弈论斯塔克伯格模型分析了口碑参与模式下用户的博弈过程，把用户之间的行为交互分成两级博弈过程，应用逆向归纳法分析得出一级和二级博弈中用户的最佳对策，并获得了斯塔克伯格均衡；	The Nash equilibrium for each Stackelberg game was proved was existed and unique, and designed an algorithm to reach the equilibrium.
5439	最后，证明了斯塔克伯格均衡的存在唯一性，提出了计算斯塔克伯格均衡的算法。	Backward induction approach to compute the best response of each game was adopted,
5440	数值实验结果验证了用户效应函数的合理性和斯塔克伯格均衡的存在唯一性。	and the simulation results show the correctness of theoretical anal-ysis for the interaction among contributors in crowdsoucing with WoM.
5441	多用户空时分组编码系统存在译码复杂度高的问题。	Multi-user space time block code systems have the problem of high decoding complexity.
5442	为了降低系统译码复杂度并保证较好的系统性能，将低复杂度的迫整检测算法用于多用户空时分组编码中，并基于等效噪声功率最小化原则获取了迫整检测的差错概率上界。	To ensure good sys-tem performance with low decoding complexity at the same time, low complexity integer-forcing (IF) detection algorithmwas applied to multi-user space time block code. Then the upper bound of error probability for IF detection was derivedby minimizing the equivalent noise power.
5443	为了解决迫整检测的多用户空时分组编码设计问题，提出了基于迫整检测的全分集多用户空时分组编码设计准则，证明只要每个用户的空时分组编码方案均满足非零奇异值特性，则多用户空时分组编码可获得满分集增益，且其编码增益与最小奇异值有关。	To obtain good multi-user space time block code when decoded with IF detec-tion, a full-diversity design criterion was proposed. It was proved that full diversity could be achieved if every user'sspace time block code had property of non-vanishing singular value.