割点

如果一个图是不连通的或有割点，就发生这种情况。

This happens if the graph is disconnected or has a cutvertex .

三次曲线的切线割点AB线比CD线长三倍。

Tangental point of a cubic Line AB is three times longer than Line CD .

利用块割点树计算六环螺链的Wiener指标

Computing the Wiener index of Six-membered ring spiro chains using block-cut-vertex tree

本文讨论了具有k（k≥2）个割点，并且所有割点均分布在一个2-连通Euler图的标号Euler图的计数。

This paper discusses the enumeration of labeled Euler graphs with k ( k ≥ 2 ) cut vertices distributed only on one 2 connected Euler graph .

在这里给出了含有n个2-连通Euler图和k（k≥2）个割点，并且所有割点均分布在其中一个2-连通Euler图的标号Euler图的指数型生成函数。

In this paper we give the exponential generating function for labeled Euler graphs having exactly n 2 connected Euler graphs and the k ( k ≥ 2 ) cut vertices distributed only on one 2 connected Euler graph .

当泡蛋白截割点含量为143μg/ml时，该ELISAKit诊断胆固醇性胆石症的敏感度、特异度和符合率分别为85%、90%和88%，ROC曲线下面积值高达096。

When the optimal cut-off point was 143 μ g / ml , the sensitivity , specificity and accuracy of the ELISA kit was 85 % , 90 % and 88 % for detecting cholesterol gallstone and the maximal area under the ROC curve .

合理聚类割点确定的∧方法

An a method for determining reasonable cutting point in cluster analysis

通过分析非平稳割点，算法的有效性被改进。

The efficiency of the algorithm is improved by analyzing non-stable cut points .

三次曲线的切线割点三维折线图。带有三维效果的折线图

Tangental point of a cubic 3-D Line . Line with a 3-D visual effect

然后利用遗传算法全局、并行搜索的优点，以上面提到的3个因素作为启发信息对所有条件属性的割点集合进行最优搜索。

Then utilize the overall search of genetic algorithm to find the optimized cut points .

用广度优先搜索求割点和块的算法研究

A study of the algorithm for finding cut - vertex and block using breadth-first search

所有割点都在一个块上标号有向连通图的计数

Enumeration of Labeled Oriented Connected Graphs that all of Cut Vertices are in Same Block

三次曲线的切线割点

Tangental point of a cubic

考虑可以分解为有限群带割点有限图上的随机游动。

A random walk on a graph with congestion points is considered , which can be decomposed into finite groups .

根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。

The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block .

通过引进新的非平稳割点定义，提出了改进的区间值属性决策树学习算法，改进后学习算法的效率有很大程度的提高。

A improved learning algorithm of decision tree generation for interval-valued attributes is presented , and after improving , the efficiency of the algorithm is strongly improved by defining new no-stable cut points .

尤其在用遗传算法进行最优割点搜索时，每一次遗传进化迭代，都必须为种群中的每一个体计算其编码所代表的一致性水平，这样大大影响遗传算法的执行效率。

Especially when we search for the optimum cut points with the genetic algorithm , each change of cut points set will involve calculating consistency level again , it influence the efficiency of algorithm badly .

采用割点和介数的双重指标分析了电网的静态脆弱性，并考虑连锁故障，采用故障节点数和故障后效率来评估网络的动态脆弱性。

This paper analyzes the static vulnerability of the electric power systems , using betweenness centrality and cutting-point the double indicators . Considering the cascading failures , adopts the number of failure nodes and network efficiency after failure to measure dynamic vulnerability .

通过运动学分析，建立了割刀各点的运动方程，并分析其运动性质。

Using the knowledge of kinematics , motion parameter equations of cutting knife is expressed , and their athletic characters are analyzed .

首先建立了机构的数学模型，通过两个垂直轴的旋转合成割炬的以割嘴为固定点的定心圆锥运动。

In order to overcome the above shortcomings , this thesis designs a new bevel-cutting mechanism . Firstly , the mathematical model is established .