查询词典 fundamental algorithm

Previous solutions to these problems, such as topology conversion methods and forward-pointed arcs methods, not only have deficiencies of having high temporal and spatial complicacies, but also have shortcomings for the topological data difficult to be formed and be renewed in good time. This paper comes up with an Arc Topology Algorithm to solve one-way road prohibitions and turn penalties problems, and puts forth Azimuth Algorithm and Turn-angle Algorithm to solve nodal weight problem.

针对以往的解决方案如转换网络法和扩展的前向关联边法计算的时间复杂度和空间复杂度高以及拓扑数据难以建立和难以实时更新的缺陷，论文构造了弧段拓扑法以解决单向行驶限制和转向限制问题，构造了方位角法和转向角法以解决节点权重问题。

This paper proposes an Improved Particle Swarm Optimization algorithm.IPSO adopts a new mutation operator and a new method that congregates some neighboring individuals to form multiple sub-populations in order to lead particles to explore new search space.Additionally,this algorithm incorporates a mechanism with a simple and easy penalty function to handle constraint.Thus,this algorithm has strong global exploratory capability and efficiency while being applied to solve nonlinear constrained optimization problems.

提出了一种改进的粒子群算法（Improved Particle Swarm Optimization，IPSO），使用了一种新型的变异策略，并在搜索过程中将部分邻近的个体聚集成核，从而形成多子群引导粒子探测新的搜索区域，采用了简单易行的罚函数约束处理机制，使算法在求解较难的非线性约束优化问题时具有很强的全局搜索能力与效率。

Wavelet transform is Mallat algorithm in substance but a key point of Mallat algorithm is that wavelet's filter is convolved with function, so the calculation of coefficients of impulse response of filter of wavelet is very importment for Mallat algorithm.

在信号和图象处理中小波变换的实质是Mallat算法，而Mallat算法中其基点是小波所对应的滤波器和原函数作卷积，因此小波所对应的滤波器的冲激响应系数的计算对Mallat算法的实现具有现实的意义。

Put forward improvement DF algorithm and TD-IDF algorithm, the time that used DF algorithm to have linear on one hand is complex degree, suit the characteristic that large-scale text handles quite, adopt the method that adds a keyword appropriately, the insufficient; that made up for its to filter to mistake of individual and useful information on the other hand, use a feature the weight that chooses level in the feature undertakes adding counterpoising handling to TD-IDF method, the dimensions of documentation collect expanded below the circumstance that does not increase expenditure, still raised likeness to spend calculative accuracy.

提出改进的DF算法和TD-IDF算法，一方面利用了DF算法具有线性的时间复杂度，比较适合大规模文本处理的特征，并通过适当增加关键词的方法，弥补了其对个别有用信息错误过滤的不足；另一方面，利用特征项在特征选择阶段的权重对TD-IDF方法进行加权处理，在不增加开销的情况下扩大了文档集的规模，还提高了相似度计算的精确度。

Moreover, because the new algorithm has made use of many measures to reduce the computation burden such as algorithm of cumulating first then correlating and optimum path algorithm, it is most suitable to implement in software GPS receiver.

由于算法采用了多种措施来降低运算量，因此算法的运算量适中，非常适合在软件接收机中采用。

Equations are differenced by control volume algorithm , convection term is differenced by up wind difference algorithm , diffusion term and continuity equation are differenced by central difference algorithm .

采用控制容积法对控制方程组进行离散，对流项采用迎风差分格式，扩散项、连续方程采用中心差分格式。

Mainly deals with the modification to related matching algorithm based on gray scale and minimum matching algorithm on gray scale, using gradated in-and-out amalgamation algorithm to make the image link together smoothly and seamlessly.

针对基于灰度相关的匹配算法进行改进，提出了基于灰度差极小值的匹配算法，采用渐入渐出的融合算法，使图像达到平滑、缝的拼接。

The Coordinated Multi-Queue Algorithm relieves this problem efficiently. CMQ algorithm classifies the blocks which often be accessed together as an access group, and replaces the blocks of an access group in bulk. CMQ algorithm homogenizes the cache hit-ratios of all the storage nodes caches, and improves the global cache hit-ratios of the cluster file system.

采用存储节点缓存协同置换算法CMQ(Coordinated Multi-Queue)把一些经常同时被访问的数据块归为一个访问组，并对访问组施行整体置换策略，使各存储节点缓存的命中率趋于均匀，从而提升并行文件系统存储节点缓存的整体命中率。

The using of hybrid Genetic Algorithm , which hybridizes Genetic Algorithm and Simplex algorithm is to study the optimizing method to design products.

6采用&遗传算法+单纯形法&的混合遗传算法，用于产品的优化设计。

By hybridizing planar multi-median algorithm and shortest-path genetic algorithm, an approximate algorithm for network multi-median problem is presented.

4提出了一个将平面多中位选址方法与最短路—遗传算法相结合的近似网络多中位选址优化方法。

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.

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