离散群

The security~ of these cryptosystems is based on the dificulty in solving descrete logarithms with Abelian group .

本文讨论了一些公钥密码体制(ElGamal加密与解密算法、Diffie -Hellman密钥交换方案和Shamir协议)在阿贝尔群上的扩展，它们的安全性均建立在阿贝尔群上离散对数求解困难性的基础之

The rational points of an elliptic curve forms an additive group. The discrete logarithm problem of this group is called elliptic curve discrete logarithm problem.

椭圆曲线上的有理点会形成一个加法群，此加法群上的离散对数问题称为椭圆曲线离散对数问题(elliptic curve discrete logarithm problem)。

It proves the singular transport operator generates a strongly continuous C_0 semigroup V(t0)and the weak compactness properties of the second-order remained term of the Dyson-Phillips expansion for the C_0 semigroup V(t0)in L1 space,and to obtain the spectrum of the singular transport operator only consist of,at most,finitely many isolate eigenvalues which have a finite algebraic multiplicity in trip Γ.

证明了这类方程相应的奇异迁移算子产生C0半群和该半群的Dyson-Phillips展开式的二阶余项是弱紧的，从而得到了该迁移算子的谱在区域Γ中仅由至多有限个具有限代数重数的离散本征值组成等结果。上饶师院数学与计算机系江西上饶334001；南昌大学数学系江西南昌330047袁邓彬

In this paper, no-wait flow shops scheduling problems for a mixed discrete particle swarm optimization, through the establishment of the location of the vector encoding and scheduling program of mapping relations between the continuous particle swarm optimization algorithm is applied to discrete no-wait flow shops scheduling problem.

针对无等待流水线调度问题提出了一种混合离散化粒子群优化算法。通过建立位置矢量编码与调度方案之间的映射关系将连续的粒子群优化算法应用于离散的无等待流水线工件调度问题。

Discrete version of PSO, MATLAB environment to solve the problem of discrete optimization helpful.

离散版粒子群算法，MATLAB环境中的，对求解离散优化问题很有帮助。

In chapter three, the elliptic curve discrete logarithm problems on the elliptic curve finite group are discussed.

第3章在介绍有限域上的离散椭圆曲线的基础上，深入讨论了椭圆曲线有限群上的椭圆曲线离散对数问题，研究了目前已知的椭圆曲线离散对数问题的几类求解算法，分析了这些算法的特点和应用范围，并总结归纳出了一系列的安全椭圆曲线选取准则。

In this paper we obtain Jorgensen s inequality of isometry group M of Pinched manifold X and a geometric characteristic of nonelementary subgroups of M.

本文建立了 Pinched流形 X上等距群 M中的Jorgensen型不等式；证得了M中非初等群的一个几何特征；得到了 M中子群的两个离散准则。

Then the thesis defines a communication matrix for the group that includes the three key factors of every email user.

相互拥有通讯地址的用户群形成一个相对稳定且独立的邮件群组，论文先为群组定义了一个通讯频率邻接矩阵，并借助该矩阵建立了一个可以迭代的离散模型。

We define Condition A,and show that Condition A is thenecessary condition of discrete groups,and uniformly bounded torsion isspecial case of Condition A.

我们引入条件A，并且指出条件A是离散的必要条件，一致有界挠是它的特殊情况，同时在条件A之下，建立了PinchedHadamard流形的等距群的离散准则。

Althoughthere are many types of nonelementary subgroups,these types of nonelementarysubgroups are all equivalent under the discrete condition.However this specialnonelementary subgroup of 〓 is a only exception.In our study,we note thatthe fixed points of 〓 transformations of 〓 are more complex than theplaner case.

首先，我们举例说明这种非初等群与Beardon、Martin以及Bowditch非初等群都不等价，而且，对这种非初等群，经典的〓不等式和离散准则也都是不成立的。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。