结构化活动结点的子图支持
图的直系子图是由返回的子模型对象列表确定的。
The diagram's immediate children are determined by the list of child model objects returned.
实现此目的最简便方法之一就是创建一个子图，并将图像和标签放在子图中。
One of the easiest ways to do this is to create a subgraph and place both the image and the label inside the subgraph.
清单4中的行1定义了名为 cluster_jhuapl.edu 的子图。
Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.
DB 2Intelligent Miner的有用功能之一是能够在这个网络中寻找强连接的子图。
One of several useful features of DB2 Intelligent Miner is that it finds strongly connected sub-graphs within this network.
提出了一种基于关联矩阵的频繁子图挖掘算法。
An algorithm for mining frequent subgraphs based on associated matrix was proposed.
若图G含有生成欧拉子图，则称G是超欧拉的。
A graph G is supereulerian if G has a spanning eulerian subgraph.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Frequent subgraph mining includes subgraph search and isomorphism problems.
研究了森林图的子图：邻接森林图和叶交换森林图。
The subgraphs of a forest graph, such as adjacent forest graphs and leaf exchange forest graphs, are studied.
做工精致细腻的红色床帘和喜被上面刺绣的都是百子图。
The delicate and exquisitely embroidered bed curtain and quilt both feature a hundred playing children.
提出了基于二维直方图分析的二元子图微光图像增强处理算法。
A novel image enhancement technique suitable for low light level image, dualistic sub image enhancement based on two dimensional histogram analysis and histogram equalization, is presented.
最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
Finally, for the spectral radius of a graph with a cut vertex, we give an inequality concerning the spectral radius of the graph and its subgraphs.
随着图的广泛应用，图的规模不断扩大，因此提高频繁子图挖掘效率势在必行。
Therefore it is imperative to improve the efficiency of mining the frequent subgraphs.
通过对字符图像的小波分解子图求取网格特征向量，构造出字符的小波特征向量。
Grid feature vector, belonging to the wavelet decomposition sub graph which got by character image wavelet transform, is used to construct character wavelet feature vector.
该算法首先搜索得到与所有查询关键字相关的中心节点，再通过中心节点搜索连接成子图。
This algorithm firstly searches for the central node of the query keywords, and then searches for the keyword nodes through this central node to construct the subgraph.
对人脸图象作正交小波变换，得到它在不同频带上的四个子图象，然后分别提取奇异值特征。
We do orthogonal wavelet transform of a face image, get its four sub images of different frequency bands, then respectively extract their singular value features.
虽然也有不少研究关注网络编码应用中的优化问题，但都侧重于求解最小代价多播子图问题。
Although a few researches have discussed the optimization problem under network coding scenario, their aim is to seek minimum-cost multicast sub-graph.
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.
该文简要介绍图的连通子图、图的最大团、图的完美匹配及图谱法在蛋白质结构预测中的应用。
The paper briefly introduces some graph theory methods such as maximal connected subgraph, maximal cliques, perfect match and graph spectral research which applied in prediction of protein structure.
一个图G中所含的三结点连通导出子图的个数记为S_3（G），它在网络可靠性中起着重要作用。
The number of 3-nodes connected induced subgraphs S3(G) in a graph G plays a important role in the reliability of a network.
一种解决的方法就是用图的形式表示这些领域的事务，然后利用基于图论的数据挖掘技术发现频繁子图。
An alternate way to solve these problems is to represent the transactions of those domains by graph, and find the frequent subgraphs by using graph-based data mining techniques.
随着对大量结构化数据分析需求的增长，从图集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。
With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.
该算法首先搜索得到与查询关键字匹配的关键字节点，再由这些关键字节点的中心节点将它们连接成子图。
This algorithm firstly searches for the matching keyword nodes of the query keywords, and then Bridges these keyword nodes through the central node of them to construct the subgraph.
本文研究和分析了电路设计子图搜索算法的设计思路，提出了一种新的基于电路特征分析的电路设计子图搜索算法。
The paper studies circuit design subgraph search algorithm and puts forward a new search algorithm that bases on circuit character.
结构检索方法建立在图子图匹配算法VF 2的基础上，对其进行了必要的改造和扩展，使之适合于化学结构检索。
The VF2 graph matching algorithm on which the chemical structure search system was based has been modified and extended appropriately.
清单1显示了一个样本内容EditPart，它创建了一个不透明类型的图形，后者将使用XYLayout定位其子图。
Listing 1 shows a sample contents EditPart that creates an opaque figure that will position its children using the XYLayout.
它的图形应该为不透明类型(opaque)，并且应当利用布局管理器进行初始化，该布局管理器将对图的子图进行布局。
Its figure should be opaque and should be initialized with the layout manager that will layout the diagrams' children.
本文说明传统的并行技术可以有效地开发循环中的子字并行性，同时提出一种基于代价子图的子字并行指令自动识别的方法。
This paper shows that the traditional parallelization techniques can be used to exploit subword parallelism, and also proposes a novel method to extract subword parallelism based on the cost subgraph.
针对这一问题，采用基于图的链接发现技术，利用频繁子图对资金交易图进行压缩，可以有效地侦测群体的异常资金交易结构。
Aiming at this problem, graph based link discovery technology, which compresses the fund exchange graph by frequent subgraphs, can detect the criminal pattern of groups with illegal fund exchanges.
证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。
In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.
应用推荐