查询词典 primary algorithm

The new algorithm is based on the principle of fuzzy C-means clustering algorithm and the transiently chaotic neural network algorithm.

实例计算以及与其他算法比较表明，该算法是一种求解多车调度问题的可行且高效的方法。

of transitive closure based on equivalence relation, method of maximum fuzzy spanning tree based on fuzzy graph, and algorithm Fuzzy C-Means based on partition are more deeply investigated. Respectively, this thesis proposes an algorithm for document fuzzy clustering based on methed of transitive closure and an algorithm for document fuzzy clustering based on methed of maximum fuzzy spanning tree. Moreover, FCM is particularly studied from data standardization method, metrics method, and selection method of initial clustering prototype.

较深入地讨论了基于等价关系的传递闭包法、基于模糊图论的最大树法以及基于划分的模糊C-均值算法，分别提出了基于传递闭包法的文本模糊聚类方法ATCFC和基于最大树法的文本模糊聚类方法ATCMT；重点从改变规格化方式、改变度量方式、改变初始聚类原型选择方式三方面对FCM算法进行研究。

In chapter 4, basing theories and methods of scientific visualization, and artificial neural network BP algorithm, we integrate the Visual C++, OpenGL graphics library and Excel VBA technique to develop the program of artificial neural network and to make the BP algorithm visually, this program works can be divided into four parts: Using C language to develop program about BP algorithm; Using Visual C++, develop the GUI Interface, make input parameter visually; Using OpenGL graphic technique to display the training sample point in three dimension; at last using Excel DDE technique display the error graphic tables in Excel system In chapter 5, on the view of engineering application, we establish new method of surface reconstruction basing artificial neural network, develop interface program between module and commercial CAD/CAM system, meantime deeply discuss some key problems, for example, setting up the base plane, using the API technique, cutting and editing surface boundary, and also discuss the more compliant problem: how to intersect surface, at end we finish the work of translation from our surface reconstruction module to commercial CAD/CAM system, then make reverse engineering system basing artificial neural network more useful.

第四章基于科学计算可视化理论，依据人工神经网络BP算法理论模型，综合Visual C++，OpenGL图形库以及Excel VBA等多项软件开发技术，编制了人工神经网络程序，实现了BP算法的可视化映射。具体工作分为四部分：利用C语言实现人工神经网络BP算法；利用VisualC++的GUI技术开发图形用户界面，实现参数设置可视化；利用OpenGL图形技术进行三维映射，显示学习样本及训练样本点；利用微软电子表格DDE动态数据交换技术，在Excel上动态显示学习误差曲线图。第五章从工程应用的角度出发，提出了一种新的基于人工神经网络算法的曲面裁剪重构方法，完成了曲面重建模块与通用CAD/CAM系统的接口设计工作，对其中的若干关键问题进行了深入讨论，例如基平面设定、API技术的应用、边界裁剪等问题，同时，对曲面计算中较为困难的曲面相交问题也进行的专门探讨，最终完成了曲面重建模块向CAD/CAM系统的数据传输工作，使人工神经网络逆向工程系统趋向实用。

Intelligent Transportation System on the core algorithm- the path that the test algorithm, the actual travel path and the path of speculation after the results were compared to assess the path that algorithm accuracy and performance.

详细说明：对智能交通系统的核心算法-路径推测算法进行测试，将实际行驶路径与经过路径推测的结果进行比较，以评估路径推测算法的准确率和性能。

Based on the Clark-white heuristic algorithm, we proposed simulation-annealing algorithm to solve the distribution VSP in urban transportation networks, in the algorithm we make full use of the fact that the cost will be saved if referred two vehicles is collocated.

在C-W节约法基础上，提出采用模拟退火算法解决具有模糊时间窗的VSP问题，重点分析随机解的产生规则，同时给出模拟退火算法所必须的其他规则。

For solving transportation problems the quick algorithm is not only simpler and fewer computing steps than the simplex algorithm but also more easer and fewer computing steps than the generaliged Hungarian algorithm.

快捷法求解运输问题不仅比表上作业法计算步骤少、简单，而且比广义匈牙利法的计算步骤还少、还简单。

In this paper, the maximum likelihood algorithm with process and measurement noise for nonlinear continuous-discrete system given by Jategaonkar and Plaetschke is improved in two aspects: 1 to avoid the disadvantages of sensitivities computation by common finite-difference method, in which the perturbation sizes should be selected optionally, an improved finite-difference method with best perturbations, is presented. 2 to improve the numerical stability of Jategaonkar's algorithm, maximum likelihood algorithm with fast triangular square-root decomposition filter is given.

摘要对Jategaonkar等人给出的同时计及过程及观测噪声的非线性连续-离散系统的极大似然算法从两个方面进行了改进：1给出了计算灵敏度的最佳摄动有限差分算法，避免了普通有限差分法计算灵敏度矩阵时需人为选择参数摄动量大小而带来的缺点；2给出了具有快速三角化平方根滤波的极大似然算法，提高了原算法的数值稳定性。

Based on soa, this thesis abstracts the dag tasks as pipeline virtual service. taking hsdc telescope data process as the application example, this thesis pays main attention on design and implementation of the pipeline virtual service scheduling algorithm.by analyzing the application characterizations and grid environment, a pvs pre-scheduling model with the relevant sod algorithm and the triangular pyramid scheduling model with tps algorithm are provided in this thesis.

基于面向服务的体系结构，本文将其抽象为流水线虚拟服务(pipeline virtual service，pvs)，并以hsdc系统天文数据处理为例，研究在网格环境下，流水线虚拟服务调度算法的设计和实现。

Firstly a fast direct computing 3kP algorithm in field was deduced,which only needed one inversion;the new double base number chain based on 1/2 and 3 could be integrated with high-speed direct computing 3kP and halving algorithm.Scalar multiplication based on the new chain only employed point addition,halving algorithm,triplication and direct...

在底层域推导出直接计算3kP的快速算法，该算法只需一次求逆；新设计的以1/2和3为基的双基数编码可结合高效的直接计算3kP和折半运算，基于该双基数编码的标量乘算法只涉及到点加运算、折半运算、三倍点和直接计算3kP，底层域运算复杂性得到降低，在NIST推荐的椭圆曲线上比Dimitrov算法效率提高70%以上，比Wong方法提高10%以上。

Since any frequent itemset is a subset of a maximal frequent itemset (an itemset is maximal frequent if it has no superset that is frequent), this paper proposes the DMFI (Discovery of Maximal Frequent Itemsets) algorithm for mining all the maximal frequent itemsets from data sets. This algorithm searches the maximal frequent itemsets in data sets from both bottom-up and top-down directions in the meantime. This paper proposes an algorithm that evaluates the boundaries on the support and confidence of uncalculated itemsets by exploiting the information provided by the calculated itemsets.

本文在经典关联规则的基础上，提出了一系列扩展的关联规则开采算法：发现关联规则的难度体现在发现频繁项目集上，事实上最大频繁项目集（其所有的超集都为非频繁项目集的频繁项目集）的集合已经包含了所有的频繁项目集，本文提出一种发现最大频繁项目集的算法DMFI(Discovery Maximal Frequent Itemsets)，该算法采用自底向上和自顶向下相结合的搜索策略对数据空间进行有效的搜索。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样