算法

Aimed at the safety requirement of WAP, the disadvantange of WAP＇s application model is analyzed, a new end-to-end safe model, named Double Encrypt＇s model, is developed. Its DES and IDEA algorithm are realized by the compiling language based on delphi 6.0, the most excellent IDEA algorithm that is suitable to encipher the algorithm in WAP application system is selected to transmit data safely.

为解决无线应用协议在应用中存在的安全隐患，探讨了WAP应用模型漏洞产生的原因，分析了目前WAP应用的3种实现模型及存在的不足，提出了一种新的端到端安全模型——双加密模型，并使用面向对象的编程语言DELPHI6.0实现了数据加密标准和国际数据加密算法两种对称加密算法，选择了适用于WAP应用的最优的IDEA算法。

One of the key techniques in Continuous Handwritten Character Recognition is how to model every word entry in lexicon and every sentence that made up by the words. Due to the HMM′s characteristic of time sequence modeling capability, a Cascaded Hidden Markov Models, which defines model connection probability and state transition probability between HMMs, is proposed in this study.

利用HMM对时间序列的较强的建模能力这一特点，提出了可用于连续字符识别的HMM级联模型；给出了字符HMM模型连接概率和模型间状态转移概率的定义，并通过修正训练算法的重估公式，重估字符模型的连接参数，描述了用于手写体识别的字符HMM的设计方案；给出了级联训练算法重估公式和级联Baum-Welch训练算法描述。

Among these three categories a possible common subtree algorithm is presented based on the enumeration tree technique of data mining domain.

本文深入探讨了每类算法中的代表算法，其中根据数据挖掘中枚举树相关技术提出了一种可能的公共子树查找算法的思想。

A new method to solve the combinatorial optimization problems with mixed evolutionary algorithm based on natural scale enumerative system coding was proposed in this paper. Elitism strategy, one-point crossover and Gaussian mutation were used in the algorithm. An ingenious method for operation among big parameters was designed, which can avoid overflow and simplify the operation.

在自然进位制编码的基础上，算法采用了遗传算法的单点交叉算子和进化规划的高斯扰动算子，并运用了精英保留策略；算法实现时采用逐位运算法实现大数值运算，避免了运算溢出，减少了运算量。

Based on the research of TMS320C64xx program and codeoptimization, 3×3 median filter algorithm ameliorated, 5×5 median filter algorithm ameliorated algorithm and histogram equiangular algorithm is realized. The key code effecting process speed is optimized and the effect is good.

在研究TMS320C64xx的软件编程和代码优化的基础上，实现了改进的3×3中值滤波算法、改进的5×5超快速中值滤波算法和直方图均衡算法，并对影响处理速度的关键代码进行了优化，取得了很好的效果。

The idea of our algorithm is equivalence class classification for continuous time is constrained by a relation between the remaining delay time of triggering event and time value of DTA clocks or the remaining delay time of other events.

和同类算法相比，我们的算法用更广义的延迟时间等价类取代同类算法中受事件先后顺序约束的单元延迟时间等价类，并且不必生成那些仅仅因为时间流逝而产生的状态等价类。

To solve this problem,the equivalence relation of rough set theory is replaced by an asymmetrical similar relation,and from this relation,an asymmetrical similar matrix is defined,then a new heuristic algorithm with less space complexity that require core and knowledge reduction based on asymmetrical similar matrix is proposed,and an example is given to confirm the validity of the algorithm.

用非对称相似关系代替粗糙集理论中的等价关系，定义了非对称相似差别矩阵，提出了基于非对称相似差别矩阵的高效求核和知识约简算法。该算法无需改变初始不完备信息系统的结构，能直接处理缺省数据。实验结果表明，新算法所获得的决策规则简洁、高效，与缺省值无关。

It is greatly efficient, because this overcomes the shortcoming of Eratosthenes algorism that need compare every natural number in the given range, This algorism can acquire all prime numbers between 1 and any given natural number m This article also has given the complexity of the algorism, and even if sift in the algorism were different, it will be...

这避免了传统Eratosthenes 筛法需要比较每个数的缺点，极大地提高了算法效率。该算法能用于求1至任意自然数m之间的所有素数。同时还给出了该算法的最多比较次数公式，即使用不同的筛子利用该公式也容易求得其最大比较次数。

The paper proves that the search process of the non-crossover genetic algorithm is an ergodic homogeneous Markov Chain. The proof of global convergence of NCGA is presented is this paper. The upper bound of convergence speed of the NCGA is the same as the CGA. The possibly of retain the promising genes of NCGA is larger than CGA.

对于本人可以找到的32种典型的非线性优化测试函数，应用无交叉算子遗传算法，与基于经典遗传算法相比，在相同的进化代数的条件下，NCGA同样取得了略优的收敛速度，在相同CPU计算时间上NCGA也取得略优的结果； 3 提出了复合算子遗传算法。

Based on a Hopfield neural network mode for combinational circuit test generation, a test generation algorithm with global searching ability is proposed. This algorithm is the combination of chaotic searching with gradient algorithm. By means of the inherent stochastic and ergodic property of chaotic searching, the problem of being trapped in local minimum of gradient algorithm can be solved.

基于组合电路测试生成的离散Hopfield神经网络模型，将混沌搜索与Hopfield网络的梯度算法相结合，利用混沌搜索的内随机性及遍历性来克服梯度算法易于陷于局部极小的缺点，形成一种具有全局搜索能力的测试生成有效算法。

But we don't care about Battlegrounds.

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

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

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