辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.
到目前为止，对于交换群和可解群，CI -性的研究已有了相当彻底的结果。
Concerning the Abelian groups and solvable groups, the researches on CI-properties had rather thorough results until now.
本文第四部分3.4，主要讨论了交换子群对有限群可解性的影响，得到了有限群可解的若干充分条件。
In the last section, namely 3.4, we mainly discuss how Abelian subgroups influent the solvability of finite groups, so we obtain some sufficient conditions of solvable groups.
利用极大子群的几乎正规的概念得到了有限群为可解群的若干充要条件。
By using the concept of almost normal about maximal subgroup, some sufficient and necessary conditions for a finite group to be solvable are obtained.
本文得到了有限生成的无限可解群的多余子群的一些结果，它们是有限群的某些相应结果的推广。
In this paper, some results on the superfluous subgroups of a finitely-generated infinite soluble group are obtained, which are the generalizations of the corresponding results of a finite group.
设F是任一子群闭的局部群系，利用极小子群的F超中心性，给出一类可解群属于F的一个充分条件，由此得到一些群的结。
Using the F hypercenter of minimal subgroups, this paper gives a sufficient condition under which a soluble group belongs to a given formation F.
本文首先分类了内-（2，2＇）-闭群，再对每个非极大偶阶真子群为（2，2＇）-闭的不可解群进行了分类。
The finite inner-(2,2')-closed groups were classified and this class of finite groups with every non-maximal proper subgroup of even order of(2,2')-closed were also classified.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
The braid groups have many hard problems that can be utilized to design cryptographic primitives, for example, the word problem, conjugacy problem, and root problem.
针对该算法易陷入局部最优解、求解速度较慢的缺陷，本文通过对蚁群算法的改进和调整，构造出最大—最小蚁群算法。
But the algorithm easily trapped into local optimal solution and solved the problem more slowly, this paper constructed Max-Min ACO algorithm through the improvement and adjustment of ACO algorithm.
它大大减少了蚁群算法的搜索时间，有效改善了蚁群算法易于过早地收敛于非最优解的缺陷。
It greatly reduces the searching time of ant colony algorithm. It also effectively ameliorates the disadvantage of easily falling in local best of ant colony algorithm.
利用均匀设计方法生成初始菌群，使初始菌群在解空间中足够均匀，以充分利用解空间的信息。
Firstly, the initial bacteria are generated using uniform design, in order to make them uniform distribution and make greatly use of the information in the solution space.
根据伽师震群地震的2 1 77个P波初动方向记录，计算了伽师震群的平均震源机制解。
The average focal mechanism of the swarm area has been inversed from the spatial distribution of the polarities of 2177 P-wave initial motions in the Jaishi swarm.
根据伽师震群地震的2 1 77个P波初动方向记录，计算了伽师震群的平均震源机制解。
The average focal mechanism of the swarm area has been inversed from the spatial distribution of the polarities of 2177 P-wave initial motions in the Jaishi swarm.
应用推荐