查询词典 connection graph

Firstly, this algorithm maps a given routing instance to the corresponding graph model, which is a kind of asymmetric grid graph suitable for BBL mode.

在本文中，我们在本教研室原来研究的基础上，就物理设计中BBL模式下典型的多端线网绕障碍布线问题，提出了一种基于生物仿生特性的蚁群算法，通过选择适当的图模型表述，该算法可采用蚁群任务调度策略，模仿蚁群的协同学习机制，来求解多端线网绕障碍的布线问题，并能给出较优的解。

When 〓 is the family of bipartite graphs,the 〓 capacityand the 〓 valency of a graph G are referred to as the biparticitydenoted by β(Gand the bivalencydenoted by 〓(Gof G respectively;when 〓 is the family ofgraphs whose components are complete bipartite graphs,the 〓 capacity and the〓 valency of a graph G are referred to as the complete biparticitydenoted byc(Gand the complete bipartite valencydenoted by 〓(Gof G respectively;andwhen 〓 is the family of star forests,the 〓 capacity and the 〓 valency of a graphG are referred to as the star arboricitydenoted by st(Gand the star valency ofG(denoted by 〓)respectively.

以v记图G的完全二部分解中顶点υ所关联的π中完全二部图的个数，记〓这里π取遍G的所有完全二部分解。我们称υ为G的完全二部次。对一般的图，当图的阶数充分大时，P。〓和L.Pyber给出了υ的一个上界，即，〓。F.R.K.Chung等人及Z.Tuza的结果说明这一上界是不可改进的。对υ的具体值，即使是对某些特殊的图类，结果也知之甚少。P.C.Fishburn和P.L.Hammer给出了一个相关的结果：当n≤16时，〓，（在υ的定义中，以完全二部覆盖替代完全二部分解，即得〓。同时他们提出了下述公开问题。问题1。〓=？

Second, mapping rules used to convert call-based connectors into component the connection directed graph are proposed.

隐式硬编码的基于过程调用构件连接束缚构件集成的灵活性，且存在的死锁连接造成软件可靠性隐患问题。

In simulation calculation part, we applied graph theory to describing connection of component and node. We designed estimate arithmetic of shut loop with power, preferences arithmetic of simulation calculation.

在该单元中，采用图论的方法表述电路图中元器件和节点的连接关系，设计了有源闭合回路判定算法和仿真计算参数生成算法。

The goal is to simplify the neural-computing of biovision process modeled inthe Boundary Contour System of FACADE theory, and to extract subjective contour in.a new way. The procedure consists of DOG filtering, cooperative filtering,post-processing of cooperative cues and regrouping of endpoints, corresponding to theoriented edge filtering by simple cells, cooperative filtering by bipole cells and end-stopeffect formulated by hypercomplex cells in biovision system respectively. The last oneis an algorithm based on connection relation graph, which judges whether two keypoints should be connected according to their positions and orientations and thenconnect the key points that Should be connected to complete the subjective contour.

本文主要完成了以下工作：一是针对张量投票方法处理主观轮廓时出现的问题进行了改进，并依据矩阵的特征值摄动理论分析了该方法误差产生的原因以及迭代对其影响；二是用图像处理方法代替FACADE理论中复杂的细胞动力学方程，提出了一种基于视觉竞争合作机制的轮廓组织及缺口修复算法，该方法通过DOG滤波器组、合作滤波器组和张量投票等方法分别模拟视觉系统中的简单细胞有向滤波、双极细胞合作滤波和终端截断后端点重组等主观轮廓形成过程；三是提出了一种基于可连接关系图的算法解决轮廓组织及缺口修复问题，该方法在轮廓特征提取的基础上，根据关键点的位置和取向信息判断其可连接关系，进而连接具有可连接关系但没有实际连接的关键点，最终完成轮廓缺口的修复。

The Hausdorff measure for the level sets of multi-parameter symmetric stable processes has been obtained and the inner connection of the measures and local times for it has been demonstrated, which describes the fractal nature for the level sets of this kind of processes. As we know, it is always one of the focuses in the field of random fractal. The reasult of the existence and continuity of the local time for multi-parameter stochastic processes with stable components has been got in the project. Then we gained the measure for the random fractal sets such as the range and graph of this kind of processes. Furthermore, a progress besides the mentioned above in the project is that we have resolved the multifractal analysis of the sample paths for Brownian sheet, that is the multifractal decomposition of white noise in high dimension.

解决了多指标对称稳定过程水平集的Hausdorff测度问题，同时给出N指标d维稳定过程水平集的Hausdorff测度下界的最佳估计，它们揭示了其水平集的测度与局部时之间的内在关系，刻划了多指标对称稳定过程水平集的分形特征，表明了研究此类问题的积极意义，该问题是随机分形研究领域的国内外学者所关注的热点问题之一；解决了多指标稳定分量过程的局部时存在性与连续性问题，进而解决了由多指标稳定分量过程产生的随机分形集--象集、图集的测度问题；此外，本研究项目还解决了布朗单样本轨道的重分形分析，即高维白噪音的重分形分析问题。

Diagonal mesh is a planar graph with fixed connection number per node.

对角网格是可平面图，其结构简单，可扩充性非常好。

Given a graph G representing a network topology, and a collection T ={(s1 , t1 )...} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem that consists in determining the maximum number of pairs in

给出图表G代表网络拓扑结构的和收藏品T ={(s1， t1)…}对端点在代表连接请求的G，最大值边缘弄乱问题是一个NP坚硬问题在确定包括对的最大数字的道路

Given a graph G representing a network topology, and a collection T ={(s1 , t1 )...} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem that consists in determining the maximum number of pairs inT that can be routed in G by mutually edge-disjoint si ti paths.

由于图G代表的网络拓扑，并且收藏笔=( S1及T1期……的顶点G大代表连接请求，最大边不相交的路径问题是一个NP-hard问题，它包括确定最多偶笔可以改为G大相互边相交硅钛路径。

Dismounts the electrically operated installment the box to cover and the wiring lid, penetrates the pilot wire cable and the holding wire from the coil in hole, the mortgage graph ticks the line cable core and the post the connection, afterwards withdraws from the mechanical spacing

3卸下电动装置的箱罩及接线盒盖，将控制线缆及信号线从进线孔穿入、按接线图将线缆芯和端子对号连接，之后退出机械限位

The second is to cut a mere 100 calories from your diet , which is the equivalent of a tablespoon of butter.

第二个就是从你的饮食中减少一百卡路里，只是相当于一大汤匙的黄油。

This is where the Rorschach test comes in.

现在，罗氏测试就出现了。