算法论

词组短语

algorithm theory

与算法论相关的网络例句 [注：此内容来源于网络，仅供参考]

In the course of algorithmization, we should select arithmetic with high numerical stability and controlling error and computational effort little and saving memory space.

建立模块化仿真模型时，本文通过模型算法的模块化平台一仿真支撑系统BLINK，把算法进行单独的模块太原理工大学硕士学位论文化处理，通过算法来构造仿真模块，实现模块的搭建和组合。

The paper includes the constitutes of system hardware, image pretreatment, the achievement of parameter detection artithmetic. The main work is as follow: The pater makes use of vanguard genetic algorithms in image segmentation, uses vanguard genetic algorithms to get the image threshold. Using this method we may get different grey vehicles from the background exactly. Used the support vector machine theory to conduct the vehicles automatic sorting simulation research, the simulation result had proven this method could quite be accurate carries on the vehicles type the recognition; Improved based on the background automatic renewal hypothesized examination region algorithm, enhanced timeliness and the accuracy which the vehicles examines; And to has carried on the specify based on the hypothesized examination region imagery processing algorithm realization; In the paper also introduced withdraws the algorithm based on the gradation continuous movement vehicles characteristic to carry on the vehicles the characteristic to withdraw as well as to use the localization method which colored filter same gradation chart processing unifies to carry on the realization method which the vehicles license plate locates.

本文根据智能交通控制与仿真对于交通流量、车辆到达率、车辆速度等交通信息检测的需求，基于视频图像进行了交通信息处理的算法研究与实现，主要工作包括以下几个方面：将先锋遗传算法应用到图像阈值分割中，利用先锋遗传算法寻求全局最优阈值，可以比较准确的将图像中不同灰度的车辆从背景中分离出来；采用支持向量机理论进行了车辆自动分类的仿真研究，仿真结果证明该方法能够比较准确的将车辆的类型进行识别；改进了基于背景自动更新的虚拟检测区域算法，提高了车辆检测的实时性和准确性；并对基于虚拟检测区域的图像处理算法实现进行了详细说明；论文中还介绍了基于灰度连续性的运动车辆特征提取算法进行车辆的特征提取以及采用彩色过滤器同灰度图处理相结合的定位方法进行车辆牌照定位的实现方法。

And the keytechniques are in the following:(1) The algorithm and program of intensified node arrangement near crack tip andalong crack line (2) The shape function calculation of point near crack based on visibility criteria (3) The contour integral method for calculation of stress intensify factor K_ⅠK_Ⅱ(4) The rock slope appraisal method using circular method, polygonal method orgraph theory method depending on the slope joints combination

程序实现的关键技术和算法如下：(1)沿裂隙结点布置及裂尖结点加密的算法及程序(2)采用可视准则的形函数算计算程序(3)围线积分计算复合型裂纹裂尖强度因子K_Ⅰ、K_Ⅱ的算法及程序(4)圆弧搜索法、折线搜索法和无网格—图论搜索法的算法及程序

The corresponding diagnosable systems are characterized in terms of a graph-theoretic condition, and a series of valuable conditions on a diagnosable system is presented. And a class of diagnosable systems that have a minimum number possible of communication links (known as optimal diagnosable systems) is proposed.

得出了系统中故障结点机数不超过n-2的结论；●解决了特征问题，给出了按图论方式表述的充分必要条件；●解决了诊断算法问题，给出了一个有效的诊断算法，该算法具有线性时间复杂度和多项式诊断报文总规模的特性；目前，上述研究工作所取得的结果还没有文献报导。

In order to overcome the problems of slow rate of convergence and falling easily into local minimum in BP algorithm, a new improved homotopy BP algorithm is put forward. It transfers the identity matrix of output mode in common use into the binary system.

为克服标准BP算法中存在的网络学习收敛速度慢、容易陷入局部极小等问题，引入同伦算法，提出了一种将同伦论与快速BP算法结合的改进算法，并采用二进制结构表示输出模式矩阵。

A new method of slope stability, limit equilibrium finite element method based on Dijkstra algorithm, was established by applying the improved Dijkstra algorithm which was an algorithm to seek the shortest path in graph theory to search for the minimum safety factor of slopes and the position of most dangerous sliding plane.

