查询词典 fundamental algorithm

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)，该算法采用自底向上和自顶向下相结合的搜索策略对数据空间进行有效的搜索。

Preserving the best individual, the global best uncoil would be obtained as soon as possible, which can test the astringency of the algorithm ulteriorly. 4 For overcoming cheated problem of genetic algorithm, the paper introduces Boltzmann existent mechanism in genetic operating so that bad result of genetic algorithm also can be accepted, which keeps variety of the colony to avoid the loss of the best uncoil.

4为了克服遗传算法的欺骗问题，本文在模拟退火遗传算法中引入Boltzmann生存机制，从而保持群体中的多样性，防止最优解的丢失。

In order to decrease the time complexity of the algorithm to a tolerable degree for the computer, a simplified undirected graph algorithm was proposed based on the traditional algorithm of searching minimum circuits on digraph.

以某油田的开发模型数据的断层和地层数据为例对方法进行了实用性检验，结果表明，该方法大大降低了算法的时间复杂度，在单个微机上就可实现块体模型的建立。

Efficient detector generation algorithm is the kernel of anomaly detection. Aiming at low true positive value, unhandy matching threshold value and large detector set size of existent algorithms, a novel detector generation algorithm based on multiple populations genetic algorithm is put forward in this paper. According to morphologic analysis of intrusion detection system and covering problem principle, self set is divided into several partitions on the basis of their characters.

摘要有效的检测器生成算法是异常检测的核心问题，针对现有算法存在检测率低、匹配阈值固定、检测器集合庞大等问题，本文提出了基于多种群遗传算法的检测器生成算法，根据形态学空间的分析和覆盖问题原理，自体集根据特征进行划分，各个种群根据划分独立按遗传算法进化，最后求得所有检测器种群的并集得到成熟的检测器。

Digital simulation shows that the improved algorithm's estimate mean and relative estimate er-ror are better than those of the original unimproved algorithm, so the improved algorithm can be widely used in storage reliability research.

数字仿真结果显示，改进算法的估计均值和相对估计误差明显优于改进前的条件中位数算法，可广泛地应用于电子产品的贮存可靠性研究。

When processing the restrained conditions, we convert the restrained conditions into punish function and add it to fitness function which profits from the conventional method. We introduce the support vector machine to the selection operator, which increases the multiplicity of selection and increases the probability of the algorithm getting the overall optimal solution. Also, we use the adaptive probabilities of crossover and mutation in mixed GAs which enhances the efficiency of the algorithm. The result of tests about the system indicates that the improved genetic algorithm has more high convergence speed and better solution quality.

在生成初始种群时，不是简单的随机生成，而是用支持向量机对历史数据进行分类，用较优的一类历史数据作为初始种群；在约束条件的处理上，本文借鉴常规方法中的罚函数法，采用将约束条件作为罚函数包含到适应度评价中去的方法；在选择算子上，本文引入了支持向量机的方法，增加了选择的多样性，增加算法搜索到全局最优解的概率；同时针对交叉概率和变异概率在算法的前后期不同的情况，本文引入了Srinvivas等提出的动态自适应的方法，使得交叉概率和变异概率能够随着算法中个体的质量动态改变，提高算法的效率。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

In this paper, a path planning method based on GA is presented. Firstly, the model of the space robot is built to display the mapping of the end velocity and the joint velocity. Then the optimal algorithm based on genetic algorithm is presented to search the optimal solution which minimizes the disturbance of base attitude in the feasible solution space. Finally, an illustrative example is used to verify the feasibility of the algorithm.

基于GA研究机械臂运动对基座的姿态扰动问题，首先，建立空间机器人的运动学模型及空间机器人末端与关节速度之间的映射关系；接着，应用GA作为最优化算法，在空间机器人可行解空间中，寻找最优解得到最优路径，以达到对基座姿态干扰最小的目的；最后，通过数值仿真实验验证算法的实用性。

In the chapter 2, the theoretic knowledge about the photosensitive resin and the grinding tools was firstly introduced.

第二章阐述了光固化树脂结合剂磨具的相关理论研究。

Do not use the program's indenting or margin-setting features; these will be added during typesetting.

不要使用缩排，页面边缘设置之类的选项，偶看不大懂。