查询词典 hidden line algorithm

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

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等提出的动态自适应的方法，使得交叉概率和变异概率能够随着算法中个体的质量动态改变，提高算法的效率。

Don not attempt to do something which you can not to do.

不要企图做那些办不到的事情。

The expression of CTGF and TNF-αweredetected by immunochemistry and the number of Clara Cells was calculated.

光镜下观察肺组织的病理变化，采用免疫组化染色观察肺组织中结缔组织生长因子和肿瘤坏死因子-α的表达和Clara细胞的数量。