ID 原文 译文
4523 为解决车辆移动及边缘服务器有限服务范围造成的服务中断问题，为车辆边缘网络提出一种基于多参数马尔可夫决策过程的动态服务迁移算法。 To handle with the service interruption caused by vehicles' mobility and limited service coverage of edge serv-ers, a dynamic service migration algorithm based on multi-parameters Markov decision process (MDP) model was putforward for vehicular edge network, which was called as dynamic service migration algorithm based on multiple parame-ter (DSMMP).
4524 通过构造包含时延、带宽、服务器处理能力及车辆运动信息的多参数MDP 收益函数，弥补了单纯基于距离进行服务迁移方案的不足； Combining delay, bandwidth, server capacity with vehicle motion information, DSMMP constructed amulti-parameters MDP revenue function to remedy the deficiency of distance-based schemes.
4525 不再使用单一迁移目标服务器，结合车辆运动及时延限制构造候选服务器集合，基于 Bellman 方程表示的长期收益值进行迁移决策； By using vehicle motionand delay constraints, a candidate server set with several candidate servers was defined, and migration decision throughlong-term Bellman revenue values was made.
4526 利用历史数据进行权重计算及数据更新，提高了算法对动态环境的适应能力。 In order to improve the dynamic adaptability of the proposed algorithm, theweight values were calculated and updated by leveraging historical information.
4527 仿真结果表明，所提算法降低了服务时延、数据分组丢失率及服务迁移次数。 Simulation results show that our strategyhas a good performance in terms of delay, packet loss ratio and service migration times.
4528 为克服现有 BCH 码识别算法在低信噪比下适应性差的缺点，提出了一种基于平均余弦符合度的识别算法。 In order to overcome the poor performance of existing algorithms for recognition of BCH code in low sig-nal-to-noise ratio (SNR), a recognition algorithm based on average cosine conformity was proposed.
4529 首先遍历可能的码长值以及 m 级本原多项式域，进行初始码根校验匹配，从而完成码长识别； Firstly, by traversingthe possible values of code length and m-level primitive polynomial fields, the code length was identified by matching theinitial code roots.
4530 然后在识别出码长前提下，遍历 m 级本原多项式下的 GF(2 m )域，其最强纠错能力的本原多项式即为 GF(2 m )域生成多项式； Secondly, on the premise of recognizing the code length, the GF(2 m ) domain was traversed under them-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator pol-ynomial for the domain.
4531 最后求取所有连续码根最小多项式对应的最小公倍式，完成编码生成多项式识别。 Finally, the minimum common multiple corresponding to the minimum polynomial of code rootswas obtained, and the BCH code generator polynomial was recognized.
4532 在校验匹配过程中，引入了平均余弦符合度统计量，基于软判决下符合度的统计特性以及最小错误判决准则求解出最优门限，从而实现本原 BCH码参数快速识别。 In checking matching, the statistic of average cosineconformity was introduced. The optimal threshold was solved based on the minimum error decision criterion and distributionof the statistic to realize the fast identification of the BCH.