通过引入图论中解决最短路问题的Dijkstra算法到搜索边坡最危险滑动面及其安全系数中去，对Dijkstra算法作了一定的改进，建立了一种新的边坡稳定性分析方法―基于Dijkstra算法的极限平衡有限元方法。

Based on this principle, the proposed algorithms, such as fast search for transmission section based graph theory, fast search for flow transferring shortest path and the FTRF, are developed under Microsoft Visual C++ environment by using the Standard Template Library in order to simplify the development effort.

基于以上原理，用C++计算机编程语言编制了基于图论的输电断面快速搜索算法、基于图论的潮流转移最短路径快速搜索算法与基于直流潮流的分布系数法，并运用Visual C++计算机编程语言搭建了输电断面安全性保护的仿真平台。

These three algorithms can avoid to recompute the nth order head submatrix of the Jacobi matrix. Moreover, the last two algorithms are more stable, their precision can match well with the algorithm of Boley and Golub.

这三种算法都可以避免重构Jacobi矩阵的n阶首主子阵，并且后两种算法更稳定，数值精度可以(来源：A1cBC论c4文网www.abclunwen.com)与Boley和Golub的算法媲美。

This thesis firstly introduces the method of Attribute Theory, and then introduces the model of selecting matriculates based on Attribute Theory.

本论文首先简要介绍了属性论方法，然后介绍了属性论的高考招生模型，在此基础上对基于属性论的高考招生模型进行分析，对模型中的标准点、标准线和满意度提出具体的算法，利用模糊数学的贴近度方法来构造满意度。

According to the headwords of the constituents,this paper researches on argument identification algorithm.The experiment shows that 98.78% of arguments on train set and 97.17% on test set are identified.At the same time,most of NULL arguments are pruned.

以句法成分的中心词为依据，对论元识别算法进行研究，在训练集上识别出了98.78%的论元，在测试集识别出了97.17%的论元，并大大减少了不承担角色的训练样例。

与算法论相关的网络解释 [注：此内容来源于网络，仅供参考]

algorism：算法论

algorism 十进位计算法 | algorism 算法论 | algorithm instruction 算法教学

algorithm of euclid：欧几里得算法

algorithm of division 辗转相除法 | algorithm of euclid 欧几里得算法 | algorithm theory 算法论

algorithm theory：算法论

algorithm of euclid 欧几里得算法 | algorithm theory 算法论 | algorithmic language 算法语言

Algorithm on Graph Theory：图论算法

图论 Graph Theory | 图论算法 Algorithm on Graph Theory | 土力学与地基 Soil Mechanics and Foundations

Connected Components：连通分支 zfD无忧研修网

Graph Problems -- polynomial 图论-多项式算法 zfD无忧研修网 | Connected Components 连通分支 zfD无忧研修网 | Topological Sorting 拓扑排序 zfD无忧研修网

graphic method：图论算法

图形处理:Graphic disposal | 图论算法:Graphic Method | 图形变换:Graphic transform

heuristic algorithm：启发式演算法

在他的研究中指出,他利用启发式演算法(Heuristic Algorithm)找到了一组解,在5步内一定破解 Code Macker 所设的密码. 而他的方法平均需要猜测 4.478 次. 到了 1993 年时,Koyama and Lai 在下面这篇论文中,找到了平均次数最少的最佳解. > Koyama,

isoperimetric：等周

为此,提出一种基于图论的等周(Isoperimetric)进分割算法. 该算法使用解线性方程的方法代替解特征向量的方法、用4-邻接的方法代替全连接,避免了复杂的空间滤波. 该算法运用到岩心图像分割中,提高了分割的效率,取得了较好的分割效果.

Minimum Spanning Tree：最小支撑树

Zahn发展了一些基于最小支撑树(minimum spanning tree)的图论聚类算法,这种方法适用于单连锁的情况. 其他一些在计算时需要考虑的问题包括:非特异性,在单连锁和其他一些聚类方法中当非特异的情况出现时,比如有两对分组之间的距离都最小时,