ID 原文 译文
24505 在贝叶斯框架下利用条件迭代模型（IteratedConditional Mode，ICM）算法求解距离-多普勒单元所属地物类型的最大化后验概率对多频带 SAR 图像进行分类，接着利用图像形态学操作对图像分类结果进行区域提取。 Subsequently, in the Bayesian framework, iterated conditional mode (ICM) algorithm is used to solve the maximum posterior probability of the feature type of the Range-Doppler unit, so as to accurately classify the multiband SAR images. Then, the image classification results are obtained by image morphology operation.
24506 最后，对每个闭合区域分别估计杂波协方差矩阵，并进行自适应杂波抑制处理。 Finally, the clutter covariance matrixis estimated separately for each closed region, and adaptive clutter suppression processing is performed.
24507 相比于传统方法，本文方法在非均匀杂波环境下不仅能提高起伏区域强杂波10~15dB的强杂波抑制能力，还可以减少平坦区域慢速运动目标约2.5dB的输出能量损失。 Compared with the traditional method, the proposed method not only can improve the suppression performance about 10~15 dB for the strong clutter in undulating areas, but also reduce the output signal power loss about 2.5dB of the moving targets in flat areas.
24508 为了提升粒子群算法的全局寻优与局部精细搜索能力并加快收敛速度，提出了基于直觉模糊熵的混合粒子群优化算法。 In order to improve the global and local fine search capabilities of the particle swarm algorithm and accelerate the convergence speed, hybrid particle swarm optimization algorithm based on intuitive fuzzy entropy is proposed.
24509 该算法采用粒子的历史最优解信息构造直觉模糊熵的自适应函数，并将熵值作为扰动因子动态调节惯性权重，同时建立自适应全局最优粒子学习策略对扰动后的粒子进行训练，在保持多样性传播的基础上选择学习对象，使粒子探索更多新区域，实现种群间的协作与并行进化。 The algorithm constructs an adaptive function of intuitive fuzzy entropy by using the information of the historical optimal solution of particles, and uses the entropy value as a disturbance factor to dynamically adjust the inertia weight. At the same time, it establishes an adaptive global optimal particle learning strategy to train the disturbed particles, chooses learning objects based on maintaining the diversity of propagation, enables the particles to explore more new areas, and realizes the cooperation and parallel evolution among populations.
24510 通过仿真实验，将本文算法与两种衍生算法以及其他改进粒子群算法在 11 个测试函数上进行比较，结果表明，本算法在求解精度、收敛速度和寻优效率上均有更好表现。 Through simulation experiments, the algorithm is compared with two derivation algorithms and other improved particle swarm optimization algorithms on 11 test functions. The results show that the algorithm performs better in solving accuracy, convergence speed and optimization efficiency.
24511 基于非交换群的抗量子密码体制是密码学的一个研究热点，其群的阶在一定程度上保证了求逆运算的困难性。 Post quantum cryptography based on non-commutative group is a hot topic in cryptography. The order of thegroup ensures the difficulty of inverse operation to some extent.
24512 本文对二元生成的传递置换群< g1, g2>的阶这一代数命题进行了研究，给出了传递置换群的充分必要条件，以及二元生成的传递置换群阶的下界估计式。 We mainly study the algebraic proposition of order of transitive permutation groups< g1, g2>generated by two elementsg1, g2, give a necessary and sufficient conditions of transitive permutation group, and get a lower bound estimation of order of transitive permutation groups generated by two elements.
24513 在实例化生成g1, g2使传递置换群< g1, g2>的阶满足相应下界值的过程中，给出了一类特殊n阶轮换表成两个n元置换g1, g2乘积的方法，以及相应的二元生成的传递置换群< g1, g2>的设计算法。 In the process of the instantiation for generating g1, g2, which enables the order of transitive permutation groups < g1, g2> to satisfy the corresponding lower bound value, we give a method expressing a class of special n order cycles as the product of twonary permutations and a corresponding design algorithm on transitive permutation groups < g1, g2> generated by two elements.
24514 最后，阐述了传递置换群在对称密码体制中的应用。 In the end, this paper describes the application of transitive permutation group in symmetric cryptography.