在算法上

In this article, a algorithm CCN is put forward to study the crossing number. It is a very important development in graph planarity issue after planarity-determinant algorithm and embedding algorithm.

本文首次给出了较好的计算图的交叉数算法CCN，这是继图平面性判定算法，二连通图的平面嵌入算法之后在图的平面性问题上的一个最重要的进展。

All the sub-plans are described by a group of general mathematic formulae. The computation of the sub- plan can be decomposed into two sub-problems by relaxing the constraint that production level at production period of a sub-plan must be more than zero. Based on the properties of an optimal solution, two polynomial algorithms are devised to solve sub-problems and reintegrate the relaxed constraint. Finally, a dynamic programming algorithm with complexity O(T^4) is developed to solve the global problem, where T is number of periods in planning horizon.

给出了所有子计划的通用数学描述，并通过松弛正生产量约束将子计划的计算分成两个子问题；依据子问题和子计划最优解的性质，设计了求解子问题和重新集结松弛约束的多项式算法；在此基础上提出了一个复杂性为O(T^4)的求解整个规划问题的多项式动态规划算法，这里T是规划时段上的周期数。

So we present an algorithm based on reachability analysis, and a more complex one which uses a stronger temporal logic (timed predicate μ, calculus) and can verify more properties.

在模型检测的算法方面，本文首先给出了时间符号迁移图上的一个可达性分析算法，随后还定义了能刻划更复杂性质的实时谓词μ演算并给出了检测这些性质的相应模型检测算法。

The simulation results show that the algorithm gets higher saved rebroadcast and reachability than the probabilistic algorithm and the counter-based algorithm.

模拟实验表明，本算法在节省转发率和可达率两个性能指标上均优于概率算法和计数器算法。

First of all, on the base of the reduced gradient method of Wolfe, we added accurate one dimension searching method into it and gained a new algorithm (algorithm 1,2) for the nonlinear programming with linear equality constraints and quadratic programming problems, and proved convergence of algorithm, then, we use above algo...

首先本文在Wolfe既约梯度法的基础上，针对具有线性等式约束的非线性规划问题和二次规划问题，引入了精确的一维搜索，得到了带一维搜索的新算法(算法1、2)，并给出了算法的收敛性证明。

Traditional link access control algorithm such as LBRCA（Link Bandwidth Require Control Algorithm） has the problem of high link access rejection probability and low bandwidth resource usage ratio.A model of sharing bandwidth allocation in multi-link is proposed,the features of link bandwidth allocation and QoS level are also discussed.The DBAMQ（dynamic bandwidth allocation and multi-level QoS） link access control algorithm is presented.In this algorithm,the bandwidth is readjusted according to variable QoS level.

针对传统的基于带宽请求链路接入控制算法（Link Bandwidth Require Control Algorithm，LBRCA）的接入成功率和系统带宽利用率不高的问题，设计了一种多链路接入共享带宽分配模型，分析了链路带宽分配和QoS等级的特点，提出一种动态带宽分配分级QoS链路接入控制算法DBAMQ（Dynamic Bandwidth Allocation and Multi-level QoS），该算法在保证某QoS等级的基础上允许动态地对系统的带宽进行重分配。

In this dissertation, An improved adaptive genetic algorithm for robust test generation is presented, which adaptively adjust genetic parameter with evolution effect and the choice of initial population is based on the feature of the robust test.

本文对标准遗传算法进行了改造，提出了一种自适应遗传算法来解决强健时滞测试生成，该算法建立了根据进化程度调整群体尺寸的启发策略来加速测试生成，并且在初始群体的选择上充分利用了强健时滞测试的特点以取得优良的初始群体。

In chapter two, we analyzed the methods for single linear Diophantine equations: Rosser algorithm and Fortenbacher algorithm; the methods for linear Diophantine equations: EMAS algorithm and Contejean algorithm.2. In chapter three, the DLU and IILX algorithms for linear Diophantine equations are given based on the ABS algorithms.

第三章在ABS算法的基础上给出了求解线性丢番图方程组的整隐式LU算法和整隐式LX算法，讨论了相应的ABS性质，并讨论了复杂性分析及其应用。

Associated with the analysis of the new algorithm in pure coning environment, general expression of rotating vector in the new algorithm is given, and the basic and optimized algorithm of the new coning compensation algorithm are deduced.

在分析经典圆锥运动误差基础上，给出了新算法的旋转矢量通式，并推导了这类圆锥补偿基本算法及其优化算法补偿系数通式。

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

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

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。