算法

Simulation shows that the proposed algorithm can achieve similar performance to that of the ITS using natural binary bit mapping and has about 1dB gap with the ITS using Gray bit mapping. In the high SNR region, the complexity of the proposed bit-level ITS is about 6％~40％ of the symbol-level ITS.

仿真结果表明：在误码率性能上，该算法略次于使用自然二进制映射的基于符号的ITS算法，与使用格雷映射的基于符号的ITS算法只有1dB左右的差距；而该算法的计算量在高信噪比时只相当于基于符号的ITS算法的6％~40％。

A high-performance modular exponentiation coprocessor, SEA, is presented here, and three novel ways are employed. First, a parallel binary modular exponentiation algorithm is used to decrease cycles, and a high radix Montgomery modular multiplication algorithm is modified to the radix based high radix Montgomery modular multiplication algorithm to increase the frequency; second when mapping algorithms to a systolic array, modular square and modular multiplication are alternatively computed to cover up the dependencies between iterations in the RBHRMMM algorithm and the bypass is used to eliminate the dependencies in the PBME algorithm; third, multipliers are split first, and then accumulations are compressed as partial products to decrease carry propagation delay in the critical path.

SEA是一种针对大数模幂的高性能协处理器，其主要采用如下3种加速方法：①采用二进位并行模幂算法和以基数长度为处理字长的高基数Montgomery算法；②将算法映射到脉动阵列处理结构，并交替计算平方和乘以掩盖RBHRMMM算法中的相关，同时应用定向技术消除PBME算法中的相关；③基於"先拆分乘法、后将累加压缩"的思想优化关键路径。

Thirdly, the principal curve and polygonal line algorithm are introduced, and an implementation of polygonal line algorithm based on Quasi-Newton numerical optimization is illustrated. The simulation results show that when this algorithm isused in the detection of curvilinear defects on wafer map, it can converge fast, compute accurately and meet the demand of application of defects pattern analysis, and with the number of line segment increasing, the polygonal line will approximate to the Kegl principal curve.

研究了主曲线、多边形线算法，提出用多边形算法识别弧状缺陷想法，讨论了用拟牛顿法实现该算法的解决方案，针对硅片缺点模式分析中常出现的弧状缺陷，采用该算法进行检测分析，实验结果表明这种算法快速准确，当线段个数或最小距离平方期望值达到一定门限值后，多边形线就已经能够描述弧状缺点集的形状，随着线段个数增加，最小距离平方期望值还在不断下降，最终会收敛到Kegl主曲线。

On the analysis and contrast based on existing typical algorithms on multiuser detection, two new MUD algorithms are presented for improving computing complexity:"Low complexity polynomial expansion closed" and "Fast equalization by using frequency domain block constant modulus". The performance of the new detectors is analyzed and researched in detail in this paper.

并且在对现有典型多用户检测算法进行分析和对比的基础上，提出了两种新的降低算法复杂度的多用户检测算法："低复杂度多项式逼近算法"和"频域DFT快速分组检测算法"，并对它们的性能进行了详细分析和研究。

This is the experimental operating system scheduling algorithms, including time-rotate, Pree...

这是操作系统实验的调度算法，包含时间片轮转法，抢占式优先权算法，非抢占式优先权算法，先来先服务算法，短作业优先调度算法。

ZhuWenyu implemented the above two algorithms on a PC, testing 3640471 with AKSalgorithm and 4295884871 with the first AKS-Bernstein algorithm in about 2478.94hours and 28.35 hours respectively. She concluded that it's almost impossible tojudge the primality of a given integer directly with AKS algorithm, and testifiedthat the first AKS-Bernstein algorithm improves the AKS algorithm, but it's notyet suitable for use in practice, either.

朱文余在微机同禧3206c/850上用C语言实现了AKS算法及上述改进，前一算法对3640471进行测试约需2478.94小时，而后者对4295884871进行测试约需28.35小时，从而指出在实际运用中直接利用AKS算法进行素性测定几乎不可能，而AKS-Bernstein第一算法比AKS算法有一些改进，但仍不实用。

This paper first analyses and summarizes the ststus quo and evolution trend of encryption, some common used cryptograph are introduced, including the algorithms used in symmetric cryptosystem and asymmetirc cryptosystem. We describe the theory of each algorithms and compare the elliptic curve cryptosystem with the other two asymmetric cryptosystems to show the advantages of this algorithm. Second, the principle of ECC is discussed, including the math foundation of ECC, basic conception of elliptic curves, constructiong idea of ECC, operation on the elliptic curve and so on. Third, the current attacks of ECC were analyzed deeply, and an algorithm based on limited prime number field was constructed. We analyzed its realizability in theory, and implement it by using certain function of MIRACL software package. Latter half in this paper, the implementation model of a simple elliptic curve encryption system which based on GF has been introduced. The paper also put a deep analysis on the algorithm of point addition and point multiplication.

本文首先对密码技术的发展现状及其发展趋势进行了分析和综述，详细的介绍了私钥密码系统和公钥密码系统的发展，说明各种算法的原理和优缺点，并给出了一些典型的密码体制的简要分析，重点将椭圆曲线算法与其它几种公钥密码算法比较，说明椭圆曲线算法的优势；其次，探讨了椭圆曲线密码体制的原理，包括椭圆曲线密码的数学基础、基本概念、椭圆曲线密码体制的构造思想等问题；第三作者对椭圆曲线的攻击现状作了详细的分析，针对所使用的大素数域F_p，设计了素数域上安全椭圆曲线产生的算法，从理论上做了可实施性分析，从软件上做了具体实现；在本文的后半部分，提出了一个简单的基于有限素数域上的椭圆曲线加密方按算实现模型，并对SECES中设计的点加和点乘运算进行了深入分析。

Secondly, four Chinese proper noun recognizing models are set up based on the above four methods.

实验结果表明，SVM和概率统计组合算法、修正的SVM-KNN算法、修正的SVM算法、聚类的SVM算法均比传统的SVM算法更具优越性，达到了较高的精确率和召回率。

First, the paper introduces the sturcture of feedforward neural network and classical back-propagation learning algorithm, then systematic analysis and reserch are made to the various learning methods of RBFNN(Radical Basis Function Neural Network). The idea and algorithm frame of evolution strategy are presented and introduced to the learning algorithm of BP Neural network to improve the performance of it.

本文首先阐述了前向神经网络的结构以及经典的反向传播学习算法，尤其是对RBF网络的各种学习算法进行了比较系统的分析研究，然后又介绍了进化计算的思想和算法框架，并把这种算法思想引入到BP网络学习思想中去对BP算法进行了改进。

It is difficult to insure globe convergence for regular BSS algorithms because they are easily trapped into local optimum, which can result in error of separation. This research associates genetic algorithm with traditional BSS and uses global optimize feature of genetic algorithm.

针对多数盲分离算法在多峰值情况下易陷入局部最优，难以保证全局收敛而导致分离误差的缺陷，文章将遗传算法与传统盲信号分离算法相结合，把全局收敛性能较好的遗传算法引入信号分离算法的寻优过程。

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.

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