交换算法

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

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

Experimental results in TiGems7.0 illustrate that this algorithm is independent of the numerical error accumulated in intersection computation, and can implement the data exchange of IGES B-rep model built by different CAD systems such as SolidWorks and Pro/E.

在TiGems7.0系统中的实验结果表明，该算法不依赖于求交运算中造成的数值误差，具有较好的鲁棒性，能够实现IGES的边界表示格式在SolidWorks，Pro/E等系统中的数据交换功能。

It is in common use that data encryption ensures networks security. The paper furthers its research on the Ethernet hardware encryption, and focuses on the study of the application of the IDEA algorithm in data link layer. Also the protocol of the secret keys'exchange based on the Diffie-Hellman algorithm is presented.

数据加密是保证网络安全的常用手段，本文接着研究了以太网硬件加密技术，重点研究了IDEA算法在链路加密中的应用，同时基于Diffie-Hellman算法设计了一种密钥交换协议。

In IPSO,to update the particles,the crossover idea of genetic algorithm is utilized by particles to exchange information.

算法中，利用遗传算法的交叉思想来完成粒子间的信息交换，以期达到粒子更新。

The double-crossover genetic algorithm based on isomerous multi-population is presented, and which is used to synthesis plane array.

提出了一种异构多种群双交换遗传算法并应用该算法来综合矩形平面阵列。

The buffered-crossbar switch architecture is studied. In this paper, the maximum weight fast algorithm is used in BX, we discover the null row phenomenon in BX's maximum weight fast algorithms, and propose a doubling weight solution for null row, this promotes the performance of maximum weight fast algorithms in BX.

对缓冲Crossbar交换结构进行了研究，论文中将最大权重优先算法应用于BX结构，并对其在BX结构由于存在空列现象所导致的性能恶化提出了空列权重加倍的解决方案，提高了最大权重优先算法在不均衡负载下的性能。

After finishing holistic analyses, and considering the specific and relative research on database technique"s application in the remote structural collaborative experiment, this thesis explores and discusses that the proposed database organization scheme can promote the efficiency of the data"s reposting in the Remote Structural Collaborative Experiment, the efficiency of the remote data exchange, and puts out the improving design compared with the NCREE system, that is to use middleware to realize the separation of the experimental process and DBMS and to set up buffer pool to solve the problems, such as to solve network replacement by getting back the experiment.

在完成了整体分析设计之后，针对数据库技术在远程结构协同实验中的应用作了具体的相关研究，探讨了本文提出的数据库组织方案在远程协同实验中可以提高数据入库效率以及远程数据交换效率以及对比NCREE系统设计提出了改进的设计思想，即采用中间件以实现试验进程与DBMS分离以及设立缓冲池以解决网络复位而要恢复试验等问题，并且还研究了在协同实验中分析中的常用数值积分算法，并着重探讨分析了算子分裂算法。

Different from existing algorithms, the proposed algorithm distributed the multi-iterations in sequent cell times.

与现有算法不同的是，该算法针对可扩展网络交换调度结构的特点，为处于最高优先级的调度器安排了两次迭代。

The crossover operation in the traditional GA operating is that choose two chromosome cross only at random also you can cross a bit, match and cross partly, cross order and cross cycle etc.

传统GA算法中的交叉操作，是随机选取两个染色体进行单点交叉(也可以多点交叉、部分匹配交叉、顺序交叉和周期交叉等等)，但是不管是采用何种交叉操作，新的子代染色体某一基因位上的值都是由两个父代染色体中相应基因位值经过一定交叉运算(直接交换或经算术运算等)所得到的，采用这种交叉算子操作使群体经过多次迭代后群体中的个体开始出现极大的相似性，因此照此下去就会出现早期收敛现象，使得算法的收敛速度非常慢甚至只能求到问题的局部最优解。

The crossover operation in the traditional GA operating is that choose two chromosome cross only at random also you can cross a bit, match and cross partly, cross order and cross cycle etc.

传统GA算法中的交*操作，是随机选取两个染色体进行单点交*(也可以多点交*、部分匹配交*、顺序交*和周期交*等等)，但是不管是采用何种交*操作，新的子代染色体某一基因位上的值都是由两个父代染色体中相应基因位值经过一定交*运算(直接交换或经算术运算等)所得到的，采用这种交*算子操作使群体经过多次迭代后群体中的个体开始出现极大的相似性，因此照此下去就会出现早期收敛现象，使得算法的收敛速度非常慢甚至只能求到问题的局部最优解。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。