ID 原文 译文
46836 FPGA 平台上实验证明了所提协议的实用性和有效性。 The practicability and effectiveness of the protocol are confirmed by hardware implementation on FPGA.
46837 为优化提高防空多传感器网络的抗毁性，以网络遭受攻击过程中的总自然连通度为目标函数，根据网络背景设计节点度和连通性约束，建立网络拓扑结构抗毁性优化模型， To improve the invulnerability of air defense multiple sensor network, its topological structure optimizationmodel was established with the constraint of network node’s degree and network connectivity, combined with the totalsum of network’s natural connectivity for attack strategy as object function.
46838 并设计利用改进人工免疫算法求解优化模型的步骤。 Then, solving steps of the model weredesigned based on improve artificial immune algorithm to solve the model.
46839 为提高人工免疫算法种群中有效抗体数目进而提升搜索效率，改进算法添加接种疫苗和抗体修复步骤。 In order to improve the searching efficiencyof the algorithm, new steps of immune review and antibody correction were designed to increase the number of effectiveantibodies in population.
46840 仿真实验表明优化模型的合理性和改进人工算法求解的快速有效性，而采用按度攻击策略的总自然连通为指标进行优化可显著提高网络的抗毁性。 Simulation and results prove rationality of the model and feasibility of the modified artificialimmune algorithm, optimization based on the index of total natural connectivity for attack strategy can improve theinvulnerability of air defense multiple sensor network.
46841 LDPC 码的开集识别是信道编码识别领域的一个难点。 LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.
46842 首先，对实现开集识别所需接收码向量的数量进行了分析，给出了其理论下界。 First, theoretical analysis was provided for the number of received code-vectors needed for the reconstruction, and a low-er bound was derived.
46843 然后，根据这一下界，基于寻找小重量码字的算法，提出了一种新的 LDPC 码开集识别方法。 Then, according to the lower bound, and based on an algorithm for finding low weight code-words,a new reconstruction method was proposed.
46844 该方法在接收码向量空间的对偶空间中逐个寻找小重量向量，即待识别的稀疏校验向量，从而重建稀疏校验矩阵。 It looked for low weight vectors one by one from the dual space of the re-ceived code-vector space and used them to reconstruct the sparse parity-check matrices.
46845 利用指数分布对迭代次数进行建模，给出了该方法的迭代停止准则及运算量分析。 Number of iterations and thecomputational complexity of the method were analyzed based on exponential distribution theory.