ID 原文 译文
44956 其次，从 RSC 码约束长度较小特征出发，构建出编码约束长度为 3~7 的多项式数据库，通过遍历构建的数据库多项式，计算多项式所对应的对数符合度值， Then because of constraint length of RSC, the polynomial database could be generated, and then logarithmic conformity of every polynomial could be calculated when traversing the database.
44957 最后，查找最大的对数符合度值所对应的多项式，即完成多项式识别。 As the results, the RSC could be recognized, because the correct polynomial could make the conformity maximum.
44958 该算法只需遍历所构建的 RSC 码多项式库，减少遍历次数，其计算量大大减少；由于算法直接利用的是未经量化的软判决信息，所以具有较强的低信噪比适应性。 The algorithm has small amount of calculation because of finite traversal, which was only related to amount of intercepted data, besides, this algorithm has good error tolerance by soft decisions.
44959 仿真结果表明：在较低的信噪比条件下，参数的识别率能达到 90%以上，同时与现有算法相比，所提算法对参数的识别性能与时效性具有明显的优势。 The simulation results show that the correct ratio of recognition can reach 90% at SNR of 0 dB and its performances are obviously superior to those of existing algorithms.
44960 受到量子图态几何结构和特性的启发，提出了一种基于图态和中国剩余定理的量子秘密共享方案。 Based on the topological features of quantum graph states, a quantum secret sharing scheme based on Chinese remainder theorem with a vivid graphic description was proposed.
44961 在该方案中，分发者在有限域内利用中国剩余定理分发秘密， The dealer extracts sub-secrets according to Chinese remainder theorem over finite field, which were imbedded with quantum graph states and transmitted to the legal participants with unitary operations.
44962 秘密被编码到量子图态里并且通过酉正操作传送给合法参与者，合法参与者使用群恢复协议合作重建子秘密。 Group-recovery protocols were used in the secret recovering processing through rebuilding sub-secrets among legal cooperative participants.
44963 该方案提供了一个简洁的方法，即通过使用纠缠图态的稳定子来传递信息，分析显示它能提供更好的信息安全性和性能。 Analysis shows that it could provide better security and capability of the information.
44964 针对蚁群算法搜索空间大、收敛速度慢、容易陷入局部最优等缺陷，提出一种基于动态凸包引导的偏优规划蚁群算法。 To solve basic ant colony algorithm’s drawbacks of large search space, low convergence rate and easiness of trapping in local optimal solution, an ant colony algorithm of partially optimal programming based on dynamic convex hull guidance was proposed.
44965 改进后的算法动态控制蚂蚁的待选城市范围，有助于在跳出局部最优并向全局最优逼近的基础上减少蚂蚁搜索空间； The improved algorithm dynamically controlled the urban selection range of the ants, which could reduce the search space of ants on basis of helping the algorithm to jump out of local optimal solution to global optimal solution.