在算法上

The paper first presents an objective model of task scheduling,and then based on the analysis of Q learning algorithm,the Markov decision process description of the scheduling problem is given.

首先建立任务调度问题的目标模型，在分析 Q学习算法的基础上，给出调度问题的马尔可夫决策过程描述；针对任务调度的 Q学习算法更新速度慢的问题，提出一种基于多步信息更新值函数的多步 Q学习调度算法。

For the purpose of solving the shortest path problem between any two nodes on urban traffic networks, We present a mixed connected graph representing the urban transportation networks, and choice set of main line is proposed in our disertation, according to urban road layout and rule of vehicle rout, we supposed a multi-phase labeling algothrim base on classical Dijskra labeling algorithm, a list of examples for all possible relation between two nodes are provided, all the examples is calculated by the proposed computer program, which indicates that this algorithm is feasible and effective.

为了研究城市路网上任意两顶点间的最短路问题，结合城市交通特点提出了最小干线选择集的概念，在著名的Dijkstra算法基础上，根据城市路网布局和配送车辆行车规则，给出一种多阶段定向搜索标号算法。

We present a SNMP-based topology discovery algorithm using direct connection theorem and simple connection theorem for judging relationship of switches in subnets. In order to in discover the map of network without SNMP, several key problems such as subnet guessing and multi-address routers are discussed in details. And then a topology discovery algorithm based on primitive protocols is presented. We also deeply study some routing protocols such as OSPF and BGP and propose a routing-protocols-based algorithm for topology discovery.

基于判断交换机互联的直接连接定理和间接连接定理，提出了一种完整的基于SNMP的拓扑发现算法；详细讨论了子网获取、多址路由器处理等关键问题，针对不同的网络环境给出了相应的解决方案，并以此为基础提出了一种基于通用协议的拓扑发现算法；在对OSPF，BGP等网络路由协议进行分析的基础上给出了一种基于路由协议的拓扑发现算法，并设计了一个自上而下的拓扑发现框架结构。

On the design of algorithms, a novel exact hierarchical delay analysis method for general circuits is proposed; based on the sensitization theorem for sequential circuits, an exact minimizing clocking method is proposed; based on Boolean process, a waveform simulation method considering interconnecting delay for logic circuit and a parallel waveform simulation method are proposed; a new method that transforms bit-level waveform polynomial to word-level polynomial model is proposed; a multiple valued synthesis algorithm based on multiple valued Boolean process and a wire-centered delay synthesis policy are proposed, in which timing planning, floorplanning, wire planning and optimal clock skew in early design are considered; a two-layers channel routing method for minimizing crosstalk under grid mode is proposed; based on the transition numbers theorems for waveform polynomial, a new method for generation of test with noise effects is proposed.

算法设计方面，提出了一种精确的通用电路层次化延时分析方法；基于时序电路的敏化定理提出时序电路最小时钟周期精确确定方法；提出基于Boolean过程论的考虑互连延迟的逻辑电路波形模拟方法，在分析了波形模拟适合并行化基础上，进一步提出一种并行波形模拟算法；提出一种将位级电路波形多项式描述转化成字级多项式描述的新方法；提出一种基于多值Boolean过程的多值电路综合算法以及一种将前期设计定时规划、前期设计的布局规划和线网结构化方法及低偏移的时钟分配等技术相结合的面向互连延时的综合策略；提出一种串绕最小化的网格模式下的双层通道布线方法；从波形多项式描述跳变数的定理出发提出了一种考虑噪声效应的测试生成新方法。

In this paper, myopic task schedule algorithm has been developed based on original task schedule algorithm, and its behavior has been simulated and its efficiency has been analyzed.

本文在普通任务调度算法的基础上提出了近视眼任务调度算法，并对近视眼任务调度算法进行仿真实现和性能分析。

In light of the convergence theorem obtained in Chapter 2, a result on topology preservation of 2-dimensional SOM algorithm with continuous inputs is given. In Chapter 4, an equivalence relation on n dimensional Euclidean space, called equi-action relation, is introduced and a number of properties on this relation are studied.

指出了已有的有关SOM算法拓扑保序定义的缺陷，并在此基础上，给出了一个具有连续输入的二维SOM算法的拓扑保序新定义；利用第二章中的收敛性定理，我们进而获得了一个具有连续输入的二维SOM算法的拓扑保序性定理。

The experimental results show that this method is simple,which not only overcomes the disadvantages of normal alarm correlation ways,but also improves the dynamic character,training accuracy and efficiency greatly than BP algorithm,BGA algorithm and AGA algorithm do.

实验表明，这种方法可克服一般告警相关性分析方法的局限，不仅简单，而且在网络学习和训练效率上也高于传统的BP算法，标准遗传算法和一般的自适应遗传算法。

Based on the research on the min-cut partition problem, the author presents an improved KLFM partition algorithm and a graph partition algorithm based on simulated annealing.

在此基础上，本文对最小割划分算法进行深入研究，提出了改进的KLFM划分算法和基于模拟退火的逻辑图划分算法。

The other often used algorithm of association rules is Frequent Paten Growth which do not produce candidate itemsets and improve the efficiency a lot.Algorithms of association rules are based on transaction database.

关联规则发现的另外一个常用的算法频繁模式增长算法是一种不产生候选集挖掘频繁项集的算法，在执行效率上有了很大的提高。

In Chapter 3,we classify a binary-coded individual space equivalently withthe help of the ideals of Boolean algebra and analyze the search capabilitiesof a new kind of algebraic crossover operator in these equivalence classes,thenprovide the algebraic representation of a type of genetic algorithms by usingthe permutation group,therefore we can derive a lot of new forms of geneticalgorithms.

第三章运用Boole代数的理想将二进制编码的个体空间进行等价分类，分析了一类代数杂交算子在这些等价类上的搜索能力；然后利用置换群给出一类遗传算法的代数表示，由此导出多种新形式的遗传算法，并给出其中两类算法形式的收敛性结果。

But we don't care about Battlegrounds.

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

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

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