有向图

Note that if not all of the streets are one - way,then we can obtain a digraph by drawing for each two - way road two directed edges,one in each direction.

请注意，如果并非所有的道路都是单行道，那么可以在图中为每一条双行道画两条有向边，各指一个方向。

Note that if not all of the streets are one-way,then we can obtain a digraph by drawing for each two-way road two directed edges,one in each direction.

请注意，如果并非所有的道路都是单行道，那么我们可以在图中为每一条双行道画两条有向边，每条边指明一个方向。

The term directed path, used in signal flow graphs, is identical to what we have called an elementary path.

信号流图中使用的有向路这个名词意义与以前定义的初等路一样。

In the second chapter, we study gracefulness of digraphs n ?

第二章研究了具有一个公共点的n个长为m的有向圈所构成的图n·？

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 success of star map match is judged according to compute the EMD distance of two stars.

针对现有的识别算法存在识别速度慢，识别成功率不高，提出了一种新的星图识别算法，该算法根据恒星星等，利用锚定的方法，使待识别星图中的星落于导航星图中的星的ε邻域，对于未落于ε邻域的星，建立有向赋权二部图，进行完美匹配，根据计算星对之间EMD距离，来确定星图的匹配是否成功。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

Thus given a positive integer N , by our algorithm we can find an abelian Cayley Digraph with degree 2 whose diameter is minimal.

因此， 对一个给定的正整数，用我们的算法可以找到一个直径最小的阿贝尔群上2度有向凯莱图。

For the same DAGs, the experimental results on random DAGs show that LSCBP algorithm can get less task-clusters (meaning less requirements for reconfigurable devices) and inter-cluster edges (meaning less communication costs) than CBP algorithm.

对随机生成的任务图(节点数小于250)的划分实验表明：对于相同的DAG，LSCBP算法能够比CBP算法获得更少的任务簇和簇间有向边。

MR imaging revealed an infiltrative enhancing epidural tumor at the dorsum of T2 to T5 levels with foraminal extension.

磁振造影图象发现－脑膜上的肿瘤位于胸椎第二到第五节部位并有向神经孔蔓延现象。

Singer Leona Lewis and former Led Zeppelin guitarist Jimmy Page emerged as the bus transformed into a grass-covered carnival float, and the pair combined for a rendition of "Whole Lotta Love".

歌手leona刘易斯和前率领的飞艇的吉他手吉米页出现巴士转化为基层所涵盖的嘉年华花车，和一双合并为一移交&整个lotta爱&。

This is Kate, and that's Erin.

这是凯特，那个是爱朗。