算法

Based on the old algorithm, introduce new Linear Feedback Shift Register, new Central Limit Theorem, Maclaurin Equation to generate uniform distribution, gaussian distribution, exponential distribution's random number respectively and analyze them, compares the difference between new algorithm and old algorithm.

在原有算法的基础上，提出了改进型线性反馈移位寄存法、改进型中心极限定理法和麦克劳林展开法，并对其作测试仿真，比较传统算法与改进型算法之间的优缺点。

By comparing the common edge detection algorithms, the magniloquent Kirsch edge detection algorithm is selected to process the result of background subtraction. The result of edge detection is denoised by mathematical morphology method. Shadow edge restrained arithmetic and detection-line-based background updating method are presented. Shadow edge restrained arithmetic reduces vehicle shadow edge efficaciously. Background updating precision is improved by presented background updating method.

在处理过程中，对常用的背景差方法进行了改进，有效的保留了车辆目标信息；通过对常用的边缘检测方法比较，选用了突出边缘的Kirsch边缘检测方法对背景差后的图像进行了边缘检测；使用形态除噪算法对边缘检测的结果进行了噪声去除；提出了阴影边缘去除算法和基于检测线的背景更新方法，阴影边缘去除算法有效的抑制了车辆阴影边缘，背景更新方法则提高了背景更新的精度。

The paper first presents an objective model of task scheduling,and then based on the analysis of Q learning algorithm,the Markov decision process description of the scheduling problem is given.

首先建立任务调度问题的目标模型，在分析 Q学习算法的基础上，给出调度问题的马尔可夫决策过程描述；针对任务调度的 Q学习算法更新速度慢的问题，提出一种基于多步信息更新值函数的多步 Q学习调度算法。

This algorithm which computes the inversion of operator matrix is simple and fast based on the special structure of operator matrix.

该算法利用了算子矩阵的特殊结构，采用简单、快速的矩阵求逆算法，使算法的运算量和数据存储容量大幅度下降。

The optimal design of layout programming of RRMS is explored. The mathematical programming model based on matroid is established and the greedy method is selected serving as the optimal method. The application program based on this method is also developed and compiled.

摘 要：研究探索了快速可重组制造系统布局规划中的优化设计问题，建立了基于拟阵的数学规划模型，通过对比选取贪馋算法作为优化算法，并编制开发了此算法的应用程序。

Experiments are made to compare the improved method with the traditional maximum classification square error method and the simple genetic algorithm.

通过实验对比，表明改进的遗传算法比传统的最大类别方差法和基本遗传算法有明显的优势，说明了本算法的可行性。

However, for hill-climbing strategies to be guaranteed to find the global optimum the optimality landscape must be unimodal. Moreover, research has demonstrated that multiple maxima exist under the maximum likelihood principle. Therefore, hill climbing based evolutionary tree reconstruction methods often return local optima.

但是由于进化树的似然函数通常含有多个局部极优解，而爬山算法没有逃离局部极优的能力，因此基于爬山算法的进化树构建算法很容易陷入局部极优。

The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper.

本文首先对当前国际上最大团问题的理论研究成果及算法研究中的启发式算法进行了介绍，然后对精确算法中的分支定界法作了较为详细的讨论，最后

Under the action of excellent memory cell, the search of algorithm to global optimum is rapid and effective.

该算法的核心在于保持种群的多样性和执行强化学习及弱小保护策略，算法不仅保持了优良抗体在进化中的主导地位，而且充分发掘强成长性抗体的寻优潜力，在优良记忆库的作用下，算法对全局最优的搜索快速且有效。

Algorithms in specific, the proposed block-tree structure, the algorithm to reduce memory requirements and broaden the scope of application of the 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.

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