• 一种非交换的无限群,该群中许多困难问题是不可的,如字问题共轭问题问题利用这些困难问题可以去设计一些密码协议。

    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.

    youdao

  • 到目前为止,对于交换,CI -性的研究已有相当彻底结果

    Concerning the Abelian groups and solvable groups, the researches on CI-properties had rather thorough results until now.

    youdao

  • 本文第四部分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.

    youdao

  • 利用极大群的几乎正规概念得到有限群的若干充要条件

    By using the concept of almost normal about maximal subgroup, some sufficient and necessary conditions for a finite group to be solvable are obtained.

    youdao

  • 本文得到有限生成无限多余子群一些结果,它们有限的某些相应结果的推广

    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.

    youdao

  • 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.

    youdao

  • 本文首先分类-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.

    youdao

  • 是一种非交换的无限群,群中许多困难问题是不可,如字问题、共轭问题问题等,利用这些困难问题可以设计一些密码协议。

    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.

    youdao

  • 针对算法陷入局部最优速度较缺陷,本文通过群算法的改进调整构造出最大—最小蚁群算法。

    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.

    youdao

  • 大大减少了算法搜索时间有效改善了蚁群算法易于过早地收敛于非最优缺陷

    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.

    youdao

  • 利用均匀设计方法生成初始群,使初始菌群空间中足够均匀,以充分利用空间的信息

    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.

    youdao

  • 根据伽师地震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.

    youdao

  • 根据伽师地震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.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定