算法论

Using the concept of Minimal Spanning Tree in Graph Theory, the proposed method merges the over-segmented regions produced by watershed algorithm.

该方法主要利用图论中的最小生成树，对分水岭算法产生的过度分割区域进行合并。

Using the concept of Boolean functions and combinatorics theory comprehensively, we investigate the construction on annihilators of Boolean functions and the algebraic immunity of symmetric Boolean functions in cryptography:Firstly, we introduce two methods of constructing the annihilators of Boolean functions, Construction I makes annihilators based on the minor term expression of Boolean function, meanwhile we get a way to judge whether a Boolean function has low degree annihilators by feature matrix. In Construction II, we use the subfunctions to construct annihilators, we also apply Construction II to LILI-128 and Toyocrypt, and the attacking complexity is reduced greatly. We study the algebraic immunitiy of (5,1,3,12) rotation symmetric staturated best functions and a type of constructed functions, then we prove that a new class of functions are invariants of algebraic attacks, and this property is generalized in the end.Secondly, we present a construction on symmetric annihilators of symmetric Boolean functions.

本文主要利用布尔函数的相关概念并结合组合论的相关知识，对密码学中布尔函数的零化子构造问题以及对称布尔函数代数免疫性进行了研究，主要包括以下两方面的内容：首先，给出两种布尔函数零化子的构造方法，构造Ⅰ利用布尔函数的小项表示构造零化子，得到求布尔函数f代数次数≤d的零化子的算法，同时得到通过布尔函数的特征矩阵判断零化子的存在性：构造Ⅱ利用布尔函数退化后的子函数构造零化子，将此构造方法应用于LILI-128，Toyocrypt等流密码体制中，使得攻击的复杂度大大降低；通过研究(5，1，3，12)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫，证明了一类函数为代数攻击不变量，并对此性质作了进一步推广。

In this paper, the above, in order to focus on analysis of bank customers object, the use of queuing theory algorithms, databases and other knowledge, is designed and implemented a multi-window, multi-service management, multi-lingual support, real-time monitoring of the queuing system.

本文针对以上情况，以银行客户为重点分析对象，利用排队论的算法，数据库等知识，设计并实现了一种具有多窗口，多业务管理，多语种支持，实时监控的排队系统。

Unnecessary code in order to use a simple algorithm, not to mention namespace

不必要的代码，以便使用一个简单的算法，更遑论空间

The former firstly establishes state graph of power system, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffering greatly from the outages of overload lines through simple calculation of matrix.

前者根据实时网络拓扑结构和潮流分布状态，在对初始电力网络简化、分区的基础上，利用有向图的邻接矩阵与路径矩阵，通过简单的矩阵运算，快速识别出与过载线路相关的关键输电断面；后者直接利用系统各支路的阻抗，从图论算法的基本思想出发，搜索最易遭受大负荷转移的关键传输路径，从而将安全性分析目标从整个网络缩小到某些关键的输电线路。

The former firstly establishes state graph of power system, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffered greatly from the outages of overload lines through simple calculation of matrix. In the latter, the minimal short transmission path, the length of which is calculated with line impedance, is determined with graph theory to focus on security analysis objects from the whole network to some key transmission lines.

前者根据实时网络拓扑结构和潮流分布状态，在对初始电力网络简化、分区的基础上，利用有向图的邻接矩阵与路径矩阵，通过简单的矩阵运算，快速识别出与过载线路相关的关键输电断面；后者直接利用系统各支路的阻抗，从图论算法的基本思想出发，搜索最易遭受大负荷转移的关键传输路径，从而将安全性分析目标从整个网络缩小到某些关键的输电线路。

In this paper, we propose a two-stage clock routing algorithm for λ-geometry plane.

在本论文中，我们提出一个在λ平面两阶段的时钟绕线演算法。

To the condition of deviation from side path when vehicles are turning and braking, according to the deviation distance, the control strategies and control algorithms of vehicle braking stability by two control methods, yaw moment and active steering, are determined. The fuzzy controller are designed whose outputs can be adjusted online according to the variation of slip rate and dynamic proportionality factor. The simulation results prove that the method of fuzzy control which is based on the yaw meoment and front wheel active steering can improve vehicle braking stability and ability of path tracking.

针对汽车在转弯制动时出现的侧向路径偏离状况，根据偏离量大小，利用横摆力矩和主动转向两种控制模式分别进行汽车制动稳定性控制，确立了两种控制模式下的控制策略和控制算法，设计了模糊控制器，根据轮胎最优滑移率变化状况，对模糊输出变量论域的大小按照动态比例系数进行实时在线调整，仿真实验验证了所提出的基于横摆力矩和前轮主动转向的模糊控制方法能提高汽车制动稳定性和路径跟踪能力。

It is feasible to apply queuing theory to quantitative analysis on outpatient charge service in the hospital.

证明运用排队论理论与算法估算医院门诊收费窗口的配置是可行的。

Two algorithms, graph cut and random walk based on graph theory, were applied to motion segmentation.

将两种基于图论的算法图切割与随机游走应用于运动对象的分割。

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.

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