ID	原文	译文
2133	然后基于改进Kay 算法进行粗估计，再用 L＆R 算法进行细估计;	The improved Kay algorithm is used to ensure the estimation range. And then, the L＆R algorithm is used for fine estimation.
2134	推导了改进前导码结构下的 Kay 估计子和 L＆R 估计子。	Also, the modified Kay and L＆R estimators are derived under the improved preamble structure.
2135	理论分析和仿真结果表明，所提同步方案的估计范围扩大了一倍，估计精度也可以达到克拉美罗界。	Theoretical analysis and simulation results show that the range of the proposed estimation syn-chronization scheme is two times the range of the classical estimators, and the estimation accuracy can reach CRB.
2136	本文考虑了多个供应商、多个制造商和多个零售商的三级供应链物流运输调度，以最大限度地降低采购、加工和运输成本为目标，提出了带容量约束的供应链物流运输调度模型(Capacitated Vehicle Routing Problem inSupply Chain，CVRPSC)。	Considering a two-level vehicle routing problem in a three-echelon supply chain with multiple suppliers, multiple manufacturers and multiple stockists, with the aim of minimizing the cost of purchasing, production and transporta-tion, this paper proposes a model for the capacitated vehicle routing problem in supply chain (CVRPSC).
2137	进一步地，本文构造了求解 CVRPSC 的双层变邻域蝙蝠算法(Two-Level Bat Algorithm withVariable Neighborhood Search，TLBAVNS)。	Further, a two-lev-el bat algorithm with variable neighborhood search (TLBAVNS)is presented to solve CVRPSC.
2138	该算法提出了一种双层蝙蝠位置的定义，引入了相应的蝙蝠算法的更新操作，采用变邻域局部搜索策略加强算法的寻优能力。	The algorithm proposes adefinition of two-level bat position and introduces the corresponding operations of the bat algorithm. In addition, a variable neighborhood local search is proposed to enhance the optimizing capability of TLBAVNS.
2139	实验证明:TLBAVNS 能在合理的时间内求解 CVRPSC;在大部分测试算例中，该算法相对于对比算法均表现出了更强的寻优能力和稳定性。	The experiments have shown that TLBAVNS can effectively solve the instances of CVRPSC within a suitable amount of time and significantly outperforms all the other alternatives in most of the cases.
2140	为了解决现有算法在 RSC 码多项式参数识别过程中，实时性不好和容错性差两大缺点，提出了具有低信噪比适应能力的 RSC 码快速迭代识别算法。	In order to solve the defects which are poor error tolerance and large amount of calculation in current algo-rithms in recognition of the RSC encoder, a fast iterative recognition algorithm which has excellent performance was pro-posed.
2141	首先根据 RSC 码元之间的线性约束关系，定义了双曲正切符合度概念，该概念能够表征在某一多项式参数下，截获码元之间的线性关系成立的可能性大小;	Firstly, according to the linear constraint relation between RSC symbols, the concept of hyperbolic tangent conforma-tion was defined;this can measure the possibility of the linear relationship between the symbols under a certain polynomial parameter.
2142	其次将截获码元总的双曲正切符合度值作为代价函数，然后将待识别的多项式参数的概率值作为代价函数自变量，从而将 RSC 码参数识别问题转化为多元函数极大值求解问题;	Secondly, the total hyperbolic tangent coincidence value of the intercepted symbol was used as a cost function, and then the probability value of the polynomial parameters were regarded as the cost function independent variable and the problem of RSC code identification was transformed into the maximum value of the multivariate function.