最小图

Hence the associated surface of minimum genus can be got by doing a sequence of exchangers on some associated surface.

通过对任一关联曲面作一系列调位，从而可得最小亏格的关联曲面，此亏格即为所求图类的最小亏格。

The restricted edge connectivity is an important measure of fault-tolerance for interconnection networks.

一个图是超级限制边连通的，如果它的任一最小限制边割都孤立一条有最小边度的边。

As the result of using Euclidean norm metric, the performance of traditional FCM clustering algorithm is subject to the structure of sample patterns in feature space.

一是针对SAR图象，提出了基于混合偏移Rayleigh分布假设的最小误差算法；二是针对低质量图象，提出了基于散射图SEM估计的MAP聚类算法。

Based on the first and second law of thermodynamics, entropy generation theory is applied to establish vortex tube model.

根据热力学定律，采用最小熵产分析方法，建立了涡流管的热力学模型，得出了产生所需冷热端温度同最小压比之间的函数关系，并在h—s图上表示出涡流管能量分离热力过程。

It is proved that the problem of determining whether there is a Hamiltonian path from a specified vertex s to another t on a given digraph can be reducible at polynomial time to the problem of constructing a minimum spanning flow in a two-terminal extended network Ns,t, with the unit capacity for all arcs.

在此基础上，利用网络最小生成流的概念提出了一个修正模型，并证明了无环最小生成流问题可以在多项式时间内转换为哈密顿圈问题。文中最后指出，这一新的模型为解决在有向图内构造哈密顿轨的有效算法提供了一个新的思路和方法。

The hierarchical structure of the retrieval strategy is analyzed to reach the real-time and retrieval accuracy requirement. A trademark image database system under hierarchical scheme is implemented: the string-matching method is first used to reduce the image search scope under man-machine interaction, then smallest enclosed rectangle and Hausdorff distance metric are used to measure the similarity between trademarks under image region normalization and transform invariance.

2分析了层次结构的检索策略以解决图象检索的实时性要求和准确性要求，并实现了一具体商标库检索系统的层次检索方法，在人机交互方式下，用字符串匹配方法减少图象搜索范围；在图象区域规格化下，用最小约束距和Hausdorff距离度量商标相似性，并实现了变换不变性。

Setting forth the realization method by hardware for searching minimal cutset of a graph with N-SearCut model. Then this method affords theory and practice fundament for solving this puzzle of searching for minimal cutset in reliability evaluation of power system.

提出了运用N-SearCut神经网络模型搜索图最小割集的全硬件实现方法，为更理想地解决网络可靠性评估中出现的最小割集搜索这一瓶颈问题提出了新的思路，提供了理论和实践依据。

It is shown that every minimum geodetic set of a graph does not contain its cut-vertices, and if G is a block graph with n≥3 vertices and k≥1 cut-vertices,then g=n-k.

图的每个最小测地集都不包括它的割点，如果图G是一个有n≥3个顶点，k≥1个割点的块图，那么g=n-k。

After convolving the image model with the edge detection operators of second derivative model, a plane fitting in the least squares sense is used to detect the zero crossing points as edge points.

使用二阶导数型边缘检测算子对图象模型进行卷积后，用均方误差最小的准则对卷积后的图象进行平面拟合，并求出零交点作为图象的边缘点。

By using Hamilton graph ,the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.

运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。