查询词典 dual graph

This book in all 126 chapters, content involves cardiovascular disease foundation, not have achieve video learn, disease of valve of physiological, heart, aorta mixes report outside element of risk of week blood-vessel disease, coronary artery disease, cardiac muscle straightens dead, disease of heart and pericardium and pulmonary circulation disease, cardiac muscle and heart failure,, include 1400 plans, among them 483 are chromophotograph, kinetic draw writes down the radiative a collection of illustrative plates that covers electric physiology draw to write down image of graph, angiography, heart to be short of caustic and blood stream the graph.

该书共126章，内容涉及心血管疾病基础、无创影像学、电生理学、心脏瓣膜病、主动脉和外周血管疾病、冠状动脉疾病危险因素、心肌梗死、心脏和心包以及肺循环疾病、心肌病和心力衰竭、心脏药理学、有创及介入心脏病学等11个部分，包括1400幅图，其中483幅为彩色照片，涵盖电生理描记图、血管造影图像、心脏缺损的放射图谱以及血流动力学描记图等。

Processed coins' contour in our analysis of the experimental results, to the entire graphics coins overlap can be divided into the following three categories :(1) no overlapped circle in the graph,(2) have overlapped coins but have without the branches of points in the image,(3) have any branches in the graph, therefore, because of different circumstances should be directed to a process.

处理好的钱币轮廓依照我们实验分析的结果，将整张图形的钱币重叠情况分为下列三类：(1)无任何交叠的圆，(2)与其他钱币有交叠但无分歧点的图形，(3)图形内有分歧点者，因此，因应不同之情形有其针对的处理程序。

By using the character of Cayley graph, we establish the tight upper and the lower bounds of forwarding index for circulant graph.

利用循环图是Cayley图的性质，获得循环图的点转发指数和边转发指数紧的上界和下界。

The graph cliping algorithm is the basis of computer graphics algorithms.The graph cliping algorithm is good or not directly influence entire graphics system's performance.

图形裁剪算法是计算机图形学的基础算法，图形裁剪算法的好坏，直接影响到整个图形系统的性能。

It also constructs a lattice graph of frequent closed itemsets and generates association rules base on lattice graph.

GRG构造频繁项集的格关系图并在它的关系上生成关联规则。

X→Y has a closed graph are provided,and the classical closed-graph theorem is generalized.

本文给出了算子T具有闭图象的一些等价条件，并推广了经典的闭图象定理。

The new algorithm constructs an association graph to represent the frequent relationship between items, and recursively generates frequent closed itemsets based on that graph.

GRG算法构造关联图代表频繁项之间的频繁关系，并递归地从关联图中产生频繁闭项集。

The paper provides a method,which can automatically search next path of outline based on clockwise tread and search next path of closed graph based on counter－clockwise tread.The method improves the ancient method and increases graph making efficiency and intelligentize of CAD system.

该文提出基于顺时针行走方向搜索外轮廓下一条路径和基于逆时针行走方向搜索封闭图形下一条路径的原理和算法，改进了以往算法的不足，对提高CAD系统的图形生成效率以及系统的智能化程度等方面有着重要的意义。

Meanwhile, the experiments show that the multi-level swarm intelligence refinement algorithm is better than the multi-level tabu search refinement algorithm, especially in view of the probability that the approximate global minimum partition of the coarser graph may be the local minimum partition of the finer graph. Furthermore, the experiments show that the multi-level ant colony optimization refinement algorithm achieves more performance improvement than the multi-level particle swarm optimization refinement algorithm, using the gain of vertex more effectively.

实验数据反映出，针对最小图上的全局最优剖分可能是初始图的局部最优剖分、粗化图上的全局最优剖分可能是细化图的局部最优剖分的情况，基于群智能的多水平迁移优化算法相比基于禁忌搜索的多水平迁移优化算具备更强的逃离局部最优的能力；基于蚁群的多水平迁移优化算法相比基于微粒群的多水平迁移优化算法，对收益值的启发信息更为有效地利用，取得最佳的性能改进。

Let G be a double-outer plane graph, V, E, F be the set of points, edge and face, a plane graph G is k-total colorable, if the elements of V E can be colored with K-colors, any two distinct adjacent or incident elements receive different colors.

设G是一个双外平面图，V，E，F分别为双外平面图G的点集，边集和面集。G的全色数X是使得V∪E中的任意两个相邻或相关联的元素间均染不同颜色的最少颜色数。

Diabetes is a social disease that affects several million people worldwide.

糖尿病是一个社会性疾病，全世界有数百万人罹患此病。

I'll call you on Friday to see if we can reschedule our luncheon meeting at your convenience.

我星期五会给您打电话在您方便的时候我们重新安排我们的午餐约会。