ID	原文	译文
2843	同时推广和优化了文献［8，9］的研究结果，拓宽了实际应用领域的范围。	The results show that the algorithm is simple and fast, and it does not reduce the numerical accura-cy. Another some results of paper［8, 9］are generalized.
2844	量子遗传算法具有种群规模小，全局搜索能力强的特点被广泛应用于各类优化问题的求解。	The characteristics of strong global search ability with small population size lead to the quantum genetic al-gorithm is well popular in solving optimization problems.
2845	为了进一步提高量子遗传算法的收敛速度和搜索稳定性，克服算法的早熟问题，本文改进了基于自适应机制的量子遗传算法。	In order to further improve the convergence speed, search stability and overcome the pre-matureness of the quantum genetic algorithm, an improved adaptive mechanism based quantum genetic algorithm was presented in the paper.
2846	在自适应量子遗传算法的基础上根据种群的适应度定义了个体相似度评价算子、个体适应度评价算子和种群变异调整算子及相应算子的计算方法，	For the presented algorithm, the individual similarity evaluation operator, individual fit-ness evaluation operator and population mutation adjustment operator were defined and added into the self-adaptive based quantum genetic algorithm. The way of calculating the three operators were also proposed.
2847	利用多算子协同评价当前种群状态并根据进化代数的变化，自适应的改变个体的变异概率，提高了算法全局寻优能力和收敛速度，降低了算法陷入局部寻优的概率。	Therefore, the current population state can be evaluated by the operators cooperatively, and the individual's mutation probability can be determined according to the current population state. The proposed algorithm can improve the global optimization ability and convergence speed, and reduces the probability of falling into local optimization.
2848	此外，为了提高算法的时间效率，将算法采用并行多宇宙的方式实现。	In addition, a parallel multi-universe mechanism is employed toimprove the time efficiency of the algorithm.
2849	实验结果表明，本文提出的算法在全局搜索性能、收敛速度和时间效率方面有较好的综合表现。	Experimental results show that the proposed algorithm has a good performancein the global search performance and time efficiency
2850	传统影子图像连接的(t，s，k，n)分存易导致分发影子图像大小不等，基于伯克霍夫插值的(t，s，k，n)分存不能高效恢复;针对以上问题，采用随机参与值通过(k，s)和(k-t，n-s)分存来构造主密钥(t，s，k，n)分存并通过第 3 方公信方存储的 MD5 值以防止作弊。	Conventional shadow image connection based(t, s, k, n)sharing is prone to different size shadow ima-ges and Birkhoff interpolation based(t, s, k, n)sharing leads to low recovery efficiency, while in double authenticationsbased self-recovery image sharing, the recovery capabilities of secret image and backup image are very limited. To ad-dress these problems, random participation values were used to construct master key based(t, s, k, n)sharing by meansof(k, s)and(k-t, n-s)schemes and M D5 values stored in the third party were used to prevent cheating.
2851	所提策略由主密钥对密图 LL 子带置乱来形成对显著比特多备份、对非显著比特少备份和经主密钥不同程度置乱的多版本备份图;	The proposed scheme scrambled LL subband of secret image by master key and formed multi-version backup images with different scrambling degrees where more backups for more significant bits.
2852	引入限制性双重认证在保持认证精度的同时，将尽可能多的备份比特通过 GF(2^8)域(k，n)分存嵌入来形成嵌密掩体。	Restricted double authentication strategy can embedas many backup bits as possible while maintaining authentication accuracy by(k, n)sharing over GF(2^8)field to form stego carriers.