算法论

In this paper, according to the analysis of fluid supply pipe workhydraulic condition, using the graph theory basic loop, KCL and KVLand Bernoulli equation established hydraulic power work conditionmathematic model, settled the derivation of the mathematicmodel.

本文通过对流体输配管网的水力工况的分析，利用图论的基本回路法，基尔霍夫定律和伯努利方程建立了水力工况的数学模型，确定了求解数学模型的算法。

Frequency planning ; graph theory ; algorithm ; bipartite graph

频率规划；图论；算法；二分图

The reliability based on Boolean function and graph theory and mid relevance is analyzed.

用布尔函数与图论结合法和中等相关对串联系统进行可靠性分析，并给出误差分析，证明这两种算法精度高，便于运用。

In this thesis, we will mainly do research on the novel scheme for Digital image Steganography, Digital Image Secret Transmission in network and the development of the information hiding device for application. The main contributions of this thesis are as following: The novel conversion method for mapping image to complex number is proposed, and the plus, minus, multiply and complex conjugate operation of image are defined based on Positional number systems and complex number system. Following new results have been gotten: 1 The suitable complex number basis to be used to express integers is a big set. 2 Any image can be mapping into a one-to-one point. 3 Lots of image processing problem can be considered based on geometric theory.

在本论文中，研究工作集中在数字图像伪装算法的新模型、图像在网络中的加密传输的新方案和信息伪装设备的研发等三个方面，主要包括：基于位值制记数法和复数系理论，提出利用复数作为基底的数字图像新的表示方法，用复数运算定义了图像和图像间的"加"、"减"、"乘"、"共轭"等运算关系；得到理论结果： 1、能表示任何整数的复数基是很大的一个集合。2、任何一幅图像，都能和复平面上的一个点一一对应。3、可以将图像问题化归为平面几何问题处理。4、复数系下的图像表示适合用于信息伪装。

In this thesis, we implement a computational procedure to categorize and classify 3-D objects from their contour under a simple environment. First, we use foreground detection, Canny edge detection and speedy GVF snake to obtain the object's contour. The contour is then used to establish the object's features. Two databases are built using methods which compute similarity by modified aspect-combination algorithm proposed by Cyr and Kimia and new proposed aspect-combination algorithm. By using these two databases, we recognize 3-D objects using four recognition methods and compare their performance. Finally, a conclusion is made that our newly proposed algorithm is better than the modified algorithm proposed by Cyr and Kimia.

在本论文中，对一个在单纯环境下的三维物体，由撷取到辨识出此物体做了一个完整的实现，首先，利用前景侦测结合肯尼边缘侦测法和加速的梯度向量流动态轮廓侦测法，来得到物体轮廓，接著利用此轮廓找寻出物体的特徵，然后配合计算相似度的方法，代入修改后的Cyr and Kimia的外观结合演算法（aspect-combination algorithm）和新提出的外观结合演算法去建资料库，然后，对於三维物体则依据两种不同方法所建出的资料库，利用四种辨识的方法来辨识并比较其结果，最后得出新提出的外观结合演算法是优於修改后的Cyr and Kimia的外观结合演算法的结论。

Furthermore, a multi-container port bi-level programming model under the uncertainty conditions is established, and stochastic bi-level programming model is transformed into deterministic bi-level programming model according to random programming theory.

针对本文建立的双层规划模型，采用基于灵敏度分析的启发式算法S(来源：Ad1BC65论76文网www.abclunwen.com)AB求解。同时进一步建立了不确定条件下的双层规划模型，并且根据随机规划理论转化为确定型双层规划模型。

This kind of model is a connect chart abstractly , i.e., there is a line between any dot in the chart at least, which means that there are many roads from one point to another point in expressway, so the net structure chart is called "many roads chart".

1树状图清分算法主要利用矩阵论的方法，在路网模型的基础上，根据其物理结构和路段收费规则的一些参数，生成该路网的收费数据清分表，可计算出各业主所应分得的总费用。

In this paper we have derived a new SNR estimator for MPSK signals.

在这篇论文中，我们得到了一种对于MPSK信号的新的信噪比估计算法。

It studies the transforms of factor space on domain, anddesigns the algorithm to get the m-minimum identification factor.

研究了论域上因素空间的变换的性质，并设计了m-极小识别因素的构造算法。

Since the number of parameters is very finite game theory is introduced to portray the discriminant in speech recognition and thus continuous loss function is unnecessary.

由于该算法引入的参数较少，作者引入了对策论的相关知识描述了语音识别中的模式区分问题，从而使得连续损失函数不再必要。

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.

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