算法

Aim for improving the performance of active replication algorithm, we propose a new replication algorithm named RRR.

针对主动复制算法中的不足，本文提出了RRR算法，它在不改变可用性的前提下提高了算法的性能。

Cutter blade in the face of the modeling, this paper presents a basic model of ideological confrontation flank milling reasoning and mathematical algorithm: First, the establishment of the cutter edge cross-section curve and the equation ruled surface and then through the algorithm to generate cutter rake face and the flank, Bezier curve-based algorithm to generate the surface of the spiral groove cutter in order to achieve the opposite blade face milling modeling.

在立铣刀的刃面的建模方面，本文提出了一种基本的建模思想对立铣刀的刀面进行数学推理和算法实现：首先建立立铣刀的刃口曲线及横截面的方程，然后通过直纹面生成算法建立立铣刀的前刀面和后刀面，通过基于Bezier曲线的曲面生成算法建立立铣刀的螺旋槽，从而实现了对立铣刀刃面的建模。

By use of first-order linear expansion of Taylor series, the linearization process of both nonlinear constraints and objective function of long-term optimal scheduling model are performed and an optimal scheduling model based on seccessive linear programming is built; an approach to solve Optimal scheduling of cascade hydropower station problem by seccessive linear programming is put forward, the scale-down factor of iteration step length is used to ensure that the algorithm can converge to the optimal solution of optimization problem quickly and accurately.

通过采用泰勒级数一阶描述形式，对优化调度目标函数和约束条件中的非线性约束进行线性化处理，建立了基于连续线性规划算法的优化调度数学模型，提出了用连续线性规划技术求解梯级水电站优化调度问题的算法，并采用迭代步长的动态比例缩减因子保证算法能快速准确地收敛到优化问题的最优解。

Numerical results illustrate the effectiveness of the optimized domain decomposition methods we proposed compared with the classical Schwarz methods.

在此基础上考察了古典Schwarz算法和各种优化区域分解算法的收敛性质，验证了优化区域分解算法。

Considering to the limitations of SDT algorithm, this paper proposes an improved SDT compression algorithm and compares compression quality between the two algorithms comprehensively.

针对SDT算法的弊端，提出了一种改进的SDT数据压缩算法，并进行了两种算法的性能对比。

The traditional query tree optimization methods,parallel database optimization methods based on left linear trees and right linear trees,bushy trees,and operation of the forest,have their own pros and cons,they have been more in-depth and maturity of the study.The query optimization method based on multiple weighted tree has studied its model of parallel query plan,its complexity model of parallel query plan and query optimization algorithms.The semantic query method transforms an inquiry into one or several semantic equivalence inquiries then has to find and implement a strategy to achieve a better query.Agent-based parallel database query optimization using Multi-Agent technology to automatically search the integrity constraint conditions which are related to the determined query,there for,the efficiency between several relations' joins has been greatly improved.The parallel optimization algorithm,based on genetic algorithm which is suitable for multi-joins of cluster environment,has deeply studied the relations storage options,multi-joins query optimization and query processing and other key technologies based on cluster parallel database.

传统的查询树优化方法，即基于左线性树、右线性树、浓密树、操作森林的并行数据库查询优化方法，各有优劣，对其的研究比较深入、成熟；基于多重加权树的查询优化方法，研究了其并行查询计划模型、并行查询计划的复杂性模型和查询优化算法；语义查询优化方法将一个查询变换成一个或数个语义等价的查询，进而寻找并执行这些等价查询中具有较好实现策略的一个；基于Agent的并行数据库查询优化采用Multi-Agent技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。

Since the separable element algorithm of the rational univariate representation for solving zerodimensional systems presented by Rouillier makes the size of the coefficients in this representation too long, an improved algorithm for finding separating elements is presented in this paper, which is implemented by confirmingthe separating element of the coordinates step by step.

针对零维多项式系统中Rouillier计算可分元的算法使其相应的有理单变量表示中整系数过长的问题，提出一种改进的可分元选取算法，新算法通过逐步确定坐标可分元得以实现。

It is an important problem to reduce time and space complexity in sequence alignment algorithm currently.

引言 在序列比对算法中，基于动态规划方法的算法是使用最为广泛的一类算法。

In order to eliminate the effect of dimension,the two objective functions were regulated.The experiments on a mixed model assembly line show that the modified discrete PSO algorithm maintains the advantages of PSO algorithm and can solve the mixed model assembly line sequencing problem effectively and rapidly.

对实际混流装配线的仿真实验表明提出的改进微粒群优化算法可以直接应用于离散问题并保持了基本微粒群算法的优良性能，是一种性能较好的高效的混流装配线排序算法。

In probabilistic static security assessment, sequential and non-sequential Monte-Carlo sampling techniques are applied considering time varying parameter and constraints.

概率静态安全评估中，作为概率仿真算法的基础，首先建立了基于蒙特卡罗抽样的序贯和非序贯概率抽样算法，根据电力系统概率安全经济仿真不同分析模块有无时变参数和时变约束，讨论了两种仿真算法的适用性。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。