查询词典 dual graph

That is, network coding has a larger rate region in a multicast CIOQ switch. Moreover, the graph-theoretic characterization was given out. With the concepts of stable set polytope from the enhanced conflict graph, it is pointed out that computing the offline schedule can be reduced to certain graph coloring problems.

文章证明了对一个流中的分组进行线性网络编码可以承载不允许网络编码时不能够承载的交换流量模式，也就是说，网络编码允许CIOQ交换结构在实现组播服务时有更大的速率区域，并给出了基于图论方法的描述。

It is advisable that Chinese summary is controlled with 300 words, english summary should agree with meaning of Chinese summary article, with 200 substantival and advisable. 5, graph, watch is followed civil appear, have axiomatic sex, graph with necessary in the limit of, avoid by all means and literal content repeat, it is clear that line of value of coordinate of graph Chinese word, symbol, freely, mark value must be written, mark eye should use standard physical quantity and unit symbol, form is used 3 lines...

中文摘要以300字左右为宜，英文摘要应和中文摘要文意一致，以200个实词为宜。5、图、表随文出现，有自明性，图以必要为限，切忌和文字内容重复，图中文字、符号、纵横坐标值、标值线必须书写清楚，标目应使用标准的物理量和单位符号，表格采用三线。。。

The concept"attachable graph"and the enumeration method of pates and circuits on the graph are proposed. With the graph, the gear arrangement problem can be solved. The new method and procedure of GLM type synthesis are presented. With general type synthesis method, Attachable Linkage Kinematic Chain could be generated.

用一般平面连杆运动链类型综合的方法可生成ALKC，然后通过在ALKC上配置齿轮模块得到NGLKC，再在NGLKC上用一定方法设置焊点生成WGLKC，进而选取机架和原动件，即可完成GLM的类型综合。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

In this paper, firstly, the embeddability of near-triangular graphs on the orientable surface is studied. By using Petersen's Theorem about 1-factor, we first prove that for a near-triangulation on the orientable surface, its geometry dual graph has a 1-factor; then after a procedure of operation leaded by the 1-factor, we show that if a graph G triangulates some orientable surface S_g, then G has a near-triangular embedding in S_h for h = g,g + 1,...,β(G/2」, where β is the Betti number of G. Hence we obtain a conclusion: A near-triangulation of the orientable surface is upper-embeddable. As a generalization, a class of near-quadrangulation is studied, and similar results are obtained.

本文首先研究了近三角剖分图的可定向曲面嵌入性质，通过运用Petersen关于1-因子的定理，首先证明了对于可定向曲面上的三角剖分图，其几何对偶图具有1-因子；然后在1-因子的导向下，通过做一系列增加亏格的手术，证明了如果一个图G三角剖分可定向曲面S_g，那么G可以近三角剖分可定向曲面S_h，这里h=g，g+1，…，「β(G／2」，β是指图G的Betti数，从而得出推论：可定向曲面上的三角剖分图是上可嵌入的，作为推广，又研究了一类近四角剖分图的可定向曲面嵌入性质，并得到类似的结论。

The model was preprocessed to assure the regulation of facets, create the dual graph of it, and then adapt Reeb Graph to extract the skeleton which contains enough information of the model, such as gesture and topological features, to be able to be used as descriptor of 3D model retrieval.

通过对模型进行一定的预处理保证面片的规则，定义面片间距离计算方法，创建模型的对偶图，识别连通分量，在连通分量上应用Reeb图的计算思想抽取原模型的骨架。试验表明，该算法具有较好的计算效果和效率，最终的骨架保存了模型的拓扑连通性以及姿态，可用于基于内容的三维模型检索时的特征描述符。

According to the Marr's visual theory, a novel face image presentation model, dual attribute graph , is put forward in the thesis. Each node of the graph has two attributes, local principal component coefficient and Gabor coefficient. So the presentation of face image can be converted from gray level to more high level.

根据Marr的视觉表示理论，本文提出了新的人脸图象表示形式---双属性图表示，属性图中每个节点有两个属性特征，局部主成分系数特征以及Gabor系数特征；从而将人脸图象的灰度级表示，转化为更高一级表示。

A new method for understanding the construction of dual links has been developed on the basis of medial graph in graph theory and tangle in knot theory.

基于图论中反转中间图的方法和纽结理论中的缠绕理论，我们提出了构建对偶链环的新方法。

In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.

文中把图论里Edmonds定理的树花容量扩展为最小复盖点，并得到了计算非偶图最小复盖点数的公式。

Convex body; star body; Brunn-Minkowski inequality; dual harmonic quermassintegrals; dual affine quermassintegrals; dual mixed bodies; affine surface area; isotropic measure

基础科学，数学，几何、拓扑凸体；星体； Brunn-Minkowski不等式；对偶调和均质积分；对偶仿射均质积分；对偶混合体；仿射表面积；迷向测度

Through comparing with the results by simulation to study the effects of theprojectile"s final velocity, the angle of rotation and the ballistic trajectory"s migration withdifferent projectile"s rotating speeds, different target"s moving speeds and differentpenetration angles.

通过比较数值模拟的结果来研究不同弹头转速、目标速度、侵彻角对侵彻过程中弹头最终速度、翻转角度和弹道偏移的影响。

I love stationery and all the accoutrement of writing.

我爱文具以及所有的书写的工具装备。